From 44e5f9b86992d6aedb37ab61d989305d941da78e Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Wed, 1 Nov 2023 12:41:28 +0100 Subject: [PATCH 01/40] adding the multiclass tests --- README.rst | 66 +- docs/01c_consistency_checking.rst | 62 +- docs/02b_retina.rst | 28 +- docs/02c_ehg.rst | 2 +- docs/02e_skinlesion.rst | 4 +- docs/03_api.rst | 74 +-- ...k_1_dataset_unknown_folds_mos_acc_score.py | 4 +- ...t_1_dataset_unknown_folds_mos_acc_score.py | 2 +- mlscorecheck/__init__.py | 1 - mlscorecheck/aggregated/_evaluation.py | 2 +- mlscorecheck/aggregated/_experiment.py | 2 +- mlscorecheck/aggregated/_fold.py | 2 +- mlscorecheck/aggregated/_folding_utils.py | 39 +- mlscorecheck/aggregated/_generate_problems.py | 2 +- mlscorecheck/check/__init__.py | 20 +- mlscorecheck/check/binary/__init__.py | 17 + .../_check_1_dataset_kfold_som.py} | 25 +- .../_check_1_dataset_known_folds_mos.py} | 37 +- .../_check_1_dataset_unknown_folds_mos.py} | 49 +- .../_check_1_testset_no_kfold.py} | 34 +- .../_check_n_datasets_mos_kfold_som.py} | 26 +- .../_check_n_datasets_mos_known_folds_mos.py} | 21 +- ...check_n_datasets_mos_unknown_folds_mos.py} | 30 +- .../_check_n_datasets_som_kfold_som.py} | 23 +- .../_check_n_testsets_mos_no_kfold.py} | 22 +- .../_check_n_testsets_som_no_kfold.py} | 23 +- mlscorecheck/{ => check}/bundles/__init__.py | 0 .../{ => check}/bundles/ehg/__init__.py | 0 .../{ => check}/bundles/ehg/_tpehg.py | 10 +- .../{ => check}/bundles/retina/__init__.py | 0 .../{ => check}/bundles/retina/_chasedb1.py | 20 +- .../{ => check}/bundles/retina/_diaretdb0.py | 14 +- .../{ => check}/bundles/retina/_diaretdb1.py | 24 +- .../{ => check}/bundles/retina/_drishti_gs.py | 20 +- .../{ => check}/bundles/retina/_drive.py | 20 +- .../{ => check}/bundles/retina/_hrf.py | 20 +- .../{ => check}/bundles/retina/_stare.py | 20 +- .../bundles/skinlesion/__init__.py | 0 .../bundles/skinlesion/_isic2016.py | 10 +- .../bundles/skinlesion/_isic2017.py | 10 +- mlscorecheck/check/multiclass/__init__.py | 6 + .../_check_1_dataset_known_folds_macro.py | 0 .../_check_1_dataset_known_folds_micro.py | 0 .../_check_1_testset_no_kfold_macro.py | 89 +++ .../_check_1_testset_no_kfold_micro.py | 76 +++ mlscorecheck/individual/__init__.py | 1 - mlscorecheck/individual/_problem_generator.py | 53 +- mlscorecheck/scores/__init__.py | 2 + .../_calculate_scores.py | 40 +- mlscorecheck/scores/_multiclass_scores.py | 583 +++++++++++++++++ mlscorecheck/scores/_scores_standardized.py | 1 + notebooks/development/038_multiclass.ipynb | 606 ++++++++++++++++++ .../00_check_1_testset_no_kfold.ipynb | 418 ++++++------ .../10_check_1_testset_no_kfold_macro.ipynb | 209 ++++++ .../11_check_1_testset_no_kfold_micro.ipynb | 164 +++++ tests/aggregated/test_folding_utils.py | 35 +- tests/bundles/test_isic2016.py | 2 +- tests/bundles/test_isic2017.py | 2 +- tests/bundles/test_retina_chasedb1.py | 2 +- tests/bundles/test_retina_diaretdb0.py | 4 +- tests/bundles/test_retina_diaretdb1.py | 2 +- tests/bundles/test_retina_drishti_gs.py | 2 +- tests/bundles/test_retina_drive.py | 2 +- tests/bundles/test_retina_hrf.py | 2 +- tests/bundles/test_retina_stare.py | 2 +- tests/bundles/test_tpehg.py | 2 +- .../test_1_dataset_known_folds_mos_scores.py | 10 +- .../{ => binary}/test_1_dataset_som_scores.py | 8 +- ...test_1_dataset_unknown_folds_mos_scores.py | 6 +- .../test_1_testset_no_kfold_scores.py | 17 +- .../test_n_datasets_mos_kfold_som_scores.py | 14 +- ...t_n_datasets_mos_known_folds_mos_scores.py | 14 +- ...n_datasets_mos_unknown_folds_mos_scores.py | 10 +- .../test_n_datasets_som_kfold_som_scores.py | 8 +- .../test_n_testsets_mos_no_kfold_scores.py | 6 +- .../test_n_testsets_som_no_kfold_scores.py | 6 +- .../test_1_testset_no_kfold_macro.py | 66 ++ .../test_1_testset_no_kfold_micro.py | 69 ++ tests/individual/test_check_tptn_solutions.py | 4 +- tests/individual/test_problem_generator.py | 38 +- tests/individual/test_tptn_solutions.py | 3 +- .../test_calculate_scores.py | 23 +- tests/scores/test_multiclass_scores.py | 91 +++ 83 files changed, 2833 insertions(+), 650 deletions(-) rename {mlscorecheck/check => legacy}/_check_1_dataset_unknown_folds_mos_acc_score.py (96%) rename {tests/check => legacy}/test_1_dataset_unknown_folds_mos_acc_score.py (97%) create mode 100644 mlscorecheck/check/binary/__init__.py rename mlscorecheck/check/{_check_1_dataset_kfold_som_scores.py => binary/_check_1_dataset_kfold_som.py} (87%) rename mlscorecheck/check/{_check_1_dataset_known_folds_mos_scores.py => binary/_check_1_dataset_known_folds_mos.py} (78%) rename mlscorecheck/check/{_check_1_dataset_unknown_folds_mos_scores.py => binary/_check_1_dataset_unknown_folds_mos.py} (75%) rename mlscorecheck/check/{_check_1_testset_no_kfold_scores.py => binary/_check_1_testset_no_kfold.py} (79%) rename mlscorecheck/check/{_check_n_datasets_mos_kfold_som_scores.py => binary/_check_n_datasets_mos_kfold_som.py} (84%) rename mlscorecheck/check/{_check_n_datasets_mos_known_folds_mos_scores.py => binary/_check_n_datasets_mos_known_folds_mos.py} (89%) rename mlscorecheck/check/{_check_n_datasets_mos_unknown_folds_mos_scores.py => binary/_check_n_datasets_mos_unknown_folds_mos.py} (84%) rename mlscorecheck/check/{_check_n_datasets_som_kfold_som_scores.py => binary/_check_n_datasets_som_kfold_som.py} (86%) rename mlscorecheck/check/{_check_n_testsets_mos_no_kfold_scores.py => binary/_check_n_testsets_mos_no_kfold.py} (85%) rename mlscorecheck/check/{_check_n_testsets_som_no_kfold_scores.py => binary/_check_n_testsets_som_no_kfold.py} (85%) rename mlscorecheck/{ => check}/bundles/__init__.py (100%) rename mlscorecheck/{ => check}/bundles/ehg/__init__.py (100%) rename mlscorecheck/{ => check}/bundles/ehg/_tpehg.py (91%) rename mlscorecheck/{ => check}/bundles/retina/__init__.py (100%) rename mlscorecheck/{ => check}/bundles/retina/_chasedb1.py (95%) rename mlscorecheck/{ => check}/bundles/retina/_diaretdb0.py (96%) rename mlscorecheck/{ => check}/bundles/retina/_diaretdb1.py (96%) rename mlscorecheck/{ => check}/bundles/retina/_drishti_gs.py (95%) rename mlscorecheck/{ => check}/bundles/retina/_drive.py (96%) rename mlscorecheck/{ => check}/bundles/retina/_hrf.py (95%) rename mlscorecheck/{ => check}/bundles/retina/_stare.py (95%) rename mlscorecheck/{ => check}/bundles/skinlesion/__init__.py (100%) rename mlscorecheck/{ => check}/bundles/skinlesion/_isic2016.py (88%) rename mlscorecheck/{ => check}/bundles/skinlesion/_isic2017.py (93%) create mode 100644 mlscorecheck/check/multiclass/__init__.py create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py create mode 100644 mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py create mode 100644 mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py rename mlscorecheck/{individual => scores}/_calculate_scores.py (66%) create mode 100644 mlscorecheck/scores/_multiclass_scores.py create mode 100644 notebooks/development/038_multiclass.ipynb create mode 100644 notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb create mode 100644 notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb rename tests/check/{ => binary}/test_1_dataset_known_folds_mos_scores.py (91%) rename tests/check/{ => binary}/test_1_dataset_som_scores.py (89%) rename tests/check/{ => binary}/test_1_dataset_unknown_folds_mos_scores.py (95%) rename tests/check/{ => binary}/test_1_testset_no_kfold_scores.py (84%) rename tests/check/{ => binary}/test_n_datasets_mos_kfold_som_scores.py (90%) rename tests/check/{ => binary}/test_n_datasets_mos_known_folds_mos_scores.py (90%) rename tests/check/{ => binary}/test_n_datasets_mos_unknown_folds_mos_scores.py (92%) rename tests/check/{ => binary}/test_n_datasets_som_kfold_som_scores.py (87%) rename tests/check/{ => binary}/test_n_testsets_mos_no_kfold_scores.py (92%) rename tests/check/{ => binary}/test_n_testsets_som_no_kfold_scores.py (92%) create mode 100644 tests/check/multiclass/test_1_testset_no_kfold_macro.py create mode 100644 tests/check/multiclass/test_1_testset_no_kfold_micro.py rename tests/{individual => scores}/test_calculate_scores.py (50%) create mode 100644 tests/scores/test_multiclass_scores.py diff --git a/README.rst b/README.rst index daf9c10..733f753 100644 --- a/README.rst +++ b/README.rst @@ -39,9 +39,9 @@ Testing is as simple as the following example shows: the tested scores are incon .. code-block:: Python - from mlscorecheck.check import check_1_testset_no_kfold_scores + from mlscorecheck.check.binary import check_1_testset_no_kfold - result = check_1_testset_no_kfold_scores(testset={'p': 100, 'n': 200}, + result = check_1_testset_no_kfold(testset={'p': 100, 'n': 200}, scores={'acc': 0.9567, 'sens': 0.8545, 'spec': 0.9734}, eps=1e-4) result['inconsistency'] @@ -258,13 +258,13 @@ In the example below, the scores are artificially generated to be consistent, an .. code-block:: Python - from mlscorecheck.check import check_1_testset_no_kfold_scores + from mlscorecheck.check.binary import check_1_testset_no_kfold testset = {'p': 530, 'n': 902} scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - result = check_1_testset_no_kfold_scores(testset=testset, + result = check_1_testset_no_kfold(testset=testset, scores=scores, eps=1e-2) result['inconsistency'] @@ -278,7 +278,7 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - result = check_1_testset_no_kfold_scores(testset=testset, + result = check_1_testset_no_kfold(testset=testset, scores=scores, eps=1e-2) result['inconsistency'] @@ -295,14 +295,14 @@ In the example below, a consistent set of figures is tested: .. code-block:: Python - from mlscorecheck.check import check_1_dataset_known_folds_mos_scores + from mlscorecheck.check.binary import check_1_dataset_known_folds_mos dataset = {'p': 126, 'n': 131} folding = {'folds': [{'p': 52, 'n': 94}, {'p': 74, 'n': 37}]} scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -316,7 +316,7 @@ If one of the scores is adjusted, for example, sensitivity is changed to 0.568, .. code-block:: Python scores = {'acc': 0.573, 'sens': 0.568, 'bacc': 0.662} - result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -333,7 +333,7 @@ with a true positive and true negative configuration with the specified lower an scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6, 'bacc': 0.1, 'f1': 0.95} - result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, fold_score_bounds={'acc': (0.8, 1.0)}, scores=scores, @@ -353,7 +353,7 @@ For example, testing a consistent scenario: .. code-block:: Python - from mlscorecheck.check import check_1_dataset_som_scores + from mlscorecheck.check.binary import check_1_dataset_som dataset = {'dataset_name': 'common_datasets.monk-2'} folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} @@ -361,7 +361,7 @@ For example, testing a consistent scenario: scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - result = check_1_dataset_som_scores(dataset=dataset, + result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -375,7 +375,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan scores = {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - result = check_1_dataset_som_scores(dataset=dataset, + result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -389,12 +389,12 @@ In this scenario there are n different testsets, the classifier is evaluated on .. code-block:: Python - from mlscorecheck.check import check_n_testsets_som_no_kfold_scores + from mlscorecheck.check.binary import check_n_testsets_som_no_kfold testsets = [{'p': 405, 'n': 223}, {'p': 3, 'n': 422}, {'p': 109, 'n': 404}] scores = {'acc': 0.4719, 'npv': 0.6253, 'f1p': 0.3091} - results = check_n_testsets_som_no_kfold_scores(testsets=testsets, + results = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -406,7 +406,7 @@ If one of the scores is slightly adjusted, for example, ``npv`` changed to 0.626 scores['npv'] = 0.6263 - results = check_n_testsets_som_no_kfold_scores(testsets=testsets, + results = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -419,7 +419,7 @@ This scenario is analogous to the "n testsets without k-folding, SoM" scenario, .. code-block:: Python - from mlscorecheck.check import check_n_testsets_mos_no_kfold_scores + from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold testsets = [{'p': 349, 'n': 50}, {'p': 478, 'n': 323}, @@ -427,7 +427,7 @@ This scenario is analogous to the "n testsets without k-folding, SoM" scenario, {'p': 123, 'n': 145}] scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251} - results = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + results = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -439,7 +439,7 @@ If one of the scores is slightly adjusted, for example, ``sens`` is updated to 0 scores['sens'] = 0.6756 - results = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + results = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -452,7 +452,7 @@ Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except th .. code-block:: Python - from mlscorecheck.check import check_n_datasets_som_kfold_som_scores + from mlscorecheck.check.binary import check_n_datasets_som_kfold_som evaluation0 = {'dataset': {'p': 389, 'n': 630}, 'folding': {'n_folds': 5, 'n_repeats': 2, @@ -464,7 +464,7 @@ Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except th scores = {'acc': 0.631, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - result = check_n_datasets_som_kfold_som_scores(scores=scores, + result = check_n_datasets_som_kfold_som(scores=scores, evaluations=evaluations, eps=1e-3) result['inconsistency'] @@ -476,7 +476,7 @@ However, if one of the scores is adjusted a little, like accuracy is changed to scores = {'acc': 0.731, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - result = check_n_datasets_som_kfold_som_scores(scores=scores, + result = check_n_datasets_som_kfold_som(scores=scores, evaluations=evaluations, eps=1e-3) result['inconsistency'] @@ -489,7 +489,7 @@ This scenario is about performance scores calculated for each dataset individual .. code-block:: Python - from mlscorecheck.check import check_n_datasets_mos_kfold_som_scores + from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som evaluation0 = {'dataset': {'p': 39, 'n': 822}, 'folding': {'n_folds': 5, 'n_repeats': 3, @@ -501,7 +501,7 @@ This scenario is about performance scores calculated for each dataset individual scores = {'acc': 0.312, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, + result = check_n_datasets_mos_kfold_som(evaluations=evaluations, dataset_score_bounds={'acc': (0.0, 0.5)}, eps=1e-4, scores=scores) @@ -513,7 +513,7 @@ However, if one of the scores is adjusted a little (accuracy changed to 0.412 an .. code-block:: Python scores = {'acc': 0.412, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, + result = check_n_datasets_mos_kfold_som(evaluations=evaluations, dataset_score_bounds={'acc': (0.5, 1.0)}, eps=1e-4, scores=scores) @@ -529,7 +529,7 @@ In this scenario, scores are calculated in the MoS manner for each dataset, and .. code-block:: Python - from mlscorecheck.check import check_n_datasets_mos_known_folds_mos_scores + from mlscorecheck.check.binary import check_n_datasets_mos_known_folds_mos evaluation0 = {'dataset': {'p': 118, 'n': 95}, 'folding': {'folds': [{'p': 22, 'n': 23}, {'p': 96, 'n': 72}]}} @@ -539,7 +539,7 @@ In this scenario, scores are calculated in the MoS manner for each dataset, and scores = {'acc': 0.61, 'sens': 0.709, 'spec': 0.461, 'bacc': 0.585} - result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, + result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) result['inconsistency'] @@ -551,7 +551,7 @@ Again, the details of the analysis are accessible under the ``lp_status`` and `` scores = {'acc': 0.71, 'sens': 0.709, 'spec': 0.461} - result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, + result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) result['inconsistency'] @@ -573,14 +573,14 @@ Given a dataset and knowing that k-fold cross-validation was applied with MoS ag .. code-block:: Python - from mlscorecheck.check import check_1_dataset_unknown_folds_mos_scores + from mlscorecheck.check.binary import check_1_dataset_unknown_folds_mos dataset = {'p': 126, 'n': 131} folding = {'n_folds': 2, 'n_repeats': 1} scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, + result = check_1_dataset_unknown_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -593,7 +593,7 @@ If the balanced accuracy score is adjusted to 0.862, the configuration becomes i scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.862} - result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, + result = check_1_dataset_unknown_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -606,7 +606,7 @@ The following scenario is similar in the sense that MoS aggregation is applied t .. code-block:: Python - from mlscorecheck.check import check_n_datasets_mos_unknown_folds_mos_scores + from mlscorecheck.check.binary import check_n_datasets_mos_unknown_folds_mos evaluation0 = {'dataset': {'p': 13, 'n': 73}, 'folding': {'n_folds': 4, 'n_repeats': 1}} @@ -616,7 +616,7 @@ The following scenario is similar in the sense that MoS aggregation is applied t scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.343} - result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, + result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) result['inconsistency'] @@ -628,7 +628,7 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.9} - result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, + result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) result['inconsistency'] diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index d04ad88..15b736c 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -26,13 +26,13 @@ In the example below, the scores are artificially generated to be consistent, an .. code-block:: Python - >>> from mlscorecheck.check import check_1_testset_no_kfold_scores + >>> from mlscorecheck.check.binary import check_1_testset_no_kfold >>> testset = {'p': 530, 'n': 902} >>> scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - >>> result = check_1_testset_no_kfold_scores(testset=testset, + >>> result = check_1_testset_no_kfold(testset=testset, scores=scores, eps=1e-2) >>> result['inconsistency'] @@ -46,7 +46,7 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura >>> scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - >>> result = check_1_testset_no_kfold_scores(testset=testset, + >>> result = check_1_testset_no_kfold(testset=testset, scores=scores, eps=1e-2) >>> result['inconsistency'] @@ -63,14 +63,14 @@ In the example below, a consistent set of figures is tested: .. code-block:: Python - >>> from mlscorecheck.check import check_1_dataset_known_folds_mos_scores + >>> from mlscorecheck.check.binary import check_1_dataset_known_folds_mos >>> dataset = {'p': 126, 'n': 131} >>> folding = {'folds': [{'p': 52, 'n': 94}, {'p': 74, 'n': 37}]} >>> scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -84,7 +84,7 @@ If one of the scores is adjusted, for example, sensitivity is changed to 0.568, .. code-block:: Python >>> scores = {'acc': 0.573, 'sens': 0.568, 'bacc': 0.662} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -101,7 +101,7 @@ with a true positive and true negative configuration with the specified lower an >>> scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6, 'bacc': 0.1, 'f1': 0.95} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, folding=folding, fold_score_bounds={'acc': (0.8, 1.0)}, scores=scores, @@ -121,7 +121,7 @@ For example, testing a consistent scenario: .. code-block:: Python - >>> from mlscorecheck.check import check_1_dataset_som_scores + >>> from mlscorecheck.check.binary import check_1_dataset_som >>> dataset = {'dataset_name': 'common_datasets.monk-2'} >>> folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} @@ -129,7 +129,7 @@ For example, testing a consistent scenario: >>> scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som_scores(dataset=dataset, + >>> result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -143,7 +143,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan >>> {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som_scores(dataset=dataset, + >>> result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -157,12 +157,12 @@ In this scenario there are n different testsets, the classifier is evaluated on .. code-block:: Python - from mlscorecheck.check import check_n_testsets_som_no_kfold_scores + from mlscorecheck.check.binary import check_n_testsets_som_no_kfold testsets = [{'p': 405, 'n': 223}, {'p': 3, 'n': 422}, {'p': 109, 'n': 404}] scores = {'acc': 0.4719, 'npv': 0.6253, 'f1p': 0.3091} - results = check_n_testsets_som_no_kfold_scores(testsets=testsets, + results = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -174,7 +174,7 @@ If one of the scores is slightly adjusted, for example, ``npv`` changed to 0.626 scores['npv'] = 0.6263 - results = check_n_testsets_som_no_kfold_scores(testsets=testsets, + results = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -187,7 +187,7 @@ This scenario is analogous to the "n testsets without k-folding, SoM" scenario, .. code-block:: Python - from mlscorecheck.check import check_n_testsets_mos_no_kfold_scores + from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold testsets = [{'p': 349, 'n': 50}, {'p': 478, 'n': 323}, @@ -195,7 +195,7 @@ This scenario is analogous to the "n testsets without k-folding, SoM" scenario, {'p': 123, 'n': 145}] scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251} - results = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + results = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -207,7 +207,7 @@ If one of the scores is slightly adjusted, for example, ``sens`` is updated to 0 scores['sens'] = 0.6756 - results = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + results = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=0.0001) results["inconsistency"] @@ -220,7 +220,7 @@ Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except th .. code-block:: Python - >>> from mlscorecheck.check import check_n_datasets_som_kfold_som_scores + >>> from mlscorecheck.check.binary import check_n_datasets_som_kfold_som >>> evaluation0 = {'dataset': {'p': 389, 'n': 630}, 'folding': {'n_folds': 5, 'n_repeats': 2, @@ -232,7 +232,7 @@ Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except th >>> scores = {'acc': 0.631, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - >>> result = check_n_datasets_som_kfold_som_scores(scores=scores, + >>> result = check_n_datasets_som_kfold_som(scores=scores, evaluations=evaluations, eps=1e-3) >>> result['inconsistency'] @@ -244,7 +244,7 @@ However, if one of the scores is adjusted a little, like accuracy is changed to >>> scores = {'acc': 0.731, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - >>> result = check_n_datasets_som_kfold_som_scores(scores=scores, + >>> result = check_n_datasets_som_kfold_som(scores=scores, evaluations=evaluations, eps=1e-3) >>> result['inconsistency'] @@ -257,7 +257,7 @@ This scenario is about performance scores calculated for each dataset individual .. code-block:: Python - >>> from mlscorecheck.check import check_n_datasets_mos_kfold_som_scores + >>> from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som >>> evaluation0 = {'dataset': {'p': 39, 'n': 822}, 'folding': {'n_folds': 5, 'n_repeats': 3, @@ -269,7 +269,7 @@ This scenario is about performance scores calculated for each dataset individual >>> scores = {'acc': 0.312, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - >>> result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_kfold_som(evaluations=evaluations, dataset_score_bounds={'acc': (0.0, 0.5)}, eps=1e-4, scores=scores) @@ -281,7 +281,7 @@ However, if one of the scores is adjusted a little (accuracy changed to 0.412 an .. code-block:: Python >>> scores = {'acc': 0.412, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - >>> result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_kfold_som(evaluations=evaluations, dataset_score_bounds={'acc': (0.5, 1.0)}, eps=1e-4, scores=scores) @@ -297,7 +297,7 @@ In this scenario, scores are calculated in the MoS manner for each dataset, and .. code-block:: Python - >>> from mlscorecheck.check import check_n_datasets_mos_known_folds_mos_scores + >>> from mlscorecheck.check.binary import check_n_datasets_mos_known_folds_mos >>> evaluation0 = {'dataset': {'p': 118, 'n': 95}, 'folding': {'folds': [{'p': 22, 'n': 23}, {'p': 96, 'n': 72}]}} @@ -307,7 +307,7 @@ In this scenario, scores are calculated in the MoS manner for each dataset, and >>> scores = {'acc': 0.61, 'sens': 0.709, 'spec': 0.461, 'bacc': 0.585} - >>> result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) >>> result['inconsistency'] @@ -319,7 +319,7 @@ Again, the details of the analysis are accessible under the ``lp_status`` and `` >>> scores = {'acc': 0.71, 'sens': 0.709, 'spec': 0.461} - >>> result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) >>> result['inconsistency'] @@ -341,14 +341,14 @@ Given a dataset and knowing that k-fold cross-validation was applied with MoS ag .. code-block:: Python - >>> from mlscorecheck.check import check_1_dataset_unknown_folds_mos_scores + >>> from mlscorecheck.check.binary import check_1_dataset_unknown_folds_mos >>> dataset = {'p': 126, 'n': 131} >>> folding = {'n_folds': 2, 'n_repeats': 1} >>> scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - >>> result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, + >>> result = check_1_dataset_unknown_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -361,7 +361,7 @@ If the balanced accuracy score is adjusted to 0.862, the configuration becomes i >>> scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.862} - >>> result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, + >>> result = check_1_dataset_unknown_folds_mos(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -374,7 +374,7 @@ The following scenario is similar in the sense that MoS aggregation is applied t .. code-block:: Python - >>> from mlscorecheck.check import check_n_datasets_mos_unknown_folds_mos_scores + >>> from mlscorecheck.check.binary import check_n_datasets_mos_unknown_folds_mos >>> evaluation0 = {'dataset': {'p': 13, 'n': 73}, 'folding': {'n_folds': 4, 'n_repeats': 1}} @@ -384,7 +384,7 @@ The following scenario is similar in the sense that MoS aggregation is applied t >>> scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.343} - >>> result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) >>> result['inconsistency'] @@ -396,7 +396,7 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th >>> scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.9} - >>> result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, + >>> result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, scores=scores, eps=1e-3) >>> result['inconsistency'] diff --git a/docs/02b_retina.rst b/docs/02b_retina.rst index ff9a3f9..f2db8cb 100644 --- a/docs/02b_retina.rst +++ b/docs/02b_retina.rst @@ -12,7 +12,7 @@ The first function enables the testing of performance scores reported for specif .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_drive_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_image >>> scores = {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849} >>> identifier = '01' >>> k = 4 @@ -29,7 +29,7 @@ A similar functionality is provided for the aggregated scores calculated on the .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_drive_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_aggregated >>> scores = {'acc': 0.9494, 'sens': 0.7450, 'spec': 0.9793} >>> k = 4 >>> results = check_drive_vessel_aggregated(scores=scores, @@ -56,7 +56,7 @@ In the first example, we test the consistency of scores provided for the image ' .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_stare_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_image >>> img_identifier = 'im0235' >>> scores = {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134} >>> results = check_stare_vessel_image(image_identifier=img_identifier, @@ -70,7 +70,7 @@ In the next example, we illustrate the consistency testing of performance scores .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_stare_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_aggregated >>> scores = {'acc': 0.4964, 'sens': 0.5793, 'spec': 0.4871, 'bacc': 0.5332} >>> results = check_stare_vessel_aggregated(imageset='all', annotator='ah', @@ -90,7 +90,7 @@ In the first example, we illustrate the consistency testing of scores reported f .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_hrf_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_image >>> scores = {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621} >>> identifier = '13_h' >>> k = 4 @@ -106,7 +106,7 @@ In the next example, we illustrate the consistency testing of scores aggregated .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_hrf_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_aggregated >>> scores = {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475} >>> k = 4 >>> results = check_hrf_vessel_aggregated(scores=scores, @@ -130,7 +130,7 @@ In the first example, we illustrate the consistency testing of scores reported f .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_chasedb1_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_image >>> img_identifier = '11R' >>> scores = {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706} >>> results = check_chasedb1_vessel_image(image_identifier=img_identifier, @@ -146,7 +146,7 @@ The next example illustrates the consistency testing of scores aggregated over a .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_chasedb1_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_aggregated >>> scores = {'acc': 0.5063, 'sens': 0.4147, 'spec': 0.5126} >>> k = 4 >>> results = check_chasedb1_vessel_aggregated(imageset='all', @@ -176,7 +176,7 @@ In the following example we illustrate the evaluation of scores aggregated over .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_diaretdb0_class + >>> from mlscorecheck.check.bundles.retina import check_diaretdb0_class >>> scores = {'acc': 0.4271, 'sens': 0.406, 'spec': 0.4765} >>> results = check_diaretdb0_class(subset='test', batch='all', @@ -199,7 +199,7 @@ In the first example, we illustrate the consistency testing of image labeling, t .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_diaretdb1_class + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_class >>> scores = {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474} >>> results = check_diaretdb1_class(subset='test', class_name=['hardexudates', 'softexudates'], @@ -215,7 +215,7 @@ In the next example, we test if the reported scores could be yielded from the se .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_diaretdb1_segmentation_image + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_image >>> scores = {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178} >>> results = check_diaretdb1_segmentation_image(image_identifier='005', class_name=['hardexudates', 'softexudates'], @@ -231,7 +231,7 @@ In the last example, we illustrate the consistency testing of scores aggregated .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_diaretdb1_segmentation_aggregated + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_aggregated >>> scores = {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244} >>> results = check_diaretdb1_segmentation_aggregated(subset='test', class_name='hardexudates', @@ -258,7 +258,7 @@ In the first example, we illustrate the consistency testing of image level segme .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_drishti_gs_segmentation_image + >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_image >>> scores = {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468} >>> results = check_drishti_gs_segmentation_image(image_identifier='053', confidence=0.75, @@ -274,7 +274,7 @@ In the next example, we illustrate the consistency testing of scores aggregated .. code-block:: Python - >>> from mlscorecheck.bundles.retina import check_drishti_gs_segmentation_aggregated + >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_aggregated >>> scores = {'acc': 0.4767, 'sens': 0.4845, 'spec': 0.4765, 'f1p': 0.0512} >>> results = check_drishti_gs_segmentation_aggregated(subset='test', confidence=0.75, diff --git a/docs/02c_ehg.rst b/docs/02c_ehg.rst index bf74594..5dd4d00 100644 --- a/docs/02c_ehg.rst +++ b/docs/02c_ehg.rst @@ -9,7 +9,7 @@ For illustration, given a set of scores reported in a real paper, the test below .. code-block:: Python - >>> from mlscorecheck.bundles.ehg import check_tpehg + >>> from mlscorecheck.check.bundles.ehg import check_tpehg >>> # the 5-fold cross-validation scores reported in the paper >>> scores = {'acc': 0.9447, 'sens': 0.9139, 'spec': 0.9733} >>> eps = 0.0001 diff --git a/docs/02e_skinlesion.rst b/docs/02e_skinlesion.rst index c850b62..317f868 100644 --- a/docs/02e_skinlesion.rst +++ b/docs/02e_skinlesion.rst @@ -12,7 +12,7 @@ In the following example, we illustrate the consistency testing of performance s .. code-block:: Python - >>> from mlscorecheck.bundles.skinlesion import check_isic2016 + >>> from mlscorecheck.check.bundles.skinlesion import check_isic2016 >>> scores = {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145} >>> results = check_isic2016(scores=scores, eps=1e-4) >>> results['inconsistency'] @@ -29,7 +29,7 @@ The consistency tests support these types of evaluations. In the following examp .. code-block:: Python - >>> from mlscorecheck.bundles.skinlesion import check_isic2017 + >>> from mlscorecheck.check.bundles.skinlesion import check_isic2017 >>> scores = {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362} >>> results = check_isic2017(target='M', against=['SK', 'N'], diff --git a/docs/03_api.rst b/docs/03_api.rst index 5519586..f1346d9 100644 --- a/docs/03_api.rst +++ b/docs/03_api.rst @@ -9,16 +9,16 @@ Consistency testing (``check``) The test functions implemented in the ``mlscorecheck.check`` module. -.. autofunction:: mlscorecheck.check.check_1_testset_no_kfold_scores -.. autofunction:: mlscorecheck.check.check_1_dataset_som_scores -.. autofunction:: mlscorecheck.check.check_1_dataset_known_folds_mos_scores -.. autofunction:: mlscorecheck.check.check_1_dataset_unknown_folds_mos_scores -.. autofunction:: mlscorecheck.check.check_n_testsets_mos_no_kfold_scores -.. autofunction:: mlscorecheck.check.check_n_testsets_som_no_kfold_scores -.. autofunction:: mlscorecheck.check.check_n_datasets_som_kfold_som_scores -.. autofunction:: mlscorecheck.check.check_n_datasets_mos_kfold_som_scores -.. autofunction:: mlscorecheck.check.check_n_datasets_mos_known_folds_mos_scores -.. autofunction:: mlscorecheck.check.check_n_datasets_mos_unknown_folds_mos_scores +.. autofunction:: mlscorecheck.check.binary.check_1_testset_no_kfold +.. autofunction:: mlscorecheck.check.binary.check_1_dataset_som +.. autofunction:: mlscorecheck.check.binary.check_1_dataset_known_folds_mos +.. autofunction:: mlscorecheck.check.binary.check_1_dataset_unknown_folds_mos +.. autofunction:: mlscorecheck.check.binary.check_n_testsets_mos_no_kfold +.. autofunction:: mlscorecheck.check.binary.check_n_testsets_som_no_kfold +.. autofunction:: mlscorecheck.check.binary.check_n_datasets_som_kfold_som +.. autofunction:: mlscorecheck.check.binary.check_n_datasets_mos_kfold_som +.. autofunction:: mlscorecheck.check.binary.check_n_datasets_mos_known_folds_mos +.. autofunction:: mlscorecheck.check.binary.check_n_datasets_mos_unknown_folds_mos Test bundles (``bundles``) @@ -34,61 +34,61 @@ The test functions dedicated to retina image processing problems. DRIVE ~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_drive_vessel_image -.. autofunction:: mlscorecheck.bundles.retina.check_drive_vessel_image_assumption -.. autofunction:: mlscorecheck.bundles.retina.check_drive_vessel_aggregated -.. autofunction:: mlscorecheck.bundles.retina.check_drive_vessel_aggregated_mos_assumption -.. autofunction:: mlscorecheck.bundles.retina.check_drive_vessel_aggregated_som_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_drive_vessel_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_drive_vessel_image_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_drive_vessel_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_drive_vessel_aggregated_mos_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_drive_vessel_aggregated_som_assumption STARE ~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_stare_vessel_image -.. autofunction:: mlscorecheck.bundles.retina.check_stare_vessel_aggregated -.. autofunction:: mlscorecheck.bundles.retina.check_stare_vessel_aggregated_mos -.. autofunction:: mlscorecheck.bundles.retina.check_stare_vessel_aggregated_som +.. autofunction:: mlscorecheck.check.bundles.retina.check_stare_vessel_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_stare_vessel_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_stare_vessel_aggregated_mos +.. autofunction:: mlscorecheck.check.bundles.retina.check_stare_vessel_aggregated_som HRF ~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_hrf_vessel_image -.. autofunction:: mlscorecheck.bundles.retina.check_hrf_vessel_image_assumption -.. autofunction:: mlscorecheck.bundles.retina.check_hrf_vessel_aggregated -.. autofunction:: mlscorecheck.bundles.retina.check_hrf_vessel_aggregated_mos_assumption -.. autofunction:: mlscorecheck.bundles.retina.check_hrf_vessel_aggregated_som_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_hrf_vessel_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_hrf_vessel_image_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_hrf_vessel_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_hrf_vessel_aggregated_mos_assumption +.. autofunction:: mlscorecheck.check.bundles.retina.check_hrf_vessel_aggregated_som_assumption CHASE_DB1 ~~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_chasedb1_vessel_image -.. autofunction:: mlscorecheck.bundles.retina.check_chasedb1_vessel_aggregated -.. autofunction:: mlscorecheck.bundles.retina.check_chasedb1_vessel_aggregated_mos -.. autofunction:: mlscorecheck.bundles.retina.check_chasedb1_vessel_aggregated_som +.. autofunction:: mlscorecheck.check.bundles.retina.check_chasedb1_vessel_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_chasedb1_vessel_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_chasedb1_vessel_aggregated_mos +.. autofunction:: mlscorecheck.check.bundles.retina.check_chasedb1_vessel_aggregated_som DIARETDB0 ~~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_diaretdb0_class +.. autofunction:: mlscorecheck.check.bundles.retina.check_diaretdb0_class DIARETDB1 ~~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_diaretdb1_class -.. autofunction:: mlscorecheck.bundles.retina.check_diaretdb1_segmentation_image -.. autofunction:: mlscorecheck.bundles.retina.check_diaretdb1_segmentation_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_diaretdb1_class +.. autofunction:: mlscorecheck.check.bundles.retina.check_diaretdb1_segmentation_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_diaretdb1_segmentation_aggregated DRISHTI_GS ~~~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.retina.check_drishti_gs_segmentation_image -.. autofunction:: mlscorecheck.bundles.retina.check_drishti_gs_segmentation_aggregated +.. autofunction:: mlscorecheck.check.bundles.retina.check_drishti_gs_segmentation_image +.. autofunction:: mlscorecheck.check.bundles.retina.check_drishti_gs_segmentation_aggregated Preterm delivery prediction by EHG signals ------------------------------------------ The test bundle dedicated to the testing of electrohsyterogram data. -.. autofunction:: mlscorecheck.bundles.ehg.check_tpehg +.. autofunction:: mlscorecheck.check.bundles.ehg.check_tpehg Skin lesion classification -------------------------- @@ -98,12 +98,12 @@ The test bundle dedicated to the testing of skin lesion classification. ISIC2016 ~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.skinlesion.check_isic2016 +.. autofunction:: mlscorecheck.check.bundles.skinlesion.check_isic2016 ISIC2017 ~~~~~~~~ -.. autofunction:: mlscorecheck.bundles.skinlesion.check_isic2017 +.. autofunction:: mlscorecheck.check.bundles.skinlesion.check_isic2017 Experiments (``experiments``) ============================= diff --git a/mlscorecheck/check/_check_1_dataset_unknown_folds_mos_acc_score.py b/legacy/_check_1_dataset_unknown_folds_mos_acc_score.py similarity index 96% rename from mlscorecheck/check/_check_1_dataset_unknown_folds_mos_acc_score.py rename to legacy/_check_1_dataset_unknown_folds_mos_acc_score.py index 4b0380a..306e045 100644 --- a/mlscorecheck/check/_check_1_dataset_unknown_folds_mos_acc_score.py +++ b/legacy/_check_1_dataset_unknown_folds_mos_acc_score.py @@ -5,8 +5,8 @@ import itertools -from ..core import NUMERICAL_TOLERANCE -from ..aggregated import Evaluation +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import Evaluation __all__ = ['check_1_dataset_unknown_folds_mos_acc_score'] diff --git a/tests/check/test_1_dataset_unknown_folds_mos_acc_score.py b/legacy/test_1_dataset_unknown_folds_mos_acc_score.py similarity index 97% rename from tests/check/test_1_dataset_unknown_folds_mos_acc_score.py rename to legacy/test_1_dataset_unknown_folds_mos_acc_score.py index 2f987e6..c2364b9 100644 --- a/tests/check/test_1_dataset_unknown_folds_mos_acc_score.py +++ b/legacy/test_1_dataset_unknown_folds_mos_acc_score.py @@ -7,7 +7,7 @@ import numpy as np -from mlscorecheck.check import check_1_dataset_unknown_folds_mos_acc_score +from mlscorecheck.check.binary import check_1_dataset_unknown_folds_mos_acc_score from mlscorecheck.aggregated import (generate_dataset, Evaluation, Folding) diff --git a/mlscorecheck/__init__.py b/mlscorecheck/__init__.py index 8d9a00a..adffef6 100644 --- a/mlscorecheck/__init__.py +++ b/mlscorecheck/__init__.py @@ -8,5 +8,4 @@ from . import symbolic from . import individual from . import aggregated -from . import bundles from ._version import * diff --git a/mlscorecheck/aggregated/_evaluation.py b/mlscorecheck/aggregated/_evaluation.py index 64417a9..f873976 100644 --- a/mlscorecheck/aggregated/_evaluation.py +++ b/mlscorecheck/aggregated/_evaluation.py @@ -8,7 +8,7 @@ from ._folding import Folding from ..core import (init_random_state, dict_mean, round_scores, NUMERICAL_TOLERANCE) -from ..individual import calculate_scores_for_lp +from ..scores import calculate_scores_for_lp from ._utils import check_bounds, aggregated_scores from ._linear_programming import add_bounds diff --git a/mlscorecheck/aggregated/_experiment.py b/mlscorecheck/aggregated/_experiment.py index 8c3e834..46c5de9 100644 --- a/mlscorecheck/aggregated/_experiment.py +++ b/mlscorecheck/aggregated/_experiment.py @@ -6,7 +6,7 @@ from ..core import (init_random_state, dict_mean, round_scores, NUMERICAL_TOLERANCE) -from ..individual import calculate_scores_for_lp +from ..scores import calculate_scores_for_lp from ._evaluation import Evaluation diff --git a/mlscorecheck/aggregated/_fold.py b/mlscorecheck/aggregated/_fold.py index 2bce384..aec8bc0 100644 --- a/mlscorecheck/aggregated/_fold.py +++ b/mlscorecheck/aggregated/_fold.py @@ -10,7 +10,7 @@ import pulp as pl from ..core import (init_random_state, round_scores) -from ..individual import calculate_scores_for_lp +from ..scores import calculate_scores_for_lp from ._utils import random_identifier, aggregated_scores diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index d38f53b..8bb9e5f 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -5,6 +5,10 @@ import copy import itertools +import numpy as np + +from sklearn.model_selection import StratifiedKFold + from ..core import logger from ..experiments import dataset_statistics from ._utils import random_identifier @@ -19,7 +23,9 @@ 'determine_min_max_p', 'kfolds_generator', 'repeated_kfolds_generator', - 'experiment_kfolds_generator'] + 'experiment_kfolds_generator', + 'multiclass_stratified_folds', + 'transform_multiclass_fold_to_binary'] def stratified_configurations_sklearn(p: int, n: int, @@ -434,3 +440,34 @@ def experiment_kfolds_generator(experiment: dict, yield {'evaluations': list(evaluations), 'dataset_score_bounds': experiment.get('dataset_score_bounds'), 'aggregation': experiment['aggregation']} + +def multiclass_stratified_folds(dataset: dict, n_folds: int) -> list: + """ + Generating the folds for an sklearn stratified multiclass setup + + Args: + dataset (dict): the specification of the dataset + n_folds (int): the number of folds + + Returns: + list(dict): the list of fold specifications + """ + folds = [] + y = np.hstack([np.repeat(key, value) for key, value in dataset.items()]) + for _, test in StratifiedKFold(n_splits=n_folds).split(y.reshape(-1, 1), y, y): + folds.append({idx: count for idx, count in enumerate(np.bincount(y[test]))}) + + return folds + +def transform_multiclass_fold_to_binary(fold: dict) -> list: + """ + Transforms a multiclass fold specification to a list of binary folds + + Args: + fold (dict): a multiclass fold specification + + Returns: + list(dict): the list of binary folds + """ + n_total = sum(fold.values()) + return [{'p': value, 'n': n_total - value} for value in fold.values()] \ No newline at end of file diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index 9ff93df..4c50036 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -7,7 +7,7 @@ from ..core import (init_random_state, dict_minmax, dict_mean, round_scores) from ..experiments import dataset_statistics -from ..individual import calculate_scores, calculate_scores_for_lp +from ..scores import calculate_scores, calculate_scores_for_lp from ._dataset import Dataset from ._folding import Folding diff --git a/mlscorecheck/check/__init__.py b/mlscorecheck/check/__init__.py index 422b85a..e2c1444 100644 --- a/mlscorecheck/check/__init__.py +++ b/mlscorecheck/check/__init__.py @@ -1,18 +1,8 @@ """ -This module brings together all the check functionalities +This module brings together all test functionalities. """ -from ._check_1_testset_no_kfold_scores import * - -from ._check_1_dataset_kfold_som_scores import * -from ._check_1_dataset_known_folds_mos_scores import * -from ._check_1_dataset_unknown_folds_mos_acc_score import * -from ._check_1_dataset_unknown_folds_mos_scores import * - -from ._check_n_testsets_mos_no_kfold_scores import * -from ._check_n_testsets_som_no_kfold_scores import * - -from ._check_n_datasets_som_kfold_som_scores import * -from ._check_n_datasets_mos_kfold_som_scores import * -from ._check_n_datasets_mos_known_folds_mos_scores import * -from ._check_n_datasets_mos_unknown_folds_mos_scores import * +from . import binary +from . import bundles +from . import multiclass +from . import regression diff --git a/mlscorecheck/check/binary/__init__.py b/mlscorecheck/check/binary/__init__.py new file mode 100644 index 0000000..fb9ce9b --- /dev/null +++ b/mlscorecheck/check/binary/__init__.py @@ -0,0 +1,17 @@ +""" +This module brings together all the check functionalities +""" + +from ._check_1_testset_no_kfold import * + +from ._check_1_dataset_kfold_som import * +from ._check_1_dataset_known_folds_mos import * +from ._check_1_dataset_unknown_folds_mos import * + +from ._check_n_testsets_mos_no_kfold import * +from ._check_n_testsets_som_no_kfold import * + +from ._check_n_datasets_som_kfold_som import * +from ._check_n_datasets_mos_kfold_som import * +from ._check_n_datasets_mos_known_folds_mos import * +from ._check_n_datasets_mos_unknown_folds_mos import * diff --git a/mlscorecheck/check/_check_1_dataset_kfold_som_scores.py b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py similarity index 87% rename from mlscorecheck/check/_check_1_dataset_kfold_som_scores.py rename to mlscorecheck/check/binary/_check_1_dataset_kfold_som.py index b0581c6..feca21f 100644 --- a/mlscorecheck/check/_check_1_dataset_kfold_som_scores.py +++ b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py @@ -4,18 +4,18 @@ in a kfold scenario on one single dataset. """ -from ..core import NUMERICAL_TOLERANCE -from ..individual import check_scores_tptn_pairs -from ..aggregated import Experiment +from ...core import NUMERICAL_TOLERANCE +from ...individual import check_scores_tptn_pairs +from ...aggregated import Experiment -__all__ = ['check_1_dataset_som_scores'] +__all__ = ['check_1_dataset_som'] -def check_1_dataset_som_scores(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +def check_1_dataset_som(dataset: dict, + folding: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores calculated by applying k-fold cross validation to one single dataset and aggregating the figures @@ -53,11 +53,12 @@ def check_1_dataset_som_scores(dataset: dict, ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary import check_1_dataset_som >>> dataset = {'dataset_name': 'common_datasets.monk-2'} >>> folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} >>> scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som_scores(dataset=dataset, + >>> result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -67,7 +68,7 @@ def check_1_dataset_som_scores(dataset: dict, >>> dataset = {'p': 10, 'n': 20} >>> folding = {'n_folds': 5, 'n_repeats': 1} >>> scores = {'acc': 0.428, 'npv': 0.392, 'bacc': 0.442, 'f1p': 0.391} - >>> result = check_1_dataset_som_scores(dataset=dataset, + >>> result = check_1_dataset_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) diff --git a/mlscorecheck/check/_check_1_dataset_known_folds_mos_scores.py b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py similarity index 78% rename from mlscorecheck/check/_check_1_dataset_known_folds_mos_scores.py rename to mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py index fcd868e..2d57c6d 100644 --- a/mlscorecheck/check/_check_1_dataset_known_folds_mos_scores.py +++ b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py @@ -4,12 +4,12 @@ in a kfold scenario on one single dataset. """ -from ..core import NUMERICAL_TOLERANCE -from ..aggregated import check_aggregated_scores, Experiment, Evaluation +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import check_aggregated_scores, Experiment, Evaluation -__all__ = ['check_1_dataset_known_folds_mos_scores'] +__all__ = ['check_1_dataset_known_folds_mos'] -def check_1_dataset_known_folds_mos_scores(dataset: dict, +def check_1_dataset_known_folds_mos(dataset: dict, folding: dict, scores: dict, eps, @@ -64,35 +64,36 @@ def check_1_dataset_known_folds_mos_scores(dataset: dict, ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary import check_1_dataset_known_folds_mos >>> dataset = {'p': 126, 'n': 131} >>> folding = {'folds': [{'p': 52, 'n': 94}, {'p': 74, 'n': 37}]} >>> scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-3) + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # False >>> dataset = {'p': 398, 'n': 569} >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} >>> scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-2) + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-2) >>> result['inconsistency'] # True >>> dataset = {'dataset_name': 'common_datasets.glass_0_1_6_vs_2'} >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} >>> scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6, 'bacc': 0.1, 'f1': 0.95} - >>> result = check_1_dataset_known_folds_mos_scores(dataset=dataset, - folding=folding, - fold_score_bounds={'acc': (0.8, 1.0)}, - scores=scores, - eps=1e-2, - numerical_tolerance=1e-6) + >>> result = check_1_dataset_known_folds_mos(dataset=dataset, + folding=folding, + fold_score_bounds={'acc': (0.8, 1.0)}, + scores=scores, + eps=1e-2, + numerical_tolerance=1e-6) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/check/_check_1_dataset_unknown_folds_mos_scores.py b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py similarity index 75% rename from mlscorecheck/check/_check_1_dataset_unknown_folds_mos_scores.py rename to mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py index 656fee8..551e72a 100644 --- a/mlscorecheck/check/_check_1_dataset_unknown_folds_mos_scores.py +++ b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py @@ -3,13 +3,13 @@ scenario with unknown fold structures. """ -from ..core import NUMERICAL_TOLERANCE -from ..aggregated import (Dataset, +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import (Dataset, repeated_kfolds_generator, kfolds_generator) -from ._check_1_dataset_known_folds_mos_scores import check_1_dataset_known_folds_mos_scores +from ._check_1_dataset_known_folds_mos import check_1_dataset_known_folds_mos -__all__ = ['check_1_dataset_unknown_folds_mos_scores', +__all__ = ['check_1_dataset_unknown_folds_mos', 'estimate_n_evaluations'] def estimate_n_evaluations(dataset: dict, @@ -37,17 +37,17 @@ def estimate_n_evaluations(dataset: dict, return count**n_repeats -def check_1_dataset_unknown_folds_mos_scores( - dataset: dict, - folding: dict, - scores: dict, - eps, - fold_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +def check_1_dataset_unknown_folds_mos( + dataset: dict, + folding: dict, + scores: dict, + eps, + fold_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores calculated in a k-fold cross validation on a single dataset, in a mean-of-scores fashion, without knowing the folding strategy. @@ -85,23 +85,24 @@ def check_1_dataset_unknown_folds_mos_scores( ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary import check_1_dataset_unknown_folds_mos >>> dataset = {'p': 126, 'n': 131} >>> folding = {'n_folds': 2, 'n_repeats': 1} >>> scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662} - >>> result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-3) + >>> result = check_1_dataset_unknown_folds_mos(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # False >>> dataset = {'p': 19, 'n': 97} >>> folding = {'n_folds': 3, 'n_repeats': 1} >>> scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6} - >>> result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + >>> result = check_1_dataset_unknown_folds_mos(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) >>> result['inconsistency'] # True """ @@ -116,7 +117,7 @@ def check_1_dataset_unknown_folds_mos_scores( for evaluation_0 in repeated_kfolds_generator(evaluation, list(scores.keys())): tmp = {'folds': evaluation_0['folding']['folds'], - 'details': check_1_dataset_known_folds_mos_scores( + 'details': check_1_dataset_known_folds_mos( scores=scores, eps=eps, dataset=evaluation_0['dataset'], diff --git a/mlscorecheck/check/_check_1_testset_no_kfold_scores.py b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py similarity index 79% rename from mlscorecheck/check/_check_1_testset_no_kfold_scores.py rename to mlscorecheck/check/binary/_check_1_testset_no_kfold.py index 46c73f0..896867b 100644 --- a/mlscorecheck/check/_check_1_testset_no_kfold_scores.py +++ b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py @@ -5,18 +5,18 @@ import warnings -from ..core import logger, NUMERICAL_TOLERANCE -from ..individual import check_scores_tptn_pairs -from ..experiments import dataset_statistics +from ...core import logger, NUMERICAL_TOLERANCE +from ...individual import check_scores_tptn_pairs +from ...experiments import dataset_statistics -__all__ = ['check_1_testset_no_kfold_scores'] +__all__ = ['check_1_testset_no_kfold'] -def check_1_testset_no_kfold_scores(testset: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True) -> dict: +def check_1_testset_no_kfold(testset: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True) -> dict: """ Use this check if the scores are calculated on one single test set with no kfolding or aggregation over multiple datasets. @@ -50,20 +50,20 @@ def check_1_testset_no_kfold_scores(testset: dict, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check import check_1_testset_no_kfold_scores + >>> from mlscorecheck.check.binary import check_1_testset_no_kfold >>> testset = {'p': 530, 'n': 902} >>> scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - >>> result = check_1_testset_no_kfold_scores(testset=testset, - scores=scores, - eps=1e-2) + >>> result = check_1_testset_no_kfold(testset=testset, + scores=scores, + eps=1e-2) >>> result['inconsistency'] # False >>> testset = {'p': 530, 'n': 902} >>> scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32} - >>> result = check_1_testset_no_kfold_scores(testset=testset, - scores=scores, - eps=1e-2) + >>> result = check_1_testset_no_kfold(testset=testset, + scores=scores, + eps=1e-2) >>> result['inconsistency'] # True diff --git a/mlscorecheck/check/_check_n_datasets_mos_kfold_som_scores.py b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py similarity index 84% rename from mlscorecheck/check/_check_n_datasets_mos_kfold_som_scores.py rename to mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py index 135d146..8b24244 100644 --- a/mlscorecheck/check/_check_n_datasets_mos_kfold_som_scores.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py @@ -6,12 +6,12 @@ import copy -from ..aggregated import check_aggregated_scores, Experiment -from ..core import NUMERICAL_TOLERANCE +from ...aggregated import check_aggregated_scores, Experiment +from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_datasets_mos_kfold_som_scores'] +__all__ = ['check_n_datasets_mos_kfold_som'] -def check_n_datasets_mos_kfold_som_scores(evaluations: list, +def check_n_datasets_mos_kfold_som(evaluations: list, scores: dict, eps, dataset_score_bounds: dict = None, @@ -58,7 +58,7 @@ def check_n_datasets_mos_kfold_som_scores(evaluations: list, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check import check_n_datasets_mos_kfold_som_scores + >>> from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som >>> evaluation0 = {'dataset': {'p': 39, 'n': 822}, 'folding': {'n_folds': 5, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}} @@ -67,10 +67,10 @@ def check_n_datasets_mos_kfold_som_scores(evaluations: list, 'strategy': 'stratified_sklearn'}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.312, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - >>> result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, - dataset_score_bounds={'acc': (0.0, 0.5)}, - eps=1e-4, - scores=scores) + >>> result = check_n_datasets_mos_kfold_som(evaluations=evaluations, + dataset_score_bounds={'acc': (0.0, 0.5)}, + eps=1e-4, + scores=scores) >>> result['inconsistency'] # False @@ -82,10 +82,10 @@ def check_n_datasets_mos_kfold_som_scores(evaluations: list, 'strategy': 'stratified_sklearn'}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.412, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - >>> result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations, - dataset_score_bounds={'acc': (0.5, 1.0)}, - eps=1e-4, - scores=scores) + >>> result = check_n_datasets_mos_kfold_som(evaluations=evaluations, + dataset_score_bounds={'acc': (0.5, 1.0)}, + eps=1e-4, + scores=scores) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/check/_check_n_datasets_mos_known_folds_mos_scores.py b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py similarity index 89% rename from mlscorecheck/check/_check_n_datasets_mos_known_folds_mos_scores.py rename to mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py index c0e4072..000b73b 100644 --- a/mlscorecheck/check/_check_n_datasets_mos_known_folds_mos_scores.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py @@ -6,12 +6,12 @@ import copy -from ..aggregated import check_aggregated_scores, Experiment -from ..core import NUMERICAL_TOLERANCE +from ...aggregated import check_aggregated_scores, Experiment +from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_datasets_mos_known_folds_mos_scores'] +__all__ = ['check_n_datasets_mos_known_folds_mos'] -def check_n_datasets_mos_known_folds_mos_scores(evaluations: list, +def check_n_datasets_mos_known_folds_mos(evaluations: list, scores: dict, eps, dataset_score_bounds: dict = None, @@ -57,15 +57,16 @@ def check_n_datasets_mos_known_folds_mos_scores(evaluations: list, ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary check_n_datasets_mos_known_folds_mos >>> evaluation0 = {'dataset': {'p': 118, 'n': 95}, 'folding': {'folds': [{'p': 22, 'n': 23}, {'p': 96, 'n': 72}]}} >>> evaluation1 = {'dataset': {'p': 781, 'n': 423}, 'folding': {'folds': [{'p': 300, 'n': 200}, {'p': 481, 'n': 223}]}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.61, 'sens': 0.709, 'spec': 0.461, 'bacc': 0.585} - >>> result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # False @@ -75,9 +76,9 @@ def check_n_datasets_mos_known_folds_mos_scores(evaluations: list, 'folding': {'folds': [{'p': 300, 'n': 200}, {'p': 481, 'n': 223}]}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.71, 'sens': 0.709, 'spec': 0.461} - >>> result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/check/_check_n_datasets_mos_unknown_folds_mos_scores.py b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py similarity index 84% rename from mlscorecheck/check/_check_n_datasets_mos_unknown_folds_mos_scores.py rename to mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py index e26b9ab..a952571 100644 --- a/mlscorecheck/check/_check_n_datasets_mos_unknown_folds_mos_scores.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py @@ -8,13 +8,13 @@ import numpy as np -from ._check_n_datasets_mos_known_folds_mos_scores \ - import check_n_datasets_mos_known_folds_mos_scores -from ._check_1_dataset_unknown_folds_mos_scores import estimate_n_evaluations -from ..core import NUMERICAL_TOLERANCE -from ..aggregated import (experiment_kfolds_generator) +from ._check_n_datasets_mos_known_folds_mos \ + import check_n_datasets_mos_known_folds_mos +from ._check_1_dataset_unknown_folds_mos import estimate_n_evaluations +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import (experiment_kfolds_generator) -__all__ = ['check_n_datasets_mos_unknown_folds_mos_scores', +__all__ = ['check_n_datasets_mos_unknown_folds_mos', 'estimate_n_experiments'] def estimate_n_experiments(evaluations: list, @@ -36,7 +36,7 @@ def estimate_n_experiments(evaluations: list, for evaluation in evaluations] return np.prod(counts) -def check_n_datasets_mos_unknown_folds_mos_scores(evaluations: list, +def check_n_datasets_mos_unknown_folds_mos(evaluations: list, scores: dict, eps, dataset_score_bounds: dict = None, @@ -80,16 +80,16 @@ def check_n_datasets_mos_unknown_folds_mos_scores(evaluations: list, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check import check_n_datasets_mos_unknown_folds_mos_scores + >>> from mlscorecheck.check.binary import check_n_datasets_mos_unknown_folds_mos >>> evaluation0 = {'dataset': {'p': 13, 'n': 73}, 'folding': {'n_folds': 4, 'n_repeats': 1}} >>> evaluation1 = {'dataset': {'p': 7, 'n': 26}, 'folding': {'n_folds': 3, 'n_repeats': 1}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.343} - >>> result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # False @@ -99,9 +99,9 @@ def check_n_datasets_mos_unknown_folds_mos_scores(evaluations: list, 'folding': {'n_folds': 3, 'n_repeats': 1}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.9} - >>> result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # True """ @@ -124,7 +124,7 @@ def check_n_datasets_mos_unknown_folds_mos_scores(evaluations: list, for experiment in experiment_kfolds_generator(experiment, list(scores.keys())): - result = check_n_datasets_mos_known_folds_mos_scores( + result = check_n_datasets_mos_known_folds_mos( evaluations=experiment['evaluations'], dataset_score_bounds=experiment.get('dataset_score_bounds'), scores=scores, diff --git a/mlscorecheck/check/_check_n_datasets_som_kfold_som_scores.py b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py similarity index 86% rename from mlscorecheck/check/_check_n_datasets_som_kfold_som_scores.py rename to mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py index 8e9f164..925adee 100644 --- a/mlscorecheck/check/_check_n_datasets_som_kfold_som_scores.py +++ b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py @@ -6,13 +6,13 @@ import copy -from ..core import NUMERICAL_TOLERANCE -from ..individual import check_scores_tptn_pairs -from ..aggregated import Experiment +from ...core import NUMERICAL_TOLERANCE +from ...individual import check_scores_tptn_pairs +from ...aggregated import Experiment -__all__ = ['check_n_datasets_som_kfold_som_scores'] +__all__ = ['check_n_datasets_som_kfold_som'] -def check_n_datasets_som_kfold_som_scores(evaluations: list, +def check_n_datasets_som_kfold_som(evaluations: list, scores: dict, eps, *, @@ -52,6 +52,7 @@ def check_n_datasets_som_kfold_som_scores(evaluations: list, ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary import check_n_datasets_som_kfold_som >>> evaluation0 = {'dataset': {'p': 389, 'n': 630}, 'folding': {'n_folds': 5, 'n_repeats': 2, 'strategy': 'stratified_sklearn'}} @@ -60,9 +61,9 @@ def check_n_datasets_som_kfold_som_scores(evaluations: list, 'strategy': 'stratified_sklearn'}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.631, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - >>> result = check_n_datasets_som_kfold_som_scores(scores=scores, - evaluations=evaluations, - eps=1e-3) + >>> result = check_n_datasets_som_kfold_som(scores=scores, + evaluations=evaluations, + eps=1e-3) >>> result['inconsistency'] # False @@ -74,9 +75,9 @@ def check_n_datasets_som_kfold_som_scores(evaluations: list, 'strategy': 'stratified_sklearn'}} >>> evaluations = [evaluation0, evaluation1] >>> scores = {'acc': 0.731, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - >>> result = check_n_datasets_som_kfold_som_scores(scores=scores, - evaluations=evaluations, - eps=1e-3) + >>> result = check_n_datasets_som_kfold_som(scores=scores, + evaluations=evaluations, + eps=1e-3) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/check/_check_n_testsets_mos_no_kfold_scores.py b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py similarity index 85% rename from mlscorecheck/check/_check_n_testsets_mos_no_kfold_scores.py rename to mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py index 9a2bd11..a3dadc6 100644 --- a/mlscorecheck/check/_check_n_testsets_mos_no_kfold_scores.py +++ b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py @@ -3,12 +3,12 @@ scores calculated by the mean of scores aggregation over multiple testsets. """ -from ..aggregated import check_aggregated_scores, Experiment, Dataset -from ..core import NUMERICAL_TOLERANCE +from ...aggregated import check_aggregated_scores, Experiment, Dataset +from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_testsets_mos_no_kfold_scores'] +__all__ = ['check_n_testsets_mos_no_kfold'] -def check_n_testsets_mos_no_kfold_scores(testsets: list, +def check_n_testsets_mos_no_kfold(testsets: list, scores: dict, eps, testset_score_bounds: dict = None, @@ -55,22 +55,22 @@ def check_n_testsets_mos_no_kfold_scores(testsets: list, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check import check_n_testsets_mos_no_kfold_scores + >>> from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold >>> testsets = [{'p': 349, 'n': 50}, {'p': 478, 'n': 323}, {'p': 324, 'n': 83}, {'p': 123, 'n': 145}] >>> scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251} - >>> result = check_n_testsets_mos_no_kfold_scores(testsets=testsets, - eps=1e-4, - scores=scores) + >>> result = check_n_testsets_mos_no_kfold(testsets=testsets, + eps=1e-4, + scores=scores) >>> result['inconsistency'] # False >>> scores['sens'] = 0.6756 - >>> result = check_n_datasets_mos_no_kfold_scores(testsets=testsets, - eps=1e-4, - scores=scores) + >>> result = check_n_datasets_mos_no_kfold(testsets=testsets, + eps=1e-4, + scores=scores) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/check/_check_n_testsets_som_no_kfold_scores.py b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py similarity index 85% rename from mlscorecheck/check/_check_n_testsets_som_no_kfold_scores.py rename to mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py index f5a69d5..7015e1f 100644 --- a/mlscorecheck/check/_check_n_testsets_som_no_kfold_scores.py +++ b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py @@ -4,13 +4,13 @@ over multiple testsets. """ -from ..core import NUMERICAL_TOLERANCE -from ..individual import check_scores_tptn_pairs -from ..aggregated import Experiment, Dataset +from ...core import NUMERICAL_TOLERANCE +from ...individual import check_scores_tptn_pairs +from ...aggregated import Experiment, Dataset -__all__ = ['check_n_testsets_som_no_kfold_scores'] +__all__ = ['check_n_testsets_som_no_kfold'] -def check_n_testsets_som_no_kfold_scores(testsets: list, +def check_n_testsets_som_no_kfold(testsets: list, scores: dict, eps, *, @@ -52,18 +52,19 @@ def check_n_testsets_som_no_kfold_scores(testsets: list, ValueError: if the problem is not specified properly Examples: + >>> from mlscorecheck.check.binary import check_n_datasets_som_no_kfold >>> testsets = [{'p': 405, 'n': 223}, {'p': 3, 'n': 422}, {'p': 109, 'n': 404}] >>> scores = {'acc': 0.4719, 'npv': 0.6253, 'f1p': 0.3091} - >>> result = check_n_datasets_som_no_kfold_scores(testsets=testsets, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_som_no_kfold(testsets=testsets, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # False >>> scores['npv'] = 0.6263 - >>> result = check_n_datasets_som_no_kfold_scores(testsets=testsets, - scores=scores, - eps=1e-3) + >>> result = check_n_datasets_som_no_kfold(testsets=testsets, + scores=scores, + eps=1e-3) >>> result['inconsistency'] # True """ diff --git a/mlscorecheck/bundles/__init__.py b/mlscorecheck/check/bundles/__init__.py similarity index 100% rename from mlscorecheck/bundles/__init__.py rename to mlscorecheck/check/bundles/__init__.py diff --git a/mlscorecheck/bundles/ehg/__init__.py b/mlscorecheck/check/bundles/ehg/__init__.py similarity index 100% rename from mlscorecheck/bundles/ehg/__init__.py rename to mlscorecheck/check/bundles/ehg/__init__.py diff --git a/mlscorecheck/bundles/ehg/_tpehg.py b/mlscorecheck/check/bundles/ehg/_tpehg.py similarity index 91% rename from mlscorecheck/bundles/ehg/_tpehg.py rename to mlscorecheck/check/bundles/ehg/_tpehg.py index 8bb0c38..46828ca 100644 --- a/mlscorecheck/bundles/ehg/_tpehg.py +++ b/mlscorecheck/check/bundles/ehg/_tpehg.py @@ -2,9 +2,9 @@ Test functions for the EHG problem """ -from ...core import NUMERICAL_TOLERANCE -from ...experiments import get_experiment -from ...check import check_1_dataset_unknown_folds_mos_scores +from ....core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import check_1_dataset_unknown_folds_mos __all__ = ['check_tpehg'] @@ -42,7 +42,7 @@ def check_tpehg(scores: dict, dict: the result of the consistency testing Examples: - >>> from mlscorecheck.bundles.ehg import check_tpehg + >>> from mlscorecheck.check.bundles.ehg import check_tpehg >>> # the 5-fold cross-validation scores reported in the paper >>> scores = {'acc': 0.9447, 'sens': 0.9139, 'spec': 0.9733} >>> eps = 0.0001 @@ -56,7 +56,7 @@ def check_tpehg(scores: dict, evaluation = {'dataset': get_experiment('ehg.tpehg'), 'folding': {'n_folds': n_folds, 'n_repeats': n_repeats}} - return check_1_dataset_unknown_folds_mos_scores(scores=scores, + return check_1_dataset_unknown_folds_mos(scores=scores, eps=eps, dataset=evaluation['dataset'], folding=evaluation['folding'], diff --git a/mlscorecheck/bundles/retina/__init__.py b/mlscorecheck/check/bundles/retina/__init__.py similarity index 100% rename from mlscorecheck/bundles/retina/__init__.py rename to mlscorecheck/check/bundles/retina/__init__.py diff --git a/mlscorecheck/bundles/retina/_chasedb1.py b/mlscorecheck/check/bundles/retina/_chasedb1.py similarity index 95% rename from mlscorecheck/bundles/retina/_chasedb1.py rename to mlscorecheck/check/bundles/retina/_chasedb1.py index 92e6163..cfdf182 100644 --- a/mlscorecheck/bundles/retina/_chasedb1.py +++ b/mlscorecheck/check/bundles/retina/_chasedb1.py @@ -2,11 +2,11 @@ This module implements the tests for the CHASE_DB1 retina vessel segmentation dataset """ -from ...experiments import get_experiment -from ...check import check_n_testsets_som_no_kfold_scores -from ...check import check_n_testsets_mos_no_kfold_scores -from ...check import check_1_testset_no_kfold_scores -from ...core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import check_n_testsets_som_no_kfold +from ...binary import check_n_testsets_mos_no_kfold +from ...binary import check_1_testset_no_kfold +from ....core import NUMERICAL_TOLERANCE __all__ = ['check_chasedb1_vessel_image', 'check_chasedb1_vessel_aggregated', @@ -83,7 +83,7 @@ def check_chasedb1_vessel_aggregated_mos(imageset, testsets = _filter_chasedb1(data, imageset, annotator) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, testset_score_bounds=score_bounds, @@ -129,7 +129,7 @@ def check_chasedb1_vessel_aggregated_som(imageset, testsets = _filter_chasedb1(data, imageset, annotator) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -172,7 +172,7 @@ def check_chasedb1_vessel_aggregated(imageset, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_chasedb1_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_aggregated >>> scores = {'acc': 0.5063, 'sens': 0.4147, 'spec': 0.5126} >>> k = 4 >>> results = check_chasedb1_vessel_aggregated(imageset='all', @@ -233,7 +233,7 @@ def check_chasedb1_vessel_image(image_identifier: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_chasedb1_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_image >>> img_identifier = '11R' >>> scores = {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706} >>> results = check_chasedb1_vessel_image(image_identifier=img_identifier, @@ -247,7 +247,7 @@ def check_chasedb1_vessel_image(image_identifier: str, image = [image for image in images[annotator]['images'] if image['identifier'] == image_identifier][0] - return check_1_testset_no_kfold_scores(testset=image, + return check_1_testset_no_kfold(testset=image, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, diff --git a/mlscorecheck/bundles/retina/_diaretdb0.py b/mlscorecheck/check/bundles/retina/_diaretdb0.py similarity index 96% rename from mlscorecheck/bundles/retina/_diaretdb0.py rename to mlscorecheck/check/bundles/retina/_diaretdb0.py index 870d49a..173072e 100644 --- a/mlscorecheck/bundles/retina/_diaretdb0.py +++ b/mlscorecheck/check/bundles/retina/_diaretdb0.py @@ -2,10 +2,10 @@ Tests for the DIARETDB0 dataset """ -from mlscorecheck.core import NUMERICAL_TOLERANCE -from mlscorecheck.experiments import get_experiment -from mlscorecheck.check import (check_n_testsets_mos_no_kfold_scores, - check_n_testsets_som_no_kfold_scores) +from ....core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import (check_n_testsets_mos_no_kfold, + check_n_testsets_som_no_kfold) __all__ = ['_prepare_configuration_diaretdb0', 'check_diaretdb0_class', @@ -94,7 +94,7 @@ def check_diaretdb0_class_som(subset: str, batch, class_name) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) @@ -161,7 +161,7 @@ def check_diaretdb0_class_mos(subset: str, batch, class_name) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -221,7 +221,7 @@ def check_diaretdb0_class(subset: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_diaretdb0_class + >>> from mlscorecheck.check.bundles.retina import check_diaretdb0_class >>> scores = {'acc': 0.4271, 'sens': 0.406, 'spec': 0.4765} >>> results = check_diaretdb0_class(subset='test', batch='all', diff --git a/mlscorecheck/bundles/retina/_diaretdb1.py b/mlscorecheck/check/bundles/retina/_diaretdb1.py similarity index 96% rename from mlscorecheck/bundles/retina/_diaretdb1.py rename to mlscorecheck/check/bundles/retina/_diaretdb1.py index dfc88ac..2eda87b 100644 --- a/mlscorecheck/bundles/retina/_diaretdb1.py +++ b/mlscorecheck/check/bundles/retina/_diaretdb1.py @@ -2,11 +2,11 @@ This module implements tests for the DIARETDB1 dataset """ -from ...experiments import get_experiment -from ...check import check_1_testset_no_kfold_scores -from ...check import check_n_testsets_mos_no_kfold_scores -from ...check import check_n_testsets_som_no_kfold_scores -from ...core import NUMERICAL_TOLERANCE, logger +from ....experiments import get_experiment +from ...binary import check_1_testset_no_kfold +from ...binary import check_n_testsets_mos_no_kfold +from ...binary import check_n_testsets_som_no_kfold +from ....core import NUMERICAL_TOLERANCE, logger __all__ = ['_prepare_configuration_diaretdb1', 'check_diaretdb1_class', @@ -142,7 +142,7 @@ def check_diaretdb1_class(*, by using the solutions for the score pairs. Examples: - >>> from mlscorecheck.bundles.retina import check_diaretdb1_class + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_class >>> scores = {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474} >>> results = check_diaretdb1_class(subset='test', class_name=['hardexudates', 'softexudates'], @@ -158,7 +158,7 @@ def check_diaretdb1_class(*, assumption='all', confidence=confidence) - return check_1_testset_no_kfold_scores(testset=testset, + return check_1_testset_no_kfold(testset=testset, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) @@ -210,7 +210,7 @@ def check_diaretdb1_segmentation_image_assumption(*, testset = [tset for tset in testset_test + testset_train if tset['identifier'] == image_identifier][0] - return check_1_testset_no_kfold_scores(testset=testset, + return check_1_testset_no_kfold(testset=testset, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) @@ -246,7 +246,7 @@ def check_diaretdb1_segmentation_image(*, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_diaretdb1_segmentation_image + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_image >>> scores = {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178} >>> results = check_diaretdb1_segmentation_image(image_identifier='005', class_name=['hardexudates', 'softexudates'], @@ -335,14 +335,14 @@ def check_diaretdb1_segmentation_aggregated_assumption(*, only_valid=only_valid) results = {} - results['details_som'] = check_n_testsets_som_no_kfold_scores(testsets=testsets, + results['details_som'] = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) results['inconsistency'] = {'inconsistency_som': results['details_som']['inconsistency']} if not (any(testset['p'] == 0 for testset in testsets) and 'sens' in scores): - results['details_mos'] = check_n_testsets_mos_no_kfold_scores( + results['details_mos'] = check_n_testsets_mos_no_kfold( testsets=testsets, scores=scores, eps=eps, @@ -405,7 +405,7 @@ def check_diaretdb1_segmentation_aggregated(*, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_diaretdb1_segmentation_aggregated + >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_aggregated >>> scores = {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244} >>> results = check_diaretdb1_segmentation_aggregated(subset='test', class_name='hardexudates', diff --git a/mlscorecheck/bundles/retina/_drishti_gs.py b/mlscorecheck/check/bundles/retina/_drishti_gs.py similarity index 95% rename from mlscorecheck/bundles/retina/_drishti_gs.py rename to mlscorecheck/check/bundles/retina/_drishti_gs.py index b66ae07..e853a0f 100644 --- a/mlscorecheck/bundles/retina/_drishti_gs.py +++ b/mlscorecheck/check/bundles/retina/_drishti_gs.py @@ -2,11 +2,11 @@ This module implements tests for the DRISHTI_GS dataset """ -from ...experiments import get_experiment -from ...core import NUMERICAL_TOLERANCE -from ...check import check_1_testset_no_kfold_scores -from ...check import check_n_testsets_mos_no_kfold_scores -from ...check import check_n_testsets_som_no_kfold_scores +from ....experiments import get_experiment +from ....core import NUMERICAL_TOLERANCE +from ...binary import check_1_testset_no_kfold +from ...binary import check_n_testsets_mos_no_kfold +from ...binary import check_n_testsets_som_no_kfold __all__ = ['_prepare_testsets_drishti_gs', 'check_drishti_gs_segmentation_image', @@ -87,7 +87,7 @@ def check_drishti_gs_segmentation_image(image_identifier: str, prefiltering by using the solutions for the score pairs. Examples: - >>> from mlscorecheck.bundles.retina import check_drishti_gs_segmentation_image + >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_image >>> scores = {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468} >>> results = check_drishti_gs_segmentation_image(image_identifier='053', confidence=0.75, @@ -101,7 +101,7 @@ def check_drishti_gs_segmentation_image(image_identifier: str, target=target, confidence=confidence)[0] - return check_1_testset_no_kfold_scores(testset=testset, + return check_1_testset_no_kfold(testset=testset, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) @@ -157,7 +157,7 @@ def check_drishti_gs_segmentation_aggregated_mos(subset, target=target, confidence=confidence) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, testset_score_bounds=score_bounds, @@ -202,7 +202,7 @@ def check_drishti_gs_segmentation_aggregated_som(subset: str, target=target, confidence=confidence) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance) @@ -247,7 +247,7 @@ def check_drishti_gs_segmentation_aggregated(subset: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_drishti_gs_segmentation_aggregated + >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_aggregated >>> scores = {'acc': 0.4767, 'sens': 0.4845, 'spec': 0.4765, 'f1p': 0.0512} >>> results = check_drishti_gs_segmentation_aggregated(subset='test', confidence=0.75, diff --git a/mlscorecheck/bundles/retina/_drive.py b/mlscorecheck/check/bundles/retina/_drive.py similarity index 96% rename from mlscorecheck/bundles/retina/_drive.py rename to mlscorecheck/check/bundles/retina/_drive.py index c0745ff..119da96 100644 --- a/mlscorecheck/bundles/retina/_drive.py +++ b/mlscorecheck/check/bundles/retina/_drive.py @@ -3,11 +3,11 @@ segmentation drive dataset """ -from ...core import NUMERICAL_TOLERANCE -from ...experiments import get_experiment -from ...check import (check_1_testset_no_kfold_scores, - check_n_testsets_mos_no_kfold_scores, - check_n_testsets_som_no_kfold_scores) +from ....core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import (check_1_testset_no_kfold, + check_n_testsets_mos_no_kfold, + check_n_testsets_som_no_kfold) __all__ = ['check_drive_vessel_aggregated_mos_assumption', 'check_drive_vessel_aggregated_som_assumption', @@ -95,7 +95,7 @@ def check_drive_vessel_aggregated_mos_assumption(imageset, testsets = _filter_drive(data, imageset, annotator, assumption) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, testset_score_bounds=score_bounds, @@ -144,7 +144,7 @@ def check_drive_vessel_aggregated_som_assumption(imageset, testsets = _filter_drive(data, imageset, annotator, assumption) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -184,7 +184,7 @@ def check_drive_vessel_image_assumption(image_identifier: str, if image['identifier'] == image_identifier] testset = testset[0] - return check_1_testset_no_kfold_scores(testset=testset, + return check_1_testset_no_kfold(testset=testset, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -228,7 +228,7 @@ def check_drive_vessel_aggregated(imageset, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_drive_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_aggregated >>> scores = {'acc': 0.9494, 'sens': 0.7450, 'spec': 0.9793} >>> k = 4 >>> results = check_drive_vessel_aggregated(scores=scores, @@ -297,7 +297,7 @@ def check_drive_vessel_image(image_identifier: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_drive_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_image >>> scores = {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849} >>> identifier = '01' >>> k = 4 diff --git a/mlscorecheck/bundles/retina/_hrf.py b/mlscorecheck/check/bundles/retina/_hrf.py similarity index 95% rename from mlscorecheck/bundles/retina/_hrf.py rename to mlscorecheck/check/bundles/retina/_hrf.py index 5855d14..50c72f5 100644 --- a/mlscorecheck/bundles/retina/_hrf.py +++ b/mlscorecheck/check/bundles/retina/_hrf.py @@ -3,11 +3,11 @@ segmentation HRF dataset """ -from ...core import NUMERICAL_TOLERANCE -from ...experiments import get_experiment -from ...check import (check_1_testset_no_kfold_scores, - check_n_testsets_mos_no_kfold_scores, - check_n_testsets_som_no_kfold_scores) +from ....core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import (check_1_testset_no_kfold, + check_n_testsets_mos_no_kfold, + check_n_testsets_som_no_kfold) __all__ = ['check_hrf_vessel_aggregated_mos_assumption', 'check_hrf_vessel_aggregated_som_assumption', @@ -90,7 +90,7 @@ def check_hrf_vessel_aggregated_mos_assumption(imageset, testsets = _filter_hrf(data, imageset, assumption) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, testset_score_bounds=score_bounds, @@ -135,7 +135,7 @@ def check_hrf_vessel_aggregated_som_assumption(imageset, testsets = _filter_hrf(data, imageset, assumption) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -172,7 +172,7 @@ def check_hrf_vessel_image_assumption(image_identifier: str, testset = testset[0] - return check_1_testset_no_kfold_scores(testset=testset, + return check_1_testset_no_kfold(testset=testset, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -213,7 +213,7 @@ def check_hrf_vessel_aggregated(imageset, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_hrf_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_aggregated >>> scores = {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475} >>> k = 4 >>> results = check_hrf_vessel_aggregated(scores=scores, @@ -277,7 +277,7 @@ def check_hrf_vessel_image(image_identifier: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_hrf_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_image >>> scores = {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621} >>> identifier = '13_h' >>> k = 4 diff --git a/mlscorecheck/bundles/retina/_stare.py b/mlscorecheck/check/bundles/retina/_stare.py similarity index 95% rename from mlscorecheck/bundles/retina/_stare.py rename to mlscorecheck/check/bundles/retina/_stare.py index 0b895f5..f471fea 100644 --- a/mlscorecheck/bundles/retina/_stare.py +++ b/mlscorecheck/check/bundles/retina/_stare.py @@ -2,11 +2,11 @@ This module implements the tests for the STARE retina vessel segmentation dataset """ -from ...experiments import get_experiment -from ...check import check_n_testsets_som_no_kfold_scores -from ...check import check_n_testsets_mos_no_kfold_scores -from ...check import check_1_testset_no_kfold_scores -from ...core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import check_n_testsets_som_no_kfold +from ...binary import check_n_testsets_mos_no_kfold +from ...binary import check_1_testset_no_kfold +from ....core import NUMERICAL_TOLERANCE __all__ = ['check_stare_vessel_image', 'check_stare_vessel_aggregated', @@ -83,7 +83,7 @@ def check_stare_vessel_aggregated_mos(imageset, testsets = _filter_stare(data, imageset, annotator) - return check_n_testsets_mos_no_kfold_scores(testsets=testsets, + return check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=eps, testset_score_bounds=score_bounds, @@ -129,7 +129,7 @@ def check_stare_vessel_aggregated_som(imageset, testsets = _filter_stare(data, imageset, annotator) - return check_n_testsets_som_no_kfold_scores(testsets=testsets, + return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, @@ -172,7 +172,7 @@ def check_stare_vessel_aggregated(imageset, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_stare_vessel_aggregated + >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_aggregated >>> scores = {'acc': 0.4964, 'sens': 0.5793, 'spec': 0.4871, 'bacc': 0.5332} >>> results = check_stare_vessel_aggregated(imageset='all', annotator='ah', @@ -232,7 +232,7 @@ def check_stare_vessel_image(image_identifier: str, be found. Examples: - >>> from mlscorecheck.bundles.retina import check_stare_vessel_image + >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_image >>> img_identifier = 'im0235' >>> scores = {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134} >>> results = check_stare_vessel_image(image_identifier=img_identifier, @@ -246,7 +246,7 @@ def check_stare_vessel_image(image_identifier: str, image = [image for image in images[annotator]['images'] if image['identifier'] == image_identifier][0] - return check_1_testset_no_kfold_scores(testset=image, + return check_1_testset_no_kfold(testset=image, scores=scores, eps=eps, numerical_tolerance=numerical_tolerance, diff --git a/mlscorecheck/bundles/skinlesion/__init__.py b/mlscorecheck/check/bundles/skinlesion/__init__.py similarity index 100% rename from mlscorecheck/bundles/skinlesion/__init__.py rename to mlscorecheck/check/bundles/skinlesion/__init__.py diff --git a/mlscorecheck/bundles/skinlesion/_isic2016.py b/mlscorecheck/check/bundles/skinlesion/_isic2016.py similarity index 88% rename from mlscorecheck/bundles/skinlesion/_isic2016.py rename to mlscorecheck/check/bundles/skinlesion/_isic2016.py index cf623d7..41868af 100644 --- a/mlscorecheck/bundles/skinlesion/_isic2016.py +++ b/mlscorecheck/check/bundles/skinlesion/_isic2016.py @@ -2,9 +2,9 @@ This module implements the tests for the ISIC2016 dataset """ -from ...experiments import get_experiment -from ...check import check_1_testset_no_kfold_scores -from ...core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import check_1_testset_no_kfold +from ....core import NUMERICAL_TOLERANCE __all__ = ['check_isic2016'] @@ -33,14 +33,14 @@ def check_isic2016(*, prefiltering by using the solutions for the score pairs. Examples: - >>> from mlscorecheck.bundles.skinlesion import check_isic2016 + >>> from mlscorecheck.check.bundles.skinlesion import check_isic2016 >>> scores = {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145} >>> results = check_isic2016(scores=scores, eps=1e-4) >>> results['inconsistency'] # False """ data = get_experiment('skinlesion.isic2016') - return check_1_testset_no_kfold_scores(scores=scores, + return check_1_testset_no_kfold(scores=scores, testset=data, eps=eps, numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/bundles/skinlesion/_isic2017.py b/mlscorecheck/check/bundles/skinlesion/_isic2017.py similarity index 93% rename from mlscorecheck/bundles/skinlesion/_isic2017.py rename to mlscorecheck/check/bundles/skinlesion/_isic2017.py index 88aab2b..4b15597 100644 --- a/mlscorecheck/bundles/skinlesion/_isic2017.py +++ b/mlscorecheck/check/bundles/skinlesion/_isic2017.py @@ -2,9 +2,9 @@ This module implements the tests for the ISIC2017 dataset """ -from ...experiments import get_experiment -from ...check import check_1_testset_no_kfold_scores -from ...core import NUMERICAL_TOLERANCE +from ....experiments import get_experiment +from ...binary import check_1_testset_no_kfold +from ....core import NUMERICAL_TOLERANCE __all__ = ['check_isic2017', '_prepare_testset_isic2017'] @@ -68,7 +68,7 @@ def check_isic2017(*, prefiltering by using the solutions for the score pairs. Examples: - >>> from mlscorecheck.bundles.skinlesion import check_isic2017 + >>> from mlscorecheck.check.bundles.skinlesion import check_isic2017 >>> scores = {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362} >>> results = check_isic2017(target='M', against=['SK', 'N'], @@ -80,7 +80,7 @@ def check_isic2017(*, testset = _prepare_testset_isic2017(target, against) - return check_1_testset_no_kfold_scores(scores=scores, + return check_1_testset_no_kfold(scores=scores, testset=testset, eps=eps, numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/__init__.py b/mlscorecheck/check/multiclass/__init__.py new file mode 100644 index 0000000..0554f3b --- /dev/null +++ b/mlscorecheck/check/multiclass/__init__.py @@ -0,0 +1,6 @@ +""" +This module brings together all multiclass test functionalities +""" + +from ._check_1_testset_no_kfold_macro import * +from ._check_1_testset_no_kfold_micro import * diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py new file mode 100644 index 0000000..e69de29 diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py new file mode 100644 index 0000000..e69de29 diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py new file mode 100644 index 0000000..872f4e3 --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py @@ -0,0 +1,89 @@ +""" +This module implements the consistency testing for multiclass macro averages +supposing one evaluation set +""" + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary + +from ..binary import check_1_dataset_known_folds_mos + +__all__ = ['check_1_testset_no_kfold_macro'] + +def check_1_testset_no_kfold_macro(testset: dict, + scores: dict, + eps, + *, + class_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + Checking the consistency of scores calculated by taking the macro average + on one single multiclass dataset. Note that this + test can only check the consistency of the 'acc', 'sens', 'spec' + and 'bacc' scores. Note that without bounds, if there is a large + number of classes, it is likely that there will be a configuration + matching the scores provided. In order to increase the strength of + the test, one can add class_scores_bounds if + for example, besides the average score, the minimum and the maximum + scores over the classes are also provided. + + Args: + testset (dict): the specification of the testset + scores (dict(str,float)): the scores to check + eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + class_score_bounds (None|dict): bounds on the scores in the classes + solver_name (None|str): the solver to use + timeout (None|int): the timeout for the linear programming solver in seconds + verbosity (int): the verbosity level of the pulp linear programming solver + 0: silent, non-zero: verbose. + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. + + Returns: + dict: the dictionary of the results of the analysis, the + ``inconsistency`` entry indicates if inconsistencies have + been found. The aggregated_results entry is empty if + the execution of the linear programming based check was + unnecessary. The result has four more keys. Under ``lp_status`` + one finds the status of the lp solver, under ``lp_configuration_scores_match`` + one finds a flag indicating if the scores from the lp configuration + match the scores provided, ``lp_configuration_bounds_match`` indicates + if the specified bounds match the actual figures and finally + ``lp_configuration`` contains the actual configuration of the + linear programming solver. + + Raises: + ValueError: if the problem is not specified properly + + Examples: + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308} + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # False + + >>> scores['acc'] = 0.8464 + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # True + """ + folds = transform_multiclass_fold_to_binary(testset) + dataset = {'p': sum(fold['p'] for fold in folds), + 'n': sum(fold['n'] for fold in folds)} + + return check_1_dataset_known_folds_mos(scores=scores, + eps=eps, + dataset=dataset, + folding={'folds': folds}, + fold_score_bounds=class_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py new file mode 100644 index 0000000..32e981e --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py @@ -0,0 +1,76 @@ +""" +This module implements the consistency testing for multiclass micro averages +supposing one evaluation set +""" + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary + +from ..binary import check_1_dataset_som + +__all__ = ['check_1_testset_no_kfold_micro'] + +def check_1_testset_no_kfold_micro(testset: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + Checking the consistency of scores calculated by taking the micro average + on one single multiclass dataset. Note that this + test can only check the consistency of the 'acc', 'sens', 'spec' + and 'bacc' scores. Note that without bounds, if there is a large + number of classes, it is likely that there will be a configuration + matching the scores provided. In order to increase the strength of + the test, one can add class_scores_bounds if + for example, besides the average score, the minimum and the maximum + scores over the classes are also provided. + + Args: + testset (dict): the specification of the testset + scores (dict(str,float)): the scores to check + eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. + + Returns: + dict: the dictionary of the results of the analysis, the + ``inconsistency`` entry indicates if inconsistencies have + been found. The aggregated_results entry is empty if + the execution of the linear programming based check was + unnecessary. The result has four more keys. Under ``lp_status`` + one finds the status of the lp solver, under ``lp_configuration_scores_match`` + one finds a flag indicating if the scores from the lp configuration + match the scores provided, ``lp_configuration_bounds_match`` indicates + if the specified bounds match the actual figures and finally + ``lp_configuration`` contains the actual configuration of the + linear programming solver. + + Raises: + ValueError: if the problem is not specified properly + + Examples: + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308} + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # False + + >>> scores['acc'] = 0.8464 + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # True + """ + folds = transform_multiclass_fold_to_binary(testset) + dataset = {'p': sum(fold['p'] for fold in folds), + 'n': sum(fold['n'] for fold in folds)} + + return check_1_dataset_som(scores=scores, + eps=eps, + dataset=dataset, + folding={'folds': folds}, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/individual/__init__.py b/mlscorecheck/individual/__init__.py index bd0706f..77f3e1b 100644 --- a/mlscorecheck/individual/__init__.py +++ b/mlscorecheck/individual/__init__.py @@ -2,7 +2,6 @@ This module brings together all the logic related to individual scores """ -from ._calculate_scores import * from ._expression import * from ._interval import * from ._pair_solutions import * diff --git a/mlscorecheck/individual/_problem_generator.py b/mlscorecheck/individual/_problem_generator.py index 8409c46..d3ca114 100644 --- a/mlscorecheck/individual/_problem_generator.py +++ b/mlscorecheck/individual/_problem_generator.py @@ -4,11 +4,14 @@ import numpy as np -from ._calculate_scores import calculate_scores +from ..scores import calculate_scores __all__ = ['generate_problems', 'generate_1_problem', - 'generate_problem_and_scores'] + 'generate_problem_and_scores', + 'generate_multiclass_dataset', + 'sample_multiclass_dataset', + 'create_confusion_matrix'] def generate_problem_and_scores(*, max_p: int = 1000, @@ -131,3 +134,49 @@ def generate_problems(*, problems.append(problem) return (evaluations[0], problems[0]) if n_problems == 1 else (evaluations, problems) + +def generate_multiclass_dataset(random_state=None, + max_n_classes=5, + min_n_classes=2, + max_class_size=200, + min_class_size=10): + if not isinstance(random_state, np.random.RandomState): + random_state = np.random.RandomState(random_state) + + n_classes = random_state.randint(min_n_classes, max_n_classes+1) + classes = {class_idx: random_state.randint(min_class_size, max_class_size+1) + for class_idx in range(n_classes)} + + return classes + +def create_confusion_matrix(y_true, y_pred): + """ + Creates a confusion matrix + + Args: + y_true (np.ndarray): the true labels + y_pred (np.ndarray): the predicted labels + + Returns: + np.ndarray: the confusion matrix + """ + n_classes = max(y_true.max(), y_pred.max()) + 1 + confusion_matrix = np.zeros(shape=(n_classes, n_classes), dtype=int) + + for true, pred in zip(y_true, y_pred): + confusion_matrix[true, pred] += 1 + + return confusion_matrix + +def sample_multiclass_dataset(dataset, random_state=None): + if not isinstance(random_state, np.random.RandomState): + random_state = np.random.RandomState(random_state) + + sample = np.zeros(shape=(len(dataset), len(dataset)), dtype=int) + + for class_idx, count in dataset.items(): + sample[class_idx, :] = random_state.multinomial(count, + np.ones(len(dataset))/len(dataset), + size=1)[0] + + return sample diff --git a/mlscorecheck/scores/__init__.py b/mlscorecheck/scores/__init__.py index 583fe00..a129437 100644 --- a/mlscorecheck/scores/__init__.py +++ b/mlscorecheck/scores/__init__.py @@ -5,3 +5,5 @@ from ._scores import * from ._scores_standardized import * from ._score_bundles import * +from ._multiclass_scores import * +from ._calculate_scores import * diff --git a/mlscorecheck/individual/_calculate_scores.py b/mlscorecheck/scores/_calculate_scores.py similarity index 66% rename from mlscorecheck/individual/_calculate_scores.py rename to mlscorecheck/scores/_calculate_scores.py index 4b9374e..8378398 100644 --- a/mlscorecheck/individual/_calculate_scores.py +++ b/mlscorecheck/scores/_calculate_scores.py @@ -5,12 +5,16 @@ import math +import numpy as np + from ..core import safe_call, round_scores, logger -from ..scores import score_functions_with_solutions -from ..scores import score_specifications +from ._score_bundles import score_functions_with_solutions +from ._score_bundles import score_specifications +from ._multiclass_scores import multiclass_score_map __all__ = ['calculate_scores', - 'calculate_scores_for_lp'] + 'calculate_scores_for_lp', + 'calculate_multiclass_scores'] def calculate_scores_for_lp(problem: dict, score_subset: list = None) -> dict: """ @@ -87,3 +91,33 @@ def calculate_scores(problem: dict, results = round_scores(results, rounding_decimals) return results + +def calculate_multiclass_scores(confusion_matrix: np.array, + average=None, + *, + rounding_decimals: int = None, + additional_symbols: dict = None, + subset: list = None) -> dict: + """ + Calculates all scores with solutions + + Args: + confusion_matrix (np.array): the confusion matrix to calculate scores for + average (str): the mode of averaging ('macro'/'micro'/'weighted') + rounding_decimals (None|int): the decimal places to round to + additional_symbols (None|dict): additional symbols for the substitution + subset (None|list): the subset of scores to calculate + + Returns: + dict: the calculated scores + """ + additional_symbols = {} if additional_symbols is None else additional_symbols + params = {'confusion_matrix': confusion_matrix, + 'average': average} | additional_symbols + results = {score: safe_call(function, params) + for score, function in multiclass_score_map.items() + if subset is None or score in subset} + + results = round_scores(results, rounding_decimals) + + return results diff --git a/mlscorecheck/scores/_multiclass_scores.py b/mlscorecheck/scores/_multiclass_scores.py new file mode 100644 index 0000000..bf5fb95 --- /dev/null +++ b/mlscorecheck/scores/_multiclass_scores.py @@ -0,0 +1,583 @@ +""" +This module implements the multiclass scores +""" + +import math + +import numpy as np + +from ..core import safe_call + +from ._scores_standardized import (accuracy_standardized, + sensitivity_standardized, + specificity_standardized, + balanced_accuracy_standardized, + positive_predictive_value_standardized, + negative_predictive_value_standardized, + f_beta_positive_standardized, + f_beta_negative_standardized, + f1_positive_standardized, + f1_negative_standardized, + unified_performance_measure_standardized, + geometric_mean_standardized, + fowlkes_mallows_index_standardized, + markedness_standardized, + positive_likelihood_ratio_standardized, + negative_likelihood_ratio_standardized, + matthews_correlation_coefficient_standardized, + bookmaker_informedness_standardized, + prevalence_threshold_standardized, + diagnostic_odds_ratio_standardized, + jaccard_index_standardized, + cohens_kappa_standardized) +from ._score_bundles import score_specifications + +__all__ = ['multiclass_score_macro', + 'multiclass_score_micro', + 'multiclass_score_weighted', + 'multiclass_score', + 'multiclass_accuracy', + 'multiclass_sensitivity', + 'multiclass_specificity', + 'multiclass_balanced_accuracy', + 'multiclass_positive_predictive_value', + 'multiclass_negative_predictive_value', + 'multiclass_f_beta_positive', + 'multiclass_f_beta_negative', + 'multiclass_f1_positive', + 'multiclass_f1_negative', + 'multiclass_unified_performance_measure', + 'multiclass_geometric_mean', + 'multiclass_fowlkes_mallows_index', + 'multiclass_markedness', + 'multiclass_positive_likelihood_ratio', + 'multiclass_negative_likelihood_ratio', + 'multiclass_matthews_correlation_coefficient', + 'multiclass_bookmaker_informedness', + 'multiclass_prevalence_threshold', + 'multiclass_diagnostic_odds_ratio', + 'multiclass_jaccard_index', + 'multiclass_cohens_kappa', + 'multiclass_score_map'] + +def multiclass_score_macro(confusion_matrix, + score_function, + additional_params=None, + name=None): + """ + Calculates the multiclass macro average score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + score_function (callable): the score function to use + additional_params (None|dict): the additional parameters to use + name (None|str): the name of the score + + Returns: + float: the score + """ + additional_params = {} if additional_params is None else additional_params + additional_params = additional_params | {'sqrt': math.sqrt} + + counts = np.sum(confusion_matrix, axis=1) + n_total = np.sum(counts) + + scores = [safe_call(score_function, {'p': counts[idx], + 'n': n_total - counts[idx], + 'tp': confusion_matrix[idx, idx], + 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + + np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])} + | additional_params, + score_specifications[name].get('nans')) + for idx, count in enumerate(counts)] + + print(scores) + + return np.mean(scores) + +def multiclass_score_micro(confusion_matrix, + score_function, + additional_params=None, + name=None): + """ + Calculates the multiclass micro average score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + score_function (callable): the score function to use + additional_params (None|dict): the additional parameters to use + name (None|str): the name of the score + + Returns: + float: the score + """ + additional_params = {} if additional_params is None else additional_params + additional_params = additional_params | {'sqrt': math.sqrt} + + counts = np.sum(confusion_matrix, axis=1) + n_total = np.sum(counts) + + params = {'tp': 0, + 'tn': 0, + 'p': 0, + 'n': 0} + + for idx, count in enumerate(counts): + params['p'] += counts[idx] + params['n'] += n_total - counts[idx] + params['tp'] += confusion_matrix[idx, idx] + params['tn'] += np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + \ + np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx]) + + return safe_call(score_function, + params | additional_params, + score_specifications[name].get('nans')) + +def multiclass_score_weighted(confusion_matrix, + score_function, + additional_params=None, + name=None): + """ + Calculates the multiclass weighted macro average score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + score_function (callable): the score function to use + additional_params (None|dict): the additional parameters to use + name (None|str): the name of the score + + Returns: + float: the score + """ + additional_params = {} if additional_params is None else additional_params + additional_params = additional_params | {'sqrt': math.sqrt} + + counts = np.sum(confusion_matrix, axis=1) + n_total = np.sum(counts) + + scores = [safe_call(score_function, {'p': counts[idx], + 'n': n_total - counts[idx], + 'tp': confusion_matrix[idx, idx], + 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + + np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])} + | additional_params, + score_specifications[name].get('nans'))\ + * count / n_total + for idx, count in enumerate(counts)] + + return np.sum(scores) + +def multiclass_score(confusion_matrix, + score_function, + average, + additional_params=None, + name=None): + """ + Calculates the multiclass average score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + score_function (callable): the score function to use + average (str): the averaging to be used ('macro'/'micro'/'weighted') + additional_params (None|dict): the additional parameters to use + name (None|str): the name of the score + + Returns: + float: the score + """ + if average == 'micro': + return multiclass_score_micro(confusion_matrix, + score_function, + additional_params, + name) + if average == 'macro': + return multiclass_score_macro(confusion_matrix, + score_function, + additional_params, + name) + if average == 'weighted': + return multiclass_score_weighted(confusion_matrix, + score_function, + additional_params, + name) + + raise ValueError(f'averaging {average} is not supported') + +def multiclass_accuracy(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + accuracy_standardized, + average, + name='acc') + +def multiclass_sensitivity(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + sensitivity_standardized, + average, + name='sens') + +def multiclass_specificity(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + specificity_standardized, + average, + name='spec') + +def multiclass_balanced_accuracy(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + balanced_accuracy_standardized, + average, + name='bacc') + +def multiclass_positive_predictive_value(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + positive_predictive_value_standardized, + average, + name='ppv') + +def multiclass_negative_predictive_value(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + negative_predictive_value_standardized, + average, + name='npv') + +def multiclass_f_beta_positive(*, beta_positive, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + beta_positive (float): the beta value to be used + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + f_beta_positive_standardized, + average, + additional_params={'beta_positive': beta_positive}, + name='fbp') + +def multiclass_f_beta_negative(*, beta_negative, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + beta_negative (float): the beta value to be used + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + f_beta_negative_standardized, + average, + additional_params={'beta_negative': beta_negative}, + name='fbn') + +def multiclass_f1_positive(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + f1_positive_standardized, + average, + name='f1p') + +def multiclass_f1_negative(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + f1_negative_standardized, + average, + name='f1n') + +def multiclass_unified_performance_measure(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + unified_performance_measure_standardized, + average, + name='upm') + +def multiclass_geometric_mean(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + geometric_mean_standardized, + average, + name='gm') + +def multiclass_fowlkes_mallows_index(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + fowlkes_mallows_index_standardized, + average, + name='fm') + +def multiclass_markedness(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + markedness_standardized, + average, + name='mk') + +def multiclass_positive_likelihood_ratio(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + positive_likelihood_ratio_standardized, + average, + name='lrp') + +def multiclass_negative_likelihood_ratio(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + negative_likelihood_ratio_standardized, + average, + name='lrn') + +def multiclass_matthews_correlation_coefficient(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + matthews_correlation_coefficient_standardized, + average, + name='mcc') + +def multiclass_bookmaker_informedness(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + bookmaker_informedness_standardized, + average, + name='bm') + +def multiclass_prevalence_threshold(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + prevalence_threshold_standardized, + average, + name='pt') + +def multiclass_diagnostic_odds_ratio(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + diagnostic_odds_ratio_standardized, + average, + name='dor') + +def multiclass_jaccard_index(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + jaccard_index_standardized, + average, + name='ji') + +def multiclass_cohens_kappa(*, confusion_matrix, average): + """ + Calculates the multiclass score + + Args: + confusion_matrix (np.array): the confusion matrix (true labels in rows) + average (str): the averaging to be used ('macro'/'micro'/'weighted') + + Returns: + float: the score + """ + return multiclass_score(confusion_matrix, + cohens_kappa_standardized, + average, + name='kappa') + +multiclass_score_map = {'acc': multiclass_accuracy, + 'sens': multiclass_sensitivity, + 'spec': multiclass_specificity, + 'bacc': multiclass_balanced_accuracy, + 'ppv': multiclass_positive_predictive_value, + 'npv': multiclass_negative_predictive_value, + 'fbp': multiclass_f_beta_positive, + 'fbn': multiclass_f_beta_negative, + 'f1p': multiclass_f1_positive, + 'f1n': multiclass_f1_negative, + 'upm': multiclass_unified_performance_measure, + 'gm': multiclass_geometric_mean, + 'fm': multiclass_fowlkes_mallows_index, + 'mk': multiclass_markedness, + 'lrp': multiclass_positive_likelihood_ratio, + 'lrn': multiclass_negative_likelihood_ratio, + 'mcc': multiclass_matthews_correlation_coefficient, + 'bm': multiclass_bookmaker_informedness, + 'pt': multiclass_prevalence_threshold, + 'dor': multiclass_diagnostic_odds_ratio, + 'ji': multiclass_jaccard_index, + 'kappa': multiclass_cohens_kappa} diff --git a/mlscorecheck/scores/_scores_standardized.py b/mlscorecheck/scores/_scores_standardized.py index 4e250d0..29a464b 100644 --- a/mlscorecheck/scores/_scores_standardized.py +++ b/mlscorecheck/scores/_scores_standardized.py @@ -367,6 +367,7 @@ def prevalence_threshold_standardized(*, tp, tn, p, n, sqrt=math.sqrt): Returns: int|float|Interval|IntervalUnion: the score """ + print(tp, tn, p, n) return -p*(n*sqrt(tp*(n - tn)/(n*p)) - n + tn)/(-n*tp + p*(n - tn)) def diagnostic_odds_ratio_standardized(*, tp, tn, p, n): diff --git a/notebooks/development/038_multiclass.ipynb b/notebooks/development/038_multiclass.ipynb new file mode 100644 index 0000000..c371ca1 --- /dev/null +++ b/notebooks/development/038_multiclass.ipynb @@ -0,0 +1,606 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [], + "source": [ + "import numpy as np\n", + "from sklearn.model_selection import StratifiedKFold" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [], + "source": [ + "y = np.array([0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4])" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [], + "source": [ + "classes = {0: 3, 1: 5, 2: 4, 3: 10}" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "def multiclass_stratified_folds(classes, n_folds):\n", + " folds = []\n", + " y = np.hstack([np.repeat(key, value) for key, value in classes.items()])\n", + " for _, test in StratifiedKFold(n_splits=n_folds).split(y.reshape(-1, 1), y, y):\n", + " folds.append({idx: count for idx, count in enumerate(np.bincount(y[test]))})\n", + "\n", + " return folds" + ] + }, + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[{0: 1, 1: 2, 2: 1, 3: 4}, {0: 1, 1: 2, 2: 1, 3: 3}, {0: 1, 1: 1, 2: 2, 3: 3}]" + ] + }, + "execution_count": 6, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_stratified_folds(classes, 3)" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [], + "source": [ + "def transform_multiclass_fold_to_binary(fold):\n", + " n_total = sum(fold.values())\n", + " return [{'p': value, 'n': n_total - value} for value in fold.values()]" + ] + }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[{'p': 1, 'n': 7}, {'p': 2, 'n': 6}, {'p': 1, 'n': 7}, {'p': 4, 'n': 4}]" + ] + }, + "execution_count": 8, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "transform_multiclass_fold_to_binary(multiclass_stratified_folds(classes, 3)[0])" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [], + "source": [ + "def sample_multiclass_fold(fold, random_state=None):\n", + " if not isinstance(random_state, np.random.RandomState):\n", + " random_state = np.random.RandomState(random_state)\n", + "\n", + " sample = np.zeros(shape=(len(fold), len(fold)), dtype=int)\n", + "\n", + " for class_idx, count in fold.items():\n", + " sample[class_idx, :] = random_state.multinomial(count,\n", + " np.ones(len(fold))/len(fold),\n", + " size=1)[0]\n", + "\n", + " sums = np.sum(sample, axis=1)\n", + " values = np.array(list(fold.values()))\n", + "\n", + " assert np.all(sums == values)\n", + "\n", + " return sample\n" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [], + "source": [ + "fold = multiclass_stratified_folds(classes, 3)[0]" + ] + }, + { + "cell_type": "code", + "execution_count": 11, + "metadata": {}, + "outputs": [], + "source": [ + "confusion_fold = sample_multiclass_fold(fold, random_state=42)" + ] + }, + { + "cell_type": "code", + "execution_count": 12, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.core import safe_call" + ] + }, + { + "cell_type": "code", + "execution_count": 58, + "metadata": {}, + "outputs": [], + "source": [ + "def multiclass_score_macro(confusion_matrix, score_function):\n", + " counts = np.sum(confusion_matrix, axis=1)\n", + " n_total = np.sum(counts)\n", + "\n", + " scores = [safe_call(score_function, {'p': counts[idx],\n", + " 'n': n_total - counts[idx],\n", + " 'tp': confusion_matrix[idx, idx],\n", + " 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) +\n", + " np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])})\n", + " for idx, count in enumerate(counts)]\n", + "\n", + " return np.mean(scores)\n", + "\n", + "def multiclass_score_micro(confusion_matrix, score_function):\n", + " counts = np.sum(confusion_matrix, axis=1)\n", + " n_total = np.sum(counts)\n", + "\n", + " params = {'tp': 0,\n", + " 'tn': 0,\n", + " 'p': 0,\n", + " 'n': 0}\n", + "\n", + " for idx, count in enumerate(counts):\n", + " params['p'] += counts[idx]\n", + " params['n'] += n_total - counts[idx]\n", + " params['tp'] += confusion_matrix[idx, idx]\n", + " params['tn'] += np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + \\\n", + " np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])\n", + "\n", + " return safe_call(score_function, params)\n", + "\n", + "def multiclass_score_weighted(confusion_matrix, score_function):\n", + " counts = np.sum(confusion_matrix, axis=1)\n", + " n_total = np.sum(counts)\n", + "\n", + " scores = [safe_call(score_function, {'p': counts[idx],\n", + " 'n': n_total - counts[idx],\n", + " 'tp': confusion_matrix[idx, idx],\n", + " 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) +\n", + " np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])})\\\n", + " * count / n_total\n", + " for idx, count in enumerate(counts)]\n", + "\n", + " return np.sum(scores)\n", + "\n", + "def multiclass_scores(confusion_matrix, score_function, average):\n", + " if average == 'micro':\n", + " return multiclass_score_micro(confusion_matrix, score_function)\n", + " if average == 'macro':\n", + " return multiclass_score_macro(confusion_matrix, score_function)\n", + " if average == 'weighted':\n", + " return multiclass_score_weighted(confusion_matrix, score_function)\n", + "\n", + " raise ValueError(f'averaging {average} is not supported')\n", + "\n", + "def multiclass_accuracy(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, accuracy_standardized, average)\n", + "\n", + "def multiclass_sensitivity(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, sensitivity_standardized, average)\n", + "\n", + "def multiclass_specificity(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, specificity_standardized, average)\n", + "\n", + "def multiclass_balanced_accuracy(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, balanced_accuracy_standardized, average)\n", + "\n", + "def multiclass_positive_predictive_value(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, positive_predictive_value_standardized, average)\n", + "\n", + "def multiclass_negative_predictive_value(confusion_matrix, average):\n", + " return multiclass_score(confusion_matrix, negative_predictive_value_standardized, average)" + ] + }, + { + "cell_type": "code", + "execution_count": 59, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.scores import accuracy_standardized, sensitivity_standardized, specificity_standardized, balanced_accuracy_standardized, positive_predictive_value_standardized" + ] + }, + { + "cell_type": "code", + "execution_count": 60, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.640625" + ] + }, + "execution_count": 60, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_accuracy(confusion_fold)" + ] + }, + { + "cell_type": "code", + "execution_count": 61, + "metadata": {}, + "outputs": [], + "source": [ + "from sklearn.metrics import precision_recall_fscore_support" + ] + }, + { + "cell_type": "code", + "execution_count": 62, + "metadata": {}, + "outputs": [], + "source": [ + "y_true = np.random.randint(5, size=20)\n", + "y_pred = np.random.randint(5, size=20)" + ] + }, + { + "cell_type": "code", + "execution_count": 63, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "(0.4041666666666667, 0.25, 0.2638888888888889, None)" + ] + }, + "execution_count": 63, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "precision_recall_fscore_support(y_true, y_pred, average='weighted')" + ] + }, + { + "cell_type": "code", + "execution_count": 64, + "metadata": {}, + "outputs": [], + "source": [ + "confusion_matrix = np.zeros(shape=(5, 5))\n", + "for yt, yp in zip(y_true, y_pred):\n", + " confusion_matrix[yt, yp] += 1" + ] + }, + { + "cell_type": "code", + "execution_count": 65, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.25" + ] + }, + "execution_count": 65, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_sensitivity(confusion_matrix)" + ] + }, + { + "cell_type": "code", + "execution_count": 66, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.4041666666666667" + ] + }, + "execution_count": 66, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_positive_predictive_value(confusion_matrix)" + ] + }, + { + "cell_type": "code", + "execution_count": 40, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.66" + ] + }, + "execution_count": 40, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_accuracy(confusion_matrix)" + ] + }, + { + "cell_type": "code", + "execution_count": 41, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.7875" + ] + }, + "execution_count": 41, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_specificity(confusion_matrix)" + ] + }, + { + "cell_type": "code", + "execution_count": 33, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.18" + ] + }, + "execution_count": 33, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "multiclass_positive_predictive_value(confusion_matrix)" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [ + "tp = np.sum()" + ] + }, + { + "cell_type": "code", + "execution_count": 45, + "metadata": {}, + "outputs": [], + "source": [ + "def accuracy_multiclass(confusion_matrix):\n", + " counts = np.sum(confusion_matrix, axis=1)\n", + " n_total = np.sum(counts)\n", + "\n", + " accs = []\n", + "\n", + " for idx, count in enumerate(counts):\n", + " p = counts[idx]\n", + " n = n_total - counts[idx]\n", + " tp = confusion_matrix[idx, idx]\n", + " tn = np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])\n", + " accs.append((tp + tn) / (p + n))\n", + "\n", + " return np.mean(accs)" + ] + }, + { + "cell_type": "code", + "execution_count": 46, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.6875" + ] + }, + "execution_count": 46, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "accuracy_multiclass(confusion_fold)" + ] + }, + { + "cell_type": "code", + "execution_count": 47, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check import check_1_dataset_known_folds_mos_scores" + ] + }, + { + "cell_type": "code", + "execution_count": 50, + "metadata": {}, + "outputs": [], + "source": [ + "binary_folds = transform_multiclass_fold_to_binary(fold)" + ] + }, + { + "cell_type": "code", + "execution_count": 52, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a065da42bbc34847a634d09fae57c662-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a065da42bbc34847a634d09fae57c662-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 7 COLUMNS\n", + "At line 41 RHS\n", + "At line 44 BOUNDS\n", + "At line 54 ENDATA\n", + "Problem MODEL has 2 rows, 9 columns and 16 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0000I Cut generators found to be infeasible! (or unbounded)\n", + "Pre-processing says infeasible or unbounded\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "{'inconsistency': True,\n", + " 'lp_status': 'infeasible',\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 1,\n", + " 'n': 7,\n", + " 'identifier': 'fkrkv',\n", + " 'tp': 0.0,\n", + " 'tn': 7.0},\n", + " 'scores': {'acc': 0.875},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 2, 'n': 6, 'identifier': 'wpxvc', 'tp': 0.0, 'tn': 6.0},\n", + " 'scores': {'acc': 0.75},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 1, 'n': 7, 'identifier': 'ngfid', 'tp': 0.0, 'tn': 7.0},\n", + " 'scores': {'acc': 0.875},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 4,\n", + " 'n': 4,\n", + " 'identifier': 'yvtsr',\n", + " 'tp': 0.0,\n", + " 'tn': 1.990368},\n", + " 'scores': {'acc': 0.248796},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.687199},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 1,\n", + " 'n': 7,\n", + " 'identifier': 'fkrkv',\n", + " 'tp': 0.0,\n", + " 'tn': 7.0},\n", + " 'scores': {'acc': 0.875},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 2, 'n': 6, 'identifier': 'wpxvc', 'tp': 0.0, 'tn': 6.0},\n", + " 'scores': {'acc': 0.75},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 1, 'n': 7, 'identifier': 'ngfid', 'tp': 0.0, 'tn': 7.0},\n", + " 'scores': {'acc': 0.875},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 4,\n", + " 'n': 4,\n", + " 'identifier': 'yvtsr',\n", + " 'tp': 0.0,\n", + " 'tn': 1.990368},\n", + " 'scores': {'acc': 0.248796},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}}" + ] + }, + "execution_count": 52, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "check_1_dataset_known_folds_mos_scores(dataset={'p': 8, 'n': 24}, folding={'folds': binary_folds}, eps=1e-4, scores={'acc': 0.6873})" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/00_check_1_testset_no_kfold.ipynb b/notebooks/illustration/00_check_1_testset_no_kfold.ipynb index 058a9ac..4f8b0b5 100644 --- a/notebooks/illustration/00_check_1_testset_no_kfold.ipynb +++ b/notebooks/illustration/00_check_1_testset_no_kfold.ipynb @@ -2,84 +2,84 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 9, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_1_testset_no_kfold_scores\n", - "from mlscorecheck.individual import calculate_scores, generate_problem_and_scores" + "from mlscorecheck.check.binary import check_1_testset_no_kfold\n", + "from mlscorecheck.individual import generate_problem_and_scores" ] }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 10, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:37:54,468:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:37:54,472:INFO:calling the score check with scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", - "2023-10-26 23:37:54,473:INFO:checking the scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "2023-10-26 23:37:54,474:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:37:54,474:INFO:intervals before: (0, 530), (0, 902)\n", - "2023-10-26 23:37:54,475:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-26 23:37:54,476:INFO:the tn solutions: (751.6160759999999, 790.8639240000001)\n", - "2023-10-26 23:37:54,476:INFO:intervals after: [(112, 121)], [(752, 790)]\n", - "2023-10-26 23:37:54,477:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:37:54,478:INFO:intervals before: [(112, 121)], [(752, 790)]\n", - "2023-10-26 23:37:54,479:INFO:the tp solutions: (88.77533199999993, 135.4646680000002)\n", - "2023-10-26 23:37:54,480:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-26 23:37:54,481:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,482:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:37:54,483:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,485:INFO:the tp solutions: (108.20512460931658, 125.45746857652338)\n", - "2023-10-26 23:37:54,486:INFO:the tn solutions: (720.729741489652, 822.9954069390577)\n", - "2023-10-26 23:37:54,486:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,487:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-26 23:37:54,488:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,489:INFO:the tp solutions: (-16.316815204318672, 3.5854769758786067) | (101.7831884021151, 128.25349360431866)\n", - "2023-10-26 23:37:54,489:INFO:the tn solutions: (745.2636423956811, 800.379675597885) | (866.6502819978749, 921.7663152000788)\n", - "2023-10-26 23:37:54,491:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,492:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:37:54,492:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,493:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-26 23:37:54,493:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-26 23:37:54,495:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,495:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:37:54,496:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,497:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-26 23:37:54,498:INFO:the tn solutions: (657.2586176931766, 893.5046324530509)\n", - "2023-10-26 23:37:54,499:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,500:INFO:evaluating the tp and tn solution for sens and fm\n", - "2023-10-26 23:37:54,501:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,502:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-26 23:37:54,502:INFO:the tn solutions: (636.7166535970434, 917.0942703288408)\n", - "2023-10-26 23:37:54,503:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,504:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:37:54,505:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,505:INFO:the tp solutions: (109.76804841374923, 122.0385407814731)\n", - "2023-10-26 23:37:54,508:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-26 23:37:54,508:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,509:INFO:evaluating the tp and tn solution for spec and fm\n", - "2023-10-26 23:37:54,510:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,510:INFO:the tp solutions: (-65.8536328094769, -54.25856650052427) | (106.83422730052428, 121.82197200947691)\n", - "2023-10-26 23:37:54,511:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-26 23:37:54,512:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,512:INFO:evaluating the tp and tn solution for f1p and fm\n", - "2023-10-26 23:37:54,514:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,517:INFO:the tp solutions: (80.82924045095699, 294.0107283921828)\n", - "2023-10-26 23:37:54,518:INFO:the tn solutions: (-420.04420024360695, 1292.9374484676016)\n", - "2023-10-26 23:37:54,519:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-26 23:37:54,520:INFO:testing acc, feasible tptn pairs: 10\n", - "2023-10-26 23:37:54,522:INFO:testing sens, feasible tptn pairs: 10\n", - "2023-10-26 23:37:54,522:INFO:testing spec, feasible tptn pairs: 10\n", - "2023-10-26 23:37:54,523:INFO:testing f1p, feasible tptn pairs: 10\n", - "2023-10-26 23:37:54,525:INFO:testing fm, feasible tptn pairs: 10\n", - "2023-10-26 23:37:54,526:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:37:54,526:INFO:final number of intervals: 10\n", - "2023-10-26 23:37:54,527:INFO:final number of pairs: 130\n" + "2023-10-31 11:54:10,621:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-10-31 11:54:10,623:INFO:calling the score check with scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", + "2023-10-31 11:54:10,625:INFO:checking the scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "2023-10-31 11:54:10,627:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-10-31 11:54:10,628:INFO:intervals before: (0, 530), (0, 902)\n", + "2023-10-31 11:54:10,630:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-10-31 11:54:10,631:INFO:the tn solutions: (751.6160759999999, 790.8639240000001)\n", + "2023-10-31 11:54:10,633:INFO:intervals after: [(112, 121)], [(752, 790)]\n", + "2023-10-31 11:54:10,635:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-10-31 11:54:10,636:INFO:intervals before: [(112, 121)], [(752, 790)]\n", + "2023-10-31 11:54:10,638:INFO:the tp solutions: (88.77533199999993, 135.4646680000002)\n", + "2023-10-31 11:54:10,639:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-10-31 11:54:10,640:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,642:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-10-31 11:54:10,644:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,645:INFO:the tp solutions: (108.20512460931658, 125.45746857652338)\n", + "2023-10-31 11:54:10,646:INFO:the tn solutions: (720.729741489652, 822.9954069390577)\n", + "2023-10-31 11:54:10,648:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,650:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-10-31 11:54:10,652:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,653:INFO:the tp solutions: (-16.316815204318672, 3.5854769758786067) | (101.7831884021151, 128.25349360431866)\n", + "2023-10-31 11:54:10,655:INFO:the tn solutions: (745.2636423956811, 800.379675597885) | (866.6502819978749, 921.7663152000788)\n", + "2023-10-31 11:54:10,656:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,657:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-10-31 11:54:10,659:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,660:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-10-31 11:54:10,661:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-10-31 11:54:10,663:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,665:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-10-31 11:54:10,666:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,668:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-10-31 11:54:10,669:INFO:the tn solutions: (657.2586176931766, 893.5046324530509)\n", + "2023-10-31 11:54:10,670:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,671:INFO:evaluating the tp and tn solution for sens and fm\n", + "2023-10-31 11:54:10,672:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,674:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-10-31 11:54:10,675:INFO:the tn solutions: (636.7166535970434, 917.0942703288408)\n", + "2023-10-31 11:54:10,677:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,678:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-10-31 11:54:10,680:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,681:INFO:the tp solutions: (109.76804841374923, 122.0385407814731)\n", + "2023-10-31 11:54:10,682:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-10-31 11:54:10,684:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,685:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-10-31 11:54:10,687:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,688:INFO:the tp solutions: (-65.8536328094769, -54.25856650052427) | (106.83422730052428, 121.82197200947691)\n", + "2023-10-31 11:54:10,689:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-10-31 11:54:10,690:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,691:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-10-31 11:54:10,694:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,696:INFO:the tp solutions: (80.82924045095699, 294.0107283921828)\n", + "2023-10-31 11:54:10,697:INFO:the tn solutions: (-420.04420024360695, 1292.9374484676016)\n", + "2023-10-31 11:54:10,699:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-10-31 11:54:10,701:INFO:testing acc, feasible tptn pairs: 10\n", + "2023-10-31 11:54:10,704:INFO:testing sens, feasible tptn pairs: 10\n", + "2023-10-31 11:54:10,705:INFO:testing spec, feasible tptn pairs: 10\n", + "2023-10-31 11:54:10,706:INFO:testing f1p, feasible tptn pairs: 10\n", + "2023-10-31 11:54:10,708:INFO:testing fm, feasible tptn pairs: 10\n", + "2023-10-31 11:54:10,714:INFO:constructing final tp, tn pair set\n", + "2023-10-31 11:54:10,716:INFO:final number of intervals: 10\n", + "2023-10-31 11:54:10,717:INFO:final number of pairs: 130\n" ] }, { @@ -88,7 +88,7 @@ "False" ] }, - "execution_count": 2, + "execution_count": 10, "metadata": {}, "output_type": "execute_result" } @@ -97,46 +97,46 @@ "testset = {'p': 530, 'n': 902}\n", "scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", "\n", - "result = check_1_testset_no_kfold_scores(testset=testset,\n", - " scores=scores,\n", - " eps=1e-2)\n", + "result = check_1_testset_no_kfold(testset=testset,\n", + " scores=scores,\n", + " eps=1e-2)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 11, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:37:54,544:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:37:54,545:INFO:calling the score check with scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", - "2023-10-26 23:37:54,547:INFO:checking the scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "2023-10-26 23:37:54,548:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:37:54,549:INFO:intervals before: (0, 530), (0, 902)\n", - "2023-10-26 23:37:54,550:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-26 23:37:54,551:INFO:the tn solutions: (1181.216076, 1220.4639240000004)\n", - "2023-10-26 23:37:54,551:INFO:intervals after: [(112, 121)], []\n", - "2023-10-26 23:37:54,552:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:37:54,553:INFO:intervals before: [(112, 121)], []\n", - "2023-10-26 23:37:54,554:INFO:the tp solutions: (518.3753319999998, 565.0646680000003)\n", - "2023-10-26 23:37:54,555:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-26 23:37:54,556:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,557:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:37:54,559:INFO:intervals before: [], []\n", - "2023-10-26 23:37:54,559:INFO:the tp solutions: (20.470765551173063, 28.952218416378013)\n", - "2023-10-26 23:37:54,560:INFO:the tn solutions: (1232.0122032291965, 1355.3280073234066)\n", - "2023-10-26 23:37:54,561:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,561:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-26 23:37:54,564:INFO:all negative bases - iteration finished\n", - "2023-10-26 23:37:54,565:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:37:54,566:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:37:54,567:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:37:54,568:INFO:final number of intervals: 0\n", - "2023-10-26 23:37:54,569:INFO:final number of pairs: 0\n" + "2023-10-31 11:54:10,754:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-10-31 11:54:10,756:INFO:calling the score check with scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", + "2023-10-31 11:54:10,759:INFO:checking the scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "2023-10-31 11:54:10,761:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-10-31 11:54:10,763:INFO:intervals before: (0, 530), (0, 902)\n", + "2023-10-31 11:54:10,764:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-10-31 11:54:10,765:INFO:the tn solutions: (1181.216076, 1220.4639240000004)\n", + "2023-10-31 11:54:10,767:INFO:intervals after: [(112, 121)], []\n", + "2023-10-31 11:54:10,769:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-10-31 11:54:10,770:INFO:intervals before: [(112, 121)], []\n", + "2023-10-31 11:54:10,772:INFO:the tp solutions: (518.3753319999998, 565.0646680000003)\n", + "2023-10-31 11:54:10,773:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-10-31 11:54:10,774:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,775:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-10-31 11:54:10,778:INFO:intervals before: [], []\n", + "2023-10-31 11:54:10,779:INFO:the tp solutions: (20.470765551173063, 28.952218416378013)\n", + "2023-10-31 11:54:10,780:INFO:the tn solutions: (1232.0122032291965, 1355.3280073234066)\n", + "2023-10-31 11:54:10,781:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,782:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-10-31 11:54:10,783:INFO:all negative bases - iteration finished\n", + "2023-10-31 11:54:10,784:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-10-31 11:54:10,785:INFO:no more feasible tp,tn pairs left\n", + "2023-10-31 11:54:10,786:INFO:constructing final tp, tn pair set\n", + "2023-10-31 11:54:10,788:INFO:final number of intervals: 0\n", + "2023-10-31 11:54:10,789:INFO:final number of pairs: 0\n" ] }, { @@ -145,7 +145,7 @@ "True" ] }, - "execution_count": 3, + "execution_count": 11, "metadata": {}, "output_type": "execute_result" } @@ -154,59 +154,59 @@ "testset = {'p': 530, 'n': 902}\n", "scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", "\n", - "result = check_1_testset_no_kfold_scores(testset=testset,\n", - " scores=scores,\n", - " eps=1e-2)\n", + "result = check_1_testset_no_kfold(testset=testset,\n", + " scores=scores,\n", + " eps=1e-2)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 12, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:37:54,581:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:37:54,582:INFO:calling the score check with scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}, uncertainty 0.001, p 1029 and n 3118\n", - "2023-10-26 23:37:54,583:INFO:checking the scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}\n", - "2023-10-26 23:37:54,584:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:37:54,585:INFO:intervals before: (0, 1029), (0, 3118)\n", - "2023-10-26 23:37:54,586:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-26 23:37:54,587:INFO:the tn solutions: (2989.965647999999, 3000.3383520000007)\n", - "2023-10-26 23:37:54,587:INFO:intervals after: [(961, 962)], [(2990, 3000)]\n", - "2023-10-26 23:37:54,588:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:37:54,589:INFO:intervals before: [(961, 962)], [(2990, 3000)]\n", - "2023-10-26 23:37:54,590:INFO:the tp solutions: (877.7284699999991, 892.2875300000005)\n", - "2023-10-26 23:37:54,591:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-26 23:37:54,592:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,593:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-10-26 23:37:54,594:INFO:intervals before: [], []\n", - "2023-10-26 23:37:54,595:INFO:the tp solutions: (933.6679509487356, 949.8052939947056)\n", - "2023-10-26 23:37:54,595:INFO:the tn solutions: (2988.3769250334417, 3040.8179565580203)\n", - "2023-10-26 23:37:54,596:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,599:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:37:54,600:INFO:intervals before: [], []\n", - "2023-10-26 23:37:54,601:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-26 23:37:54,602:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-26 23:37:54,602:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,603:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-10-26 23:37:54,604:INFO:intervals before: [], []\n", - "2023-10-26 23:37:54,604:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-26 23:37:54,605:INFO:the tn solutions: (3002.3483691722586, 3022.4720549935846)\n", - "2023-10-26 23:37:54,606:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,607:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-10-26 23:37:54,608:INFO:intervals before: [], []\n", - "2023-10-26 23:37:54,609:INFO:the tp solutions: (392.8031470217782, 459.241011658118)\n", - "2023-10-26 23:37:54,610:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-26 23:37:54,610:INFO:intervals after: [], []\n", - "2023-10-26 23:37:54,611:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:37:54,612:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:37:54,613:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:37:54,613:INFO:final number of intervals: 0\n", - "2023-10-26 23:37:54,616:INFO:final number of pairs: 0\n" + "2023-10-31 11:54:10,814:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-10-31 11:54:10,817:INFO:calling the score check with scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}, uncertainty 0.001, p 1029 and n 3118\n", + "2023-10-31 11:54:10,820:INFO:checking the scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}\n", + "2023-10-31 11:54:10,821:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-10-31 11:54:10,823:INFO:intervals before: (0, 1029), (0, 3118)\n", + "2023-10-31 11:54:10,824:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-10-31 11:54:10,827:INFO:the tn solutions: (2989.965647999999, 3000.3383520000007)\n", + "2023-10-31 11:54:10,829:INFO:intervals after: [(961, 962)], [(2990, 3000)]\n", + "2023-10-31 11:54:10,831:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-10-31 11:54:10,832:INFO:intervals before: [(961, 962)], [(2990, 3000)]\n", + "2023-10-31 11:54:10,833:INFO:the tp solutions: (877.7284699999991, 892.2875300000005)\n", + "2023-10-31 11:54:10,834:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-10-31 11:54:10,836:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,837:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-10-31 11:54:10,839:INFO:intervals before: [], []\n", + "2023-10-31 11:54:10,840:INFO:the tp solutions: (933.6679509487356, 949.8052939947056)\n", + "2023-10-31 11:54:10,842:INFO:the tn solutions: (2988.3769250334417, 3040.8179565580203)\n", + "2023-10-31 11:54:10,843:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,844:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-10-31 11:54:10,845:INFO:intervals before: [], []\n", + "2023-10-31 11:54:10,847:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-10-31 11:54:10,854:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-10-31 11:54:10,856:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,857:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-10-31 11:54:10,859:INFO:intervals before: [], []\n", + "2023-10-31 11:54:10,860:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-10-31 11:54:10,861:INFO:the tn solutions: (3002.3483691722586, 3022.4720549935846)\n", + "2023-10-31 11:54:10,862:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,863:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-10-31 11:54:10,865:INFO:intervals before: [], []\n", + "2023-10-31 11:54:10,867:INFO:the tp solutions: (392.8031470217782, 459.241011658118)\n", + "2023-10-31 11:54:10,868:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-10-31 11:54:10,869:INFO:intervals after: [], []\n", + "2023-10-31 11:54:10,871:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-10-31 11:54:10,872:INFO:no more feasible tp,tn pairs left\n", + "2023-10-31 11:54:10,873:INFO:constructing final tp, tn pair set\n", + "2023-10-31 11:54:10,874:INFO:final number of intervals: 0\n", + "2023-10-31 11:54:10,875:INFO:final number of pairs: 0\n" ] }, { @@ -215,13 +215,13 @@ "True" ] }, - "execution_count": 4, + "execution_count": 12, "metadata": {}, "output_type": "execute_result" } ], "source": [ - "result = check_1_testset_no_kfold_scores(\n", + "result = check_1_testset_no_kfold(\n", " scores={'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901},\n", " eps=1e-3,\n", " testset={'name': 'common_datasets.ADA'}\n", @@ -231,17 +231,17 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 13, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "({'p': 112, 'n': 268},\n", - " {'acc': 0.55, 'sens': 0.99, 'spec': 0.37, 'f1p': 0.57, 'fm': 0.63})" + "({'p': 210, 'n': 745},\n", + " {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56})" ] }, - "execution_count": 5, + "execution_count": 13, "metadata": {}, "output_type": "execute_result" } @@ -255,81 +255,81 @@ }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 14, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:37:54,643:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:37:54,645:INFO:calling the score check with scores {'acc': 0.55, 'sens': 0.99, 'spec': 0.37, 'f1p': 0.57, 'fm': 0.63}, uncertainty 0.01, p 112 and n 268\n", - "2023-10-26 23:37:54,646:INFO:checking the scores {'acc': 0.55, 'sens': 0.99, 'spec': 0.37, 'f1p': 0.57, 'fm': 0.63}\n", - "2023-10-26 23:37:54,647:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:37:54,648:INFO:intervals before: (0, 112), (0, 268)\n", - "2023-10-26 23:37:54,648:INFO:the tp solutions: (109.75977599999999, 112)\n", - "2023-10-26 23:37:54,650:INFO:the tn solutions: (93.19923999999997, 103.04098400000004)\n", - "2023-10-26 23:37:54,652:INFO:intervals after: [(110, 112)], [(94, 103)]\n", - "2023-10-26 23:37:54,653:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:37:54,653:INFO:intervals before: [(110, 112)], [(94, 103)]\n", - "2023-10-26 23:37:54,654:INFO:the tp solutions: (103.35870399999999, 116.32129600000002)\n", - "2023-10-26 23:37:54,655:INFO:the tn solutions: (96.47946400000001, 101.84053599999999)\n", - "2023-10-26 23:37:54,656:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,656:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:37:54,657:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,658:INFO:the tp solutions: (106.39865273512385, 120.69675379587524)\n", - "2023-10-26 23:37:54,661:INFO:the tn solutions: (75.65062613179025, 116.5375977962754)\n", - "2023-10-26 23:37:54,662:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,663:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-26 23:37:54,665:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,666:INFO:the tp solutions: (-26.167013822737445, -20.5967483940202) | (108.09086615402019, 116.48409606273746)\n", - "2023-10-26 23:37:54,666:INFO:the tn solutions: (88.71514393726252, 104.70989384597986) | (224.36209719312416, 240.3568471018415)\n", - "2023-10-26 23:37:54,667:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,669:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:37:54,669:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,670:INFO:the tp solutions: (109.75977599999999, 112)\n", - "2023-10-26 23:37:54,671:INFO:the tn solutions: (96.47946400000001, 101.84053599999999)\n", - "2023-10-26 23:37:54,671:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,672:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:37:54,673:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,673:INFO:the tp solutions: (109.75977599999999, 112)\n", - "2023-10-26 23:37:54,674:INFO:the tn solutions: (86.66262364689761, 117.57440562287725)\n", - "2023-10-26 23:37:54,675:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,675:INFO:evaluating the tp and tn solution for sens and fm\n", - "2023-10-26 23:37:54,676:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,676:INFO:the tp solutions: (109.75977599999999, 112)\n", - "2023-10-26 23:37:54,677:INFO:the tn solutions: (81.07840207674045, 125.0908482462938)\n", - "2023-10-26 23:37:54,681:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,682:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:37:54,684:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,684:INFO:the tp solutions: (108.17258831659396, 115.80472502149439)\n", - "2023-10-26 23:37:54,685:INFO:the tn solutions: (96.47946400000001, 101.84053599999999)\n", - "2023-10-26 23:37:54,686:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,686:INFO:evaluating the tp and tn solution for spec and fm\n", - "2023-10-26 23:37:54,687:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,688:INFO:the tp solutions: (-69.4019512822148, -65.05442173085025) | (108.80148061085025, 114.5604924022148)\n", - "2023-10-26 23:37:54,689:INFO:the tn solutions: (96.47946400000001, 101.84053599999999)\n", - "2023-10-26 23:37:54,689:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,690:INFO:evaluating the tp and tn solution for f1p and fm\n", - "2023-10-26 23:37:54,691:INFO:intervals before: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,692:INFO:the tp solutions: (37.132383488314474, 53.878624053768796) | (100.45698847265774, 121.5814110951982)\n", - "2023-10-26 23:37:54,692:INFO:the tn solutions: (46.44700588745767, 161.96547642627584) | (205.3172590296215, 332.388638045686)\n", - "2023-10-26 23:37:54,693:INFO:intervals after: [(110, 112)], [(97, 101)]\n", - "2023-10-26 23:37:54,693:INFO:testing acc, feasible tptn pairs: 3\n", - "2023-10-26 23:37:54,694:INFO:testing sens, feasible tptn pairs: 3\n", - "2023-10-26 23:37:54,695:INFO:testing spec, feasible tptn pairs: 3\n", - "2023-10-26 23:37:54,696:INFO:testing f1p, feasible tptn pairs: 3\n", - "2023-10-26 23:37:54,697:INFO:testing fm, feasible tptn pairs: 3\n", - "2023-10-26 23:37:54,698:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:37:54,699:INFO:final number of intervals: 3\n", - "2023-10-26 23:37:54,700:INFO:final number of pairs: 13\n" + "2023-10-31 11:54:10,923:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-10-31 11:54:10,924:INFO:calling the score check with scores {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56}, uncertainty 0.01, p 210 and n 745\n", + "2023-10-31 11:54:10,926:INFO:checking the scores {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56}\n", + "2023-10-31 11:54:10,928:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-10-31 11:54:10,929:INFO:intervals before: (0, 210), (0, 745)\n", + "2023-10-31 11:54:10,930:INFO:the tp solutions: (197.39958, 201.60042)\n", + "2023-10-31 11:54:10,932:INFO:the tn solutions: (333.1976699999999, 356.50233000000003)\n", + "2023-10-31 11:54:10,933:INFO:intervals after: [(198, 201)], [(334, 356)]\n", + "2023-10-31 11:54:10,935:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-10-31 11:54:10,936:INFO:intervals before: [(198, 201)], [(334, 356)]\n", + "2023-10-31 11:54:10,938:INFO:the tp solutions: (177.19659999999993, 211.20340000000004)\n", + "2023-10-31 11:54:10,941:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", + "2023-10-31 11:54:10,942:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,943:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-10-31 11:54:10,945:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,946:INFO:the tp solutions: (185.120712039396, 210.10263581436337)\n", + "2023-10-31 11:54:10,947:INFO:the tn solutions: (303.0201876109897, 392.7052872173289)\n", + "2023-10-31 11:54:10,948:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,949:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-10-31 11:54:10,952:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,953:INFO:the tp solutions: (-71.99544241189348, -61.34513581197725) | (190.70466541197726, 206.0599128118935)\n", + "2023-10-31 11:54:10,955:INFO:the tn solutions: (328.7381771881064, 363.1972445880227) | (593.7487386102972, 628.2078060102135)\n", + "2023-10-31 11:54:10,958:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,959:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-10-31 11:54:10,971:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,973:INFO:the tp solutions: (197.39958, 201.60042)\n", + "2023-10-31 11:54:10,976:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", + "2023-10-31 11:54:10,977:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,979:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-10-31 11:54:10,981:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,982:INFO:the tp solutions: (197.39958, 201.60042)\n", + "2023-10-31 11:54:10,983:INFO:the tn solutions: (299.8961076172496, 382.3002662528595)\n", + "2023-10-31 11:54:10,985:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,985:INFO:evaluating the tp and tn solution for sens and fm\n", + "2023-10-31 11:54:10,987:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,988:INFO:the tp solutions: (197.39958, 201.60042)\n", + "2023-10-31 11:54:10,992:INFO:the tn solutions: (281.73699880692305, 403.30020353302064)\n", + "2023-10-31 11:54:10,995:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:10,997:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-10-31 11:54:10,999:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,003:INFO:the tp solutions: (188.65112677679375, 204.1015852041003)\n", + "2023-10-31 11:54:11,004:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", + "2023-10-31 11:54:11,009:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,011:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-10-31 11:54:11,013:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,014:INFO:the tp solutions: (-136.23520570961827, -127.13922259117933) | (191.81898739117935, 203.2674409096183)\n", + "2023-10-31 11:54:11,018:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", + "2023-10-31 11:54:11,020:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,021:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-10-31 11:54:11,028:INFO:intervals before: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,030:INFO:the tp solutions: (56.03616326493973, 85.00819613176057) | (179.9747957264409, 218.80763214312438)\n", + "2023-10-31 11:54:11,031:INFO:the tn solutions: (212.67693278746776, 483.0344824810753) | (594.3566551997255, 897.1902513241985)\n", + "2023-10-31 11:54:11,033:INFO:intervals after: [(198, 201)], [(343, 356)]\n", + "2023-10-31 11:54:11,035:INFO:testing acc, feasible tptn pairs: 4\n", + "2023-10-31 11:54:11,036:INFO:testing sens, feasible tptn pairs: 4\n", + "2023-10-31 11:54:11,038:INFO:testing spec, feasible tptn pairs: 4\n", + "2023-10-31 11:54:11,039:INFO:testing f1p, feasible tptn pairs: 4\n", + "2023-10-31 11:54:11,040:INFO:testing fm, feasible tptn pairs: 4\n", + "2023-10-31 11:54:11,042:INFO:constructing final tp, tn pair set\n", + "2023-10-31 11:54:11,043:INFO:final number of intervals: 4\n", + "2023-10-31 11:54:11,044:INFO:final number of pairs: 46\n" ] } ], "source": [ - "result = check_1_testset_no_kfold_scores(scores=scores,\n", - " eps=1e-2,\n", - " testset=problem)" + "result = check_1_testset_no_kfold(scores=scores,\n", + " eps=1e-2,\n", + " testset=problem)" ] } ], diff --git a/notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb b/notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb new file mode 100644 index 0000000..29721aa --- /dev/null +++ b/notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb @@ -0,0 +1,209 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [], + "source": [ + "testset = {0: 10, 1: 100, 2: 80}" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [], + "source": [ + "scores = {'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308}" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00c2a3cf93104f659d5d86c75f078d01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00c2a3cf93104f659d5d86c75f078d01-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 49 RHS\n", + "At line 56 BOUNDS\n", + "At line 64 ENDATA\n", + "Problem MODEL has 6 rows, 7 columns and 24 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 127 iterations and 0 nodes (0.02 seconds)\n", + "Cbc0031I 3 added rows had average density of 5\n", + "Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 180 row cuts average 5.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 4 row cuts average 2.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 16 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 127 iterations and 0 nodes (0.02 seconds)\n", + "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 100 times and created 180 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 100 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Optimal solution found\n", + "\n", + "Objective value: 0.00000000\n", + "Enumerated nodes: 0\n", + "Total iterations: 127\n", + "Time (CPU seconds): 0.01\n", + "Time (Wallclock seconds): 0.02\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8464" + ] + }, + "execution_count": 7, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eaeb7a0ad078473dbe2dddaf2bd31a42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eaeb7a0ad078473dbe2dddaf2bd31a42-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 49 RHS\n", + "At line 56 BOUNDS\n", + "At line 64 ENDATA\n", + "Problem MODEL has 6 rows, 7 columns and 24 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Problem is infeasible - 0.00 seconds\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 6, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb new file mode 100644 index 0000000..2f3098b --- /dev/null +++ b/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb @@ -0,0 +1,164 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 17, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro" + ] + }, + { + "cell_type": "code", + "execution_count": 18, + "metadata": {}, + "outputs": [], + "source": [ + "testset = {0: 10, 1: 100, 2: 80}" + ] + }, + { + "cell_type": "code", + "execution_count": 19, + "metadata": {}, + "outputs": [], + "source": [ + "scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368,\n", + " 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}" + ] + }, + { + "cell_type": "code", + "execution_count": 20, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "{'acc': 0.5158,\n", + " 'sens': 0.2737,\n", + " 'spec': 0.6368,\n", + " 'bacc': 0.4553,\n", + " 'ppv': 0.2737,\n", + " 'npv': 0.6368}" + ] + }, + "execution_count": 20, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores" + ] + }, + { + "cell_type": "code", + "execution_count": 21, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-01 12:38:33,653:INFO:testing acc, feasible tptn pairs: 191\n", + "2023-11-01 12:38:33,658:INFO:testing sens, feasible tptn pairs: 191\n", + "2023-11-01 12:38:33,659:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-01 12:38:33,660:INFO:testing bacc, feasible tptn pairs: 1\n", + "2023-11-01 12:38:33,662:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-01 12:38:33,663:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-01 12:38:33,664:INFO:constructing final tp, tn pair set\n", + "2023-11-01 12:38:33,666:INFO:final number of intervals: 1\n", + "2023-11-01 12:38:33,666:INFO:final number of pairs: 1\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 21, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "results = check_1_testset_no_kfold_micro(testset=testset,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 22, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 23, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8184" + ] + }, + "execution_count": 23, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [ + "results = check_1_testset_no_kfold_micro(testset=testset,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/tests/aggregated/test_folding_utils.py b/tests/aggregated/test_folding_utils.py index 8fe42c0..8433f4e 100644 --- a/tests/aggregated/test_folding_utils.py +++ b/tests/aggregated/test_folding_utils.py @@ -9,13 +9,16 @@ import numpy as np from sklearn.model_selection import StratifiedKFold +from mlscorecheck.individual import generate_multiclass_dataset from mlscorecheck.aggregated import (stratified_configurations_sklearn, determine_fold_configurations, _create_folds, repeated_kfolds_generator, fold_partitioning_generator, _check_specification_and_determine_p_n, - determine_min_max_p) + determine_min_max_p, + multiclass_stratified_folds, + transform_multiclass_fold_to_binary) def test_generate_datasets_with_all_kfolds(): """ @@ -299,3 +302,33 @@ def test_determine_min_max_p(p, n, k, p_non_zero, n_non_zero): # pylint: disable assert min_p == min_p_full assert max_p == max_p_full + +def test_multiclass_stratified_folds(): + """ + Testing the generation of multiclass stratified folds + """ + + dataset = generate_multiclass_dataset(random_state=5) + + folds = multiclass_stratified_folds(dataset, n_folds=3) + + assert len(folds) == 3 + + counts = [0] * len(dataset) + + for fold in folds: + for class_, count in fold.items(): + counts[class_] += count + + assert counts == list(dataset.values()) + +def test_transform_multiclass_fold_to_binary(): + """ + Testing the transformation of a multiclass fold to binary folds + """ + + dataset = generate_multiclass_dataset(random_state=5) + + bfolds = transform_multiclass_fold_to_binary(dataset) + + assert len(bfolds) == len(dataset) diff --git a/tests/bundles/test_isic2016.py b/tests/bundles/test_isic2016.py index 65d56e6..b90c6a1 100644 --- a/tests/bundles/test_isic2016.py +++ b/tests/bundles/test_isic2016.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.skinlesion import check_isic2016 +from mlscorecheck.check.bundles.skinlesion import check_isic2016 from mlscorecheck.aggregated import generate_scores_for_testsets from mlscorecheck.experiments import get_experiment diff --git a/tests/bundles/test_isic2017.py b/tests/bundles/test_isic2017.py index 16a7723..c2316de 100644 --- a/tests/bundles/test_isic2017.py +++ b/tests/bundles/test_isic2017.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.skinlesion import check_isic2017, _prepare_testset_isic2017 +from mlscorecheck.check.bundles.skinlesion import check_isic2017, _prepare_testset_isic2017 from mlscorecheck.aggregated import generate_scores_for_testsets subsets = [(['M'], ['SK', 'N']), diff --git a/tests/bundles/test_retina_chasedb1.py b/tests/bundles/test_retina_chasedb1.py index 7b1042b..771195a 100644 --- a/tests/bundles/test_retina_chasedb1.py +++ b/tests/bundles/test_retina_chasedb1.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (check_chasedb1_vessel_image, +from mlscorecheck.check.bundles.retina import (check_chasedb1_vessel_image, check_chasedb1_vessel_aggregated) from mlscorecheck.experiments import get_experiment diff --git a/tests/bundles/test_retina_diaretdb0.py b/tests/bundles/test_retina_diaretdb0.py index d8e66b8..599ae52 100644 --- a/tests/bundles/test_retina_diaretdb0.py +++ b/tests/bundles/test_retina_diaretdb0.py @@ -4,8 +4,8 @@ import pytest -from mlscorecheck.bundles.retina import check_diaretdb0_class -from mlscorecheck.bundles.retina import _prepare_configuration_diaretdb0 +from mlscorecheck.check.bundles.retina import check_diaretdb0_class +from mlscorecheck.check.bundles.retina import _prepare_configuration_diaretdb0 from mlscorecheck.aggregated import generate_scores_for_testsets @pytest.mark.parametrize('class_name', ['neovascularisation', diff --git a/tests/bundles/test_retina_diaretdb1.py b/tests/bundles/test_retina_diaretdb1.py index cb1954d..06c9efb 100644 --- a/tests/bundles/test_retina_diaretdb1.py +++ b/tests/bundles/test_retina_diaretdb1.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (_prepare_configuration_diaretdb1, +from mlscorecheck.check.bundles.retina import (_prepare_configuration_diaretdb1, check_diaretdb1_class, check_diaretdb1_segmentation_image, check_diaretdb1_segmentation_aggregated, diff --git a/tests/bundles/test_retina_drishti_gs.py b/tests/bundles/test_retina_drishti_gs.py index d5ed9c7..32e9d7f 100644 --- a/tests/bundles/test_retina_drishti_gs.py +++ b/tests/bundles/test_retina_drishti_gs.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (_prepare_testsets_drishti_gs, +from mlscorecheck.check.bundles.retina import (_prepare_testsets_drishti_gs, check_drishti_gs_segmentation_image, check_drishti_gs_segmentation_aggregated) diff --git a/tests/bundles/test_retina_drive.py b/tests/bundles/test_retina_drive.py index 971b4e9..96fc3d9 100644 --- a/tests/bundles/test_retina_drive.py +++ b/tests/bundles/test_retina_drive.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (check_drive_vessel_image, +from mlscorecheck.check.bundles.retina import (check_drive_vessel_image, check_drive_vessel_aggregated) from mlscorecheck.experiments import get_experiment diff --git a/tests/bundles/test_retina_hrf.py b/tests/bundles/test_retina_hrf.py index 9e43d30..a885507 100644 --- a/tests/bundles/test_retina_hrf.py +++ b/tests/bundles/test_retina_hrf.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (check_hrf_vessel_image, +from mlscorecheck.check.bundles.retina import (check_hrf_vessel_image, check_hrf_vessel_aggregated) from mlscorecheck.experiments import get_experiment diff --git a/tests/bundles/test_retina_stare.py b/tests/bundles/test_retina_stare.py index 4dc05ec..4e81299 100644 --- a/tests/bundles/test_retina_stare.py +++ b/tests/bundles/test_retina_stare.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.bundles.retina import (check_stare_vessel_image, +from mlscorecheck.check.bundles.retina import (check_stare_vessel_image, check_stare_vessel_aggregated) from mlscorecheck.experiments import get_experiment diff --git a/tests/bundles/test_tpehg.py b/tests/bundles/test_tpehg.py index e0faf14..d7b021f 100644 --- a/tests/bundles/test_tpehg.py +++ b/tests/bundles/test_tpehg.py @@ -2,7 +2,7 @@ Testing the EHG testing """ -from mlscorecheck.bundles.ehg import check_tpehg +from mlscorecheck.check.bundles.ehg import check_tpehg def test_check_tpehg(): """ diff --git a/tests/check/test_1_dataset_known_folds_mos_scores.py b/tests/check/binary/test_1_dataset_known_folds_mos_scores.py similarity index 91% rename from tests/check/test_1_dataset_known_folds_mos_scores.py rename to tests/check/binary/test_1_dataset_known_folds_mos_scores.py index 389af34..dc8a7c2 100644 --- a/tests/check/test_1_dataset_known_folds_mos_scores.py +++ b/tests/check/binary/test_1_dataset_known_folds_mos_scores.py @@ -5,7 +5,7 @@ import pytest -from mlscorecheck.check import check_1_dataset_known_folds_mos_scores +from mlscorecheck.check.binary import check_1_dataset_known_folds_mos from mlscorecheck.aggregated import (generate_evaluation) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -23,7 +23,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True, rounding_decimals=rounding_decimals) - result = check_1_dataset_known_folds_mos_scores(dataset=evaluation['dataset'], + result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -46,7 +46,7 @@ def test_failure(random_seed: int, rounding_decimals: int): return_scores=True) scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_1_dataset_known_folds_mos_scores(dataset=evaluation['dataset'], + result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -69,7 +69,7 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): feasible_fold_score_bounds=True, rounding_decimals=rounding_decimals) - result = check_1_dataset_known_folds_mos_scores(dataset=evaluation['dataset'], + result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], folding=evaluation['folding'], fold_score_bounds=evaluation['fold_score_bounds'], scores=scores, @@ -95,7 +95,7 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): rounding_decimals=rounding_decimals) scores = {'acc': 0.9, 'bacc': 0.1, 'sens': 0.1, 'npv': 0.1, 'ppv': 0.1, 'f1': 0.9} - result = check_1_dataset_known_folds_mos_scores(dataset=evaluation['dataset'], + result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], folding=evaluation['folding'], fold_score_bounds=evaluation['fold_score_bounds'], scores=scores, diff --git a/tests/check/test_1_dataset_som_scores.py b/tests/check/binary/test_1_dataset_som_scores.py similarity index 89% rename from tests/check/test_1_dataset_som_scores.py rename to tests/check/binary/test_1_dataset_som_scores.py index 22da35a..4ba882a 100644 --- a/tests/check/test_1_dataset_som_scores.py +++ b/tests/check/binary/test_1_dataset_som_scores.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.check import check_1_dataset_som_scores +from mlscorecheck.check.binary import check_1_dataset_som from mlscorecheck.aggregated import (generate_evaluation) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -22,7 +22,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True, rounding_decimals=rounding_decimals) - result = check_1_dataset_som_scores(dataset=evaluation['dataset'], + result = check_1_dataset_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -45,7 +45,7 @@ def test_failure(random_seed: int, rounding_decimals: int): return_scores=True) scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_1_dataset_som_scores(dataset=evaluation['dataset'], + result = check_1_dataset_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -59,7 +59,7 @@ def test_adding_strategy(): evaluation = {'dataset': {'p': 5, 'n': 6}, 'folding': {'n_folds': 2, 'n_repeats': 1}} scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_1_dataset_som_scores(dataset=evaluation['dataset'], + result = check_1_dataset_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-4)) diff --git a/tests/check/test_1_dataset_unknown_folds_mos_scores.py b/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py similarity index 95% rename from tests/check/test_1_dataset_unknown_folds_mos_scores.py rename to tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py index 30e5d23..58b7226 100644 --- a/tests/check/test_1_dataset_unknown_folds_mos_scores.py +++ b/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py @@ -6,7 +6,7 @@ import numpy as np -from mlscorecheck.check import (check_1_dataset_unknown_folds_mos_scores, +from mlscorecheck.check.binary import (check_1_dataset_unknown_folds_mos, estimate_n_evaluations) from mlscorecheck.aggregated import Evaluation @@ -53,7 +53,7 @@ def test_success(random_seed: int, rounding_decimals: int, subset: list): evaluation = evaluation.to_dict() - results = check_1_dataset_unknown_folds_mos_scores( + results = check_1_dataset_unknown_folds_mos( scores=scores, eps=(10**(-rounding_decimals)), dataset=evaluation['dataset'], @@ -95,7 +95,7 @@ def test_failure(random_seed: int, rounding_decimals: int, subset: list): scores = {'sens': 0.7, 'spec': 0.7, 'bacc': 0.6, 'acc': 0.1234} scores = {key: value for key, value in scores.items() if key in subset} - results = check_1_dataset_unknown_folds_mos_scores( + results = check_1_dataset_unknown_folds_mos( scores=scores, eps=(10**(-rounding_decimals)), dataset=evaluation['dataset'], diff --git a/tests/check/test_1_testset_no_kfold_scores.py b/tests/check/binary/test_1_testset_no_kfold_scores.py similarity index 84% rename from tests/check/test_1_testset_no_kfold_scores.py rename to tests/check/binary/test_1_testset_no_kfold_scores.py index 35dd183..8e0ed55 100644 --- a/tests/check/test_1_testset_no_kfold_scores.py +++ b/tests/check/binary/test_1_testset_no_kfold_scores.py @@ -6,8 +6,9 @@ import pytest -from mlscorecheck.check import (check_1_testset_no_kfold_scores) -from mlscorecheck.individual import calculate_scores, generate_1_problem +from mlscorecheck.check.binary import (check_1_testset_no_kfold) +from mlscorecheck.individual import generate_1_problem +from mlscorecheck.scores import calculate_scores k = 4 # pylint: disable=invalid-name eps = 10**(-k) # pylint: disable=invalid-name @@ -17,7 +18,7 @@ def test_parametrization(): Testing the parametrization """ with pytest.raises(ValueError): - check_1_testset_no_kfold_scores(scores={}, + check_1_testset_no_kfold(scores={}, eps=1e-4, testset={'p': 5}) @@ -35,7 +36,7 @@ def test_warnings(): with warnings.catch_warnings(record=True) as warns: warnings.simplefilter("always") - result = check_1_testset_no_kfold_scores(scores=scores, + result = check_1_testset_no_kfold(scores=scores, eps=1e-2, testset=problem) assert len(warns) == 1 @@ -56,7 +57,7 @@ def test_consistent(): scores['beta_negative'] = 2 scores['beta_positive'] = 2 - result = check_1_testset_no_kfold_scores(scores=scores, + result = check_1_testset_no_kfold(scores=scores, eps=eps, testset=problem) @@ -78,7 +79,7 @@ def test_failure(): scores['beta_negative'] = 2 scores['beta_positive'] = 2 - result = check_1_testset_no_kfold_scores(scores=scores, + result = check_1_testset_no_kfold(scores=scores, eps=eps, testset=problem) @@ -94,7 +95,7 @@ def test_dataset(): 'sens': 0.89, 'spec': 0.91} - result = check_1_testset_no_kfold_scores(scores=scores, + result = check_1_testset_no_kfold(scores=scores, eps=1e-2, testset=problem) @@ -110,7 +111,7 @@ def test_dataset_failure(): 'sens': 0.89, 'spec': 0.91} - result = check_1_testset_no_kfold_scores(scores=scores, + result = check_1_testset_no_kfold(scores=scores, eps=0.00001, testset=problem) diff --git a/tests/check/test_n_datasets_mos_kfold_som_scores.py b/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py similarity index 90% rename from tests/check/test_n_datasets_mos_kfold_som_scores.py rename to tests/check/binary/test_n_datasets_mos_kfold_som_scores.py index 98eb98e..d894709 100644 --- a/tests/check/test_n_datasets_mos_kfold_som_scores.py +++ b/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py @@ -6,7 +6,7 @@ import pytest -from mlscorecheck.check import check_n_datasets_mos_kfold_som_scores +from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som from mlscorecheck.aggregated import (generate_experiment) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -26,7 +26,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals=rounding_decimals, return_scores=True) - result = check_n_datasets_mos_kfold_som_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_mos_kfold_som(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -50,7 +50,7 @@ def test_failure(random_seed: int, rounding_decimals: int): scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_n_datasets_mos_kfold_som_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_mos_kfold_som(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -73,7 +73,7 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): return_scores=True, feasible_dataset_score_bounds=True) - result = check_n_datasets_mos_kfold_som_scores( + result = check_n_datasets_mos_kfold_som( evaluations=experiment['evaluations'], dataset_score_bounds=experiment['dataset_score_bounds'], scores=scores, @@ -99,7 +99,7 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): return_scores=True, feasible_dataset_score_bounds=False) - result = check_n_datasets_mos_kfold_som_scores( + result = check_n_datasets_mos_kfold_som( evaluations=experiment['evaluations'], dataset_score_bounds=experiment['dataset_score_bounds'], scores=scores, @@ -114,12 +114,12 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_kfold_som_scores(evaluations=[{'aggregation': 'mos'}], + check_n_datasets_mos_kfold_som(evaluations=[{'aggregation': 'mos'}], scores={}, eps=1e-4) with pytest.raises(ValueError): - check_n_datasets_mos_kfold_som_scores(evaluations=[{'aggregation': 'som', + check_n_datasets_mos_kfold_som(evaluations=[{'aggregation': 'som', 'fold_score_bounds': {}}], scores={}, eps=1e-4) diff --git a/tests/check/test_n_datasets_mos_known_folds_mos_scores.py b/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py similarity index 90% rename from tests/check/test_n_datasets_mos_known_folds_mos_scores.py rename to tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py index 793e414..eadbbf4 100644 --- a/tests/check/test_n_datasets_mos_known_folds_mos_scores.py +++ b/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py @@ -6,7 +6,7 @@ import pytest -from mlscorecheck.check import check_n_datasets_mos_known_folds_mos_scores +from mlscorecheck.check.binary import check_n_datasets_mos_known_folds_mos from mlscorecheck.aggregated import (generate_experiment) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -26,7 +26,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): random_state=random_seed, return_scores=True) - result = check_n_datasets_mos_known_folds_mos_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_mos_known_folds_mos(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -50,7 +50,7 @@ def test_failure(random_seed: int, rounding_decimals: int): scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_n_datasets_mos_known_folds_mos_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_mos_known_folds_mos(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -73,7 +73,7 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): feasible_dataset_score_bounds=True, return_scores=True) - result = check_n_datasets_mos_known_folds_mos_scores( + result = check_n_datasets_mos_known_folds_mos( evaluations=experiment['evaluations'], dataset_score_bounds=experiment['dataset_score_bounds'], scores=scores, @@ -101,7 +101,7 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): scores = {'acc': 0.5, 'sens': 0.1, 'spec': 0.2, 'npv': 0.1, 'ppv': 0.1, 'f1': 0.9} - result = check_n_datasets_mos_known_folds_mos_scores( + result = check_n_datasets_mos_known_folds_mos( evaluations=experiment['evaluations'], dataset_score_bounds=experiment['dataset_score_bounds'], scores=scores, @@ -116,12 +116,12 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_known_folds_mos_scores(evaluations=[{'aggregation': 'som'}], + check_n_datasets_mos_known_folds_mos(evaluations=[{'aggregation': 'som'}], scores={}, eps=1e-4) with pytest.raises(ValueError): - check_n_datasets_mos_known_folds_mos_scores(evaluations=[{'aggregation': 'mos', + check_n_datasets_mos_known_folds_mos(evaluations=[{'aggregation': 'mos', 'fold_score_bounds': {}}], scores={}, eps=1e-4) diff --git a/tests/check/test_n_datasets_mos_unknown_folds_mos_scores.py b/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py similarity index 92% rename from tests/check/test_n_datasets_mos_unknown_folds_mos_scores.py rename to tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py index a70d93d..32759c0 100644 --- a/tests/check/test_n_datasets_mos_unknown_folds_mos_scores.py +++ b/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py @@ -6,7 +6,7 @@ import numpy as np -from mlscorecheck.check import (check_n_datasets_mos_unknown_folds_mos_scores, +from mlscorecheck.check.binary import (check_n_datasets_mos_unknown_folds_mos, estimate_n_experiments) from mlscorecheck.aggregated import (generate_experiment) @@ -108,7 +108,7 @@ def test_successful(random_seed: int, subset: list): remove_strategy_fsom_folding(experiment) - results = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=experiment['evaluations'], + results = check_n_datasets_mos_unknown_folds_mos(evaluations=experiment['evaluations'], scores=scores, eps=1e-4) @@ -131,7 +131,7 @@ def test_failure(random_seed: int, subset: list): scores = {'acc': 0.9, 'sens': 0.1, 'spec': 0.1, 'bacc': 0.05} - results = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=experiment['evaluations'], + results = check_n_datasets_mos_unknown_folds_mos(evaluations=experiment['evaluations'], scores=scores, eps=1e-4) @@ -143,12 +143,12 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_unknown_folds_mos_scores(evaluations=[{'aggregation': 'som'}], + check_n_datasets_mos_unknown_folds_mos(evaluations=[{'aggregation': 'som'}], scores={}, eps=1e-4) with pytest.raises(ValueError): - check_n_datasets_mos_unknown_folds_mos_scores(evaluations=[{'aggregation': 'mos', + check_n_datasets_mos_unknown_folds_mos(evaluations=[{'aggregation': 'mos', 'fold_score_bounds': {}}], scores={}, eps=1e-4) diff --git a/tests/check/test_n_datasets_som_kfold_som_scores.py b/tests/check/binary/test_n_datasets_som_kfold_som_scores.py similarity index 87% rename from tests/check/test_n_datasets_som_kfold_som_scores.py rename to tests/check/binary/test_n_datasets_som_kfold_som_scores.py index 1688ab8..3e0ee1c 100644 --- a/tests/check/test_n_datasets_som_kfold_som_scores.py +++ b/tests/check/binary/test_n_datasets_som_kfold_som_scores.py @@ -5,7 +5,7 @@ import pytest -from mlscorecheck.check import check_n_datasets_som_kfold_som_scores +from mlscorecheck.check.binary import check_n_datasets_som_kfold_som from mlscorecheck.aggregated import (generate_experiment) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -25,7 +25,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True, rounding_decimals=rounding_decimals) - result = check_n_datasets_som_kfold_som_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_som_kfold_som(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -50,7 +50,7 @@ def test_failure(random_seed: int, rounding_decimals: int): scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_n_datasets_som_kfold_som_scores(evaluations=experiment['evaluations'], + result = check_n_datasets_som_kfold_som(evaluations=experiment['evaluations'], scores=scores, eps=10**(-rounding_decimals)) @@ -62,6 +62,6 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_som_kfold_som_scores(evaluations=[{'aggregation': 'mos'}], + check_n_datasets_som_kfold_som(evaluations=[{'aggregation': 'mos'}], scores={}, eps=1e-4) diff --git a/tests/check/test_n_testsets_mos_no_kfold_scores.py b/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py similarity index 92% rename from tests/check/test_n_testsets_mos_no_kfold_scores.py rename to tests/check/binary/test_n_testsets_mos_no_kfold_scores.py index 552d423..268c05d 100644 --- a/tests/check/test_n_testsets_mos_no_kfold_scores.py +++ b/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py @@ -5,7 +5,7 @@ import pytest -from mlscorecheck.check import check_n_testsets_mos_no_kfold_scores +from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold from mlscorecheck.aggregated import (generate_experiment) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -29,7 +29,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True) testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] - result = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + result = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=10**(-rounding_decimals)) @@ -57,7 +57,7 @@ def test_failure(random_seed: int, rounding_decimals: int): scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_n_testsets_mos_no_kfold_scores(testsets=testsets, + result = check_n_testsets_mos_no_kfold(testsets=testsets, scores=scores, eps=10**(-rounding_decimals)) diff --git a/tests/check/test_n_testsets_som_no_kfold_scores.py b/tests/check/binary/test_n_testsets_som_no_kfold_scores.py similarity index 92% rename from tests/check/test_n_testsets_som_no_kfold_scores.py rename to tests/check/binary/test_n_testsets_som_no_kfold_scores.py index 7d8aede..19e194d 100644 --- a/tests/check/test_n_testsets_som_no_kfold_scores.py +++ b/tests/check/binary/test_n_testsets_som_no_kfold_scores.py @@ -5,7 +5,7 @@ import pytest -from mlscorecheck.check import check_n_testsets_som_no_kfold_scores +from mlscorecheck.check.binary import check_n_testsets_som_no_kfold from mlscorecheck.aggregated import (generate_experiment) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -29,7 +29,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True) testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] - result = check_n_testsets_som_no_kfold_scores(testsets=testsets, + result = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=10**(-rounding_decimals)) @@ -57,7 +57,7 @@ def test_failure(random_seed: int, rounding_decimals: int): scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_n_testsets_som_no_kfold_scores(testsets=testsets, + result = check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=10**(-rounding_decimals)) diff --git a/tests/check/multiclass/test_1_testset_no_kfold_macro.py b/tests/check/multiclass/test_1_testset_no_kfold_macro.py new file mode 100644 index 0000000..a0563bb --- /dev/null +++ b/tests/check/multiclass/test_1_testset_no_kfold_macro.py @@ -0,0 +1,66 @@ +""" +This module tests the 1 testset no kfold macro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro +from mlscorecheck.individual import (generate_multiclass_dataset, + sample_multiclass_dataset, + create_confusion_matrix) +from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_consistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='macro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + + result = check_1_testset_no_kfold_macro(testset=dataset, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_inconsistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='macro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_testset_no_kfold_macro(testset=dataset, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_testset_no_kfold_micro.py b/tests/check/multiclass/test_1_testset_no_kfold_micro.py new file mode 100644 index 0000000..3249595 --- /dev/null +++ b/tests/check/multiclass/test_1_testset_no_kfold_micro.py @@ -0,0 +1,69 @@ +""" +This module tests the 1 testset no kfold micro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro +from mlscorecheck.individual import (generate_multiclass_dataset, + sample_multiclass_dataset, + create_confusion_matrix) +from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_consistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='micro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + + print(dataset) + print(scores) + + result = check_1_testset_no_kfold_micro(testset=dataset, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_inconsistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='micro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_testset_no_kfold_micro(testset=dataset, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] diff --git a/tests/individual/test_check_tptn_solutions.py b/tests/individual/test_check_tptn_solutions.py index 5352a38..9934547 100644 --- a/tests/individual/test_check_tptn_solutions.py +++ b/tests/individual/test_check_tptn_solutions.py @@ -8,9 +8,9 @@ from mlscorecheck.individual import (check_scores_tptn_pairs, _check_scores_tptn_pairs, generate_1_problem, - calculate_scores, sqrt) -from mlscorecheck.scores import (score_functions_standardized_without_complements) +from mlscorecheck.scores import (score_functions_standardized_without_complements, + calculate_scores) score_functions = score_functions_standardized_without_complements diff --git a/tests/individual/test_problem_generator.py b/tests/individual/test_problem_generator.py index 9a04c13..6a0aba1 100644 --- a/tests/individual/test_problem_generator.py +++ b/tests/individual/test_problem_generator.py @@ -2,12 +2,16 @@ This module tests the problem generator """ +import pytest + import numpy as np from mlscorecheck.individual import (generate_problems, - calculate_scores, - generate_problem_and_scores) + generate_problem_and_scores, + generate_multiclass_dataset, + sample_multiclass_dataset) from mlscorecheck.core import round_scores +from mlscorecheck.scores import calculate_scores def test_generate_problem_and_scores(): """ @@ -63,3 +67,33 @@ def test_generate_problems(): evaluation, _ = generate_problems(zeros=['fn']) assert evaluation['tp'] == evaluation['p'] + +def test_generate_multiclass_dataset(): + """ + Testing the generation of a multiclass dataset + """ + + dataset = generate_multiclass_dataset(random_state=5, + max_n_classes=5) + + assert len(dataset) <= 5 + assert all(item > 0 for item in dataset.values()) + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_sample_multiclass_dataset(random_seed): + """ + Testing the sampling of a multiclass dataset + + Args: + random_seed (int): the random seed to be used + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + + sample = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + assert len(dataset) == len(sample) + sums = np.sum(sample, axis=1) + + assert np.all(sums == np.array(list(dataset.values()))) diff --git a/tests/individual/test_tptn_solutions.py b/tests/individual/test_tptn_solutions.py index 9e28e32..5e9aa6c 100644 --- a/tests/individual/test_tptn_solutions.py +++ b/tests/individual/test_tptn_solutions.py @@ -8,7 +8,8 @@ from mlscorecheck.core import safe_call from mlscorecheck.individual import (tptn_solutions, is_applicable_tptn, - generate_1_problem, calculate_scores) + generate_1_problem) +from mlscorecheck.scores import calculate_scores @pytest.mark.parametrize('figure', ['tp', 'tn']) @pytest.mark.parametrize("score", list(tptn_solutions.keys())) diff --git a/tests/individual/test_calculate_scores.py b/tests/scores/test_calculate_scores.py similarity index 50% rename from tests/individual/test_calculate_scores.py rename to tests/scores/test_calculate_scores.py index 1e1b893..ec79c68 100644 --- a/tests/individual/test_calculate_scores.py +++ b/tests/scores/test_calculate_scores.py @@ -2,7 +2,13 @@ This module tests the score calculation capabilities """ -from mlscorecheck.individual import calculate_scores, calculate_scores_for_lp +import pytest + +import numpy as np + +from mlscorecheck.scores import (calculate_scores, + calculate_scores_for_lp, + calculate_multiclass_scores) from mlscorecheck.scores import score_functions_with_solutions def test_calculate_scores(): @@ -26,3 +32,18 @@ def test_calculate_scores_for_lp(): scores = calculate_scores_for_lp({'p': 4, 'n': 0, 'tp': 3, 'tn': 0}) assert len(scores) == 2 + +@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) +def test_calculate_multiclass_scores(average): + """ + Testing the calculation of multiclass scores + + Args: + average (str): the mode of averaging + """ + confm = np.array([[5, 8, 3], [3, 10, 2], [2, 4, 11]]) + scores = calculate_multiclass_scores(confusion_matrix=confm, + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + average=average) + assert len(scores) > 0 diff --git a/tests/scores/test_multiclass_scores.py b/tests/scores/test_multiclass_scores.py new file mode 100644 index 0000000..1e84095 --- /dev/null +++ b/tests/scores/test_multiclass_scores.py @@ -0,0 +1,91 @@ +""" +This module tests the multiclass scores +""" + +import pytest + +import numpy as np + +from sklearn.metrics import precision_recall_fscore_support + +from mlscorecheck.core import safe_call +from mlscorecheck.scores import (multiclass_score_map, + multiclass_score, + score_functions_standardized_without_complements) +from mlscorecheck.individual import (generate_multiclass_dataset, + sample_multiclass_dataset, + create_confusion_matrix) + +@pytest.mark.parametrize('score', list(multiclass_score_map.keys())) +@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) +@pytest.mark.parametrize('random_seed', list(range(5))) +def test_multiclass_scores(score, average, random_seed): + """ + Testing a multiclass score + + Args: + score (str): the score to test + average (str): the averaging to be used + random_seed (int): the random seed to be used + """ + random_state = np.random.RandomState(random_seed) + dataset = generate_multiclass_dataset(random_state=random_seed) + matrix = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) + + params = {'confusion_matrix': matrix, + 'beta_positive': 2, + 'beta_negative': 2, + 'average': average} + + score_matrix = safe_call(multiclass_score_map[score], params) + + assert isinstance(score_matrix, float) + + permutation_mask = list(range(len(matrix))) + random_state.shuffle(permutation_mask) + + shuffled_matrix = matrix[permutation_mask][:, permutation_mask] + + params = {'confusion_matrix': shuffled_matrix, + 'beta_positive': 2, + 'beta_negative': 2, + 'average': average} + + score_shuffled = safe_call(multiclass_score_map[score], params) + + assert abs(score_matrix - score_shuffled) < 1e-8 + +@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) +@pytest.mark.parametrize('random_seed', list(range(5))) +def test_compare_to_sklearn(average, random_seed): + """ + Comparing sensitivity, positive predictive value and f1 to sklearn + + Args: + average (str): the averaging to be used + random_seed (int): the random seed to be used + """ + + random_state = np.random.RandomState(random_seed) + y_true = random_state.randint(0, 5, size=100) + y_pred = random_state.randint(0, 5, size=100) + + sample = create_confusion_matrix(y_true, y_pred) + + ppv, sens, f1, _ = precision_recall_fscore_support(y_true, y_pred, average=average) + + sens_score = multiclass_score_map['sens'](confusion_matrix=sample, average=average) + ppv_score = multiclass_score_map['ppv'](confusion_matrix=sample, average=average) + f1_score = multiclass_score_map['f1p'](confusion_matrix=sample, average=average) + + assert abs(sens - sens_score) < 1e-8 + assert abs(ppv - ppv_score) < 1e-8 + assert abs(f1 - f1_score) < 1e-8 + +def test_exception(): + """ + Testing the exception throwing + """ + + with pytest.raises(ValueError): + multiclass_score(None, None, 'dummy') \ No newline at end of file From 8313d12af470ede92edb9a8478507844848b50d2 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Wed, 1 Nov 2023 12:45:43 +0100 Subject: [PATCH 02/40] micro example added --- .../binary/_check_1_dataset_kfold_som.py | 7 +- .../_check_1_testset_no_kfold_micro.py | 42 ++++----- .../11_check_1_testset_no_kfold_micro.ipynb | 85 +++++++++---------- 3 files changed, 61 insertions(+), 73 deletions(-) diff --git a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py index feca21f..f4c3560 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py +++ b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py @@ -19,11 +19,8 @@ def check_1_dataset_som(dataset: dict, """ Checking the consistency of scores calculated by applying k-fold cross validation to one single dataset and aggregating the figures - over the folds in the score of means fashion. All pairs of - the supported individual scores are checked against all other as in - the 1_dataset_no_kfold case, however, additionally, if score_bounds - are specified in the folds, the aggregated check is also executed - on the supported acc, bacc, sens and spec scores. + over the folds in the score of means fashion. The test follows the + methodology of the the 1_dataset_no_kfold case. Args: dataset (dict): the dataset specification diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py index 32e981e..8981c29 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py @@ -17,14 +17,8 @@ def check_1_testset_no_kfold_micro(testset: dict, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores calculated by taking the micro average - on one single multiclass dataset. Note that this - test can only check the consistency of the 'acc', 'sens', 'spec' - and 'bacc' scores. Note that without bounds, if there is a large - number of classes, it is likely that there will be a configuration - matching the scores provided. In order to increase the strength of - the test, one can add class_scores_bounds if - for example, besides the average score, the minimum and the maximum - scores over the classes are also provided. + on one single multiclass dataset. The test follows the methodology of the + 1_dataset_som case. Args: testset (dict): the specification of the testset @@ -37,31 +31,31 @@ def check_1_testset_no_kfold_micro(testset: dict, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates + that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key + ``details`` provides further details from the analysis of the scores one after the other. + Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with + all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering + by using the solutions for the score pairs. Raises: ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro >>> testset = {0: 10, 1: 100, 2: 80} - >>> scores = {'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308} - >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, + 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8464 - >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> scores['acc'] = 0.8184 + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) >>> results['inconsistency'] # True """ diff --git a/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb index 2f3098b..b9607e6 100644 --- a/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb +++ b/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 17, + "execution_count": 1, "metadata": {}, "outputs": [], "source": [ @@ -11,7 +11,7 @@ }, { "cell_type": "code", - "execution_count": 18, + "execution_count": 2, "metadata": {}, "outputs": [], "source": [ @@ -20,7 +20,7 @@ }, { "cell_type": "code", - "execution_count": 19, + "execution_count": 3, "metadata": {}, "outputs": [], "source": [ @@ -30,47 +30,22 @@ }, { "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "{'acc': 0.5158,\n", - " 'sens': 0.2737,\n", - " 'spec': 0.6368,\n", - " 'bacc': 0.4553,\n", - " 'ppv': 0.2737,\n", - " 'npv': 0.6368}" - ] - }, - "execution_count": 20, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores" - ] - }, - { - "cell_type": "code", - "execution_count": 21, + "execution_count": 5, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-01 12:38:33,653:INFO:testing acc, feasible tptn pairs: 191\n", - "2023-11-01 12:38:33,658:INFO:testing sens, feasible tptn pairs: 191\n", - "2023-11-01 12:38:33,659:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-01 12:38:33,660:INFO:testing bacc, feasible tptn pairs: 1\n", - "2023-11-01 12:38:33,662:INFO:testing npv, feasible tptn pairs: 1\n", - "2023-11-01 12:38:33,663:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-11-01 12:38:33,664:INFO:constructing final tp, tn pair set\n", - "2023-11-01 12:38:33,666:INFO:final number of intervals: 1\n", - "2023-11-01 12:38:33,666:INFO:final number of pairs: 1\n" + "2023-11-01 12:41:04,041:INFO:testing acc, feasible tptn pairs: 191\n", + "2023-11-01 12:41:04,054:INFO:testing sens, feasible tptn pairs: 191\n", + "2023-11-01 12:41:04,060:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-01 12:41:04,063:INFO:testing bacc, feasible tptn pairs: 1\n", + "2023-11-01 12:41:04,065:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-01 12:41:04,067:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-01 12:41:04,068:INFO:constructing final tp, tn pair set\n", + "2023-11-01 12:41:04,070:INFO:final number of intervals: 1\n", + "2023-11-01 12:41:04,072:INFO:final number of pairs: 1\n" ] }, { @@ -79,7 +54,7 @@ "False" ] }, - "execution_count": 21, + "execution_count": 5, "metadata": {}, "output_type": "execute_result" } @@ -93,7 +68,7 @@ }, { "cell_type": "code", - "execution_count": 22, + "execution_count": 6, "metadata": {}, "outputs": [], "source": [ @@ -102,7 +77,7 @@ }, { "cell_type": "code", - "execution_count": 23, + "execution_count": 7, "metadata": {}, "outputs": [ { @@ -111,7 +86,7 @@ "0.8184" ] }, - "execution_count": 23, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } @@ -122,9 +97,31 @@ }, { "cell_type": "code", - "execution_count": null, + "execution_count": 8, "metadata": {}, - "outputs": [], + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-01 12:41:04,174:INFO:testing acc, feasible tptn pairs: 191\n", + "2023-11-01 12:41:04,194:INFO:no more feasible tp,tn pairs left\n", + "2023-11-01 12:41:04,197:INFO:constructing final tp, tn pair set\n", + "2023-11-01 12:41:04,198:INFO:final number of intervals: 0\n", + "2023-11-01 12:41:04,201:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 8, + "metadata": {}, + "output_type": "execute_result" + } + ], "source": [ "results = check_1_testset_no_kfold_micro(testset=testset,\n", " scores=scores,\n", From 0f7a220e80dbba8f3424dce4df7d3af94d7fae74 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Wed, 1 Nov 2023 12:47:59 +0100 Subject: [PATCH 03/40] regression init added --- mlscorecheck/check/regression/__init__.py | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 mlscorecheck/check/regression/__init__.py diff --git a/mlscorecheck/check/regression/__init__.py b/mlscorecheck/check/regression/__init__.py new file mode 100644 index 0000000..33094a5 --- /dev/null +++ b/mlscorecheck/check/regression/__init__.py @@ -0,0 +1,3 @@ +""" +This module implements the tests for regression scores. +""" \ No newline at end of file From 1ee4fdb60c111ba2601bb2139e91d38975a3187a Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Wed, 1 Nov 2023 21:53:12 +0100 Subject: [PATCH 04/40] all multiclass works --- mlscorecheck/aggregated/_folding_utils.py | 36 ++++++- mlscorecheck/aggregated/_generate_problems.py | 63 +++++++++++- mlscorecheck/check/multiclass/__init__.py | 2 + .../_check_1_dataset_known_folds_macro.py | 0 .../_check_1_dataset_known_folds_micro.py | 0 .../_check_1_dataset_known_folds_mos.py | 97 +++++++++++++++++++ .../_check_1_dataset_known_folds_som.py | 78 +++++++++++++++ mlscorecheck/check/regression/__init__.py | 4 +- .../check/regression/_check_regression.py | 9 ++ mlscorecheck/scores/_multiclass_scores.py | 2 - mlscorecheck/scores/_scores_standardized.py | 1 - .../multiclass/test_1_dataset_kfold_micro.py | 90 +++++++++++++++++ 12 files changed, 375 insertions(+), 7 deletions(-) delete mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py delete mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py create mode 100644 mlscorecheck/check/regression/_check_regression.py create mode 100644 tests/check/multiclass/test_1_dataset_kfold_micro.py diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index 8bb9e5f..46010bd 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -25,7 +25,9 @@ 'repeated_kfolds_generator', 'experiment_kfolds_generator', 'multiclass_stratified_folds', - 'transform_multiclass_fold_to_binary'] + 'transform_multiclass_fold_to_binary', + '_create_folds_multiclass', + '_create_binary_folds_multiclass'] def stratified_configurations_sklearn(p: int, n: int, @@ -470,4 +472,34 @@ def transform_multiclass_fold_to_binary(fold: dict) -> list: list(dict): the list of binary folds """ n_total = sum(fold.values()) - return [{'p': value, 'n': n_total - value} for value in fold.values()] \ No newline at end of file + return [{'p': value, 'n': n_total - value} for value in fold.values()] + +def _create_folds_multiclass(dataset, folding): + if folding.get('folds') is not None and (folding.get('n_repeats') is not None \ + or folding.get('strategy') is not None + or folding.get('n_folds') is not None): + raise ValueError('either specify the folds or the folding strategy') + + if 'folds' in folding: + return folding['folds'] + elif folding.get('strategy') == 'stratified_sklearn': + folds = multiclass_stratified_folds(dataset, folding.get('n_folds', 1)) + else: + folds = [dataset] + + n_repeats = folding.get('n_repeats', 1) + + folds = folds * n_repeats + folds = [copy.deepcopy(fold) for fold in folds] + + return folds + +def _create_binary_folds_multiclass(dataset, folding): + if folding.get('folds') is not None and (folding.get('n_repeats') is not None \ + or folding.get('strategy') is not None + or folding.get('n_folds') is not None): + raise ValueError('either specify the folds or the folding strategy') + + folds = _create_folds_multiclass(dataset, folding) + folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] + return [fold for fold_list in folds for fold in fold_list] diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index 4c50036..2f575f1 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -9,6 +9,13 @@ from ..experiments import dataset_statistics from ..scores import calculate_scores, calculate_scores_for_lp +from ..individual import (sample_multiclass_dataset, + generate_multiclass_dataset) +from ._folding_utils import (multiclass_stratified_folds, + _create_folds_multiclass) +from ..scores import calculate_multiclass_scores + + from ._dataset import Dataset from ._folding import Folding from ._evaluation import Evaluation @@ -20,7 +27,8 @@ 'generate_experiment', 'get_fold_score_bounds', 'get_dataset_score_bounds', - 'generate_scores_for_testsets'] + 'generate_scores_for_testsets', + 'generate_dataset_folding_multiclass'] def generate_dataset(max_p: int = 500, max_n: int = 500, @@ -331,3 +339,56 @@ def generate_scores_for_testsets(testsets, subset=subset) return scores | {'beta_positive': 2, 'beta_negative': 2} + +def generate_dataset_folding_multiclass(random_state=None, + max_n_classes=5, + min_n_classes=2, + max_class_size=200, + min_class_size=10, + max_n_folds=5, + max_n_repeats=3, + average=None, + aggregation=None, + rounding_decimals=None): + """ + Generates a multiclass dataset and folding with scores + """ + if not isinstance(random_state, np.random.RandomState): + random_state = np.random.RandomState(random_state) + + dataset = generate_multiclass_dataset(random_state=random_state, + max_n_classes=5, + min_n_classes=2, + max_class_size=200, + min_class_size=10) + + if random_state.randint(2) == 0: + folding = {'n_folds': random_state.randint(2, max_n_folds), + 'n_repeats': random_state.randint(1, max_n_repeats), + 'strategy': 'stratified_sklearn'} + elif random_state.randint(2) == 0: + folding = {'folds': multiclass_stratified_folds(dataset=dataset, + n_folds=random_state.randint(2, max_n_repeats))} + else: + folding = {'n_folds': 1} + + folds = _create_folds_multiclass(dataset, folding) + + samples = [sample_multiclass_dataset(dataset=fold, random_state=random_state) for fold in folds] + + print(samples) + + if aggregation == 'mos': + scores = [calculate_multiclass_scores(sample, + average=average, + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}) for sample in samples] + scores = round_scores(dict_mean(scores), rounding_decimals=rounding_decimals) + return dataset, folding, scores + elif aggregation == 'som': + scores = calculate_multiclass_scores(np.sum(np.array(samples), axis=0), + average=average, + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}) + return dataset, folding, scores | {'beta_positive': 2, 'beta_negative': 2} + diff --git a/mlscorecheck/check/multiclass/__init__.py b/mlscorecheck/check/multiclass/__init__.py index 0554f3b..c12be76 100644 --- a/mlscorecheck/check/multiclass/__init__.py +++ b/mlscorecheck/check/multiclass/__init__.py @@ -4,3 +4,5 @@ from ._check_1_testset_no_kfold_macro import * from ._check_1_testset_no_kfold_micro import * +from ._check_1_dataset_known_folds_som import * +from ._check_1_dataset_known_folds_mos import * diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_macro.py deleted file mode 100644 index e69de29..0000000 diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_micro.py deleted file mode 100644 index e69de29..0000000 diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py new file mode 100644 index 0000000..1cc4e44 --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py @@ -0,0 +1,97 @@ +""" +This module implements the multiclass tests in a k-fold MoS scenario. +""" + +import copy + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass + +from ..binary import (check_n_datasets_mos_kfold_som, + check_n_datasets_mos_known_folds_mos) + +__all__ = ['check_1_dataset_known_folds_mos'] + +def check_1_dataset_known_folds_mos(dataset: dict, + folding: dict, + scores: dict, + eps, + average: str, + *, + class_score_bounds: dict = None, + dataset_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + Checking the consistency of scores calculated by taking the micro average + on one single multiclass dataset. The test follows the methodology of the + 1_dataset_som case. + + Args: + testset (dict): the specification of the testset + scores (dict(str,float)): the scores to check + eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. + + Returns: + dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates + that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key + ``details`` provides further details from the analysis of the scores one after the other. + Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with + all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering + by using the solutions for the score pairs. + + Raises: + ValueError: if the problem is not specified properly + + Examples: + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, + 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # False + + >>> scores['acc'] = 0.8184 + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # True + """ + folds = _create_folds_multiclass(dataset, folding) + binary_folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] + + evaluations = [] + + for binary_folding in binary_folds: + folding = {'folds': binary_folding} + dataset = {'p': sum(tmp['p'] for tmp in binary_folding), + 'n': sum(tmp['n'] for tmp in binary_folding)} + evaluations.append({'dataset': dataset, + 'folding': folding, + 'fold_score_bounds': class_score_bounds}) + + if average == 'micro': + return check_n_datasets_mos_kfold_som(evaluations=evaluations, + scores=scores, + eps=eps, + numerical_tolerance=numerical_tolerance) + elif average == 'macro': + return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, + scores=scores, + eps=eps, + dataset_score_bounds=fold_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py new file mode 100644 index 0000000..370efe5 --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py @@ -0,0 +1,78 @@ +""" +This module implements the micro-averaged multiclass tests in a k-fold scenario. +""" + +import copy + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass + +from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro +from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro + +__all__ = ['check_1_dataset_known_folds_som'] + +def check_1_dataset_known_folds_som(dataset: dict, + folding: dict, + scores: dict, + eps, + average: str, + *, + class_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + This function checks the consistency of scores calculated by taking the micro or macro average + on a single multiclass dataset and averaging across the folds in the SoM manner. + + Args: + dataset (dict): The specification of the dataset. + folding (dict): The specification of the folding strategy. + scores (dict(str,float)): The scores to check. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + average (str): The type of averaging to be used. + class_score_bounds (dict, optional): The bounds for the class scores. Defaults to None. + solver_name (str, optional): The name of the solver. Defaults to None. + timeout (int, optional): The maximum time allowed for the operation. Defaults to None. + verbosity (int, optional): The level of verbosity. Defaults to 1. + numerical_tolerance (float, optional): Beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. Defaults to NUMERICAL_TOLERANCE. + + Returns: + dict: A dictionary containing the results of the consistency check. The dictionary includes the following keys: + - 'inconsistency': A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, it indicates that the provided scores are not consistent with the dataset. + - 'details': A list providing further details from the analysis of the scores one after the other. Each entry in the list corresponds to the analysis result for one score. + - 'n_valid_tptn_pairs': The number of tp and tn pairs that are compatible with all scores. This gives an indication of how many different classification outcomes could have led to the provided scores. + - 'prefiltering_details': The results of the prefiltering by using the solutions for the score pairs. This provides additional information about the process of checking the scores. + + Raises: + ValueError: If the provided scores are not consistent with the dataset. + """ + folds = _create_folds_multiclass(dataset, folding) + + print(folds) + + testset = copy.deepcopy(folds[0]) + for fold in folds[1:]: + for key in fold: + testset[key] += fold[key] + print(testset) + + if average == 'micro': + return check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=eps, + numerical_tolerance=numerical_tolerance) + elif average == 'macro': + return check_1_testset_no_kfold_macro(testset=testset, + scores=scores, + eps=eps, + class_score_bounds=class_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/regression/__init__.py b/mlscorecheck/check/regression/__init__.py index 33094a5..f08812e 100644 --- a/mlscorecheck/check/regression/__init__.py +++ b/mlscorecheck/check/regression/__init__.py @@ -1,3 +1,5 @@ """ This module implements the tests for regression scores. -""" \ No newline at end of file +""" + +from ._check_regression import check_regression diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py new file mode 100644 index 0000000..6dd0292 --- /dev/null +++ b/mlscorecheck/check/regression/_check_regression.py @@ -0,0 +1,9 @@ +""" +This module implements the testing of regression scores +""" + +__all__ = ['check_regression'] + +def check_regression(scores, + eps): + pass \ No newline at end of file diff --git a/mlscorecheck/scores/_multiclass_scores.py b/mlscorecheck/scores/_multiclass_scores.py index bf5fb95..ddecc52 100644 --- a/mlscorecheck/scores/_multiclass_scores.py +++ b/mlscorecheck/scores/_multiclass_scores.py @@ -91,8 +91,6 @@ def multiclass_score_macro(confusion_matrix, score_specifications[name].get('nans')) for idx, count in enumerate(counts)] - print(scores) - return np.mean(scores) def multiclass_score_micro(confusion_matrix, diff --git a/mlscorecheck/scores/_scores_standardized.py b/mlscorecheck/scores/_scores_standardized.py index 29a464b..4e250d0 100644 --- a/mlscorecheck/scores/_scores_standardized.py +++ b/mlscorecheck/scores/_scores_standardized.py @@ -367,7 +367,6 @@ def prevalence_threshold_standardized(*, tp, tn, p, n, sqrt=math.sqrt): Returns: int|float|Interval|IntervalUnion: the score """ - print(tp, tn, p, n) return -p*(n*sqrt(tp*(n - tn)/(n*p)) - n + tn)/(-n*tp + p*(n - tn)) def diagnostic_odds_ratio_standardized(*, tp, tn, p, n): diff --git a/tests/check/multiclass/test_1_dataset_kfold_micro.py b/tests/check/multiclass/test_1_dataset_kfold_micro.py new file mode 100644 index 0000000..914a516 --- /dev/null +++ b/tests/check/multiclass/test_1_dataset_kfold_micro.py @@ -0,0 +1,90 @@ +""" +This module tests the 1 dataset and kfold micro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import (check_1_dataset_kfold_micro, + _prepare_1_dataset_kfold_micro) +from mlscorecheck.individual import (generate_multiclass_dataset, + sample_multiclass_dataset, + create_confusion_matrix) +from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) + +def test_preparation(): + dataset = {0: 10, 1: 100, 2: 80} + folding = {'n_repeats': 2, 'folds': 'dummy'} + + with pytest.raises(ValueError): + _prepare_1_dataset_kfold_micro(dataset, folding) + + folding = {'folds': [{0: 5, 1: 50, 2: 40}, + {0: 5, 1: 50, 2: 40}]} + + folds = _prepare_1_dataset_kfold_micro(dataset, folding) + + assert len(folds) > 0 + + folding = {} + + folds = _prepare_1_dataset_kfold_micro(dataset, folding) + + assert len(folds) > 0 + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_consistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='micro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + + print(dataset) + print(scores) + + result = check_1_testset_no_kfold_micro(testset=dataset, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', list(range(10))) +def test_inconsistent_configuration(random_seed): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to use + """ + + dataset = generate_multiclass_dataset(random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, + random_state=random_seed) + + scores = calculate_multiclass_scores(confm, + average='micro', + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=4) + + scores = scores | {'beta_positive': 2, 'beta_negative': 2} + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_testset_no_kfold_micro(testset=dataset, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] From b90dfd630277981d13158ea224a1f7f99bf11aeb Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Wed, 1 Nov 2023 22:21:06 +0100 Subject: [PATCH 05/40] test fixed --- .../multiclass/test_1_dataset_kfold_micro.py | 86 ------------------- 1 file changed, 86 deletions(-) diff --git a/tests/check/multiclass/test_1_dataset_kfold_micro.py b/tests/check/multiclass/test_1_dataset_kfold_micro.py index 914a516..06252e0 100644 --- a/tests/check/multiclass/test_1_dataset_kfold_micro.py +++ b/tests/check/multiclass/test_1_dataset_kfold_micro.py @@ -2,89 +2,3 @@ This module tests the 1 dataset and kfold micro averaging consistency test """ -import pytest - -from mlscorecheck.check.multiclass import (check_1_dataset_kfold_micro, - _prepare_1_dataset_kfold_micro) -from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset, - create_confusion_matrix) -from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) - -def test_preparation(): - dataset = {0: 10, 1: 100, 2: 80} - folding = {'n_repeats': 2, 'folds': 'dummy'} - - with pytest.raises(ValueError): - _prepare_1_dataset_kfold_micro(dataset, folding) - - folding = {'folds': [{0: 5, 1: 50, 2: 40}, - {0: 5, 1: 50, 2: 40}]} - - folds = _prepare_1_dataset_kfold_micro(dataset, folding) - - assert len(folds) > 0 - - folding = {} - - folds = _prepare_1_dataset_kfold_micro(dataset, folding) - - assert len(folds) > 0 - -@pytest.mark.parametrize('random_seed', list(range(10))) -def test_consistent_configuration(random_seed): - """ - Testing a consistent configuration - - Args: - random_seed (int): the random seed to use - """ - - dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) - - scores = calculate_multiclass_scores(confm, - average='micro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) - - scores = scores | {'beta_positive': 2, 'beta_negative': 2} - - print(dataset) - print(scores) - - result = check_1_testset_no_kfold_micro(testset=dataset, - scores=scores, - eps=1e-4) - - assert not result['inconsistency'] - -@pytest.mark.parametrize('random_seed', list(range(10))) -def test_inconsistent_configuration(random_seed): - """ - Testing a consistent configuration - - Args: - random_seed (int): the random seed to use - """ - - dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) - - scores = calculate_multiclass_scores(confm, - average='micro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) - - scores = scores | {'beta_positive': 2, 'beta_negative': 2} - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - result = check_1_testset_no_kfold_micro(testset=dataset, - scores=scores, - eps=1e-4) - - assert result['inconsistency'] From a3045748ff9827ff5f1b16cb9886908c119ad612 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Thu, 2 Nov 2023 06:14:44 +0100 Subject: [PATCH 06/40] another fix --- .../check/multiclass/_check_1_dataset_known_folds_mos.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py index 1cc4e44..ffd35d4 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py @@ -90,7 +90,7 @@ def check_1_dataset_known_folds_mos(dataset: dict, return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=eps, - dataset_score_bounds=fold_score_bounds, + dataset_score_bounds=dataset_score_bounds, solver_name=solver_name, timeout=timeout, verbosity=verbosity, From baf07ac71081d34a1a61e0a1741203bafcee118b Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Thu, 2 Nov 2023 07:18:46 +0100 Subject: [PATCH 07/40] illustrations and examples added --- mlscorecheck/aggregated/_generate_problems.py | 10 +- mlscorecheck/check/multiclass/__init__.py | 6 +- .../_check_1_dataset_known_folds_mos_macro.py | 83 +++++ ..._check_1_dataset_known_folds_mos_micro.py} | 58 ++-- .../_check_1_dataset_known_folds_som_macro.py | 89 ++++++ ..._check_1_dataset_known_folds_som_micro.py} | 51 ++-- ...heck_1_dataset_known_folds_mos_macro.ipynb | 245 +++++++++++++++ ...heck_1_dataset_known_folds_mos_micro.ipynb | 288 ++++++++++++++++++ ...heck_1_dataset_known_folds_som_macro.ipynb | 254 +++++++++++++++ ...heck_1_dataset_known_folds_som_micro.ipynb | 218 +++++++++++++ .../multiclass/test_1_dataset_kfold_micro.py | 4 - .../test_1_dataset_known_folds_mos_macro.py | 52 ++++ .../test_1_dataset_known_folds_mos_micro.py | 52 ++++ .../test_1_dataset_known_folds_som_macro.py | 52 ++++ .../test_1_dataset_known_folds_som_micro.py | 52 ++++ 15 files changed, 1451 insertions(+), 63 deletions(-) create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py rename mlscorecheck/check/multiclass/{_check_1_dataset_known_folds_mos.py => _check_1_dataset_known_folds_mos_micro.py} (64%) create mode 100644 mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py rename mlscorecheck/check/multiclass/{_check_1_dataset_known_folds_som.py => _check_1_dataset_known_folds_som_micro.py} (70%) create mode 100644 notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb create mode 100644 notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb create mode 100644 notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb create mode 100644 notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb delete mode 100644 tests/check/multiclass/test_1_dataset_kfold_micro.py create mode 100644 tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py create mode 100644 tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py create mode 100644 tests/check/multiclass/test_1_dataset_known_folds_som_macro.py create mode 100644 tests/check/multiclass/test_1_dataset_known_folds_som_micro.py diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index 2f575f1..37e36cf 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -349,7 +349,8 @@ def generate_dataset_folding_multiclass(random_state=None, max_n_repeats=3, average=None, aggregation=None, - rounding_decimals=None): + rounding_decimals=None, + subset=None): """ Generates a multiclass dataset and folding with scores """ @@ -382,13 +383,16 @@ def generate_dataset_folding_multiclass(random_state=None, scores = [calculate_multiclass_scores(sample, average=average, additional_symbols={'beta_positive': 2, - 'beta_negative': 2}) for sample in samples] + 'beta_negative': 2}, + subset=subset) for sample in samples] scores = round_scores(dict_mean(scores), rounding_decimals=rounding_decimals) return dataset, folding, scores elif aggregation == 'som': scores = calculate_multiclass_scores(np.sum(np.array(samples), axis=0), average=average, additional_symbols={'beta_positive': 2, - 'beta_negative': 2}) + 'beta_negative': 2}, + rounding_decimals=rounding_decimals, + subset=subset) return dataset, folding, scores | {'beta_positive': 2, 'beta_negative': 2} diff --git a/mlscorecheck/check/multiclass/__init__.py b/mlscorecheck/check/multiclass/__init__.py index c12be76..6ad207f 100644 --- a/mlscorecheck/check/multiclass/__init__.py +++ b/mlscorecheck/check/multiclass/__init__.py @@ -4,5 +4,7 @@ from ._check_1_testset_no_kfold_macro import * from ._check_1_testset_no_kfold_micro import * -from ._check_1_dataset_known_folds_som import * -from ._check_1_dataset_known_folds_mos import * +from ._check_1_dataset_known_folds_som_macro import * +from ._check_1_dataset_known_folds_som_micro import * +from ._check_1_dataset_known_folds_mos_macro import * +from ._check_1_dataset_known_folds_mos_micro import * diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py new file mode 100644 index 0000000..c2ec7ba --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -0,0 +1,83 @@ +""" +This module implements the multiclass tests in a k-fold MoS scenario with micro +averaging of scores. +""" + +import copy + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass + +from ..binary import (check_n_datasets_mos_kfold_som, + check_n_datasets_mos_known_folds_mos) + +__all__ = ['check_1_dataset_known_folds_mos_micro'] + +def check_1_dataset_known_folds_mos_micro(dataset: dict, + folding: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + Checking the consistency of scores calculated by taking the micro average + on one single multiclass dataset. The test follows the methodology of the + 1_dataset_som case. + + Args: + testset (dict): the specification of the testset + scores (dict(str,float)): the scores to check + eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. + + Returns: + dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates + that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key + ``details`` provides further details from the analysis of the scores one after the other. + Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with + all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering + by using the solutions for the score pairs. + + Raises: + ValueError: if the problem is not specified properly + + Examples: + from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro + >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} + >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + + >>> scores['acc'] = 0.8745 + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + """ + folds = _create_folds_multiclass(dataset, folding) + binary_folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] + + evaluations = [] + + for binary_folding in binary_folds: + folding = {'folds': binary_folding} + dataset = {'p': sum(tmp['p'] for tmp in binary_folding), + 'n': sum(tmp['n'] for tmp in binary_folding)} + evaluations.append({'dataset': dataset, + 'folding': folding}) + + return check_n_datasets_mos_kfold_som(evaluations=evaluations, + scores=scores, + eps=eps, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py similarity index 64% rename from mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py rename to mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index ffd35d4..0a5a272 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -1,5 +1,6 @@ """ -This module implements the multiclass tests in a k-fold MoS scenario. +This module implements the multiclass tests in a k-fold MoS scenario with macro averaging +of scores. """ import copy @@ -10,13 +11,12 @@ from ..binary import (check_n_datasets_mos_kfold_som, check_n_datasets_mos_known_folds_mos) -__all__ = ['check_1_dataset_known_folds_mos'] +__all__ = ['check_1_dataset_known_folds_mos_macro'] -def check_1_dataset_known_folds_mos(dataset: dict, +def check_1_dataset_known_folds_mos_macro(dataset: dict, folding: dict, scores: dict, eps, - average: str, *, class_score_bounds: dict = None, dataset_score_bounds: dict = None, @@ -25,7 +25,7 @@ def check_1_dataset_known_folds_mos(dataset: dict, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by taking the micro average + Checking the consistency of scores calculated by taking the macro average on one single multiclass dataset. The test follows the methodology of the 1_dataset_som case. @@ -51,21 +51,23 @@ def check_1_dataset_known_folds_mos(dataset: dict, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro - >>> testset = {0: 10, 1: 100, 2: 80} - >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, - 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} - >>> results = check_1_testset_no_kfold_micro(testset=testset, - scores=scores, - eps=1e-4) + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro + >>> dataset = {0: 66, 1: 178, 2: 151} + >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} + >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8184 - >>> results = check_1_testset_no_kfold_micro(testset=testset, - scores=scores, - eps=1e-4) - >>> results['inconsistency'] + >>> scores['acc'] = 0.8367 + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] # True """ folds = _create_folds_multiclass(dataset, folding) @@ -81,17 +83,11 @@ def check_1_dataset_known_folds_mos(dataset: dict, 'folding': folding, 'fold_score_bounds': class_score_bounds}) - if average == 'micro': - return check_n_datasets_mos_kfold_som(evaluations=evaluations, - scores=scores, - eps=eps, - numerical_tolerance=numerical_tolerance) - elif average == 'macro': - return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, - scores=scores, - eps=eps, - dataset_score_bounds=dataset_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, + scores=scores, + eps=eps, + dataset_score_bounds=dataset_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py new file mode 100644 index 0000000..e557325 --- /dev/null +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -0,0 +1,89 @@ +""" +This module implements the macro-averaged multiclass tests in a k-fold scenario +with SoM aggregation. +""" + +import copy + +from ...core import NUMERICAL_TOLERANCE +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass + +from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro +from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro + +__all__ = ['check_1_dataset_known_folds_som_macro'] + +def check_1_dataset_known_folds_som_macro(dataset: dict, + folding: dict, + scores: dict, + eps, + *, + class_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + This function checks the consistency of scores calculated by taking the micro or macro average + on a single multiclass dataset and averaging across the folds in the SoM manner. + + Args: + dataset (dict): The specification of the dataset. + folding (dict): The specification of the folding strategy. + scores (dict(str,float)): The scores to check. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + average (str): The type of averaging to be used. + class_score_bounds (dict, optional): The bounds for the class scores. Defaults to None. + solver_name (str, optional): The name of the solver. Defaults to None. + timeout (int, optional): The maximum time allowed for the operation. Defaults to None. + verbosity (int, optional): The level of verbosity. Defaults to 1. + numerical_tolerance (float, optional): Beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. Defaults to NUMERICAL_TOLERANCE. + + Returns: + dict: A dictionary containing the results of the consistency check. The dictionary includes the following keys: + - 'inconsistency': A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, it indicates that the provided scores are not consistent with the dataset. + - 'details': A list providing further details from the analysis of the scores one after the other. Each entry in the list corresponds to the analysis result for one score. + - 'n_valid_tptn_pairs': The number of tp and tn pairs that are compatible with all scores. This gives an indication of how many different classification outcomes could have led to the provided scores. + - 'prefiltering_details': The results of the prefiltering by using the solutions for the score pairs. This provides additional information about the process of checking the scores. + + Raises: + ValueError: If the provided scores are not consistent with the dataset. + + Examples: + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro + >>> dataset = {0: 34, 1: 135, 2: 170, 3: 192} + >>> folding = {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.6271, 'sens': 0.2422, 'spec': 0.7525, 'f1p': 0.2333} + >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + + >>> scores['acc'] = 0.8762 + >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + """ + folds = _create_folds_multiclass(dataset, folding) + + testset = copy.deepcopy(folds[0]) + for fold in folds[1:]: + for key in fold: + testset[key] += fold[key] + + return check_1_testset_no_kfold_macro(testset=testset, + scores=scores, + eps=eps, + class_score_bounds=class_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py similarity index 70% rename from mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py rename to mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index 370efe5..eea55a7 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -1,5 +1,6 @@ """ -This module implements the micro-averaged multiclass tests in a k-fold scenario. +This module implements the micro-averaged multiclass tests in a k-fold scenario +with SoM aggregation. """ import copy @@ -10,18 +11,13 @@ from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro -__all__ = ['check_1_dataset_known_folds_som'] +__all__ = ['check_1_dataset_known_folds_som_micro'] -def check_1_dataset_known_folds_som(dataset: dict, +def check_1_dataset_known_folds_som_micro(dataset: dict, folding: dict, scores: dict, eps, - average: str, *, - class_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ This function checks the consistency of scores calculated by taking the micro or macro average @@ -51,6 +47,26 @@ def check_1_dataset_known_folds_som(dataset: dict, Raises: ValueError: If the provided scores are not consistent with the dataset. + + Examples: + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro + >>> dataset = {0: 86, 1: 96, 2: 59, 3: 105} + >>> folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]} + >>> scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543} + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + + >>> scores['acc'] = 0.8756 + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True """ folds = _create_folds_multiclass(dataset, folding) @@ -60,19 +76,8 @@ def check_1_dataset_known_folds_som(dataset: dict, for fold in folds[1:]: for key in fold: testset[key] += fold[key] - print(testset) - if average == 'micro': - return check_1_testset_no_kfold_micro(testset=testset, - scores=scores, - eps=eps, - numerical_tolerance=numerical_tolerance) - elif average == 'macro': - return check_1_testset_no_kfold_macro(testset=testset, - scores=scores, - eps=eps, - class_score_bounds=class_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + return check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=eps, + numerical_tolerance=numerical_tolerance) diff --git a/notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb b/notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb new file mode 100644 index 0000000..345bb09 --- /dev/null +++ b/notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb @@ -0,0 +1,245 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro\n", + "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[array([[ 2, 5],\n", + " [25, 36]]), array([[ 3, 3],\n", + " [28, 34]])]\n" + ] + }, + { + "data": { + "text/plain": [ + "({0: 13, 1: 123},\n", + " {'folds': [{0: 7, 1: 61}, {0: 6, 1: 62}]},\n", + " {'acc': 0.5515, 'sens': 0.4811, 'spec': 0.4811, 'f1p': 0.4181})" + ] + }, + "execution_count": 2, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", + " average='macro',\n", + " aggregation='mos',\n", + " rounding_decimals=4,\n", + " subset=['acc', 'sens', 'spec', 'f1p'])\n", + "dataset, folding, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [], + "source": [ + "dataset = {0: 149, 1: 118, 2: 83, 3: 154}\n", + "folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'}\n", + "scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469}" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88462154398348c9a9ea9fe9c9cb55b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88462154398348c9a9ea9fe9c9cb55b5-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 397 RHS\n", + "At line 404 BOUNDS\n", + "At line 470 ENDATA\n", + "Problem MODEL has 6 rows, 65 columns and 256 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0004I processed model has 3 rows, 14 columns (14 integer (0 of which binary)) and 28 elements\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Optimal solution found\n", + "\n", + "Objective value: 0.00000000\n", + "Enumerated nodes: 0\n", + "Total iterations: 0\n", + "Time (CPU seconds): 0.00\n", + "Time (Wallclock seconds): 0.00\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_mos_macro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8745" + ] + }, + "execution_count": 10, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.8745" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/09ca052c964d4dbf9f5b70492cb677de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09ca052c964d4dbf9f5b70492cb677de-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 397 RHS\n", + "At line 404 BOUNDS\n", + "At line 470 ENDATA\n", + "Problem MODEL has 6 rows, 65 columns and 256 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Problem is infeasible - 0.00 seconds\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 9, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_mos_macro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb b/notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb new file mode 100644 index 0000000..33ea004 --- /dev/null +++ b/notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb @@ -0,0 +1,288 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro\n", + "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[array([[17, 8, 8],\n", + " [31, 27, 31],\n", + " [30, 24, 22]]), array([[14, 9, 10],\n", + " [28, 30, 31],\n", + " [23, 25, 27]])]\n" + ] + }, + { + "data": { + "text/plain": [ + "({0: 66, 1: 178, 2: 151},\n", + " {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]},\n", + " {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469})" + ] + }, + "execution_count": 2, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", + " average='micro',\n", + " aggregation='mos',\n", + " rounding_decimals=4,\n", + " subset=['acc', 'sens', 'spec', 'f1p'])\n", + "dataset, folding, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [], + "source": [ + "dataset = {0: 66, 1: 178, 2: 151}\n", + "folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]}\n", + "scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469}" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d27ee8bf7d1043439d67e8ae87521824-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d27ee8bf7d1043439d67e8ae87521824-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 85 RHS\n", + "At line 92 BOUNDS\n", + "At line 106 ENDATA\n", + "Problem MODEL has 6 rows, 13 columns and 48 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0003I 0 fixed, 11 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 14 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", + "Cgl0004I processed model has 3 rows, 4 columns (4 integer (0 of which binary)) and 8 elements\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 18 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0031I 2 added rows had average density of 2\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 33 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 75 column cuts (75 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 19 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 15 row cuts average 2.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 18 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 33 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 33 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 33 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Optimal solution found\n", + "\n", + "Objective value: 0.00000000\n", + "Enumerated nodes: 0\n", + "Total iterations: 18\n", + "Time (CPU seconds): 0.01\n", + "Time (Wallclock seconds): 0.01\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 10, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_mos_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 11, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 12, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8367" + ] + }, + "execution_count": 12, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 13, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.8367" + ] + }, + { + "cell_type": "code", + "execution_count": 14, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d3584de4bc0646b28e5c732a9f9bb278-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3584de4bc0646b28e5c732a9f9bb278-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 85 RHS\n", + "At line 92 BOUNDS\n", + "At line 106 ENDATA\n", + "Problem MODEL has 6 rows, 13 columns and 48 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Problem is infeasible - 0.00 seconds\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 14, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_mos_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb b/notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb new file mode 100644 index 0000000..0171e6f --- /dev/null +++ b/notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb @@ -0,0 +1,254 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro\n", + "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[array([[ 3, 6, 4, 4],\n", + " [17, 17, 18, 16],\n", + " [14, 23, 24, 24],\n", + " [23, 25, 21, 27]]), array([[ 4, 8, 2, 3],\n", + " [20, 12, 20, 15],\n", + " [21, 29, 24, 11],\n", + " [24, 31, 17, 24]])]\n" + ] + }, + { + "data": { + "text/plain": [ + "({0: 34, 1: 135, 2: 170, 3: 192},\n", + " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6271,\n", + " 'sens': 0.2422,\n", + " 'spec': 0.7525,\n", + " 'f1p': 0.2333,\n", + " 'beta_positive': 2,\n", + " 'beta_negative': 2})" + ] + }, + "execution_count": 9, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", + " average='macro',\n", + " aggregation='som',\n", + " rounding_decimals=4,\n", + " subset=['acc', 'sens', 'spec', 'f1p'])\n", + "dataset, folding, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [], + "source": [ + "dataset = {0: 34, 1: 135, 2: 170, 3: 192}\n", + "folding = {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'}\n", + "scores = {'acc': 0.6271, 'sens': 0.2422, 'spec': 0.7525, 'f1p': 0.2333}" + ] + }, + { + "cell_type": "code", + "execution_count": 11, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6addc61179904c719d2706f406f6507c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6addc61179904c719d2706f406f6507c-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 61 RHS\n", + "At line 68 BOUNDS\n", + "At line 78 ENDATA\n", + "Problem MODEL has 6 rows, 9 columns and 32 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0004I processed model has 3 rows, 8 columns (8 integer (0 of which binary)) and 16 elements\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Optimal solution found\n", + "\n", + "Objective value: 0.00000000\n", + "Enumerated nodes: 0\n", + "Total iterations: 0\n", + "Time (CPU seconds): 0.00\n", + "Time (Wallclock seconds): 0.00\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 11, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_macro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 12, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 13, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.87625" + ] + }, + "execution_count": 13, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 14, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.8762" + ] + }, + { + "cell_type": "code", + "execution_count": 15, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71dbcfe88d22424ab885c9f59b960897-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71dbcfe88d22424ab885c9f59b960897-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 11 COLUMNS\n", + "At line 61 RHS\n", + "At line 68 BOUNDS\n", + "At line 78 ENDATA\n", + "Problem MODEL has 6 rows, 9 columns and 32 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Problem is infeasible - 0.00 seconds\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 15, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_macro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb b/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb new file mode 100644 index 0000000..98291b7 --- /dev/null +++ b/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb @@ -0,0 +1,218 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 18, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro\n", + "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" + ] + }, + { + "cell_type": "code", + "execution_count": 19, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[array([[17, 16, 18],\n", + " [21, 17, 18],\n", + " [35, 30, 35]])]\n" + ] + }, + { + "data": { + "text/plain": [ + "({0: 51, 1: 56, 2: 100},\n", + " {'n_folds': 1},\n", + " {'acc': 0.5556,\n", + " 'sens': 0.3333,\n", + " 'spec': 0.6667,\n", + " 'f1p': 0.3333,\n", + " 'beta_positive': 2,\n", + " 'beta_negative': 2})" + ] + }, + "execution_count": 19, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", + " average='micro',\n", + " aggregation='som',\n", + " rounding_decimals=4,\n", + " subset=['acc', 'sens', 'spec', 'f1p'])\n", + "dataset, folding, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 20, + "metadata": {}, + "outputs": [], + "source": [ + "dataset = {0: 86, 1: 96, 2: 59, 3: 105}\n", + "folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]}\n", + "scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}" + ] + }, + { + "cell_type": "code", + "execution_count": 21, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-02 07:17:19,911:INFO:testing acc, feasible tptn pairs: 347\n", + "2023-11-02 07:17:19,922:INFO:testing sens, feasible tptn pairs: 347\n", + "2023-11-02 07:17:19,923:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-02 07:17:19,924:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-02 07:17:19,925:INFO:constructing final tp, tn pair set\n", + "2023-11-02 07:17:19,925:INFO:final number of intervals: 1\n", + "2023-11-02 07:17:19,926:INFO:final number of pairs: 1\n" + ] + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 21, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 22, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 23, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8756999999999999" + ] + }, + "execution_count": 23, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 24, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.8756" + ] + }, + { + "cell_type": "code", + "execution_count": 25, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-02 07:17:19,977:INFO:testing acc, feasible tptn pairs: 347\n", + "2023-11-02 07:17:19,988:INFO:no more feasible tp,tn pairs left\n", + "2023-11-02 07:17:19,989:INFO:constructing final tp, tn pair set\n", + "2023-11-02 07:17:19,991:INFO:final number of intervals: 0\n", + "2023-11-02 07:17:19,992:INFO:final number of pairs: 0\n" + ] + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 25, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/tests/check/multiclass/test_1_dataset_kfold_micro.py b/tests/check/multiclass/test_1_dataset_kfold_micro.py deleted file mode 100644 index 06252e0..0000000 --- a/tests/check/multiclass/test_1_dataset_kfold_micro.py +++ /dev/null @@ -1,4 +0,0 @@ -""" -This module tests the 1 dataset and kfold micro averaging consistency test -""" - diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py new file mode 100644 index 0000000..67d3a0d --- /dev/null +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -0,0 +1,52 @@ +""" +This module tests the 1 dataset, kfold MoS, macro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro +from mlscorecheck.aggregated import generate_dataset_folding_multiclass + +@pytest.mark.parametrize('random_seed', range(20)) +def test_consistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='macro', + aggregation='mos', + rounding_decimals=4) + + result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', range(20)) +def test_inconsistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='macro', + aggregation='mos', + rounding_decimals=4) + + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py new file mode 100644 index 0000000..752f74c --- /dev/null +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py @@ -0,0 +1,52 @@ +""" +This module tests the 1 dataset, kfold MoS, micro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro +from mlscorecheck.aggregated import generate_dataset_folding_multiclass + +@pytest.mark.parametrize('random_seed', range(20)) +def test_consistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='micro', + aggregation='mos', + rounding_decimals=4) + + result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', range(20)) +def test_inconsistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='micro', + aggregation='mos', + rounding_decimals=4) + + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py new file mode 100644 index 0000000..86dce60 --- /dev/null +++ b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py @@ -0,0 +1,52 @@ +""" +This module tests the 1 dataset, kfold SoM, macro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro +from mlscorecheck.aggregated import generate_dataset_folding_multiclass + +@pytest.mark.parametrize('random_seed', range(20)) +def test_consistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='macro', + aggregation='som', + rounding_decimals=4) + + result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', range(20)) +def test_inconsistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='macro', + aggregation='som', + rounding_decimals=4) + + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py new file mode 100644 index 0000000..d79ad55 --- /dev/null +++ b/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py @@ -0,0 +1,52 @@ +""" +This module tests the 1 dataset, kfold SoM, micro averaging consistency test +""" + +import pytest + +from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro +from mlscorecheck.aggregated import generate_dataset_folding_multiclass + +@pytest.mark.parametrize('random_seed', range(20)) +def test_consistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='micro', + aggregation='som', + rounding_decimals=4) + + result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', range(20)) +def test_inconsistent(random_seed: int): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to be used + """ + + dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, + average='micro', + aggregation='som', + rounding_decimals=4) + + scores['acc'] = (1.0 + scores['spec']) / 2.0 + + result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + + assert result['inconsistency'] From dc88b59d0ab30ce6f172fa36f62f569f8133f8f0 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Thu, 2 Nov 2023 08:15:03 +0100 Subject: [PATCH 08/40] full coverage --- docs/03_api.rst | 13 +++ mlscorecheck/aggregated/_folding_utils.py | 13 +-- .../_check_1_dataset_known_folds_mos_macro.py | 54 +++++----- .../_check_1_dataset_known_folds_mos_micro.py | 98 ++++++++++--------- .../_check_1_dataset_known_folds_som_macro.py | 2 +- .../_check_1_dataset_known_folds_som_micro.py | 2 +- tests/aggregated/test_folding_utils.py | 13 ++- 7 files changed, 110 insertions(+), 85 deletions(-) diff --git a/docs/03_api.rst b/docs/03_api.rst index f1346d9..112e97b 100644 --- a/docs/03_api.rst +++ b/docs/03_api.rst @@ -9,6 +9,9 @@ Consistency testing (``check``) The test functions implemented in the ``mlscorecheck.check`` module. +Binary classification +--------------------- + .. autofunction:: mlscorecheck.check.binary.check_1_testset_no_kfold .. autofunction:: mlscorecheck.check.binary.check_1_dataset_som .. autofunction:: mlscorecheck.check.binary.check_1_dataset_known_folds_mos @@ -20,6 +23,16 @@ The test functions implemented in the ``mlscorecheck.check`` module. .. autofunction:: mlscorecheck.check.binary.check_n_datasets_mos_known_folds_mos .. autofunction:: mlscorecheck.check.binary.check_n_datasets_mos_unknown_folds_mos +Multiclass classification +------------------------- + +.. autofunction:: mlscorecheck.check.multiclass.check_1_testset_no_kfold_macro +.. autofunction:: mlscorecheck.check.multiclass.check_1_testset_no_kfold_micro +.. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_mos_macro +.. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_mos_micro +.. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_som_macro +.. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_som_micro + Test bundles (``bundles``) ========================== diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index 46010bd..3a4e010 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -26,8 +26,7 @@ 'experiment_kfolds_generator', 'multiclass_stratified_folds', 'transform_multiclass_fold_to_binary', - '_create_folds_multiclass', - '_create_binary_folds_multiclass'] + '_create_folds_multiclass'] def stratified_configurations_sklearn(p: int, n: int, @@ -493,13 +492,3 @@ def _create_folds_multiclass(dataset, folding): folds = [copy.deepcopy(fold) for fold in folds] return folds - -def _create_binary_folds_multiclass(dataset, folding): - if folding.get('folds') is not None and (folding.get('n_repeats') is not None \ - or folding.get('strategy') is not None - or folding.get('n_folds') is not None): - raise ValueError('either specify the folds or the folding strategy') - - folds = _create_folds_multiclass(dataset, folding) - folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] - return [fold for fold_list in folds for fold in fold_list] diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py index c2ec7ba..edc71ac 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -1,26 +1,31 @@ """ -This module implements the multiclass tests in a k-fold MoS scenario with micro -averaging of scores. +This module implements the multiclass tests in a k-fold MoS scenario with macro averaging +of scores. """ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass from ..binary import (check_n_datasets_mos_kfold_som, check_n_datasets_mos_known_folds_mos) -__all__ = ['check_1_dataset_known_folds_mos_micro'] +__all__ = ['check_1_dataset_known_folds_mos_macro'] -def check_1_dataset_known_folds_mos_micro(dataset: dict, +def check_1_dataset_known_folds_mos_macro(dataset: dict, folding: dict, scores: dict, eps, *, + class_score_bounds: dict = None, + dataset_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by taking the micro average + Checking the consistency of scores calculated by taking the macro average on one single multiclass dataset. The test follows the methodology of the 1_dataset_som case. @@ -46,22 +51,22 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, ValueError: if the problem is not specified properly Examples: - from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro - >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} - >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} - >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} - >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) - >>> result['inconsistency'] + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro + >>> dataset = {0: 66, 1: 178, 2: 151} + >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} + >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8745 - >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + >>> scores['acc'] = 0.8367 + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) >>> result['inconsistency'] # True """ @@ -75,9 +80,14 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, dataset = {'p': sum(tmp['p'] for tmp in binary_folding), 'n': sum(tmp['n'] for tmp in binary_folding)} evaluations.append({'dataset': dataset, - 'folding': folding}) + 'folding': folding, + 'fold_score_bounds': class_score_bounds}) - return check_n_datasets_mos_kfold_som(evaluations=evaluations, + return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=eps, + dataset_score_bounds=dataset_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index 0a5a272..bbdf269 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -1,72 +1,79 @@ """ -This module implements the multiclass tests in a k-fold MoS scenario with macro averaging -of scores. +This module implements the multiclass tests in a k-fold MoS scenario with micro +averaging of scores. """ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass from ..binary import (check_n_datasets_mos_kfold_som, check_n_datasets_mos_known_folds_mos) -__all__ = ['check_1_dataset_known_folds_mos_macro'] +__all__ = ['check_1_dataset_known_folds_mos_micro'] -def check_1_dataset_known_folds_mos_macro(dataset: dict, +def check_1_dataset_known_folds_mos_micro(dataset: dict, folding: dict, scores: dict, eps, *, - class_score_bounds: dict = None, - dataset_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by taking the macro average - on one single multiclass dataset. The test follows the methodology of the - 1_dataset_som case. + This function checks the consistency of scores calculated by taking the micro average + on a single multiclass dataset with known folds. The test follows the methodology of the + 1_dataset_som case, but is specifically designed for multiclass classification problems + where the folds of the dataset are known beforehand. Args: - testset (dict): the specification of the testset - scores (dict(str,float)): the scores to check - eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - numerical_tolerance (float): in practice, beyond the numerical uncertainty of - the scores, some further tolerance is applied. This is - orders of magnitude smaller than the uncertainty of the - scores. It does ensure that the specificity of the test - is 1, it might slightly decrease the sensitivity. + dataset (dict): The specification of the dataset. + folding (dict): The specification of the folding strategy. + scores (dict(str,float)): The scores to check. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + numerical_tolerance (float, optional): Beyond the numerical uncertainty of + the scores, some further tolerance is applied. + This is orders of magnitude smaller than the + uncertainty of the scores. It ensures that the + specificity of the test is 1, it might slightly + decrease the sensitivity. Defaults to + NUMERICAL_TOLERANCE. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A summary of the results. The dictionary includes the following keys: + - ``inconsistency``: A boolean flag indicating whether the set of feasible + true positive (tp) and true negative (tn) pairs is empty. If True, it + indicates that the provided scores are not consistent with the dataset. + - ``details``: A list providing further details from the analysis of the + scores one after the other. Each entry in the list corresponds to the + analysis result for one score. + - ``n_valid_tptn_pairs``: The number of tp and tn pairs that are compatible + with all scores. This gives an indication of how many different classification + outcomes could have led to the provided scores. + - ``prefiltering_details``: The results of the prefiltering by using the + solutions for the score pairs. This provides additional information about the + process of checking the scores. + Raises: ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro - >>> dataset = {0: 66, 1: 178, 2: 151} - >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} - >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} - >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) - >>> results['inconsistency'] + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro + >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} + >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] # False - >>> scores['acc'] = 0.8367 - >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + >>> scores['acc'] = 0.8745 + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) >>> result['inconsistency'] # True """ @@ -80,14 +87,9 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, dataset = {'p': sum(tmp['p'] for tmp in binary_folding), 'n': sum(tmp['n'] for tmp in binary_folding)} evaluations.append({'dataset': dataset, - 'folding': folding, - 'fold_score_bounds': class_score_bounds}) + 'folding': folding}) - return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, + return check_n_datasets_mos_kfold_som(evaluations=evaluations, scores=scores, eps=eps, - dataset_score_bounds=dataset_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py index e557325..de737ed 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -6,7 +6,7 @@ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index eea55a7..a4274fd 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -6,7 +6,7 @@ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass, _create_binary_folds_multiclass +from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro diff --git a/tests/aggregated/test_folding_utils.py b/tests/aggregated/test_folding_utils.py index 8433f4e..bd2b630 100644 --- a/tests/aggregated/test_folding_utils.py +++ b/tests/aggregated/test_folding_utils.py @@ -18,7 +18,8 @@ _check_specification_and_determine_p_n, determine_min_max_p, multiclass_stratified_folds, - transform_multiclass_fold_to_binary) + transform_multiclass_fold_to_binary, + _create_folds_multiclass) def test_generate_datasets_with_all_kfolds(): """ @@ -332,3 +333,13 @@ def test_transform_multiclass_fold_to_binary(): bfolds = transform_multiclass_fold_to_binary(dataset) assert len(bfolds) == len(dataset) + +def test_multiclass_create_folds_exception(): + """ + Testing the exception throwing of the multiclass fold creation + """ + + with pytest.raises(ValueError): + _create_folds_multiclass(dataset={'p': 5, 'n': 7}, + folding={'folds': 'dummy', + 'n_repeats': 5}) From af914dc7a3d35a1fd27d1586479b6be1f81bd889 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Thu, 2 Nov 2023 17:20:27 +0100 Subject: [PATCH 09/40] pylint 10.0 --- mlscorecheck/aggregated/_folding_utils.py | 22 +++++-- mlscorecheck/aggregated/_generate_problems.py | 61 ++++++++++++------- .../_check_1_dataset_known_folds_mos_macro.py | 29 +++++---- .../_check_1_dataset_known_folds_mos_micro.py | 25 ++++++-- .../_check_1_dataset_known_folds_som_macro.py | 56 +++++++++++------ .../_check_1_dataset_known_folds_som_micro.py | 43 +++++++------ .../check/regression/_check_regression.py | 6 +- mlscorecheck/individual/_problem_generator.py | 35 +++++++++-- mlscorecheck/scores/_multiclass_scores.py | 30 +++++---- tests/aggregated/test_folding_utils.py | 4 +- tests/aggregated/test_generate_problems.py | 13 +++- .../test_1_testset_no_kfold_macro.py | 5 +- .../test_1_testset_no_kfold_micro.py | 5 +- tests/scores/test_multiclass_scores.py | 9 ++- 14 files changed, 230 insertions(+), 113 deletions(-) diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index 3a4e010..b023d76 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -26,7 +26,7 @@ 'experiment_kfolds_generator', 'multiclass_stratified_folds', 'transform_multiclass_fold_to_binary', - '_create_folds_multiclass'] + 'create_folds_multiclass'] def stratified_configurations_sklearn(p: int, n: int, @@ -454,9 +454,9 @@ def multiclass_stratified_folds(dataset: dict, n_folds: int) -> list: list(dict): the list of fold specifications """ folds = [] - y = np.hstack([np.repeat(key, value) for key, value in dataset.items()]) - for _, test in StratifiedKFold(n_splits=n_folds).split(y.reshape(-1, 1), y, y): - folds.append({idx: count for idx, count in enumerate(np.bincount(y[test]))}) + labels = np.hstack([np.repeat(key, value) for key, value in dataset.items()]) + for _, test in StratifiedKFold(n_splits=n_folds).split(labels.reshape(-1, 1), labels, labels): + folds.append(dict(enumerate(np.bincount(labels[test])))) return folds @@ -473,7 +473,17 @@ def transform_multiclass_fold_to_binary(fold: dict) -> list: n_total = sum(fold.values()) return [{'p': value, 'n': n_total - value} for value in fold.values()] -def _create_folds_multiclass(dataset, folding): +def create_folds_multiclass(dataset: dict, folding: dict) -> list: + """ + Create the folds for the multiclass setup + + Args: + dataset (dict): the dataset specification + folding (dict): the folding specification + + Returns: + list(dict): the list of fold specifications + """ if folding.get('folds') is not None and (folding.get('n_repeats') is not None \ or folding.get('strategy') is not None or folding.get('n_folds') is not None): @@ -481,7 +491,7 @@ def _create_folds_multiclass(dataset, folding): if 'folds' in folding: return folding['folds'] - elif folding.get('strategy') == 'stratified_sklearn': + if folding.get('strategy') == 'stratified_sklearn': folds = multiclass_stratified_folds(dataset, folding.get('n_folds', 1)) else: folds = [dataset] diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index 37e36cf..784f501 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -12,7 +12,7 @@ from ..individual import (sample_multiclass_dataset, generate_multiclass_dataset) from ._folding_utils import (multiclass_stratified_folds, - _create_folds_multiclass) + create_folds_multiclass) from ..scores import calculate_multiclass_scores @@ -340,7 +340,8 @@ def generate_scores_for_testsets(testsets, return scores | {'beta_positive': 2, 'beta_negative': 2} -def generate_dataset_folding_multiclass(random_state=None, +def generate_dataset_folding_multiclass(*, + random_state=None, max_n_classes=5, min_n_classes=2, max_class_size=200, @@ -353,31 +354,49 @@ def generate_dataset_folding_multiclass(random_state=None, subset=None): """ Generates a multiclass dataset and folding with scores + + Args: + random_state (None|int|np.random.RandomState): the random state/seed to use + max_n_classes (int): the maximum number of classes + min_n_classes (int): the minimum number of classes + max_class_size (int): the maximum class size + min_class_size (int): the minimum class size + max_n_folds (int): the maximum number of folds + max_n_repeats (int): the maximum number of repeats + average (str): the type of averaging to use + aggregation (str): the type of aggregation to use + rounding_decimals (None|int): the number of decimals to round to + subset (None|list): the subset of scores + + Returns: + tuple(dict,dict,dict): the dataset, folding and scores """ if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) + if not aggregation in {'mos', 'som'}: + raise ValueError(f'Unknown aggregation: {aggregation}') + dataset = generate_multiclass_dataset(random_state=random_state, - max_n_classes=5, - min_n_classes=2, - max_class_size=200, - min_class_size=10) + max_n_classes=max_n_classes, + min_n_classes=min_n_classes, + max_class_size=max_class_size, + min_class_size=min_class_size) if random_state.randint(2) == 0: folding = {'n_folds': random_state.randint(2, max_n_folds), 'n_repeats': random_state.randint(1, max_n_repeats), 'strategy': 'stratified_sklearn'} elif random_state.randint(2) == 0: - folding = {'folds': multiclass_stratified_folds(dataset=dataset, - n_folds=random_state.randint(2, max_n_repeats))} + folding = \ + {'folds': multiclass_stratified_folds(dataset=dataset, + n_folds=random_state.randint(2, max_n_repeats))} else: folding = {'n_folds': 1} - folds = _create_folds_multiclass(dataset, folding) - - samples = [sample_multiclass_dataset(dataset=fold, random_state=random_state) for fold in folds] - - print(samples) + samples = [sample_multiclass_dataset(dataset=fold, + random_state=random_state) + for fold in create_folds_multiclass(dataset, folding)] if aggregation == 'mos': scores = [calculate_multiclass_scores(sample, @@ -387,12 +406,12 @@ def generate_dataset_folding_multiclass(random_state=None, subset=subset) for sample in samples] scores = round_scores(dict_mean(scores), rounding_decimals=rounding_decimals) return dataset, folding, scores - elif aggregation == 'som': - scores = calculate_multiclass_scores(np.sum(np.array(samples), axis=0), - average=average, - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=rounding_decimals, - subset=subset) - return dataset, folding, scores | {'beta_positive': 2, 'beta_negative': 2} + # if aggregation == 'som': + scores = calculate_multiclass_scores(np.sum(np.array(samples), axis=0), + average=average, + additional_symbols={'beta_positive': 2, + 'beta_negative': 2}, + rounding_decimals=rounding_decimals, + subset=subset) + return dataset, folding, scores | {'beta_positive': 2, 'beta_negative': 2} diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py index edc71ac..50e710e 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -3,13 +3,11 @@ of scores. """ -import copy - from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass +from ...aggregated import (transform_multiclass_fold_to_binary, + create_folds_multiclass) -from ..binary import (check_n_datasets_mos_kfold_som, - check_n_datasets_mos_known_folds_mos) +from ..binary import check_n_datasets_mos_known_folds_mos __all__ = ['check_1_dataset_known_folds_mos_macro'] @@ -19,7 +17,7 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, eps, *, class_score_bounds: dict = None, - dataset_score_bounds: dict = None, + fold_score_bounds: dict = None, solver_name: str = None, timeout: int = None, verbosity: int = 1, @@ -33,6 +31,15 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, testset (dict): the specification of the testset scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + class_score_bounds (None|dict, optional): Bounds on the scores in the classes. Defaults + to None. + fold_score_bounds (None|dict, optional): Bounds on the folds in the classes. Defaults to + None. + solver_name (None|str, optional): The solver to use. Defaults to None. + timeout (None|int, optional): The timeout for the linear programming solver in seconds. + Defaults to None. + verbosity (int, optional): The verbosity level of the pulp linear programming solver. + 0: silent, non-zero: verbose. Defaults to 1. numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is orders of magnitude smaller than the uncertainty of the @@ -43,9 +50,9 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible + with all scores. Under the key ``prefiltering_details`` one finds the results of the + prefiltering by using the solutions for the score pairs. Raises: ValueError: if the problem is not specified properly @@ -70,7 +77,7 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, >>> result['inconsistency'] # True """ - folds = _create_folds_multiclass(dataset, folding) + folds = create_folds_multiclass(dataset, folding) binary_folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] evaluations = [] @@ -86,7 +93,7 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, scores=scores, eps=eps, - dataset_score_bounds=dataset_score_bounds, + dataset_score_bounds=fold_score_bounds, solver_name=solver_name, timeout=timeout, verbosity=verbosity, diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index bbdf269..02fc4de 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -3,13 +3,11 @@ averaging of scores. """ -import copy - from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass +from ...aggregated import (transform_multiclass_fold_to_binary, + create_folds_multiclass) -from ..binary import (check_n_datasets_mos_kfold_som, - check_n_datasets_mos_known_folds_mos) +from ..binary import check_n_datasets_mos_kfold_som __all__ = ['check_1_dataset_known_folds_mos_micro'] @@ -18,6 +16,10 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, scores: dict, eps, *, + fold_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ This function checks the consistency of scores calculated by taking the micro average @@ -30,6 +32,13 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, folding (dict): The specification of the folding strategy. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + fold_score_bounds (None|dict, optional): Bounds on the scores in the folds. + Defaults to None. + solver_name (None|str, optional): The solver to use. Defaults to None. + timeout (None|int, optional): The timeout for the linear programming solver in seconds. + Defaults to None. + verbosity (int, optional): The verbosity level of the pulp linear programming solver. + 0: silent, non-zero: verbose. Defaults to 1. numerical_tolerance (float, optional): Beyond the numerical uncertainty of the scores, some further tolerance is applied. This is orders of magnitude smaller than the @@ -77,7 +86,7 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, >>> result['inconsistency'] # True """ - folds = _create_folds_multiclass(dataset, folding) + folds = create_folds_multiclass(dataset, folding) binary_folds = [transform_multiclass_fold_to_binary(fold) for fold in folds] evaluations = [] @@ -92,4 +101,8 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, return check_n_datasets_mos_kfold_som(evaluations=evaluations, scores=scores, eps=eps, + dataset_score_bounds=fold_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, numerical_tolerance=numerical_tolerance) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py index de737ed..3d5a56f 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -6,9 +6,8 @@ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass +from ...aggregated import create_folds_multiclass -from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro __all__ = ['check_1_dataset_known_folds_som_macro'] @@ -28,26 +27,45 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, on a single multiclass dataset and averaging across the folds in the SoM manner. Args: - dataset (dict): The specification of the dataset. - folding (dict): The specification of the folding strategy. + testset (dict): The specification of the testset. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. - average (str): The type of averaging to be used. - class_score_bounds (dict, optional): The bounds for the class scores. Defaults to None. - solver_name (str, optional): The name of the solver. Defaults to None. - timeout (int, optional): The maximum time allowed for the operation. Defaults to None. - verbosity (int, optional): The level of verbosity. Defaults to 1. - numerical_tolerance (float, optional): Beyond the numerical uncertainty of - the scores, some further tolerance is applied. This is - orders of magnitude smaller than the uncertainty of the - scores. Defaults to NUMERICAL_TOLERANCE. + class_score_bounds (None|dict, optional): Bounds on the scores in the classes. Defaults + to None. + solver_name (None|str, optional): The solver to use. Defaults to None. + timeout (None|int, optional): The timeout for the linear programming solver in seconds. + Defaults to None. + verbosity (int, optional): The verbosity level of the pulp linear programming solver. + 0: silent, non-zero: verbose. Defaults to 1. + numerical_tolerance (float, optional): In practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. + This is orders of magnitude smaller than the + uncertainty of the scores. It does ensure that the + specificity of the test is 1, it might slightly + decrease the sensitivity. Defaults to + NUMERICAL_TOLERANCE. Returns: - dict: A dictionary containing the results of the consistency check. The dictionary includes the following keys: - - 'inconsistency': A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, it indicates that the provided scores are not consistent with the dataset. - - 'details': A list providing further details from the analysis of the scores one after the other. Each entry in the list corresponds to the analysis result for one score. - - 'n_valid_tptn_pairs': The number of tp and tn pairs that are compatible with all scores. This gives an indication of how many different classification outcomes could have led to the provided scores. - - 'prefiltering_details': The results of the prefiltering by using the solutions for the score pairs. This provides additional information about the process of checking the scores. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'aggregated_results'``: + This entry is empty if the execution of the linear programming based check + was unnecessary. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. + Raises: ValueError: If the provided scores are not consistent with the dataset. @@ -72,7 +90,7 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, >>> result['inconsistency'] # True """ - folds = _create_folds_multiclass(dataset, folding) + folds = create_folds_multiclass(dataset, folding) testset = copy.deepcopy(folds[0]) for fold in folds[1:]: diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index a4274fd..0c3fbc5 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -6,10 +6,9 @@ import copy from ...core import NUMERICAL_TOLERANCE -from ...aggregated import transform_multiclass_fold_to_binary, _create_folds_multiclass +from ...aggregated import create_folds_multiclass from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro -from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro __all__ = ['check_1_dataset_known_folds_som_micro'] @@ -28,22 +27,32 @@ def check_1_dataset_known_folds_som_micro(dataset: dict, folding (dict): The specification of the folding strategy. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. - average (str): The type of averaging to be used. - class_score_bounds (dict, optional): The bounds for the class scores. Defaults to None. - solver_name (str, optional): The name of the solver. Defaults to None. - timeout (int, optional): The maximum time allowed for the operation. Defaults to None. - verbosity (int, optional): The level of verbosity. Defaults to 1. - numerical_tolerance (float, optional): Beyond the numerical uncertainty of - the scores, some further tolerance is applied. This is - orders of magnitude smaller than the uncertainty of the - scores. Defaults to NUMERICAL_TOLERANCE. + numerical_tolerance (float, optional): Beyond the numerical uncertainty of the scores, + some further tolerance is applied. This is orders of + magnitude smaller than the uncertainty of the scores. + Defaults to NUMERICAL_TOLERANCE. Returns: - dict: A dictionary containing the results of the consistency check. The dictionary includes the following keys: - - 'inconsistency': A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, it indicates that the provided scores are not consistent with the dataset. - - 'details': A list providing further details from the analysis of the scores one after the other. Each entry in the list corresponds to the analysis result for one score. - - 'n_valid_tptn_pairs': The number of tp and tn pairs that are compatible with all scores. This gives an indication of how many different classification outcomes could have led to the provided scores. - - 'prefiltering_details': The results of the prefiltering by using the solutions for the score pairs. This provides additional information about the process of checking the scores. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. Each entry in the list corresponds to the analysis + result for one score. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. This gives an indication of how many different + classification outcomes could have led to the provided scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. This provides additional information about + the process of checking the scores. + Raises: ValueError: If the provided scores are not consistent with the dataset. @@ -68,7 +77,7 @@ def check_1_dataset_known_folds_som_micro(dataset: dict, >>> result['inconsistency'] # True """ - folds = _create_folds_multiclass(dataset, folding) + folds = create_folds_multiclass(dataset, folding) print(folds) diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index 6dd0292..73e5a26 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -6,4 +6,8 @@ def check_regression(scores, eps): - pass \ No newline at end of file + """ + The consistency test for regression scores + """ + _ = scores + _ = eps diff --git a/mlscorecheck/individual/_problem_generator.py b/mlscorecheck/individual/_problem_generator.py index d3ca114..ed4183c 100644 --- a/mlscorecheck/individual/_problem_generator.py +++ b/mlscorecheck/individual/_problem_generator.py @@ -136,10 +136,23 @@ def generate_problems(*, return (evaluations[0], problems[0]) if n_problems == 1 else (evaluations, problems) def generate_multiclass_dataset(random_state=None, - max_n_classes=5, - min_n_classes=2, - max_class_size=200, - min_class_size=10): + max_n_classes: int=5, + min_n_classes: int=2, + max_class_size: int=200, + min_class_size: int=10) -> dict: + """ + Generates a multiclass dataset + + Args: + random_state (None|int|np.random.RandomState): the random seed to use + max_n_classes (int): the maximum number of classes + min_n_classes (int): the minimum number of classes + max_class_size (int): the maximum class size + min_class_size (int): the minimum class size + + Returns: + dict: a multiclass dataset + """ if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) @@ -149,7 +162,7 @@ def generate_multiclass_dataset(random_state=None, return classes -def create_confusion_matrix(y_true, y_pred): +def create_confusion_matrix(y_true: np.array, y_pred: np.array) -> np.array: """ Creates a confusion matrix @@ -168,7 +181,17 @@ def create_confusion_matrix(y_true, y_pred): return confusion_matrix -def sample_multiclass_dataset(dataset, random_state=None): +def sample_multiclass_dataset(dataset: dict, random_state=None) -> np.array: + """ + Samples a multiclass dataset + + Args: + dataset (dict): the dataset to sample + random_state (None|int|np.random.RandomState): the random seed to use + + Returns: + np.array: the confusion matrix + """ if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) diff --git a/mlscorecheck/scores/_multiclass_scores.py b/mlscorecheck/scores/_multiclass_scores.py index ddecc52..c7e03b2 100644 --- a/mlscorecheck/scores/_multiclass_scores.py +++ b/mlscorecheck/scores/_multiclass_scores.py @@ -82,11 +82,13 @@ def multiclass_score_macro(confusion_matrix, counts = np.sum(confusion_matrix, axis=1) n_total = np.sum(counts) - scores = [safe_call(score_function, {'p': counts[idx], - 'n': n_total - counts[idx], + scores = [safe_call(score_function, {'p': count, + 'n': n_total - count, 'tp': confusion_matrix[idx, idx], - 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + - np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])} + 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) \ + + np.sum(confusion_matrix[idx+1:, idx+1:]) \ + + np.sum(confusion_matrix[:idx, idx+1:]) \ + + np.sum(confusion_matrix[idx+1:, :idx])} | additional_params, score_specifications[name].get('nans')) for idx, count in enumerate(counts)] @@ -121,11 +123,13 @@ def multiclass_score_micro(confusion_matrix, 'n': 0} for idx, count in enumerate(counts): - params['p'] += counts[idx] - params['n'] += n_total - counts[idx] + params['p'] += count + params['n'] += n_total - count params['tp'] += confusion_matrix[idx, idx] - params['tn'] += np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + \ - np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx]) + params['tn'] += np.sum(confusion_matrix[0:idx, 0:idx]) \ + + np.sum(confusion_matrix[idx+1:, idx+1:]) \ + + np.sum(confusion_matrix[:idx, idx+1:]) \ + + np.sum(confusion_matrix[idx+1:, :idx]) return safe_call(score_function, params | additional_params, @@ -153,11 +157,13 @@ def multiclass_score_weighted(confusion_matrix, counts = np.sum(confusion_matrix, axis=1) n_total = np.sum(counts) - scores = [safe_call(score_function, {'p': counts[idx], - 'n': n_total - counts[idx], + scores = [safe_call(score_function, {'p': count, + 'n': n_total - count, 'tp': confusion_matrix[idx, idx], - 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) + np.sum(confusion_matrix[idx+1:, idx+1:]) + - np.sum(confusion_matrix[:idx, idx+1:]) + np.sum(confusion_matrix[idx+1:, :idx])} + 'tn': np.sum(confusion_matrix[0:idx, 0:idx]) \ + + np.sum(confusion_matrix[idx+1:, idx+1:]) \ + + np.sum(confusion_matrix[:idx, idx+1:]) \ + + np.sum(confusion_matrix[idx+1:, :idx])} | additional_params, score_specifications[name].get('nans'))\ * count / n_total diff --git a/tests/aggregated/test_folding_utils.py b/tests/aggregated/test_folding_utils.py index bd2b630..20e91ce 100644 --- a/tests/aggregated/test_folding_utils.py +++ b/tests/aggregated/test_folding_utils.py @@ -19,7 +19,7 @@ determine_min_max_p, multiclass_stratified_folds, transform_multiclass_fold_to_binary, - _create_folds_multiclass) + create_folds_multiclass) def test_generate_datasets_with_all_kfolds(): """ @@ -340,6 +340,6 @@ def test_multiclass_create_folds_exception(): """ with pytest.raises(ValueError): - _create_folds_multiclass(dataset={'p': 5, 'n': 7}, + create_folds_multiclass(dataset={'p': 5, 'n': 7}, folding={'folds': 'dummy', 'n_repeats': 5}) diff --git a/tests/aggregated/test_generate_problems.py b/tests/aggregated/test_generate_problems.py index 891aca6..bdde67d 100644 --- a/tests/aggregated/test_generate_problems.py +++ b/tests/aggregated/test_generate_problems.py @@ -2,7 +2,10 @@ This module tests the functionalities related to problem generation """ -from mlscorecheck.aggregated import generate_scores_for_testsets +import pytest + +from mlscorecheck.aggregated import (generate_scores_for_testsets, + generate_dataset_folding_multiclass) def test_generate_scores_for_testsets(): """ @@ -23,3 +26,11 @@ def test_generate_scores_for_testsets(): aggregation='som') assert len(scores) == 4 + +def test_exception(): + """ + Testing the exception throwing + """ + + with pytest.raises(ValueError): + generate_dataset_folding_multiclass(aggregation='dummy') diff --git a/tests/check/multiclass/test_1_testset_no_kfold_macro.py b/tests/check/multiclass/test_1_testset_no_kfold_macro.py index a0563bb..fa04abb 100644 --- a/tests/check/multiclass/test_1_testset_no_kfold_macro.py +++ b/tests/check/multiclass/test_1_testset_no_kfold_macro.py @@ -6,9 +6,8 @@ from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset, - create_confusion_matrix) -from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) + sample_multiclass_dataset) +from mlscorecheck.scores import calculate_multiclass_scores @pytest.mark.parametrize('random_seed', list(range(10))) def test_consistent_configuration(random_seed): diff --git a/tests/check/multiclass/test_1_testset_no_kfold_micro.py b/tests/check/multiclass/test_1_testset_no_kfold_micro.py index 3249595..9d69088 100644 --- a/tests/check/multiclass/test_1_testset_no_kfold_micro.py +++ b/tests/check/multiclass/test_1_testset_no_kfold_micro.py @@ -6,9 +6,8 @@ from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset, - create_confusion_matrix) -from mlscorecheck.scores import (multiclass_score_map, calculate_multiclass_scores) + sample_multiclass_dataset) +from mlscorecheck.scores import calculate_multiclass_scores @pytest.mark.parametrize('random_seed', list(range(10))) def test_consistent_configuration(random_seed): diff --git a/tests/scores/test_multiclass_scores.py b/tests/scores/test_multiclass_scores.py index 1e84095..a139196 100644 --- a/tests/scores/test_multiclass_scores.py +++ b/tests/scores/test_multiclass_scores.py @@ -10,8 +10,7 @@ from mlscorecheck.core import safe_call from mlscorecheck.scores import (multiclass_score_map, - multiclass_score, - score_functions_standardized_without_complements) + multiclass_score) from mlscorecheck.individual import (generate_multiclass_dataset, sample_multiclass_dataset, create_confusion_matrix) @@ -72,7 +71,7 @@ def test_compare_to_sklearn(average, random_seed): sample = create_confusion_matrix(y_true, y_pred) - ppv, sens, f1, _ = precision_recall_fscore_support(y_true, y_pred, average=average) + ppv, sens, f1p, _ = precision_recall_fscore_support(y_true, y_pred, average=average) sens_score = multiclass_score_map['sens'](confusion_matrix=sample, average=average) ppv_score = multiclass_score_map['ppv'](confusion_matrix=sample, average=average) @@ -80,7 +79,7 @@ def test_compare_to_sklearn(average, random_seed): assert abs(sens - sens_score) < 1e-8 assert abs(ppv - ppv_score) < 1e-8 - assert abs(f1 - f1_score) < 1e-8 + assert abs(f1p - f1_score) < 1e-8 def test_exception(): """ @@ -88,4 +87,4 @@ def test_exception(): """ with pytest.raises(ValueError): - multiclass_score(None, None, 'dummy') \ No newline at end of file + multiclass_score(None, None, 'dummy') From b3a5a0779825c58c181db320ae42b9020392a172 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 08:01:03 +0100 Subject: [PATCH 10/40] high level test docstrings improved --- README.rst | 6 +- docs/01c_consistency_checking.rst | 6 +- docs/03_api.rst | 2 +- .../binary/_check_1_dataset_kfold_som.py | 85 +- .../_check_1_dataset_known_folds_mos.py | 68 +- .../_check_1_dataset_unknown_folds_mos.py | 35 +- .../check/binary/_check_1_testset_no_kfold.py | 29 +- .../binary/_check_n_datasets_mos_kfold_som.py | 46 +- .../_check_n_datasets_mos_known_folds_mos.py | 61 +- ..._check_n_datasets_mos_unknown_folds_mos.py | 46 +- .../binary/_check_n_datasets_som_kfold_som.py | 44 +- .../binary/_check_n_testsets_mos_no_kfold.py | 46 +- .../binary/_check_n_testsets_som_no_kfold.py | 35 +- mlscorecheck/check/multiclass/__init__.py | 2 +- .../_check_1_dataset_known_folds_mos_macro.py | 42 +- .../_check_1_dataset_known_folds_mos_micro.py | 43 +- .../_check_1_dataset_known_folds_som_macro.py | 26 +- .../_check_1_dataset_known_folds_som_micro.py | 35 +- .../_check_1_testset_no_kfold_macro.py | 51 +- .../_check_1_testset_no_kfold_micro.py | 50 +- mlscorecheck/individual/_check_scores_tptn.py | 4 +- mlscorecheck/individual/_interval.py | 27 + .../00_check_1_testset_no_kfold.ipynb | 358 -------- .../illustration/01_check_1_dataset_som.ipynb | 182 ----- .../08_check_n_testsets_mos_no_kfold.ipynb | 431 ---------- .../11_check_1_testset_no_kfold_micro.ipynb | 161 ---- ...heck_1_dataset_known_folds_som_micro.ipynb | 218 ----- notebooks/illustration/40_capsule.ipynb | 6 +- .../binary/00_check_1_testset_no_kfold.ipynb | 358 ++++++++ .../binary/01_check_1_dataset_kfold_som.ipynb | 370 +++++++++ .../02_check_1_dataset_known_folds_mos.ipynb | 149 ++-- ...03_check_1_dataset_unknown_folds_mos.ipynb | 764 ++++++++++++------ .../04_check_n_datasets_som_kfold_som.ipynb | 36 +- .../05_check_n_datasets_mos_kfold_som.ipynb | 46 +- ...check_n_datasets_mos_known_folds_mos.ipynb | 44 +- ...eck_n_datasets_mos_unknown_folds_mos.ipynb | 623 +++++++------- .../08_check_n_testsets_mos_no_kfold.ipynb | 184 +++++ .../09_check_n_testsets_som_no_kfold.ipynb | 102 +-- .../00_retina_drive.ipynb} | 362 ++++----- .../01_retina_stare.ipynb} | 0 .../02_retina_chasedb1.ipynb} | 0 .../03_retina_hrf.ipynb} | 0 .../04_retina_diaretdb0.ipynb} | 0 .../05_retina_diaretdb1.ipynb} | 0 .../06_drishti_gs.ipynb} | 0 .../07_tpehg.ipynb} | 0 .../08_isic2016.ipynb} | 0 .../09_isic2017.ipynb} | 0 .../10_skin_lesion_analysis.ipynb} | 0 .../00_check_1_testset_no_kfold_macro.ipynb} | 56 +- .../01_check_1_testset_no_kfold_micro.ipynb | 313 +++++++ ...eck_1_dataset_known_folds_mos_macro.ipynb} | 45 +- ...eck_1_dataset_known_folds_mos_micro.ipynb} | 67 +- ...eck_1_dataset_known_folds_som_macro.ipynb} | 51 +- ...heck_1_dataset_known_folds_som_micro.ipynb | 271 +++++++ .../check/binary/test_1_dataset_som_scores.py | 8 +- 56 files changed, 3313 insertions(+), 2681 deletions(-) delete mode 100644 notebooks/illustration/00_check_1_testset_no_kfold.ipynb delete mode 100644 notebooks/illustration/01_check_1_dataset_som.ipynb delete mode 100644 notebooks/illustration/08_check_n_testsets_mos_no_kfold.ipynb delete mode 100644 notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb delete mode 100644 notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb create mode 100644 notebooks/illustration/binary/00_check_1_testset_no_kfold.ipynb create mode 100644 notebooks/illustration/binary/01_check_1_dataset_kfold_som.ipynb rename notebooks/illustration/{ => binary}/02_check_1_dataset_known_folds_mos.ipynb (69%) rename notebooks/illustration/{ => binary}/03_check_1_dataset_unknown_folds_mos.ipynb (84%) rename notebooks/illustration/{ => binary}/04_check_n_datasets_som_kfold_som.ipynb (69%) rename notebooks/illustration/{ => binary}/05_check_n_datasets_mos_kfold_som.ipynb (80%) rename notebooks/illustration/{ => binary}/06_check_n_datasets_mos_known_folds_mos.ipynb (79%) rename notebooks/illustration/{ => binary}/07_check_n_datasets_mos_unknown_folds_mos.ipynb (83%) create mode 100644 notebooks/illustration/binary/08_check_n_testsets_mos_no_kfold.ipynb rename notebooks/illustration/{ => binary}/09_check_n_testsets_som_no_kfold.ipynb (65%) rename notebooks/illustration/{20_retina_drive.ipynb => bundles/00_retina_drive.ipynb} (51%) rename notebooks/illustration/{21_retina_stare.ipynb => bundles/01_retina_stare.ipynb} (100%) rename notebooks/illustration/{22_retina_chasedb1.ipynb => bundles/02_retina_chasedb1.ipynb} (100%) rename notebooks/illustration/{23_retina_hrf.ipynb => bundles/03_retina_hrf.ipynb} (100%) rename notebooks/illustration/{24_retina_diaretdb0.ipynb => bundles/04_retina_diaretdb0.ipynb} (100%) rename notebooks/illustration/{25_retina_diaretdb1.ipynb => bundles/05_retina_diaretdb1.ipynb} (100%) rename notebooks/illustration/{26_drishti_gs.ipynb => bundles/06_drishti_gs.ipynb} (100%) rename notebooks/illustration/{27_tpehg.ipynb => bundles/07_tpehg.ipynb} (100%) rename notebooks/illustration/{28_isic2016.ipynb => bundles/08_isic2016.ipynb} (100%) rename notebooks/illustration/{29_isic2017.ipynb => bundles/09_isic2017.ipynb} (100%) rename notebooks/illustration/{30_skin_lesion_analysis.ipynb => bundles/10_skin_lesion_analysis.ipynb} (100%) rename notebooks/illustration/{10_check_1_testset_no_kfold_macro.ipynb => multiclass/00_check_1_testset_no_kfold_macro.ipynb} (69%) create mode 100644 notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb rename notebooks/illustration/{12_check_1_dataset_known_folds_mos_macro.ipynb => multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb} (88%) rename notebooks/illustration/{13_check_1_dataset_known_folds_mos_micro.ipynb => multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb} (82%) rename notebooks/illustration/{14_check_1_dataset_known_folds_som_macro.ipynb => multiclass/04_check_1_dataset_known_folds_som_macro.ipynb} (85%) create mode 100644 notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb diff --git a/README.rst b/README.rst index 733f753..8596622 100644 --- a/README.rst +++ b/README.rst @@ -353,7 +353,7 @@ For example, testing a consistent scenario: .. code-block:: Python - from mlscorecheck.check.binary import check_1_dataset_som + from mlscorecheck.check.binary import check_1_dataset_kfold_som dataset = {'dataset_name': 'common_datasets.monk-2'} folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} @@ -361,7 +361,7 @@ For example, testing a consistent scenario: scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - result = check_1_dataset_som(dataset=dataset, + result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -375,7 +375,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan scores = {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - result = check_1_dataset_som(dataset=dataset, + result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index 15b736c..d6ed11c 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -121,7 +121,7 @@ For example, testing a consistent scenario: .. code-block:: Python - >>> from mlscorecheck.check.binary import check_1_dataset_som + >>> from mlscorecheck.check.binary import check_1_dataset_kfold_som >>> dataset = {'dataset_name': 'common_datasets.monk-2'} >>> folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} @@ -129,7 +129,7 @@ For example, testing a consistent scenario: >>> scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som(dataset=dataset, + >>> result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -143,7 +143,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan >>> {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som(dataset=dataset, + >>> result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) diff --git a/docs/03_api.rst b/docs/03_api.rst index 112e97b..0daff0d 100644 --- a/docs/03_api.rst +++ b/docs/03_api.rst @@ -13,7 +13,7 @@ Binary classification --------------------- .. autofunction:: mlscorecheck.check.binary.check_1_testset_no_kfold -.. autofunction:: mlscorecheck.check.binary.check_1_dataset_som +.. autofunction:: mlscorecheck.check.binary.check_1_dataset_kfold_som .. autofunction:: mlscorecheck.check.binary.check_1_dataset_known_folds_mos .. autofunction:: mlscorecheck.check.binary.check_1_dataset_unknown_folds_mos .. autofunction:: mlscorecheck.check.binary.check_n_testsets_mos_no_kfold diff --git a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py index f4c3560..7dbb264 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py +++ b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py @@ -8,54 +8,68 @@ from ...individual import check_scores_tptn_pairs from ...aggregated import Experiment -__all__ = ['check_1_dataset_som'] +__all__ = ['check_1_dataset_kfold_som'] -def check_1_dataset_som(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +def check_1_dataset_kfold_som(dataset: dict, + folding: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True) -> dict: """ - Checking the consistency of scores calculated by applying k-fold - cross validation to one single dataset and aggregating the figures - over the folds in the score of means fashion. The test follows the - methodology of the the 1_dataset_no_kfold case. + This function checks the consistency of scores calculated by applying k-fold cross validation + to a single dataset and aggregating the figures over the folds in the score of means fashion. + The test is performed by exhaustively testing all possible confusion matrices. Args: - dataset (dict): the dataset specification - folding (dict): the folding specification - scores (dict(str,float)): the scores to check ('acc', 'sens', 'spec', - 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', - 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', - 'bm', 'pt', 'dor', 'ji', 'kappa'), when using - f-beta positive or f-beta negative, also set - 'beta_positive' and 'beta_negative'. - eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - numerical_tolerance (float): in practice, beyond the numerical uncertainty of - the scores, some further tolerance is applied. This is - orders of magnitude smaller than the uncertainty of the - scores. It does ensure that the specificity of the test - is 1, it might slightly decrease the sensitivity. + dataset (dict): The dataset specification. + folding (dict): The folding specification. + scores (dict(str,float)): The scores to check ('acc', 'sens', 'spec', 'bacc', 'npv', 'ppv', + 'f1', 'fm', 'f1n', 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', + 'mcc', 'bm', 'pt', 'dor', 'ji', 'kappa'). When using f-beta + positive or f-beta negative, also set 'beta_positive' and + 'beta_negative'. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + numerical_tolerance (float, optional): In practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This + is orders of magnitude smaller than the uncertainty + of the scores. It does ensure that the specificity + of the test is 1, it might slightly decrease the + sensitivity. Defaults to NUMERICAL_TOLERANCE. + prefilter_by_pairs (bool): whether to do a prefiltering based on the score-pair tp-tn + solutions (faster) Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.binary import check_1_dataset_som + >>> from mlscorecheck.check.binary import check_1_dataset_kfold_som >>> dataset = {'dataset_name': 'common_datasets.monk-2'} >>> folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} >>> scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - >>> result = check_1_dataset_som(dataset=dataset, + >>> result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -65,7 +79,7 @@ def check_1_dataset_som(dataset: dict, >>> dataset = {'p': 10, 'n': 20} >>> folding = {'n_folds': 5, 'n_repeats': 1} >>> scores = {'acc': 0.428, 'npv': 0.392, 'bacc': 0.442, 'f1p': 0.391} - >>> result = check_1_dataset_som(dataset=dataset, + >>> result = check_1_dataset_kfold_som(dataset=dataset, folding=folding, scores=scores, eps=1e-3) @@ -89,4 +103,5 @@ def check_1_dataset_som(dataset: dict, eps=eps, p=experiment.figures['p'], n=experiment.figures['n'], - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs) diff --git a/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py index 2d57c6d..ed8a939 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py +++ b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py @@ -1,7 +1,7 @@ """ This module implements the top level check function for scores calculated by the mean-of-scores aggregation -in a kfold scenario on one single dataset. +in a k-fold scenario on one single dataset. """ from ...core import NUMERICAL_TOLERANCE @@ -20,45 +20,49 @@ def check_1_dataset_known_folds_mos(dataset: dict, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by applying k-fold - cross validation to one single dataset and aggregating the figures - over the folds in the mean of scores fashion. Note that this - test can only check the consistency of the 'acc', 'sens', 'spec' - and 'bacc' scores. Note that without bounds, if there is a large - number of folds, it is likely that there will be a configuration - matching the scores provided. In order to increase the strength of - the test, one can add score_bounds to the individual folds if - for example, besides the average score, the minimum and the maximum - scores over the folds are also provided. + This function checks the consistency of scores calculated by applying k-fold cross validation + to a single dataset and aggregating the figures over the folds in the mean of scores fashion. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``fold_score_bounds`` when, for example, the minimum + and the maximum scores over the folds are also provided. Args: - dataset (dict): the specification of the dataset - folding (dict): the specification of the folding - scores (dict(str,float)): the scores to check - eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - fold_score_bounds (dict): bounds on the scores in the folds - solver_name (None|str): the solver to use - timeout (None|int): the timeout for the linear programming solver in seconds - verbosity (int): the verbosity level of the pulp linear programming solver - 0: silent, non-zero: verbose. - numerical_tolerance (float): in practice, beyond the numerical uncertainty of + dataset (dict): The dataset specification. + folding (dict): The folding specification. + scores (dict(str,float)): The scores to check. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + fold_score_bounds (None|dict(str,tuple(float,float))): Bounds on the scores in the folds. + solver_name (None|str): The solver to use. + timeout (None|int): The timeout for the linear programming solver in seconds. + verbosity (int): The verbosity level of the pulp linear programming solver. + 0: silent, non-zero: verbose. + numerical_tolerance (float): In practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is orders of magnitude smaller than the uncertainty of the scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py index 551e72a..432b395 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py +++ b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py @@ -1,6 +1,6 @@ """ This module implements consistency testing for scores calculated in a k-fold cross-validation -scenario with unknown fold structures. +scenario with unknown fold configuration. """ from ...core import NUMERICAL_TOLERANCE @@ -50,21 +50,31 @@ def check_1_dataset_unknown_folds_mos( numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores calculated in a k-fold cross validation on a single - dataset, in a mean-of-scores fashion, without knowing the folding strategy. - The function generates all possible foldings of k-valid folds and evaluates the - consistency on each of them. The scores are inconsistent if all the k-fold configurations + dataset, in a mean-of-scores fashion, without knowing the fold configuration. + The function generates all possible fold configurations and tests the + consistency of each. The scores are inconsistent if all the k-fold configurations lead to inconsistencies identified. + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add fold_score_bounds when, for example, the minimum and + the maximum scores over the folds are also provided. + Note that depending on the size of the dataset (especially the number of minority instances) and the folding configuration, this test might lead to an untractable number of problems to - be solved. Use the function ``estimate_n_evaluations`` to get a rough upper bound estimate + be solved. Use the function ``estimate_n_evaluations`` to get an upper bound estimate on the number of fold combinations. + The evaluation of possible fold configurations stops when a feasible configuration is found. + Args: dataset (dict): the dataset specification folding (dict): the folding specification scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + fold_score_bounds (None|dict(str,dict(str,str))): bounds on the scores in the folds solver_name (None|str): the solver to use timeout (None|int): the timeout for the linear programming solver in seconds verbosity (int): the verbosity level of the pulp linear programming solver @@ -76,10 +86,17 @@ def check_1_dataset_unknown_folds_mos( is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The details of the mean-of-scores checks and all fold configurations - can be found under the ``details`` key. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list of dictionaries containing the details of the consistency tests. Each + entry contains the specification of the folds being tested and the + outcome of the ``check_1_dataset_known_folds_mos`` function. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_1_testset_no_kfold.py b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py index 896867b..671077f 100644 --- a/mlscorecheck/check/binary/_check_1_testset_no_kfold.py +++ b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py @@ -1,6 +1,6 @@ """ This module implements the top level check function for -scores calculated from raw figures +scores calculated from one single confusion matrix. """ import warnings @@ -19,7 +19,8 @@ def check_1_testset_no_kfold(testset: dict, prefilter_by_pairs: bool = True) -> dict: """ Use this check if the scores are calculated on one single test set - with no kfolding or aggregation over multiple datasets. + with no kfolding. The test is performed by exhaustively testing all + possible confusion matrices. Args: testset (dict): the specification of a testset with p, n or its name @@ -39,12 +40,24 @@ def check_1_testset_no_kfold(testset: dict, solutions (faster) Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py index 8b24244..5d5b00e 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py @@ -1,7 +1,7 @@ """ This module implements the top level check function for scores calculated by the score of means aggregation -in a kfold scenarios and mean of scores aggregation on multiple datasets. +in k-fold scenarios and mean of scores aggregation on multiple datasets. """ import copy @@ -21,16 +21,23 @@ def check_n_datasets_mos_kfold_som(evaluations: list, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by applying k-fold - cross validation to multiple datasets and aggregating the figures - over the folds in the score of means fashion and over the datasets - in the mean of scores fashion. This aggregated check can be applied - only if some of the acc, sens, spec and bacc scores are provided. + This function checks the consistency of scores calculated on multiple datasets with k-fold + cross-validation, applying score of means aggregation over the folds and mean of scores + aggregation over the datasets. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``dataset_score_bounds`` when, for example, the minimum + and the maximum scores over the datasets are also provided. Args: evaluations (list(dict)): the list of evaluation specifications scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + dataset_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores in the datasets solver_name (None|str): the solver to use timeout (None|int): the timeout for the linear programming solver in seconds verbosity (int): the verbosity of the linear programming solver, @@ -42,17 +49,22 @@ def check_n_datasets_mos_kfold_som(evaluations: list, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py index 000b73b..59955f0 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py @@ -1,7 +1,7 @@ """ This module implements the top level check function for scores calculated by the mean of scores aggregation -in a kfold scenarios and mean of scores aggregation on multiple datastes. +in kfold scenarios and mean of scores aggregation on multiple datasets. """ import copy @@ -21,37 +21,50 @@ def check_n_datasets_mos_known_folds_mos(evaluations: list, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by applying k-fold - cross validation to multiple datasets and aggregating the figures - over the folds in the mean of scores fashion and over the datasets - in the mean of scores fashion. + This function checks the consistency of scores calculated by applying k-fold cross validation + to N datasets and aggregating the figures over the folds and datasets in the mean of scores + fashion. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``dataset_score_bounds`` when, for example, the + minimum and the maximum scores over the datasets are also provided. Args: - evaluations (list(dict)): the list of evaluation specifications - scores (dict(str,float)): the scores to check - eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - solver_name (None|str): the solver to use - timeout (None|int): the timeout for the linear programming solver in seconds - verbosity (int): the verbosity of the pulp linear programming solver, - 0: silent, non-zero: verbose - numerical_tolerance (float): in practice, beyond the numerical uncertainty of + evaluations (list): The list of evaluation specifications. + scores (dict(str,float)): The scores to check. + eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. + dataset_score_bounds (None|dict(str,tuple(float,float))): Bounds on the scores for the + datasets. + solver_name (None|str): The solver to use. + timeout (None|int): The timeout for the linear programming solver in seconds. + verbosity (int): The verbosity level of the pulp linear programming solver. + 0: silent, non-zero: verbose. + numerical_tolerance (float): In practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is orders of magnitude smaller than the uncertainty of the scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py index a952571..91a70d5 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py @@ -1,7 +1,8 @@ """ This module implements the top level check function for scores calculated by the mean of scores aggregation -in a kfold scenarios and mean of scores aggregation on multiple datasets. +in a kfold scenarios and mean of scores aggregation on multiple datasets, +but without knowing the fold configurations. """ import copy @@ -46,20 +47,32 @@ def check_n_datasets_mos_unknown_folds_mos(evaluations: list, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by applying k-fold - cross validation to multiple datasets and aggregating the figures - over the folds in the mean of scores fashion and over the datasets - in the mean of scores fashion. + Checking the consistency of scores calculated in k-fold cross validation on multiple + datasets, in mean-of-scores fashion, without knowing the fold configurations. + The function generates all possible fold configurations and tests the + consistency of each. The scores are inconsistent if all the k-fold configurations + lead to inconsistencies identified. - Note that depending on the number of the minority instances and on the - folding structure, this test might lead to enormous execution times. - Use the function ``estimate_n_experiments`` to get a rough upper bound estimate - on the number of experiments with different fold combinations. + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add dataset_score_bounds when, for example, the minimum and + the maximum scores over the datasets are also provided. + + Note that depending on the size of the dataset (especially the number of minority instances) + and the folding configuration, this test might lead to an untractable number of problems to + be solved. Use the function ``estimate_n_experiments`` to get an upper bound estimate + on the number of fold combinations. + + The evaluation of possible fold configurations stops when a feasible configuration is found. Args: evaluations (list(dict)): the list of evaluation specifications scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + dataset_score_bounds (None|dict(str,dict(float,float))): bounds on the scores in the + datasets solver_name (None|str): the solver to use timeout (None|int): the timeout for the linear programming solver in seconds verbosity (int): the verbosity of the pulp linear programming solver, @@ -71,10 +84,17 @@ def check_n_datasets_mos_unknown_folds_mos(evaluations: list, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The ``details`` entry contains all possible folding - combinations and the corresponding detailed results. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list of dictionaries containing the details of the consistency tests. Each + entry contains the specification of the folds being tested and the + outcome of the ``check_n_datasets_known_folds_mos`` function. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py index 925adee..bf80193 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py +++ b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py @@ -16,14 +16,13 @@ def check_n_datasets_som_kfold_som(evaluations: list, scores: dict, eps, *, - numerical_tolerance: float = NUMERICAL_TOLERANCE): + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True): """ Checking the consistency of scores calculated by applying k-fold cross validation to multiple datasets and aggregating the figures - over the folds and datasets in the score of means fashion. If - score bounds are specified and some of the 'acc', 'sens', 'spec' and - 'bacc' scores are supplied, the linear programming based check is - executed to see if the bound conditions can be satisfied. + over the folds and datasets in the score of means fashion. The test is + performed by exhaustively testing all possible confusion matrices. Args: evaluations (list(dict)): the specification of the evaluations @@ -39,14 +38,28 @@ def check_n_datasets_som_kfold_som(evaluations: list, orders of magnitude smaller than the uncertainty of the scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. + prefilter_by_pairs (bool): whether to do a prefiltering based on the score-pair tp-tn + solutions (faster) Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: if the problem is not specified properly @@ -97,7 +110,8 @@ def check_n_datasets_som_kfold_som(evaluations: list, # executing the individual tests return check_scores_tptn_pairs(scores=scores, - eps=eps, - p=experiment.figures['p'], - n=experiment.figures['n'], - numerical_tolerance=numerical_tolerance) + eps=eps, + p=experiment.figures['p'], + n=experiment.figures['n'], + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs) diff --git a/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py index a3dadc6..c3f5a64 100644 --- a/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py +++ b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py @@ -1,6 +1,7 @@ """ This module implements the top level check function for -scores calculated by the mean of scores aggregation over multiple testsets. +scores calculated by the mean of scores aggregation over multiple testsets +with no k-fold cross-validation. """ from ...aggregated import check_aggregated_scores, Experiment, Dataset @@ -18,16 +19,22 @@ def check_n_testsets_mos_no_kfold(testsets: list, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by the mean of scores - aggregation over multiple testsets. This aggregated check can be applied - only if some of the acc, sens, spec and bacc scores are provided. + This function checks the consistency of scores calculated on multiple testsets with no k-fold + and aggregating the figures over the testsets in the mean of scores fashion. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``testset_score_bounds`` when, for example, the minimum + and the maximum scores over the testsets are also provided. Args: testsets (list(dict)): the list of testset specifications scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - testset_score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores - of the testsets + testset_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores in the testsets solver_name (None|str): the solver to use timeout (None|int): the timeout for the linear programming solver in seconds verbosity (int): the verbosity of the linear programming solver, @@ -39,17 +46,22 @@ def check_n_testsets_mos_no_kfold(testsets: list, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py index 7015e1f..ec86da0 100644 --- a/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py +++ b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py @@ -1,7 +1,7 @@ """ This module implements the top level check function for scores calculated by the score-of-means aggregation -over multiple testsets. +over multiple testsets (with no kfold). """ from ...core import NUMERICAL_TOLERANCE @@ -15,13 +15,12 @@ def check_n_testsets_som_no_kfold(testsets: list, eps, *, numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs=True): + prefilter_by_pairs: bool = True): """ Checking the consistency of scores calculated by aggregating the figures - over testsets in the score of means fashion. If - score bounds are specified and some of the 'acc', 'sens', 'spec' and - 'bacc' scores are supplied, the linear programming based check is - executed to see if the bound conditions can be satisfied. + over testsets in the score of means fashion, without k-folding. + + The test is performed by exhaustively testing all possible confusion matrices. Args: datasets (list(dict)): the specification of the evaluations @@ -41,12 +40,24 @@ def check_n_testsets_som_no_kfold(testsets: list, solutions when possible to speed up the process Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/multiclass/__init__.py b/mlscorecheck/check/multiclass/__init__.py index 6ad207f..ccd5b87 100644 --- a/mlscorecheck/check/multiclass/__init__.py +++ b/mlscorecheck/check/multiclass/__init__.py @@ -6,5 +6,5 @@ from ._check_1_testset_no_kfold_micro import * from ._check_1_dataset_known_folds_som_macro import * from ._check_1_dataset_known_folds_som_micro import * -from ._check_1_dataset_known_folds_mos_macro import * from ._check_1_dataset_known_folds_mos_micro import * +from ._check_1_dataset_known_folds_mos_macro import * diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py index 50e710e..de51bd1 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -1,6 +1,6 @@ """ This module implements the multiclass tests in a k-fold MoS scenario with macro averaging -of scores. +of scores of classes. """ from ...core import NUMERICAL_TOLERANCE @@ -24,17 +24,23 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores calculated by taking the macro average - on one single multiclass dataset. The test follows the methodology of the - 1_dataset_som case. + of class-level scores on one single multiclass dataset with k-fold cross-validation. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``class_score_bounds`` or ``fold_score_bounds`` + when, for example, the minimum and the maximum scores over the classes or folds are available. Args: testset (dict): the specification of the testset scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - class_score_bounds (None|dict, optional): Bounds on the scores in the classes. Defaults - to None. - fold_score_bounds (None|dict, optional): Bounds on the folds in the classes. Defaults to - None. + class_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores for the classes + fold_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores in the folds solver_name (None|str, optional): The solver to use. Defaults to None. timeout (None|int, optional): The timeout for the linear programming solver in seconds. Defaults to None. @@ -47,12 +53,22 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index 02fc4de..bd63e9b 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -23,17 +23,22 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ This function checks the consistency of scores calculated by taking the micro average - on a single multiclass dataset with known folds. The test follows the methodology of the - 1_dataset_som case, but is specifically designed for multiclass classification problems - where the folds of the dataset are known beforehand. + on a single multiclass dataset with known folds. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``fold_score_bounds`` when, for example, the minimum + and the maximum scores over the folds are available. Args: dataset (dict): The specification of the dataset. folding (dict): The specification of the folding strategy. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. - fold_score_bounds (None|dict, optional): Bounds on the scores in the folds. - Defaults to None. + fold_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores in the folds solver_name (None|str, optional): The solver to use. Defaults to None. timeout (None|int, optional): The timeout for the linear programming solver in seconds. Defaults to None. @@ -48,20 +53,22 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, NUMERICAL_TOLERANCE. Returns: - dict: A summary of the results. The dictionary includes the following keys: - - ``inconsistency``: A boolean flag indicating whether the set of feasible - true positive (tp) and true negative (tn) pairs is empty. If True, it - indicates that the provided scores are not consistent with the dataset. - - ``details``: A list providing further details from the analysis of the - scores one after the other. Each entry in the list corresponds to the - analysis result for one score. - - ``n_valid_tptn_pairs``: The number of tp and tn pairs that are compatible - with all scores. This gives an indication of how many different classification - outcomes could have led to the provided scores. - - ``prefiltering_details``: The results of the prefiltering by using the - solutions for the score pairs. This provides additional information about the - process of checking the scores. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py index 3d5a56f..63be44e 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -1,6 +1,6 @@ """ This module implements the macro-averaged multiclass tests in a k-fold scenario -with SoM aggregation. +with SoM aggregation over the folds. """ import copy @@ -23,15 +23,23 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - This function checks the consistency of scores calculated by taking the micro or macro average - on a single multiclass dataset and averaging across the folds in the SoM manner. + This function checks the consistency of scores calculated by taking the macro average + on a single multiclass dataset and averaging the scores across the folds in the SoM manner. + + The test operates by constructing a linear program describing the experiment and checkings its + feasibility. + + The test can only check the consistency of the 'acc', 'sens', 'spec' and 'bacc' + scores. For a stronger test, one can add ``class_score_bounds`` when, for example, the minimum + and the maximum scores over the classes are available. Args: - testset (dict): The specification of the testset. + dataset (dict): The specification of the dataset. + folding (dict): The specification of the folding. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. - class_score_bounds (None|dict, optional): Bounds on the scores in the classes. Defaults - to None. + class_score_bounds (None|dict(str,tuple(float,float))): the potential bounds on the + scores for the classes solver_name (None|str, optional): The solver to use. Defaults to None. timeout (None|int, optional): The timeout for the linear programming solver in seconds. Defaults to None. @@ -52,10 +60,7 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, - ``'inconsistency'``: A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, - it indicates that the provided scores are not consistent with the dataset. - - ``'aggregated_results'``: - This entry is empty if the execution of the linear programming based check - was unnecessary. + it indicates that the provided scores are not consistent with the experiment. - ``'lp_status'``: The status of the lp solver. - ``'lp_configuration_scores_match'``: @@ -66,7 +71,6 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, - ``'lp_configuration'``: Contains the actual configuration of the linear programming solver. - Raises: ValueError: If the provided scores are not consistent with the dataset. diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index 0c3fbc5..bb86a95 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -17,20 +17,27 @@ def check_1_dataset_known_folds_som_micro(dataset: dict, scores: dict, eps, *, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True) -> dict: """ - This function checks the consistency of scores calculated by taking the micro or macro average - on a single multiclass dataset and averaging across the folds in the SoM manner. + This function checks the consistency of scores calculated by taking the micro average of + class level scores on a single multiclass dataset and averaging across the folds in the + SoM manner. + + The test is performed by exhaustively testing all possible confusion matrices. Args: dataset (dict): The specification of the dataset. folding (dict): The specification of the folding strategy. scores (dict(str,float)): The scores to check. eps (float|dict(str,float)): The numerical uncertainty(ies) of the scores. - numerical_tolerance (float, optional): Beyond the numerical uncertainty of the scores, - some further tolerance is applied. This is orders of - magnitude smaller than the uncertainty of the scores. - Defaults to NUMERICAL_TOLERANCE. + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. + prefilter_by_pairs (bool): whether to prefilter the solution space by pair + solutions when possible to speed up the process Returns: dict: A dictionary containing the results of the consistency check. The dictionary @@ -39,20 +46,18 @@ def check_1_dataset_known_folds_som_micro(dataset: dict, - ``'inconsistency'``: A boolean flag indicating whether the set of feasible true positive (tp) and true negative (tn) pairs is empty. If True, - it indicates that the provided scores are not consistent with the dataset. + it indicates that the provided scores are not consistent with the experiment. - ``'details'``: A list providing further details from the analysis of the scores one - after the other. Each entry in the list corresponds to the analysis - result for one score. + after the other. - ``'n_valid_tptn_pairs'``: The number of tp and tn pairs that are compatible with all - scores. This gives an indication of how many different - classification outcomes could have led to the provided scores. + scores. - ``'prefiltering_details'``: The results of the prefiltering by using the solutions for - the score pairs. This provides additional information about - the process of checking the scores. - + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: If the provided scores are not consistent with the dataset. diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py index 872f4e3..eb3359d 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py @@ -20,21 +20,25 @@ def check_1_testset_no_kfold_macro(testset: dict, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores calculated by taking the macro average - on one single multiclass dataset. Note that this - test can only check the consistency of the 'acc', 'sens', 'spec' - and 'bacc' scores. Note that without bounds, if there is a large - number of classes, it is likely that there will be a configuration - matching the scores provided. In order to increase the strength of - the test, one can add class_scores_bounds if - for example, besides the average score, the minimum and the maximum - scores over the classes are also provided. + The function tests the consistency of scores calculated by taking the macro average of + class level scores on one single multiclass dataset. + + The test operates by constructing a linear programming problem representing the experiment + and checking its feasibility. + + Note that this test can only check the consistency of the 'acc', 'sens', 'spec' + and 'bacc' scores. Note that without bounds, if there is a large number of classes, it is + likely that there will be a configuration matching the scores provided. In order to + increase the strength of the test, one can add ``class_scores_bounds`` when, for example, + besides the average score, the minimum and the maximum scores over the classes + are also provided. Args: testset (dict): the specification of the testset scores (dict(str,float)): the scores to check eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores - class_score_bounds (None|dict): bounds on the scores in the classes + class_score_bounds (None|dict(str,tuple(float,float))): bounds on the scores in the + classes solver_name (None|str): the solver to use timeout (None|int): the timeout for the linear programming solver in seconds verbosity (int): the verbosity level of the pulp linear programming solver @@ -46,17 +50,22 @@ def check_1_testset_no_kfold_macro(testset: dict, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. Raises: ValueError: if the problem is not specified properly diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py index 8981c29..8dab30a 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py @@ -6,7 +6,7 @@ from ...core import NUMERICAL_TOLERANCE from ...aggregated import transform_multiclass_fold_to_binary -from ..binary import check_1_dataset_som +from ..binary import check_1_dataset_kfold_som __all__ = ['check_1_testset_no_kfold_micro'] @@ -14,29 +14,50 @@ def check_1_testset_no_kfold_micro(testset: dict, scores: dict, eps, *, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True) -> dict: """ - Checking the consistency of scores calculated by taking the micro average - on one single multiclass dataset. The test follows the methodology of the - 1_dataset_som case. + Checking the consistency of scores calculated by taking the micro average of class level + scores on one single multiclass dataset. + + The test operates by the exhaustive enumeration of all potential confusion matrices. Args: testset (dict): the specification of the testset - scores (dict(str,float)): the scores to check + scores (dict(str,float)): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is orders of magnitude smaller than the uncertainty of the scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. + prefilter_by_pairs (bool): whether to prefilter the solution space by pair + solutions when possible to speed up the process Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Raises: ValueError: if the problem is not specified properly @@ -63,8 +84,9 @@ def check_1_testset_no_kfold_micro(testset: dict, dataset = {'p': sum(fold['p'] for fold in folds), 'n': sum(fold['n'] for fold in folds)} - return check_1_dataset_som(scores=scores, + return check_1_dataset_kfold_som(scores=scores, eps=eps, dataset=dataset, folding={'folds': folds}, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs) diff --git a/mlscorecheck/individual/_check_scores_tptn.py b/mlscorecheck/individual/_check_scores_tptn.py index c2c9ec5..216f59c 100644 --- a/mlscorecheck/individual/_check_scores_tptn.py +++ b/mlscorecheck/individual/_check_scores_tptn.py @@ -254,8 +254,8 @@ def _check_scores_tptn_pairs(p: int, 'n_valid_tptn_pairs': total_count, 'iterate_by': iterate_by, 'solve_for': solve_for, - 'evidence': ((list(valid_pairs.keys())[0], - valid_pairs[list(valid_pairs.keys())[0]].to_tuple()) + 'evidence': ({iterate_by: list(valid_pairs.keys())[0], + solve_for: valid_pairs[list(valid_pairs.keys())[0]].representing_int()} if len(valid_pairs) > 0 else None)} def check_all_negative_base(sols: list) -> bool: diff --git a/mlscorecheck/individual/_interval.py b/mlscorecheck/individual/_interval.py index 934e1a0..a9d2006 100644 --- a/mlscorecheck/individual/_interval.py +++ b/mlscorecheck/individual/_interval.py @@ -366,6 +366,19 @@ def __pow__(self, other): return res + def representing_int(self): + """ + Returns a representative integer + + Returns: + int: a representative element of the interval + """ + shrunk = self.shrink_to_integers() + if not shrunk.is_empty(): + return shrunk.lower_bound + return None + + class IntervalUnion: """ The interval union abstraction @@ -728,3 +741,17 @@ def __pow__(self, other): IntervalUnion: the return of the power operation """ return IntervalUnion([interval**other for interval in self.intervals]) + + def representing_int(self): + """ + Returns a representative integer + + Returns: + int: a representative element of the interval + """ + for interval in self.intervals: + integer = interval.representing_int() + if integer is not None: + return integer + + return None diff --git a/notebooks/illustration/00_check_1_testset_no_kfold.ipynb b/notebooks/illustration/00_check_1_testset_no_kfold.ipynb deleted file mode 100644 index 4f8b0b5..0000000 --- a/notebooks/illustration/00_check_1_testset_no_kfold.ipynb +++ /dev/null @@ -1,358 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [], - "source": [ - "from mlscorecheck.check.binary import check_1_testset_no_kfold\n", - "from mlscorecheck.individual import generate_problem_and_scores" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-31 11:54:10,621:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-31 11:54:10,623:INFO:calling the score check with scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", - "2023-10-31 11:54:10,625:INFO:checking the scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "2023-10-31 11:54:10,627:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-31 11:54:10,628:INFO:intervals before: (0, 530), (0, 902)\n", - "2023-10-31 11:54:10,630:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-31 11:54:10,631:INFO:the tn solutions: (751.6160759999999, 790.8639240000001)\n", - "2023-10-31 11:54:10,633:INFO:intervals after: [(112, 121)], [(752, 790)]\n", - "2023-10-31 11:54:10,635:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-31 11:54:10,636:INFO:intervals before: [(112, 121)], [(752, 790)]\n", - "2023-10-31 11:54:10,638:INFO:the tp solutions: (88.77533199999993, 135.4646680000002)\n", - "2023-10-31 11:54:10,639:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-31 11:54:10,640:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,642:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-31 11:54:10,644:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,645:INFO:the tp solutions: (108.20512460931658, 125.45746857652338)\n", - "2023-10-31 11:54:10,646:INFO:the tn solutions: (720.729741489652, 822.9954069390577)\n", - "2023-10-31 11:54:10,648:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,650:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-31 11:54:10,652:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,653:INFO:the tp solutions: (-16.316815204318672, 3.5854769758786067) | (101.7831884021151, 128.25349360431866)\n", - "2023-10-31 11:54:10,655:INFO:the tn solutions: (745.2636423956811, 800.379675597885) | (866.6502819978749, 921.7663152000788)\n", - "2023-10-31 11:54:10,656:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,657:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-31 11:54:10,659:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,660:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-31 11:54:10,661:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-31 11:54:10,663:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,665:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-31 11:54:10,666:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,668:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-31 11:54:10,669:INFO:the tn solutions: (657.2586176931766, 893.5046324530509)\n", - "2023-10-31 11:54:10,670:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,671:INFO:evaluating the tp and tn solution for sens and fm\n", - "2023-10-31 11:54:10,672:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,674:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-31 11:54:10,675:INFO:the tn solutions: (636.7166535970434, 917.0942703288408)\n", - "2023-10-31 11:54:10,677:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,678:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-31 11:54:10,680:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,681:INFO:the tp solutions: (109.76804841374923, 122.0385407814731)\n", - "2023-10-31 11:54:10,682:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-31 11:54:10,684:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,685:INFO:evaluating the tp and tn solution for spec and fm\n", - "2023-10-31 11:54:10,687:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,688:INFO:the tp solutions: (-65.8536328094769, -54.25856650052427) | (106.83422730052428, 121.82197200947691)\n", - "2023-10-31 11:54:10,689:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-31 11:54:10,690:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,691:INFO:evaluating the tp and tn solution for f1p and fm\n", - "2023-10-31 11:54:10,694:INFO:intervals before: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,696:INFO:the tp solutions: (80.82924045095699, 294.0107283921828)\n", - "2023-10-31 11:54:10,697:INFO:the tn solutions: (-420.04420024360695, 1292.9374484676016)\n", - "2023-10-31 11:54:10,699:INFO:intervals after: [(112, 121)], [(767, 784)]\n", - "2023-10-31 11:54:10,701:INFO:testing acc, feasible tptn pairs: 10\n", - "2023-10-31 11:54:10,704:INFO:testing sens, feasible tptn pairs: 10\n", - "2023-10-31 11:54:10,705:INFO:testing spec, feasible tptn pairs: 10\n", - "2023-10-31 11:54:10,706:INFO:testing f1p, feasible tptn pairs: 10\n", - "2023-10-31 11:54:10,708:INFO:testing fm, feasible tptn pairs: 10\n", - "2023-10-31 11:54:10,714:INFO:constructing final tp, tn pair set\n", - "2023-10-31 11:54:10,716:INFO:final number of intervals: 10\n", - "2023-10-31 11:54:10,717:INFO:final number of pairs: 130\n" - ] - }, - { - "data": { - "text/plain": [ - "False" - ] - }, - "execution_count": 10, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "testset = {'p': 530, 'n': 902}\n", - "scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "\n", - "result = check_1_testset_no_kfold(testset=testset,\n", - " scores=scores,\n", - " eps=1e-2)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 11, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-31 11:54:10,754:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-31 11:54:10,756:INFO:calling the score check with scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", - "2023-10-31 11:54:10,759:INFO:checking the scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "2023-10-31 11:54:10,761:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-31 11:54:10,763:INFO:intervals before: (0, 530), (0, 902)\n", - "2023-10-31 11:54:10,764:INFO:the tp solutions: (111.29894, 121.90106)\n", - "2023-10-31 11:54:10,765:INFO:the tn solutions: (1181.216076, 1220.4639240000004)\n", - "2023-10-31 11:54:10,767:INFO:intervals after: [(112, 121)], []\n", - "2023-10-31 11:54:10,769:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-31 11:54:10,770:INFO:intervals before: [(112, 121)], []\n", - "2023-10-31 11:54:10,772:INFO:the tp solutions: (518.3753319999998, 565.0646680000003)\n", - "2023-10-31 11:54:10,773:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", - "2023-10-31 11:54:10,774:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,775:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-31 11:54:10,778:INFO:intervals before: [], []\n", - "2023-10-31 11:54:10,779:INFO:the tp solutions: (20.470765551173063, 28.952218416378013)\n", - "2023-10-31 11:54:10,780:INFO:the tn solutions: (1232.0122032291965, 1355.3280073234066)\n", - "2023-10-31 11:54:10,781:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,782:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-31 11:54:10,783:INFO:all negative bases - iteration finished\n", - "2023-10-31 11:54:10,784:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-31 11:54:10,785:INFO:no more feasible tp,tn pairs left\n", - "2023-10-31 11:54:10,786:INFO:constructing final tp, tn pair set\n", - "2023-10-31 11:54:10,788:INFO:final number of intervals: 0\n", - "2023-10-31 11:54:10,789:INFO:final number of pairs: 0\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 11, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "testset = {'p': 530, 'n': 902}\n", - "scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", - "\n", - "result = check_1_testset_no_kfold(testset=testset,\n", - " scores=scores,\n", - " eps=1e-2)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 12, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-31 11:54:10,814:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-31 11:54:10,817:INFO:calling the score check with scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}, uncertainty 0.001, p 1029 and n 3118\n", - "2023-10-31 11:54:10,820:INFO:checking the scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}\n", - "2023-10-31 11:54:10,821:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-31 11:54:10,823:INFO:intervals before: (0, 1029), (0, 3118)\n", - "2023-10-31 11:54:10,824:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-31 11:54:10,827:INFO:the tn solutions: (2989.965647999999, 3000.3383520000007)\n", - "2023-10-31 11:54:10,829:INFO:intervals after: [(961, 962)], [(2990, 3000)]\n", - "2023-10-31 11:54:10,831:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-31 11:54:10,832:INFO:intervals before: [(961, 962)], [(2990, 3000)]\n", - "2023-10-31 11:54:10,833:INFO:the tp solutions: (877.7284699999991, 892.2875300000005)\n", - "2023-10-31 11:54:10,834:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-31 11:54:10,836:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,837:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-10-31 11:54:10,839:INFO:intervals before: [], []\n", - "2023-10-31 11:54:10,840:INFO:the tp solutions: (933.6679509487356, 949.8052939947056)\n", - "2023-10-31 11:54:10,842:INFO:the tn solutions: (2988.3769250334417, 3040.8179565580203)\n", - "2023-10-31 11:54:10,843:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,844:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-31 11:54:10,845:INFO:intervals before: [], []\n", - "2023-10-31 11:54:10,847:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-31 11:54:10,854:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-31 11:54:10,856:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,857:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-10-31 11:54:10,859:INFO:intervals before: [], []\n", - "2023-10-31 11:54:10,860:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", - "2023-10-31 11:54:10,861:INFO:the tn solutions: (3002.3483691722586, 3022.4720549935846)\n", - "2023-10-31 11:54:10,862:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,863:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-10-31 11:54:10,865:INFO:intervals before: [], []\n", - "2023-10-31 11:54:10,867:INFO:the tp solutions: (392.8031470217782, 459.241011658118)\n", - "2023-10-31 11:54:10,868:INFO:the tn solutions: (3068.105764, 3074.354236)\n", - "2023-10-31 11:54:10,869:INFO:intervals after: [], []\n", - "2023-10-31 11:54:10,871:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-31 11:54:10,872:INFO:no more feasible tp,tn pairs left\n", - "2023-10-31 11:54:10,873:INFO:constructing final tp, tn pair set\n", - "2023-10-31 11:54:10,874:INFO:final number of intervals: 0\n", - "2023-10-31 11:54:10,875:INFO:final number of pairs: 0\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 12, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = check_1_testset_no_kfold(\n", - " scores={'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901},\n", - " eps=1e-3,\n", - " testset={'name': 'common_datasets.ADA'}\n", - " )\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 13, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "({'p': 210, 'n': 745},\n", - " {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56})" - ] - }, - "execution_count": 13, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "problem, scores = generate_problem_and_scores(rounding_decimals=2,\n", - " score_subset=['acc', 'sens', 'spec',\n", - " 'f1p', 'fm'])\n", - "problem, scores" - ] - }, - { - "cell_type": "code", - "execution_count": 14, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-31 11:54:10,923:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-31 11:54:10,924:INFO:calling the score check with scores {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56}, uncertainty 0.01, p 210 and n 745\n", - "2023-10-31 11:54:10,926:INFO:checking the scores {'acc': 0.57, 'sens': 0.95, 'spec': 0.47, 'f1p': 0.49, 'fm': 0.56}\n", - "2023-10-31 11:54:10,928:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-31 11:54:10,929:INFO:intervals before: (0, 210), (0, 745)\n", - "2023-10-31 11:54:10,930:INFO:the tp solutions: (197.39958, 201.60042)\n", - "2023-10-31 11:54:10,932:INFO:the tn solutions: (333.1976699999999, 356.50233000000003)\n", - "2023-10-31 11:54:10,933:INFO:intervals after: [(198, 201)], [(334, 356)]\n", - "2023-10-31 11:54:10,935:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-31 11:54:10,936:INFO:intervals before: [(198, 201)], [(334, 356)]\n", - "2023-10-31 11:54:10,938:INFO:the tp solutions: (177.19659999999993, 211.20340000000004)\n", - "2023-10-31 11:54:10,941:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", - "2023-10-31 11:54:10,942:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,943:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-31 11:54:10,945:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,946:INFO:the tp solutions: (185.120712039396, 210.10263581436337)\n", - "2023-10-31 11:54:10,947:INFO:the tn solutions: (303.0201876109897, 392.7052872173289)\n", - "2023-10-31 11:54:10,948:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,949:INFO:evaluating the tp and tn solution for acc and fm\n", - "2023-10-31 11:54:10,952:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,953:INFO:the tp solutions: (-71.99544241189348, -61.34513581197725) | (190.70466541197726, 206.0599128118935)\n", - "2023-10-31 11:54:10,955:INFO:the tn solutions: (328.7381771881064, 363.1972445880227) | (593.7487386102972, 628.2078060102135)\n", - "2023-10-31 11:54:10,958:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,959:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-31 11:54:10,971:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,973:INFO:the tp solutions: (197.39958, 201.60042)\n", - "2023-10-31 11:54:10,976:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", - "2023-10-31 11:54:10,977:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,979:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-31 11:54:10,981:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,982:INFO:the tp solutions: (197.39958, 201.60042)\n", - "2023-10-31 11:54:10,983:INFO:the tn solutions: (299.8961076172496, 382.3002662528595)\n", - "2023-10-31 11:54:10,985:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,985:INFO:evaluating the tp and tn solution for sens and fm\n", - "2023-10-31 11:54:10,987:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,988:INFO:the tp solutions: (197.39958, 201.60042)\n", - "2023-10-31 11:54:10,992:INFO:the tn solutions: (281.73699880692305, 403.30020353302064)\n", - "2023-10-31 11:54:10,995:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:10,997:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-31 11:54:10,999:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,003:INFO:the tp solutions: (188.65112677679375, 204.1015852041003)\n", - "2023-10-31 11:54:11,004:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", - "2023-10-31 11:54:11,009:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,011:INFO:evaluating the tp and tn solution for spec and fm\n", - "2023-10-31 11:54:11,013:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,014:INFO:the tp solutions: (-136.23520570961827, -127.13922259117933) | (191.81898739117935, 203.2674409096183)\n", - "2023-10-31 11:54:11,018:INFO:the tn solutions: (342.69851, 357.60148999999996)\n", - "2023-10-31 11:54:11,020:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,021:INFO:evaluating the tp and tn solution for f1p and fm\n", - "2023-10-31 11:54:11,028:INFO:intervals before: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,030:INFO:the tp solutions: (56.03616326493973, 85.00819613176057) | (179.9747957264409, 218.80763214312438)\n", - "2023-10-31 11:54:11,031:INFO:the tn solutions: (212.67693278746776, 483.0344824810753) | (594.3566551997255, 897.1902513241985)\n", - "2023-10-31 11:54:11,033:INFO:intervals after: [(198, 201)], [(343, 356)]\n", - "2023-10-31 11:54:11,035:INFO:testing acc, feasible tptn pairs: 4\n", - "2023-10-31 11:54:11,036:INFO:testing sens, feasible tptn pairs: 4\n", - "2023-10-31 11:54:11,038:INFO:testing spec, feasible tptn pairs: 4\n", - "2023-10-31 11:54:11,039:INFO:testing f1p, feasible tptn pairs: 4\n", - "2023-10-31 11:54:11,040:INFO:testing fm, feasible tptn pairs: 4\n", - "2023-10-31 11:54:11,042:INFO:constructing final tp, tn pair set\n", - "2023-10-31 11:54:11,043:INFO:final number of intervals: 4\n", - "2023-10-31 11:54:11,044:INFO:final number of pairs: 46\n" - ] - } - ], - "source": [ - "result = check_1_testset_no_kfold(scores=scores,\n", - " eps=1e-2,\n", - " testset=problem)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "mlscorecheck", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.10.0" - }, - "orig_nbformat": 4 - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/notebooks/illustration/01_check_1_dataset_som.ipynb b/notebooks/illustration/01_check_1_dataset_som.ipynb deleted file mode 100644 index 3473cab..0000000 --- a/notebooks/illustration/01_check_1_dataset_som.ipynb +++ /dev/null @@ -1,182 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from mlscorecheck.check import check_1_dataset_som_scores\n", - "from mlscorecheck.aggregated import Dataset, Evaluation, generate_evaluation" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "({'dataset': {'p': 195, 'n': 402},\n", - " 'folding': {'n_folds': 10, 'n_repeats': 5, 'strategy': 'stratified_sklearn'},\n", - " 'fold_score_bounds': None,\n", - " 'aggregation': 'mos'},\n", - " {'acc': 0.487, 'sens': 0.467, 'spec': 0.496, 'bacc': 0.481})" - ] - }, - "execution_count": 2, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "dataset, scores = generate_evaluation(return_scores=True, rounding_decimals=3)\n", - "dataset, scores" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-26 23:38:05,126:INFO:testing spec, feasible tptn pairs: 613\n", - "2023-10-26 23:38:05,129:INFO:testing bacc, feasible tptn pairs: 613\n", - "2023-10-26 23:38:05,144:INFO:testing npv, feasible tptn pairs: 2\n", - "2023-10-26 23:38:05,145:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-10-26 23:38:05,146:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-10-26 23:38:05,148:INFO:testing fm, feasible tptn pairs: 1\n", - "2023-10-26 23:38:05,148:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:38:05,150:INFO:final number of intervals: 1\n", - "2023-10-26 23:38:05,151:INFO:final number of pairs: 1\n" - ] - }, - { - "data": { - "text/plain": [ - "False" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "dataset = {'dataset_name': 'common_datasets.monk-2'}\n", - "folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}\n", - "scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", - "result = check_1_dataset_som_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-26 23:38:05,163:INFO:testing spec, feasible tptn pairs: 613\n", - "2023-10-26 23:38:05,166:INFO:testing bacc, feasible tptn pairs: 613\n", - "2023-10-26 23:38:05,184:INFO:testing npv, feasible tptn pairs: 2\n", - "2023-10-26 23:38:05,185:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:38:05,186:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:38:05,187:INFO:final number of intervals: 0\n", - "2023-10-26 23:38:05,187:INFO:final number of pairs: 0\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "dataset = {'dataset_name': 'common_datasets.monk-2'}\n", - "folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}\n", - "scores = {'spec': 0.668, 'npv': 0.544, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", - "result = check_1_dataset_som_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-26 23:38:05,199:INFO:testing acc, feasible tptn pairs: 11\n", - "2023-10-26 23:38:05,202:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:38:05,203:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:38:05,204:INFO:final number of intervals: 0\n", - "2023-10-26 23:38:05,205:INFO:final number of pairs: 0\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "dataset = {'p': 10, 'n': 20}\n", - "folding = {'n_folds': 5, 'n_repeats': 1}\n", - "scores = {'acc': 0.428, 'npv': 0.392, 'bacc': 0.442, 'f1p': 0.391}\n", - "\n", - "result = check_1_dataset_som_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", - "result['inconsistency']" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "mlscorecheck", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.10.0" - }, - "orig_nbformat": 4 - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/notebooks/illustration/08_check_n_testsets_mos_no_kfold.ipynb b/notebooks/illustration/08_check_n_testsets_mos_no_kfold.ipynb deleted file mode 100644 index d86ccc3..0000000 --- a/notebooks/illustration/08_check_n_testsets_mos_no_kfold.ipynb +++ /dev/null @@ -1,431 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "from mlscorecheck.check import check_n_testsets_mos_no_kfold_scores" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [], - "source": [ - "testsets = [{'p': 349, 'n': 50},\n", - " {'p': 478, 'n': 323},\n", - " {'p': 324, 'n': 83},\n", - " {'p': 123, 'n': 145}]\n", - "\n", - "scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251}" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Welcome to the CBC MILP Solver \n", - "Version: 2.10.3 \n", - "Build Date: Dec 15 2019 \n", - "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d8f56a21f91e4a1bb0c6fd59d083cfc1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8f56a21f91e4a1bb0c6fd59d083cfc1-pulp.sol (default strategy 1)\n", - "At line 2 NAME MODEL\n", - "At line 3 ROWS\n", - "At line 13 COLUMNS\n", - "At line 79 RHS\n", - "At line 88 BOUNDS\n", - "At line 98 ENDATA\n", - "Problem MODEL has 8 rows, 9 columns and 48 elements\n", - "Coin0008I MODEL read with 0 errors\n", - "Option for timeMode changed from cpu to elapsed\n", - "Continuous objective value is 0 - 0.00 seconds\n", - "Cgl0004I processed model has 4 rows, 8 columns (8 integer (0 of which binary)) and 24 elements\n", - "Cbc0031I 2 added rows had average density of 8\n", - "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 28 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 51 row cuts average 7.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 2 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 6 row cuts average 3.3 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.03 seconds)\n", - "Cbc0016I Integer solution of 0 found by strong branching after 114 iterations and 26 nodes (0.03 seconds)\n", - "Cbc0001I Search completed - best objective 0, took 114 iterations and 26 nodes (0.03 seconds)\n", - "Cbc0032I Strong branching done 138 times (203 iterations), fathomed 1 nodes and fixed 31 variables\n", - "Cbc0035I Maximum depth 22, 0 variables fixed on reduced cost\n", - "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds)\n", - "Gomory was tried 28 times and created 51 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 28 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "FlowCover was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 28 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "\n", - "Result - Optimal solution found\n", - "\n", - "Objective value: 0.00000000\n", - "Enumerated nodes: 26\n", - "Total iterations: 114\n", - "Time (CPU seconds): 0.02\n", - "Time (Wallclock seconds): 0.03\n", - "\n", - "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.05\n", - "\n" - ] - }, - { - "data": { - "text/plain": [ - "{'inconsistency': False,\n", - " 'lp_scores': {'acc': 0.6440088293794702,\n", - " 'sens': 0.6706134825883379,\n", - " 'spec': 0.3795180722891566,\n", - " 'bacc': 0.5250657774387473},\n", - " 'lp_status': 'feasible',\n", - " 'lp_configuration_scores_match': True,\n", - " 'lp_configuration_bounds_match': True,\n", - " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 349,\n", - " 'n': 50,\n", - " 'identifier': 'bslgx_0',\n", - " 'tp': 343.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.8596491228070176,\n", - " 'sens': 0.982808022922636,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.491404011461318},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.8596491228070176,\n", - " 'sens': 0.982808022922636,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.491404011461318},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 349,\n", - " 'n': 50,\n", - " 'identifier': 'bslgx_0',\n", - " 'tp': 343.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.8596491228070176,\n", - " 'sens': 0.982808022922636,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.491404011461318},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 478,\n", - " 'n': 323,\n", - " 'identifier': 'fiufl_1',\n", - " 'tp': 272.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.33957553058676654,\n", - " 'sens': 0.5690376569037656,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.2845188284518828},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.33957553058676654,\n", - " 'sens': 0.5690376569037656,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.2845188284518828},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 478,\n", - " 'n': 323,\n", - " 'identifier': 'fiufl_1',\n", - " 'tp': 272.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.33957553058676654,\n", - " 'sens': 0.5690376569037656,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.2845188284518828},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 324,\n", - " 'n': 83,\n", - " 'identifier': 'bnafx_2',\n", - " 'tp': 203.0,\n", - " 'tn': 43.0},\n", - " 'scores': {'acc': 0.6044226044226044,\n", - " 'sens': 0.6265432098765432,\n", - " 'spec': 0.5180722891566265,\n", - " 'bacc': 0.5723077495165849},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.6044226044226044,\n", - " 'sens': 0.6265432098765432,\n", - " 'spec': 0.5180722891566265,\n", - " 'bacc': 0.5723077495165849},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 324,\n", - " 'n': 83,\n", - " 'identifier': 'bnafx_2',\n", - " 'tp': 203.0,\n", - " 'tn': 43.0},\n", - " 'scores': {'acc': 0.6044226044226044,\n", - " 'sens': 0.6265432098765432,\n", - " 'spec': 0.5180722891566265,\n", - " 'bacc': 0.5723077495165849},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 123,\n", - " 'n': 145,\n", - " 'identifier': 'fuluc_3',\n", - " 'tp': 62.0,\n", - " 'tn': 145.0},\n", - " 'scores': {'acc': 0.7723880597014925,\n", - " 'sens': 0.5040650406504066,\n", - " 'spec': 1.0,\n", - " 'bacc': 0.7520325203252033},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.7723880597014925,\n", - " 'sens': 0.5040650406504066,\n", - " 'spec': 1.0,\n", - " 'bacc': 0.7520325203252033},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 123,\n", - " 'n': 145,\n", - " 'identifier': 'fuluc_3',\n", - " 'tp': 62.0,\n", - " 'tn': 145.0},\n", - " 'scores': {'acc': 0.7723880597014925,\n", - " 'sens': 0.5040650406504066,\n", - " 'spec': 1.0,\n", - " 'bacc': 0.7520325203252033},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}}],\n", - " 'bounds_flag': True}}" - ] - }, - "execution_count": 8, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "check_n_testsets_mos_no_kfold_scores(testsets=testsets,\n", - " scores=scores,\n", - " eps=0.0001)" - ] - }, - { - "cell_type": "code", - "execution_count": 9, - "metadata": {}, - "outputs": [], - "source": [ - "scores['sens'] = 0.6756" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Welcome to the CBC MILP Solver \n", - "Version: 2.10.3 \n", - "Build Date: Dec 15 2019 \n", - "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1807329629f84607bf51059a96b16fd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1807329629f84607bf51059a96b16fd1-pulp.sol (default strategy 1)\n", - "At line 2 NAME MODEL\n", - "At line 3 ROWS\n", - "At line 13 COLUMNS\n", - "At line 79 RHS\n", - "At line 88 BOUNDS\n", - "At line 98 ENDATA\n", - "Problem MODEL has 8 rows, 9 columns and 48 elements\n", - "Coin0008I MODEL read with 0 errors\n", - "Option for timeMode changed from cpu to elapsed\n", - "Problem is infeasible - 0.00 seconds\n", - "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", - "\n" - ] - }, - { - "data": { - "text/plain": [ - "{'inconsistency': True,\n", - " 'lp_status': 'infeasible',\n", - " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 349,\n", - " 'n': 50,\n", - " 'identifier': 'ihkbo_0',\n", - " 'tp': 244.9966,\n", - " 'tn': 30.326935},\n", - " 'scores': {'acc': 0.6900339223057643,\n", - " 'sens': 0.701995988538682,\n", - " 'spec': 0.6065387,\n", - " 'bacc': 0.654267344269341},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.6900339223057643,\n", - " 'sens': 0.701995988538682,\n", - " 'spec': 0.6065387,\n", - " 'bacc': 0.654267344269341},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 349,\n", - " 'n': 50,\n", - " 'identifier': 'ihkbo_0',\n", - " 'tp': 244.9966,\n", - " 'tn': 30.326935},\n", - " 'scores': {'acc': 0.6900339223057643,\n", - " 'sens': 0.701995988538682,\n", - " 'spec': 0.6065387,\n", - " 'bacc': 0.654267344269341},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 478,\n", - " 'n': 323,\n", - " 'identifier': 'gabnd_1',\n", - " 'tp': 478.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.5967540574282147,\n", - " 'sens': 0.9999999999999999,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.49999999999999994},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.5967540574282147,\n", - " 'sens': 0.9999999999999999,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.49999999999999994},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 478,\n", - " 'n': 323,\n", - " 'identifier': 'gabnd_1',\n", - " 'tp': 478.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.5967540574282147,\n", - " 'sens': 0.9999999999999999,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.49999999999999994},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 324,\n", - " 'n': 83,\n", - " 'identifier': 'agobc_2',\n", - " 'tp': 324.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.7960687960687961,\n", - " 'sens': 1.0,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.5},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.7960687960687961,\n", - " 'sens': 1.0,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.5},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 324,\n", - " 'n': 83,\n", - " 'identifier': 'agobc_2',\n", - " 'tp': 324.0,\n", - " 'tn': 0.0},\n", - " 'scores': {'acc': 0.7960687960687961,\n", - " 'sens': 1.0,\n", - " 'spec': 0.0,\n", - " 'bacc': 0.5},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}},\n", - " {'folds': {'folds': [{'fold': {'p': 123,\n", - " 'n': 145,\n", - " 'identifier': 'qorcw_3',\n", - " 'tp': 0.0,\n", - " 'tn': 132.16131},\n", - " 'scores': {'acc': 0.49313921641791036,\n", - " 'sens': 0.0,\n", - " 'spec': 0.9114573103448275,\n", - " 'bacc': 0.45572865517241373},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True},\n", - " 'scores': {'acc': 0.49313921641791036,\n", - " 'sens': 0.0,\n", - " 'spec': 0.9114573103448275,\n", - " 'bacc': 0.45572865517241373},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': {'folds': [{'fold': {'p': 123,\n", - " 'n': 145,\n", - " 'identifier': 'qorcw_3',\n", - " 'tp': 0.0,\n", - " 'tn': 132.16131},\n", - " 'scores': {'acc': 0.49313921641791036,\n", - " 'sens': 0.0,\n", - " 'spec': 0.9114573103448275,\n", - " 'bacc': 0.45572865517241373},\n", - " 'score_bounds': None,\n", - " 'bounds_flag': True}],\n", - " 'bounds_flag': True}}],\n", - " 'bounds_flag': True}}" - ] - }, - "execution_count": 10, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "check_n_testsets_mos_no_kfold_scores(testsets=testsets,\n", - " scores=scores,\n", - " eps=0.0001)" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - } - ], - "metadata": { - "kernelspec": { - "display_name": "mlscorecheck", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.10.0" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb deleted file mode 100644 index b9607e6..0000000 --- a/notebooks/illustration/11_check_1_testset_no_kfold_micro.ipynb +++ /dev/null @@ -1,161 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "metadata": {}, - "outputs": [], - "source": [ - "from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "metadata": {}, - "outputs": [], - "source": [ - "testset = {0: 10, 1: 100, 2: 80}" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "metadata": {}, - "outputs": [], - "source": [ - "scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368,\n", - " 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-11-01 12:41:04,041:INFO:testing acc, feasible tptn pairs: 191\n", - "2023-11-01 12:41:04,054:INFO:testing sens, feasible tptn pairs: 191\n", - "2023-11-01 12:41:04,060:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-01 12:41:04,063:INFO:testing bacc, feasible tptn pairs: 1\n", - "2023-11-01 12:41:04,065:INFO:testing npv, feasible tptn pairs: 1\n", - "2023-11-01 12:41:04,067:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-11-01 12:41:04,068:INFO:constructing final tp, tn pair set\n", - "2023-11-01 12:41:04,070:INFO:final number of intervals: 1\n", - "2023-11-01 12:41:04,072:INFO:final number of pairs: 1\n" - ] - }, - { - "data": { - "text/plain": [ - "False" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "results = check_1_testset_no_kfold_micro(testset=testset,\n", - " scores=scores,\n", - " eps=1e-4)\n", - "results['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "0.8184" - ] - }, - "execution_count": 7, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores['acc']" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-11-01 12:41:04,174:INFO:testing acc, feasible tptn pairs: 191\n", - "2023-11-01 12:41:04,194:INFO:no more feasible tp,tn pairs left\n", - "2023-11-01 12:41:04,197:INFO:constructing final tp, tn pair set\n", - "2023-11-01 12:41:04,198:INFO:final number of intervals: 0\n", - "2023-11-01 12:41:04,201:INFO:final number of pairs: 0\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 8, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "results = check_1_testset_no_kfold_micro(testset=testset,\n", - " scores=scores,\n", - " eps=1e-4)\n", - "results['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - } - ], - "metadata": { - "kernelspec": { - "display_name": "mlscorecheck", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.10.0" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb b/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb deleted file mode 100644 index 98291b7..0000000 --- a/notebooks/illustration/15_check_1_dataset_known_folds_som_micro.ipynb +++ /dev/null @@ -1,218 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 18, - "metadata": {}, - "outputs": [], - "source": [ - "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro\n", - "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" - ] - }, - { - "cell_type": "code", - "execution_count": 19, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[array([[17, 16, 18],\n", - " [21, 17, 18],\n", - " [35, 30, 35]])]\n" - ] - }, - { - "data": { - "text/plain": [ - "({0: 51, 1: 56, 2: 100},\n", - " {'n_folds': 1},\n", - " {'acc': 0.5556,\n", - " 'sens': 0.3333,\n", - " 'spec': 0.6667,\n", - " 'f1p': 0.3333,\n", - " 'beta_positive': 2,\n", - " 'beta_negative': 2})" - ] - }, - "execution_count": 19, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", - " average='micro',\n", - " aggregation='som',\n", - " rounding_decimals=4,\n", - " subset=['acc', 'sens', 'spec', 'f1p'])\n", - "dataset, folding, scores" - ] - }, - { - "cell_type": "code", - "execution_count": 20, - "metadata": {}, - "outputs": [], - "source": [ - "dataset = {0: 86, 1: 96, 2: 59, 3: 105}\n", - "folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]}\n", - "scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}" - ] - }, - { - "cell_type": "code", - "execution_count": 21, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-11-02 07:17:19,911:INFO:testing acc, feasible tptn pairs: 347\n", - "2023-11-02 07:17:19,922:INFO:testing sens, feasible tptn pairs: 347\n", - "2023-11-02 07:17:19,923:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-02 07:17:19,924:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-11-02 07:17:19,925:INFO:constructing final tp, tn pair set\n", - "2023-11-02 07:17:19,925:INFO:final number of intervals: 1\n", - "2023-11-02 07:17:19,926:INFO:final number of pairs: 1\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" - ] - }, - { - "data": { - "text/plain": [ - "False" - ] - }, - "execution_count": 21, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-4)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": 22, - "metadata": {}, - "outputs": [], - "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, - { - "cell_type": "code", - "execution_count": 23, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "0.8756999999999999" - ] - }, - "execution_count": 23, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores['acc']" - ] - }, - { - "cell_type": "code", - "execution_count": 24, - "metadata": {}, - "outputs": [], - "source": [ - "scores['acc'] = 0.8756" - ] - }, - { - "cell_type": "code", - "execution_count": 25, - "metadata": {}, - "outputs": [ - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-11-02 07:17:19,977:INFO:testing acc, feasible tptn pairs: 347\n", - "2023-11-02 07:17:19,988:INFO:no more feasible tp,tn pairs left\n", - "2023-11-02 07:17:19,989:INFO:constructing final tp, tn pair set\n", - "2023-11-02 07:17:19,991:INFO:final number of intervals: 0\n", - "2023-11-02 07:17:19,992:INFO:final number of pairs: 0\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" - ] - }, - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 25, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-4)\n", - "result['inconsistency']" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - } - ], - "metadata": { - "kernelspec": { - "display_name": "mlscorecheck", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.10.0" - } - }, - "nbformat": 4, - "nbformat_minor": 2 -} diff --git a/notebooks/illustration/40_capsule.ipynb b/notebooks/illustration/40_capsule.ipynb index 16e44ef..18d5692 100644 --- a/notebooks/illustration/40_capsule.ipynb +++ b/notebooks/illustration/40_capsule.ipynb @@ -517,7 +517,7 @@ } ], "source": [ - "from mlscorecheck.check import check_1_dataset_som_scores\n", + "from mlscorecheck.check import check_1_dataset_kfold_som_scores\n", "\n", "dataset = {'dataset_name': 'common_datasets.monk-2'}\n", "folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}\n", @@ -525,7 +525,7 @@ "scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667,\n", " 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", "\n", - "result = check_1_dataset_som_scores(dataset=dataset,\n", + "result = check_1_dataset_kfold_som_scores(dataset=dataset,\n", " folding=folding,\n", " scores=scores,\n", " eps=1e-3)\n", @@ -566,7 +566,7 @@ "scores = {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667,\n", " 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", "\n", - "result = check_1_dataset_som_scores(dataset=dataset,\n", + "result = check_1_dataset_kfold_som_scores(dataset=dataset,\n", " folding=folding,\n", " scores=scores,\n", " eps=1e-3)\n", diff --git a/notebooks/illustration/binary/00_check_1_testset_no_kfold.ipynb b/notebooks/illustration/binary/00_check_1_testset_no_kfold.ipynb new file mode 100644 index 0000000..7de27f8 --- /dev/null +++ b/notebooks/illustration/binary/00_check_1_testset_no_kfold.ipynb @@ -0,0 +1,358 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.binary import check_1_testset_no_kfold\n", + "from mlscorecheck.individual import generate_problem_and_scores" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:29:16,066:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 06:29:16,068:INFO:calling the score check with scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", + "2023-11-03 06:29:16,069:INFO:checking the scores {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "2023-11-03 06:29:16,070:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 06:29:16,072:INFO:intervals before: (0, 530), (0, 902)\n", + "2023-11-03 06:29:16,072:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-11-03 06:29:16,073:INFO:the tn solutions: (751.6160759999999, 790.8639240000001)\n", + "2023-11-03 06:29:16,075:INFO:intervals after: [(112, 121)], [(752, 790)]\n", + "2023-11-03 06:29:16,076:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 06:29:16,077:INFO:intervals before: [(112, 121)], [(752, 790)]\n", + "2023-11-03 06:29:16,078:INFO:the tp solutions: (88.77533199999993, 135.4646680000002)\n", + "2023-11-03 06:29:16,079:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-11-03 06:29:16,080:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,081:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:29:16,083:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,084:INFO:the tp solutions: (108.20512460931658, 125.45746857652338)\n", + "2023-11-03 06:29:16,084:INFO:the tn solutions: (720.729741489652, 822.9954069390577)\n", + "2023-11-03 06:29:16,085:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,090:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-11-03 06:29:16,092:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,094:INFO:the tp solutions: (-16.316815204318672, 3.5854769758786067) | (101.7831884021151, 128.25349360431866)\n", + "2023-11-03 06:29:16,095:INFO:the tn solutions: (745.2636423956811, 800.379675597885) | (866.6502819978749, 921.7663152000788)\n", + "2023-11-03 06:29:16,096:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,097:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 06:29:16,098:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,099:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-11-03 06:29:16,100:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-11-03 06:29:16,101:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,102:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 06:29:16,103:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,104:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-11-03 06:29:16,105:INFO:the tn solutions: (657.2586176931766, 893.5046324530509)\n", + "2023-11-03 06:29:16,106:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,107:INFO:evaluating the tp and tn solution for sens and fm\n", + "2023-11-03 06:29:16,114:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,115:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-11-03 06:29:16,116:INFO:the tn solutions: (636.7166535970434, 917.0942703288408)\n", + "2023-11-03 06:29:16,117:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,118:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 06:29:16,119:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,120:INFO:the tp solutions: (109.76804841374923, 122.0385407814731)\n", + "2023-11-03 06:29:16,121:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-11-03 06:29:16,123:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,123:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-11-03 06:29:16,125:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,127:INFO:the tp solutions: (-65.8536328094769, -54.25856650052427) | (106.83422730052428, 121.82197200947691)\n", + "2023-11-03 06:29:16,128:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-11-03 06:29:16,129:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,130:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-11-03 06:29:16,133:INFO:intervals before: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,134:INFO:the tp solutions: (80.82924045095699, 294.0107283921828)\n", + "2023-11-03 06:29:16,135:INFO:the tn solutions: (-420.04420024360695, 1292.9374484676016)\n", + "2023-11-03 06:29:16,136:INFO:intervals after: [(112, 121)], [(767, 784)]\n", + "2023-11-03 06:29:16,137:INFO:testing acc, feasible tptn pairs: 10\n", + "2023-11-03 06:29:16,139:INFO:testing sens, feasible tptn pairs: 10\n", + "2023-11-03 06:29:16,140:INFO:testing spec, feasible tptn pairs: 10\n", + "2023-11-03 06:29:16,148:INFO:testing f1p, feasible tptn pairs: 10\n", + "2023-11-03 06:29:16,150:INFO:testing fm, feasible tptn pairs: 10\n", + "2023-11-03 06:29:16,152:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:29:16,154:INFO:final number of intervals: 10\n", + "2023-11-03 06:29:16,155:INFO:final number of pairs: 130\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 2, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "testset = {'p': 530, 'n': 902}\n", + "scores = {'acc': 0.62, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "\n", + "result = check_1_testset_no_kfold(testset=testset,\n", + " scores=scores,\n", + " eps=1e-2)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:29:16,176:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 06:29:16,179:INFO:calling the score check with scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}, uncertainty 0.01, p 530 and n 902\n", + "2023-11-03 06:29:16,180:INFO:checking the scores {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "2023-11-03 06:29:16,182:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 06:29:16,183:INFO:intervals before: (0, 530), (0, 902)\n", + "2023-11-03 06:29:16,184:INFO:the tp solutions: (111.29894, 121.90106)\n", + "2023-11-03 06:29:16,185:INFO:the tn solutions: (1181.216076, 1220.4639240000004)\n", + "2023-11-03 06:29:16,187:INFO:intervals after: [(112, 121)], []\n", + "2023-11-03 06:29:16,188:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 06:29:16,190:INFO:intervals before: [(112, 121)], []\n", + "2023-11-03 06:29:16,191:INFO:the tp solutions: (518.3753319999998, 565.0646680000003)\n", + "2023-11-03 06:29:16,192:INFO:the tn solutions: (766.6981959999999, 784.741804)\n", + "2023-11-03 06:29:16,194:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,196:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:29:16,198:INFO:intervals before: [], []\n", + "2023-11-03 06:29:16,200:INFO:the tp solutions: (20.470765551173063, 28.952218416378013)\n", + "2023-11-03 06:29:16,201:INFO:the tn solutions: (1232.0122032291965, 1355.3280073234066)\n", + "2023-11-03 06:29:16,202:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,203:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-11-03 06:29:16,205:INFO:all negative bases - iteration finished\n", + "2023-11-03 06:29:16,206:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 06:29:16,207:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:29:16,208:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:29:16,209:INFO:final number of intervals: 0\n", + "2023-11-03 06:29:16,210:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 3, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "testset = {'p': 530, 'n': 902}\n", + "scores = {'acc': 0.92, 'sens': 0.22, 'spec': 0.86, 'f1p': 0.3, 'fm': 0.32}\n", + "\n", + "result = check_1_testset_no_kfold(testset=testset,\n", + " scores=scores,\n", + " eps=1e-2)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:29:16,234:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 06:29:16,236:INFO:calling the score check with scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}, uncertainty 0.001, p 1029 and n 3118\n", + "2023-11-03 06:29:16,238:INFO:checking the scores {'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901}\n", + "2023-11-03 06:29:16,240:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 06:29:16,242:INFO:intervals before: (0, 1029), (0, 3118)\n", + "2023-11-03 06:29:16,243:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-11-03 06:29:16,244:INFO:the tn solutions: (2989.965647999999, 3000.3383520000007)\n", + "2023-11-03 06:29:16,246:INFO:intervals after: [(961, 962)], [(2990, 3000)]\n", + "2023-11-03 06:29:16,248:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 06:29:16,249:INFO:intervals before: [(961, 962)], [(2990, 3000)]\n", + "2023-11-03 06:29:16,250:INFO:the tp solutions: (877.7284699999991, 892.2875300000005)\n", + "2023-11-03 06:29:16,252:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-11-03 06:29:16,254:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,255:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 06:29:16,257:INFO:intervals before: [], []\n", + "2023-11-03 06:29:16,258:INFO:the tp solutions: (933.6679509487356, 949.8052939947056)\n", + "2023-11-03 06:29:16,259:INFO:the tn solutions: (2988.3769250334417, 3040.8179565580203)\n", + "2023-11-03 06:29:16,262:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,264:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 06:29:16,265:INFO:intervals before: [], []\n", + "2023-11-03 06:29:16,266:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-11-03 06:29:16,268:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-11-03 06:29:16,270:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,271:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 06:29:16,273:INFO:intervals before: [], []\n", + "2023-11-03 06:29:16,274:INFO:the tp solutions: (960.054942, 962.1170580000002)\n", + "2023-11-03 06:29:16,275:INFO:the tn solutions: (3002.3483691722586, 3022.4720549935846)\n", + "2023-11-03 06:29:16,276:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,277:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 06:29:16,279:INFO:intervals before: [], []\n", + "2023-11-03 06:29:16,280:INFO:the tp solutions: (392.8031470217782, 459.241011658118)\n", + "2023-11-03 06:29:16,281:INFO:the tn solutions: (3068.105764, 3074.354236)\n", + "2023-11-03 06:29:16,283:INFO:intervals after: [], []\n", + "2023-11-03 06:29:16,284:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 06:29:16,285:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:29:16,286:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:29:16,286:INFO:final number of intervals: 0\n", + "2023-11-03 06:29:16,287:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_testset_no_kfold(\n", + " scores={'acc': 0.954, 'sens': 0.934, 'spec': 0.985, 'ppv': 0.901},\n", + " eps=1e-3,\n", + " testset={'name': 'common_datasets.ADA'}\n", + " )\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "({'p': 80, 'n': 257},\n", + " {'acc': 0.65, 'sens': 0.54, 'spec': 0.68, 'f1p': 0.42, 'fm': 0.43})" + ] + }, + "execution_count": 5, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "problem, scores = generate_problem_and_scores(rounding_decimals=2,\n", + " score_subset=['acc', 'sens', 'spec',\n", + " 'f1p', 'fm'])\n", + "problem, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:29:16,337:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 06:29:16,339:INFO:calling the score check with scores {'acc': 0.65, 'sens': 0.54, 'spec': 0.68, 'f1p': 0.42, 'fm': 0.43}, uncertainty 0.01, p 80 and n 257\n", + "2023-11-03 06:29:16,340:INFO:checking the scores {'acc': 0.65, 'sens': 0.54, 'spec': 0.68, 'f1p': 0.42, 'fm': 0.43}\n", + "2023-11-03 06:29:16,341:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 06:29:16,343:INFO:intervals before: (0, 80), (0, 257)\n", + "2023-11-03 06:29:16,344:INFO:the tp solutions: (42.39984, 44.00016000000001)\n", + "2023-11-03 06:29:16,350:INFO:the tn solutions: (171.67916599999995, 180.02083400000004)\n", + "2023-11-03 06:29:16,351:INFO:intervals after: [(43, 44)], [(172, 180)]\n", + "2023-11-03 06:29:16,353:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 06:29:16,355:INFO:intervals before: [(43, 44)], [(172, 180)]\n", + "2023-11-03 06:29:16,357:INFO:the tp solutions: (38.34881199999995, 50.23118800000003)\n", + "2023-11-03 06:29:16,358:INFO:the tn solutions: (172.189486, 177.33051400000002)\n", + "2023-11-03 06:29:16,362:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,364:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:29:16,366:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,367:INFO:the tp solutions: (39.81113157357772, 45.76168027023603)\n", + "2023-11-03 06:29:16,369:INFO:the tn solutions: (161.69999706666417, 191.4427153241345)\n", + "2023-11-03 06:29:16,370:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,372:INFO:evaluating the tp and tn solution for acc and fm\n", + "2023-11-03 06:29:16,375:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,377:INFO:the tp solutions: (-14.87848661500831, -11.429044835794995) | (40.324907235794996, 45.15062421500831)\n", + "2023-11-03 06:29:16,379:INFO:the tn solutions: (170.52870178499165, 182.095766764205) | (226.404226835155, 237.97129181436833)\n", + "2023-11-03 06:29:16,380:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,381:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 06:29:16,383:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,384:INFO:the tp solutions: (42.39984, 44.00016000000001)\n", + "2023-11-03 06:29:16,385:INFO:the tn solutions: (172.189486, 177.33051400000002)\n", + "2023-11-03 06:29:16,393:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,395:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 06:29:16,397:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,400:INFO:the tp solutions: (42.39984, 44.00016000000001)\n", + "2023-11-03 06:29:16,401:INFO:the tn solutions: (157.09893349407676, 192.75984468294968)\n", + "2023-11-03 06:29:16,402:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,405:INFO:evaluating the tp and tn solution for sens and fm\n", + "2023-11-03 06:29:16,407:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,408:INFO:the tp solutions: (42.39984, 44.00016000000001)\n", + "2023-11-03 06:29:16,411:INFO:the tn solutions: (147.7954166561049, 202.96298930938647)\n", + "2023-11-03 06:29:16,412:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,414:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 06:29:16,415:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,417:INFO:the tp solutions: (41.17238212343633, 45.13945281524434)\n", + "2023-11-03 06:29:16,418:INFO:the tn solutions: (172.189486, 177.33051400000002)\n", + "2023-11-03 06:29:16,419:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,420:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-11-03 06:29:16,421:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,422:INFO:the tp solutions: (-29.669137693676408, -26.872724954638574) | (41.32065615463858, 44.80520649367641)\n", + "2023-11-03 06:29:16,424:INFO:the tn solutions: (172.189486, 177.33051400000002)\n", + "2023-11-03 06:29:16,425:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,427:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-11-03 06:29:16,430:INFO:intervals before: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,432:INFO:the tp solutions: (20.339541998791276, 51.48691044561233)\n", + "2023-11-03 06:29:16,433:INFO:the tn solutions: (109.3333440897702, 309.2883177266594)\n", + "2023-11-03 06:29:16,435:INFO:intervals after: [(43, 44)], [(173, 177)]\n", + "2023-11-03 06:29:16,436:INFO:testing acc, feasible tptn pairs: 2\n", + "2023-11-03 06:29:16,437:INFO:testing sens, feasible tptn pairs: 2\n", + "2023-11-03 06:29:16,439:INFO:testing spec, feasible tptn pairs: 2\n", + "2023-11-03 06:29:16,440:INFO:testing f1p, feasible tptn pairs: 2\n", + "2023-11-03 06:29:16,441:INFO:testing fm, feasible tptn pairs: 2\n", + "2023-11-03 06:29:16,443:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:29:16,444:INFO:final number of intervals: 2\n", + "2023-11-03 06:29:16,445:INFO:final number of pairs: 9\n" + ] + } + ], + "source": [ + "result = check_1_testset_no_kfold(scores=scores,\n", + " eps=1e-2,\n", + " testset=problem)" + ] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + }, + "orig_nbformat": 4 + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/binary/01_check_1_dataset_kfold_som.ipynb b/notebooks/illustration/binary/01_check_1_dataset_kfold_som.ipynb new file mode 100644 index 0000000..8b50627 --- /dev/null +++ b/notebooks/illustration/binary/01_check_1_dataset_kfold_som.ipynb @@ -0,0 +1,370 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.binary import check_1_dataset_kfold_som\n", + "from mlscorecheck.aggregated import Dataset, Evaluation, generate_evaluation" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "({'dataset': {'p': 53, 'n': 17},\n", + " 'folding': {'n_folds': 9, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", + " 'fold_score_bounds': None,\n", + " 'aggregation': 'mos'},\n", + " {'acc': 0.416, 'sens': 0.38, 'spec': 0.5, 'bacc': 0.44})" + ] + }, + "execution_count": 2, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, scores = generate_evaluation(return_scores=True, rounding_decimals=3)\n", + "dataset, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:28:59,468:INFO:checking the scores {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", + "2023-11-03 06:28:59,470:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 06:28:59,471:INFO:intervals before: (0, 612), (0, 684)\n", + "2023-11-03 06:28:59,472:INFO:the tp solutions: (451.13017565420745, 458.4474606321096)\n", + "2023-11-03 06:28:59,473:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,475:INFO:intervals after: [(452, 458)], [(457, 457)]\n", + "2023-11-03 06:28:59,476:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 06:28:59,477:INFO:intervals before: [(452, 458)], [(457, 457)]\n", + "2023-11-03 06:28:59,478:INFO:the tp solutions: (451.4455006459121, 458.2951263885206)\n", + "2023-11-03 06:28:59,482:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,483:INFO:intervals after: [(452, 458)], [(457, 457)]\n", + "2023-11-03 06:28:59,484:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 06:28:59,486:INFO:intervals before: [(452, 458)], [(457, 457)]\n", + "2023-11-03 06:28:59,486:INFO:the tp solutions: (453.4883279999998, 457.16767200000004)\n", + "2023-11-03 06:28:59,487:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,488:INFO:intervals after: [(454, 457)], [(457, 457)]\n", + "2023-11-03 06:28:59,489:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 06:28:59,490:INFO:intervals before: [(454, 457)], [(457, 457)]\n", + "2023-11-03 06:28:59,491:INFO:the tp solutions: (453.43302310684874, 456.17518747616583)\n", + "2023-11-03 06:28:59,494:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,495:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,496:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-11-03 06:28:59,498:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,499:INFO:the tp solutions: (-152.34158237393794, -150.5769147898986) | (453.46219709389857, 456.090284069938)\n", + "2023-11-03 06:28:59,500:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,501:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,502:INFO:evaluating the tp and tn solution for npv and ppv\n", + "2023-11-03 06:28:59,503:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,504:INFO:the tp solutions: (449.7868395395296, 459.8031631145148)\n", + "2023-11-03 06:28:59,507:INFO:the tn solutions: (451.7913140724638, 462.1800665561134)\n", + "2023-11-03 06:28:59,508:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,509:INFO:evaluating the tp and tn solution for npv and bacc\n", + "2023-11-03 06:28:59,510:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,512:INFO:the tp solutions: (443.7154761128823, 465.2752188090839)\n", + "2023-11-03 06:28:59,514:INFO:the tn solutions: (452.9617561982833, 462.89386265812294)\n", + "2023-11-03 06:28:59,515:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,516:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 06:28:59,518:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,519:INFO:the tp solutions: (440.147036110388, 469.8382788367301)\n", + "2023-11-03 06:28:59,520:INFO:the tn solutions: (442.00190657831143, 472.519981444259)\n", + "2023-11-03 06:28:59,522:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,523:INFO:evaluating the tp and tn solution for npv and fm\n", + "2023-11-03 06:28:59,525:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,526:INFO:the tp solutions: (394.3507743984165, 792.5978000014203)\n", + "2023-11-03 06:28:59,527:INFO:the tn solutions: (-527.6344214333369, 642.5102448871437)\n", + "2023-11-03 06:28:59,528:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,532:INFO:evaluating the tp and tn solution for ppv and bacc\n", + "2023-11-03 06:28:59,533:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,534:INFO:the tp solutions: (450.4921584429077, 460.9834496704991)\n", + "2023-11-03 06:28:59,535:INFO:the tn solutions: (444.46160710915257, 468.645191592148)\n", + "2023-11-03 06:28:59,536:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,537:INFO:evaluating the tp and tn solution for ppv and f1p\n", + "2023-11-03 06:28:59,539:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,540:INFO:the tp solutions: (451.30158006461744, 458.2976005032661)\n", + "2023-11-03 06:28:59,543:INFO:the tn solutions: (449.24903166602184, 464.72652816818044)\n", + "2023-11-03 06:28:59,545:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,546:INFO:evaluating the tp and tn solution for ppv and fm\n", + "2023-11-03 06:28:59,547:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,549:INFO:the tp solutions: (452.77437351751627, 456.729638591179)\n", + "2023-11-03 06:28:59,550:INFO:the tn solutions: (449.644434645183, 464.3373716283757)\n", + "2023-11-03 06:28:59,551:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,552:INFO:evaluating the tp and tn solution for bacc and f1p\n", + "2023-11-03 06:28:59,554:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,555:INFO:the tp solutions: (449.6000702850551, 458.43196680714374)\n", + "2023-11-03 06:28:59,556:INFO:the tn solutions: (444.57627428771997, 472.337195306036)\n", + "2023-11-03 06:28:59,557:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,558:INFO:evaluating the tp and tn solution for bacc and fm\n", + "2023-11-03 06:28:59,560:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,562:INFO:the tp solutions: (184.881771974585, 191.6700592910953) | (450.2788987340362, 457.82373989853176)\n", + "2023-11-03 06:28:59,563:INFO:the tn solutions: (452.7519076428173, 463.9258491796066) | (749.8034974913054, 760.9774390280948)\n", + "2023-11-03 06:28:59,564:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,565:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-11-03 06:28:59,566:INFO:intervals before: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,567:INFO:the tp solutions: (389.8902833715994, 473.26546244312186)\n", + "2023-11-03 06:28:59,568:INFO:the tn solutions: (376.3573072940828, 624.3053618675568)\n", + "2023-11-03 06:28:59,570:INFO:intervals after: [(454, 456)], [(457, 457)]\n", + "2023-11-03 06:28:59,571:INFO:testing spec, feasible tptn pairs: 3\n", + "2023-11-03 06:28:59,572:INFO:testing bacc, feasible tptn pairs: 3\n", + "2023-11-03 06:28:59,574:INFO:testing npv, feasible tptn pairs: 2\n", + "2023-11-03 06:28:59,575:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-03 06:28:59,576:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 06:28:59,576:INFO:testing fm, feasible tptn pairs: 1\n", + "2023-11-03 06:28:59,583:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:28:59,583:INFO:final number of intervals: 1\n", + "2023-11-03 06:28:59,584:INFO:final number of pairs: 1\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 3, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset = {'dataset_name': 'common_datasets.monk-2'}\n", + "folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}\n", + "scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", + "result = check_1_dataset_kfold_som(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:28:59,604:INFO:checking the scores {'spec': 0.668, 'npv': 0.544, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", + "2023-11-03 06:28:59,606:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 06:28:59,607:INFO:intervals before: (0, 612), (0, 684)\n", + "2023-11-03 06:28:59,609:INFO:the tp solutions: (224.67359151477578, 233.34537651102963)\n", + "2023-11-03 06:28:59,610:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,611:INFO:intervals after: [(225, 233)], [(457, 457)]\n", + "2023-11-03 06:28:59,613:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 06:28:59,614:INFO:intervals before: [(225, 233)], [(457, 457)]\n", + "2023-11-03 06:28:59,616:INFO:the tp solutions: (451.4455006459121, 458.2951263885206)\n", + "2023-11-03 06:28:59,617:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,618:INFO:intervals after: [], [(457, 457)]\n", + "2023-11-03 06:28:59,619:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 06:28:59,621:INFO:intervals before: [], [(457, 457)]\n", + "2023-11-03 06:28:59,621:INFO:the tp solutions: (453.4883279999998, 457.16767200000004)\n", + "2023-11-03 06:28:59,628:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,630:INFO:intervals after: [], [(457, 457)]\n", + "2023-11-03 06:28:59,631:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 06:28:59,633:INFO:intervals before: [], [(457, 457)]\n", + "2023-11-03 06:28:59,634:INFO:the tp solutions: (453.43302310684874, 456.17518747616583)\n", + "2023-11-03 06:28:59,635:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,636:INFO:intervals after: [], [(457, 457)]\n", + "2023-11-03 06:28:59,637:INFO:evaluating the tp and tn solution for spec and fm\n", + "2023-11-03 06:28:59,639:INFO:intervals before: [], [(457, 457)]\n", + "2023-11-03 06:28:59,640:INFO:the tp solutions: (-152.34158237393794, -150.5769147898986) | (453.46219709389857, 456.090284069938)\n", + "2023-11-03 06:28:59,643:INFO:the tn solutions: (456.226632, 457.5973680000001)\n", + "2023-11-03 06:28:59,645:INFO:intervals after: [], [(457, 457)]\n", + "2023-11-03 06:28:59,646:INFO:evaluating the tp and tn solution for npv and ppv\n", + "2023-11-03 06:28:59,647:INFO:intervals before: [], [(457, 457)]\n", + "2023-11-03 06:28:59,651:INFO:the tp solutions: (61.67528439458414, 71.34842820524828)\n", + "2023-11-03 06:28:59,652:INFO:the tn solutions: (640.1989553115615, 661.6570656911333)\n", + "2023-11-03 06:28:59,653:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,654:INFO:evaluating the tp and tn solution for npv and bacc\n", + "2023-11-03 06:28:59,656:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,657:INFO:the tp solutions: (-3449.3578113967096, -2845.2966863250767)\n", + "2023-11-03 06:28:59,658:INFO:the tn solutions: (4174.848806456365, 4788.330979831333)\n", + "2023-11-03 06:28:59,660:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,660:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 06:28:59,662:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,663:INFO:the tp solutions: (848.1226422631049, 888.4347620980816)\n", + "2023-11-03 06:28:59,664:INFO:the tn solutions: (-315.46432513389715, -295.5981674463546)\n", + "2023-11-03 06:28:59,665:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,666:INFO:evaluating the tp and tn solution for npv and fm\n", + "2023-11-03 06:28:59,668:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,670:INFO:the tp solutions: (12.846926170011079, 30.911087774236353) | (632.0777110753301, 654.6422058656685)\n", + "2023-11-03 06:28:59,671:INFO:the tn solutions: (-51.077339859078506, -23.855818920884683) | (686.3871737976272, 721.9244118372484)\n", + "2023-11-03 06:28:59,672:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,674:INFO:evaluating the tp and tn solution for ppv and bacc\n", + "2023-11-03 06:28:59,676:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,678:INFO:the tp solutions: (450.4921584429077, 460.9834496704991)\n", + "2023-11-03 06:28:59,680:INFO:the tn solutions: (444.46160710915257, 468.645191592148)\n", + "2023-11-03 06:28:59,681:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,682:INFO:evaluating the tp and tn solution for ppv and f1p\n", + "2023-11-03 06:28:59,683:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,683:INFO:the tp solutions: (451.30158006461744, 458.2976005032661)\n", + "2023-11-03 06:28:59,684:INFO:the tn solutions: (449.24903166602184, 464.72652816818044)\n", + "2023-11-03 06:28:59,685:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,686:INFO:evaluating the tp and tn solution for ppv and fm\n", + "2023-11-03 06:28:59,688:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,689:INFO:the tp solutions: (452.77437351751627, 456.729638591179)\n", + "2023-11-03 06:28:59,690:INFO:the tn solutions: (449.644434645183, 464.3373716283757)\n", + "2023-11-03 06:28:59,690:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,691:INFO:evaluating the tp and tn solution for bacc and f1p\n", + "2023-11-03 06:28:59,693:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,694:INFO:the tp solutions: (449.6000702850551, 458.43196680714374)\n", + "2023-11-03 06:28:59,695:INFO:the tn solutions: (444.57627428771997, 472.337195306036)\n", + "2023-11-03 06:28:59,696:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,697:INFO:evaluating the tp and tn solution for bacc and fm\n", + "2023-11-03 06:28:59,699:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,700:INFO:the tp solutions: (184.881771974585, 191.6700592910953) | (450.2788987340362, 457.82373989853176)\n", + "2023-11-03 06:28:59,701:INFO:the tn solutions: (452.7519076428173, 463.9258491796066) | (749.8034974913054, 760.9774390280948)\n", + "2023-11-03 06:28:59,702:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,704:INFO:evaluating the tp and tn solution for f1p and fm\n", + "2023-11-03 06:28:59,706:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,707:INFO:the tp solutions: (389.8902833715994, 473.26546244312186)\n", + "2023-11-03 06:28:59,708:INFO:the tn solutions: (376.3573072940828, 624.3053618675568)\n", + "2023-11-03 06:28:59,709:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,710:INFO:testing spec, feasible tptn pairs: 0\n", + "2023-11-03 06:28:59,712:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:28:59,714:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:28:59,715:INFO:final number of intervals: 0\n", + "2023-11-03 06:28:59,716:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset = {'dataset_name': 'common_datasets.monk-2'}\n", + "folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}\n", + "scores = {'spec': 0.668, 'npv': 0.544, 'ppv': 0.667, 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704}\n", + "result = check_1_dataset_kfold_som(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 06:28:59,754:INFO:checking the scores {'acc': 0.428, 'npv': 0.392, 'bacc': 0.442, 'f1p': 0.391}\n", + "2023-11-03 06:28:59,757:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 06:28:59,759:INFO:intervals before: (0, 10), (0, 20)\n", + "2023-11-03 06:28:59,760:INFO:the tp solutions: (17.53160804333868, 18.464920278322932)\n", + "2023-11-03 06:28:59,763:INFO:the tn solutions: (-5.270843006972088, -5.039728262417209)\n", + "2023-11-03 06:28:59,765:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,766:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 06:28:59,767:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,769:INFO:the tp solutions: (4.769860000000006, 4.910139999999998)\n", + "2023-11-03 06:28:59,770:INFO:the tn solutions: (7.899800000000002, 8.100199999999994)\n", + "2023-11-03 06:28:59,770:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,771:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:28:59,773:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,774:INFO:the tp solutions: (5.47591839052987, 5.541579002003296)\n", + "2023-11-03 06:28:59,774:INFO:the tn solutions: (7.2251654419821625, 7.437795041990264)\n", + "2023-11-03 06:28:59,775:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,776:INFO:evaluating the tp and tn solution for npv and bacc\n", + "2023-11-03 06:28:59,777:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,778:INFO:the tp solutions: (8.156982077324718, 8.420191328852582)\n", + "2023-11-03 06:28:59,781:INFO:the tn solutions: (1.0779174034529388, 1.1297477937232172)\n", + "2023-11-03 06:28:59,782:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,783:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 06:28:59,785:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,785:INFO:the tp solutions: (6.725966043917559, 6.848200935967899)\n", + "2023-11-03 06:28:59,786:INFO:the tn solutions: (2.0399370054806383, 2.1037139445786694)\n", + "2023-11-03 06:28:59,787:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,788:INFO:evaluating the tp and tn solution for bacc and f1p\n", + "2023-11-03 06:28:59,789:INFO:intervals before: [], []\n", + "2023-11-03 06:28:59,790:INFO:the tp solutions: (5.770011590470432, 5.8801108747879205)\n", + "2023-11-03 06:28:59,790:INFO:the tn solutions: (5.799251089558401, 6.263087449471712)\n", + "2023-11-03 06:28:59,791:INFO:intervals after: [], []\n", + "2023-11-03 06:28:59,792:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 06:28:59,795:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:28:59,796:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:28:59,798:INFO:final number of intervals: 0\n", + "2023-11-03 06:28:59,799:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 5, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset = {'p': 10, 'n': 20}\n", + "folding = {'n_folds': 5, 'n_repeats': 1}\n", + "scores = {'acc': 0.428, 'npv': 0.392, 'bacc': 0.442, 'f1p': 0.391}\n", + "\n", + "result = check_1_dataset_kfold_som(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + }, + "orig_nbformat": 4 + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/02_check_1_dataset_known_folds_mos.ipynb b/notebooks/illustration/binary/02_check_1_dataset_known_folds_mos.ipynb similarity index 69% rename from notebooks/illustration/02_check_1_dataset_known_folds_mos.ipynb rename to notebooks/illustration/binary/02_check_1_dataset_known_folds_mos.ipynb index 228a538..0089920 100644 --- a/notebooks/illustration/02_check_1_dataset_known_folds_mos.ipynb +++ b/notebooks/illustration/binary/02_check_1_dataset_known_folds_mos.ipynb @@ -2,16 +2,16 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_1_dataset_known_folds_mos_scores" + "from mlscorecheck.check.binary import check_1_dataset_known_folds_mos" ] }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -22,7 +22,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73370e5df8d04dc1ac3e0726173e9d46-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73370e5df8d04dc1ac3e0726173e9d46-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92066f26c3b745b4a934509f1143b9db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92066f26c3b745b4a934509f1143b9db-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -36,37 +36,38 @@ "Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0003I 0 fixed, 2 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0004I processed model has 3 rows, 4 columns (4 integer (0 of which binary)) and 10 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 24 iterations and 0 nodes (0.00 seconds)\n", - "Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 12 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 4 column cuts (4 active) in 0.000 seconds - new frequency is 1\n", - "Cbc0014I Cut generator 1 (Gomory) - 25 row cuts average 3.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 97 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0031I 3 added rows had average density of 3.3333333\n", + "Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 178 row cuts average 3.9 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 10 row cuts average 2.6 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 0, took 24 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 5 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 97 iterations and 0 nodes (0.01 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 12 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Gomory was tried 12 times and created 25 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Knapsack was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 12 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 100 times and created 178 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 100 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", "\n", "Objective value: 0.00000000\n", "Enumerated nodes: 0\n", - "Total iterations: 24\n", - "Time (CPU seconds): 0.00\n", - "Time (Wallclock seconds): 0.00\n", + "Total iterations: 97\n", + "Time (CPU seconds): 0.01\n", + "Time (Wallclock seconds): 0.01\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n" ] }, @@ -76,7 +77,7 @@ "False" ] }, - "execution_count": 2, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -85,16 +86,16 @@ "dataset = {'p': 126, 'n': 131}\n", "folding = {'folds': [{'p': 52, 'n': 94}, {'p': 74, 'n': 37}]}\n", "scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662}\n", - "result = check_1_dataset_known_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_1_dataset_known_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 7, "metadata": {}, "outputs": [ { @@ -103,7 +104,7 @@ "'feasible'" ] }, - "execution_count": 3, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } @@ -114,7 +115,7 @@ }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 8, "metadata": {}, "outputs": [ { @@ -122,7 +123,7 @@ "text/plain": [ "{'evaluations': [{'folds': {'folds': [{'fold': {'p': 52,\n", " 'n': 94,\n", - " 'identifier': 'txehx',\n", + " 'identifier': 'ercuu',\n", " 'tp': 49.0,\n", " 'tn': 13.0},\n", " 'scores': {'acc': 0.4246575342465753,\n", @@ -132,7 +133,7 @@ " 'bounds_flag': True},\n", " {'fold': {'p': 74,\n", " 'n': 37,\n", - " 'identifier': 'damfo',\n", + " 'identifier': 'lptyi',\n", " 'tp': 44.0,\n", " 'tn': 36.0},\n", " 'scores': {'acc': 0.7207207207207207,\n", @@ -147,7 +148,7 @@ " 'score_bounds': None,\n", " 'bounds_flag': {'folds': [{'fold': {'p': 52,\n", " 'n': 94,\n", - " 'identifier': 'txehx',\n", + " 'identifier': 'ercuu',\n", " 'tp': 49.0,\n", " 'tn': 13.0},\n", " 'scores': {'acc': 0.4246575342465753,\n", @@ -157,7 +158,7 @@ " 'bounds_flag': True},\n", " {'fold': {'p': 74,\n", " 'n': 37,\n", - " 'identifier': 'damfo',\n", + " 'identifier': 'lptyi',\n", " 'tp': 44.0,\n", " 'tn': 36.0},\n", " 'scores': {'acc': 0.7207207207207207,\n", @@ -169,7 +170,7 @@ " 'bounds_flag': True}" ] }, - "execution_count": 4, + "execution_count": 8, "metadata": {}, "output_type": "execute_result" } @@ -180,7 +181,7 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 9, "metadata": {}, "outputs": [ { @@ -191,7 +192,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a20a9c211004a378101d618439cc6ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a20a9c211004a378101d618439cc6ba-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c25d6bb5ba95490a9a104c1e1d65d94b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c25d6bb5ba95490a9a104c1e1d65d94b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -212,7 +213,7 @@ "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 6 (TwoMirCuts) - 12 row cuts average 2.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", + "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.00 seconds)\n", "Cbc0001I Search completed - best objective 1e+50, took 77 iterations and 4 nodes (0.01 seconds)\n", "Cbc0032I Strong branching done 16 times (23 iterations), fathomed 3 nodes and fixed 1 variables\n", "Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost\n", @@ -245,7 +246,7 @@ "True" ] }, - "execution_count": 5, + "execution_count": 9, "metadata": {}, "output_type": "execute_result" } @@ -254,16 +255,16 @@ "dataset = {'p': 126, 'n': 131}\n", "folding = {'folds': [{'p': 52, 'n': 94}, {'p': 74, 'n': 37}]}\n", "scores = {'acc': 0.573, 'sens': 0.568, 'bacc': 0.662}\n", - "result = check_1_dataset_known_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_1_dataset_known_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 10, "metadata": {}, "outputs": [ { @@ -274,7 +275,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58ea6fb792f44257869adcc5799a5328-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58ea6fb792f44257869adcc5799a5328-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dba90c9fd5214080af63a2f2f1e00508-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dba90c9fd5214080af63a2f2f1e00508-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -296,7 +297,7 @@ "True" ] }, - "execution_count": 6, + "execution_count": 10, "metadata": {}, "output_type": "execute_result" } @@ -305,38 +306,38 @@ "dataset = {'p': 398, 'n': 569}\n", "folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'}\n", "scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6}\n", - "result = check_1_dataset_known_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-2)\n", + "result = check_1_dataset_known_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-2)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 11, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:18,485:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_0: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,488:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_0: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,489:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_1: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,490:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_1: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,491:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_2: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,492:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_2: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,492:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_3: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,494:INFO:common_datasets.glass_0_1_6_vs_2_ooa_0_3: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,495:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_0: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,496:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_0: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,497:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_1: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,498:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_1: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,499:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_2: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,500:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_2: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:18,501:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_3: adding lower bound 0.8 for acc\n", - "2023-10-26 23:38:18,502:INFO:common_datasets.glass_0_1_6_vs_2_ooa_1_3: adding upper bound 1.0 for acc\n" + "2023-11-03 06:48:55,774:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_0: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,776:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_0: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,778:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_1: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,779:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_1: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,780:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_2: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,781:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_2: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,781:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_3: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,782:INFO:common_datasets.glass_0_1_6_vs_2_adb_0_3: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,783:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_0: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,783:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_0: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,784:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_1: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,785:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_1: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,786:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_2: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,786:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_2: adding upper bound 1.0 for acc\n", + "2023-11-03 06:48:55,787:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_3: adding lower bound 0.8 for acc\n", + "2023-11-03 06:48:55,789:INFO:common_datasets.glass_0_1_6_vs_2_adb_1_3: adding upper bound 1.0 for acc\n" ] }, { @@ -347,7 +348,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5e80281b70c49c8ab5a42ca5afea3ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5e80281b70c49c8ab5a42ca5afea3ae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ed2fbdc772b4fa3984a4234b8f9d296-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ed2fbdc772b4fa3984a4234b8f9d296-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 29 COLUMNS\n", @@ -369,7 +370,7 @@ "True" ] }, - "execution_count": 7, + "execution_count": 11, "metadata": {}, "output_type": "execute_result" } @@ -380,12 +381,12 @@ "\n", "scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6, 'bacc': 0.1, 'f1': 0.95}\n", "\n", - "result = check_1_dataset_known_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " fold_score_bounds={'acc': (0.8, 1.0)},\n", - " scores=scores,\n", - " eps=1e-2,\n", - " numerical_tolerance=1e-6)\n", + "result = check_1_dataset_known_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " fold_score_bounds={'acc': (0.8, 1.0)},\n", + " scores=scores,\n", + " eps=1e-2,\n", + " numerical_tolerance=1e-6)\n", "result['inconsistency']" ] } diff --git a/notebooks/illustration/03_check_1_dataset_unknown_folds_mos.ipynb b/notebooks/illustration/binary/03_check_1_dataset_unknown_folds_mos.ipynb similarity index 84% rename from notebooks/illustration/03_check_1_dataset_unknown_folds_mos.ipynb rename to notebooks/illustration/binary/03_check_1_dataset_unknown_folds_mos.ipynb index 010b0e9..53f0768 100644 --- a/notebooks/illustration/03_check_1_dataset_unknown_folds_mos.ipynb +++ b/notebooks/illustration/binary/03_check_1_dataset_unknown_folds_mos.ipynb @@ -2,16 +2,16 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_1_dataset_unknown_folds_mos_scores" + "from mlscorecheck.check.binary import check_1_dataset_unknown_folds_mos" ] }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -22,7 +22,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee40e7bf89814022b0d4bc1c9e4e720e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee40e7bf89814022b0d4bc1c9e4e720e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e5ead28b04f4c6bb0f1a79ce53e5336-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e5ead28b04f4c6bb0f1a79ce53e5336-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -43,7 +43,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/43879cfc884849c49e8e463882ff2de7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43879cfc884849c49e8e463882ff2de7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90f5b9b6e3554c9bbeca886ed8732065-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90f5b9b6e3554c9bbeca886ed8732065-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -63,7 +63,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7473d840fff7483993c55d736d7dcc11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7473d840fff7483993c55d736d7dcc11-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/08764cefdf5942c9bfc7d9e467caba89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08764cefdf5942c9bfc7d9e467caba89-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -113,7 +113,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1749e11eadac45a89ddfd38c030d9c3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1749e11eadac45a89ddfd38c030d9c3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e382ec918f44865b3411a53df667931-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e382ec918f44865b3411a53df667931-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -134,7 +134,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6bc67e384bd842cfb5ffd6370d65431d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bc67e384bd842cfb5ffd6370d65431d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/da79df8b43a7423791598d70e0540f6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da79df8b43a7423791598d70e0540f6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -178,7 +178,7 @@ "False" ] }, - "execution_count": 2, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -187,13 +187,313 @@ "dataset = {'p': 126, 'n': 131}\n", "folding = {'n_folds': 2, 'n_repeats': 1}\n", "scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.662}\n", - "result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_1_dataset_unknown_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "dict_keys(['details', 'inconsistency'])" + ] + }, + "execution_count": 8, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result.keys()" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[{'folds': [{'p': 1, 'n': 128, 'identifier': 'zugsza_f0_k0_r0'},\n", + " {'p': 125, 'n': 3, 'identifier': 'zugsza_f1_k0_r0'}],\n", + " 'details': {'inconsistency': True,\n", + " 'lp_status': 'infeasible',\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 1,\n", + " 'n': 128,\n", + " 'identifier': 'zugsza_f0_k0_r0',\n", + " 'tp': 0.538002,\n", + " 'tn': 18.121093},\n", + " 'scores': {'acc': 0.14464414728682168,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.33978651953125},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 125,\n", + " 'n': 3,\n", + " 'identifier': 'zugsza_f1_k0_r0',\n", + " 'tp': 125.0,\n", + " 'tn': 2.9172929},\n", + " 'scores': {'acc': 0.99935385078125,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9862154833333333},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.5719989990340358,\n", + " 'sens': 0.769001,\n", + " 'bacc': 0.6630010014322917},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 1,\n", + " 'n': 128,\n", + " 'identifier': 'zugsza_f0_k0_r0',\n", + " 'tp': 0.538002,\n", + " 'tn': 18.121093},\n", + " 'scores': {'acc': 0.14464414728682168,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.33978651953125},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 125,\n", + " 'n': 3,\n", + " 'identifier': 'zugsza_f1_k0_r0',\n", + " 'tp': 125.0,\n", + " 'tn': 2.9172929},\n", + " 'scores': {'acc': 0.99935385078125,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9862154833333333},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}},\n", + " 'configuration_id': 0},\n", + " {'folds': [{'p': 2, 'n': 127, 'identifier': 'zugsza_f0_k1_r0'},\n", + " {'p': 124, 'n': 4, 'identifier': 'zugsza_f1_k1_r0'}],\n", + " 'details': {'inconsistency': True,\n", + " 'lp_status': 'infeasible',\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 2,\n", + " 'n': 127,\n", + " 'identifier': 'zugsza_f0_k1_r0',\n", + " 'tp': 1.076004,\n", + " 'tn': 17.59879},\n", + " 'scores': {'acc': 0.14476584496124031,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.3382875748031496},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 124,\n", + " 'n': 4,\n", + " 'identifier': 'zugsza_f1_k1_r0',\n", + " 'tp': 124.0,\n", + " 'tn': 3.9017154},\n", + " 'scores': {'acc': 0.9992321515625,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9877144250000001},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.5719989982618702,\n", + " 'sens': 0.769001,\n", + " 'bacc': 0.6630009999015748},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 2,\n", + " 'n': 127,\n", + " 'identifier': 'zugsza_f0_k1_r0',\n", + " 'tp': 1.076004,\n", + " 'tn': 17.59879},\n", + " 'scores': {'acc': 0.14476584496124031,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.3382875748031496},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 124,\n", + " 'n': 4,\n", + " 'identifier': 'zugsza_f1_k1_r0',\n", + " 'tp': 124.0,\n", + " 'tn': 3.9017154},\n", + " 'scores': {'acc': 0.9992321515625,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9877144250000001},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}},\n", + " 'configuration_id': 1},\n", + " {'folds': [{'p': 3, 'n': 126, 'identifier': 'zugsza_f0_k2_r0'},\n", + " {'p': 123, 'n': 5, 'identifier': 'zugsza_f1_k2_r0'}],\n", + " 'details': {'inconsistency': True,\n", + " 'lp_status': 'infeasible',\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 3,\n", + " 'n': 126,\n", + " 'identifier': 'zugsza_f0_k2_r0',\n", + " 'tp': 1.614006,\n", + " 'tn': 17.069944},\n", + " 'scores': {'acc': 0.14483682170542636,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.336738873015873},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 123,\n", + " 'n': 5,\n", + " 'identifier': 'zugsza_f1_k2_r0',\n", + " 'tp': 123.0,\n", + " 'tn': 4.8926313},\n", + " 'scores': {'acc': 0.99916118203125, 'sens': 1.0, 'bacc': 0.98926313},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.5719990018683382,\n", + " 'sens': 0.769001,\n", + " 'bacc': 0.6630010015079365},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 3,\n", + " 'n': 126,\n", + " 'identifier': 'zugsza_f0_k2_r0',\n", + " 'tp': 1.614006,\n", + " 'tn': 17.069944},\n", + " 'scores': {'acc': 0.14483682170542636,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.336738873015873},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 123,\n", + " 'n': 5,\n", + " 'identifier': 'zugsza_f1_k2_r0',\n", + " 'tp': 123.0,\n", + " 'tn': 4.8926313},\n", + " 'scores': {'acc': 0.99916118203125, 'sens': 1.0, 'bacc': 0.98926313},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}},\n", + " 'configuration_id': 2},\n", + " {'folds': [{'p': 4, 'n': 125, 'identifier': 'zugsza_f0_k3_r0'},\n", + " {'p': 122, 'n': 6, 'identifier': 'zugsza_f1_k3_r0'}],\n", + " 'details': {'inconsistency': True,\n", + " 'lp_status': 'infeasible',\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 4,\n", + " 'n': 125,\n", + " 'identifier': 'zugsza_f0_k3_r0',\n", + " 'tp': 2.152008,\n", + " 'tn': 16.534221},\n", + " 'scores': {'acc': 0.144854488372093,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.335137884},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 122,\n", + " 'n': 6,\n", + " 'identifier': 'zugsza_f1_k3_r0',\n", + " 'tp': 122.0,\n", + " 'tn': 5.8903694},\n", + " 'scores': {'acc': 0.9991435109375,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9908641166666666},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.5719989996547965,\n", + " 'sens': 0.769001,\n", + " 'bacc': 0.6630010003333333},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 4,\n", + " 'n': 125,\n", + " 'identifier': 'zugsza_f0_k3_r0',\n", + " 'tp': 2.152008,\n", + " 'tn': 16.534221},\n", + " 'scores': {'acc': 0.144854488372093,\n", + " 'sens': 0.538002,\n", + " 'bacc': 0.335137884},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 122,\n", + " 'n': 6,\n", + " 'identifier': 'zugsza_f1_k3_r0',\n", + " 'tp': 122.0,\n", + " 'tn': 5.8903694},\n", + " 'scores': {'acc': 0.9991435109375,\n", + " 'sens': 1.0,\n", + " 'bacc': 0.9908641166666666},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}},\n", + " 'configuration_id': 3},\n", + " {'folds': [{'p': 5, 'n': 124, 'identifier': 'zugsza_f0_k4_r0'},\n", + " {'p': 121, 'n': 7, 'identifier': 'zugsza_f1_k4_r0'}],\n", + " 'details': {'inconsistency': False,\n", + " 'lp_scores': {'acc': 0.5726138565891473,\n", + " 'sens': 0.7677685950413223,\n", + " 'bacc': 0.661246048672735},\n", + " 'lp_status': 'feasible',\n", + " 'lp_configuration_scores_match': True,\n", + " 'lp_configuration_bounds_match': True,\n", + " 'lp_configuration': {'evaluations': [{'folds': {'folds': [{'fold': {'p': 5,\n", + " 'n': 124,\n", + " 'identifier': 'zugsza_f0_k4_r0',\n", + " 'tp': 4.0,\n", + " 'tn': 49.0},\n", + " 'scores': {'acc': 0.4108527131782946,\n", + " 'sens': 0.8,\n", + " 'bacc': 0.5975806451612904},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 121,\n", + " 'n': 7,\n", + " 'identifier': 'zugsza_f1_k4_r0',\n", + " 'tp': 89.0,\n", + " 'tn': 5.0},\n", + " 'scores': {'acc': 0.734375,\n", + " 'sens': 0.7355371900826446,\n", + " 'bacc': 0.7249114521841794},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True},\n", + " 'scores': {'acc': 0.5726138565891473,\n", + " 'sens': 0.7677685950413223,\n", + " 'bacc': 0.661246048672735},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': {'folds': [{'fold': {'p': 5,\n", + " 'n': 124,\n", + " 'identifier': 'zugsza_f0_k4_r0',\n", + " 'tp': 4.0,\n", + " 'tn': 49.0},\n", + " 'scores': {'acc': 0.4108527131782946,\n", + " 'sens': 0.8,\n", + " 'bacc': 0.5975806451612904},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True},\n", + " {'fold': {'p': 121,\n", + " 'n': 7,\n", + " 'identifier': 'zugsza_f1_k4_r0',\n", + " 'tp': 89.0,\n", + " 'tn': 5.0},\n", + " 'scores': {'acc': 0.734375,\n", + " 'sens': 0.7355371900826446,\n", + " 'bacc': 0.7249114521841794},\n", + " 'score_bounds': None,\n", + " 'bounds_flag': True}],\n", + " 'bounds_flag': True}}],\n", + " 'bounds_flag': True}},\n", + " 'configuration_id': 4}]" + ] + }, + "execution_count": 10, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result['details']" + ] + }, { "cell_type": "code", "execution_count": 3, @@ -207,7 +507,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/20dd81cc408a40b08b70188d841bdb3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20dd81cc408a40b08b70188d841bdb3f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a64bda5696f34ec889bb61703d8a9e6f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a64bda5696f34ec889bb61703d8a9e6f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -225,7 +525,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dff6b7554ff7438fa133a9c1efa7a6ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dff6b7554ff7438fa133a9c1efa7a6ce-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/47e881a9789d46eabbc8c84384811b7b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47e881a9789d46eabbc8c84384811b7b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -243,7 +543,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59d6aae601b44848b0f32a14871e2587-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59d6aae601b44848b0f32a14871e2587-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bd533a9143774f628f95c5fb84bf9caa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd533a9143774f628f95c5fb84bf9caa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -261,7 +561,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/43bb65636b914f21a10dabe1e8bc648b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43bb65636b914f21a10dabe1e8bc648b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a64acd60d51a4fb19d30161e72582dad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a64acd60d51a4fb19d30161e72582dad-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -279,7 +579,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbd3ee2f9a864a30a0c8af0cce2b1f28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbd3ee2f9a864a30a0c8af0cce2b1f28-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a2e6241f2744f6488d9f71ac8631833-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a2e6241f2744f6488d9f71ac8631833-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -297,7 +597,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1aedfa2f46a040f8a689556d7d67afca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1aedfa2f46a040f8a689556d7d67afca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/490a29dca5ab4395b1bc7787aae91f1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/490a29dca5ab4395b1bc7787aae91f1e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -315,7 +615,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/208b45147edc4dc590109ecf89b0a325-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/208b45147edc4dc590109ecf89b0a325-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe8af1388e2d45d89eca0c1ee8f00d9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe8af1388e2d45d89eca0c1ee8f00d9c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -333,7 +633,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fdf4759f63284b3bbf7282553f83f5df-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdf4759f63284b3bbf7282553f83f5df-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3659ab64aef04fed920ef1b27b6d9d99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3659ab64aef04fed920ef1b27b6d9d99-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -351,7 +651,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/103f8fd203104ecbab7072c9bcb224da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/103f8fd203104ecbab7072c9bcb224da-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d4f53bdc5bf04de0bdeada45b74c1018-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4f53bdc5bf04de0bdeada45b74c1018-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -369,7 +669,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5ad7710312c4e2ea618cfa14da1e4e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5ad7710312c4e2ea618cfa14da1e4e9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cbac2968a885462eb17916b6e3948dc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbac2968a885462eb17916b6e3948dc5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -387,7 +687,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9cd4e7017604407b871cb7b6647fc14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9cd4e7017604407b871cb7b6647fc14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db0021c0aaec4529bd40423e9811fb31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db0021c0aaec4529bd40423e9811fb31-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -405,7 +705,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8821a36570d345baaf7e85c7a2c913ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8821a36570d345baaf7e85c7a2c913ad-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fdca9b1099f34d4792ca6c9edafc6de1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdca9b1099f34d4792ca6c9edafc6de1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -423,7 +723,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fba7b1cb10c14ecf9a43f706eb192f29-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fba7b1cb10c14ecf9a43f706eb192f29-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb669d5233fe44838e96c01f36a9e365-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb669d5233fe44838e96c01f36a9e365-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -441,7 +741,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af7aa975b9e7472b85835c98d0326545-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af7aa975b9e7472b85835c98d0326545-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0bb3fb2c482d4d428878a78acf55bed0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0bb3fb2c482d4d428878a78acf55bed0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -459,7 +759,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65178c991c2d4caca58befb801dd3b39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65178c991c2d4caca58befb801dd3b39-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64c7ed7fd4bd4adbaecb8d1535b57aba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64c7ed7fd4bd4adbaecb8d1535b57aba-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -477,7 +777,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/085fbd28462a4e89b6a41c6c085d0b4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/085fbd28462a4e89b6a41c6c085d0b4b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea1b904bfec84ab1b688b562fce97f81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea1b904bfec84ab1b688b562fce97f81-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -495,7 +795,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4fbbfbea8b8b4866b83d46b1dc7256ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fbbfbea8b8b4866b83d46b1dc7256ca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/67ebc52be3ac45de832a1a012050f246-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67ebc52be3ac45de832a1a012050f246-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -513,7 +813,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5b2604981d34ee9bc7e5cf32e6ea618-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5b2604981d34ee9bc7e5cf32e6ea618-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/133248800cda48d58d399939beacd828-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/133248800cda48d58d399939beacd828-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -531,7 +831,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b989dbc0715d4cc6aafad9ae8efadece-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b989dbc0715d4cc6aafad9ae8efadece-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fcc95c9962114e8f9ecf46c39c00d281-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fcc95c9962114e8f9ecf46c39c00d281-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -549,7 +849,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0015bb6cc97247b9b36dee39fe070d02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0015bb6cc97247b9b36dee39fe070d02-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/edc97d52b5bc4d0a911d3dca969d5479-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/edc97d52b5bc4d0a911d3dca969d5479-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -567,7 +867,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83225eb9f5a34cbba0a48d7617e34e89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83225eb9f5a34cbba0a48d7617e34e89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b64c98bf69248bca4085476e4dab003-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b64c98bf69248bca4085476e4dab003-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -585,7 +885,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1fb1abc603894baab80188fcdd6e92cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1fb1abc603894baab80188fcdd6e92cf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b5b397e1e924d26b9fb4dd012b9f93f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b5b397e1e924d26b9fb4dd012b9f93f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -603,7 +903,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b65104d4248948c1974c01ba1de1a4bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b65104d4248948c1974c01ba1de1a4bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be3540a197aa4aa2875f8934e5b89ac7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be3540a197aa4aa2875f8934e5b89ac7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -621,7 +921,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e15d00cef4c34ae4829906f9d98e6bbd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e15d00cef4c34ae4829906f9d98e6bbd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d8edd9a2c0b40478632239c8699e3e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d8edd9a2c0b40478632239c8699e3e5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -639,7 +939,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca16e255373d4388a135bb25a5df2e4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca16e255373d4388a135bb25a5df2e4e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87cd97c3da8b4a38b1828cd6d41e9979-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87cd97c3da8b4a38b1828cd6d41e9979-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -657,7 +957,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/acb36cbabd33464aad1a2974cc3f4d77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/acb36cbabd33464aad1a2974cc3f4d77-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3826897ed3fe44d3929da36a57b6a85f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3826897ed3fe44d3929da36a57b6a85f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -675,7 +975,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/11db332e9bf4412691c63967d83e3130-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11db332e9bf4412691c63967d83e3130-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e8bd38b8c8fb4440b0f7ae4d08620be8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8bd38b8c8fb4440b0f7ae4d08620be8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -693,7 +993,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65eda315835045338dc8211c60c7892f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65eda315835045338dc8211c60c7892f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33f4b08c5fa548b1a1c245e892929ef2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33f4b08c5fa548b1a1c245e892929ef2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -711,7 +1011,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24bc3124ba3a4a238904b840172d614c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24bc3124ba3a4a238904b840172d614c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/447baa426acc459d902c88047c9a3fe3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/447baa426acc459d902c88047c9a3fe3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -729,7 +1029,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eb6154d3dd2f427d9c436571fc0a1dba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb6154d3dd2f427d9c436571fc0a1dba-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/454eabb7648c48bfb4968bf2768ecc8e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/454eabb7648c48bfb4968bf2768ecc8e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -747,7 +1047,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f7af0d78cdc4d70b7ac6f475dfbe0a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f7af0d78cdc4d70b7ac6f475dfbe0a9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46a870dd87484d1fb903a87502a5b021-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46a870dd87484d1fb903a87502a5b021-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -765,7 +1065,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ffe0f2702474f73be07f53803ca5759-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ffe0f2702474f73be07f53803ca5759-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e9387287411f4a6e8bbc99b6e5ad37ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9387287411f4a6e8bbc99b6e5ad37ba-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -783,7 +1083,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1aad625d2b54202b604d9f347e1b4bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1aad625d2b54202b604d9f347e1b4bd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29094f56edbf47db9fd0e5614dafcdfa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29094f56edbf47db9fd0e5614dafcdfa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -801,7 +1101,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0649e8ae4f643eb83e979140d6bb46d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0649e8ae4f643eb83e979140d6bb46d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7eb92409645a47999086f2d3a40cc43d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7eb92409645a47999086f2d3a40cc43d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -819,7 +1119,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/91060ff6ea4540eeb6b2834c9a009995-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91060ff6ea4540eeb6b2834c9a009995-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d286792cac41457cae0a64103f48d3a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d286792cac41457cae0a64103f48d3a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -837,7 +1137,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/093dc17b2fb04372ba4533420ff0594e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/093dc17b2fb04372ba4533420ff0594e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/caa988ce4f674a6fb2151e86f01cdb60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/caa988ce4f674a6fb2151e86f01cdb60-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -855,7 +1155,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc09a20cfab041d796734f2610a48e54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc09a20cfab041d796734f2610a48e54-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e52dd94fd31148fb945284c553d4e54f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e52dd94fd31148fb945284c553d4e54f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -873,7 +1173,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82bbd88591e74e289e663c74f64d1988-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82bbd88591e74e289e663c74f64d1988-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a38869296964899954ca85935233a9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a38869296964899954ca85935233a9a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -891,7 +1191,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc73651c43104d5e8b63e40518b9083d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc73651c43104d5e8b63e40518b9083d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0af47e01889b42b095a6090d56ba6031-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0af47e01889b42b095a6090d56ba6031-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -909,7 +1209,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8738e608fb2d4c778602b006146a4c19-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8738e608fb2d4c778602b006146a4c19-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3e84a765b03048df99b53021465073ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e84a765b03048df99b53021465073ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -927,7 +1227,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8961c21122724911a7684585e4198664-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8961c21122724911a7684585e4198664-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1f633bb99204c75bd7861ed7ac0f295-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1f633bb99204c75bd7861ed7ac0f295-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -945,7 +1245,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e01b386885a8476782afb1bfbed515f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e01b386885a8476782afb1bfbed515f7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32ec42a7a4be4f38bbce7be9d39cb408-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32ec42a7a4be4f38bbce7be9d39cb408-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -963,7 +1263,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13cd24a5e6a048a99589fc2f08769619-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13cd24a5e6a048a99589fc2f08769619-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/246904d3b97b46bebf0eef58cf401794-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/246904d3b97b46bebf0eef58cf401794-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -981,7 +1281,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d0cc4c80aad4504a4d342318dd337c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d0cc4c80aad4504a4d342318dd337c5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/831185c77453421a87f29beadbac4a0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/831185c77453421a87f29beadbac4a0d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -999,7 +1299,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24a0f3dbbb0e4c58a78de683d36f119a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24a0f3dbbb0e4c58a78de683d36f119a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/632d41cfb79f4a46af6f8be7579802f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/632d41cfb79f4a46af6f8be7579802f3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1017,7 +1317,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/01c17eea00de479e9bd440451f6350d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01c17eea00de479e9bd440451f6350d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/850352474d0348bf954a329e9198c0a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/850352474d0348bf954a329e9198c0a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1035,7 +1335,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cfd9866600244317b559ac701a0636f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cfd9866600244317b559ac701a0636f1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbead456f9b74007bb1f31b5355e8d80-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbead456f9b74007bb1f31b5355e8d80-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1053,7 +1353,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75cfad87b3814b8491ec207848e787a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75cfad87b3814b8491ec207848e787a3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef59a59d9b224b1a85fbff34f17b7579-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef59a59d9b224b1a85fbff34f17b7579-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1071,7 +1371,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/79dd3306359842c49f679815bb019277-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79dd3306359842c49f679815bb019277-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce968fa9af294a73ad70a458375a353d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce968fa9af294a73ad70a458375a353d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1089,7 +1389,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42b883198506483ba5c7a0fb88adbbeb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42b883198506483ba5c7a0fb88adbbeb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae55920041714cffbc606dc625be21c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae55920041714cffbc606dc625be21c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1107,7 +1407,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5035fd53b89c4c909d45d88d03c116d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5035fd53b89c4c909d45d88d03c116d8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cc56e08740640deb9833eeae6d89315-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cc56e08740640deb9833eeae6d89315-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1125,7 +1425,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13087a8cce044b63a3d1a4e5cc90c4ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13087a8cce044b63a3d1a4e5cc90c4ee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a12fcd8c5174466fbadc7fa9d3c5b942-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a12fcd8c5174466fbadc7fa9d3c5b942-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1143,7 +1443,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0dfff785eda647e3892506ea9fcd430e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dfff785eda647e3892506ea9fcd430e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aac21500d76d460d9a3c171deae30b8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aac21500d76d460d9a3c171deae30b8f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1161,7 +1461,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b18c0ad6e95d4db7a93dccd2a00bbe9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b18c0ad6e95d4db7a93dccd2a00bbe9a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd115bf38e8746558809e3e7803b7a05-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd115bf38e8746558809e3e7803b7a05-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1179,7 +1479,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/984af2c59770459a8f0dd749ce928f5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/984af2c59770459a8f0dd749ce928f5e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ba602d5e696476fb613b30f215ecbdf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ba602d5e696476fb613b30f215ecbdf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1197,7 +1497,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c9aa5ada51334d0199e0b5fb47f48ce5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9aa5ada51334d0199e0b5fb47f48ce5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6194ab2488cf48dfb3d2c81974a609e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6194ab2488cf48dfb3d2c81974a609e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1215,7 +1515,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa83b46c367242899385aa6b52690672-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa83b46c367242899385aa6b52690672-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fba7e5bbd81947709969ecf2ea91de18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fba7e5bbd81947709969ecf2ea91de18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1233,7 +1533,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6043df15584344598f0dc02d0fb55e4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6043df15584344598f0dc02d0fb55e4c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e33e338b4c0b44b6abaa4405fc9cab15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e33e338b4c0b44b6abaa4405fc9cab15-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1251,7 +1551,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b1a669b6d5e4b19b6f24f8930be30e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b1a669b6d5e4b19b6f24f8930be30e8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c8cd93a4eb644460974ee4b32ff7ba90-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8cd93a4eb644460974ee4b32ff7ba90-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1269,7 +1569,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f6ef3d11b684791a94838fbd67a6da3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f6ef3d11b684791a94838fbd67a6da3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba4d8a911b85493e8aa09ee65d9ce9bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba4d8a911b85493e8aa09ee65d9ce9bb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1287,7 +1587,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/808c320dcc2c423d9f95291e364b05ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/808c320dcc2c423d9f95291e364b05ed-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/138767dfec404b4fa5b59d88da3e0623-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/138767dfec404b4fa5b59d88da3e0623-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1305,7 +1605,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f68a463e047a4f8ead48158201b121cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f68a463e047a4f8ead48158201b121cf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d21df1b84246418a8034d011e283c1dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d21df1b84246418a8034d011e283c1dd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1323,7 +1623,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1eb22572673d43408d7d67e7f471c935-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1eb22572673d43408d7d67e7f471c935-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d720d82925944487a26c7c631d1d51bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d720d82925944487a26c7c631d1d51bf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1341,7 +1641,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cc0bac6a0ce474894242fdf3e07e071-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cc0bac6a0ce474894242fdf3e07e071-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a88535b9e91049eb973f725d5cfd340d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a88535b9e91049eb973f725d5cfd340d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1359,7 +1659,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21302df6a3fe47ceb94684ca16bb5f5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21302df6a3fe47ceb94684ca16bb5f5a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d7e79c9f9d14d158e40a88197ba44f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d7e79c9f9d14d158e40a88197ba44f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1377,7 +1677,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/07dfe8f45eb04086b73821a0fbd65151-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07dfe8f45eb04086b73821a0fbd65151-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e19a9ea3f2cb4669b67390d0cc79b619-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e19a9ea3f2cb4669b67390d0cc79b619-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1395,7 +1695,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0eacaf2159824c7a989fdc4a5f8ac146-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0eacaf2159824c7a989fdc4a5f8ac146-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ad8154cb93f42139f0fa40399724b72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ad8154cb93f42139f0fa40399724b72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1413,7 +1713,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f0046dd930643c7a47f101956ada6b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f0046dd930643c7a47f101956ada6b4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f808e38765142928fb7442e669cfe94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f808e38765142928fb7442e669cfe94-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1431,7 +1731,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c63835bd60e24077a2a0a2de6798c581-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c63835bd60e24077a2a0a2de6798c581-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c74893b5bb8f4565a61e98f8ada763d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c74893b5bb8f4565a61e98f8ada763d2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1449,7 +1749,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0df81f23fd1649158bcac1bff8c69536-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0df81f23fd1649158bcac1bff8c69536-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/718868f9041d47329576c71b1f2cfd27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/718868f9041d47329576c71b1f2cfd27-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1467,7 +1767,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1732543c8ebc4b95aadec8b5051fa585-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1732543c8ebc4b95aadec8b5051fa585-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e46fa014f5d4d2d93ca33b7834b0ed4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e46fa014f5d4d2d93ca33b7834b0ed4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1485,7 +1785,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/07b2f75537b145e4971a1a001c216792-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07b2f75537b145e4971a1a001c216792-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/286f6735e07f48c5858d8e8bf6daf6d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/286f6735e07f48c5858d8e8bf6daf6d3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1503,7 +1803,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e34e4efbe9604010b7d5850af0c1167b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e34e4efbe9604010b7d5850af0c1167b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a9f5061fc60405f9f2fce2aede9b95b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a9f5061fc60405f9f2fce2aede9b95b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1521,7 +1821,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae91eee3d4ab4fefa21a638f3b46ee27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae91eee3d4ab4fefa21a638f3b46ee27-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bd7f3a870f347faa4dc023121325c90-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bd7f3a870f347faa4dc023121325c90-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1539,7 +1839,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/62f1429ebbfd4b088854f6d8a2309df3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62f1429ebbfd4b088854f6d8a2309df3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7bd276a83a454d7db64440c61c43e91d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bd276a83a454d7db64440c61c43e91d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1557,7 +1857,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/39638febd7c84e0c83813b221458b7c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39638febd7c84e0c83813b221458b7c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3cc776c865d42d29a9965dda34fa5bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3cc776c865d42d29a9965dda34fa5bf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1575,7 +1875,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e9186d7ee084508baee0da46c2f92b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e9186d7ee084508baee0da46c2f92b8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8dd8fabc763448cba8921c76a9fdc3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8dd8fabc763448cba8921c76a9fdc3d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1593,7 +1893,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c43281931dab4f3f84fc70c96ee8c707-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c43281931dab4f3f84fc70c96ee8c707-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0461fe555aa94854abf1607572777c1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0461fe555aa94854abf1607572777c1e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1611,7 +1911,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e13e50b7cff64492858ec983a2ef96b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e13e50b7cff64492858ec983a2ef96b9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/20b04f5a16d14a068546215830201524-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20b04f5a16d14a068546215830201524-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1629,7 +1929,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fec1a5c6b6845c2820f3f53f21b96a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fec1a5c6b6845c2820f3f53f21b96a6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2611d4553daf48d1be34bbc916b2b0b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2611d4553daf48d1be34bbc916b2b0b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1647,7 +1947,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/52ba226798264b24893f13a0e833b86f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52ba226798264b24893f13a0e833b86f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b891f20bc794689a67e9ad266c5034b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b891f20bc794689a67e9ad266c5034b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1665,7 +1965,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eeffee23b9ba4c7794b1d32b158460d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eeffee23b9ba4c7794b1d32b158460d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b156a0f635364fe1b8efb27a1b96ad99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b156a0f635364fe1b8efb27a1b96ad99-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1683,7 +1983,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c850a37559024398a2f67a6ed7f3f4be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c850a37559024398a2f67a6ed7f3f4be-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cb771b32949474ca695642bc6f02105-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cb771b32949474ca695642bc6f02105-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1701,7 +2001,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c43c07ecccd14f7cb230659fd0152e14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c43c07ecccd14f7cb230659fd0152e14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c0b8879739c8473db3a5012920d673b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0b8879739c8473db3a5012920d673b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1719,7 +2019,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/680ba6b154e04cfa8160517b1c492072-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/680ba6b154e04cfa8160517b1c492072-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9eb67df0965449568a47045fac0807ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9eb67df0965449568a47045fac0807ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1737,7 +2037,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9abe20299eb14240aa7fe4008d47da65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9abe20299eb14240aa7fe4008d47da65-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1fc7824bfb514f5e844985e4b75556b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1fc7824bfb514f5e844985e4b75556b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1755,7 +2055,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ebc391f43274b0793256d18ca2c5ce6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ebc391f43274b0793256d18ca2c5ce6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/926e05d862c9434ba3cf7a8fbacb8b5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/926e05d862c9434ba3cf7a8fbacb8b5a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1773,7 +2073,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a85c8fca86e4034886d937078d6fbc0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a85c8fca86e4034886d937078d6fbc0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53201c7086c74ca19fcf45f6ff7e48ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53201c7086c74ca19fcf45f6ff7e48ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1791,7 +2091,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ae016f0fb2b47ed9d2c78ac42869d07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ae016f0fb2b47ed9d2c78ac42869d07-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cfeb110b50f42fa8be465355b303d98-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cfeb110b50f42fa8be465355b303d98-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1809,7 +2109,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0fd54389ab4d45bdb7cb27a875ac52df-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0fd54389ab4d45bdb7cb27a875ac52df-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b7fe9558faf43a6bb35ba1a16300d13-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b7fe9558faf43a6bb35ba1a16300d13-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1827,7 +2127,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0182bda01c0c4042ba504f485d30cea7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0182bda01c0c4042ba504f485d30cea7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35fe18c4f6d14cdcb9cdde3ea063c16b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35fe18c4f6d14cdcb9cdde3ea063c16b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1845,7 +2145,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6ef75fbbfe4472a9b53f8a08b8fa7b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6ef75fbbfe4472a9b53f8a08b8fa7b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d732fd5b4e2b473780d41c5d9e04f4e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d732fd5b4e2b473780d41c5d9e04f4e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1863,7 +2163,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d10b3b2830814a7d96572c3f5ec1448b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d10b3b2830814a7d96572c3f5ec1448b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/70b94206f87449a7b5ac69142d779ea0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70b94206f87449a7b5ac69142d779ea0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1881,7 +2181,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90236b8648864ce3bd43cc2f6206d28c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90236b8648864ce3bd43cc2f6206d28c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eafd171f13394c5480a1a0c401a68034-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eafd171f13394c5480a1a0c401a68034-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1899,7 +2199,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e96f3dd7ce084c84ade46720f698c6f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e96f3dd7ce084c84ade46720f698c6f0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c2ee98ae1224ec899b35f591e12d2ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c2ee98ae1224ec899b35f591e12d2ab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1917,7 +2217,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/504d6d4178b14f49ae13064b4c9eb29b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/504d6d4178b14f49ae13064b4c9eb29b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92c4cfb45632442592b47cf28c3916f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92c4cfb45632442592b47cf28c3916f7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1935,7 +2235,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ce6519073644a95996231b8782d685d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ce6519073644a95996231b8782d685d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e710ef2f43cb446e94fde4629eae934c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e710ef2f43cb446e94fde4629eae934c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1953,7 +2253,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce624b80509f4deaafe6de05f6275fa6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce624b80509f4deaafe6de05f6275fa6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d83593b7bd8442a1be6e5d04a1ae6091-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d83593b7bd8442a1be6e5d04a1ae6091-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1971,7 +2271,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65a68eb08d4c43b6b6d6153910439138-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65a68eb08d4c43b6b6d6153910439138-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd00cb79f1a442b6a960a9845a16765f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd00cb79f1a442b6a960a9845a16765f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1989,7 +2289,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a78b2d4121f4d4584162f77217d19a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a78b2d4121f4d4584162f77217d19a9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1842d082ee7f4ec3bb5fb7f552d8d1d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1842d082ee7f4ec3bb5fb7f552d8d1d3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2007,7 +2307,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93b76286657c44f7b93c94d93e965fe6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93b76286657c44f7b93c94d93e965fe6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ae412e50d4a4c5d9e0c57a7334d5bf0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ae412e50d4a4c5d9e0c57a7334d5bf0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2025,7 +2325,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f915561feb24c8fb87e450aebfa4ad2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f915561feb24c8fb87e450aebfa4ad2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2be5fa5156e54bce83be67c929ab097e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2be5fa5156e54bce83be67c929ab097e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2043,7 +2343,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/367ae75d32644f92a11ab8502924d1eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/367ae75d32644f92a11ab8502924d1eb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/805239464bb5465083b60ced55e5db24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/805239464bb5465083b60ced55e5db24-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2061,7 +2361,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc181c63d6da49c9b9dd760510e93074-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc181c63d6da49c9b9dd760510e93074-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02b68e3885ee41daba88d370bec298a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02b68e3885ee41daba88d370bec298a7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2079,7 +2379,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c21b6f9f75944bc6b4b38e2d833653bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c21b6f9f75944bc6b4b38e2d833653bc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f7cb73a6b1ec4231a308357ed0ebf9ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7cb73a6b1ec4231a308357ed0ebf9ad-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2097,7 +2397,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce7f136368d6432f93013ca965596e13-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce7f136368d6432f93013ca965596e13-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3e4262288ed74e4bb3791195b4e2dbc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e4262288ed74e4bb3791195b4e2dbc2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2115,7 +2415,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2aa0bf4ec9dc420fb1df47460c66ea03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2aa0bf4ec9dc420fb1df47460c66ea03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35d55a9f7b6c4dfa90027d14c6753644-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35d55a9f7b6c4dfa90027d14c6753644-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2133,7 +2433,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/013db806b7a6473f8282ac2a955a4495-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/013db806b7a6473f8282ac2a955a4495-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c73363217f04e15a17cfde9a81e3425-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c73363217f04e15a17cfde9a81e3425-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2151,7 +2451,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/544c490b32464323b416c58ed64cea8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/544c490b32464323b416c58ed64cea8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d4c40102921846778e094ad25952994d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4c40102921846778e094ad25952994d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2169,7 +2469,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d8ec7b6e6604e1a8f2b9fa4d097874d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d8ec7b6e6604e1a8f2b9fa4d097874d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e264b62fa2d948288bdb1c9cae5103a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e264b62fa2d948288bdb1c9cae5103a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2187,7 +2487,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6a49df27bac41e69b79d5aa6b232a2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6a49df27bac41e69b79d5aa6b232a2f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed5255b4ecc24128a33f2fa36af28afc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed5255b4ecc24128a33f2fa36af28afc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2205,7 +2505,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21b84bbc058a4ebc8fc5d2ebe79c6d17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21b84bbc058a4ebc8fc5d2ebe79c6d17-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c08bd64828204425a02e8b05aa763e76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c08bd64828204425a02e8b05aa763e76-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2223,7 +2523,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f92ef25afb234b7ea3972187722c49ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f92ef25afb234b7ea3972187722c49ae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f58d5af75b74c3089d9311e3b3babee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f58d5af75b74c3089d9311e3b3babee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2241,7 +2541,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/07556f0581a1414b9a187eeae3724a80-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07556f0581a1414b9a187eeae3724a80-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a09f7b4c3e384f40ae00c4611a5d15a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a09f7b4c3e384f40ae00c4611a5d15a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2259,7 +2559,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2846a3fce3c74d57a0a846a2c4b62f9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2846a3fce3c74d57a0a846a2c4b62f9b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b4b47bfa55514b54a4a711755800709e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4b47bfa55514b54a4a711755800709e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2277,7 +2577,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab821309e7b34111835918c5c96709f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab821309e7b34111835918c5c96709f6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ffba51b2e1364d2892e451a8f6a041a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffba51b2e1364d2892e451a8f6a041a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2295,7 +2595,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60e419733a1242729bafb59d85f9a54e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60e419733a1242729bafb59d85f9a54e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35591768dbfe412ab601344dd0ce5eea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35591768dbfe412ab601344dd0ce5eea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2313,7 +2613,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e84bc8e50ae5498aad42cc4f196c100d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e84bc8e50ae5498aad42cc4f196c100d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1ac121e291f042afa86b7ba68344f6a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ac121e291f042afa86b7ba68344f6a6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2331,7 +2631,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f6b05f453cf4716a974f780a25c3ad4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f6b05f453cf4716a974f780a25c3ad4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1e17638eede4ee4a0b858f9a9eac28d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1e17638eede4ee4a0b858f9a9eac28d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2349,7 +2649,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/392e975ae24f4d11bfa50a27675c1797-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/392e975ae24f4d11bfa50a27675c1797-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c651d5ff3033464b9ce21f3834b5f8d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c651d5ff3033464b9ce21f3834b5f8d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2367,7 +2667,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/26d4a17f3d80464cbf56975ef1dbddf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26d4a17f3d80464cbf56975ef1dbddf2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b630d10c8ea643b6a36df6923a19b8ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b630d10c8ea643b6a36df6923a19b8ad-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2385,7 +2685,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b85a0e57e71d483682806e386388a612-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b85a0e57e71d483682806e386388a612-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/26b966a98db34a238ec2150c272061dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26b966a98db34a238ec2150c272061dd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2403,7 +2703,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c8c544f454204b0498d64e061fff9143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8c544f454204b0498d64e061fff9143-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0953fdf265e140899b7ed42791ce097a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0953fdf265e140899b7ed42791ce097a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2421,7 +2721,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/37c3c6214e9d41f197a2d277eca031b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/37c3c6214e9d41f197a2d277eca031b0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9dc377c2315849bd9ce1f9c966621c27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9dc377c2315849bd9ce1f9c966621c27-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2439,7 +2739,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/31d4433360b94f85b2baaad57c508c6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/31d4433360b94f85b2baaad57c508c6d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b13993bc1e346a0b7c84ddbef0b2e6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b13993bc1e346a0b7c84ddbef0b2e6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2470,10 +2770,10 @@ "dataset = {'p': 126, 'n': 131}\n", "folding = {'n_folds': 2, 'n_repeats': 1}\n", "scores = {'acc': 0.573, 'sens': 0.768, 'bacc': 0.862}\n", - "result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_1_dataset_unknown_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, @@ -2490,7 +2790,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8bd57a7ec351427781381b9085fdaa45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bd57a7ec351427781381b9085fdaa45-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7308d608a2e24513a7e38a4de373cd19-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7308d608a2e24513a7e38a4de373cd19-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2510,7 +2810,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60682dd4d246479faec8d469548f1026-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60682dd4d246479faec8d469548f1026-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2f234badd72473ca7df71d568fe87e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2f234badd72473ca7df71d568fe87e7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2553,13 +2853,13 @@ "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9bd9fc5161174da2b6f2834705873e98-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bd9fc5161174da2b6f2834705873e98-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a4e7620bf12447958fdf547a6c859382-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4e7620bf12447958fdf547a6c859382-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2582,7 +2882,7 @@ "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.00 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", "Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", @@ -2600,16 +2900,16 @@ "Enumerated nodes: 0\n", "Total iterations: 0\n", "Time (CPU seconds): 0.00\n", - "Time (Wallclock seconds): 0.01\n", + "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a7b90a9391a40668190dbdcd5584003-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a7b90a9391a40668190dbdcd5584003-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a32ff5f1fe95460eb9be0e495266153c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a32ff5f1fe95460eb9be0e495266153c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2629,7 +2929,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b0bddf9fe1dd4d77b9c7929dbd4d5de5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0bddf9fe1dd4d77b9c7929dbd4d5de5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02d606a9cce84cb5aebbf3e2120bf3bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02d606a9cce84cb5aebbf3e2120bf3bd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2650,7 +2950,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed5a522c08ce4f88a414b8a7f8ef2dd8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed5a522c08ce4f88a414b8a7f8ef2dd8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/86e07e044162468099e360bad3d20cc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/86e07e044162468099e360bad3d20cc5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2692,13 +2992,13 @@ "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b32952ed1b84ccabcef7adcab7700dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b32952ed1b84ccabcef7adcab7700dd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e80acb7c9ef4bcc931d10fd4a774a77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e80acb7c9ef4bcc931d10fd4a774a77-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2750,7 +3050,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e82e5f3dc70846e8a6a2da2a26b79143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e82e5f3dc70846e8a6a2da2a26b79143-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/767543b38aa74b3e98838a00aacc57a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/767543b38aa74b3e98838a00aacc57a3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2798,7 +3098,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0baf4c2ce91447479220f2319fac7e43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0baf4c2ce91447479220f2319fac7e43-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88973059ff87419a90436b5afdd6be5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88973059ff87419a90436b5afdd6be5a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2818,7 +3118,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02794b967d054b83b2691ade923d5c7d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02794b967d054b83b2691ade923d5c7d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/152a889c4695466f951e3dd3edd281cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/152a889c4695466f951e3dd3edd281cb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2868,7 +3168,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1951d72e710f4abf991934ccce268ce8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1951d72e710f4abf991934ccce268ce8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd09b04e846b4f9989a2cc496163aa84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd09b04e846b4f9989a2cc496163aa84-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2916,7 +3216,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e91fb559cd3c488f8f6491be7d5cf8bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e91fb559cd3c488f8f6491be7d5cf8bf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2945c317e4224c6aa25d6c1fcb4488bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2945c317e4224c6aa25d6c1fcb4488bf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2934,7 +3234,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/48b9f112394f40f2a9fc17caab9a565f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48b9f112394f40f2a9fc17caab9a565f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/017fbd58307449f49ab018d139385d79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/017fbd58307449f49ab018d139385d79-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2984,7 +3284,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8206232ff1bf4e088e907197c8d3c53c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8206232ff1bf4e088e907197c8d3c53c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00fc9acd8779430a8da1b112e629fba5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00fc9acd8779430a8da1b112e629fba5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3032,7 +3332,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13b3ad6c105a45fb9d14daed33e8a0d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13b3ad6c105a45fb9d14daed33e8a0d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d625f8f24f704ba698c5967f163bda91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d625f8f24f704ba698c5967f163bda91-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3050,7 +3350,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2cb5fae2092f4423ab0e2cb30607675e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cb5fae2092f4423ab0e2cb30607675e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68976850fc5d41dda23dd873ca4d02a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68976850fc5d41dda23dd873ca4d02a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3068,7 +3368,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a2c2964936b43b1bcb1398b92ec60d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a2c2964936b43b1bcb1398b92ec60d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d080e5151522428ea471189674cac12c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d080e5151522428ea471189674cac12c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3119,7 +3419,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/16c3d049e25e4770b5723fb111184d04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/16c3d049e25e4770b5723fb111184d04-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/778777bdf19244648f23a431f0cdf7bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/778777bdf19244648f23a431f0cdf7bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3137,7 +3437,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03584539c0054f8fb29129ff8dec60eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03584539c0054f8fb29129ff8dec60eb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6dd2e63a9ab944ecbebbfd689b8a74a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6dd2e63a9ab944ecbebbfd689b8a74a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3155,7 +3455,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d414147e110f43d4ae415ac1c2642797-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d414147e110f43d4ae415ac1c2642797-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87782fd603f74f7fa891ce30e14c4978-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87782fd603f74f7fa891ce30e14c4978-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3173,7 +3473,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/40961c77c61c4ad5bac097c3ec93fff0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40961c77c61c4ad5bac097c3ec93fff0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d69d2bb61aa47d1a98cbc216d8810e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d69d2bb61aa47d1a98cbc216d8810e4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3191,7 +3491,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/56d96ad8aba94c0abc9f95ba2aca88ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56d96ad8aba94c0abc9f95ba2aca88ac-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03cfe0210b054240b67df173e75fbe18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03cfe0210b054240b67df173e75fbe18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3209,7 +3509,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54e1cd96f6b74e4c9aa0b9264c637ec5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54e1cd96f6b74e4c9aa0b9264c637ec5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1070826a367a4e83819b426cc8044fab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1070826a367a4e83819b426cc8044fab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3227,7 +3527,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d93b056563f84e2c9d17a978e6ae60cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d93b056563f84e2c9d17a978e6ae60cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b577fef9e2364f03b8576b718d0b4689-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b577fef9e2364f03b8576b718d0b4689-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3245,7 +3545,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a7564d244ad4428c89246816126b3824-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7564d244ad4428c89246816126b3824-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7dc0d5249c75437d923e4a2a92fd0b4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7dc0d5249c75437d923e4a2a92fd0b4a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3263,7 +3563,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d9bbe8cb403348788e2599085e90472d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d9bbe8cb403348788e2599085e90472d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b614d43e7e864c6ea044f167ed904d2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b614d43e7e864c6ea044f167ed904d2a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3303,7 +3603,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5380ae8c7e124957b272563ded388c73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5380ae8c7e124957b272563ded388c73-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c36f04f689048f69cf730fa995d4afe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c36f04f689048f69cf730fa995d4afe-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3321,7 +3621,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d56ba0f181c41a98231005a2126837d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d56ba0f181c41a98231005a2126837d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3a554264f0a400d848c2f5429284f1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3a554264f0a400d848c2f5429284f1b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3339,7 +3639,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64f4b8f7bcfa4d6c876633c2d1fd4739-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64f4b8f7bcfa4d6c876633c2d1fd4739-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f64877e35f047a7aa96e417461d4b87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f64877e35f047a7aa96e417461d4b87-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3357,7 +3657,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d5ea48f39954348ab0da3b5c8549e0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d5ea48f39954348ab0da3b5c8549e0f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce5f368acad64c6591ae45ff703d7dac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce5f368acad64c6591ae45ff703d7dac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3375,7 +3675,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/855057c2dd4143a9bf84b954da996aa5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/855057c2dd4143a9bf84b954da996aa5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3e69cd03cf5e477295df144120b9acf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e69cd03cf5e477295df144120b9acf2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3425,7 +3725,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e32841982e5f4c90883e939f1e059cf6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e32841982e5f4c90883e939f1e059cf6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02b993bed6de440988d20c287aed1a05-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02b993bed6de440988d20c287aed1a05-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3443,7 +3743,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3f0dae216dcc43d28c1a32874fa5fb60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f0dae216dcc43d28c1a32874fa5fb60-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7114d25b724e4119b4be70027af0819a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7114d25b724e4119b4be70027af0819a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3461,7 +3761,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/caac704f07144e78b744dc11e19a7bbc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/caac704f07144e78b744dc11e19a7bbc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a94ff9e0d50c4c2eae30d2769ae01ebc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a94ff9e0d50c4c2eae30d2769ae01ebc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3479,7 +3779,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a940db3927594bf486212e0da85121af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a940db3927594bf486212e0da85121af-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cba4e3bdad6d46dbafe9500a14cebcc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cba4e3bdad6d46dbafe9500a14cebcc7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3497,7 +3797,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/47931b2904584424ae69b83716d67852-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47931b2904584424ae69b83716d67852-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a2bdafffa4084699b2798a27910af1ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2bdafffa4084699b2798a27910af1ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3515,7 +3815,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d147eff0665942b79df9c3121488dd58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d147eff0665942b79df9c3121488dd58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4842888d7cc941dfbef5942af753db72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4842888d7cc941dfbef5942af753db72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3565,7 +3865,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/afab073e74364b709785d55f8cc85ef2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afab073e74364b709785d55f8cc85ef2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/991cd811940b47838a53bcfa4d122e18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/991cd811940b47838a53bcfa4d122e18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3612,7 +3912,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d1580f3e1f14fb68b39dcaaa10d975e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d1580f3e1f14fb68b39dcaaa10d975e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/96f1fc1a491f46ae850b7873874ecf04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96f1fc1a491f46ae850b7873874ecf04-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3630,7 +3930,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5742a4d3bb294952948bdf9b67c696e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5742a4d3bb294952948bdf9b67c696e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5e5693c8262349fab36fb810a13da7ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e5693c8262349fab36fb810a13da7ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3648,7 +3948,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4e6e6fcf58224a609f1d5232a75d7291-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e6e6fcf58224a609f1d5232a75d7291-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8f3f34ad9654852aba8604b739b97f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8f3f34ad9654852aba8604b739b97f9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3666,7 +3966,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/133275acbad24af4bc67be39520310e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/133275acbad24af4bc67be39520310e7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a878aa822df94dc89060ba0f935163ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a878aa822df94dc89060ba0f935163ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3684,7 +3984,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d846ccba30c9473998a76de6f860bc5d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d846ccba30c9473998a76de6f860bc5d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1c229ce0444493c959e6773f0453588-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1c229ce0444493c959e6773f0453588-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3734,7 +4034,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b373fa6865546c2a55b7c1b47aee258-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b373fa6865546c2a55b7c1b47aee258-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4649d2a81f3f4a8aa1168b18462de4ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4649d2a81f3f4a8aa1168b18462de4ba-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3781,7 +4081,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c093cd4bf0b4959987df860f194de59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c093cd4bf0b4959987df860f194de59-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f31348825684bf2aad767a5ba84f650-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f31348825684bf2aad767a5ba84f650-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3799,7 +4099,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33ed4e818e334eddbb23b0bfd9df718f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33ed4e818e334eddbb23b0bfd9df718f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bfcf200b0e2c41e48aed42aabb12d95c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfcf200b0e2c41e48aed42aabb12d95c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3817,7 +4117,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/832087e4b4be4322b3f7a329e2a02f24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/832087e4b4be4322b3f7a329e2a02f24-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fdef367866174dfabc31798238895fe5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdef367866174dfabc31798238895fe5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3835,7 +4135,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8191b4cde7a742eeb276aa079827b5bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8191b4cde7a742eeb276aa079827b5bc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e482d142c714373a13fadcdfa91d600-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e482d142c714373a13fadcdfa91d600-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3853,7 +4153,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f0da9b1201c43c19b00533c14efbac2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f0da9b1201c43c19b00533c14efbac2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fbb83858200440708168d69bd4f74b37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbb83858200440708168d69bd4f74b37-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3871,7 +4171,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e85c18e559df41bc82d73355d3cc48fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e85c18e559df41bc82d73355d3cc48fb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8aab9cdf3424afe9881a0201031bea9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8aab9cdf3424afe9881a0201031bea9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3892,7 +4192,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84731b0d664946799dbe06c868a34896-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84731b0d664946799dbe06c868a34896-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9b859e9950914fe8b07a669189da7d44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b859e9950914fe8b07a669189da7d44-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3939,7 +4239,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/added25eabc84acbbfe74c7617b4b70c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/added25eabc84acbbfe74c7617b4b70c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/17658929775a448b9c47d3403d18ffcd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17658929775a448b9c47d3403d18ffcd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3957,7 +4257,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a825d5cf3e8d41e1b21f5eac9aec30f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a825d5cf3e8d41e1b21f5eac9aec30f3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c548fd8e8f1c4622a80c51138c3c4d40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c548fd8e8f1c4622a80c51138c3c4d40-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3975,7 +4275,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d88f31d06ae442693f18cd8737ab890-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d88f31d06ae442693f18cd8737ab890-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/45113bddba874844be13ff66be585142-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45113bddba874844be13ff66be585142-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3993,7 +4293,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af84be08be96433fac25410a27c85be9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af84be08be96433fac25410a27c85be9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7603510ff59b4670a1e4f66c27986196-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7603510ff59b4670a1e4f66c27986196-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4011,7 +4311,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae2a3cc3e2204252a267dcbff4ae9a63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae2a3cc3e2204252a267dcbff4ae9a63-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7aa2e395cff945a8982226c57b764565-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7aa2e395cff945a8982226c57b764565-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4029,7 +4329,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a931624ced404164a376b8719802bc8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a931624ced404164a376b8719802bc8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9104dcf3b46546e782640570f6af57ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9104dcf3b46546e782640570f6af57ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4079,7 +4379,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/01253ba7cafe4b1d94398fd55116f69f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01253ba7cafe4b1d94398fd55116f69f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f81ddbc41f5a4a51adc667ed6050fc81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f81ddbc41f5a4a51adc667ed6050fc81-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4128,7 +4428,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6dae961590f24364b366892515ba5129-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6dae961590f24364b366892515ba5129-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c36f52ceced340f8a27ab549af3660c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c36f52ceced340f8a27ab549af3660c1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4175,7 +4475,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7983f84fced842ab8646041d18f485cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7983f84fced842ab8646041d18f485cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a6863f65eb84fae9d25b8e1063eaf42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a6863f65eb84fae9d25b8e1063eaf42-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4193,7 +4493,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a263190443eb4c789b8c02fa1458bf6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a263190443eb4c789b8c02fa1458bf6d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8897f86f1464336abcdcd737fc3d000-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8897f86f1464336abcdcd737fc3d000-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4211,7 +4511,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ff6802f5b264a278deaa9b492b2b10f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ff6802f5b264a278deaa9b492b2b10f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bce0017a3c7a4efcaa8bb53e256c0a3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bce0017a3c7a4efcaa8bb53e256c0a3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4229,7 +4529,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f4fca5148f5c4488b823f12d5ab8e775-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4fca5148f5c4488b823f12d5ab8e775-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f21ac3bb788499bbe7bb7689ddd5176-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f21ac3bb788499bbe7bb7689ddd5176-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4247,7 +4547,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/352454b145974964857cf86d7412a46d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/352454b145974964857cf86d7412a46d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33d4814bc3ec4f4882f42549d40b2040-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33d4814bc3ec4f4882f42549d40b2040-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4265,7 +4565,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59a56df06d6c48088c1c66bef4a1e0c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59a56df06d6c48088c1c66bef4a1e0c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c101c5396cd4cd59f450b932608ba7e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c101c5396cd4cd59f450b932608ba7e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4314,7 +4614,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7147a16c74d64989a139d630759edff1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7147a16c74d64989a139d630759edff1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa4b54dce2b14ed0b2e6e545330738cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa4b54dce2b14ed0b2e6e545330738cd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4361,7 +4661,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ddc4e9e9223e43ef9797b844f26e31f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ddc4e9e9223e43ef9797b844f26e31f8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9171ed848919435fbf59041692e6f4c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9171ed848919435fbf59041692e6f4c2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4409,7 +4709,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/351cd7c203b14c16b18a2a2e095f785e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/351cd7c203b14c16b18a2a2e095f785e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/944410fadcfe4bcd9d3ba307bc9893c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/944410fadcfe4bcd9d3ba307bc9893c1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4457,7 +4757,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/317e73badf734e6fbf44e78db5bdc357-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/317e73badf734e6fbf44e78db5bdc357-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db493403a38e4ec08ef68147a243555f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db493403a38e4ec08ef68147a243555f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4504,7 +4804,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c68e5f31cca48939a78cdf98732f1cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c68e5f31cca48939a78cdf98732f1cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e26e18591cb47239c02746364317ad8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e26e18591cb47239c02746364317ad8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4524,7 +4824,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/05d2d7ab59d74b02a14273beca377101-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05d2d7ab59d74b02a14273beca377101-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c006fbfc51c4a3c9ae0cda8afb6a003-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c006fbfc51c4a3c9ae0cda8afb6a003-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4542,7 +4842,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0797fe93ebe5490881dfffc5f7703b06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0797fe93ebe5490881dfffc5f7703b06-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ec648b6fd6d94effb0d67c9d93e94185-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec648b6fd6d94effb0d67c9d93e94185-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4560,7 +4860,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b4c3f4899bfd4606b7626c8cebd3f4d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4c3f4899bfd4606b7626c8cebd3f4d4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/94653ab43c124540b95c907713751390-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94653ab43c124540b95c907713751390-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4618,7 +4918,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1cff5d858ba4652bb0d0dda1d09f812-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1cff5d858ba4652bb0d0dda1d09f812-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89060da6e6c141c6a09b803f58fee526-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89060da6e6c141c6a09b803f58fee526-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4667,7 +4967,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5113aac5b0ab429483b21f20dad4cffe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5113aac5b0ab429483b21f20dad4cffe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/172165f6355d40d182451f12d5e7cfae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/172165f6355d40d182451f12d5e7cfae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4717,7 +5017,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1fb889090d848e09c9b15e509b7cb40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1fb889090d848e09c9b15e509b7cb40-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b31a71f57fa4acda34da56770371903-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b31a71f57fa4acda34da56770371903-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4738,7 +5038,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5dedebdfd24d4fd286cf5d01f9b33bf0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5dedebdfd24d4fd286cf5d01f9b33bf0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a5d5e34746ee4d7ca5e67746db7a2820-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a5d5e34746ee4d7ca5e67746db7a2820-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4789,7 +5089,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2074734af94940e1a14c2aeebdd7a05e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2074734af94940e1a14c2aeebdd7a05e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a10454603a844fcc8d4df0bdffab908f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a10454603a844fcc8d4df0bdffab908f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4839,7 +5139,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb7a03386ddc4304b8394e362a093b25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb7a03386ddc4304b8394e362a093b25-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3f04bc80623c4364a2b4d07ca6126440-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f04bc80623c4364a2b4d07ca6126440-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4889,7 +5189,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/583b6e1352b14b41acade255f1a46837-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/583b6e1352b14b41acade255f1a46837-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2503cbee5c5c4df7a4f1eb5024df416e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2503cbee5c5c4df7a4f1eb5024df416e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4929,7 +5229,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65860b0476974dec9cba63237b5cda0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65860b0476974dec9cba63237b5cda0c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e33e41611d34c6c8cb24a7ca57e21b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e33e41611d34c6c8cb24a7ca57e21b3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4960,10 +5260,10 @@ "dataset = {'p': 19, 'n': 97}\n", "folding = {'n_folds': 3, 'n_repeats': 1}\n", "scores = {'acc': 0.9, 'spec': 0.9, 'sens': 0.6}\n", - "result = check_1_dataset_unknown_folds_mos_scores(dataset=dataset,\n", - " folding=folding,\n", - " scores=scores,\n", - " eps=1e-4)\n", + "result = check_1_dataset_unknown_folds_mos(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", "result['inconsistency']" ] }, diff --git a/notebooks/illustration/04_check_n_datasets_som_kfold_som.ipynb b/notebooks/illustration/binary/04_check_n_datasets_som_kfold_som.ipynb similarity index 69% rename from notebooks/illustration/04_check_n_datasets_som_kfold_som.ipynb rename to notebooks/illustration/binary/04_check_n_datasets_som_kfold_som.ipynb index 4615f9d..f08dad4 100644 --- a/notebooks/illustration/04_check_n_datasets_som_kfold_som.ipynb +++ b/notebooks/illustration/binary/04_check_n_datasets_som_kfold_som.ipynb @@ -7,7 +7,7 @@ "outputs": [], "source": [ "from mlscorecheck.aggregated import generate_experiment, Experiment\n", - "from mlscorecheck.check import check_n_datasets_som_kfold_som_scores" + "from mlscorecheck.check.binary import check_n_datasets_som_kfold_som" ] }, { @@ -19,14 +19,14 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:38,707:INFO:testing acc, feasible tptn pairs: 1099\n", - "2023-10-26 23:38:38,743:INFO:testing sens, feasible tptn pairs: 1097\n", - "2023-10-26 23:38:38,745:INFO:testing spec, feasible tptn pairs: 2\n", - "2023-10-26 23:38:38,746:INFO:testing f1p, feasible tptn pairs: 2\n", - "2023-10-26 23:38:38,746:INFO:testing fm, feasible tptn pairs: 2\n", - "2023-10-26 23:38:38,747:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:38:38,749:INFO:final number of intervals: 2\n", - "2023-10-26 23:38:38,751:INFO:final number of pairs: 4\n" + "2023-11-03 06:35:58,805:INFO:testing acc, feasible tptn pairs: 1099\n", + "2023-11-03 06:35:58,858:INFO:testing sens, feasible tptn pairs: 1097\n", + "2023-11-03 06:35:58,862:INFO:testing spec, feasible tptn pairs: 2\n", + "2023-11-03 06:35:58,863:INFO:testing f1p, feasible tptn pairs: 2\n", + "2023-11-03 06:35:58,864:INFO:testing fm, feasible tptn pairs: 2\n", + "2023-11-03 06:35:58,866:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:35:58,867:INFO:final number of intervals: 2\n", + "2023-11-03 06:35:58,869:INFO:final number of pairs: 4\n" ] }, { @@ -48,9 +48,9 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.631, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414}\n", "\n", - "result = check_n_datasets_som_kfold_som_scores(scores=scores,\n", - " evaluations=evaluations,\n", - " eps=1e-3)\n", + "result = check_n_datasets_som_kfold_som(scores=scores,\n", + " evaluations=evaluations,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, @@ -63,11 +63,11 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:38,768:INFO:testing acc, feasible tptn pairs: 1099\n", - "2023-10-26 23:38:38,800:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:38:38,800:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:38:38,801:INFO:final number of intervals: 0\n", - "2023-10-26 23:38:38,802:INFO:final number of pairs: 0\n" + "2023-11-03 06:35:58,928:INFO:testing acc, feasible tptn pairs: 1099\n", + "2023-11-03 06:35:59,020:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:35:59,023:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:35:59,027:INFO:final number of intervals: 0\n", + "2023-11-03 06:35:59,028:INFO:final number of pairs: 0\n" ] }, { @@ -89,7 +89,7 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.731, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414}\n", "\n", - "result = check_n_datasets_som_kfold_som_scores(scores=scores,\n", + "result = check_n_datasets_som_kfold_som(scores=scores,\n", " evaluations=evaluations,\n", " eps=1e-4/2)\n", "result['inconsistency']" diff --git a/notebooks/illustration/05_check_n_datasets_mos_kfold_som.ipynb b/notebooks/illustration/binary/05_check_n_datasets_mos_kfold_som.ipynb similarity index 80% rename from notebooks/illustration/05_check_n_datasets_mos_kfold_som.ipynb rename to notebooks/illustration/binary/05_check_n_datasets_mos_kfold_som.ipynb index bbf0acf..da040bf 100644 --- a/notebooks/illustration/05_check_n_datasets_mos_kfold_som.ipynb +++ b/notebooks/illustration/binary/05_check_n_datasets_mos_kfold_som.ipynb @@ -6,7 +6,7 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_n_datasets_mos_kfold_som_scores\n", + "from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som\n", "from mlscorecheck.aggregated import Experiment" ] }, @@ -19,10 +19,10 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:48,611:INFO:qynvx: adding lower bound 0.0 for acc\n", - "2023-10-26 23:38:48,613:INFO:qynvx: adding upper bound 0.5 for acc\n", - "2023-10-26 23:38:48,614:INFO:common_datasets.winequality-white-3_vs_7_ssp: adding lower bound 0.0 for acc\n", - "2023-10-26 23:38:48,615:INFO:common_datasets.winequality-white-3_vs_7_ssp: adding upper bound 0.5 for acc\n" + "2023-11-03 07:28:07,181:INFO:fgryy: adding lower bound 0.0 for acc\n", + "2023-11-03 07:28:07,183:INFO:fgryy: adding upper bound 0.5 for acc\n", + "2023-11-03 07:28:07,184:INFO:common_datasets.winequality-white-3_vs_7_qiy: adding lower bound 0.0 for acc\n", + "2023-11-03 07:28:07,185:INFO:common_datasets.winequality-white-3_vs_7_qiy: adding upper bound 0.5 for acc\n" ] }, { @@ -33,7 +33,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e04b00c1cdae4237acefc166ed4fcde3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e04b00c1cdae4237acefc166ed4fcde3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc7cc1689f8943d4b7c2b4ee8e72ef0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc7cc1689f8943d4b7c2b4ee8e72ef0a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 17 COLUMNS\n", @@ -98,10 +98,10 @@ " 'folding': {'n_folds': 5, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}}\n", "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.312, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381}\n", - "result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations,\n", - " dataset_score_bounds={'acc': (0.0, 0.5)},\n", - " eps=1e-4,\n", - " scores=scores)\n", + "result = check_n_datasets_mos_kfold_som(evaluations=evaluations,\n", + " dataset_score_bounds={'acc': (0.0, 0.5)},\n", + " eps=1e-4,\n", + " scores=scores)\n", "result['inconsistency']\n" ] }, @@ -114,10 +114,10 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:48,639:INFO:bhkki: adding lower bound 0.5 for acc\n", - "2023-10-26 23:38:48,641:INFO:bhkki: adding upper bound 1.0 for acc\n", - "2023-10-26 23:38:48,642:INFO:common_datasets.winequality-white-3_vs_7_jws: adding lower bound 0.5 for acc\n", - "2023-10-26 23:38:48,644:INFO:common_datasets.winequality-white-3_vs_7_jws: adding upper bound 1.0 for acc\n" + "2023-11-03 07:28:07,220:INFO:jpqbm: adding lower bound 0.5 for acc\n", + "2023-11-03 07:28:07,222:INFO:jpqbm: adding upper bound 1.0 for acc\n", + "2023-11-03 07:28:07,223:INFO:common_datasets.winequality-white-3_vs_7_kpi: adding lower bound 0.5 for acc\n", + "2023-11-03 07:28:07,225:INFO:common_datasets.winequality-white-3_vs_7_kpi: adding upper bound 1.0 for acc\n" ] }, { @@ -128,7 +128,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8226e670837e4df2a461d2fe01b49243-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8226e670837e4df2a461d2fe01b49243-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/436d49cf8ae14bbf82c80ab3daeacf86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/436d49cf8ae14bbf82c80ab3daeacf86-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 17 COLUMNS\n", @@ -162,10 +162,10 @@ " 'folding': {'n_folds': 3, 'n_repeats': 3, 'strategy': 'stratified_sklearn'}}\n", "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.412, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381}\n", - "result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations,\n", - " dataset_score_bounds={'acc': (0.5, 1.0)},\n", - " eps=1e-4,\n", - " scores=scores)\n", + "result = check_n_datasets_mos_kfold_som(evaluations=evaluations,\n", + " dataset_score_bounds={'acc': (0.5, 1.0)},\n", + " eps=1e-4,\n", + " scores=scores)\n", "result['inconsistency']\n" ] }, @@ -199,7 +199,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab27edd3c0904e13b2652d1eb97993af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab27edd3c0904e13b2652d1eb97993af-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3f430724d2a34971b4aa601c87567ea6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f430724d2a34971b4aa601c87567ea6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -227,9 +227,9 @@ } ], "source": [ - "result = check_n_datasets_mos_kfold_som_scores(evaluations=evaluations,\n", - " eps=1e-4,\n", - " scores=scores)\n", + "result = check_n_datasets_mos_kfold_som(evaluations=evaluations,\n", + " eps=1e-4,\n", + " scores=scores)\n", "result['inconsistency']" ] } diff --git a/notebooks/illustration/06_check_n_datasets_mos_known_folds_mos.ipynb b/notebooks/illustration/binary/06_check_n_datasets_mos_known_folds_mos.ipynb similarity index 79% rename from notebooks/illustration/06_check_n_datasets_mos_known_folds_mos.ipynb rename to notebooks/illustration/binary/06_check_n_datasets_mos_known_folds_mos.ipynb index af6adb3..3ba2187 100644 --- a/notebooks/illustration/06_check_n_datasets_mos_known_folds_mos.ipynb +++ b/notebooks/illustration/binary/06_check_n_datasets_mos_known_folds_mos.ipynb @@ -2,17 +2,17 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_n_datasets_mos_known_folds_mos_scores\n", + "from mlscorecheck.check.binary import check_n_datasets_mos_known_folds_mos\n", "from mlscorecheck.aggregated import Experiment" ] }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -23,7 +23,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/97d3b2d322384729aee6f84dbc67d28b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97d3b2d322384729aee6f84dbc67d28b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b443a865af7d44119a3e1bd681731ade-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b443a865af7d44119a3e1bd681731ade-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -57,7 +57,7 @@ "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n" ] }, @@ -67,7 +67,7 @@ "False" ] }, - "execution_count": 2, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -80,9 +80,9 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.61, 'sens': 0.709, 'spec': 0.461, 'bacc': 0.585}\n", "\n", - "result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, @@ -99,7 +99,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f129d378f794e338ca025f7783bc836-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f129d378f794e338ca025f7783bc836-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/adb9092f188a4abc80efed2e5428d4c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/adb9092f188a4abc80efed2e5428d4c4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -134,9 +134,9 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.71, 'sens': 0.709, 'spec': 0.461}\n", "\n", - "result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, @@ -149,10 +149,10 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:38:59,710:INFO:common_datasets.ecoli_0_2_3_4_vs_5_tpe: adding lower bound 0.8 for sens\n", - "2023-10-26 23:38:59,714:INFO:common_datasets.ecoli_0_2_3_4_vs_5_tpe: adding upper bound 1.0 for sens\n", - "2023-10-26 23:38:59,715:INFO:iynoj: adding lower bound 0.8 for sens\n", - "2023-10-26 23:38:59,717:INFO:iynoj: adding upper bound 1.0 for sens\n" + "2023-11-03 07:00:11,341:INFO:common_datasets.ecoli_0_2_3_4_vs_5_wkx: adding lower bound 0.8 for sens\n", + "2023-11-03 07:00:11,343:INFO:common_datasets.ecoli_0_2_3_4_vs_5_wkx: adding upper bound 1.0 for sens\n", + "2023-11-03 07:00:11,344:INFO:rxnah: adding lower bound 0.8 for sens\n", + "2023-11-03 07:00:11,344:INFO:rxnah: adding upper bound 1.0 for sens\n" ] }, { @@ -163,7 +163,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/51210992e9234859a67a481860a7ca63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/51210992e9234859a67a481860a7ca63-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5985bf8316574586b9b8139f6dce455d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5985bf8316574586b9b8139f6dce455d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 17 COLUMNS\n", @@ -198,10 +198,10 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.532, 'sens': 0.417, 'spec': 0.622, 'bacc': 0.519}\n", "\n", - "result = check_n_datasets_mos_known_folds_mos_scores(evaluations=evaluations,\n", - " dataset_score_bounds={'sens': (0.8, 1.0)},\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_n_datasets_mos_known_folds_mos(evaluations=evaluations,\n", + " dataset_score_bounds={'sens': (0.8, 1.0)},\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] } diff --git a/notebooks/illustration/07_check_n_datasets_mos_unknown_folds_mos.ipynb b/notebooks/illustration/binary/07_check_n_datasets_mos_unknown_folds_mos.ipynb similarity index 83% rename from notebooks/illustration/07_check_n_datasets_mos_unknown_folds_mos.ipynb rename to notebooks/illustration/binary/07_check_n_datasets_mos_unknown_folds_mos.ipynb index 8548602..b6ecfe7 100644 --- a/notebooks/illustration/07_check_n_datasets_mos_unknown_folds_mos.ipynb +++ b/notebooks/illustration/binary/07_check_n_datasets_mos_unknown_folds_mos.ipynb @@ -2,19 +2,20 @@ "cells": [ { "cell_type": "code", - "execution_count": 11, + "execution_count": 6, "metadata": {}, "outputs": [], "source": [ "import numpy as np\n", "\n", - "from mlscorecheck.check import check_n_datasets_mos_unknown_folds_mos_scores, estimate_n_experiments\n", + "from mlscorecheck.check.binary import (check_n_datasets_mos_unknown_folds_mos,\n", + " estimate_n_experiments)\n", "from mlscorecheck.aggregated import generate_experiment, experiment_kfolds_generator" ] }, { "cell_type": "code", - "execution_count": 12, + "execution_count": 7, "metadata": {}, "outputs": [], "source": [ @@ -22,7 +23,7 @@ " rounding_decimals: int,\n", " score_subset: list) -> (dict, dict):\n", " \"\"\"\n", - " Generate one random test case\n", + " Generate one random test case (a small one for illustration)\n", "\n", " Args:\n", " random_seed (int): the random seed to use\n", @@ -68,7 +69,7 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": 8, "metadata": {}, "outputs": [], "source": [ @@ -79,7 +80,7 @@ }, { "cell_type": "code", - "execution_count": 14, + "execution_count": 9, "metadata": {}, "outputs": [ { @@ -90,7 +91,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d653504ba0ce4cb080ccc1652a531bfa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d653504ba0ce4cb080ccc1652a531bfa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/55c6c485ccb24157bd86782b3b667ce3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/55c6c485ccb24157bd86782b3b667ce3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -104,8 +105,8 @@ "Cgl0004I processed model has 4 rows, 10 columns (10 integer (2 of which binary)) and 30 elements\n", "Cbc0031I 3 added rows had average density of 7.3333333\n", "Cbc0013I At root node, 19 cuts changed objective from 0 to 0 in 66 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 28 row cuts average 2.4 elements, 1 column cuts (1 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 356 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 0 (Probing) - 28 row cuts average 2.4 elements, 1 column cuts (1 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 356 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 31 row cuts average 5.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", @@ -114,8 +115,8 @@ "Cbc0001I Search completed - best objective 1e+50, took 395 iterations and 0 nodes (0.02 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 66 times and created 29 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 66 times and created 356 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Probing was tried 66 times and created 29 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Gomory was tried 66 times and created 356 cuts of which 0 were active after adding rounds of cuts (0.003 seconds)\n", "Knapsack was tried 66 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Clique was tried 66 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "MixedIntegerRounding2 was tried 66 times and created 31 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", @@ -138,7 +139,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5ef017fd67042efb47ee433c64609d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5ef017fd67042efb47ee433c64609d4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fed100c604e043f5b0b35f96f1ee18f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fed100c604e043f5b0b35f96f1ee18f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -158,7 +159,7 @@ "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 85 row cuts average 8.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1\n", - "Cbc0014I Cut generator 5 (FlowCover) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 6 (TwoMirCuts) - 83 row cuts average 6.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0001I Search completed - best objective 1e+50, took 256 iterations and 0 nodes (0.02 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", @@ -168,7 +169,7 @@ "Knapsack was tried 53 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Clique was tried 53 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "MixedIntegerRounding2 was tried 53 times and created 85 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "FlowCover was tried 53 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 53 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "TwoMirCuts was tried 53 times and created 83 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", @@ -177,17 +178,17 @@ "No feasible solution found\n", "Enumerated nodes: 0\n", "Total iterations: 256\n", - "Time (CPU seconds): 0.01\n", + "Time (CPU seconds): 0.02\n", "Time (Wallclock seconds): 0.02\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4b29e4a9473452589b0a9115e623527-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4b29e4a9473452589b0a9115e623527-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e82f39d49d314549ad6087b25b84346d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e82f39d49d314549ad6087b25b84346d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -232,7 +233,7 @@ "Time (Wallclock seconds): 0.03\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04\n", + "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03\n", "\n" ] }, @@ -242,7 +243,7 @@ "False" ] }, - "execution_count": 14, + "execution_count": 9, "metadata": {}, "output_type": "execute_result" } @@ -255,15 +256,15 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.343}\n", "\n", - "result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] }, { "cell_type": "code", - "execution_count": 15, + "execution_count": 5, "metadata": {}, "outputs": [ { @@ -274,7 +275,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b57e9c77b7c44317981e7b2f1217c021-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b57e9c77b7c44317981e7b2f1217c021-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/23093f12b01e482b915cb03c1ee3d857-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23093f12b01e482b915cb03c1ee3d857-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -292,7 +293,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/15598fafca034066803c919870c78b9f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/15598fafca034066803c919870c78b9f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bdd54772e22c4ceb9b39ce594dbd1ae8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bdd54772e22c4ceb9b39ce594dbd1ae8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -310,7 +311,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/62e7070fdd3c471e8eb08bffe960e896-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62e7070fdd3c471e8eb08bffe960e896-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db0bbbb5619d4f55ad479bdaffd76d88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db0bbbb5619d4f55ad479bdaffd76d88-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -328,7 +329,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc2779b6254644beb772058bd12bf6fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc2779b6254644beb772058bd12bf6fd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/079658630ecd4616a2b0683082df280b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/079658630ecd4616a2b0683082df280b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -346,7 +347,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34abc58e86e94ae2a58ea1b666721b4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34abc58e86e94ae2a58ea1b666721b4e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae22778f2e744357ace74d50d2a9d9dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae22778f2e744357ace74d50d2a9d9dd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -364,7 +365,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e139d893b8d443eb4a931f2500bcc2d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e139d893b8d443eb4a931f2500bcc2d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57aa49d6eae144ba8626e875ea20ce57-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57aa49d6eae144ba8626e875ea20ce57-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -382,7 +383,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/198202d992684e26a8b6d73358fbc907-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/198202d992684e26a8b6d73358fbc907-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a02a3e7efec45dc8b07c76ed0b10d40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a02a3e7efec45dc8b07c76ed0b10d40-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -400,7 +401,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3447325704b4bf2a0be6cd23db2a1e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3447325704b4bf2a0be6cd23db2a1e6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/519dbef4e720491b89f1d016cff48d57-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/519dbef4e720491b89f1d016cff48d57-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -418,7 +419,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d81dfbbc5e34da7a430d702715201c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d81dfbbc5e34da7a430d702715201c3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4f9affb54776412bad2ef176c4367b2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f9affb54776412bad2ef176c4367b2e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -436,7 +437,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8843a76ed9341c7b6bc02ff10480009-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8843a76ed9341c7b6bc02ff10480009-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c1db037bb7c4d4fb89ad2d83efd4d31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c1db037bb7c4d4fb89ad2d83efd4d31-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -454,7 +455,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/97c2c9a1a73f4e9185e5c20d05e500f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97c2c9a1a73f4e9185e5c20d05e500f9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf35336d489e4ef98ebcbf4a72876421-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf35336d489e4ef98ebcbf4a72876421-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -472,7 +473,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cafdae8c00e5458c900355369b622292-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cafdae8c00e5458c900355369b622292-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46f58515ff6643439dbb589c0f77a3a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46f58515ff6643439dbb589c0f77a3a9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -490,7 +491,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b0e18bf6b2584758ab7eccb48651d684-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0e18bf6b2584758ab7eccb48651d684-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/afc3bf4f745846fd978dc32443f76f2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afc3bf4f745846fd978dc32443f76f2a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -508,7 +509,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/26efa7c4db3b4a88bdd4f764becbec11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26efa7c4db3b4a88bdd4f764becbec11-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e3412658131d41659b256704637e32b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3412658131d41659b256704637e32b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -526,7 +527,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2059520b794141e69b372e5a18a4ebcc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2059520b794141e69b372e5a18a4ebcc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eaf04ac4b7c54baaa71be6118a7ef69d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eaf04ac4b7c54baaa71be6118a7ef69d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -544,7 +545,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b18fa88dda5640d39eaa2603dd166575-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b18fa88dda5640d39eaa2603dd166575-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c70ebd30e3f34658903af7ffdd600aa3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c70ebd30e3f34658903af7ffdd600aa3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -562,7 +563,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59bec70ea2594e1aa6472c57fb906c84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59bec70ea2594e1aa6472c57fb906c84-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8cb6a9d03fe343d0a1eb6ef7ecd6f866-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8cb6a9d03fe343d0a1eb6ef7ecd6f866-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -580,7 +581,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ca535e076384159b4c754a44f09fabb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ca535e076384159b4c754a44f09fabb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/466beb8a16424366b6580e5561520e3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/466beb8a16424366b6580e5561520e3e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -598,7 +599,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e9110f66c8745dd9b734e7854ecdd66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e9110f66c8745dd9b734e7854ecdd66-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1eae64cbfeb4876bf62bf6a9ddb763b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1eae64cbfeb4876bf62bf6a9ddb763b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -616,7 +617,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1bcb344d4f7944e18c4edd688a83aa5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1bcb344d4f7944e18c4edd688a83aa5f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/28216f90e66947638f4740255da561ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28216f90e66947638f4740255da561ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -634,7 +635,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bb5a131af0f146bb9bff1fd8a9a6e1f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bb5a131af0f146bb9bff1fd8a9a6e1f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/393dd328cbab4ad99be5cd38000793d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/393dd328cbab4ad99be5cd38000793d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -652,7 +653,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34345363aabd4c33b05726f187c08530-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34345363aabd4c33b05726f187c08530-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ecb9c8b45bd42079c359977ab0a8fcd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ecb9c8b45bd42079c359977ab0a8fcd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -670,7 +671,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9e7df62dd454e1d9ec389f5218e6961-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9e7df62dd454e1d9ec389f5218e6961-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db905d5bbb234d57887e56ad405283e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db905d5bbb234d57887e56ad405283e9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -688,7 +689,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c02a337bc76f4e168d016fcd700d3d15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c02a337bc76f4e168d016fcd700d3d15-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/541c91b54bda451c96be05a0349ee18e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/541c91b54bda451c96be05a0349ee18e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -706,7 +707,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2e61d716e0749fbb0e3279772205931-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2e61d716e0749fbb0e3279772205931-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/375d9f6e107b48ce93c7b7d88b45d877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/375d9f6e107b48ce93c7b7d88b45d877-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -724,7 +725,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ac24836ece4a447b950ff1f34b07be4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac24836ece4a447b950ff1f34b07be4a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a280a2df1234928966c8d7cb7a23e73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a280a2df1234928966c8d7cb7a23e73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -742,7 +743,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a6e82ecb6d16452ab0d12ceb8d91aae6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6e82ecb6d16452ab0d12ceb8d91aae6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6489e1ac6204ab9a102e3bf7eeead6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6489e1ac6204ab9a102e3bf7eeead6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -760,7 +761,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f125a350ccd5407c972824ed1c417b8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f125a350ccd5407c972824ed1c417b8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68dd3562279641bb9661de2a5141a561-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68dd3562279641bb9661de2a5141a561-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -778,7 +779,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32674d6ce68047caac91c895324b7fd6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32674d6ce68047caac91c895324b7fd6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1bf38c3ef7fb4855a0f038390eea9831-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1bf38c3ef7fb4855a0f038390eea9831-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -796,7 +797,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/094d25c6e3884108ac42ea4b198acf75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/094d25c6e3884108ac42ea4b198acf75-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d4ce0e8ba84741a7a2ae24ae0b73115e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4ce0e8ba84741a7a2ae24ae0b73115e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -814,7 +815,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8273d7b54b7540f7bf8e6d988d26120c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8273d7b54b7540f7bf8e6d988d26120c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b92fe8ff557f42dfbf75cf82a3a06775-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b92fe8ff557f42dfbf75cf82a3a06775-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -832,7 +833,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/52e074a7eba241dd87f8428be3bb3311-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52e074a7eba241dd87f8428be3bb3311-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0e760e6a0f6542d3898f5f2d3f7a8065-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e760e6a0f6542d3898f5f2d3f7a8065-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -850,7 +851,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c59f0965d5e47999fb53458d198cd58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c59f0965d5e47999fb53458d198cd58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b4a5940c0de4046a8d471e3ae547891-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b4a5940c0de4046a8d471e3ae547891-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -868,7 +869,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d19b817483c4bf78f667217b13c3319-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d19b817483c4bf78f667217b13c3319-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3fe183081c1480a8df2e8f35f47d866-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3fe183081c1480a8df2e8f35f47d866-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -886,7 +887,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c2519a8d1e7f49488b07bf8f2e59a84b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2519a8d1e7f49488b07bf8f2e59a84b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb94fa6895724dd78f52f7cd7475cc42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb94fa6895724dd78f52f7cd7475cc42-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -904,7 +905,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57e6c619d4904f64bf19a0c14b5e58fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57e6c619d4904f64bf19a0c14b5e58fc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1fe0a56ff16549d5a6a5ac052d0f7d85-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1fe0a56ff16549d5a6a5ac052d0f7d85-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -922,7 +923,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d88a5da00d64290b26a200adca94040-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d88a5da00d64290b26a200adca94040-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/40bb20e0c08c4553a6c3d754168c9012-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40bb20e0c08c4553a6c3d754168c9012-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -940,7 +941,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1a022ca1a2ab4af0a062ed963c9659c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a022ca1a2ab4af0a062ed963c9659c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cee70028a77a45d7b6ee6a6ce91c91a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cee70028a77a45d7b6ee6a6ce91c91a6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -958,7 +959,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a2247d21885f40879bfceb9ed4ccd4f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2247d21885f40879bfceb9ed4ccd4f0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/310f015955384a5082e924861d53acec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/310f015955384a5082e924861d53acec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -976,7 +977,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b511407b856f4bc5a4cb759aceecaf16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b511407b856f4bc5a4cb759aceecaf16-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f94cea2531654e7ca71a6ffbb850475c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f94cea2531654e7ca71a6ffbb850475c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -994,7 +995,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02217a9df1ac49e3aee81afe7da2bfdb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02217a9df1ac49e3aee81afe7da2bfdb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d2594ead766044b98493fec26f038f4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d2594ead766044b98493fec26f038f4e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1012,7 +1013,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f7ecab44b3b9475fb16de6a4f0c56840-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7ecab44b3b9475fb16de6a4f0c56840-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa17961335dc4cc28a4433a3476452cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa17961335dc4cc28a4433a3476452cf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1030,7 +1031,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cdbfa26ea1354c04bd83308ff6a66b1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdbfa26ea1354c04bd83308ff6a66b1f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/412119882007463fb71e6195b214ad88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/412119882007463fb71e6195b214ad88-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1048,7 +1049,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/abc58a10ac864ff282d3ff59f8c899ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abc58a10ac864ff282d3ff59f8c899ef-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9e60440836ee4a19a4e8289229d084d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e60440836ee4a19a4e8289229d084d9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1066,7 +1067,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f5ceb2c455c4605933be1d1f2089f16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f5ceb2c455c4605933be1d1f2089f16-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e83cdc426c0844f889a2e445530e950f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e83cdc426c0844f889a2e445530e950f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1084,7 +1085,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e53a3e500cd0482b97bf0436c8c3ce5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e53a3e500cd0482b97bf0436c8c3ce5f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4562f3a1b9ac419b8a8d2946787db8b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4562f3a1b9ac419b8a8d2946787db8b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1102,7 +1103,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f18735bd9f8345fe9b448169cebf9c89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f18735bd9f8345fe9b448169cebf9c89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60a3d7709a484fd990ae25b47e2b0105-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60a3d7709a484fd990ae25b47e2b0105-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1115,18 +1116,12 @@ "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", - "\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ + "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/74ba6b3661e94eeead35589e53b3f54b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74ba6b3661e94eeead35589e53b3f54b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f45b9a020bb04ddd91207b1c675880a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f45b9a020bb04ddd91207b1c675880a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1144,7 +1139,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27fb1c91f55e4b8c8f6fad7b4a586bc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27fb1c91f55e4b8c8f6fad7b4a586bc5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/91a2b71cc19840eb8dba9e12d419fa76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91a2b71cc19840eb8dba9e12d419fa76-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1162,7 +1157,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa66366485764fab950eba0818ff1544-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa66366485764fab950eba0818ff1544-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f51f291f2fb4f548f59934760809631-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f51f291f2fb4f548f59934760809631-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1180,7 +1175,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d295e745d0cb4c7caa0ba0b386294478-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d295e745d0cb4c7caa0ba0b386294478-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b0c3c1288f3743689776661e0ab9a6bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0c3c1288f3743689776661e0ab9a6bd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1198,7 +1193,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/025ba3da5cca4117b48c00df72f0147f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/025ba3da5cca4117b48c00df72f0147f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/01abf9cb5b4f4645974c82012bba82a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01abf9cb5b4f4645974c82012bba82a9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1216,7 +1211,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbbd42bfc47046fc97ac8e98c8b187e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbbd42bfc47046fc97ac8e98c8b187e8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe5b994445c148cd9cb76a8ae92546c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe5b994445c148cd9cb76a8ae92546c3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1234,7 +1229,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad7e9d79a6944b51827c56b8291212bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad7e9d79a6944b51827c56b8291212bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f59bf623fcd4da5b59faa367e46c775-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f59bf623fcd4da5b59faa367e46c775-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1252,7 +1247,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db432cfe49ee45f8a362ffbc01bb9625-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db432cfe49ee45f8a362ffbc01bb9625-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9eb3cc2799e344e4bce90bf2239f49f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9eb3cc2799e344e4bce90bf2239f49f9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1270,7 +1265,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7172143035c646e586ae138c4660e7f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7172143035c646e586ae138c4660e7f0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1dcf94b9c8004b3f99abf8934612e4b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1dcf94b9c8004b3f99abf8934612e4b0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1288,7 +1283,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/126b65a895d8463db1a7d0e075ec7961-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/126b65a895d8463db1a7d0e075ec7961-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a94dc53ee3d4424f829088846f63f666-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a94dc53ee3d4424f829088846f63f666-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1306,7 +1301,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2620bdef85df4223955f5683c5a96ad8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2620bdef85df4223955f5683c5a96ad8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58eb0804cad04daa9fe49967fe97eb79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58eb0804cad04daa9fe49967fe97eb79-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1324,7 +1319,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8768e555565646bc8fbce6acadbaa892-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8768e555565646bc8fbce6acadbaa892-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3dde636948f4bf5b228a54291243f8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3dde636948f4bf5b228a54291243f8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1342,7 +1337,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f7e6ff58f40c485fac1b5006f785e192-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7e6ff58f40c485fac1b5006f785e192-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/95dd9c10c7c84e2b82442da5274a9aaf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/95dd9c10c7c84e2b82442da5274a9aaf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1360,7 +1355,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/069d71669ce74cad9a89107f0ec25e0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/069d71669ce74cad9a89107f0ec25e0c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cce3178ffb024d4b80fc0c3d6d478e09-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cce3178ffb024d4b80fc0c3d6d478e09-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1378,7 +1373,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc2d3f9ccb6c4852be29851147602a5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc2d3f9ccb6c4852be29851147602a5c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0aeade5564f5404287bf2078b0732cb9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0aeade5564f5404287bf2078b0732cb9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1396,7 +1391,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24d97df2890e44e48265d929e630bb8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24d97df2890e44e48265d929e630bb8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d29bfdb4ce40425c84a4eaef31bed7d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d29bfdb4ce40425c84a4eaef31bed7d5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1414,7 +1409,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53dc00251ab443eea1dcc8c11d0531f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53dc00251ab443eea1dcc8c11d0531f9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3d614537cada4eb697d0735cb111e4a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d614537cada4eb697d0735cb111e4a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1432,7 +1427,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c3ab5ba471224d248fd68aa935f471c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3ab5ba471224d248fd68aa935f471c3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/342fb309275a4e02934731c3c23bc72f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/342fb309275a4e02934731c3c23bc72f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1450,7 +1445,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a17e94e8950c4cfc84199c3a871ff350-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a17e94e8950c4cfc84199c3a871ff350-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44cdd0a08fba402ab38499af0cbc140e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44cdd0a08fba402ab38499af0cbc140e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1468,7 +1463,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e03de38a22674c319f7e4ba8d145c642-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e03de38a22674c319f7e4ba8d145c642-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b036c6f2a203437a9d106c7bb9164df4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b036c6f2a203437a9d106c7bb9164df4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1486,7 +1481,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efbee9c2490f461bb06c0a7cff47827a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efbee9c2490f461bb06c0a7cff47827a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68edbc3b857b4eb1a873e48a3e8bf9a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68edbc3b857b4eb1a873e48a3e8bf9a7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1504,7 +1499,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b0a10642db394ca285a9b77cef284723-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0a10642db394ca285a9b77cef284723-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/219740b819ac4a0494b04fb573ec3abf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/219740b819ac4a0494b04fb573ec3abf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1522,7 +1517,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ebaa9a48a2804c718b4c4ad323ed91c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ebaa9a48a2804c718b4c4ad323ed91c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f731cc3f1e6344f1b8b1262d54fb19fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f731cc3f1e6344f1b8b1262d54fb19fb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1540,7 +1535,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a511bd02d5f497893972a573d04de4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a511bd02d5f497893972a573d04de4e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58c3bcbe687649e3add14f5318d08cca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58c3bcbe687649e3add14f5318d08cca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1558,7 +1553,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c3b12961eea4ab3bd73f5435cbf540a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c3b12961eea4ab3bd73f5435cbf540a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/08fc6a2101954edcb946e9a93b22de96-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08fc6a2101954edcb946e9a93b22de96-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1576,7 +1571,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/684499b789ce475a807cff216b95d144-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/684499b789ce475a807cff216b95d144-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a0d49202e3354438aed88d9d5cd751a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0d49202e3354438aed88d9d5cd751a2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1594,7 +1589,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/22d779641b284968b4646bacd7cdcf72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22d779641b284968b4646bacd7cdcf72-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bb09c23563294e4d9d0f278d986b498b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bb09c23563294e4d9d0f278d986b498b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1612,7 +1607,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/55393829b85d4a81934a8fc754be7f14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/55393829b85d4a81934a8fc754be7f14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0070b91292d74f909758c60f93c9a698-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0070b91292d74f909758c60f93c9a698-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1630,7 +1625,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21f599ab0ed3400bad94c412fd8c0d20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21f599ab0ed3400bad94c412fd8c0d20-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f1cc7c8f17e49cc97e7c557cecafab4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f1cc7c8f17e49cc97e7c557cecafab4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1648,7 +1643,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1983452c55c48558c814b2268219aba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1983452c55c48558c814b2268219aba-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9fbac9fec9c2441db9f196ceb9978be9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9fbac9fec9c2441db9f196ceb9978be9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1666,7 +1661,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/12ddc35f4dc149ffa37a9c068ad7ad4f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12ddc35f4dc149ffa37a9c068ad7ad4f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f8ed6583da04f05b2e7e598f13352d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f8ed6583da04f05b2e7e598f13352d2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1684,7 +1679,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/530e720cd4bd45f39f45d87d0da25551-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/530e720cd4bd45f39f45d87d0da25551-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/407984eba2a748249628d402b65637d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/407984eba2a748249628d402b65637d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1702,7 +1697,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f46d6afb7f0a4e3cb86bca8337d0bce2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f46d6afb7f0a4e3cb86bca8337d0bce2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f54caace76744ab69b87711fe62b8337-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f54caace76744ab69b87711fe62b8337-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1720,7 +1715,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b406bd1b7964263998681dc4d5204d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b406bd1b7964263998681dc4d5204d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f119458f27064763b66cf31134391c1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f119458f27064763b66cf31134391c1a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1738,7 +1733,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/17750a6ca6d14832b9ca4401a8c9e767-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17750a6ca6d14832b9ca4401a8c9e767-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30b7d7027b054332880b198590f00ec9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30b7d7027b054332880b198590f00ec9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1756,7 +1751,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc19f1a9bcac49a981d6b424a14f95cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc19f1a9bcac49a981d6b424a14f95cf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/256f8566f84e4f5ba33d08baf743a232-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/256f8566f84e4f5ba33d08baf743a232-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1774,7 +1769,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae07714a834b4769a109dcbef741db1c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae07714a834b4769a109dcbef741db1c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d4e1ae7285c416a9ce6c1093ab80e8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d4e1ae7285c416a9ce6c1093ab80e8a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1792,7 +1787,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/49d007b8b9de47949689a7e11e960674-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49d007b8b9de47949689a7e11e960674-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a537bd71063b41899fafc500e26f91fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a537bd71063b41899fafc500e26f91fb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1810,7 +1805,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd4b1906605d441f9348b80fe9b75788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd4b1906605d441f9348b80fe9b75788-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f94ffe323b943ed9756dcc64a2176da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f94ffe323b943ed9756dcc64a2176da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1828,7 +1823,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e643cea499cc438b886705c0fcd93e77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e643cea499cc438b886705c0fcd93e77-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b72be2e0a834d21a28895b37446176e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b72be2e0a834d21a28895b37446176e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1846,7 +1841,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e73e41bf74b243efaddc52b3989ec1d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e73e41bf74b243efaddc52b3989ec1d5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/796e90be2c7c4f97b5d07deb6492f29b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/796e90be2c7c4f97b5d07deb6492f29b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1864,7 +1859,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4384c97e7054751bce65be5ec02898e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4384c97e7054751bce65be5ec02898e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1360c5305fb24b89bce685c28cd89bb6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1360c5305fb24b89bce685c28cd89bb6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1882,7 +1877,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93fdff1e0e0a46db9e3790fa96e68c39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93fdff1e0e0a46db9e3790fa96e68c39-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e89ea13d0624e0ebbb76d08eeb4615b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e89ea13d0624e0ebbb76d08eeb4615b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1900,7 +1895,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f573087e6d9a473b9c8197d8eb959b6c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f573087e6d9a473b9c8197d8eb959b6c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/11808b9815e345d5a990e3e3c41ecb50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11808b9815e345d5a990e3e3c41ecb50-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1918,7 +1913,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8ef046b0f30470980e89b4de16cca03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8ef046b0f30470980e89b4de16cca03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cef72d14eb664acdb80d3ddc2c53e274-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cef72d14eb664acdb80d3ddc2c53e274-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1936,7 +1931,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1101178d4e649bd970f72445964f375-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1101178d4e649bd970f72445964f375-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/736137c1b70846b6ac02d6d3b0676769-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/736137c1b70846b6ac02d6d3b0676769-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1954,7 +1949,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8fc9475a80c148389df01cc8ea8815a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8fc9475a80c148389df01cc8ea8815a9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c94f7ae874324a12bb1b2c428fdd1463-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c94f7ae874324a12bb1b2c428fdd1463-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1972,7 +1967,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd48d70be4ea493199f4650caed6bc41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd48d70be4ea493199f4650caed6bc41-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/232d1bcc207e4e59b80e7998fa4c6d52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/232d1bcc207e4e59b80e7998fa4c6d52-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -1990,7 +1985,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b016bcb92f9c46d78e01df78eaa28bdf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b016bcb92f9c46d78e01df78eaa28bdf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a7c1141c4820496c87e5116dffcfae86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7c1141c4820496c87e5116dffcfae86-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2008,7 +2003,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f28c5361bc8c4e21bd63776bbe401a0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f28c5361bc8c4e21bd63776bbe401a0f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42d53183ecb94ffcba49894a697c665d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42d53183ecb94ffcba49894a697c665d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2026,7 +2021,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b4c73192cd94a6fa8ad755a59061a03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b4c73192cd94a6fa8ad755a59061a03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5db009ce416c4de4bf118f41d8bb8b9e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5db009ce416c4de4bf118f41d8bb8b9e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2044,7 +2039,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6517b7323f9a4f1b956176b5aa40042c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6517b7323f9a4f1b956176b5aa40042c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78ebe7e2aee340c2a4ef85ed5f5bdf66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78ebe7e2aee340c2a4ef85ed5f5bdf66-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2062,7 +2057,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a99abe43060040aa8e8f6644f10ffd8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a99abe43060040aa8e8f6644f10ffd8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6bba530d4b7a4b088a83cef4367a8c6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bba530d4b7a4b088a83cef4367a8c6d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2080,7 +2075,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dee60752bbff49e08e0be4c32d7b64b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dee60752bbff49e08e0be4c32d7b64b2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa7f67a4a7054435a02b03cb8c6d46b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa7f67a4a7054435a02b03cb8c6d46b1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2098,7 +2093,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5890444ea61b4f05b7f2d36f9044d33a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5890444ea61b4f05b7f2d36f9044d33a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/686cd97c810641ada35a3239d354926e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/686cd97c810641ada35a3239d354926e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2116,7 +2111,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/52e74e6ecf5748f58d9be8ab609ae8dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52e74e6ecf5748f58d9be8ab609ae8dd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6abcc104f7f046b38d37e17d54facec5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6abcc104f7f046b38d37e17d54facec5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2134,7 +2129,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc526f6be79d47d0b6a710638fa86b30-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc526f6be79d47d0b6a710638fa86b30-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b838c45c6fa14b1693266d40a86e68ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b838c45c6fa14b1693266d40a86e68ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2152,7 +2147,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9641f169d12540fdb2e6d0f10e888fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9641f169d12540fdb2e6d0f10e888fae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7127900fa0444dc881610d773e1f1353-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7127900fa0444dc881610d773e1f1353-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2170,7 +2165,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38049d794d7c433687cb4982f51b5e73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38049d794d7c433687cb4982f51b5e73-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4cbad13ccffe45edb6244ce85dfe3029-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4cbad13ccffe45edb6244ce85dfe3029-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2188,7 +2183,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a0cca23b1db941b782784b827763a5d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0cca23b1db941b782784b827763a5d5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b8ef45427174ff093b784ecbe757a92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b8ef45427174ff093b784ecbe757a92-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2206,7 +2201,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/034391e073fe4a0a87ee2b5a67bf4ab2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/034391e073fe4a0a87ee2b5a67bf4ab2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0c91ef81da704db2ac5fbc6d3fa5a8e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c91ef81da704db2ac5fbc6d3fa5a8e8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2224,7 +2219,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a4f7f7f386af41ff8cf567f0dcda907c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4f7f7f386af41ff8cf567f0dcda907c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2bcefe2b908649f68a604582467239a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2bcefe2b908649f68a604582467239a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2242,7 +2237,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e194d3510cec4f969a0b3bd5a7b3a21a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e194d3510cec4f969a0b3bd5a7b3a21a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/748d20472727493194212955601d0590-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/748d20472727493194212955601d0590-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2260,7 +2255,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f55ccc2ce8ae4579964049ec1a81f146-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f55ccc2ce8ae4579964049ec1a81f146-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84b9cba56871416bbc92e5bbc0ba485f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84b9cba56871416bbc92e5bbc0ba485f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2278,7 +2273,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83291c780aa14b6485b6ed665a64285c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83291c780aa14b6485b6ed665a64285c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34691c960dd140a98561bb9bd66e41ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34691c960dd140a98561bb9bd66e41ac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2296,7 +2291,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42b6fff605fb46c99049457f45768c80-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42b6fff605fb46c99049457f45768c80-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c9929b0d775044b3ab345d37879460a5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9929b0d775044b3ab345d37879460a5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2314,7 +2309,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4c80fbd1fe864041ad4b2abf623af24b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4c80fbd1fe864041ad4b2abf623af24b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32d6ab55ca514f7993eb93504e331d3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32d6ab55ca514f7993eb93504e331d3e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2332,7 +2327,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/06af18e2d7734931ac4e5e1b4cd5b249-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06af18e2d7734931ac4e5e1b4cd5b249-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cff9a8d04cf84aa98dee5ccda881b13b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cff9a8d04cf84aa98dee5ccda881b13b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2350,7 +2345,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a504f47634094bedaae30daa56539801-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a504f47634094bedaae30daa56539801-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba8f00963edb4e498b36c98bf850f3c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba8f00963edb4e498b36c98bf850f3c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2368,7 +2363,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/441fb098fb6b41a2a7c146964e489464-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/441fb098fb6b41a2a7c146964e489464-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65233d66b3b342d9a75c2b1b963d237b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65233d66b3b342d9a75c2b1b963d237b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2386,7 +2381,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3879e2074bcf4ab1999abf3b251f8b6e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3879e2074bcf4ab1999abf3b251f8b6e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9b21d43abfb40dfa4af482525fa20fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9b21d43abfb40dfa4af482525fa20fa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2404,7 +2399,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/972d4f589fda4057a2175bfe887da8c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/972d4f589fda4057a2175bfe887da8c2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d262a763e21f4b3495ec7414fa5e4849-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d262a763e21f4b3495ec7414fa5e4849-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2422,7 +2417,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/765a9d0300ac438c88696329979ca511-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/765a9d0300ac438c88696329979ca511-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef890e60e5ce4829b56133004b6df4ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef890e60e5ce4829b56133004b6df4ad-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2440,7 +2435,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53cfc1e8d94344e7abba55c4d7531035-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53cfc1e8d94344e7abba55c4d7531035-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53a647c67c98495da29231b05913d6a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53a647c67c98495da29231b05913d6a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2458,7 +2453,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a78f4d034b1d46c5b332f6b52d4ae4a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a78f4d034b1d46c5b332f6b52d4ae4a2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a7c5dacc8154fa7a6b47bf5e5a311b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a7c5dacc8154fa7a6b47bf5e5a311b0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2476,7 +2471,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae7cd408342a4219978f96504f7e8f54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae7cd408342a4219978f96504f7e8f54-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4680b192a9234eb5abeddef936e82d11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4680b192a9234eb5abeddef936e82d11-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2494,7 +2489,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b785fc1dfc6a4113b2973b725d28cd8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b785fc1dfc6a4113b2973b725d28cd8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/25003bb0871a43aaa251a7080669730c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/25003bb0871a43aaa251a7080669730c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2512,7 +2507,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/10eb4d48123a45ebb01a05ba07f45c84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10eb4d48123a45ebb01a05ba07f45c84-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e15a59c081c4ff2a7690a7a45cf9578-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e15a59c081c4ff2a7690a7a45cf9578-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2530,7 +2525,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b600bda52e3948caa02c8c7ba8ed9fee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b600bda52e3948caa02c8c7ba8ed9fee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8aed1c1fa05740988e30291f7ae747dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8aed1c1fa05740988e30291f7ae747dc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2548,7 +2543,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/06445bafbb5045c8bfbd709aaa761b30-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06445bafbb5045c8bfbd709aaa761b30-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fef51fbea2bb4cafba45c3aefa2648a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fef51fbea2bb4cafba45c3aefa2648a0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2566,7 +2561,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/228cb5e5895243ee828b817302cf33b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/228cb5e5895243ee828b817302cf33b4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/042fe4afb8cb4392b9feb5d62b72910f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/042fe4afb8cb4392b9feb5d62b72910f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2584,7 +2579,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f06b8b9a7f240459879863e3cb22701-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f06b8b9a7f240459879863e3cb22701-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/63929188fd574e279fcf480ed035db76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63929188fd574e279fcf480ed035db76-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2602,7 +2597,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dcd8479162de42f0b37b20b37914c4f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dcd8479162de42f0b37b20b37914c4f3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18add36462ac4727b78c06a748fa001c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18add36462ac4727b78c06a748fa001c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2620,7 +2615,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1100ede1c59b400f8add267988d30586-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1100ede1c59b400f8add267988d30586-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ad0bb63304e43a4b5abb02697c3cb10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ad0bb63304e43a4b5abb02697c3cb10-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2638,7 +2633,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/653ecf819919416588f059d28276f02d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/653ecf819919416588f059d28276f02d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1dd7ff6925cb4987a68a96bb894a3daf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1dd7ff6925cb4987a68a96bb894a3daf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2656,7 +2651,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f32aa0adcad949a696dbb76c57c7ea06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f32aa0adcad949a696dbb76c57c7ea06-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/443dad444dac4c7fb4e10b16b75f9d77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/443dad444dac4c7fb4e10b16b75f9d77-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2674,7 +2669,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87a52eb638944df1be25e0d582db5129-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87a52eb638944df1be25e0d582db5129-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/604afdfa1ecf4c1389351814ac5c6ef1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/604afdfa1ecf4c1389351814ac5c6ef1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2692,7 +2687,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1316bde0493048f8a7fae38bc2ccfd1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1316bde0493048f8a7fae38bc2ccfd1f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/186d303d0e9e40999bd0f097336873a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/186d303d0e9e40999bd0f097336873a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2710,7 +2705,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a1f9e9caa65459d83701032e650013b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a1f9e9caa65459d83701032e650013b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/928d4c1458f84dca90b63cad79704dd6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/928d4c1458f84dca90b63cad79704dd6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2728,7 +2723,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/585259875e9f46c7ba677538ba7da3cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/585259875e9f46c7ba677538ba7da3cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a83c8d730f1443c3a1ed15c05cf63f61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a83c8d730f1443c3a1ed15c05cf63f61-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2746,7 +2741,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d369d413df204897b87109d8ed4cbb3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d369d413df204897b87109d8ed4cbb3e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2df9f35cb0f44a73bd84e944cf7ee42e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2df9f35cb0f44a73bd84e944cf7ee42e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2764,7 +2759,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a441a6faa8b446478ec3b3b578d0b00b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a441a6faa8b446478ec3b3b578d0b00b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71bdb4191a5b40d08214fa68c823779b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71bdb4191a5b40d08214fa68c823779b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2782,7 +2777,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1c49c14f1a74edc838793a9c79627c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1c49c14f1a74edc838793a9c79627c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf1133d958454f91b102f8ac4d460d45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf1133d958454f91b102f8ac4d460d45-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2800,7 +2795,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df7541621abe4f55b232da5e07be0d80-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df7541621abe4f55b232da5e07be0d80-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ced2f18874c4fb999eadc85add9e593-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ced2f18874c4fb999eadc85add9e593-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2818,7 +2813,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/144bb6b9170c4ef284baa2240cd2bc07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/144bb6b9170c4ef284baa2240cd2bc07-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18dd10093ffc496487e8497cd82b0569-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18dd10093ffc496487e8497cd82b0569-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2836,7 +2831,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6fe7c9999579448981eb8bae9864d058-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fe7c9999579448981eb8bae9864d058-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/40eacf6832c647f9a5c434ddd116bbcf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40eacf6832c647f9a5c434ddd116bbcf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2854,7 +2849,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fea1206933f2435fabb71343aad4a526-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fea1206933f2435fabb71343aad4a526-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed242c4c9b8e46e28a4a3f273d8449ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed242c4c9b8e46e28a4a3f273d8449ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2872,7 +2867,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3af2484543e14cfbb9978d63c4cd6bcc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3af2484543e14cfbb9978d63c4cd6bcc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa3a7359555042598cc62488f83e7f2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa3a7359555042598cc62488f83e7f2c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2890,7 +2885,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34f46d4b06094809a7d1c2b17cfefd08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34f46d4b06094809a7d1c2b17cfefd08-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/358588484a3d4d32ae4d788c1b2ba6a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/358588484a3d4d32ae4d788c1b2ba6a3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2908,7 +2903,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d85213160fa4b468508e537dd60635e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d85213160fa4b468508e537dd60635e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0aafcf320e7f44e1903d04fc937663b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0aafcf320e7f44e1903d04fc937663b4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2926,7 +2921,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d45a6a843d354e81be652897d7431a77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d45a6a843d354e81be652897d7431a77-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/995755b5a4a54a80a75a184d5b2bfe22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/995755b5a4a54a80a75a184d5b2bfe22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2944,7 +2939,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e558e6ce838c40b2b74704c9cfa8f41c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e558e6ce838c40b2b74704c9cfa8f41c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/729b1f2e203b480483b7b24925411fa4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/729b1f2e203b480483b7b24925411fa4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2962,7 +2957,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d681550294c546f68c19b7ef76eb3102-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d681550294c546f68c19b7ef76eb3102-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bd6817ceafb469a96dbb0a8eae715f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bd6817ceafb469a96dbb0a8eae715f3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2980,7 +2975,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82310f4d2afb445b91a6d3c9a7a759bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82310f4d2afb445b91a6d3c9a7a759bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/254bcb4b40404789853175466be0a699-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/254bcb4b40404789853175466be0a699-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -2998,7 +2993,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fb3560ee6c754017b71a87fbb34b2fb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb3560ee6c754017b71a87fbb34b2fb0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c46d7afd763479eae8f8c7a6608373d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c46d7afd763479eae8f8c7a6608373d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3016,7 +3011,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/abaf21ba5ac14c86a2b742be9a1f696b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abaf21ba5ac14c86a2b742be9a1f696b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b365971578054e2a9c2bd69e82139aea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b365971578054e2a9c2bd69e82139aea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3034,7 +3029,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6de0af156f1c433395c8890ce9abd0ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6de0af156f1c433395c8890ce9abd0ee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de703bc0df0546c1a14c09dfe4a6bac8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de703bc0df0546c1a14c09dfe4a6bac8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3052,7 +3047,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83c6dd419c4a4267a7808b47f1b3ace5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83c6dd419c4a4267a7808b47f1b3ace5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ff5eeeebfc414ffc89f965d6906bf3b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff5eeeebfc414ffc89f965d6906bf3b3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3070,7 +3065,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c275c5be8cb45639c503188f98e9701-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c275c5be8cb45639c503188f98e9701-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f043a20dd4124380b0916f13cbb22609-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f043a20dd4124380b0916f13cbb22609-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3088,7 +3083,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0aa0e61422f34bdaa8c446d9f90e14c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0aa0e61422f34bdaa8c446d9f90e14c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e59b2d937de14ce89be0031f5b19018d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e59b2d937de14ce89be0031f5b19018d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3106,7 +3101,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c38c9222fcf4c09b1d53fd512167f5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c38c9222fcf4c09b1d53fd512167f5c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92aa79139b104b5186b7d29fb89036ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92aa79139b104b5186b7d29fb89036ca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3124,7 +3119,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef2dec909c8440ccab38f6c742b2a43d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef2dec909c8440ccab38f6c742b2a43d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/50340f087b63477faee0b655229602b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50340f087b63477faee0b655229602b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3142,7 +3137,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/19d395a9823e4c45af014487528caa69-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19d395a9823e4c45af014487528caa69-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1622cc620b054dcd806ac540e2890a06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1622cc620b054dcd806ac540e2890a06-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3160,7 +3155,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/70ae168ccd1043e3b08e12222315874a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70ae168ccd1043e3b08e12222315874a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89c1935522b74cba8d23f650d354c7c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c1935522b74cba8d23f650d354c7c2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3178,7 +3173,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa3c9bdc6dd34c6183392d1d4d63c244-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa3c9bdc6dd34c6183392d1d4d63c244-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3256ea093dd4926acda1cfa0dc56a47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3256ea093dd4926acda1cfa0dc56a47-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3196,7 +3191,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1daad923aae43bbb82d2c912aa525dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1daad923aae43bbb82d2c912aa525dc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a630930b25b0414c985765758bd8c103-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a630930b25b0414c985765758bd8c103-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3214,7 +3209,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30471b11c64b42699d3255acfb8cdf3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30471b11c64b42699d3255acfb8cdf3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/22efe8b051fc4ab3a1e4ccaecc34c2e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22efe8b051fc4ab3a1e4ccaecc34c2e2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3232,7 +3227,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46a01bdf1e1147f4a5cd0ab38d45e654-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46a01bdf1e1147f4a5cd0ab38d45e654-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3224e16279ae483185d387b65efebcd6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3224e16279ae483185d387b65efebcd6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3250,7 +3245,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f2aead694ad4f7faabde10e24147664-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f2aead694ad4f7faabde10e24147664-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/97f837c4b8f841f989174941eb17b8e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97f837c4b8f841f989174941eb17b8e6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3268,7 +3263,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d621e83f35614887a574cb4f1376fa9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d621e83f35614887a574cb4f1376fa9c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de637fc224c24decaa2df8dd95784c9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de637fc224c24decaa2df8dd95784c9b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3286,7 +3281,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/855bf9ed5207426996c2a42a9f514899-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/855bf9ed5207426996c2a42a9f514899-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5965ef1740e844418d183eea06aad7a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5965ef1740e844418d183eea06aad7a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3304,7 +3299,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82595de1472547489078801726df5995-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82595de1472547489078801726df5995-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75c396a6b95c48199733e7a78b3e0192-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75c396a6b95c48199733e7a78b3e0192-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3322,7 +3317,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a7ebf7b6df394b2cb00b3ea7f9c45f3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7ebf7b6df394b2cb00b3ea7f9c45f3d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72064fd02aad43318ea12118e1205d88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72064fd02aad43318ea12118e1205d88-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3340,7 +3335,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3173e4e0dd8e4aff835fdfa38da5ab31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3173e4e0dd8e4aff835fdfa38da5ab31-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/728c4fdb4bc441b2b551589101afa47c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/728c4fdb4bc441b2b551589101afa47c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3358,7 +3353,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/962716319e0c47fe8ba6af76523c6ccd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/962716319e0c47fe8ba6af76523c6ccd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/931ce4eae9334ce0b3883eb8808c21e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/931ce4eae9334ce0b3883eb8808c21e6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3376,7 +3371,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a47b249ac2504891bbf04961ea526651-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a47b249ac2504891bbf04961ea526651-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f36a4179c9d041f692e0f135bd88d39b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f36a4179c9d041f692e0f135bd88d39b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3394,7 +3389,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/917520b23ad44947a511a92a25d5da9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/917520b23ad44947a511a92a25d5da9b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5a0c4294efe34a2b8699ff23a93bc11a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5a0c4294efe34a2b8699ff23a93bc11a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3412,7 +3407,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc896d52cebd43e286b2e9e25c3c96db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc896d52cebd43e286b2e9e25c3c96db-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00ef97875057410a9c750c2b8047de52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00ef97875057410a9c750c2b8047de52-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3430,7 +3425,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7df5a1b6133043429018996190685743-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7df5a1b6133043429018996190685743-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/da0ed6224ac3495f83c9b940e4170bc8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da0ed6224ac3495f83c9b940e4170bc8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3448,7 +3443,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/69d9c8d2dc69424ca51e9ce549396a64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69d9c8d2dc69424ca51e9ce549396a64-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a288a0b6260483b8930890247d862de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a288a0b6260483b8930890247d862de-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3466,7 +3461,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0257208f7a114cfa8501d8945e582466-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0257208f7a114cfa8501d8945e582466-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a355761e6bb64f24aaa912aa706e5625-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a355761e6bb64f24aaa912aa706e5625-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3484,7 +3479,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35aac521f41a4c47972ae8131051d493-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35aac521f41a4c47972ae8131051d493-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efd0ac88b9b2448693d82b12873b6c92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efd0ac88b9b2448693d82b12873b6c92-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3502,7 +3497,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9574091bd8a457c9eb024038235c03a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9574091bd8a457c9eb024038235c03a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/05e5a86321ad4d93a7d21203a40a1dc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05e5a86321ad4d93a7d21203a40a1dc9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3520,7 +3515,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d0b20f0bfbf41d6a84a9eb6ba4e1637-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d0b20f0bfbf41d6a84a9eb6ba4e1637-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21172e9535b24da4a2e62bde00e3dbc0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21172e9535b24da4a2e62bde00e3dbc0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3538,7 +3533,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e847cacc664b42f0b483bca08881eabc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e847cacc664b42f0b483bca08881eabc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7456504c67fd4a499cec64d0357743d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7456504c67fd4a499cec64d0357743d5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3556,7 +3551,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90eb9bf2613b4e498d301941cd22b29a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90eb9bf2613b4e498d301941cd22b29a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78a8939823e24f838cbb026ad8a92b32-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78a8939823e24f838cbb026ad8a92b32-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3574,7 +3569,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54f0d9885c64414688ebb2bbede8ef4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54f0d9885c64414688ebb2bbede8ef4a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aeb34cef206a4ebb8aa01bccde718b62-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aeb34cef206a4ebb8aa01bccde718b62-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3592,7 +3587,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82506c9d3c024f93aeb592722d1e03f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82506c9d3c024f93aeb592722d1e03f6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee8653ae368f4a2f836aa87ec7825dac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee8653ae368f4a2f836aa87ec7825dac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3610,7 +3605,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f40ba1e942c43e1b5831bf909d4fa33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f40ba1e942c43e1b5831bf909d4fa33-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9b4cfa0f669a438d859aba5b4127c15c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b4cfa0f669a438d859aba5b4127c15c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3628,7 +3623,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ffd61efeeaaa43288d064aaf9fa606ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffd61efeeaaa43288d064aaf9fa606ad-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29b9ba792b044f5f939984f6f8527126-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29b9ba792b044f5f939984f6f8527126-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3646,7 +3641,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af07fd65fc6641e4b7f3e42c42edfbfc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af07fd65fc6641e4b7f3e42c42edfbfc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b12e7617086e495a8d8bf0da01831489-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b12e7617086e495a8d8bf0da01831489-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3664,7 +3659,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d6f25ff3363946e7bda74e20318bbded-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6f25ff3363946e7bda74e20318bbded-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fca30a506b8f438c83f089818beb88ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fca30a506b8f438c83f089818beb88ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3682,7 +3677,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2733c86d3a5845e7b19187bf204bfbc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2733c86d3a5845e7b19187bf204bfbc4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0a3b86e417d443aba367785b7131893-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0a3b86e417d443aba367785b7131893-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3700,7 +3695,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87c0f58464434adf8534980b977b41d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87c0f58464434adf8534980b977b41d8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c004aaf95b3049e0b477eb9dec2193a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c004aaf95b3049e0b477eb9dec2193a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3718,7 +3713,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f200ec6efa24a6b9814227cdc97e4d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f200ec6efa24a6b9814227cdc97e4d2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ac022511ea04cbeb7521aa7c62e19b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ac022511ea04cbeb7521aa7c62e19b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3736,7 +3731,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/806c159953f94e3a850bf0efe7aa2074-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/806c159953f94e3a850bf0efe7aa2074-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ee90a9823ea495c9cee6f636d675f51-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ee90a9823ea495c9cee6f636d675f51-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3754,7 +3749,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32f0ae07b38a40a1b7d145dc068a27cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32f0ae07b38a40a1b7d145dc068a27cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24811cc97e794bbaac8767dae5f40614-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24811cc97e794bbaac8767dae5f40614-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3772,7 +3767,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35902bdc6d494f95b8e55bb6f8204642-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35902bdc6d494f95b8e55bb6f8204642-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f67d3a5f1ffc42cda146ce31df587999-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f67d3a5f1ffc42cda146ce31df587999-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3790,7 +3785,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d835a878fc56437093041424cd056b4f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d835a878fc56437093041424cd056b4f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3d18cacd7b3d4d6d909a75adb02993bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d18cacd7b3d4d6d909a75adb02993bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3808,7 +3803,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/200a88dbf45843fb82d71a922a6d7cd9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/200a88dbf45843fb82d71a922a6d7cd9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60d3c67ccbf3468eb872428e34c63994-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60d3c67ccbf3468eb872428e34c63994-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3826,7 +3821,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9b7c468531e040b1aaa08e77a996b2bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b7c468531e040b1aaa08e77a996b2bc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba2ee711a29a4bf19ddd3912fd38c68c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba2ee711a29a4bf19ddd3912fd38c68c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3844,7 +3839,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba00bcc4ce924923baf99be48f9a368f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba00bcc4ce924923baf99be48f9a368f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2077fc266d1d4137ae3c4087576cf5e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2077fc266d1d4137ae3c4087576cf5e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3862,7 +3857,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8dd35fdd1c9491eaa9519ab6d610298-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8dd35fdd1c9491eaa9519ab6d610298-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9bc2cde6bb814315875c66509330fdbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bc2cde6bb814315875c66509330fdbf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3880,7 +3875,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9dbef1e389954e27a17d28a92105c7e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9dbef1e389954e27a17d28a92105c7e7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42f72a8c0e7f44b28b28d600a8f000bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42f72a8c0e7f44b28b28d600a8f000bf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3898,7 +3893,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/851fbad53d7d41c5b46a21d93d03027f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/851fbad53d7d41c5b46a21d93d03027f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80eaceb2c2b9414dbea5660ee171dd00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80eaceb2c2b9414dbea5660ee171dd00-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3916,7 +3911,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e885becb7f5e4d01aa50711a2cfa36ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e885becb7f5e4d01aa50711a2cfa36ad-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b34cc8458584489ab84ce5d80735114-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b34cc8458584489ab84ce5d80735114-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3934,7 +3929,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7256341224f84589b129a5cb96fb466c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7256341224f84589b129a5cb96fb466c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/049ac5663c9547f8a906633723a100b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/049ac5663c9547f8a906633723a100b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3952,7 +3947,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d39e515e977e4bab8a49bc42b82e2c47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d39e515e977e4bab8a49bc42b82e2c47-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b50c82a33882466c8f9a788f34cecc1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b50c82a33882466c8f9a788f34cecc1a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3970,7 +3965,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/483fdcb7eeef492caa509c5d5e39c128-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/483fdcb7eeef492caa509c5d5e39c128-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/05daee1beee24652948b4d088c3ea36d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05daee1beee24652948b4d088c3ea36d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -3988,7 +3983,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d0f48e6238094de4885a51143243ab38-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0f48e6238094de4885a51143243ab38-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c096a37883ab4d9d84180d02d22560d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c096a37883ab4d9d84180d02d22560d4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4006,7 +4001,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/059b62ecc27540f49b1e230cd53e27e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/059b62ecc27540f49b1e230cd53e27e8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8dd1e96ed25342808490884feec9d3bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8dd1e96ed25342808490884feec9d3bb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4024,7 +4019,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b9374e777c147a2b92bfcc4db9101cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b9374e777c147a2b92bfcc4db9101cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca047eea6c2940ba81f5cd5abe17b796-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca047eea6c2940ba81f5cd5abe17b796-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4042,7 +4037,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1a36e6283d98468cb1b93533319eed3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a36e6283d98468cb1b93533319eed3c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/092a9c06412148808ff70f3db85ec616-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/092a9c06412148808ff70f3db85ec616-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4060,7 +4055,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a416ada5f9814a82a37a60270f8912f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a416ada5f9814a82a37a60270f8912f6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e26f18f9f964218ae8178fe98fe3a1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e26f18f9f964218ae8178fe98fe3a1f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4078,7 +4073,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b9613eaccbe481397ff32c6ce188b04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b9613eaccbe481397ff32c6ce188b04-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/36949a3c370a432ea80e67febfa7010c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36949a3c370a432ea80e67febfa7010c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4096,7 +4091,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c3c53f46cba34217af9be7408a6e4844-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3c53f46cba34217af9be7408a6e4844-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b73265ad42cc41179bca8cd75da5c879-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b73265ad42cc41179bca8cd75da5c879-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4114,7 +4109,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a9fd006a03544f0b4e3ff5aff1e6a8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a9fd006a03544f0b4e3ff5aff1e6a8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/61c2c4de9a014a9ba2a1d9263d293e42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/61c2c4de9a014a9ba2a1d9263d293e42-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4132,7 +4127,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c1581ab3cf3411ea5b3675a940dc793-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c1581ab3cf3411ea5b3675a940dc793-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/098f7ffde10f44678ddd07a0bbd2baf6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/098f7ffde10f44678ddd07a0bbd2baf6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4150,7 +4145,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/526d9b4e3a044322942c360ac78381d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/526d9b4e3a044322942c360ac78381d2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1987752f64242fc9eb235be105cdd7d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1987752f64242fc9eb235be105cdd7d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4168,7 +4163,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c0115a962fc4f4eab24f07a7ffc408f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c0115a962fc4f4eab24f07a7ffc408f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/119bc32222544801a2f035e2f696297d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/119bc32222544801a2f035e2f696297d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4186,7 +4181,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6755f77549cb4dad88f2db945fb11cdf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6755f77549cb4dad88f2db945fb11cdf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53a92788bedd4732b653c84d5d644d3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53a92788bedd4732b653c84d5d644d3b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4204,7 +4199,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9959f42f8f4d4048874d4ff7a4d5a4d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9959f42f8f4d4048874d4ff7a4d5a4d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ab60c19bd7e4502ad853888dcff1cfc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ab60c19bd7e4502ad853888dcff1cfc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4222,7 +4217,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/026749ab48844d4697964aa9b3029fa8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/026749ab48844d4697964aa9b3029fa8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2efc9251a41f471aad85cdcf223fa2c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2efc9251a41f471aad85cdcf223fa2c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4240,7 +4235,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/adb66a7b410b4ec4a30235fdb7a0f25d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/adb66a7b410b4ec4a30235fdb7a0f25d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1ff1765bdf8a4bba9030b7bfa9f17634-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ff1765bdf8a4bba9030b7bfa9f17634-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4258,7 +4253,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5c00e811388461ca611878dbe393a5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5c00e811388461ca611878dbe393a5f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0c3db0ffdfc1485a8d942e19cbbc86da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c3db0ffdfc1485a8d942e19cbbc86da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4276,7 +4271,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/291dd24466d849a0b0273366ab822d8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/291dd24466d849a0b0273366ab822d8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/47852c16636a4283ab22681e4c7b9e8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47852c16636a4283ab22681e4c7b9e8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4294,7 +4289,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cbf89e2922d4928bfb633ca3052d012-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cbf89e2922d4928bfb633ca3052d012-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/74fa212e2c8b477896bd07177c5dbb37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74fa212e2c8b477896bd07177c5dbb37-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4312,7 +4307,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/31eb9636e1b24376b42dbf115a189b29-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/31eb9636e1b24376b42dbf115a189b29-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6afa7eca9d774de0992066896c48b591-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6afa7eca9d774de0992066896c48b591-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4330,7 +4325,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/885a3dc60320480aa597aee5fcb188c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/885a3dc60320480aa597aee5fcb188c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/622adb9de59c4e009c5c07f9899fea82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/622adb9de59c4e009c5c07f9899fea82-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4348,7 +4343,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ff7da4c13bf4ab2a2649e07ca27bbbc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ff7da4c13bf4ab2a2649e07ca27bbbc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e18c2fd4924644c9910970f9e8693e48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e18c2fd4924644c9910970f9e8693e48-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4366,7 +4361,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0fb8f94de41e4402a1c111ba20f0be43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0fb8f94de41e4402a1c111ba20f0be43-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e19f4173519a486b808be66aa41f6192-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e19f4173519a486b808be66aa41f6192-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4384,7 +4379,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3b0602308d7645ab8220f6465bea2788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b0602308d7645ab8220f6465bea2788-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3d871a0a96804d8293e014a9e0e05b7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d871a0a96804d8293e014a9e0e05b7a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4402,7 +4397,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f877266409249bf993678111947b50d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f877266409249bf993678111947b50d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a049d6044934ca9be992c3ab540878f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a049d6044934ca9be992c3ab540878f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4420,7 +4415,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d7e2a104513e4e5c969d7cb09e87ada6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7e2a104513e4e5c969d7cb09e87ada6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/858fa5d9229a4c84bba76005bfdc5c40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/858fa5d9229a4c84bba76005bfdc5c40-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4438,7 +4433,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38dd90cd592047a2b3c460fa9d6c2b20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38dd90cd592047a2b3c460fa9d6c2b20-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30057e83dec447978c84ac3f7a9dc891-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30057e83dec447978c84ac3f7a9dc891-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4456,7 +4451,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3f2420fb4074c82851ba2ff006ca625-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3f2420fb4074c82851ba2ff006ca625-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2fd9fe9a64964886beac0fb26e10ea72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2fd9fe9a64964886beac0fb26e10ea72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4474,7 +4469,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4bc9718bf2544045a3659e7cb0f46784-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bc9718bf2544045a3659e7cb0f46784-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/48dea273f76c463287ed0aac28b5497d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48dea273f76c463287ed0aac28b5497d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4492,7 +4487,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be9daff3027e41df89c0bc4984a84ee8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be9daff3027e41df89c0bc4984a84ee8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8dbf83d576747369c37a12a6f15ca0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8dbf83d576747369c37a12a6f15ca0b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4510,7 +4505,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/39662dcda8bb4a8d89d94e06a602746c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39662dcda8bb4a8d89d94e06a602746c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c96cf16fb5a439bae07194c4ba6c112-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c96cf16fb5a439bae07194c4ba6c112-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4528,7 +4523,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/abc635ce179a4edb9360ed8402102c42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abc635ce179a4edb9360ed8402102c42-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be5357f9329e4ea79159d5bc79e17490-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be5357f9329e4ea79159d5bc79e17490-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4546,7 +4541,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fecb6073d6546298bea43deb93783d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fecb6073d6546298bea43deb93783d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/41ff9c52570f4c509f1d20725f56c718-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41ff9c52570f4c509f1d20725f56c718-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4564,7 +4559,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fe9c2df798e46bcbb190b506cbba40c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fe9c2df798e46bcbb190b506cbba40c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88e82063a16742a0a55e84294b976728-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88e82063a16742a0a55e84294b976728-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4582,7 +4577,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/612d8425859842b7858678264372f8dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/612d8425859842b7858678264372f8dc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/137d1e26404f4478bec14d2343b377bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/137d1e26404f4478bec14d2343b377bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4600,7 +4595,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5aefbd721ca4a32ab8d649edd445a4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5aefbd721ca4a32ab8d649edd445a4d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd595d6d46f141189e9984402b25ff16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd595d6d46f141189e9984402b25ff16-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4618,7 +4613,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e7caf5d89bf46fbb90f5c4ffb6fffa6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e7caf5d89bf46fbb90f5c4ffb6fffa6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d3aba3c6e68f4495baf5944c346612ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3aba3c6e68f4495baf5944c346612ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4636,7 +4631,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c568655b3b5a45fd98d2a9b510a44f9e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c568655b3b5a45fd98d2a9b510a44f9e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9fa068d9b404c0fa76ffbef3e8a23b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9fa068d9b404c0fa76ffbef3e8a23b1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4654,7 +4649,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75777628d1a34f0ba3c76aa6ab20d3b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75777628d1a34f0ba3c76aa6ab20d3b7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d57b64a79088470887642f1e9837b0d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d57b64a79088470887642f1e9837b0d8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4672,7 +4667,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/024d4b8b5ba84455b2f1e764a910dbfa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/024d4b8b5ba84455b2f1e764a910dbfa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/43c2d70e708a40e0b553e83af142d4a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43c2d70e708a40e0b553e83af142d4a9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4690,7 +4685,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3073578c3e574b29868b038f1e23611e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3073578c3e574b29868b038f1e23611e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0deb44471dd644ef80891618fc3387c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0deb44471dd644ef80891618fc3387c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4708,7 +4703,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82af853f7f944206944081c5e30d7859-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82af853f7f944206944081c5e30d7859-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f7f13d0845a4da3b849ed6eea9cfa4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f7f13d0845a4da3b849ed6eea9cfa4d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4726,7 +4721,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b79656a090e446a382a97c94bb3675d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b79656a090e446a382a97c94bb3675d6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a0d4ea8b892746908ccbc389c456d0bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0d4ea8b892746908ccbc389c456d0bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4744,7 +4739,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b43480c97e59477985396f6a8e35b5b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b43480c97e59477985396f6a8e35b5b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98da76dbaee248d48303260facd62129-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98da76dbaee248d48303260facd62129-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4762,7 +4757,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f4927a3adfa40f9be225dc5a5310f0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f4927a3adfa40f9be225dc5a5310f0c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b91b4f964fca455d88294bc08ce364c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b91b4f964fca455d88294bc08ce364c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4780,7 +4775,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5a1dcc9f6cc4b45b888a44832092067-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5a1dcc9f6cc4b45b888a44832092067-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/978142e6422c4d81ba9fda235e6161da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/978142e6422c4d81ba9fda235e6161da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4798,7 +4793,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/19afcbc5c6814ca982ebc9677252669b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19afcbc5c6814ca982ebc9677252669b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2aa7569069374c95ab0e5dc88a0fd55f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2aa7569069374c95ab0e5dc88a0fd55f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4816,7 +4811,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a31b64b5b600449bb958f23076833351-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a31b64b5b600449bb958f23076833351-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c8aeaeadf8e4086ac3cbd46a5e908f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c8aeaeadf8e4086ac3cbd46a5e908f5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4834,7 +4829,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54f8983590614b3c97c99b09e66a7ff2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54f8983590614b3c97c99b09e66a7ff2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ac4ac3aae2fe41ee8b9165a02cfd1bb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac4ac3aae2fe41ee8b9165a02cfd1bb0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4852,7 +4847,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/79f45ffb6f9443d3bbbd3186d1c9dc2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79f45ffb6f9443d3bbbd3186d1c9dc2b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fb7967f312414c4aba5f7288bfac22c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb7967f312414c4aba5f7288bfac22c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4870,7 +4865,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca0c81b0a0ca43f2b6fdd8d384ea23d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca0c81b0a0ca43f2b6fdd8d384ea23d6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/94b08f30ea264e6c8ff70c549ca2214b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94b08f30ea264e6c8ff70c549ca2214b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4888,7 +4883,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a2667b8d93cf48d0880ed7bd6e2638d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2667b8d93cf48d0880ed7bd6e2638d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/584189d5b28548b3899b54cddba365be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/584189d5b28548b3899b54cddba365be-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4906,7 +4901,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9297a43f34fd44cabe4648b7e665f920-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9297a43f34fd44cabe4648b7e665f920-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2a4403f7858141349a5d4d0b8c18332f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a4403f7858141349a5d4d0b8c18332f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4924,7 +4919,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/888320cac328430aa90911350460ff71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/888320cac328430aa90911350460ff71-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d82fc569e61a4bb29c418216b8788169-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d82fc569e61a4bb29c418216b8788169-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4942,7 +4937,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4212d4a725c845558b14938d53785808-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4212d4a725c845558b14938d53785808-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea3f9c62d357441abc82739d680498ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea3f9c62d357441abc82739d680498ae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4960,7 +4955,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8dce42133ee425b875e2b861625b434-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8dce42133ee425b875e2b861625b434-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9e837aa7902d435498c8dc0ed5b71c89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e837aa7902d435498c8dc0ed5b71c89-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4978,7 +4973,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21c5318977f54a13a14e2cb293c53304-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21c5318977f54a13a14e2cb293c53304-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/498fb4909f0f440296f22486f864d104-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/498fb4909f0f440296f22486f864d104-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -4996,7 +4991,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c54029f0706047278fb1a28839b6ff01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c54029f0706047278fb1a28839b6ff01-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d0435d63cf54ce7acc137986c031a4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d0435d63cf54ce7acc137986c031a4e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5014,7 +5009,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/660d5ebd238142758e66ada0f7a465af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/660d5ebd238142758e66ada0f7a465af-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dec42736b4184375a3d2a73cb449b279-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dec42736b4184375a3d2a73cb449b279-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5032,7 +5027,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5480d371191e450680fc57858a1c6518-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5480d371191e450680fc57858a1c6518-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ee287fa47464c2793d3eae9fec9a8ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ee287fa47464c2793d3eae9fec9a8ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5050,7 +5045,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b972593e01874be8a616a1c944cd5135-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b972593e01874be8a616a1c944cd5135-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e5ceb64dab7439e886ebbe6c01a1da9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e5ceb64dab7439e886ebbe6c01a1da9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5068,7 +5063,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/701163d839214e25ab5aaf83f8658618-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/701163d839214e25ab5aaf83f8658618-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8361071634145058187631d9a0e1b46-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8361071634145058187631d9a0e1b46-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5086,7 +5081,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/220c6e4856f54e819f04ff8c9e941451-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/220c6e4856f54e819f04ff8c9e941451-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/67ae0da1641045f2881a61b2393e4bd2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67ae0da1641045f2881a61b2393e4bd2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5104,7 +5099,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/680f09558d834b01a2edd7e42bcd46ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/680f09558d834b01a2edd7e42bcd46ea-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d2eab1fa9a14aaab354e3dd191d8464-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d2eab1fa9a14aaab354e3dd191d8464-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5122,7 +5117,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/903ee0b7441144f0890360a2fc953ac3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/903ee0b7441144f0890360a2fc953ac3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f359724e139f44af98ed50288bf5340e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f359724e139f44af98ed50288bf5340e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5140,7 +5135,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bb3d2887a50741adbe36fdda87001d1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bb3d2887a50741adbe36fdda87001d1a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd5dfd3518e04c039a43f95531c5f935-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd5dfd3518e04c039a43f95531c5f935-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5158,7 +5153,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d07a93494f4446999c938f219c169372-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d07a93494f4446999c938f219c169372-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c16f5b5e6d004a03a88097669d15e5f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c16f5b5e6d004a03a88097669d15e5f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5176,7 +5171,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f27289d31e36449c90ac0c1e871863c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f27289d31e36449c90ac0c1e871863c8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/67261e32a27a42158ae65ca9d886edf1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67261e32a27a42158ae65ca9d886edf1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5194,7 +5189,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbee2bebb3c3454caedd60d76c999ad0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbee2bebb3c3454caedd60d76c999ad0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4c50bfbb2aa544ec80ce28fc4b36086f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4c50bfbb2aa544ec80ce28fc4b36086f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5212,7 +5207,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/976ba1099f564031af4e5be7d191963e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/976ba1099f564031af4e5be7d191963e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f92acc27fd1c4e2eab2f56ebafcd3ed3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f92acc27fd1c4e2eab2f56ebafcd3ed3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5230,7 +5225,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c300759ae90c4b40b2602c5564682d3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c300759ae90c4b40b2602c5564682d3b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5354bd044ac4704b131e19da5c82fa7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5354bd044ac4704b131e19da5c82fa7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5248,7 +5243,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e9ffb29d16124223887c8ce59548c628-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9ffb29d16124223887c8ce59548c628-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/617c41b60b084c70813ccf47f49b3fc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/617c41b60b084c70813ccf47f49b3fc7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5266,7 +5261,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b4cf9ac259d344a7bff9c02794297397-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4cf9ac259d344a7bff9c02794297397-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c3c29bbbab24d558f30c7e8a28e91d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c3c29bbbab24d558f30c7e8a28e91d5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5284,7 +5279,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2a7170f400a14080a28f9eefa9246af2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a7170f400a14080a28f9eefa9246af2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/991641434e3f4a1b8cad96438ea13713-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/991641434e3f4a1b8cad96438ea13713-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5302,7 +5297,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57e03f7c35be4d35a2de78d35b6055c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57e03f7c35be4d35a2de78d35b6055c1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/718cdd4957034796ab384764b6a75d72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/718cdd4957034796ab384764b6a75d72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 13 COLUMNS\n", @@ -5324,7 +5319,7 @@ "True" ] }, - "execution_count": 15, + "execution_count": 5, "metadata": {}, "output_type": "execute_result" } @@ -5337,9 +5332,9 @@ "evaluations = [evaluation0, evaluation1]\n", "scores = {'acc': 0.357, 'sens': 0.323, 'spec': 0.362, 'bacc': 0.9}\n", "\n", - "result = check_n_datasets_mos_unknown_folds_mos_scores(evaluations=evaluations,\n", - " scores=scores,\n", - " eps=1e-3)\n", + "result = check_n_datasets_mos_unknown_folds_mos(evaluations=evaluations,\n", + " scores=scores,\n", + " eps=1e-3)\n", "result['inconsistency']" ] } diff --git a/notebooks/illustration/binary/08_check_n_testsets_mos_no_kfold.ipynb b/notebooks/illustration/binary/08_check_n_testsets_mos_no_kfold.ipynb new file mode 100644 index 0000000..16ec3b0 --- /dev/null +++ b/notebooks/illustration/binary/08_check_n_testsets_mos_no_kfold.ipynb @@ -0,0 +1,184 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [], + "source": [ + "testsets = [{'p': 349, 'n': 50},\n", + " {'p': 478, 'n': 323},\n", + " {'p': 324, 'n': 83},\n", + " {'p': 123, 'n': 145}]\n", + "\n", + "scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251}" + ] + }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d999fb087e246d89c9911715e4446bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d999fb087e246d89c9911715e4446bd-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 13 COLUMNS\n", + "At line 79 RHS\n", + "At line 88 BOUNDS\n", + "At line 98 ENDATA\n", + "Problem MODEL has 8 rows, 9 columns and 48 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0004I processed model has 4 rows, 8 columns (8 integer (0 of which binary)) and 24 elements\n", + "Cbc0031I 2 added rows had average density of 8\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 28 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 51 row cuts average 7.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 2 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 6 row cuts average 3.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", + "Cbc0016I Integer solution of 0 found by strong branching after 206 iterations and 52 nodes (0.02 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 206 iterations and 52 nodes (0.02 seconds)\n", + "Cbc0032I Strong branching done 206 times (291 iterations), fathomed 14 nodes and fixed 31 variables\n", + "Cbc0035I Maximum depth 28, 0 variables fixed on reduced cost\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 28 times and created 51 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 28 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 28 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Optimal solution found\n", + "\n", + "Objective value: 0.00000000\n", + "Enumerated nodes: 52\n", + "Total iterations: 206\n", + "Time (CPU seconds): 0.02\n", + "Time (Wallclock seconds): 0.02\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 8, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_n_testsets_mos_no_kfold(testsets=testsets,\n", + " scores=scores,\n", + " eps=0.0001)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [], + "source": [ + "scores['sens'] = 0.6756" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "Welcome to the CBC MILP Solver \n", + "Version: 2.10.3 \n", + "Build Date: Dec 15 2019 \n", + "\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/51b08105771f4a8a9f27f05b5edf0673-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/51b08105771f4a8a9f27f05b5edf0673-pulp.sol (default strategy 1)\n", + "At line 2 NAME MODEL\n", + "At line 3 ROWS\n", + "At line 13 COLUMNS\n", + "At line 79 RHS\n", + "At line 88 BOUNDS\n", + "At line 98 ENDATA\n", + "Problem MODEL has 8 rows, 9 columns and 48 elements\n", + "Coin0008I MODEL read with 0 errors\n", + "Option for timeMode changed from cpu to elapsed\n", + "Problem is infeasible - 0.00 seconds\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 10, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_n_testsets_mos_no_kfold(testsets=testsets,\n", + " scores=scores,\n", + " eps=0.0001)\n", + "result['inconsistency']" + ] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/09_check_n_testsets_som_no_kfold.ipynb b/notebooks/illustration/binary/09_check_n_testsets_som_no_kfold.ipynb similarity index 65% rename from notebooks/illustration/09_check_n_testsets_som_no_kfold.ipynb rename to notebooks/illustration/binary/09_check_n_testsets_som_no_kfold.ipynb index 580a9aa..a585353 100644 --- a/notebooks/illustration/09_check_n_testsets_som_no_kfold.ipynb +++ b/notebooks/illustration/binary/09_check_n_testsets_som_no_kfold.ipynb @@ -6,7 +6,7 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.check import check_n_testsets_som_no_kfold_scores" + "from mlscorecheck.check.binary import check_n_testsets_som_no_kfold" ] }, { @@ -28,28 +28,28 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:41:34,660:INFO:checking the scores {'acc': 0.4719, 'npv': 0.6253, 'f1p': 0.3091}\n", - "2023-10-26 23:41:34,661:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-10-26 23:41:34,662:INFO:intervals before: (0, 517), (0, 1049)\n", - "2023-10-26 23:41:34,663:INFO:the tp solutions: (183.3735345619046, 186.76921301883434)\n", - "2023-10-26 23:41:34,664:INFO:the tn solutions: (552.9864593956394, 554.8661474746565)\n", - "2023-10-26 23:41:34,666:INFO:intervals after: [(184, 186)], [(553, 554)]\n", - "2023-10-26 23:41:34,667:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:41:34,669:INFO:intervals before: [(184, 186)], [(553, 554)]\n", - "2023-10-26 23:41:34,669:INFO:the tp solutions: (184.87168671166216, 185.11986556349612)\n", - "2023-10-26 23:41:34,670:INFO:the tn solutions: (553.4808574181667, 554.5185801488539)\n", - "2023-10-26 23:41:34,671:INFO:intervals after: [(185, 185)], [(554, 554)]\n", - "2023-10-26 23:41:34,672:INFO:evaluating the tp and tn solution for npv and f1p\n", - "2023-10-26 23:41:34,673:INFO:intervals before: [(185, 185)], [(554, 554)]\n", - "2023-10-26 23:41:34,674:INFO:the tp solutions: (184.64422257239337, 185.32173809718321)\n", - "2023-10-26 23:41:34,675:INFO:the tn solutions: (553.2944463587239, 554.8488214174102)\n", - "2023-10-26 23:41:34,676:INFO:intervals after: [(185, 185)], [(554, 554)]\n", - "2023-10-26 23:41:34,676:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-10-26 23:41:34,677:INFO:testing npv, feasible tptn pairs: 1\n", - "2023-10-26 23:41:34,678:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-10-26 23:41:34,681:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:41:34,682:INFO:final number of intervals: 1\n", - "2023-10-26 23:41:34,684:INFO:final number of pairs: 1\n" + "2023-11-03 06:39:34,967:INFO:checking the scores {'acc': 0.4719, 'npv': 0.6253, 'f1p': 0.3091}\n", + "2023-11-03 06:39:34,968:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 06:39:34,970:INFO:intervals before: (0, 517), (0, 1049)\n", + "2023-11-03 06:39:34,971:INFO:the tp solutions: (183.3735345619046, 186.76921301883434)\n", + "2023-11-03 06:39:34,972:INFO:the tn solutions: (552.9864593956394, 554.8661474746565)\n", + "2023-11-03 06:39:34,973:INFO:intervals after: [(184, 186)], [(553, 554)]\n", + "2023-11-03 06:39:34,974:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:39:34,975:INFO:intervals before: [(184, 186)], [(553, 554)]\n", + "2023-11-03 06:39:34,978:INFO:the tp solutions: (184.87168671166216, 185.11986556349612)\n", + "2023-11-03 06:39:34,979:INFO:the tn solutions: (553.4808574181667, 554.5185801488539)\n", + "2023-11-03 06:39:34,980:INFO:intervals after: [(185, 185)], [(554, 554)]\n", + "2023-11-03 06:39:34,981:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 06:39:34,982:INFO:intervals before: [(185, 185)], [(554, 554)]\n", + "2023-11-03 06:39:34,983:INFO:the tp solutions: (184.64422257239337, 185.32173809718321)\n", + "2023-11-03 06:39:34,983:INFO:the tn solutions: (553.2944463587239, 554.8488214174102)\n", + "2023-11-03 06:39:34,984:INFO:intervals after: [(185, 185)], [(554, 554)]\n", + "2023-11-03 06:39:34,984:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 06:39:34,985:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-03 06:39:34,986:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 06:39:34,987:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:39:34,988:INFO:final number of intervals: 1\n", + "2023-11-03 06:39:34,988:INFO:final number of pairs: 1\n" ] }, { @@ -74,7 +74,7 @@ " 'n_valid_tptn_pairs': 1,\n", " 'iterate_by': 'tp',\n", " 'solve_for': 'tn',\n", - " 'evidence': (185, [(554, 554)]),\n", + " 'evidence': {'tp': 185, 'tn': 554},\n", " 'prefiltering_details': {'inconsistency': False,\n", " 'tp': [(185, 185)],\n", " 'tn': [(554, 554)],\n", @@ -107,9 +107,9 @@ } ], "source": [ - "check_n_testsets_som_no_kfold_scores(testsets=testsets,\n", - " scores=scores,\n", - " eps=0.0001)" + "check_n_testsets_som_no_kfold(testsets=testsets,\n", + " scores=scores,\n", + " eps=0.0001)" ] }, { @@ -130,27 +130,27 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:41:34,746:INFO:checking the scores {'acc': 0.4719, 'npv': 0.6263, 'f1p': 0.3091}\n", - "2023-10-26 23:41:34,748:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-10-26 23:41:34,750:INFO:intervals before: (0, 517), (0, 1049)\n", - "2023-10-26 23:41:34,751:INFO:the tp solutions: (186.89044330890292, 190.26616505437528)\n", - "2023-10-26 23:41:34,752:INFO:the tn solutions: (549.4891363675572, 551.3495419700156)\n", - "2023-10-26 23:41:34,753:INFO:intervals after: [(187, 190)], [(550, 551)]\n", - "2023-10-26 23:41:34,754:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:41:34,755:INFO:intervals before: [(187, 190)], [(550, 551)]\n", - "2023-10-26 23:41:34,756:INFO:the tp solutions: (184.87168671166216, 185.11986556349612)\n", - "2023-10-26 23:41:34,758:INFO:the tn solutions: (553.4808574181667, 554.5185801488539)\n", - "2023-10-26 23:41:34,760:INFO:intervals after: [], []\n", - "2023-10-26 23:41:34,761:INFO:evaluating the tp and tn solution for npv and f1p\n", - "2023-10-26 23:41:34,763:INFO:intervals before: [], []\n", - "2023-10-26 23:41:34,764:INFO:the tp solutions: (184.01870812695688, 184.69747317618967)\n", - "2023-10-26 23:41:34,766:INFO:the tn solutions: (556.7064405556058, 558.2736510014568)\n", - "2023-10-26 23:41:34,766:INFO:intervals after: [], []\n", - "2023-10-26 23:41:34,768:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:41:34,769:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:41:34,770:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:41:34,771:INFO:final number of intervals: 0\n", - "2023-10-26 23:41:34,771:INFO:final number of pairs: 0\n" + "2023-11-03 06:39:35,014:INFO:checking the scores {'acc': 0.4719, 'npv': 0.6263, 'f1p': 0.3091}\n", + "2023-11-03 06:39:35,015:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 06:39:35,016:INFO:intervals before: (0, 517), (0, 1049)\n", + "2023-11-03 06:39:35,017:INFO:the tp solutions: (186.89044330890292, 190.26616505437528)\n", + "2023-11-03 06:39:35,017:INFO:the tn solutions: (549.4891363675572, 551.3495419700156)\n", + "2023-11-03 06:39:35,018:INFO:intervals after: [(187, 190)], [(550, 551)]\n", + "2023-11-03 06:39:35,019:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 06:39:35,020:INFO:intervals before: [(187, 190)], [(550, 551)]\n", + "2023-11-03 06:39:35,020:INFO:the tp solutions: (184.87168671166216, 185.11986556349612)\n", + "2023-11-03 06:39:35,021:INFO:the tn solutions: (553.4808574181667, 554.5185801488539)\n", + "2023-11-03 06:39:35,022:INFO:intervals after: [], []\n", + "2023-11-03 06:39:35,023:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 06:39:35,024:INFO:intervals before: [], []\n", + "2023-11-03 06:39:35,025:INFO:the tp solutions: (184.01870812695688, 184.69747317618967)\n", + "2023-11-03 06:39:35,026:INFO:the tn solutions: (556.7064405556058, 558.2736510014568)\n", + "2023-11-03 06:39:35,026:INFO:intervals after: [], []\n", + "2023-11-03 06:39:35,027:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 06:39:35,028:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 06:39:35,029:INFO:constructing final tp, tn pair set\n", + "2023-11-03 06:39:35,029:INFO:final number of intervals: 0\n", + "2023-11-03 06:39:35,030:INFO:final number of pairs: 0\n" ] }, { @@ -198,9 +198,9 @@ } ], "source": [ - "check_n_testsets_som_no_kfold_scores(testsets=testsets,\n", - " scores=scores,\n", - " eps=0.0001)" + "check_n_testsets_som_no_kfold(testsets=testsets,\n", + " scores=scores,\n", + " eps=0.0001)" ] }, { diff --git a/notebooks/illustration/20_retina_drive.ipynb b/notebooks/illustration/bundles/00_retina_drive.ipynb similarity index 51% rename from notebooks/illustration/20_retina_drive.ipynb rename to notebooks/illustration/bundles/00_retina_drive.ipynb index 8b52086..3766d7a 100644 --- a/notebooks/illustration/20_retina_drive.ipynb +++ b/notebooks/illustration/bundles/00_retina_drive.ipynb @@ -13,8 +13,8 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_drive_vessel_image,\n", - " check_drive_vessel_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_drive_vessel_image,\n", + " check_drive_vessel_aggregated)" ] }, { @@ -55,49 +55,49 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:05,250:INFO:checking the scores {'acc': 0.9494, 'sens': 0.745, 'spec': 0.9793}\n", - "2023-10-26 23:42:05,251:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,253:INFO:intervals before: (0, 577649), (0, 3960494)\n", - "2023-10-26 23:42:05,254:INFO:the tp solutions: (430289.58480199997, 430407.42519800004)\n", - "2023-10-26 23:42:05,255:INFO:the tn solutions: (3877642.6484160004, 3878686.2699840004)\n", - "2023-10-26 23:42:05,256:INFO:intervals after: [(430290, 430407)], [(3877643, 3878686)]\n", - "2023-10-26 23:42:05,258:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,259:INFO:intervals before: [(430290, 430407)], [(3877643, 3878686)]\n", - "2023-10-26 23:42:05,260:INFO:the tp solutions: (429134.3290260006, 430868.0509740007)\n", - "2023-10-26 23:42:05,261:INFO:the tn solutions: (3878107.8038119995, 3878915.744588)\n", - "2023-10-26 23:42:05,262:INFO:intervals after: [(430290, 430407)], [(3878108, 3878686)]\n", - "2023-10-26 23:42:05,263:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,263:INFO:intervals before: [(430290, 430407)], [(3878108, 3878686)]\n", - "2023-10-26 23:42:05,264:INFO:the tp solutions: (430289.58480199997, 430407.42519800004)\n", - "2023-10-26 23:42:05,265:INFO:the tn solutions: (3878107.8038119995, 3878915.744588)\n", - "2023-10-26 23:42:05,266:INFO:intervals after: [(430290, 430407)], [(3878108, 3878686)]\n", - "2023-10-26 23:42:05,269:INFO:testing acc, feasible tptn pairs: 118\n", - "2023-10-26 23:42:05,282:INFO:testing sens, feasible tptn pairs: 118\n", - "2023-10-26 23:42:05,284:INFO:testing spec, feasible tptn pairs: 116\n", - "2023-10-26 23:42:05,288:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,289:INFO:final number of intervals: 116\n", - "2023-10-26 23:42:05,289:INFO:final number of pairs: 59334\n", - "2023-10-26 23:42:05,308:INFO:checking the scores {'acc': 0.9494, 'sens': 0.745, 'spec': 0.9793}\n", - "2023-10-26 23:42:05,309:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,310:INFO:intervals before: (0, 577945), (0, 6021255)\n", - "2023-10-26 23:42:05,311:INFO:the tp solutions: (430510.07460999995, 430627.97539000004)\n", - "2023-10-26 23:42:05,313:INFO:the tn solutions: (5833979.38621, 5835443.523790001)\n", - "2023-10-26 23:42:05,315:INFO:intervals after: [(430511, 430627)], [(5833980, 5835443)]\n", - "2023-10-26 23:42:05,316:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,316:INFO:intervals before: [(430511, 430627)], [(5833980, 5835443)]\n", - "2023-10-26 23:42:05,318:INFO:the tp solutions: (367378.1720900005, 369952.7449100008)\n", - "2023-10-26 23:42:05,319:INFO:the tn solutions: (5896000.85349, 5897229.18951)\n", - "2023-10-26 23:42:05,319:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,320:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,321:INFO:intervals before: [], []\n", - "2023-10-26 23:42:05,322:INFO:the tp solutions: (430510.07460999995, 430627.97539000004)\n", - "2023-10-26 23:42:05,323:INFO:the tn solutions: (5896000.85349, 5897229.18951)\n", - "2023-10-26 23:42:05,324:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,325:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:05,326:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:05,327:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,328:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:05,329:INFO:final number of pairs: 0\n" + "2023-11-03 07:59:01,488:INFO:checking the scores {'acc': 0.9494, 'sens': 0.745, 'spec': 0.9793}\n", + "2023-11-03 07:59:01,489:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,490:INFO:intervals before: (0, 577649), (0, 3960494)\n", + "2023-11-03 07:59:01,491:INFO:the tp solutions: (430289.58480199997, 430407.42519800004)\n", + "2023-11-03 07:59:01,492:INFO:the tn solutions: (3877642.6484160004, 3878686.2699840004)\n", + "2023-11-03 07:59:01,493:INFO:intervals after: [(430290, 430407)], [(3877643, 3878686)]\n", + "2023-11-03 07:59:01,493:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,495:INFO:intervals before: [(430290, 430407)], [(3877643, 3878686)]\n", + "2023-11-03 07:59:01,497:INFO:the tp solutions: (429134.3290260006, 430868.0509740007)\n", + "2023-11-03 07:59:01,498:INFO:the tn solutions: (3878107.8038119995, 3878915.744588)\n", + "2023-11-03 07:59:01,499:INFO:intervals after: [(430290, 430407)], [(3878108, 3878686)]\n", + "2023-11-03 07:59:01,500:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,501:INFO:intervals before: [(430290, 430407)], [(3878108, 3878686)]\n", + "2023-11-03 07:59:01,502:INFO:the tp solutions: (430289.58480199997, 430407.42519800004)\n", + "2023-11-03 07:59:01,503:INFO:the tn solutions: (3878107.8038119995, 3878915.744588)\n", + "2023-11-03 07:59:01,504:INFO:intervals after: [(430290, 430407)], [(3878108, 3878686)]\n", + "2023-11-03 07:59:01,507:INFO:testing acc, feasible tptn pairs: 118\n", + "2023-11-03 07:59:01,517:INFO:testing sens, feasible tptn pairs: 118\n", + "2023-11-03 07:59:01,518:INFO:testing spec, feasible tptn pairs: 116\n", + "2023-11-03 07:59:01,522:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,522:INFO:final number of intervals: 116\n", + "2023-11-03 07:59:01,523:INFO:final number of pairs: 59334\n", + "2023-11-03 07:59:01,538:INFO:checking the scores {'acc': 0.9494, 'sens': 0.745, 'spec': 0.9793}\n", + "2023-11-03 07:59:01,539:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,540:INFO:intervals before: (0, 577945), (0, 6021255)\n", + "2023-11-03 07:59:01,543:INFO:the tp solutions: (430510.07460999995, 430627.97539000004)\n", + "2023-11-03 07:59:01,544:INFO:the tn solutions: (5833979.38621, 5835443.523790001)\n", + "2023-11-03 07:59:01,545:INFO:intervals after: [(430511, 430627)], [(5833980, 5835443)]\n", + "2023-11-03 07:59:01,546:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,548:INFO:intervals before: [(430511, 430627)], [(5833980, 5835443)]\n", + "2023-11-03 07:59:01,549:INFO:the tp solutions: (367378.1720900005, 369952.7449100008)\n", + "2023-11-03 07:59:01,550:INFO:the tn solutions: (5896000.85349, 5897229.18951)\n", + "2023-11-03 07:59:01,551:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,553:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,554:INFO:intervals before: [], []\n", + "2023-11-03 07:59:01,555:INFO:the tp solutions: (430510.07460999995, 430627.97539000004)\n", + "2023-11-03 07:59:01,557:INFO:the tn solutions: (5896000.85349, 5897229.18951)\n", + "2023-11-03 07:59:01,557:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,558:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:59:01,559:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:59:01,560:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,561:INFO:final number of intervals: 0\n", + "2023-11-03 07:59:01,562:INFO:final number of pairs: 0\n" ] } ], @@ -164,48 +164,48 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:05,390:INFO:checking the scores {'acc': 0.9898, 'sens': 0.8027, 'spec': 0.998}\n", - "2023-10-26 23:42:05,392:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,393:INFO:intervals before: (0, 577649), (0, 3960494)\n", - "2023-10-26 23:42:05,394:INFO:the tp solutions: (463619.93210199993, 463737.772498)\n", - "2023-10-26 23:42:05,395:INFO:the tn solutions: (4027653.278316, 4028696.899884)\n", - "2023-10-26 23:42:05,397:INFO:intervals after: [(463620, 463737)], []\n", - "2023-10-26 23:42:05,398:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,399:INFO:intervals before: [(463620, 463737)], []\n", - "2023-10-26 23:42:05,401:INFO:the tp solutions: (538414.068426, 540147.7903740001)\n", - "2023-10-26 23:42:05,402:INFO:the tn solutions: (3952169.0416119997, 3952976.982388)\n", - "2023-10-26 23:42:05,403:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,404:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,405:INFO:intervals before: [], []\n", - "2023-10-26 23:42:05,406:INFO:the tp solutions: (463619.93210199993, 463737.772498)\n", - "2023-10-26 23:42:05,408:INFO:the tn solutions: (3952169.0416119997, 3952976.982388)\n", - "2023-10-26 23:42:05,409:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,410:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:05,411:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:05,412:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,413:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:05,414:INFO:final number of pairs: 0\n", - "2023-10-26 23:42:05,434:INFO:checking the scores {'acc': 0.9898, 'sens': 0.8027, 'spec': 0.998}\n", - "2023-10-26 23:42:05,436:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,438:INFO:intervals before: (0, 577945), (0, 6021255)\n", - "2023-10-26 23:42:05,439:INFO:the tp solutions: (463857.50110999995, 463975.40189000004)\n", - "2023-10-26 23:42:05,441:INFO:the tn solutions: (6067239.63971, 6068703.777290001)\n", - "2023-10-26 23:42:05,442:INFO:intervals after: [(463858, 463975)], []\n", - "2023-10-26 23:42:05,444:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,445:INFO:intervals before: [(463858, 463975)], []\n", - "2023-10-26 23:42:05,446:INFO:the tp solutions: (521388.38358999975, 523962.9564100001)\n", - "2023-10-26 23:42:05,446:INFO:the tn solutions: (6008598.32199, 6009826.65801)\n", - "2023-10-26 23:42:05,447:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,448:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,450:INFO:intervals before: [], []\n", - "2023-10-26 23:42:05,451:INFO:the tp solutions: (463857.50110999995, 463975.40189000004)\n", - "2023-10-26 23:42:05,452:INFO:the tn solutions: (6008598.32199, 6009826.65801)\n", - "2023-10-26 23:42:05,454:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,457:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:05,458:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:05,459:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,461:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:05,462:INFO:final number of pairs: 0\n" + "2023-11-03 07:59:01,624:INFO:checking the scores {'acc': 0.9898, 'sens': 0.8027, 'spec': 0.998}\n", + "2023-11-03 07:59:01,626:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,627:INFO:intervals before: (0, 577649), (0, 3960494)\n", + "2023-11-03 07:59:01,629:INFO:the tp solutions: (463619.93210199993, 463737.772498)\n", + "2023-11-03 07:59:01,630:INFO:the tn solutions: (4027653.278316, 4028696.899884)\n", + "2023-11-03 07:59:01,631:INFO:intervals after: [(463620, 463737)], []\n", + "2023-11-03 07:59:01,632:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,633:INFO:intervals before: [(463620, 463737)], []\n", + "2023-11-03 07:59:01,634:INFO:the tp solutions: (538414.068426, 540147.7903740001)\n", + "2023-11-03 07:59:01,635:INFO:the tn solutions: (3952169.0416119997, 3952976.982388)\n", + "2023-11-03 07:59:01,636:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,636:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,637:INFO:intervals before: [], []\n", + "2023-11-03 07:59:01,639:INFO:the tp solutions: (463619.93210199993, 463737.772498)\n", + "2023-11-03 07:59:01,640:INFO:the tn solutions: (3952169.0416119997, 3952976.982388)\n", + "2023-11-03 07:59:01,641:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,642:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:59:01,642:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:59:01,643:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,644:INFO:final number of intervals: 0\n", + "2023-11-03 07:59:01,645:INFO:final number of pairs: 0\n", + "2023-11-03 07:59:01,673:INFO:checking the scores {'acc': 0.9898, 'sens': 0.8027, 'spec': 0.998}\n", + "2023-11-03 07:59:01,675:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,677:INFO:intervals before: (0, 577945), (0, 6021255)\n", + "2023-11-03 07:59:01,679:INFO:the tp solutions: (463857.50110999995, 463975.40189000004)\n", + "2023-11-03 07:59:01,681:INFO:the tn solutions: (6067239.63971, 6068703.777290001)\n", + "2023-11-03 07:59:01,682:INFO:intervals after: [(463858, 463975)], []\n", + "2023-11-03 07:59:01,686:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,687:INFO:intervals before: [(463858, 463975)], []\n", + "2023-11-03 07:59:01,688:INFO:the tp solutions: (521388.38358999975, 523962.9564100001)\n", + "2023-11-03 07:59:01,689:INFO:the tn solutions: (6008598.32199, 6009826.65801)\n", + "2023-11-03 07:59:01,692:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,694:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,695:INFO:intervals before: [], []\n", + "2023-11-03 07:59:01,696:INFO:the tp solutions: (463857.50110999995, 463975.40189000004)\n", + "2023-11-03 07:59:01,697:INFO:the tn solutions: (6008598.32199, 6009826.65801)\n", + "2023-11-03 07:59:01,698:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,700:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:59:01,701:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:59:01,703:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,704:INFO:final number of intervals: 0\n", + "2023-11-03 07:59:01,705:INFO:final number of pairs: 0\n" ] } ], @@ -282,53 +282,53 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:05,527:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:05,529:INFO:calling the score check with scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}, uncertainty 0.0001, p 32886 and n 192841\n", - "2023-10-26 23:42:05,531:INFO:checking the scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}\n", - "2023-10-26 23:42:05,533:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,534:INFO:intervals before: (0, 32886), (0, 192841)\n", - "2023-10-26 23:42:05,536:INFO:the tp solutions: (18666.027828, 18672.736572)\n", - "2023-10-26 23:42:05,537:INFO:the tn solutions: (191749.521374, 191802.27842600003)\n", - "2023-10-26 23:42:05,539:INFO:intervals after: [(18667, 18672)], [(191750, 191802)]\n", - "2023-10-26 23:42:05,541:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,543:INFO:intervals before: [(18667, 18672)], [(191750, 191802)]\n", - "2023-10-26 23:42:05,544:INFO:the tp solutions: (18641.497764, 18726.88563600005)\n", - "2023-10-26 23:42:05,545:INFO:the tn solutions: (191741.42061799997, 191780.760182)\n", - "2023-10-26 23:42:05,548:INFO:intervals after: [(18667, 18672)], [(191750, 191780)]\n", - "2023-10-26 23:42:05,550:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,551:INFO:intervals before: [(18667, 18672)], [(191750, 191780)]\n", - "2023-10-26 23:42:05,553:INFO:the tp solutions: (18666.027828, 18672.736572)\n", - "2023-10-26 23:42:05,554:INFO:the tn solutions: (191741.42061799997, 191780.760182)\n", - "2023-10-26 23:42:05,556:INFO:intervals after: [(18667, 18672)], [(191750, 191780)]\n", - "2023-10-26 23:42:05,557:INFO:testing acc, feasible tptn pairs: 6\n", - "2023-10-26 23:42:05,559:INFO:testing sens, feasible tptn pairs: 6\n", - "2023-10-26 23:42:05,561:INFO:testing spec, feasible tptn pairs: 6\n", - "2023-10-26 23:42:05,564:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,566:INFO:final number of intervals: 6\n", - "2023-10-26 23:42:05,568:INFO:final number of pairs: 165\n", - "2023-10-26 23:42:05,569:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:05,571:INFO:calling the score check with scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}, uncertainty 0.0001, p 32893 and n 297067\n", - "2023-10-26 23:42:05,584:INFO:checking the scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}\n", - "2023-10-26 23:42:05,587:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,589:INFO:intervals before: (0, 32893), (0, 297067)\n", - "2023-10-26 23:42:05,590:INFO:the tp solutions: (18670.001013999998, 18676.711186)\n", - "2023-10-26 23:42:05,592:INFO:the tn solutions: (288911.3408939999, 288985.36290600005)\n", - "2023-10-26 23:42:05,593:INFO:intervals after: [(18671, 18676)], [(288912, 288985)]\n", - "2023-10-26 23:42:05,595:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,596:INFO:intervals before: [(18671, 18676)], [(288912, 288985)]\n", - "2023-10-26 23:42:05,597:INFO:the tp solutions: (12154.326445999963, 12282.239954000048)\n", - "2023-10-26 23:42:05,599:INFO:the tn solutions: (295373.123966, 295433.725634)\n", - "2023-10-26 23:42:05,602:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,604:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,606:INFO:intervals before: [], []\n", - "2023-10-26 23:42:05,607:INFO:the tp solutions: (18670.001013999998, 18676.711186)\n", - "2023-10-26 23:42:05,609:INFO:the tn solutions: (295373.123966, 295433.725634)\n", - "2023-10-26 23:42:05,610:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,611:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:05,612:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:05,613:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,615:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:05,616:INFO:final number of pairs: 0\n" + "2023-11-03 07:59:01,757:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 07:59:01,758:INFO:calling the score check with scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}, uncertainty 0.0001, p 32886 and n 192841\n", + "2023-11-03 07:59:01,761:INFO:checking the scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}\n", + "2023-11-03 07:59:01,762:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,764:INFO:intervals before: (0, 32886), (0, 192841)\n", + "2023-11-03 07:59:01,765:INFO:the tp solutions: (18666.027828, 18672.736572)\n", + "2023-11-03 07:59:01,767:INFO:the tn solutions: (191749.521374, 191802.27842600003)\n", + "2023-11-03 07:59:01,771:INFO:intervals after: [(18667, 18672)], [(191750, 191802)]\n", + "2023-11-03 07:59:01,772:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,773:INFO:intervals before: [(18667, 18672)], [(191750, 191802)]\n", + "2023-11-03 07:59:01,775:INFO:the tp solutions: (18641.497764, 18726.88563600005)\n", + "2023-11-03 07:59:01,777:INFO:the tn solutions: (191741.42061799997, 191780.760182)\n", + "2023-11-03 07:59:01,779:INFO:intervals after: [(18667, 18672)], [(191750, 191780)]\n", + "2023-11-03 07:59:01,780:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,782:INFO:intervals before: [(18667, 18672)], [(191750, 191780)]\n", + "2023-11-03 07:59:01,783:INFO:the tp solutions: (18666.027828, 18672.736572)\n", + "2023-11-03 07:59:01,784:INFO:the tn solutions: (191741.42061799997, 191780.760182)\n", + "2023-11-03 07:59:01,786:INFO:intervals after: [(18667, 18672)], [(191750, 191780)]\n", + "2023-11-03 07:59:01,787:INFO:testing acc, feasible tptn pairs: 6\n", + "2023-11-03 07:59:01,789:INFO:testing sens, feasible tptn pairs: 6\n", + "2023-11-03 07:59:01,790:INFO:testing spec, feasible tptn pairs: 6\n", + "2023-11-03 07:59:01,791:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,792:INFO:final number of intervals: 6\n", + "2023-11-03 07:59:01,794:INFO:final number of pairs: 165\n", + "2023-11-03 07:59:01,795:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 07:59:01,796:INFO:calling the score check with scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}, uncertainty 0.0001, p 32893 and n 297067\n", + "2023-11-03 07:59:01,797:INFO:checking the scores {'acc': 0.9323, 'sens': 0.5677, 'spec': 0.9944}\n", + "2023-11-03 07:59:01,798:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,799:INFO:intervals before: (0, 32893), (0, 297067)\n", + "2023-11-03 07:59:01,800:INFO:the tp solutions: (18670.001013999998, 18676.711186)\n", + "2023-11-03 07:59:01,801:INFO:the tn solutions: (288911.3408939999, 288985.36290600005)\n", + "2023-11-03 07:59:01,802:INFO:intervals after: [(18671, 18676)], [(288912, 288985)]\n", + "2023-11-03 07:59:01,803:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,805:INFO:intervals before: [(18671, 18676)], [(288912, 288985)]\n", + "2023-11-03 07:59:01,806:INFO:the tp solutions: (12154.326445999963, 12282.239954000048)\n", + "2023-11-03 07:59:01,815:INFO:the tn solutions: (295373.123966, 295433.725634)\n", + "2023-11-03 07:59:01,816:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,818:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,819:INFO:intervals before: [], []\n", + "2023-11-03 07:59:01,820:INFO:the tp solutions: (18670.001013999998, 18676.711186)\n", + "2023-11-03 07:59:01,821:INFO:the tn solutions: (295373.123966, 295433.725634)\n", + "2023-11-03 07:59:01,822:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,823:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:59:01,824:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:59:01,826:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,827:INFO:final number of intervals: 0\n", + "2023-11-03 07:59:01,828:INFO:final number of pairs: 0\n" ] } ], @@ -394,53 +394,53 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:05,688:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:05,691:INFO:calling the score check with scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}, uncertainty 0.0001, p 29412 and n 194965\n", - "2023-10-26 23:42:05,694:INFO:checking the scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}\n", - "2023-10-26 23:42:05,696:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,697:INFO:intervals before: (0, 29412), (0, 194965)\n", - "2023-10-26 23:42:05,700:INFO:the tp solutions: (21779.527176, 21785.527224)\n", - "2023-10-26 23:42:05,701:INFO:the tn solutions: (194333.950422, 194385.72337800002)\n", - "2023-10-26 23:42:05,704:INFO:intervals after: [(21780, 21785)], [(194334, 194385)]\n", - "2023-10-26 23:42:05,706:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,711:INFO:intervals before: [(21780, 21785)], [(194334, 194385)]\n", - "2023-10-26 23:42:05,713:INFO:the tp solutions: (24078.562715999986, 24164.108484000026)\n", - "2023-10-26 23:42:05,715:INFO:the tn solutions: (192001.14207, 192040.91493)\n", - "2023-10-26 23:42:05,717:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,719:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,721:INFO:intervals before: [], []\n", - "2023-10-26 23:42:05,724:INFO:the tp solutions: (21779.527176, 21785.527224)\n", - "2023-10-26 23:42:05,728:INFO:the tn solutions: (192001.14207, 192040.91493)\n", - "2023-10-26 23:42:05,731:INFO:intervals after: [], []\n", - "2023-10-26 23:42:05,733:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:05,747:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:05,749:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,751:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:05,753:INFO:final number of pairs: 0\n", - "2023-10-26 23:42:05,754:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:05,755:INFO:calling the score check with scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}, uncertainty 0.0001, p 29440 and n 300520\n", - "2023-10-26 23:42:05,756:INFO:checking the scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}\n", - "2023-10-26 23:42:05,758:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:05,759:INFO:intervals before: (0, 29440), (0, 300520)\n", - "2023-10-26 23:42:05,761:INFO:the tp solutions: (21800.26112, 21806.266880000003)\n", - "2023-10-26 23:42:05,766:INFO:the tn solutions: (296010.5452, 296083.86280000006)\n", - "2023-10-26 23:42:05,768:INFO:intervals after: [(21801, 21806)], [(296011, 296083)]\n", - "2023-10-26 23:42:05,770:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:05,772:INFO:intervals before: [(21801, 21806)], [(296011, 296083)]\n", - "2023-10-26 23:42:05,773:INFO:the tp solutions: (21804.011040000012, 21932.62896000006)\n", - "2023-10-26 23:42:05,774:INFO:the tn solutions: (295951.49496, 296012.80104)\n", - "2023-10-26 23:42:05,776:INFO:intervals after: [(21805, 21806)], [(296011, 296012)]\n", - "2023-10-26 23:42:05,778:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:05,780:INFO:intervals before: [(21805, 21806)], [(296011, 296012)]\n", - "2023-10-26 23:42:05,783:INFO:the tp solutions: (21800.26112, 21806.266880000003)\n", - "2023-10-26 23:42:05,785:INFO:the tn solutions: (295951.49496, 296012.80104)\n", - "2023-10-26 23:42:05,798:INFO:intervals after: [(21805, 21806)], [(296011, 296012)]\n", - "2023-10-26 23:42:05,802:INFO:testing acc, feasible tptn pairs: 2\n", - "2023-10-26 23:42:05,804:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-10-26 23:42:05,806:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-10-26 23:42:05,807:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:05,809:INFO:final number of intervals: 1\n", - "2023-10-26 23:42:05,810:INFO:final number of pairs: 1\n" + "2023-11-03 07:59:01,874:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 07:59:01,876:INFO:calling the score check with scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}, uncertainty 0.0001, p 29412 and n 194965\n", + "2023-11-03 07:59:01,877:INFO:checking the scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}\n", + "2023-11-03 07:59:01,878:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,880:INFO:intervals before: (0, 29412), (0, 194965)\n", + "2023-11-03 07:59:01,881:INFO:the tp solutions: (21779.527176, 21785.527224)\n", + "2023-11-03 07:59:01,882:INFO:the tn solutions: (194333.950422, 194385.72337800002)\n", + "2023-11-03 07:59:01,883:INFO:intervals after: [(21780, 21785)], [(194334, 194385)]\n", + "2023-11-03 07:59:01,886:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,887:INFO:intervals before: [(21780, 21785)], [(194334, 194385)]\n", + "2023-11-03 07:59:01,889:INFO:the tp solutions: (24078.562715999986, 24164.108484000026)\n", + "2023-11-03 07:59:01,895:INFO:the tn solutions: (192001.14207, 192040.91493)\n", + "2023-11-03 07:59:01,896:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,897:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,898:INFO:intervals before: [], []\n", + "2023-11-03 07:59:01,899:INFO:the tp solutions: (21779.527176, 21785.527224)\n", + "2023-11-03 07:59:01,901:INFO:the tn solutions: (192001.14207, 192040.91493)\n", + "2023-11-03 07:59:01,902:INFO:intervals after: [], []\n", + "2023-11-03 07:59:01,903:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:59:01,904:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:59:01,904:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,905:INFO:final number of intervals: 0\n", + "2023-11-03 07:59:01,906:INFO:final number of pairs: 0\n", + "2023-11-03 07:59:01,907:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 07:59:01,908:INFO:calling the score check with scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}, uncertainty 0.0001, p 29440 and n 300520\n", + "2023-11-03 07:59:01,909:INFO:checking the scores {'acc': 0.9633, 'sens': 0.7406, 'spec': 0.9849}\n", + "2023-11-03 07:59:01,911:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:59:01,918:INFO:intervals before: (0, 29440), (0, 300520)\n", + "2023-11-03 07:59:01,920:INFO:the tp solutions: (21800.26112, 21806.266880000003)\n", + "2023-11-03 07:59:01,921:INFO:the tn solutions: (296010.5452, 296083.86280000006)\n", + "2023-11-03 07:59:01,923:INFO:intervals after: [(21801, 21806)], [(296011, 296083)]\n", + "2023-11-03 07:59:01,924:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:59:01,925:INFO:intervals before: [(21801, 21806)], [(296011, 296083)]\n", + "2023-11-03 07:59:01,926:INFO:the tp solutions: (21804.011040000012, 21932.62896000006)\n", + "2023-11-03 07:59:01,927:INFO:the tn solutions: (295951.49496, 296012.80104)\n", + "2023-11-03 07:59:01,931:INFO:intervals after: [(21805, 21806)], [(296011, 296012)]\n", + "2023-11-03 07:59:01,933:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:59:01,935:INFO:intervals before: [(21805, 21806)], [(296011, 296012)]\n", + "2023-11-03 07:59:01,936:INFO:the tp solutions: (21800.26112, 21806.266880000003)\n", + "2023-11-03 07:59:01,939:INFO:the tn solutions: (295951.49496, 296012.80104)\n", + "2023-11-03 07:59:01,941:INFO:intervals after: [(21805, 21806)], [(296011, 296012)]\n", + "2023-11-03 07:59:01,942:INFO:testing acc, feasible tptn pairs: 2\n", + "2023-11-03 07:59:01,944:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 07:59:01,945:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 07:59:01,946:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:59:01,947:INFO:final number of intervals: 1\n", + "2023-11-03 07:59:01,948:INFO:final number of pairs: 1\n" ] } ], diff --git a/notebooks/illustration/21_retina_stare.ipynb b/notebooks/illustration/bundles/01_retina_stare.ipynb similarity index 100% rename from notebooks/illustration/21_retina_stare.ipynb rename to notebooks/illustration/bundles/01_retina_stare.ipynb diff --git a/notebooks/illustration/22_retina_chasedb1.ipynb b/notebooks/illustration/bundles/02_retina_chasedb1.ipynb similarity index 100% rename from notebooks/illustration/22_retina_chasedb1.ipynb rename to notebooks/illustration/bundles/02_retina_chasedb1.ipynb diff --git a/notebooks/illustration/23_retina_hrf.ipynb b/notebooks/illustration/bundles/03_retina_hrf.ipynb similarity index 100% rename from notebooks/illustration/23_retina_hrf.ipynb rename to notebooks/illustration/bundles/03_retina_hrf.ipynb diff --git a/notebooks/illustration/24_retina_diaretdb0.ipynb b/notebooks/illustration/bundles/04_retina_diaretdb0.ipynb similarity index 100% rename from notebooks/illustration/24_retina_diaretdb0.ipynb rename to notebooks/illustration/bundles/04_retina_diaretdb0.ipynb diff --git a/notebooks/illustration/25_retina_diaretdb1.ipynb b/notebooks/illustration/bundles/05_retina_diaretdb1.ipynb similarity index 100% rename from notebooks/illustration/25_retina_diaretdb1.ipynb rename to notebooks/illustration/bundles/05_retina_diaretdb1.ipynb diff --git a/notebooks/illustration/26_drishti_gs.ipynb b/notebooks/illustration/bundles/06_drishti_gs.ipynb similarity index 100% rename from notebooks/illustration/26_drishti_gs.ipynb rename to notebooks/illustration/bundles/06_drishti_gs.ipynb diff --git a/notebooks/illustration/27_tpehg.ipynb b/notebooks/illustration/bundles/07_tpehg.ipynb similarity index 100% rename from notebooks/illustration/27_tpehg.ipynb rename to notebooks/illustration/bundles/07_tpehg.ipynb diff --git a/notebooks/illustration/28_isic2016.ipynb b/notebooks/illustration/bundles/08_isic2016.ipynb similarity index 100% rename from notebooks/illustration/28_isic2016.ipynb rename to notebooks/illustration/bundles/08_isic2016.ipynb diff --git a/notebooks/illustration/29_isic2017.ipynb b/notebooks/illustration/bundles/09_isic2017.ipynb similarity index 100% rename from notebooks/illustration/29_isic2017.ipynb rename to notebooks/illustration/bundles/09_isic2017.ipynb diff --git a/notebooks/illustration/30_skin_lesion_analysis.ipynb b/notebooks/illustration/bundles/10_skin_lesion_analysis.ipynb similarity index 100% rename from notebooks/illustration/30_skin_lesion_analysis.ipynb rename to notebooks/illustration/bundles/10_skin_lesion_analysis.ipynb diff --git a/notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb similarity index 69% rename from notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb rename to notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb index 29721aa..6e4ecb6 100644 --- a/notebooks/illustration/10_check_1_testset_no_kfold_macro.ipynb +++ b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb @@ -40,7 +40,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00c2a3cf93104f659d5d86c75f078d01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00c2a3cf93104f659d5d86c75f078d01-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/badad7e8f243451a8bf6d68fc8fc15ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/badad7e8f243451a8bf6d68fc8fc15ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -52,38 +52,40 @@ "Option for timeMode changed from cpu to elapsed\n", "Continuous objective value is 0 - 0.00 seconds\n", "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 127 iterations and 0 nodes (0.02 seconds)\n", - "Cbc0031I 3 added rows had average density of 5\n", - "Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 180 row cuts average 5.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0031I 2 added rows had average density of 6\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 39 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 86 row cuts average 5.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 4 row cuts average 2.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 8 row cuts average 2.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 16 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 0, took 127 iterations and 0 nodes (0.02 seconds)\n", - "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 10 row cuts average 3.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 81 iterations and 3 nodes (0.03 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 81 iterations and 3 nodes (0.03 seconds)\n", + "Cbc0032I Strong branching done 20 times (30 iterations), fathomed 0 nodes and fixed 4 variables\n", + "Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 100 times and created 180 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 100 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 39 times and created 86 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Knapsack was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 39 times and created 8 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 39 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", "\n", "Objective value: 0.00000000\n", - "Enumerated nodes: 0\n", - "Total iterations: 127\n", - "Time (CPU seconds): 0.01\n", - "Time (Wallclock seconds): 0.02\n", + "Enumerated nodes: 3\n", + "Total iterations: 81\n", + "Time (CPU seconds): 0.02\n", + "Time (Wallclock seconds): 0.03\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.04\n", "\n" ] }, @@ -114,7 +116,7 @@ }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -123,7 +125,7 @@ "0.8464" ] }, - "execution_count": 7, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -134,7 +136,7 @@ }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 7, "metadata": {}, "outputs": [ { @@ -145,7 +147,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eaeb7a0ad078473dbe2dddaf2bd31a42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eaeb7a0ad078473dbe2dddaf2bd31a42-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5952abbbfeb145e294b218834ac9311c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5952abbbfeb145e294b218834ac9311c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -167,7 +169,7 @@ "True" ] }, - "execution_count": 6, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb new file mode 100644 index 0000000..7c6be93 --- /dev/null +++ b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb @@ -0,0 +1,313 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [], + "source": [ + "testset = {0: 10, 1: 100, 2: 80}" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [], + "source": [ + "scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368,\n", + " 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 07:31:27,081:INFO:checking the scores {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-03 07:31:27,084:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:31:27,086:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-03 07:31:27,088:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,090:INFO:the tn solutions: (241.92548, 242.08052000000006)\n", + "2023-11-03 07:31:27,091:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,093:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:31:27,094:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,096:INFO:the tp solutions: (51.92509999999996, 52.11890000000008)\n", + "2023-11-03 07:31:27,097:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,099:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,100:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 07:31:27,102:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,103:INFO:the tp solutions: (51.886339999999905, 52.157659999999964)\n", + "2023-11-03 07:31:27,104:INFO:the tn solutions: (241.79020000000003, 242.17780000000016)\n", + "2023-11-03 07:31:27,106:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,107:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 07:31:27,108:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,110:INFO:the tp solutions: (51.92507006183688, 52.081026437634286)\n", + "2023-11-03 07:31:27,112:INFO:the tn solutions: (241.57858662847494, 242.42776991777123)\n", + "2023-11-03 07:31:27,113:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,114:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 07:31:27,115:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,117:INFO:the tp solutions: (51.36701642883198, 52.50098353406811)\n", + "2023-11-03 07:31:27,119:INFO:the tn solutions: (241.71814351243938, 242.4273174965254)\n", + "2023-11-03 07:31:27,120:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,122:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:31:27,124:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,126:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,128:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,129:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,131:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-03 07:31:27,133:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,135:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,137:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-03 07:31:27,139:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,140:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 07:31:27,142:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,143:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,145:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-03 07:31:27,147:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,149:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-03 07:31:27,151:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,153:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,154:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-03 07:31:27,156:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,158:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 07:31:27,160:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,161:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-03 07:31:27,163:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,164:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,166:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 07:31:27,168:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,170:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-03 07:31:27,172:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,173:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,175:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 07:31:27,177:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,178:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-03 07:31:27,180:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,182:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,186:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-03 07:31:27,220:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,221:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-03 07:31:27,223:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-03 07:31:27,224:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,226:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-03 07:31:27,227:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,228:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-03 07:31:27,230:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-03 07:31:27,231:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,237:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-03 07:31:27,239:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,240:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-03 07:31:27,242:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-03 07:31:27,243:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 07:31:27,246:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,247:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,250:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,251:INFO:testing bacc, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,253:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,255:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-03 07:31:27,257:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:31:27,259:INFO:final number of intervals: 1\n", + "2023-11-03 07:31:27,260:INFO:final number of pairs: 1\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "results = check_1_testset_no_kfold_micro(testset=testset,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8184" + ] + }, + "execution_count": 6, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 07:31:27,328:INFO:checking the scores {'acc': 0.8184, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-03 07:31:27,332:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:31:27,333:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-03 07:31:27,337:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,338:INFO:the tn solutions: (414.40747999999996, 414.56252000000006)\n", + "2023-11-03 07:31:27,341:INFO:intervals after: [(52, 52)], []\n", + "2023-11-03 07:31:27,342:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:31:27,344:INFO:intervals before: [(52, 52)], []\n", + "2023-11-03 07:31:27,346:INFO:the tp solutions: (224.40709999999993, 224.60090000000005)\n", + "2023-11-03 07:31:27,348:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,350:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,352:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 07:31:27,354:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,356:INFO:the tp solutions: (-120.5956600000001, -120.32434000000003)\n", + "2023-11-03 07:31:27,357:INFO:the tn solutions: (586.7542, 587.1418000000001)\n", + "2023-11-03 07:31:27,358:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,360:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 07:31:27,362:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,363:INFO:the tp solutions: (-52.380008276554186, -52.22355994266834)\n", + "2023-11-03 07:31:27,365:INFO:the tn solutions: (518.2017689236844, 519.3782066236661)\n", + "2023-11-03 07:31:27,374:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,375:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 07:31:27,377:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,378:INFO:the tp solutions: (-177.7588589361954, -176.30973375743184)\n", + "2023-11-03 07:31:27,379:INFO:the tn solutions: (642.8041190131622, 644.2405509161804)\n", + "2023-11-03 07:31:27,381:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,382:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:31:27,384:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,386:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,387:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,389:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,390:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-03 07:31:27,392:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,395:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,396:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-03 07:31:27,398:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,399:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 07:31:27,401:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,403:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,404:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-03 07:31:27,413:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,415:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-03 07:31:27,417:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,420:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 07:31:27,421:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-03 07:31:27,423:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,425:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 07:31:27,427:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,429:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-03 07:31:27,430:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,432:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,434:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 07:31:27,436:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,438:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-03 07:31:27,439:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,440:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,442:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 07:31:27,443:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,444:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-03 07:31:27,445:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 07:31:27,446:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,448:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-03 07:31:27,450:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,451:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-03 07:31:27,453:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-03 07:31:27,455:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,456:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-03 07:31:27,458:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,460:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-03 07:31:27,461:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-03 07:31:27,463:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,464:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-03 07:31:27,466:INFO:intervals before: [], []\n", + "2023-11-03 07:31:27,467:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-03 07:31:27,470:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-03 07:31:27,472:INFO:intervals after: [], []\n", + "2023-11-03 07:31:27,473:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:31:27,475:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:31:27,476:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:31:27,479:INFO:final number of intervals: 0\n", + "2023-11-03 07:31:27,481:INFO:final number of pairs: 0\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 7, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "results = check_1_testset_no_kfold_micro(testset=testset,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "results['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb similarity index 88% rename from notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb rename to notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb index 345bb09..a953e93 100644 --- a/notebooks/illustration/12_check_1_dataset_known_folds_mos_macro.ipynb +++ b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 9, "metadata": {}, "outputs": [], "source": [ @@ -12,27 +12,18 @@ }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 10, "metadata": {}, "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[array([[ 2, 5],\n", - " [25, 36]]), array([[ 3, 3],\n", - " [28, 34]])]\n" - ] - }, { "data": { "text/plain": [ - "({0: 13, 1: 123},\n", - " {'folds': [{0: 7, 1: 61}, {0: 6, 1: 62}]},\n", - " {'acc': 0.5515, 'sens': 0.4811, 'spec': 0.4811, 'f1p': 0.4181})" + "({0: 142, 1: 146, 2: 103, 3: 57, 4: 128},\n", + " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6889, 'sens': 0.2133, 'spec': 0.8045, 'f1p': 0.2106})" ] }, - "execution_count": 2, + "execution_count": 10, "metadata": {}, "output_type": "execute_result" } @@ -48,7 +39,7 @@ }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 11, "metadata": {}, "outputs": [], "source": [ @@ -59,7 +50,7 @@ }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 12, "metadata": {}, "outputs": [ { @@ -70,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88462154398348c9a9ea9fe9c9cb55b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88462154398348c9a9ea9fe9c9cb55b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0cecdd185da44de4b321667ccbeea9ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cecdd185da44de4b321667ccbeea9ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -114,7 +105,7 @@ "False" ] }, - "execution_count": 4, + "execution_count": 12, "metadata": {}, "output_type": "execute_result" } @@ -129,7 +120,7 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 13, "metadata": {}, "outputs": [], "source": [ @@ -138,16 +129,16 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": 14, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "0.8745" + "0.8754500000000001" ] }, - "execution_count": 10, + "execution_count": 14, "metadata": {}, "output_type": "execute_result" } @@ -158,7 +149,7 @@ }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 15, "metadata": {}, "outputs": [], "source": [ @@ -167,7 +158,7 @@ }, { "cell_type": "code", - "execution_count": 9, + "execution_count": 16, "metadata": {}, "outputs": [ { @@ -178,7 +169,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/09ca052c964d4dbf9f5b70492cb677de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09ca052c964d4dbf9f5b70492cb677de-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/04fc7f6d0109493d910358249ea0e013-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04fc7f6d0109493d910358249ea0e013-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -200,7 +191,7 @@ "True" ] }, - "execution_count": 9, + "execution_count": 16, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb similarity index 82% rename from notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb rename to notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb index 33ea004..7395622 100644 --- a/notebooks/illustration/13_check_1_dataset_known_folds_mos_micro.ipynb +++ b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb @@ -15,23 +15,12 @@ "execution_count": 2, "metadata": {}, "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[array([[17, 8, 8],\n", - " [31, 27, 31],\n", - " [30, 24, 22]]), array([[14, 9, 10],\n", - " [28, 30, 31],\n", - " [23, 25, 27]])]\n" - ] - }, { "data": { "text/plain": [ - "({0: 66, 1: 178, 2: 151},\n", - " {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]},\n", - " {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469})" + "({0: 199, 1: 60, 2: 23},\n", + " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.5579, 'sens': 0.3369, 'spec': 0.6684, 'f1p': 0.3369})" ] }, "execution_count": 2, @@ -50,7 +39,7 @@ }, { "cell_type": "code", - "execution_count": 9, + "execution_count": 3, "metadata": {}, "outputs": [], "source": [ @@ -61,7 +50,7 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": 4, "metadata": {}, "outputs": [ { @@ -72,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d27ee8bf7d1043439d67e8ae87521824-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d27ee8bf7d1043439d67e8ae87521824-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e009025829c4f828555c93d4f4148be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e009025829c4f828555c93d4f4148be-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -116,33 +105,33 @@ "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0004I processed model has 3 rows, 4 columns (4 integer (0 of which binary)) and 8 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 18 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 16 iterations and 0 nodes (0.01 seconds)\n", "Cbc0031I 2 added rows had average density of 2\n", - "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 33 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 75 column cuts (75 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 19 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 30 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 79 column cuts (79 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 10 row cuts average 1.9 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 15 row cuts average 2.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 0, took 18 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 9 row cuts average 1.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 16 iterations and 0 nodes (0.01 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 33 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Gomory was tried 33 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 33 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 30 times and created 79 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 30 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 30 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", "\n", "Objective value: 0.00000000\n", "Enumerated nodes: 0\n", - "Total iterations: 18\n", + "Total iterations: 16\n", "Time (CPU seconds): 0.01\n", "Time (Wallclock seconds): 0.01\n", "\n", @@ -157,7 +146,7 @@ "False" ] }, - "execution_count": 10, + "execution_count": 4, "metadata": {}, "output_type": "execute_result" } @@ -172,7 +161,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ @@ -181,7 +170,7 @@ }, { "cell_type": "code", - "execution_count": 12, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -190,7 +179,7 @@ "0.8367" ] }, - "execution_count": 12, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -201,7 +190,7 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": 7, "metadata": {}, "outputs": [], "source": [ @@ -210,7 +199,7 @@ }, { "cell_type": "code", - "execution_count": 14, + "execution_count": 8, "metadata": {}, "outputs": [ { @@ -221,7 +210,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d3584de4bc0646b28e5c732a9f9bb278-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3584de4bc0646b28e5c732a9f9bb278-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03719216d68f4aa2b4ebf4b72e318880-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03719216d68f4aa2b4ebf4b72e318880-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -243,7 +232,7 @@ "True" ] }, - "execution_count": 14, + "execution_count": 8, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb similarity index 85% rename from notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb rename to notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb index 0171e6f..2660a19 100644 --- a/notebooks/illustration/14_check_1_dataset_known_folds_som_macro.ipynb +++ b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb @@ -12,36 +12,23 @@ }, { "cell_type": "code", - "execution_count": 9, + "execution_count": 2, "metadata": {}, "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[array([[ 3, 6, 4, 4],\n", - " [17, 17, 18, 16],\n", - " [14, 23, 24, 24],\n", - " [23, 25, 21, 27]]), array([[ 4, 8, 2, 3],\n", - " [20, 12, 20, 15],\n", - " [21, 29, 24, 11],\n", - " [24, 31, 17, 24]])]\n" - ] - }, { "data": { "text/plain": [ - "({0: 34, 1: 135, 2: 170, 3: 192},\n", - " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.6271,\n", - " 'sens': 0.2422,\n", - " 'spec': 0.7525,\n", - " 'f1p': 0.2333,\n", + "({0: 186, 1: 115},\n", + " {'folds': [{0: 93, 1: 58}, {0: 93, 1: 57}]},\n", + " {'acc': 0.5017,\n", + " 'sens': 0.4955,\n", + " 'spec': 0.4955,\n", + " 'f1p': 0.4913,\n", " 'beta_positive': 2,\n", " 'beta_negative': 2})" ] }, - "execution_count": 9, + "execution_count": 2, "metadata": {}, "output_type": "execute_result" } @@ -57,7 +44,7 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": 3, "metadata": {}, "outputs": [], "source": [ @@ -68,7 +55,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": 4, "metadata": {}, "outputs": [ { @@ -79,7 +66,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6addc61179904c719d2706f406f6507c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6addc61179904c719d2706f406f6507c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd1fd9ce724e456fad6499136313e27a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd1fd9ce724e456fad6499136313e27a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -123,7 +110,7 @@ "False" ] }, - "execution_count": 11, + "execution_count": 4, "metadata": {}, "output_type": "execute_result" } @@ -138,7 +125,7 @@ }, { "cell_type": "code", - "execution_count": 12, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ @@ -147,7 +134,7 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -156,7 +143,7 @@ "0.87625" ] }, - "execution_count": 13, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } @@ -167,7 +154,7 @@ }, { "cell_type": "code", - "execution_count": 14, + "execution_count": 7, "metadata": {}, "outputs": [], "source": [ @@ -176,7 +163,7 @@ }, { "cell_type": "code", - "execution_count": 15, + "execution_count": 8, "metadata": {}, "outputs": [ { @@ -187,7 +174,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71dbcfe88d22424ab885c9f59b960897-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71dbcfe88d22424ab885c9f59b960897-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/007c9f03aacd4c34bbdb2a4a5900fa9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/007c9f03aacd4c34bbdb2a4a5900fa9d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -209,7 +196,7 @@ "True" ] }, - "execution_count": 15, + "execution_count": 8, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb new file mode 100644 index 0000000..6fc08c1 --- /dev/null +++ b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb @@ -0,0 +1,271 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro\n", + "from mlscorecheck.aggregated import generate_dataset_folding_multiclass" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "({0: 55, 1: 103},\n", + " {'folds': [{0: 28, 1: 51}, {0: 27, 1: 52}]},\n", + " {'acc': 0.4494,\n", + " 'sens': 0.4494,\n", + " 'spec': 0.4494,\n", + " 'f1p': 0.4494,\n", + " 'beta_positive': 2,\n", + " 'beta_negative': 2})" + ] + }, + "execution_count": 2, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "dataset, folding, scores = generate_dataset_folding_multiclass(random_state=None,\n", + " average='micro',\n", + " aggregation='som',\n", + " rounding_decimals=4,\n", + " subset=['acc', 'sens', 'spec', 'f1p'])\n", + "dataset, folding, scores" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "metadata": {}, + "outputs": [], + "source": [ + "dataset = {0: 86, 1: 96, 2: 59, 3: 105}\n", + "folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]}\n", + "scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 07:56:08,379:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-03 07:56:08,382:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:56:08,383:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-03 07:56:08,385:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,386:INFO:the tn solutions: (779.8805399999999, 780.23346)\n", + "2023-11-03 07:56:08,387:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,388:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:56:08,389:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,390:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", + "2023-11-03 07:56:08,391:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,392:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,393:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 07:56:08,394:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,395:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", + "2023-11-03 07:56:08,396:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", + "2023-11-03 07:56:08,398:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,399:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:56:08,400:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,401:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,402:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,402:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,403:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 07:56:08,404:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,405:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,405:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", + "2023-11-03 07:56:08,406:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,407:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 07:56:08,409:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,410:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-03 07:56:08,411:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,412:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 07:56:08,415:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 07:56:08,416:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 07:56:08,417:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 07:56:08,419:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 07:56:08,419:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:56:08,420:INFO:final number of intervals: 1\n", + "2023-11-03 07:56:08,421:INFO:final number of pairs: 1\n" + ] + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + ] + }, + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = (1.0 + scores['spec']) / 2.0" + ] + }, + { + "cell_type": "code", + "execution_count": 6, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "0.8756999999999999" + ] + }, + "execution_count": 6, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.8756" + ] + }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, + "outputs": [ + { + "name": "stderr", + "output_type": "stream", + "text": [ + "2023-11-03 07:56:08,470:INFO:checking the scores {'acc': 0.8756, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-03 07:56:08,471:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 07:56:08,473:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-03 07:56:08,474:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,475:INFO:the tn solutions: (1123.66614, 1124.01906)\n", + "2023-11-03 07:56:08,476:INFO:intervals after: [(88, 88)], []\n", + "2023-11-03 07:56:08,477:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 07:56:08,478:INFO:intervals before: [(88, 88)], []\n", + "2023-11-03 07:56:08,479:INFO:the tp solutions: (431.63015599999994, 432.1242440000002)\n", + "2023-11-03 07:56:08,480:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,484:INFO:intervals after: [], []\n", + "2023-11-03 07:56:08,485:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 07:56:08,486:INFO:intervals before: [], []\n", + "2023-11-03 07:56:08,487:INFO:the tp solutions: (29.316952326177706, 29.396674884278127)\n", + "2023-11-03 07:56:08,488:INFO:the tn solutions: (1181.921009301171, 1183.026325582998)\n", + "2023-11-03 07:56:08,489:INFO:intervals after: [], []\n", + "2023-11-03 07:56:08,490:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 07:56:08,491:INFO:intervals before: [], []\n", + "2023-11-03 07:56:08,492:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,493:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,495:INFO:intervals after: [], []\n", + "2023-11-03 07:56:08,496:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 07:56:08,497:INFO:intervals before: [], []\n", + "2023-11-03 07:56:08,498:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 07:56:08,499:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", + "2023-11-03 07:56:08,499:INFO:intervals after: [], []\n", + "2023-11-03 07:56:08,501:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 07:56:08,502:INFO:intervals before: [], []\n", + "2023-11-03 07:56:08,503:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-03 07:56:08,503:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 07:56:08,504:INFO:intervals after: [], []\n", + "2023-11-03 07:56:08,506:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 07:56:08,506:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 07:56:08,507:INFO:constructing final tp, tn pair set\n", + "2023-11-03 07:56:08,508:INFO:final number of intervals: 0\n", + "2023-11-03 07:56:08,509:INFO:final number of pairs: 0\n" + ] + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ + "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + ] + }, + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 8, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_dataset_known_folds_som_micro(dataset=dataset,\n", + " folding=folding,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} diff --git a/tests/check/binary/test_1_dataset_som_scores.py b/tests/check/binary/test_1_dataset_som_scores.py index 4ba882a..e89da7e 100644 --- a/tests/check/binary/test_1_dataset_som_scores.py +++ b/tests/check/binary/test_1_dataset_som_scores.py @@ -4,7 +4,7 @@ import pytest -from mlscorecheck.check.binary import check_1_dataset_som +from mlscorecheck.check.binary import check_1_dataset_kfold_som from mlscorecheck.aggregated import (generate_evaluation) @pytest.mark.parametrize('random_seed', list(range(10))) @@ -22,7 +22,7 @@ def test_consistency(random_seed: int, rounding_decimals: int): return_scores=True, rounding_decimals=rounding_decimals) - result = check_1_dataset_som(dataset=evaluation['dataset'], + result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -45,7 +45,7 @@ def test_failure(random_seed: int, rounding_decimals: int): return_scores=True) scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_1_dataset_som(dataset=evaluation['dataset'], + result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-rounding_decimals)) @@ -59,7 +59,7 @@ def test_adding_strategy(): evaluation = {'dataset': {'p': 5, 'n': 6}, 'folding': {'n_folds': 2, 'n_repeats': 1}} scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - result = check_1_dataset_som(dataset=evaluation['dataset'], + result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], folding=evaluation['folding'], scores=scores, eps=10**(-4)) From 9afdf3e80bcab52373761aa75f9d44b34714fdda Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 08:55:47 +0100 Subject: [PATCH 11/40] bundle docstrings improved --- mlscorecheck/check/bundles/ehg/_tpehg.py | 15 +- .../check/bundles/retina/_chasedb1.py | 109 +- .../check/bundles/retina/_diaretdb0.py | 73 +- .../check/bundles/retina/_diaretdb1.py | 99 +- .../check/bundles/retina/_drishti_gs.py | 104 +- mlscorecheck/check/bundles/retina/_drive.py | 150 +- mlscorecheck/check/bundles/retina/_hrf.py | 133 +- mlscorecheck/check/bundles/retina/_stare.py | 107 +- .../check/bundles/skinlesion/_isic2016.py | 34 +- .../check/bundles/skinlesion/_isic2017.py | 34 +- .../_check_1_dataset_known_folds_som_micro.py | 3 +- mlscorecheck/individual/_interval.py | 3 + ...is.ipynb => 00_skin_lesion_analysis.ipynb} | 0 .../{40_capsule.ipynb => 01_capsule.ipynb} | 0 .../bundles/01_retina_stare.ipynb | 124 +- .../bundles/02_retina_chasedb1.ipynb | 94 +- .../illustration/bundles/03_retina_hrf.ipynb | 182 +- .../bundles/04_retina_diaretdb0.ipynb | 72 +- .../bundles/05_retina_diaretdb1.ipynb | 352 +-- .../illustration/bundles/06_drishti_gs.ipynb | 205 +- notebooks/illustration/bundles/07_tpehg.ipynb | 1928 +++++++++-------- .../illustration/bundles/08_isic2016.ipynb | 50 +- .../illustration/bundles/09_isic2017.ipynb | 82 +- tests/individual/test_interval.py | 12 + 24 files changed, 2164 insertions(+), 1801 deletions(-) rename notebooks/illustration/{bundles/10_skin_lesion_analysis.ipynb => 00_skin_lesion_analysis.ipynb} (100%) rename notebooks/illustration/{40_capsule.ipynb => 01_capsule.ipynb} (100%) diff --git a/mlscorecheck/check/bundles/ehg/_tpehg.py b/mlscorecheck/check/bundles/ehg/_tpehg.py index 46828ca..e3008fe 100644 --- a/mlscorecheck/check/bundles/ehg/_tpehg.py +++ b/mlscorecheck/check/bundles/ehg/_tpehg.py @@ -22,7 +22,8 @@ def check_tpehg(scores: dict, Checks the cross-validated TPEHG scores Args: - scores (dict(str,float)): the dictionary of scores + scores (dict(str,float)): the dictionary of scores (supports only 'acc', 'sens', 'spec', + 'bacc') eps (float|dict(str,float)): the numerical uncertainties n_folds (int): the number of folds n_repeats (int): the number of repetitions @@ -39,7 +40,17 @@ def check_tpehg(scores: dict, is 1, it might slightly decrease the sensitivity. Returns: - dict: the result of the consistency testing + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list of dictionaries containing the details of the consistency tests. Each + entry contains the specification of the folds being tested and the + outcome of the ``check_1_dataset_known_folds_mos`` function. Examples: >>> from mlscorecheck.check.bundles.ehg import check_tpehg diff --git a/mlscorecheck/check/bundles/retina/_chasedb1.py b/mlscorecheck/check/bundles/retina/_chasedb1.py index cfdf182..fb0a0e3 100644 --- a/mlscorecheck/check/bundles/retina/_chasedb1.py +++ b/mlscorecheck/check/bundles/retina/_chasedb1.py @@ -43,13 +43,14 @@ def check_chasedb1_vessel_aggregated_mos(imageset, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores with calculated for some images of - the CHASEDB1 dataset with the mean-of-scores aggregation. + the CHASEDB1 dataset with the mean of scores aggregation. Args: imageset (str|list): 'all' if all images are used, or a list of identifiers of images (e.g. ['11R', '07L']) annotator (str): the annotation to be used ('manual1'/'manual2') - scores (dict): the scores to check + scores (dict): the scores to check (supports only 'acc', 'sens', + 'spec', 'bacc') eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -64,20 +65,22 @@ def check_chasedb1_vessel_aggregated_mos(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ data = get_experiment('retina.chase_db1') @@ -106,7 +109,12 @@ def check_chasedb1_vessel_aggregated_som(imageset, imageset (str|list): 'all' if all images are used, or a list of identifiers of images (e.g. ['11R', '07L']) annotator (str): the annotation to be used ('manual1'/'manual2') - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -115,15 +123,24 @@ def check_chasedb1_vessel_aggregated_som(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ data = get_experiment('retina.chase_db1') @@ -146,7 +163,8 @@ def check_chasedb1_vessel_aggregated(imageset, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Testing the scores calculated for the CHASEDB1 dataset + Testing the scores calculated for the CHASEDB1 dataset with both assumptions + on the mode of aggregation. Args: imageset (str|list): 'all' if all images are used, or a list of identifiers of @@ -167,9 +185,12 @@ def check_chasedb1_vessel_aggregated(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_aggregated @@ -219,7 +240,12 @@ def check_chasedb1_vessel_image(image_identifier: str, Args: image_identifier (str): the identifier of the image (like "11R") annotator (str): the annotation to use ('manual1'/'manual2') - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -228,9 +254,24 @@ def check_chasedb1_vessel_image(image_identifier: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.retina import check_chasedb1_vessel_image diff --git a/mlscorecheck/check/bundles/retina/_diaretdb0.py b/mlscorecheck/check/bundles/retina/_diaretdb0.py index 173072e..7124fe3 100644 --- a/mlscorecheck/check/bundles/retina/_diaretdb0.py +++ b/mlscorecheck/check/bundles/retina/_diaretdb0.py @@ -74,7 +74,12 @@ def check_diaretdb0_class_som(subset: str, class_name (str|list): the name of the class being evaluated ('neovascularisation'| 'hardexudates'|'softexudates'|'hemorrhages'|'redsmalldots'), a list if a list of classes is treated as positive - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -83,12 +88,24 @@ def check_diaretdb0_class_som(subset: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ testsets = _prepare_configuration_diaretdb0(subset, batch, @@ -97,7 +114,8 @@ def check_diaretdb0_class_som(subset: str, return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=True) def check_diaretdb0_class_mos(subset: str, @@ -130,7 +148,8 @@ def check_diaretdb0_class_mos(subset: str, class_name (str|list): the name of the class being evaluated ('neovascularisation'| 'hardexudates'|'softexudates'|'hemorrhages'|'redsmalldots'), a list if a list of classes is treated as positive - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested (supports only 'acc', 'sens', 'spec', + 'bacc') eps (float): the numerical uncertainty score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -145,17 +164,22 @@ def check_diaretdb0_class_mos(subset: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ testsets = _prepare_configuration_diaretdb0(subset, batch, @@ -216,9 +240,12 @@ def check_diaretdb0_class(subset: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_diaretdb0_class diff --git a/mlscorecheck/check/bundles/retina/_diaretdb1.py b/mlscorecheck/check/bundles/retina/_diaretdb1.py index 2eda87b..c1ef1d1 100644 --- a/mlscorecheck/check/bundles/retina/_diaretdb1.py +++ b/mlscorecheck/check/bundles/retina/_diaretdb1.py @@ -125,7 +125,12 @@ def check_diaretdb1_class(*, subset (str): the subset to be used ('train'/'test'), typically 'test' class_name (str|list): the name or list of names of classes used as "positive" confidence (float): the confidence threshold, typically 0.75 - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -134,12 +139,24 @@ def check_diaretdb1_class(*, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_class @@ -181,7 +198,12 @@ def check_diaretdb1_segmentation_image_assumption(*, class_name (str|list): the name or list of names of classes used as "positive" assumption (str): the assumption on the region of evaluation ('fov'/'all') confidence (float): the confidence threshold, typically 0.75 - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -190,12 +212,24 @@ def check_diaretdb1_segmentation_image_assumption(*, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ testset_test = _prepare_configuration_diaretdb1(subset='test', class_name=class_name, @@ -232,7 +266,12 @@ def check_diaretdb1_segmentation_image(*, image_identifier (str): the identifier of the image to be tested (e.g. '001') class_name (str|list): the name or list of names of classes used as "positive" confidence (float): the confidence threshold, typically 0.75 - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -241,9 +280,12 @@ def check_diaretdb1_segmentation_image(*, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_image @@ -322,9 +364,12 @@ def check_diaretdb1_segmentation_aggregated_assumption(*, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. """ testsets = _prepare_configuration_diaretdb1(subset=subset, @@ -373,7 +418,8 @@ def check_diaretdb1_segmentation_aggregated(*, """ Tests the scores describing the segmentation of multiple images of DIARETDB1 in an aggregated way. This test function supports binary the testing of binary subproblems (for example, the - pixels of the 'hardexudates' class being segmented in an image). + pixels of the 'hardexudates' class being segmented in an image). The test evaluates + both assumption on the region of evaluation. Args: subset (str|list): the subset of images to be used ('train'/'test') or the list of @@ -400,9 +446,12 @@ def check_diaretdb1_segmentation_aggregated(*, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_diaretdb1_segmentation_aggregated diff --git a/mlscorecheck/check/bundles/retina/_drishti_gs.py b/mlscorecheck/check/bundles/retina/_drishti_gs.py index e853a0f..a15d166 100644 --- a/mlscorecheck/check/bundles/retina/_drishti_gs.py +++ b/mlscorecheck/check/bundles/retina/_drishti_gs.py @@ -70,7 +70,12 @@ def check_drishti_gs_segmentation_image(image_identifier: str, confidence (float): the confidence level (in [0,1]), used for thresholding the soft segmentation ground truth image at threshold*255 target (str): the target anatomical part ('OD'/'OC') - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -79,12 +84,24 @@ def check_drishti_gs_segmentation_image(image_identifier: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_image @@ -126,7 +143,8 @@ def check_drishti_gs_segmentation_aggregated_mos(subset, confidence (float): the confidence level (in [0,1]), used for thresholding the soft segmentation ground truth image at threshold*255 target (str): the target anatomical part ('OD'/'OC') - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested (supports only 'acc', 'sens', 'spec', + 'bacc') eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -141,17 +159,22 @@ def check_drishti_gs_segmentation_aggregated_mos(subset, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ testsets = _prepare_testsets_drishti_gs(subset=subset, target=target, @@ -182,7 +205,12 @@ def check_drishti_gs_segmentation_aggregated_som(subset: str, confidence (float): the confidence level (in [0,1]), used for thresholding the soft segmentation ground truth image at threshold*255 target (str): the target anatomical part ('OD'/'OC') - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -191,12 +219,24 @@ def check_drishti_gs_segmentation_aggregated_som(subset: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ testsets = _prepare_testsets_drishti_gs(subset=subset, target=target, @@ -205,7 +245,8 @@ def check_drishti_gs_segmentation_aggregated_som(subset: str, return check_n_testsets_som_no_kfold(testsets=testsets, scores=scores, eps=eps, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=True) def check_drishti_gs_segmentation_aggregated(subset: str, confidence: float, @@ -242,9 +283,12 @@ def check_drishti_gs_segmentation_aggregated(subset: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_drishti_gs_segmentation_aggregated diff --git a/mlscorecheck/check/bundles/retina/_drive.py b/mlscorecheck/check/bundles/retina/_drive.py index 119da96..8a6cb9e 100644 --- a/mlscorecheck/check/bundles/retina/_drive.py +++ b/mlscorecheck/check/bundles/retina/_drive.py @@ -53,15 +53,17 @@ def check_drive_vessel_aggregated_mos_assumption(imageset, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores with calculated for some images of - the DRIVE dataset with the mean-of-scores aggregation. + Checking the consistency of scores calculated for some images of + the DRIVE dataset with the mean of scores aggregation and a particular + assumption on the region of evaluation. Args: imageset (str|list): 'train'/'test' for all images in the train or test set, or a list of identifiers of images (e.g. ['21', '22']) assumption (str): the assumption on the region of evaluation to test ('fov'/'all') annotator (int): the annotation to be used (1/2) (typically annotator 1 is used in papers) - scores (dict): the scores to check + scores (dict): the scores to check the scores to check (supports only 'acc', 'sens', + 'spec', 'bacc') eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -76,20 +78,22 @@ def check_drive_vessel_aggregated_mos_assumption(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ data = get_experiment('retina.drive') @@ -114,14 +118,20 @@ def check_drive_vessel_aggregated_som_assumption(imageset, numerical_tolerance=NUMERICAL_TOLERANCE): """ Tests the consistency of scores calculated on the DRIVE dataset using - the score-of-means aggregation. + the score of means aggregation and a particular assumption on the region + of evaluation. Args: imageset (str|list): 'train'/'test' for all images in the train or test set, or a list of identifiers of images (e.g. ['21', '22']) assumption (str): the assumption on the region of evaluation to test ('fov'/'all') annotator (int): the annotation to be used (1/2) (typically annotator 1 is used in papers) - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -130,15 +140,24 @@ def check_drive_vessel_aggregated_som_assumption(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ data = get_experiment('retina.drive') @@ -159,23 +178,45 @@ def check_drive_vessel_image_assumption(image_identifier: str, *, numerical_tolerance: float = NUMERICAL_TOLERANCE): """ - Testing the scores calculated for one image of the DRIVE dataset + Testing the scores calculated for one image of the DRIVE dataset with a particular + assumption on the region of evaluation. Args: image_identifier (str): the identifier of the image (like "21") assumption (str): the assumption on the region of evaluation to test ('fov'/'all') annotator (int): the annotation to use (1, 2) (typically annotator 1 is used in papers) - scores (dict(str,float)): the scores to be tested - eps (float): the numerical uncertainty - numerical_tolerance (float): the additional numerical tolerance + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. + eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores + numerical_tolerance (float): in practice, beyond the numerical uncertainty of + the scores, some further tolerance is applied. This is + orders of magnitude smaller than the uncertainty of the + scores. It does ensure that the specificity of the test + is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ images = get_experiment('retina.drive') testset = [image for image in images[(annotator, assumption)]['train']['images'] @@ -202,7 +243,11 @@ def check_drive_vessel_aggregated(imageset, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Testing the scores calculated for the DRIVE dataset with all assumptions + Testing the scores calculated for the DRIVE dataset with both assumptions + regarding the region of evaluation (using the FoV or all pixels of the images). + + The strength of the test can be improved by specifying the ``score_bounds`` (minimum + and maximum scores) for the images when available. Args: imageset (str|list): 'train'/'test' for all images in the train or test set, or a list of @@ -223,9 +268,12 @@ def check_drive_vessel_aggregated(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_aggregated @@ -278,12 +326,17 @@ def check_drive_vessel_image(image_identifier: str, numerical_tolerance: float = NUMERICAL_TOLERANCE): """ Testing the scores calculated for one image of the DRIVE dataset with - both assumptions on the region of evaluation ('fov'/'all') + both assumptions on the region of evaluation ('fov'/'all'). Args: image_identifier (str): the identifier of the image (like "21") annotator (int): the annotation to use (1, 2) (typically annotator 1 is used in papers) - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -292,9 +345,12 @@ def check_drive_vessel_image(image_identifier: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: A summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``'details*'``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_drive_vessel_image diff --git a/mlscorecheck/check/bundles/retina/_hrf.py b/mlscorecheck/check/bundles/retina/_hrf.py index 50c72f5..b8297a2 100644 --- a/mlscorecheck/check/bundles/retina/_hrf.py +++ b/mlscorecheck/check/bundles/retina/_hrf.py @@ -51,12 +51,13 @@ def check_hrf_vessel_aggregated_mos_assumption(imageset, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Checking the consistency of scores with calculated for some images of - the HRF dataset with the mean-of-scores aggregation. + the HRF dataset with the mean of scores aggregation and an assumption on + the region of evaluation. Args: imageset (str|list): 'all' or the list of identifiers of images (e.g. ['13_h', '01_g']) assumption (str): the assumption on the region of evaluation to test ('fov'/'all') - scores (dict): the scores to check + scores (dict): the scores to check (supports only 'acc', 'sens', 'spec', 'bacc') eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -71,20 +72,22 @@ def check_hrf_vessel_aggregated_mos_assumption(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ data = get_experiment('retina.hrf') @@ -107,12 +110,17 @@ def check_hrf_vessel_aggregated_som_assumption(imageset, numerical_tolerance=NUMERICAL_TOLERANCE): """ Tests the consistency of scores calculated on the HRF dataset using - the score-of-means aggregation. + the score-of-means aggregation and an assumption on the region of evaluation. Args: imageset (str|list): 'all' or the list of identifiers of images (e.g. ['13_h', '01_g']) assumption (str): the assumption on the region of evaluation to test ('fov'/'all') - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -121,15 +129,24 @@ def check_hrf_vessel_aggregated_som_assumption(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ data = get_experiment('retina.hrf') @@ -149,22 +166,40 @@ def check_hrf_vessel_image_assumption(image_identifier: str, *, numerical_tolerance: float = NUMERICAL_TOLERANCE): """ - Testing the scores calculated for one image of the HRF dataset + Testing the scores calculated for one image of the HRF dataset using an + assumption on the region of evaluation. Args: image_identifier (str): the identifier of the image (like "01_g") assumption (str): the assumption on the region of evaluation to test ('fov'/'all') - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): the additional numerical tolerance Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ images = get_experiment('retina.hrf') testset = [image for image in images[assumption]['images'] @@ -189,7 +224,8 @@ def check_hrf_vessel_aggregated(imageset, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Testing the scores calculated for the HRF dataset with all assumptions + Testing the scores calculated for the HRF dataset with both assumptions on the + region of evaluation ('fov'/'all') and both aggregation methods ('mean of scores', Args: imageset (str|list): 'all' or the list of identifiers of images (e.g. ['13_h', '01_g']) @@ -208,9 +244,12 @@ def check_hrf_vessel_aggregated(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_aggregated @@ -263,7 +302,12 @@ def check_hrf_vessel_image(image_identifier: str, Args: image_identifier (str): the identifier of the image (like "01_g") - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -272,9 +316,12 @@ def check_hrf_vessel_image(image_identifier: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_hrf_vessel_image diff --git a/mlscorecheck/check/bundles/retina/_stare.py b/mlscorecheck/check/bundles/retina/_stare.py index f471fea..30eea19 100644 --- a/mlscorecheck/check/bundles/retina/_stare.py +++ b/mlscorecheck/check/bundles/retina/_stare.py @@ -42,14 +42,14 @@ def check_stare_vessel_aggregated_mos(imageset, verbosity: int = 1, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ - Checking the consistency of scores with calculated for some images of - the STARE dataset with the mean-of-scores aggregation. + Checking the consistency of scores calculated for some images of + the STARE dataset with the mean of scores aggregation. Args: imageset (str|list): 'all' if all images are used, or a list of identifiers of images (e.g. ['im0082', 'im0235']) annotator (str): the annotation to be used ('ah'/'vk') - scores (dict): the scores to check + scores (dict): the scores to check (supports only 'acc', 'sens', 'spec', 'bacc') eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores score_bounds (dict(str,tuple(float,float))): the potential bounds on the scores of the images @@ -64,20 +64,22 @@ def check_stare_vessel_aggregated_mos(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: the dictionary of the results of the analysis, the - ``inconsistency`` entry indicates if inconsistencies have - been found. The aggregated_results entry is empty if - the execution of the linear programming based check was - unnecessary. The result has four more keys. Under ``lp_status`` - one finds the status of the lp solver, under ``lp_configuration_scores_match`` - one finds a flag indicating if the scores from the lp configuration - match the scores provided, ``lp_configuration_bounds_match`` indicates - if the specified bounds match the actual figures and finally - ``lp_configuration`` contains the actual configuration of the - linear programming solver. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'lp_status'``: + The status of the lp solver. + - ``'lp_configuration_scores_match'``: + A flag indicating if the scores from the lp configuration match the scores + provided. + - ``'lp_configuration_bounds_match'``: + Indicates if the specified bounds match the actual figures. + - ``'lp_configuration'``: + Contains the actual configuration of the linear programming solver. """ data = get_experiment('retina.stare') @@ -106,7 +108,12 @@ def check_stare_vessel_aggregated_som(imageset, imageset (str|list): 'all' if all images are used, or a list of identifiers of images (e.g. ['im0082', 'im0235']) annotator (str): the annotation to be used ('ah'/'vk') - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -115,15 +122,24 @@ def check_stare_vessel_aggregated_som(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible with - all scores. Under the key ``prefiltering_details`` one finds the results of the prefiltering - by using the solutions for the score pairs. - - Raises: - ValueError: if the problem is not specified properly + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. """ data = get_experiment('retina.stare') @@ -167,9 +183,12 @@ def check_stare_vessel_aggregated(imageset, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: The summary of the results, with the following entries: + + - ``'inconsistency'``: + All findings. + - ``details*``: + The details of the analysis for the two assumptions. Examples: >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_aggregated @@ -218,7 +237,12 @@ def check_stare_vessel_image(image_identifier: str, Args: image_identifier (str): the identifier of the image (like "im0235") annotator (str): the annotation to use ('ah'/'vk') - scores (dict(str,float)): the scores to be tested + scores (dict(str,float)): the scores to be tested ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float): the numerical uncertainty numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -227,9 +251,24 @@ def check_stare_vessel_image(image_identifier: str, is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. Under the ``inconsistency`` key one finds all - findings, under the keys ``details*`` the details of the analysis can - be found. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the experiment. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.retina import check_stare_vessel_image diff --git a/mlscorecheck/check/bundles/skinlesion/_isic2016.py b/mlscorecheck/check/bundles/skinlesion/_isic2016.py index 41868af..f3e6bba 100644 --- a/mlscorecheck/check/bundles/skinlesion/_isic2016.py +++ b/mlscorecheck/check/bundles/skinlesion/_isic2016.py @@ -17,7 +17,12 @@ def check_isic2016(*, melanoma classification dataset Args: - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -25,12 +30,24 @@ def check_isic2016(*, scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.skinlesion import check_isic2016 @@ -43,4 +60,5 @@ def check_isic2016(*, return check_1_testset_no_kfold(scores=scores, testset=data, eps=eps, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=True) diff --git a/mlscorecheck/check/bundles/skinlesion/_isic2017.py b/mlscorecheck/check/bundles/skinlesion/_isic2017.py index 4b15597..f302b16 100644 --- a/mlscorecheck/check/bundles/skinlesion/_isic2017.py +++ b/mlscorecheck/check/bundles/skinlesion/_isic2017.py @@ -52,7 +52,12 @@ def check_isic2017(*, 'SK' for seborrheic keratosis and 'N' for nevus. against (str|list): specification of the negative classes, with the encoding 'M' for melanoma, 'SK' for seborrheic keratosis and 'N' for nevus. - scores (dict): the scores to check + scores (dict): the scores to check ('acc', 'sens', 'spec', + 'bacc', 'npv', 'ppv', 'f1', 'fm', 'f1n', + 'fbp', 'fbn', 'upm', 'gm', 'mk', 'lrp', 'lrn', 'mcc', + 'bm', 'pt', 'dor', 'ji', 'kappa'), when using + f-beta positive or f-beta negative, also set + 'beta_positive' and 'beta_negative'. eps (float|dict(str,float)): the numerical uncertainty(ies) of the scores numerical_tolerance (float): in practice, beyond the numerical uncertainty of the scores, some further tolerance is applied. This is @@ -60,12 +65,24 @@ def check_isic2017(*, scores. It does ensure that the specificity of the test is 1, it might slightly decrease the sensitivity. Returns: - dict: a summary of the results. When the ``inconsistency`` flag is True, it indicates - that the set of feasible ``tp``, ``tn`` pairs is empty. The list under the key - ``details`` provides further details from the analysis of the scores one after the other. - Under the key ``n_valid_tptn_pairs`` one finds the number of tp and tn pairs compatible - with all scores. Under the key ``prefiltering_details`` one finds the results of the - prefiltering by using the solutions for the score pairs. + dict: A dictionary containing the results of the consistency check. The dictionary + includes the following keys: + + - ``'inconsistency'``: + A boolean flag indicating whether the set of feasible true + positive (tp) and true negative (tn) pairs is empty. If True, + it indicates that the provided scores are not consistent with the dataset. + - ``'details'``: + A list providing further details from the analysis of the scores one + after the other. + - ``'n_valid_tptn_pairs'``: + The number of tp and tn pairs that are compatible with all + scores. + - ``'prefiltering_details'``: + The results of the prefiltering by using the solutions for + the score pairs. + - ``'evidence'``: + The evidence for satisfying the consistency constraints. Examples: >>> from mlscorecheck.check.bundles.skinlesion import check_isic2017 @@ -83,4 +100,5 @@ def check_isic2017(*, return check_1_testset_no_kfold(scores=scores, testset=testset, eps=eps, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=True) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index bb86a95..d621d01 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -94,4 +94,5 @@ class level scores on a single multiclass dataset and averaging across the folds return check_1_testset_no_kfold_micro(testset=testset, scores=scores, eps=eps, - numerical_tolerance=numerical_tolerance) + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs) diff --git a/mlscorecheck/individual/_interval.py b/mlscorecheck/individual/_interval.py index a9d2006..23cfb6b 100644 --- a/mlscorecheck/individual/_interval.py +++ b/mlscorecheck/individual/_interval.py @@ -749,6 +749,9 @@ def representing_int(self): Returns: int: a representative element of the interval """ + if len(self.intervals) == 0: + return None + for interval in self.intervals: integer = interval.representing_int() if integer is not None: diff --git a/notebooks/illustration/bundles/10_skin_lesion_analysis.ipynb b/notebooks/illustration/00_skin_lesion_analysis.ipynb similarity index 100% rename from notebooks/illustration/bundles/10_skin_lesion_analysis.ipynb rename to notebooks/illustration/00_skin_lesion_analysis.ipynb diff --git a/notebooks/illustration/40_capsule.ipynb b/notebooks/illustration/01_capsule.ipynb similarity index 100% rename from notebooks/illustration/40_capsule.ipynb rename to notebooks/illustration/01_capsule.ipynb diff --git a/notebooks/illustration/bundles/01_retina_stare.ipynb b/notebooks/illustration/bundles/01_retina_stare.ipynb index f7f301a..87e6bc7 100644 --- a/notebooks/illustration/bundles/01_retina_stare.ipynb +++ b/notebooks/illustration/bundles/01_retina_stare.ipynb @@ -13,8 +13,8 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_stare_vessel_image,\n", - " check_stare_vessel_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_stare_vessel_image,\n", + " check_stare_vessel_aggregated)" ] }, { @@ -43,42 +43,42 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:15,585:INFO:checking the scores {'acc': 0.4964, 'sens': 0.5793, 'spec': 0.4871, 'bacc': 0.5332}\n", - "2023-10-26 23:42:15,587:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:15,588:INFO:intervals before: (0, 644053), (0, 7825947)\n", - "2023-10-26 23:42:15,589:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", - "2023-10-26 23:42:15,590:INFO:the tn solutions: (3830478.4636940006, 3832337.7305060006)\n", - "2023-10-26 23:42:15,591:INFO:intervals after: [(373035, 373165)], [(3830479, 3832337)]\n", - "2023-10-26 23:42:15,592:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:15,594:INFO:intervals before: [(373035, 373165)], [(3830479, 3832337)]\n", - "2023-10-26 23:42:15,596:INFO:the tp solutions: (390827.0297060008, 394151.4028940005)\n", - "2023-10-26 23:42:15,597:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", - "2023-10-26 23:42:15,598:INFO:intervals after: [], []\n", - "2023-10-26 23:42:15,599:INFO:evaluating the tp and tn solution for acc and bacc\n", - "2023-10-26 23:42:15,600:INFO:intervals before: [], []\n", - "2023-10-26 23:42:15,602:INFO:the tp solutions: (371140.476202914, 371581.7663071766)\n", - "2023-10-26 23:42:15,603:INFO:the tn solutions: (3832062.293692824, 3834231.4637970864)\n", - "2023-10-26 23:42:15,604:INFO:intervals after: [], []\n", - "2023-10-26 23:42:15,605:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:15,607:INFO:intervals before: [], []\n", - "2023-10-26 23:42:15,609:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", - "2023-10-26 23:42:15,611:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", - "2023-10-26 23:42:15,612:INFO:intervals after: [], []\n", - "2023-10-26 23:42:15,613:INFO:evaluating the tp and tn solution for sens and bacc\n", - "2023-10-26 23:42:15,615:INFO:intervals before: [], []\n", - "2023-10-26 23:42:15,616:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", - "2023-10-26 23:42:15,616:INFO:the tn solutions: (3809624.0439179987, 3814413.523482001)\n", - "2023-10-26 23:42:15,618:INFO:intervals after: [], []\n", - "2023-10-26 23:42:15,619:INFO:evaluating the tp and tn solution for spec and bacc\n", - "2023-10-26 23:42:15,621:INFO:intervals before: [], []\n", - "2023-10-26 23:42:15,622:INFO:the tp solutions: (372902.822682, 373296.98311800003)\n", - "2023-10-26 23:42:15,624:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", - "2023-10-26 23:42:15,625:INFO:intervals after: [], []\n", - "2023-10-26 23:42:15,628:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:15,629:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:15,631:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:15,632:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:15,633:INFO:final number of pairs: 0\n" + "2023-11-03 08:14:16,715:INFO:checking the scores {'acc': 0.4964, 'sens': 0.5793, 'spec': 0.4871, 'bacc': 0.5332}\n", + "2023-11-03 08:14:16,717:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:14:16,718:INFO:intervals before: (0, 644053), (0, 7825947)\n", + "2023-11-03 08:14:16,719:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", + "2023-11-03 08:14:16,720:INFO:the tn solutions: (3830478.4636940006, 3832337.7305060006)\n", + "2023-11-03 08:14:16,721:INFO:intervals after: [(373035, 373165)], [(3830479, 3832337)]\n", + "2023-11-03 08:14:16,722:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:14:16,723:INFO:intervals before: [(373035, 373165)], [(3830479, 3832337)]\n", + "2023-11-03 08:14:16,724:INFO:the tp solutions: (390827.0297060008, 394151.4028940005)\n", + "2023-11-03 08:14:16,725:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", + "2023-11-03 08:14:16,726:INFO:intervals after: [], []\n", + "2023-11-03 08:14:16,727:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 08:14:16,728:INFO:intervals before: [], []\n", + "2023-11-03 08:14:16,729:INFO:the tp solutions: (371140.476202914, 371581.7663071766)\n", + "2023-11-03 08:14:16,730:INFO:the tn solutions: (3832062.293692824, 3834231.4637970864)\n", + "2023-11-03 08:14:16,731:INFO:intervals after: [], []\n", + "2023-11-03 08:14:16,734:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:14:16,736:INFO:intervals before: [], []\n", + "2023-11-03 08:14:16,737:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", + "2023-11-03 08:14:16,738:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", + "2023-11-03 08:14:16,739:INFO:intervals after: [], []\n", + "2023-11-03 08:14:16,740:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-03 08:14:16,742:INFO:intervals before: [], []\n", + "2023-11-03 08:14:16,743:INFO:the tp solutions: (373034.209494, 373165.5963060001)\n", + "2023-11-03 08:14:16,744:INFO:the tn solutions: (3809624.0439179987, 3814413.523482001)\n", + "2023-11-03 08:14:16,745:INFO:intervals after: [], []\n", + "2023-11-03 08:14:16,746:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 08:14:16,747:INFO:intervals before: [], []\n", + "2023-11-03 08:14:16,748:INFO:the tp solutions: (372902.822682, 373296.98311800003)\n", + "2023-11-03 08:14:16,749:INFO:the tn solutions: (3811220.537106, 3812817.0302939997)\n", + "2023-11-03 08:14:16,750:INFO:intervals after: [], []\n", + "2023-11-03 08:14:16,751:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:14:16,752:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:14:16,753:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:14:16,754:INFO:final number of intervals: 0\n", + "2023-11-03 08:14:16,754:INFO:final number of pairs: 0\n" ] }, { @@ -135,30 +135,30 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:15,680:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:15,682:INFO:calling the score check with scores {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134}, uncertainty 0.0001, p 37701 and n 385799\n", - "2023-10-26 23:42:15,684:INFO:checking the scores {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134}\n", - "2023-10-26 23:42:15,685:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-10-26 23:42:15,687:INFO:intervals before: (0, 37701), (0, 385799)\n", - "2023-10-26 23:42:15,688:INFO:the tp solutions: (17224.19894829517, 17499.003859606033)\n", - "2023-10-26 23:42:15,689:INFO:the tn solutions: (181525.47861639896, 181756.76992556825)\n", - "2023-10-26 23:42:15,691:INFO:intervals after: [(17225, 17499)], [(181526, 181756)]\n", - "2023-10-26 23:42:15,693:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:15,695:INFO:intervals before: [(17225, 17499)], [(181526, 181756)]\n", - "2023-10-26 23:42:15,696:INFO:the tp solutions: (17350.128609790765, 17387.34610415661)\n", - "2023-10-26 23:42:15,697:INFO:the tn solutions: (181522.6513884081, 181745.20449418173)\n", - "2023-10-26 23:42:15,698:INFO:intervals after: [(17351, 17387)], [(181526, 181745)]\n", - "2023-10-26 23:42:15,699:INFO:evaluating the tp and tn solution for npv and f1p\n", - "2023-10-26 23:42:15,701:INFO:intervals before: [(17351, 17387)], [(181526, 181745)]\n", - "2023-10-26 23:42:15,702:INFO:the tp solutions: (17195.366421230152, 17566.700828011573)\n", - "2023-10-26 23:42:15,703:INFO:the tn solutions: (180009.9078568309, 182954.30415410912)\n", - "2023-10-26 23:42:15,705:INFO:intervals after: [(17351, 17387)], [(181526, 181745)]\n", - "2023-10-26 23:42:15,707:INFO:testing acc, feasible tptn pairs: 37\n", - "2023-10-26 23:42:15,711:INFO:testing npv, feasible tptn pairs: 37\n", - "2023-10-26 23:42:15,715:INFO:testing f1p, feasible tptn pairs: 37\n", - "2023-10-26 23:42:15,719:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:15,720:INFO:final number of intervals: 37\n", - "2023-10-26 23:42:15,721:INFO:final number of pairs: 2600\n" + "2023-11-03 08:14:16,800:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:14:16,802:INFO:calling the score check with scores {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134}, uncertainty 0.0001, p 37701 and n 385799\n", + "2023-11-03 08:14:16,803:INFO:checking the scores {'acc': 0.4699, 'npv': 0.8993, 'f1p': 0.134}\n", + "2023-11-03 08:14:16,804:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 08:14:16,806:INFO:intervals before: (0, 37701), (0, 385799)\n", + "2023-11-03 08:14:16,807:INFO:the tp solutions: (17224.19894829517, 17499.003859606033)\n", + "2023-11-03 08:14:16,809:INFO:the tn solutions: (181525.47861639896, 181756.76992556825)\n", + "2023-11-03 08:14:16,810:INFO:intervals after: [(17225, 17499)], [(181526, 181756)]\n", + "2023-11-03 08:14:16,812:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:14:16,813:INFO:intervals before: [(17225, 17499)], [(181526, 181756)]\n", + "2023-11-03 08:14:16,815:INFO:the tp solutions: (17350.128609790765, 17387.34610415661)\n", + "2023-11-03 08:14:16,819:INFO:the tn solutions: (181522.6513884081, 181745.20449418173)\n", + "2023-11-03 08:14:16,820:INFO:intervals after: [(17351, 17387)], [(181526, 181745)]\n", + "2023-11-03 08:14:16,822:INFO:evaluating the tp and tn solution for npv and f1p\n", + "2023-11-03 08:14:16,823:INFO:intervals before: [(17351, 17387)], [(181526, 181745)]\n", + "2023-11-03 08:14:16,824:INFO:the tp solutions: (17195.366421230152, 17566.700828011573)\n", + "2023-11-03 08:14:16,825:INFO:the tn solutions: (180009.9078568309, 182954.30415410912)\n", + "2023-11-03 08:14:16,827:INFO:intervals after: [(17351, 17387)], [(181526, 181745)]\n", + "2023-11-03 08:14:16,831:INFO:testing acc, feasible tptn pairs: 37\n", + "2023-11-03 08:14:16,834:INFO:testing npv, feasible tptn pairs: 37\n", + "2023-11-03 08:14:16,839:INFO:testing f1p, feasible tptn pairs: 37\n", + "2023-11-03 08:14:16,843:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:14:16,846:INFO:final number of intervals: 37\n", + "2023-11-03 08:14:16,847:INFO:final number of pairs: 2600\n" ] } ], diff --git a/notebooks/illustration/bundles/02_retina_chasedb1.ipynb b/notebooks/illustration/bundles/02_retina_chasedb1.ipynb index d258fc2..3379bf0 100644 --- a/notebooks/illustration/bundles/02_retina_chasedb1.ipynb +++ b/notebooks/illustration/bundles/02_retina_chasedb1.ipynb @@ -13,8 +13,8 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_chasedb1_vessel_image,\n", - " check_chasedb1_vessel_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_chasedb1_vessel_image,\n", + " check_chasedb1_vessel_aggregated)" ] }, { @@ -43,27 +43,27 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:26,586:INFO:checking the scores {'acc': 0.5063, 'sens': 0.4147, 'spec': 0.5126}\n", - "2023-10-26 23:42:26,588:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:26,589:INFO:intervals before: (0, 1861974), (0, 24991146)\n", - "2023-10-26 23:42:26,590:INFO:the tp solutions: (771970.6964520001, 772350.539148)\n", - "2023-10-26 23:42:26,591:INFO:the tn solutions: (12820645.098612, 12826502.977788001)\n", - "2023-10-26 23:42:26,592:INFO:intervals after: [(771971, 772350)], [(12820646, 12826502)]\n", - "2023-10-26 23:42:26,593:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:26,594:INFO:intervals before: [(771971, 772350)], [(12820646, 12826502)]\n", - "2023-10-26 23:42:26,594:INFO:the tp solutions: (779985.101267999, 790561.3315320034)\n", - "2023-10-26 23:42:26,595:INFO:the tn solutions: (12807912.342707997, 12813010.536492)\n", - "2023-10-26 23:42:26,596:INFO:intervals after: [], []\n", - "2023-10-26 23:42:26,597:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:26,598:INFO:intervals before: [], []\n", - "2023-10-26 23:42:26,600:INFO:the tp solutions: (771970.6964520001, 772350.539148)\n", - "2023-10-26 23:42:26,601:INFO:the tn solutions: (12807912.342707997, 12813010.536492)\n", - "2023-10-26 23:42:26,602:INFO:intervals after: [], []\n", - "2023-10-26 23:42:26,603:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:26,604:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:26,605:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:26,605:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:26,606:INFO:final number of pairs: 0\n" + "2023-11-03 08:31:57,349:INFO:checking the scores {'acc': 0.5063, 'sens': 0.4147, 'spec': 0.5126}\n", + "2023-11-03 08:31:57,350:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:31:57,351:INFO:intervals before: (0, 1861974), (0, 24991146)\n", + "2023-11-03 08:31:57,353:INFO:the tp solutions: (771970.6964520001, 772350.539148)\n", + "2023-11-03 08:31:57,354:INFO:the tn solutions: (12820645.098612, 12826502.977788001)\n", + "2023-11-03 08:31:57,355:INFO:intervals after: [(771971, 772350)], [(12820646, 12826502)]\n", + "2023-11-03 08:31:57,356:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:31:57,357:INFO:intervals before: [(771971, 772350)], [(12820646, 12826502)]\n", + "2023-11-03 08:31:57,357:INFO:the tp solutions: (779985.101267999, 790561.3315320034)\n", + "2023-11-03 08:31:57,358:INFO:the tn solutions: (12807912.342707997, 12813010.536492)\n", + "2023-11-03 08:31:57,358:INFO:intervals after: [], []\n", + "2023-11-03 08:31:57,359:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:31:57,360:INFO:intervals before: [], []\n", + "2023-11-03 08:31:57,360:INFO:the tp solutions: (771970.6964520001, 772350.539148)\n", + "2023-11-03 08:31:57,362:INFO:the tn solutions: (12807912.342707997, 12813010.536492)\n", + "2023-11-03 08:31:57,363:INFO:intervals after: [], []\n", + "2023-11-03 08:31:57,363:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:31:57,364:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:31:57,365:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:31:57,367:INFO:final number of intervals: 0\n", + "2023-11-03 08:31:57,368:INFO:final number of pairs: 0\n" ] }, { @@ -120,30 +120,30 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:26,713:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:26,715:INFO:calling the score check with scores {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706}, uncertainty 0.0001, p 51133 and n 907907\n", - "2023-10-26 23:42:26,716:INFO:checking the scores {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706}\n", - "2023-10-26 23:42:26,718:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:26,719:INFO:intervals before: (0, 51133), (0, 907907)\n", - "2023-10-26 23:42:26,720:INFO:the tp solutions: (255.56273399999998, 265.993866)\n", - "2023-10-26 23:42:26,720:INFO:the tn solutions: (427080.312054, 427286.387346)\n", - "2023-10-26 23:42:26,721:INFO:intervals after: [(256, 265)], [(427081, 427286)]\n", - "2023-10-26 23:42:26,722:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:26,723:INFO:intervals before: [(256, 265)], [(427081, 427286)]\n", - "2023-10-26 23:42:26,725:INFO:the tp solutions: (-7.334794000082184, 373.5223939999705)\n", - "2023-10-26 23:42:26,726:INFO:the tn solutions: (427168.427686, 427353.64071400004)\n", - "2023-10-26 23:42:26,729:INFO:intervals after: [(256, 265)], [(427169, 427286)]\n", - "2023-10-26 23:42:26,730:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:26,731:INFO:intervals before: [(256, 265)], [(427169, 427286)]\n", - "2023-10-26 23:42:26,732:INFO:the tp solutions: (255.56273399999998, 265.993866)\n", - "2023-10-26 23:42:26,733:INFO:the tn solutions: (427168.427686, 427353.64071400004)\n", - "2023-10-26 23:42:26,734:INFO:intervals after: [(256, 265)], [(427169, 427286)]\n", - "2023-10-26 23:42:26,735:INFO:testing acc, feasible tptn pairs: 10\n", - "2023-10-26 23:42:26,736:INFO:testing sens, feasible tptn pairs: 10\n", - "2023-10-26 23:42:26,737:INFO:testing spec, feasible tptn pairs: 10\n", - "2023-10-26 23:42:26,739:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:26,742:INFO:final number of intervals: 10\n", - "2023-10-26 23:42:26,743:INFO:final number of pairs: 1105\n" + "2023-11-03 08:31:57,403:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:31:57,405:INFO:calling the score check with scores {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706}, uncertainty 0.0001, p 51133 and n 907907\n", + "2023-11-03 08:31:57,406:INFO:checking the scores {'acc': 0.4457, 'sens': 0.0051, 'spec': 0.4706}\n", + "2023-11-03 08:31:57,407:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:31:57,408:INFO:intervals before: (0, 51133), (0, 907907)\n", + "2023-11-03 08:31:57,409:INFO:the tp solutions: (255.56273399999998, 265.993866)\n", + "2023-11-03 08:31:57,410:INFO:the tn solutions: (427080.312054, 427286.387346)\n", + "2023-11-03 08:31:57,411:INFO:intervals after: [(256, 265)], [(427081, 427286)]\n", + "2023-11-03 08:31:57,411:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:31:57,412:INFO:intervals before: [(256, 265)], [(427081, 427286)]\n", + "2023-11-03 08:31:57,413:INFO:the tp solutions: (-7.334794000082184, 373.5223939999705)\n", + "2023-11-03 08:31:57,415:INFO:the tn solutions: (427168.427686, 427353.64071400004)\n", + "2023-11-03 08:31:57,416:INFO:intervals after: [(256, 265)], [(427169, 427286)]\n", + "2023-11-03 08:31:57,417:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:31:57,418:INFO:intervals before: [(256, 265)], [(427169, 427286)]\n", + "2023-11-03 08:31:57,420:INFO:the tp solutions: (255.56273399999998, 265.993866)\n", + "2023-11-03 08:31:57,421:INFO:the tn solutions: (427168.427686, 427353.64071400004)\n", + "2023-11-03 08:31:57,422:INFO:intervals after: [(256, 265)], [(427169, 427286)]\n", + "2023-11-03 08:31:57,423:INFO:testing acc, feasible tptn pairs: 10\n", + "2023-11-03 08:31:57,425:INFO:testing sens, feasible tptn pairs: 10\n", + "2023-11-03 08:31:57,425:INFO:testing spec, feasible tptn pairs: 10\n", + "2023-11-03 08:31:57,426:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:31:57,427:INFO:final number of intervals: 10\n", + "2023-11-03 08:31:57,428:INFO:final number of pairs: 1105\n" ] } ], diff --git a/notebooks/illustration/bundles/03_retina_hrf.ipynb b/notebooks/illustration/bundles/03_retina_hrf.ipynb index f72a965..5b931bb 100644 --- a/notebooks/illustration/bundles/03_retina_hrf.ipynb +++ b/notebooks/illustration/bundles/03_retina_hrf.ipynb @@ -13,8 +13,8 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_hrf_vessel_image,\n", - " check_hrf_vessel_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_hrf_vessel_image,\n", + " check_hrf_vessel_aggregated)" ] }, { @@ -43,48 +43,48 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:33,586:INFO:checking the scores {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475}\n", - "2023-10-26 23:42:33,588:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:33,590:INFO:intervals before: (0, 28395044), (0, 282712163)\n", - "2023-10-26 23:42:33,591:INFO:the tp solutions: (16082896.131512, 16088688.720488)\n", - "2023-10-26 23:42:33,592:INFO:the tn solutions: (134486577.25309798, 134555835.712302)\n", - "2023-10-26 23:42:33,593:INFO:intervals after: [(16082897, 16088688)], [(134486578, 134555835)]\n", - "2023-10-26 23:42:33,594:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:33,595:INFO:intervals before: [(16082897, 16088688)], [(134486578, 134555835)]\n", - "2023-10-26 23:42:33,596:INFO:the tp solutions: (16258151.907959998, 16379291.059439987)\n", - "2023-10-26 23:42:33,597:INFO:the tn solutions: (134259440.784374, 134317114.065626)\n", - "2023-10-26 23:42:33,598:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,599:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:33,600:INFO:intervals before: [], []\n", - "2023-10-26 23:42:33,601:INFO:the tp solutions: (16082896.131512, 16088688.720488)\n", - "2023-10-26 23:42:33,602:INFO:the tn solutions: (134259440.784374, 134317114.065626)\n", - "2023-10-26 23:42:33,603:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,605:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:33,605:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:33,606:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:33,607:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:33,608:INFO:final number of pairs: 0\n", - "2023-10-26 23:42:33,646:INFO:checking the scores {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475}\n", - "2023-10-26 23:42:33,648:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:33,649:INFO:intervals before: (0, 28399210), (0, 339941270)\n", - "2023-10-26 23:42:33,650:INFO:the tp solutions: (16085255.745579999, 16091049.18442)\n", - "2023-10-26 23:42:33,651:INFO:the tn solutions: (162185006.45462, 162265941.35138002)\n", - "2023-10-26 23:42:33,653:INFO:intervals after: [(16085256, 16091049)], [(162185007, 162265941)]\n", - "2023-10-26 23:42:33,654:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:33,655:INFO:intervals before: [(16085256, 16091049)], [(162185007, 162265941)]\n", - "2023-10-26 23:42:33,657:INFO:the tp solutions: (16769278.379500002, 16913767.8565)\n", - "2023-10-26 23:42:33,660:INFO:the tn solutions: (161437429.24046, 161506777.25954)\n", - "2023-10-26 23:42:33,661:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,662:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:33,664:INFO:intervals before: [], []\n", - "2023-10-26 23:42:33,666:INFO:the tp solutions: (16085255.745579999, 16091049.18442)\n", - "2023-10-26 23:42:33,668:INFO:the tn solutions: (161437429.24046, 161506777.25954)\n", - "2023-10-26 23:42:33,669:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,670:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:33,671:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:33,672:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:33,676:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:33,677:INFO:final number of pairs: 0\n" + "2023-11-03 08:26:16,122:INFO:checking the scores {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475}\n", + "2023-11-03 08:26:16,124:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:26:16,125:INFO:intervals before: (0, 28395044), (0, 282712163)\n", + "2023-11-03 08:26:16,126:INFO:the tp solutions: (16082896.131512, 16088688.720488)\n", + "2023-11-03 08:26:16,127:INFO:the tn solutions: (134486577.25309798, 134555835.712302)\n", + "2023-11-03 08:26:16,128:INFO:intervals after: [(16082897, 16088688)], [(134486578, 134555835)]\n", + "2023-11-03 08:26:16,128:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:26:16,129:INFO:intervals before: [(16082897, 16088688)], [(134486578, 134555835)]\n", + "2023-11-03 08:26:16,130:INFO:the tp solutions: (16258151.907959998, 16379291.059439987)\n", + "2023-11-03 08:26:16,131:INFO:the tn solutions: (134259440.784374, 134317114.065626)\n", + "2023-11-03 08:26:16,132:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,133:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:26:16,134:INFO:intervals before: [], []\n", + "2023-11-03 08:26:16,135:INFO:the tp solutions: (16082896.131512, 16088688.720488)\n", + "2023-11-03 08:26:16,136:INFO:the tn solutions: (134259440.784374, 134317114.065626)\n", + "2023-11-03 08:26:16,137:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,138:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:26:16,139:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:26:16,140:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:26:16,141:INFO:final number of intervals: 0\n", + "2023-11-03 08:26:16,142:INFO:final number of pairs: 0\n", + "2023-11-03 08:26:16,182:INFO:checking the scores {'acc': 0.4841, 'sens': 0.5665, 'spec': 0.475}\n", + "2023-11-03 08:26:16,183:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:26:16,185:INFO:intervals before: (0, 28399210), (0, 339941270)\n", + "2023-11-03 08:26:16,185:INFO:the tp solutions: (16085255.745579999, 16091049.18442)\n", + "2023-11-03 08:26:16,186:INFO:the tn solutions: (162185006.45462, 162265941.35138002)\n", + "2023-11-03 08:26:16,187:INFO:intervals after: [(16085256, 16091049)], [(162185007, 162265941)]\n", + "2023-11-03 08:26:16,190:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:26:16,191:INFO:intervals before: [(16085256, 16091049)], [(162185007, 162265941)]\n", + "2023-11-03 08:26:16,192:INFO:the tp solutions: (16769278.379500002, 16913767.8565)\n", + "2023-11-03 08:26:16,192:INFO:the tn solutions: (161437429.24046, 161506777.25954)\n", + "2023-11-03 08:26:16,193:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,194:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:26:16,196:INFO:intervals before: [], []\n", + "2023-11-03 08:26:16,197:INFO:the tp solutions: (16085255.745579999, 16091049.18442)\n", + "2023-11-03 08:26:16,198:INFO:the tn solutions: (161437429.24046, 161506777.25954)\n", + "2023-11-03 08:26:16,199:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,200:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:26:16,201:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:26:16,202:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:26:16,203:INFO:final number of intervals: 0\n", + "2023-11-03 08:26:16,204:INFO:final number of pairs: 0\n" ] }, { @@ -135,53 +135,53 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:33,710:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:33,713:INFO:calling the score check with scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}, uncertainty 0.0001, p 712528 and n 6199936\n", - "2023-10-26 23:42:33,715:INFO:checking the scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}\n", - "2023-10-26 23:42:33,716:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:33,717:INFO:intervals before: (0, 712528), (0, 6199936)\n", - "2023-10-26 23:42:33,718:INFO:the tp solutions: (359682.709344, 359828.065056)\n", - "2023-10-26 23:42:33,720:INFO:the tn solutions: (3484179.340416, 3485734.8387840004)\n", - "2023-10-26 23:42:33,721:INFO:intervals after: [(359683, 359828)], [(3484180, 3485734)]\n", - "2023-10-26 23:42:33,722:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:33,724:INFO:intervals before: [(359683, 359828)], [(3484180, 3485734)]\n", - "2023-10-26 23:42:33,725:INFO:the tp solutions: (358390.98639999935, 361065.91600000067)\n", - "2023-10-26 23:42:33,726:INFO:the tn solutions: (3484351.632128, 3485616.419072001)\n", - "2023-10-26 23:42:33,727:INFO:intervals after: [(359683, 359828)], [(3484352, 3485616)]\n", - "2023-10-26 23:42:33,729:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:33,731:INFO:intervals before: [(359683, 359828)], [(3484352, 3485616)]\n", - "2023-10-26 23:42:33,733:INFO:the tp solutions: (359682.709344, 359828.065056)\n", - "2023-10-26 23:42:33,734:INFO:the tn solutions: (3484351.632128, 3485616.419072001)\n", - "2023-10-26 23:42:33,735:INFO:intervals after: [(359683, 359828)], [(3484352, 3485616)]\n", - "2023-10-26 23:42:33,745:INFO:testing acc, feasible tptn pairs: 146\n", - "2023-10-26 23:42:33,757:INFO:testing sens, feasible tptn pairs: 146\n", - "2023-10-26 23:42:33,759:INFO:testing spec, feasible tptn pairs: 144\n", - "2023-10-26 23:42:33,765:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:33,767:INFO:final number of intervals: 144\n", - "2023-10-26 23:42:33,769:INFO:final number of pairs: 180054\n", - "2023-10-26 23:42:33,772:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:33,774:INFO:calling the score check with scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}, uncertainty 0.0001, p 712528 and n 7472816\n", - "2023-10-26 23:42:33,777:INFO:checking the scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}\n", - "2023-10-26 23:42:33,779:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:33,781:INFO:intervals before: (0, 712528), (0, 7472816)\n", - "2023-10-26 23:42:33,784:INFO:the tp solutions: (359682.709344, 359828.065056)\n", - "2023-10-26 23:42:33,786:INFO:the tn solutions: (4192025.362656, 4193840.528544001)\n", - "2023-10-26 23:42:33,787:INFO:intervals after: [(359683, 359828)], [(4192026, 4193840)]\n", - "2023-10-26 23:42:33,789:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:33,790:INFO:intervals before: [(359683, 359828)], [(4192026, 4193840)]\n", - "2023-10-26 23:42:33,791:INFO:the tp solutions: (350621.3268799996, 353815.5915200012)\n", - "2023-10-26 23:42:33,792:INFO:the tn solutions: (4199707.646368, 4201232.100832)\n", - "2023-10-26 23:42:33,793:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,794:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:33,795:INFO:intervals before: [], []\n", - "2023-10-26 23:42:33,796:INFO:the tp solutions: (359682.709344, 359828.065056)\n", - "2023-10-26 23:42:33,798:INFO:the tn solutions: (4199707.646368, 4201232.100832)\n", - "2023-10-26 23:42:33,799:INFO:intervals after: [], []\n", - "2023-10-26 23:42:33,803:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:33,804:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:33,806:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:33,807:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:33,808:INFO:final number of pairs: 0\n" + "2023-11-03 08:26:16,244:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:26:16,246:INFO:calling the score check with scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}, uncertainty 0.0001, p 712528 and n 6199936\n", + "2023-11-03 08:26:16,247:INFO:checking the scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}\n", + "2023-11-03 08:26:16,249:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:26:16,250:INFO:intervals before: (0, 712528), (0, 6199936)\n", + "2023-11-03 08:26:16,251:INFO:the tp solutions: (359682.709344, 359828.065056)\n", + "2023-11-03 08:26:16,253:INFO:the tn solutions: (3484179.340416, 3485734.8387840004)\n", + "2023-11-03 08:26:16,255:INFO:intervals after: [(359683, 359828)], [(3484180, 3485734)]\n", + "2023-11-03 08:26:16,256:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:26:16,257:INFO:intervals before: [(359683, 359828)], [(3484180, 3485734)]\n", + "2023-11-03 08:26:16,258:INFO:the tp solutions: (358390.98639999935, 361065.91600000067)\n", + "2023-11-03 08:26:16,259:INFO:the tn solutions: (3484351.632128, 3485616.419072001)\n", + "2023-11-03 08:26:16,259:INFO:intervals after: [(359683, 359828)], [(3484352, 3485616)]\n", + "2023-11-03 08:26:16,260:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:26:16,261:INFO:intervals before: [(359683, 359828)], [(3484352, 3485616)]\n", + "2023-11-03 08:26:16,261:INFO:the tp solutions: (359682.709344, 359828.065056)\n", + "2023-11-03 08:26:16,262:INFO:the tn solutions: (3484351.632128, 3485616.419072001)\n", + "2023-11-03 08:26:16,262:INFO:intervals after: [(359683, 359828)], [(3484352, 3485616)]\n", + "2023-11-03 08:26:16,267:INFO:testing acc, feasible tptn pairs: 146\n", + "2023-11-03 08:26:16,278:INFO:testing sens, feasible tptn pairs: 146\n", + "2023-11-03 08:26:16,279:INFO:testing spec, feasible tptn pairs: 144\n", + "2023-11-03 08:26:16,284:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:26:16,285:INFO:final number of intervals: 144\n", + "2023-11-03 08:26:16,286:INFO:final number of pairs: 180054\n", + "2023-11-03 08:26:16,287:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:26:16,288:INFO:calling the score check with scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}, uncertainty 0.0001, p 712528 and n 7472816\n", + "2023-11-03 08:26:16,289:INFO:checking the scores {'acc': 0.5562, 'sens': 0.5049, 'spec': 0.5621}\n", + "2023-11-03 08:26:16,290:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:26:16,291:INFO:intervals before: (0, 712528), (0, 7472816)\n", + "2023-11-03 08:26:16,292:INFO:the tp solutions: (359682.709344, 359828.065056)\n", + "2023-11-03 08:26:16,295:INFO:the tn solutions: (4192025.362656, 4193840.528544001)\n", + "2023-11-03 08:26:16,296:INFO:intervals after: [(359683, 359828)], [(4192026, 4193840)]\n", + "2023-11-03 08:26:16,297:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:26:16,298:INFO:intervals before: [(359683, 359828)], [(4192026, 4193840)]\n", + "2023-11-03 08:26:16,299:INFO:the tp solutions: (350621.3268799996, 353815.5915200012)\n", + "2023-11-03 08:26:16,300:INFO:the tn solutions: (4199707.646368, 4201232.100832)\n", + "2023-11-03 08:26:16,301:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,302:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:26:16,303:INFO:intervals before: [], []\n", + "2023-11-03 08:26:16,304:INFO:the tp solutions: (359682.709344, 359828.065056)\n", + "2023-11-03 08:26:16,305:INFO:the tn solutions: (4199707.646368, 4201232.100832)\n", + "2023-11-03 08:26:16,306:INFO:intervals after: [], []\n", + "2023-11-03 08:26:16,307:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:26:16,308:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:26:16,308:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:26:16,313:INFO:final number of intervals: 0\n", + "2023-11-03 08:26:16,314:INFO:final number of pairs: 0\n" ] }, { diff --git a/notebooks/illustration/bundles/04_retina_diaretdb0.ipynb b/notebooks/illustration/bundles/04_retina_diaretdb0.ipynb index 3291b7c..a2d68f4 100644 --- a/notebooks/illustration/bundles/04_retina_diaretdb0.ipynb +++ b/notebooks/illustration/bundles/04_retina_diaretdb0.ipynb @@ -13,7 +13,7 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import check_diaretdb0_class" + "from mlscorecheck.check.bundles.retina import check_diaretdb0_class" ] }, { @@ -36,27 +36,27 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:39,720:INFO:checking the scores {'acc': 0.4271, 'sens': 0.406, 'spec': 0.4765}\n", - "2023-10-26 23:42:39,722:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:39,723:INFO:intervals before: (0, 419), (0, 301)\n", - "2023-10-26 23:42:39,724:INFO:the tp solutions: (170.07126200000002, 170.15673800000002)\n", - "2023-10-26 23:42:39,726:INFO:the tn solutions: (137.28182199999998, 137.51417799999993)\n", - "2023-10-26 23:42:39,727:INFO:intervals after: [(1, 0)], [(1, 0)]\n", - "2023-10-26 23:42:39,728:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:39,729:INFO:intervals before: [(1, 0)], [(1, 0)]\n", - "2023-10-26 23:42:39,729:INFO:the tp solutions: (163.981358, 164.18964199999996)\n", - "2023-10-26 23:42:39,731:INFO:the tn solutions: (143.39579799999998, 143.457202)\n", - "2023-10-26 23:42:39,733:INFO:intervals after: [], []\n", - "2023-10-26 23:42:39,734:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:39,735:INFO:intervals before: [], []\n", - "2023-10-26 23:42:39,737:INFO:the tp solutions: (170.07126200000002, 170.15673800000002)\n", - "2023-10-26 23:42:39,738:INFO:the tn solutions: (143.39579799999998, 143.457202)\n", - "2023-10-26 23:42:39,739:INFO:intervals after: [], []\n", - "2023-10-26 23:42:39,740:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:39,741:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:39,742:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:39,743:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:39,744:INFO:final number of pairs: 0\n" + "2023-11-03 08:36:52,978:INFO:checking the scores {'acc': 0.4271, 'sens': 0.406, 'spec': 0.4765}\n", + "2023-11-03 08:36:52,980:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:36:52,982:INFO:intervals before: (0, 419), (0, 301)\n", + "2023-11-03 08:36:52,986:INFO:the tp solutions: (170.07126200000002, 170.15673800000002)\n", + "2023-11-03 08:36:52,987:INFO:the tn solutions: (137.28182199999998, 137.51417799999993)\n", + "2023-11-03 08:36:52,988:INFO:intervals after: [(1, 0)], [(1, 0)]\n", + "2023-11-03 08:36:52,989:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:36:52,990:INFO:intervals before: [(1, 0)], [(1, 0)]\n", + "2023-11-03 08:36:52,992:INFO:the tp solutions: (163.981358, 164.18964199999996)\n", + "2023-11-03 08:36:52,996:INFO:the tn solutions: (143.39579799999998, 143.457202)\n", + "2023-11-03 08:36:52,998:INFO:intervals after: [], []\n", + "2023-11-03 08:36:53,000:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:36:53,002:INFO:intervals before: [], []\n", + "2023-11-03 08:36:53,004:INFO:the tp solutions: (170.07126200000002, 170.15673800000002)\n", + "2023-11-03 08:36:53,006:INFO:the tn solutions: (143.39579799999998, 143.457202)\n", + "2023-11-03 08:36:53,007:INFO:intervals after: [], []\n", + "2023-11-03 08:36:53,008:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:36:53,010:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:36:53,013:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:36:53,015:INFO:final number of intervals: 0\n", + "2023-11-03 08:36:53,017:INFO:final number of pairs: 0\n" ] }, { @@ -67,7 +67,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de62e6a75dc2403486b0c6eb659a1778-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de62e6a75dc2403486b0c6eb659a1778-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/655bcca08de849fb80a0beb1b22ad102-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/655bcca08de849fb80a0beb1b22ad102-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -81,26 +81,26 @@ "Cgl0004I processed model has 3 rows, 18 columns (18 integer (0 of which binary)) and 36 elements\n", "Cbc0031I 4 added rows had average density of 13.25\n", "Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 68 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 194 row cuts average 16.5 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 194 row cuts average 16.5 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 13 row cuts average 10.8 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 13 row cuts average 10.8 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 19 row cuts average 10.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 19 row cuts average 10.4 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.03 seconds)\n", - "Cbc0016I Integer solution of 0 found by strong branching after 224 iterations and 53 nodes (0.04 seconds)\n", - "Cbc0001I Search completed - best objective 0, took 224 iterations and 53 nodes (0.04 seconds)\n", + "Cbc0016I Integer solution of 0 found by strong branching after 224 iterations and 53 nodes (0.03 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 224 iterations and 53 nodes (0.03 seconds)\n", "Cbc0032I Strong branching done 150 times (226 iterations), fathomed 11 nodes and fixed 4 variables\n", "Cbc0035I Maximum depth 28, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 68 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 68 times and created 194 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Probing was tried 68 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Gomory was tried 68 times and created 194 cuts of which 0 were active after adding rounds of cuts (0.005 seconds)\n", "Knapsack was tried 68 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Clique was tried 68 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 68 times and created 13 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "MixedIntegerRounding2 was tried 68 times and created 13 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", "FlowCover was tried 68 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "TwoMirCuts was tried 68 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 68 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", @@ -108,11 +108,11 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 53\n", "Total iterations: 224\n", - "Time (CPU seconds): 0.02\n", - "Time (Wallclock seconds): 0.04\n", + "Time (CPU seconds): 0.03\n", + "Time (Wallclock seconds): 0.03\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.04\n", + "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03\n", "\n" ] }, diff --git a/notebooks/illustration/bundles/05_retina_diaretdb1.ipynb b/notebooks/illustration/bundles/05_retina_diaretdb1.ipynb index a47e475..85276d7 100644 --- a/notebooks/illustration/bundles/05_retina_diaretdb1.ipynb +++ b/notebooks/illustration/bundles/05_retina_diaretdb1.ipynb @@ -9,13 +9,13 @@ }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 1, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_diaretdb1_class,\n", - " check_diaretdb1_segmentation_image,\n", - " check_diaretdb1_segmentation_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_diaretdb1_class,\n", + " check_diaretdb1_segmentation_image,\n", + " check_diaretdb1_segmentation_aggregated)" ] }, { @@ -27,7 +27,7 @@ }, { "cell_type": "code", - "execution_count": 9, + "execution_count": 2, "metadata": {}, "outputs": [], "source": [ @@ -36,53 +36,53 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": 3, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:45,697:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:45,725:INFO:calling the score check with scores {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474}, uncertainty 0.0001, p 17 and n 44\n", - "2023-10-26 23:42:45,737:INFO:checking the scores {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474}\n", - "2023-10-26 23:42:45,781:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:45,797:INFO:intervals before: (0, 17), (0, 44)\n", - "2023-10-26 23:42:45,801:INFO:the tp solutions: (16.998266, 17)\n", - "2023-10-26 23:42:45,804:INFO:the tn solutions: (1.995277999999999, 2.009456)\n", - "2023-10-26 23:42:45,817:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,821:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:45,824:INFO:intervals before: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,827:INFO:the tp solutions: (16.988789999999998, 17.01021)\n", - "2023-10-26 23:42:45,828:INFO:the tn solutions: (1.997512, 2.006488)\n", - "2023-10-26 23:42:45,830:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,832:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:45,837:INFO:intervals before: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,838:INFO:the tp solutions: (16.992033649999456, 17.011099682210617)\n", - "2023-10-26 23:42:45,840:INFO:the tn solutions: (1.9784082467188469, 2.021469888719955)\n", - "2023-10-26 23:42:45,843:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,845:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:45,850:INFO:intervals before: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,852:INFO:the tp solutions: (16.998266, 17)\n", - "2023-10-26 23:42:45,855:INFO:the tn solutions: (1.997512, 2.006488)\n", - "2023-10-26 23:42:45,857:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,859:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:42:45,861:INFO:intervals before: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,863:INFO:the tp solutions: (16.998266, 17)\n", - "2023-10-26 23:42:45,865:INFO:the tn solutions: (1.9853953396141368, 2.0313616425738457)\n", - "2023-10-26 23:42:45,867:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,869:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:42:45,873:INFO:intervals before: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,875:INFO:the tp solutions: (16.994684060802395, 17.00725629596689)\n", - "2023-10-26 23:42:45,877:INFO:the tn solutions: (1.997512, 2.006488)\n", - "2023-10-26 23:42:45,878:INFO:intervals after: [(17, 17)], [(2, 2)]\n", - "2023-10-26 23:42:45,891:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-10-26 23:42:45,911:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-10-26 23:42:45,913:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-10-26 23:42:45,919:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-10-26 23:42:45,923:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:45,926:INFO:final number of intervals: 1\n", - "2023-10-26 23:42:45,929:INFO:final number of pairs: 1\n" + "2023-11-03 08:39:51,362:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:39:51,363:INFO:calling the score check with scores {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474}, uncertainty 0.0001, p 17 and n 44\n", + "2023-11-03 08:39:51,363:INFO:checking the scores {'acc': 0.3115, 'sens': 1.0, 'spec': 0.0455, 'f1p': 0.4474}\n", + "2023-11-03 08:39:51,365:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:39:51,365:INFO:intervals before: (0, 17), (0, 44)\n", + "2023-11-03 08:39:51,366:INFO:the tp solutions: (16.998266, 17)\n", + "2023-11-03 08:39:51,367:INFO:the tn solutions: (1.995277999999999, 2.009456)\n", + "2023-11-03 08:39:51,367:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,370:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:39:51,371:INFO:intervals before: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,371:INFO:the tp solutions: (16.988789999999998, 17.01021)\n", + "2023-11-03 08:39:51,372:INFO:the tn solutions: (1.997512, 2.006488)\n", + "2023-11-03 08:39:51,373:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,374:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:39:51,376:INFO:intervals before: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,377:INFO:the tp solutions: (16.992033649999456, 17.011099682210617)\n", + "2023-11-03 08:39:51,378:INFO:the tn solutions: (1.9784082467188469, 2.021469888719955)\n", + "2023-11-03 08:39:51,380:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,381:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:39:51,382:INFO:intervals before: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,383:INFO:the tp solutions: (16.998266, 17)\n", + "2023-11-03 08:39:51,384:INFO:the tn solutions: (1.997512, 2.006488)\n", + "2023-11-03 08:39:51,384:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,385:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:39:51,387:INFO:intervals before: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,389:INFO:the tp solutions: (16.998266, 17)\n", + "2023-11-03 08:39:51,390:INFO:the tn solutions: (1.9853953396141368, 2.0313616425738457)\n", + "2023-11-03 08:39:51,392:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,393:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 08:39:51,394:INFO:intervals before: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,394:INFO:the tp solutions: (16.994684060802395, 17.00725629596689)\n", + "2023-11-03 08:39:51,395:INFO:the tn solutions: (1.997512, 2.006488)\n", + "2023-11-03 08:39:51,396:INFO:intervals after: [(17, 17)], [(2, 2)]\n", + "2023-11-03 08:39:51,396:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 08:39:51,397:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 08:39:51,398:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 08:39:51,398:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 08:39:51,399:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:39:51,400:INFO:final number of intervals: 1\n", + "2023-11-03 08:39:51,401:INFO:final number of pairs: 1\n" ] }, { @@ -91,7 +91,7 @@ "False" ] }, - "execution_count": 10, + "execution_count": 3, "metadata": {}, "output_type": "execute_result" } @@ -114,7 +114,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": 4, "metadata": {}, "outputs": [], "source": [ @@ -123,91 +123,91 @@ }, { "cell_type": "code", - "execution_count": 12, + "execution_count": 5, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:46,057:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:46,059:INFO:calling the score check with scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}, uncertainty 0.0001, p 132038 and n 1275197\n", - "2023-10-26 23:42:46,062:INFO:checking the scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}\n", - "2023-10-26 23:42:46,064:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:46,066:INFO:intervals before: (0, 132038), (0, 1275197)\n", - "2023-10-26 23:42:46,067:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,068:INFO:the tn solutions: (802783.778254, 803097.7899460001)\n", - "2023-10-26 23:42:46,071:INFO:intervals after: [(6629, 6654)], [(802784, 803097)]\n", - "2023-10-26 23:42:46,072:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:46,073:INFO:intervals before: [(6629, 6654)], [(802784, 803097)]\n", - "2023-10-26 23:42:46,074:INFO:the tp solutions: (20344.303535999963, 20891.519664000138)\n", - "2023-10-26 23:42:46,075:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", - "2023-10-26 23:42:46,076:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,078:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:46,081:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,084:INFO:the tp solutions: (5382.620227408646, 5448.411631373825)\n", - "2023-10-26 23:42:46,085:INFO:the tn solutions: (803820.7609366671, 804512.8769120976)\n", - "2023-10-26 23:42:46,086:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,087:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:46,089:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,090:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,091:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", - "2023-10-26 23:42:46,092:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,094:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:42:46,097:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,100:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,102:INFO:the tn solutions: (654261.5122493437, 681171.3956943698)\n", - "2023-10-26 23:42:46,116:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,119:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:42:46,121:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,122:INFO:the tp solutions: (5518.761209550405, 5585.29854943852)\n", - "2023-10-26 23:42:46,123:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", - "2023-10-26 23:42:46,125:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,126:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:46,128:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:46,129:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:46,130:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:46,132:INFO:final number of pairs: 0\n", - "2023-10-26 23:42:46,135:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:46,138:INFO:calling the score check with scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}, uncertainty 0.0001, p 132038 and n 1595962\n", - "2023-10-26 23:42:46,141:INFO:checking the scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}\n", - "2023-10-26 23:42:46,143:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:46,144:INFO:intervals before: (0, 132038), (0, 1595962)\n", - "2023-10-26 23:42:46,146:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,148:INFO:the tn solutions: (987287.1647239999, 987666.6124760002)\n", - "2023-10-26 23:42:46,156:INFO:intervals after: [(6629, 6654)], [(987288, 987666)]\n", - "2023-10-26 23:42:46,157:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:46,159:INFO:intervals before: [(6629, 6654)], [(987288, 987666)]\n", - "2023-10-26 23:42:46,161:INFO:the tp solutions: (6357.6664759998675, 7035.754724000231)\n", - "2023-10-26 23:42:46,163:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", - "2023-10-26 23:42:46,164:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,166:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:46,168:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,170:INFO:the tp solutions: (6609.5341239822355, 6690.322013746083)\n", - "2023-10-26 23:42:46,172:INFO:the tn solutions: (987043.5818456482, 987893.4586647607)\n", - "2023-10-26 23:42:46,173:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,174:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:46,180:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,183:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,184:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", - "2023-10-26 23:42:46,185:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,187:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:42:46,188:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,190:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", - "2023-10-26 23:42:46,191:INFO:the tn solutions: (971371.2748457015, 1005633.7660187001)\n", - "2023-10-26 23:42:46,193:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,194:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:42:46,196:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,198:INFO:the tp solutions: (6610.432677150226, 6690.258074705212)\n", - "2023-10-26 23:42:46,199:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", - "2023-10-26 23:42:46,201:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", - "2023-10-26 23:42:46,205:INFO:testing acc, feasible tptn pairs: 26\n", - "2023-10-26 23:42:46,211:INFO:testing sens, feasible tptn pairs: 26\n", - "2023-10-26 23:42:46,213:INFO:testing spec, feasible tptn pairs: 26\n", - "2023-10-26 23:42:46,218:INFO:testing f1p, feasible tptn pairs: 26\n", - "2023-10-26 23:42:46,224:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:46,231:INFO:final number of intervals: 26\n", - "2023-10-26 23:42:46,235:INFO:final number of pairs: 7293\n" + "2023-11-03 08:39:51,428:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:39:51,429:INFO:calling the score check with scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}, uncertainty 0.0001, p 132038 and n 1275197\n", + "2023-11-03 08:39:51,430:INFO:checking the scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}\n", + "2023-11-03 08:39:51,431:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:39:51,432:INFO:intervals before: (0, 132038), (0, 1275197)\n", + "2023-11-03 08:39:51,433:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,435:INFO:the tn solutions: (802783.778254, 803097.7899460001)\n", + "2023-11-03 08:39:51,436:INFO:intervals after: [(6629, 6654)], [(802784, 803097)]\n", + "2023-11-03 08:39:51,437:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:39:51,438:INFO:intervals before: [(6629, 6654)], [(802784, 803097)]\n", + "2023-11-03 08:39:51,439:INFO:the tp solutions: (20344.303535999963, 20891.519664000138)\n", + "2023-11-03 08:39:51,440:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", + "2023-11-03 08:39:51,441:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,442:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:39:51,443:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,443:INFO:the tp solutions: (5382.620227408646, 5448.411631373825)\n", + "2023-11-03 08:39:51,444:INFO:the tn solutions: (803820.7609366671, 804512.8769120976)\n", + "2023-11-03 08:39:51,445:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,445:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:39:51,446:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,447:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,447:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", + "2023-11-03 08:39:51,448:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,449:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:39:51,450:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,450:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,453:INFO:the tn solutions: (654261.5122493437, 681171.3956943698)\n", + "2023-11-03 08:39:51,454:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,455:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 08:39:51,457:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,458:INFO:the tp solutions: (5518.761209550405, 5585.29854943852)\n", + "2023-11-03 08:39:51,459:INFO:the tn solutions: (788834.3138059999, 789094.4539940001)\n", + "2023-11-03 08:39:51,459:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,460:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:39:51,461:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:39:51,461:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:39:51,462:INFO:final number of intervals: 0\n", + "2023-11-03 08:39:51,463:INFO:final number of pairs: 0\n", + "2023-11-03 08:39:51,464:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:39:51,464:INFO:calling the score check with scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}, uncertainty 0.0001, p 132038 and n 1595962\n", + "2023-11-03 08:39:51,465:INFO:checking the scores {'acc': 0.5753, 'sens': 0.0503, 'spec': 0.6187, 'f1p': 0.0178}\n", + "2023-11-03 08:39:51,466:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:39:51,467:INFO:intervals before: (0, 132038), (0, 1595962)\n", + "2023-11-03 08:39:51,468:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,468:INFO:the tn solutions: (987287.1647239999, 987666.6124760002)\n", + "2023-11-03 08:39:51,474:INFO:intervals after: [(6629, 6654)], [(987288, 987666)]\n", + "2023-11-03 08:39:51,475:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:39:51,476:INFO:intervals before: [(6629, 6654)], [(987288, 987666)]\n", + "2023-11-03 08:39:51,477:INFO:the tp solutions: (6357.6664759998675, 7035.754724000231)\n", + "2023-11-03 08:39:51,478:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", + "2023-11-03 08:39:51,479:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,480:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:39:51,481:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,482:INFO:the tp solutions: (6609.5341239822355, 6690.322013746083)\n", + "2023-11-03 08:39:51,483:INFO:the tn solutions: (987043.5818456482, 987893.4586647607)\n", + "2023-11-03 08:39:51,484:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,485:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:39:51,485:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,486:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,487:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", + "2023-11-03 08:39:51,489:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,489:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:39:51,491:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,492:INFO:the tp solutions: (6628.043524, 6654.979275999999)\n", + "2023-11-03 08:39:51,493:INFO:the tn solutions: (971371.2748457015, 1005633.7660187001)\n", + "2023-11-03 08:39:51,498:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,499:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 08:39:51,500:INFO:intervals before: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,500:INFO:the tp solutions: (6610.432677150226, 6690.258074705212)\n", + "2023-11-03 08:39:51,501:INFO:the tn solutions: (987258.901276, 987584.4775240001)\n", + "2023-11-03 08:39:51,502:INFO:intervals after: [(6629, 6654)], [(987288, 987584)]\n", + "2023-11-03 08:39:51,504:INFO:testing acc, feasible tptn pairs: 26\n", + "2023-11-03 08:39:51,507:INFO:testing sens, feasible tptn pairs: 26\n", + "2023-11-03 08:39:51,508:INFO:testing spec, feasible tptn pairs: 26\n", + "2023-11-03 08:39:51,509:INFO:testing f1p, feasible tptn pairs: 26\n", + "2023-11-03 08:39:51,511:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:39:51,511:INFO:final number of intervals: 26\n", + "2023-11-03 08:39:51,512:INFO:final number of pairs: 7293\n" ] }, { @@ -216,7 +216,7 @@ "{'inconsistency_fov': True, 'inconsistency_all': False}" ] }, - "execution_count": 12, + "execution_count": 5, "metadata": {}, "output_type": "execute_result" } @@ -239,7 +239,7 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": 6, "metadata": {}, "outputs": [], "source": [ @@ -248,55 +248,55 @@ }, { "cell_type": "code", - "execution_count": 14, + "execution_count": 7, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:46,316:INFO:checking the scores {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244}\n", - "2023-10-26 23:42:46,318:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:46,319:INFO:intervals before: (0, 1250927), (0, 26893773)\n", - "2023-10-26 23:42:46,321:INFO:the tp solutions: (472097.347946, 472352.537054)\n", - "2023-10-26 23:42:46,323:INFO:the tn solutions: (19628535.913546003, 19634532.621454004)\n", - "2023-10-26 23:42:46,324:INFO:intervals after: [(472098, 472352)], [(19628536, 19634532)]\n", - "2023-10-26 23:42:46,325:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:46,327:INFO:intervals before: [(472098, 472352)], [(19628536, 19634532)]\n", - "2023-10-26 23:42:46,327:INFO:the tp solutions: (616296.1245540008, 627523.9730460048)\n", - "2023-10-26 23:42:46,330:INFO:the tn solutions: (19479105.996354, 19484592.326046)\n", - "2023-10-26 23:42:46,331:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,334:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:46,342:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,343:INFO:the tp solutions: (472097.347946, 472352.537054)\n", - "2023-10-26 23:42:46,345:INFO:the tn solutions: (19479105.996354, 19484592.326046)\n", - "2023-10-26 23:42:46,347:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,348:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:46,351:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:46,353:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:46,355:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:46,356:INFO:final number of pairs: 0\n", - "2023-10-26 23:42:46,493:INFO:checking the scores {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244}\n", - "2023-10-26 23:42:46,495:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:46,500:INFO:intervals before: (0, 1252069), (0, 33307931)\n", - "2023-10-26 23:42:46,501:INFO:the tp solutions: (472528.33646200004, 472783.758538)\n", - "2023-10-26 23:42:46,502:INFO:the tn solutions: (24209899.121462, 24217204.783538006)\n", - "2023-10-26 23:42:46,504:INFO:intervals after: [(472529, 472783)], [(24209900, 24217204)]\n", - "2023-10-26 23:42:46,505:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:46,506:INFO:intervals before: [(472529, 472783)], [(24209900, 24217204)]\n", - "2023-10-26 23:42:46,507:INFO:the tp solutions: (551020.2546379976, 564865.3125620037)\n", - "2023-10-26 23:42:46,512:INFO:the tn solutions: (24124867.807438, 24131662.625362)\n", - "2023-10-26 23:42:46,514:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,515:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:46,517:INFO:intervals before: [], []\n", - "2023-10-26 23:42:46,518:INFO:the tp solutions: (472528.33646200004, 472783.758538)\n", - "2023-10-26 23:42:46,519:INFO:the tn solutions: (24124867.807438, 24131662.625362)\n", - "2023-10-26 23:42:46,520:INFO:intervals after: [], []\n", - "2023-10-26 23:42:46,522:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-10-26 23:42:46,523:INFO:no more feasible tp,tn pairs left\n", - "2023-10-26 23:42:46,524:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:46,525:INFO:final number of intervals: 0\n", - "2023-10-26 23:42:46,527:INFO:final number of pairs: 0\n" + "2023-11-03 08:39:51,539:INFO:checking the scores {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244}\n", + "2023-11-03 08:39:51,541:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:39:51,542:INFO:intervals before: (0, 1250927), (0, 26893773)\n", + "2023-11-03 08:39:51,543:INFO:the tp solutions: (472097.347946, 472352.537054)\n", + "2023-11-03 08:39:51,543:INFO:the tn solutions: (19628535.913546003, 19634532.621454004)\n", + "2023-11-03 08:39:51,544:INFO:intervals after: [(472098, 472352)], [(19628536, 19634532)]\n", + "2023-11-03 08:39:51,545:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:39:51,546:INFO:intervals before: [(472098, 472352)], [(19628536, 19634532)]\n", + "2023-11-03 08:39:51,546:INFO:the tp solutions: (616296.1245540008, 627523.9730460048)\n", + "2023-11-03 08:39:51,547:INFO:the tn solutions: (19479105.996354, 19484592.326046)\n", + "2023-11-03 08:39:51,548:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,548:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:39:51,549:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,550:INFO:the tp solutions: (472097.347946, 472352.537054)\n", + "2023-11-03 08:39:51,551:INFO:the tn solutions: (19479105.996354, 19484592.326046)\n", + "2023-11-03 08:39:51,552:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,558:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:39:51,559:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:39:51,560:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:39:51,561:INFO:final number of intervals: 0\n", + "2023-11-03 08:39:51,562:INFO:final number of pairs: 0\n", + "2023-11-03 08:39:51,582:INFO:checking the scores {'acc': 0.7143, 'sens': 0.3775, 'spec': 0.7244}\n", + "2023-11-03 08:39:51,583:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:39:51,584:INFO:intervals before: (0, 1252069), (0, 33307931)\n", + "2023-11-03 08:39:51,585:INFO:the tp solutions: (472528.33646200004, 472783.758538)\n", + "2023-11-03 08:39:51,586:INFO:the tn solutions: (24209899.121462, 24217204.783538006)\n", + "2023-11-03 08:39:51,587:INFO:intervals after: [(472529, 472783)], [(24209900, 24217204)]\n", + "2023-11-03 08:39:51,588:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:39:51,590:INFO:intervals before: [(472529, 472783)], [(24209900, 24217204)]\n", + "2023-11-03 08:39:51,591:INFO:the tp solutions: (551020.2546379976, 564865.3125620037)\n", + "2023-11-03 08:39:51,592:INFO:the tn solutions: (24124867.807438, 24131662.625362)\n", + "2023-11-03 08:39:51,593:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,594:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:39:51,595:INFO:intervals before: [], []\n", + "2023-11-03 08:39:51,595:INFO:the tp solutions: (472528.33646200004, 472783.758538)\n", + "2023-11-03 08:39:51,596:INFO:the tn solutions: (24124867.807438, 24131662.625362)\n", + "2023-11-03 08:39:51,597:INFO:intervals after: [], []\n", + "2023-11-03 08:39:51,597:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 08:39:51,602:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 08:39:51,603:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:39:51,604:INFO:final number of intervals: 0\n", + "2023-11-03 08:39:51,605:INFO:final number of pairs: 0\n" ] }, { @@ -307,7 +307,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5a1320a23cf4bfe93c723fe6dacf0e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5a1320a23cf4bfe93c723fe6dacf0e9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5aff7dc80e034994b4911dff3c0e9491-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5aff7dc80e034994b4911dff3c0e9491-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -347,7 +347,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d02cdd183b84f8280f1a08cdad1b774-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d02cdd183b84f8280f1a08cdad1b774-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4983d761810e47df8533a8df8a880cc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4983d761810e47df8533a8df8a880cc7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -381,7 +381,7 @@ "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n" ] }, @@ -394,7 +394,7 @@ " 'inconsistency_all_mos': False}" ] }, - "execution_count": 14, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/bundles/06_drishti_gs.ipynb b/notebooks/illustration/bundles/06_drishti_gs.ipynb index 8e407d5..e428419 100644 --- a/notebooks/illustration/bundles/06_drishti_gs.ipynb +++ b/notebooks/illustration/bundles/06_drishti_gs.ipynb @@ -9,12 +9,12 @@ }, { "cell_type": "code", - "execution_count": 24, + "execution_count": 1, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.retina import (check_drishti_gs_segmentation_image,\n", - " check_drishti_gs_segmentation_aggregated)" + "from mlscorecheck.check.bundles.retina import (check_drishti_gs_segmentation_image,\n", + " check_drishti_gs_segmentation_aggregated)" ] }, { @@ -26,7 +26,7 @@ }, { "cell_type": "code", - "execution_count": 25, + "execution_count": 2, "metadata": {}, "outputs": [], "source": [ @@ -35,60 +35,53 @@ }, { "cell_type": "code", - "execution_count": 26, + "execution_count": 3, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:54,160:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:42:54,167:INFO:calling the score check with scores {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468}, uncertainty 0.0001, p 118933 and n 3487307\n", - "2023-10-26 23:42:54,173:INFO:checking the scores {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468}\n", - "2023-10-26 23:42:54,189:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:54,197:INFO:intervals before: (0, 118933), (0, 3487307)\n", - "2023-10-26 23:42:54,199:INFO:the tp solutions: (35667.768834, 35692.031166)\n", - "2023-10-26 23:42:54,201:INFO:the tn solutions: (2115422.916354, 2116182.851646)\n", - "2023-10-26 23:42:54,207:INFO:intervals after: [(35668, 35692)], [(2115423, 2116182)]\n", - "2023-10-26 23:42:54,209:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:54,211:INFO:intervals before: [(35668, 35692)], [(2115423, 2116182)]\n", - "2023-10-26 23:42:54,212:INFO:the tp solutions: (35010.0853059995, 36457.16889400035)\n", - "2023-10-26 23:42:54,213:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", - "2023-10-26 23:42:54,216:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,219:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:54,224:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,226:INFO:the tp solutions: (35622.01445335527, 35803.38811508206)\n", - "2023-10-26 23:42:54,227:INFO:the tn solutions: (2114840.8000603416, 2116699.5836843182)\n", - "2023-10-26 23:42:54,228:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,230:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:54,232:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,234:INFO:the tp solutions: (35667.768834, 35692.031166)\n", - "2023-10-26 23:42:54,235:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", - "2023-10-26 23:42:54,235:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,236:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:42:54,238:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,241:INFO:the tp solutions: (35667.768834, 35692.031166)\n", - "2023-10-26 23:42:54,242:INFO:the tn solutions: (2104083.976312527, 2130248.7999003753)\n", - "2023-10-26 23:42:54,243:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,245:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:42:54,247:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,249:INFO:the tp solutions: (35624.9728226002, 35801.4215434727)\n", - "2023-10-26 23:42:54,250:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", - "2023-10-26 23:42:54,251:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", - "2023-10-26 23:42:54,262:INFO:testing acc, feasible tptn pairs: 25\n", - "2023-10-26 23:42:54,271:INFO:testing sens, feasible tptn pairs: 25\n", - "2023-10-26 23:42:54,273:INFO:testing spec, feasible tptn pairs: 24\n", - "2023-10-26 23:42:54,275:INFO:testing f1p, feasible tptn pairs: 24\n", - "2023-10-26 23:42:54,279:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:54,281:INFO:final number of intervals: 24\n", - "2023-10-26 23:42:54,282:INFO:final number of pairs: 15900\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "{'053': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3477881, 3219, 3590, 2617, 118933]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3505385, 22544, 7243, 7555, 63513]}}}\n" + "2023-11-03 08:45:43,688:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:45:43,689:INFO:calling the score check with scores {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468}, uncertainty 0.0001, p 118933 and n 3487307\n", + "2023-11-03 08:45:43,691:INFO:checking the scores {'acc': 0.5966, 'sens': 0.3, 'spec': 0.6067, 'f1p': 0.0468}\n", + "2023-11-03 08:45:43,693:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:45:43,695:INFO:intervals before: (0, 118933), (0, 3487307)\n", + "2023-11-03 08:45:43,696:INFO:the tp solutions: (35667.768834, 35692.031166)\n", + "2023-11-03 08:45:43,697:INFO:the tn solutions: (2115422.916354, 2116182.851646)\n", + "2023-11-03 08:45:43,697:INFO:intervals after: [(35668, 35692)], [(2115423, 2116182)]\n", + "2023-11-03 08:45:43,698:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:45:43,699:INFO:intervals before: [(35668, 35692)], [(2115423, 2116182)]\n", + "2023-11-03 08:45:43,700:INFO:the tp solutions: (35010.0853059995, 36457.16889400035)\n", + "2023-11-03 08:45:43,702:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", + "2023-11-03 08:45:43,703:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,703:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:45:43,705:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,707:INFO:the tp solutions: (35622.01445335527, 35803.38811508206)\n", + "2023-11-03 08:45:43,709:INFO:the tn solutions: (2114840.8000603416, 2116699.5836843182)\n", + "2023-11-03 08:45:43,710:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,711:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:45:43,712:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,713:INFO:the tp solutions: (35667.768834, 35692.031166)\n", + "2023-11-03 08:45:43,713:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", + "2023-11-03 08:45:43,714:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,715:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:45:43,716:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,716:INFO:the tp solutions: (35667.768834, 35692.031166)\n", + "2023-11-03 08:45:43,717:INFO:the tn solutions: (2104083.976312527, 2130248.7999003753)\n", + "2023-11-03 08:45:43,719:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,719:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 08:45:43,720:INFO:intervals before: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,721:INFO:the tp solutions: (35624.9728226002, 35801.4215434727)\n", + "2023-11-03 08:45:43,721:INFO:the tn solutions: (2115393.4515859997, 2116104.8622140004)\n", + "2023-11-03 08:45:43,722:INFO:intervals after: [(35668, 35692)], [(2115423, 2116104)]\n", + "2023-11-03 08:45:43,723:INFO:testing acc, feasible tptn pairs: 25\n", + "2023-11-03 08:45:43,725:INFO:testing sens, feasible tptn pairs: 25\n", + "2023-11-03 08:45:43,726:INFO:testing spec, feasible tptn pairs: 24\n", + "2023-11-03 08:45:43,726:INFO:testing f1p, feasible tptn pairs: 24\n", + "2023-11-03 08:45:43,729:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:45:43,730:INFO:final number of intervals: 24\n", + "2023-11-03 08:45:43,731:INFO:final number of pairs: 15900\n" ] }, { @@ -97,7 +90,7 @@ "False" ] }, - "execution_count": 26, + "execution_count": 3, "metadata": {}, "output_type": "execute_result" } @@ -120,7 +113,7 @@ }, { "cell_type": "code", - "execution_count": 27, + "execution_count": 4, "metadata": {}, "outputs": [], "source": [ @@ -129,51 +122,48 @@ }, { "cell_type": "code", - "execution_count": 28, + "execution_count": 5, "metadata": {}, "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "{'053': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3477881, 3219, 3590, 2617, 118933]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3505385, 22544, 7243, 7555, 63513]}}, '086': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3661951, 8149, 8698, 4933, 76184]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3621348, 6545, 6160, 6846, 119016]}}, '079': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3508324, 13024, 6458, 11059, 55375]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3478285, 5415, 3027, 3578, 103935]}}, '052': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3460984, 4391, 4663, 5758, 122830]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3500423, 20101, 16820, 10694, 50588]}}, '082': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495438, 4230, 4911, 4596, 95305]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3532354, 8797, 13359, 12241, 37729]}}, '003': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3485894, 5649, 3436, 7462, 98232]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525707, 11625, 7097, 6819, 49425]}}, '020': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3489439, 14680, 15992, 10659, 67566]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3464685, 5263, 4686, 5838, 117864]}}, '077': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3506050, 21067, 13645, 17434, 48044]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3468009, 9077, 9049, 9181, 110924]}}, '027': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3510404, 3474, 3959, 7989, 85985]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3541050, 17683, 10632, 6316, 36130]}}, '039': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3503439, 11221, 12223, 8684, 60428]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3472465, 2680, 3853, 3597, 113400]}}, '072': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3552462, 11643, 10162, 4806, 23647]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3491680, 4073, 3871, 5145, 97951]}}, '013': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4257502, 16045, 8020, 5049, 45801]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4205765, 5256, 4783, 4878, 111735]}}, '009': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3476565, 7402, 3649, 3963, 100613]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3554212, 6394, 4096, 11459, 16031]}}, '067': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3476383, 3440, 2331, 3929, 105814]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3529008, 10509, 9310, 6708, 36362]}}, '025': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4213796, 5044, 2468, 3012, 111956]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4240127, 9969, 13053, 10728, 62399]}}, '001': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3464573, 9238, 5717, 10344, 97927]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3408681, 5831, 7793, 5558, 159936]}}, '093': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3551531, 2434, 1619, 9150, 15170]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3462006, 1234, 8029, 3851, 104784]}}, '065': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3465192, 4194, 3191, 5083, 105180]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3497362, 9735, 10890, 6815, 58038]}}, '073': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3684750, 7680, 7666, 11903, 56541]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3647265, 6093, 5362, 8176, 101644]}}, '054': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3544335, 6275, 7469, 3526, 36439]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3516203, 3277, 4215, 2817, 71532]}}, '005': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3398781, 6015, 4961, 3776, 187140]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3441715, 24143, 6491, 8771, 119553]}}, '055': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4150128, 4008, 3103, 9715, 47095]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4124376, 3621, 2716, 3229, 80107]}}, '019': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3439928, 6341, 5752, 4202, 150017]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3483926, 11207, 7465, 5421, 98221]}}, '050': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3520247, 4180, 3139, 5193, 83441]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3551833, 10269, 5164, 6325, 42609]}}, '006': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3444493, 4913, 4728, 7288, 132818]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3505093, 27315, 10992, 7558, 43282]}}, '011': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3521540, 5899, 11719, 3984, 46706]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495819, 2568, 4250, 4182, 83029]}}, '034': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3511418, 22193, 15046, 8420, 46823]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3464088, 12118, 9740, 7015, 110939]}}, '056': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3503443, 2555, 2160, 6644, 89389]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3576587, 2423, 2879, 3356, 18946]}}, '070': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3527918, 7956, 3874, 4331, 64210]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495585, 4522, 3158, 4430, 100594]}}, '095': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3487320, 5532, 3699, 6622, 80827]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3553364, 9035, 3230, 5359, 13012]}}, '083': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525669, 6113, 18140, 3155, 49065]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3479762, 2750, 3895, 6735, 109000]}}, '021': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3523590, 6699, 5704, 6774, 62000]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3488319, 3908, 4365, 8637, 99538]}}, '087': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3500909, 4799, 1978, 3827, 95015]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3534433, 9279, 7343, 8887, 46586]}}, '023': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3504092, 10545, 3216, 3972, 74170]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3541710, 7115, 3839, 5885, 37446]}}, '099': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3517075, 8720, 11227, 5832, 35302]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3440950, 4506, 5653, 3105, 123942]}}, '014': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3514523, 5107, 5625, 12318, 66907]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3478973, 4047, 5795, 6485, 109180]}}, '007': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3442011, 5248, 7394, 11640, 133800]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3492784, 12081, 30033, 5792, 59403]}}, '074': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3494295, 2146, 1448, 3120, 101423]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3513128, 13307, 372, 9310, 66315]}}, '030': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3484311, 5033, 5851, 6467, 102818]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3521164, 15506, 4217, 20226, 43367]}}, '029': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3491452, 3821, 2175, 5221, 103571]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3520641, 14741, 5148, 11953, 53757]}}, '048': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3512052, 18930, 9537, 9802, 54159]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3451073, 5436, 3679, 4689, 139603]}}, '085': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3507466, 10468, 16404, 8686, 50922]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3467366, 5062, 4672, 6890, 109956]}}, '096': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3554148, 7737, 6819, 12781, 2216]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3477329, 12771, 5830, 2431, 85340]}}, '043': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3480618, 4456, 2393, 3392, 93438]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3501576, 19707, 9003, 6902, 47109]}}, '071': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3533440, 7800, 8170, 11186, 43595]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3492197, 2605, 3227, 3656, 102506]}}, '059': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3530646, 7495, 6097, 9295, 44803]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3490981, 4098, 2772, 3729, 96756]}}, '078': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3550802, 15998, 4450, 4679, 32647]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3496545, 5547, 3280, 2737, 100467]}}, '097': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3533819, 8238, 5262, 6206, 30176]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3430080, 14459, 9522, 5696, 123944]}}, '028': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3500043, 6798, 3601, 4301, 91785]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525252, 6527, 6825, 7390, 60534]}}, '100': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3567101, 3029, 4134, 2503, 6934]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3454615, 28483, 17462, 3221, 79920]}}, '091': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3490047, 4057, 1805, 3532, 82511]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3552600, 6092, 2373, 7464, 13423]}}}\n" - ] - }, { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:54,499:INFO:checking the scores {'acc': 0.4767, 'sens': 0.4845, 'spec': 0.4765, 'f1p': 0.0512}\n", - "2023-10-26 23:42:54,501:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:42:54,503:INFO:intervals before: (0, 5414553), (0, 180494984)\n", - "2023-10-26 23:42:54,504:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", - "2023-10-26 23:42:54,505:INFO:the tn solutions: (85980210.30222, 86019240.41657999)\n", - "2023-10-26 23:42:54,507:INFO:intervals after: [(2622799, 2623903)], [(85980211, 86019240)]\n", - "2023-10-26 23:42:54,508:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:42:54,510:INFO:intervals before: [(2622799, 2623903)], [(85980211, 86019240)]\n", - "2023-10-26 23:42:54,511:INFO:the tp solutions: (2579843.150758013, 2654589.6730419993)\n", - "2023-10-26 23:42:54,513:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", - "2023-10-26 23:42:54,515:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,516:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:42:54,518:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,519:INFO:the tp solutions: (2618908.280150996, 2630954.653441351)\n", - "2023-10-26 23:42:54,521:INFO:the tn solutions: (85953650.68004246, 86042649.8249844)\n", - "2023-10-26 23:42:54,522:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,523:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:42:54,524:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,526:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", - "2023-10-26 23:42:54,527:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", - "2023-10-26 23:42:54,528:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,530:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:42:54,531:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,533:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", - "2023-10-26 23:42:54,534:INFO:the tn solutions: (85490212.09562817, 86628542.44030103)\n", - "2023-10-26 23:42:54,535:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,537:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-10-26 23:42:54,538:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", - "2023-10-26 23:42:54,539:INFO:the tp solutions: (2618878.4015550935, 2630578.4368279246)\n", - "2023-10-26 23:42:54,541:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", - "2023-10-26 23:42:54,543:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n" + "2023-11-03 08:45:43,783:INFO:checking the scores {'acc': 0.4767, 'sens': 0.4845, 'spec': 0.4765, 'f1p': 0.0512}\n", + "2023-11-03 08:45:43,784:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:45:43,785:INFO:intervals before: (0, 5414553), (0, 180494984)\n", + "2023-11-03 08:45:43,786:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", + "2023-11-03 08:45:43,787:INFO:the tn solutions: (85980210.30222, 86019240.41657999)\n", + "2023-11-03 08:45:43,787:INFO:intervals after: [(2622799, 2623903)], [(85980211, 86019240)]\n", + "2023-11-03 08:45:43,790:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:45:43,791:INFO:intervals before: [(2622799, 2623903)], [(85980211, 86019240)]\n", + "2023-11-03 08:45:43,791:INFO:the tp solutions: (2579843.150758013, 2654589.6730419993)\n", + "2023-11-03 08:45:43,792:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", + "2023-11-03 08:45:43,794:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,794:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:45:43,795:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,798:INFO:the tp solutions: (2618908.280150996, 2630954.653441351)\n", + "2023-11-03 08:45:43,799:INFO:the tn solutions: (85953650.68004246, 86042649.8249844)\n", + "2023-11-03 08:45:43,800:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,801:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:45:43,801:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,803:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", + "2023-11-03 08:45:43,803:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", + "2023-11-03 08:45:43,804:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,804:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:45:43,806:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,807:INFO:the tp solutions: (2622798.644094, 2623903.2129059997)\n", + "2023-11-03 08:45:43,807:INFO:the tn solutions: (85490212.09562817, 86628542.44030103)\n", + "2023-11-03 08:45:43,810:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,811:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 08:45:43,811:INFO:intervals before: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,812:INFO:the tp solutions: (2618878.4015550935, 2630578.4368279246)\n", + "2023-11-03 08:45:43,813:INFO:the tn solutions: (85987449.387632, 86024270.36436799)\n", + "2023-11-03 08:45:43,814:INFO:intervals after: [(2622799, 2623903)], [(85987450, 86019240)]\n", + "2023-11-03 08:45:43,833:INFO:testing acc, feasible tptn pairs: 1105\n", + "2023-11-03 08:45:43,886:INFO:testing sens, feasible tptn pairs: 1105\n", + "2023-11-03 08:45:43,887:INFO:testing spec, feasible tptn pairs: 1093\n", + "2023-11-03 08:45:43,956:INFO:testing f1p, feasible tptn pairs: 1093\n" ] }, { @@ -184,7 +174,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f87319971994323a66f89b2f2f6c8b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f87319971994323a66f89b2f2f6c8b8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/66c9789ac4b9417c935be1ef903cdc9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/66c9789ac4b9417c935be1ef903cdc9a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -214,32 +204,21 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 0\n", "Total iterations: 0\n", - "Time (CPU seconds): 0.01\n", - "Time (Wallclock seconds): 0.01\n", + "Time (CPU seconds): 0.00\n", + "Time (Wallclock seconds): 0.00\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", - "\n", - "{'053': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3477881, 3219, 3590, 2617, 118933]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3505385, 22544, 7243, 7555, 63513]}}, '086': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3661951, 8149, 8698, 4933, 76184]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3621348, 6545, 6160, 6846, 119016]}}, '079': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3508324, 13024, 6458, 11059, 55375]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3478285, 5415, 3027, 3578, 103935]}}, '052': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3460984, 4391, 4663, 5758, 122830]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3500423, 20101, 16820, 10694, 50588]}}, '082': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495438, 4230, 4911, 4596, 95305]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3532354, 8797, 13359, 12241, 37729]}}, '003': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3485894, 5649, 3436, 7462, 98232]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525707, 11625, 7097, 6819, 49425]}}, '020': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3489439, 14680, 15992, 10659, 67566]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3464685, 5263, 4686, 5838, 117864]}}, '077': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3506050, 21067, 13645, 17434, 48044]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3468009, 9077, 9049, 9181, 110924]}}, '027': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3510404, 3474, 3959, 7989, 85985]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3541050, 17683, 10632, 6316, 36130]}}, '039': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3503439, 11221, 12223, 8684, 60428]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3472465, 2680, 3853, 3597, 113400]}}, '072': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3552462, 11643, 10162, 4806, 23647]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3491680, 4073, 3871, 5145, 97951]}}, '013': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4257502, 16045, 8020, 5049, 45801]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4205765, 5256, 4783, 4878, 111735]}}, '009': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3476565, 7402, 3649, 3963, 100613]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3554212, 6394, 4096, 11459, 16031]}}, '067': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3476383, 3440, 2331, 3929, 105814]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3529008, 10509, 9310, 6708, 36362]}}, '025': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4213796, 5044, 2468, 3012, 111956]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4240127, 9969, 13053, 10728, 62399]}}, '001': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3464573, 9238, 5717, 10344, 97927]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3408681, 5831, 7793, 5558, 159936]}}, '093': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3551531, 2434, 1619, 9150, 15170]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3462006, 1234, 8029, 3851, 104784]}}, '065': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3465192, 4194, 3191, 5083, 105180]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3497362, 9735, 10890, 6815, 58038]}}, '073': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3684750, 7680, 7666, 11903, 56541]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3647265, 6093, 5362, 8176, 101644]}}, '054': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3544335, 6275, 7469, 3526, 36439]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3516203, 3277, 4215, 2817, 71532]}}, '005': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3398781, 6015, 4961, 3776, 187140]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3441715, 24143, 6491, 8771, 119553]}}, '055': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [4150128, 4008, 3103, 9715, 47095]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [4124376, 3621, 2716, 3229, 80107]}}, '019': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3439928, 6341, 5752, 4202, 150017]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3483926, 11207, 7465, 5421, 98221]}}, '050': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3520247, 4180, 3139, 5193, 83441]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3551833, 10269, 5164, 6325, 42609]}}, '006': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3444493, 4913, 4728, 7288, 132818]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3505093, 27315, 10992, 7558, 43282]}}, '011': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3521540, 5899, 11719, 3984, 46706]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495819, 2568, 4250, 4182, 83029]}}, '034': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3511418, 22193, 15046, 8420, 46823]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3464088, 12118, 9740, 7015, 110939]}}, '056': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3503443, 2555, 2160, 6644, 89389]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3576587, 2423, 2879, 3356, 18946]}}, '070': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3527918, 7956, 3874, 4331, 64210]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3495585, 4522, 3158, 4430, 100594]}}, '095': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3487320, 5532, 3699, 6622, 80827]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3553364, 9035, 3230, 5359, 13012]}}, '083': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525669, 6113, 18140, 3155, 49065]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3479762, 2750, 3895, 6735, 109000]}}, '021': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3523590, 6699, 5704, 6774, 62000]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3488319, 3908, 4365, 8637, 99538]}}, '087': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3500909, 4799, 1978, 3827, 95015]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3534433, 9279, 7343, 8887, 46586]}}, '023': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3504092, 10545, 3216, 3972, 74170]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3541710, 7115, 3839, 5885, 37446]}}, '099': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3517075, 8720, 11227, 5832, 35302]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3440950, 4506, 5653, 3105, 123942]}}, '014': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3514523, 5107, 5625, 12318, 66907]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3478973, 4047, 5795, 6485, 109180]}}, '007': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3442011, 5248, 7394, 11640, 133800]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3492784, 12081, 30033, 5792, 59403]}}, '074': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3494295, 2146, 1448, 3120, 101423]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3513128, 13307, 372, 9310, 66315]}}, '030': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3484311, 5033, 5851, 6467, 102818]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3521164, 15506, 4217, 20226, 43367]}}, '029': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3491452, 3821, 2175, 5221, 103571]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3520641, 14741, 5148, 11953, 53757]}}, '048': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3512052, 18930, 9537, 9802, 54159]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3451073, 5436, 3679, 4689, 139603]}}, '085': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3507466, 10468, 16404, 8686, 50922]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3467366, 5062, 4672, 6890, 109956]}}, '096': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3554148, 7737, 6819, 12781, 2216]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3477329, 12771, 5830, 2431, 85340]}}, '043': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3480618, 4456, 2393, 3392, 93438]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3501576, 19707, 9003, 6902, 47109]}}, '071': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3533440, 7800, 8170, 11186, 43595]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3492197, 2605, 3227, 3656, 102506]}}, '059': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3530646, 7495, 6097, 9295, 44803]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3490981, 4098, 2772, 3729, 96756]}}, '078': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3550802, 15998, 4450, 4679, 32647]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3496545, 5547, 3280, 2737, 100467]}}, '097': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3533819, 8238, 5262, 6206, 30176]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3430080, 14459, 9522, 5696, 123944]}}, '028': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3500043, 6798, 3601, 4301, 91785]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3525252, 6527, 6825, 7390, 60534]}}, '100': {'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3567101, 3029, 4134, 2503, 6934]}, 'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3454615, 28483, 17462, 3221, 79920]}}, '091': {'OD': {'values': [0, 64, 128, 191, 255], 'counts': [3490047, 4057, 1805, 3532, 82511]}, 'OC': {'values': [0, 64, 128, 191, 255], 'counts': [3552600, 6092, 2373, 7464, 13423]}}}\n" - ] - }, - { - "name": "stderr", - "output_type": "stream", - "text": [ - "2023-10-26 23:42:54,611:INFO:testing acc, feasible tptn pairs: 1105\n", - "2023-10-26 23:42:54,727:INFO:testing sens, feasible tptn pairs: 1105\n", - "2023-10-26 23:42:54,729:INFO:testing spec, feasible tptn pairs: 1093\n", - "2023-10-26 23:42:54,751:INFO:testing f1p, feasible tptn pairs: 1093\n" + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "\n" ] }, { "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:42:54,851:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:42:54,853:INFO:final number of intervals: 1093\n", - "2023-10-26 23:42:54,855:INFO:final number of pairs: 33744189\n" + "2023-11-03 08:45:44,009:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:45:44,010:INFO:final number of intervals: 1093\n", + "2023-11-03 08:45:44,011:INFO:final number of pairs: 33744189\n" ] }, { @@ -248,7 +227,7 @@ "{'inconsistency_som': False, 'inconsistency_mos': False}" ] }, - "execution_count": 28, + "execution_count": 5, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/bundles/07_tpehg.ipynb b/notebooks/illustration/bundles/07_tpehg.ipynb index ac2299f..832486b 100644 --- a/notebooks/illustration/bundles/07_tpehg.ipynb +++ b/notebooks/illustration/bundles/07_tpehg.ipynb @@ -9,11 +9,11 @@ }, { "cell_type": "code", - "execution_count": 1, + "execution_count": 2, "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.ehg import check_tpehg\n", + "from mlscorecheck.check.bundles.ehg import check_tpehg\n", "from mlscorecheck.aggregated import kfolds_generator" ] }, @@ -27,7 +27,7 @@ }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 3, "metadata": {}, "outputs": [], "source": [ @@ -37,7 +37,7 @@ }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 4, "metadata": {}, "outputs": [ { @@ -46,7 +46,7 @@ "918" ] }, - "execution_count": 3, + "execution_count": 4, "metadata": {}, "output_type": "execute_result" } @@ -57,7 +57,7 @@ }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 5, "metadata": {}, "outputs": [], "source": [ @@ -68,7 +68,7 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -79,7 +79,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4dd632419d9548c589242210ffa06d3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4dd632419d9548c589242210ffa06d3f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00b3060a3747439db96cd95f7cc02e63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00b3060a3747439db96cd95f7cc02e63-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -99,7 +99,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3b71d503954844bbab3a0b069eb7c3c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b71d503954844bbab3a0b069eb7c3c1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77bec2eceb334bcabb6c56001993a0cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77bec2eceb334bcabb6c56001993a0cc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -119,7 +119,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f00c63685314b37b368b47e3bcabec7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f00c63685314b37b368b47e3bcabec7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7438e2c0da64492293ba007449623380-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7438e2c0da64492293ba007449623380-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -140,7 +140,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/092604b93e0c411095db142653c946ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/092604b93e0c411095db142653c946ac-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eff72845268d4c718cf3e2421244c6ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eff72845268d4c718cf3e2421244c6ac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -161,7 +161,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c679c48903374be39254804dc0406d07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c679c48903374be39254804dc0406d07-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2eccd3397ee4458cb270d4efecd69504-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2eccd3397ee4458cb270d4efecd69504-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -182,7 +182,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5938edff21dd48a89121a3c26e0865fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5938edff21dd48a89121a3c26e0865fa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbc1450b340344118ee6be43dede823d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbc1450b340344118ee6be43dede823d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -203,7 +203,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/648200eef79d4f03ac704f9275a7276e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/648200eef79d4f03ac704f9275a7276e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6787c821c9a945bb8f6e9d73f9d35c73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6787c821c9a945bb8f6e9d73f9d35c73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -224,7 +224,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/402d2f32356e45c3bf9934391f5bdb58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/402d2f32356e45c3bf9934391f5bdb58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/905a1c9d1e204d0cb83a06ec7bfe73ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/905a1c9d1e204d0cb83a06ec7bfe73ec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -245,7 +245,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e8523a8d26c241819e635c81206bd54f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8523a8d26c241819e635c81206bd54f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dfa1150ddccc4757a5b4affb80a69e18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dfa1150ddccc4757a5b4affb80a69e18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -266,7 +266,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/888825520f6a4ea88216185816bb2e5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/888825520f6a4ea88216185816bb2e5a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/edd0050fba8643b7b2cbe4852cbf69ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/edd0050fba8643b7b2cbe4852cbf69ec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -288,7 +288,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f7a7ec18e654fadaf22e00885209416-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f7a7ec18e654fadaf22e00885209416-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/45cae1c64e6346aaa231be0edd466192-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45cae1c64e6346aaa231be0edd466192-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -310,7 +310,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6cc1373f038641389c0f2ae8806606aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6cc1373f038641389c0f2ae8806606aa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c70bcc78acca47da99b95d1b441110f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c70bcc78acca47da99b95d1b441110f9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -349,7 +349,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d0e18a55f6aa46eba5b65630d50792d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0e18a55f6aa46eba5b65630d50792d8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e2567e04aed43418e5d8ec9093414f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e2567e04aed43418e5d8ec9093414f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -388,7 +388,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53b697e3f5e0472eae43ff1708ec81c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53b697e3f5e0472eae43ff1708ec81c1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba8ce96b9a2a452d9b819f74c92d1637-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba8ce96b9a2a452d9b819f74c92d1637-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -427,7 +427,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e26d9919e41f437db114513dbfb99312-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e26d9919e41f437db114513dbfb99312-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c73eab3a1164e559a2d4a0c98ee2a52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c73eab3a1164e559a2d4a0c98ee2a52-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -445,7 +445,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea5a6672766144c68bd85579057aecc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea5a6672766144c68bd85579057aecc5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d88ed80781f485794826db28e226e56-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d88ed80781f485794826db28e226e56-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -463,7 +463,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/738a578e9ba74f8d89ce3d85fddc0d40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/738a578e9ba74f8d89ce3d85fddc0d40-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/09e252288cc949f28543af4574fba4a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09e252288cc949f28543af4574fba4a2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -481,7 +481,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9583835dc0f140c18221f8baeba33753-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9583835dc0f140c18221f8baeba33753-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f89234ceb77c4e50b264e5527cc7ecdd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f89234ceb77c4e50b264e5527cc7ecdd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -501,7 +501,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5eac10c77b948188b94a6a7c06d51a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5eac10c77b948188b94a6a7c06d51a1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68f2f8f6371849f198bad791216b77fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68f2f8f6371849f198bad791216b77fe-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -540,7 +540,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7281e0f814fe421ba166525e40fcca2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7281e0f814fe421ba166525e40fcca2f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/55f7ef1f653c4bab8d15acf403854817-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/55f7ef1f653c4bab8d15acf403854817-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -561,7 +561,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/384d7618acac4eb180a3d523ff75bed4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/384d7618acac4eb180a3d523ff75bed4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d7b3273fe5e84ac9896776c04d2e329e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7b3273fe5e84ac9896776c04d2e329e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -582,7 +582,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ed53a5d6a6c49e696904b2868dd64f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ed53a5d6a6c49e696904b2868dd64f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc50ba4b1fdb430a9c31e3c89cd65d95-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc50ba4b1fdb430a9c31e3c89cd65d95-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -603,7 +603,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c690f91fcf054c949a1b6ac879647917-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c690f91fcf054c949a1b6ac879647917-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fff5702ff95242fd95a2fc1e1de7bffa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fff5702ff95242fd95a2fc1e1de7bffa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -624,7 +624,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e11de2982c824a479e41a18a0318aadb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e11de2982c824a479e41a18a0318aadb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d36fe69b12b419ab684599714ca84da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d36fe69b12b419ab684599714ca84da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -645,7 +645,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/114f29dfda234ce9b81cb618f903d1c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/114f29dfda234ce9b81cb618f903d1c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f5ac3b918f84c69992c1c2eb1649d62-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f5ac3b918f84c69992c1c2eb1649d62-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -666,7 +666,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c850d332370443a1a8281adc00279fd3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c850d332370443a1a8281adc00279fd3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42cf68d18e8c4ebe933b017163008ca1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42cf68d18e8c4ebe933b017163008ca1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -688,7 +688,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78b80cbaf805476bae47238a7d5d8624-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78b80cbaf805476bae47238a7d5d8624-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f8fce39a2d84b2a8a539762d53e2369-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f8fce39a2d84b2a8a539762d53e2369-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -710,7 +710,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5450ecf11ba04580bc186446f645c3e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5450ecf11ba04580bc186446f645c3e4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f88b241ca08d4943bc2e7129a2535039-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f88b241ca08d4943bc2e7129a2535039-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -744,12 +744,18 @@ "\n", "Option for printingOptions changed from normal to all\n", "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", - "\n", + "\n" + ] + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3cb741c1a47477ab36b42989a36e974-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3cb741c1a47477ab36b42989a36e974-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b531b08564541678a54be98b5f5a769-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b531b08564541678a54be98b5f5a769-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -788,7 +794,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/838c6631e7a5487e870965d1c495b53c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/838c6631e7a5487e870965d1c495b53c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38bcec6f26ff4d699874d416bec950f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38bcec6f26ff4d699874d416bec950f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -806,7 +812,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/222cbaf87c1d4a1ba609a073aa8524d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/222cbaf87c1d4a1ba609a073aa8524d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2270f2d5ae6f4f7b8a849ae3b10d8e69-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2270f2d5ae6f4f7b8a849ae3b10d8e69-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -824,7 +830,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de7cd8844342470489253e33a482031c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de7cd8844342470489253e33a482031c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1b108a3777d4379ab3cf1639e1f4c3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1b108a3777d4379ab3cf1639e1f4c3d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -842,7 +848,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d399551cee9c43c99cb9ce5a0289f066-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d399551cee9c43c99cb9ce5a0289f066-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89c5ab58413b4693bfeeb8e587ad83ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c5ab58413b4693bfeeb8e587ad83ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -860,7 +866,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a5b97cfc130240f4b6ca697da32914e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a5b97cfc130240f4b6ca697da32914e7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65683525555849148c3251e562f2b947-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65683525555849148c3251e562f2b947-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -881,7 +887,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/70170435d41b4cdc9de422661b30c8ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70170435d41b4cdc9de422661b30c8ce-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6257328f6c1a4ea9927140ea903f0b5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6257328f6c1a4ea9927140ea903f0b5c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -930,7 +936,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3076cc7160074e4eb42a6e902edd4167-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3076cc7160074e4eb42a6e902edd4167-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d32568843d8944f29c482c61d285e98b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d32568843d8944f29c482c61d285e98b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -979,7 +985,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/422a1ba4f5594e538dd5689d97148fb2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/422a1ba4f5594e538dd5689d97148fb2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82ae2b74575e45898b55ae9386a2f4ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82ae2b74575e45898b55ae9386a2f4ff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1028,7 +1034,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/67b05623cfba4809b0d6c4735fb8dafe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67b05623cfba4809b0d6c4735fb8dafe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/098514e04a0d45829aeb9fb265b772d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/098514e04a0d45829aeb9fb265b772d8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1049,7 +1055,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/79813c5964114c3485fde3e69bef4934-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79813c5964114c3485fde3e69bef4934-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71b85f4549054ce1965ff2306ed12ce8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71b85f4549054ce1965ff2306ed12ce8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1071,7 +1077,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1e4f507df2a4b01a291abbc137d5c7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1e4f507df2a4b01a291abbc137d5c7a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f783dce65c6b443db422c08ae123acd5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f783dce65c6b443db422c08ae123acd5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1111,7 +1117,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1828de81be04fc18a71915d8c8c344a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1828de81be04fc18a71915d8c8c344a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4289a0b52b864ae8bf6f0c9b5bbfc4d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4289a0b52b864ae8bf6f0c9b5bbfc4d1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1151,7 +1157,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e789f15840f40f7a05a208948487b28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e789f15840f40f7a05a208948487b28-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc1b666c4874462cb098d30be48cb471-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc1b666c4874462cb098d30be48cb471-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1173,7 +1179,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6c12fded3bd24847b82a15ace5a77174-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6c12fded3bd24847b82a15ace5a77174-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1d73872b0004f17b2ec592dff5e2a3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1d73872b0004f17b2ec592dff5e2a3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1196,7 +1202,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d39fe77df874bd7b41ab57c40b0ea03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d39fe77df874bd7b41ab57c40b0ea03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a19802abeff401dab894de3adefed8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a19802abeff401dab894de3adefed8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1214,7 +1220,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0473d491a6a34980bc43ec9b67c22efc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0473d491a6a34980bc43ec9b67c22efc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/85f39b907fb9460780922c64fbc582d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85f39b907fb9460780922c64fbc582d9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1232,7 +1238,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46e19c9ef0ca4c71a0c3552f2e86e073-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46e19c9ef0ca4c71a0c3552f2e86e073-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0327468d682b4896a90b9d2b8d868076-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0327468d682b4896a90b9d2b8d868076-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1250,7 +1256,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8ea9cff89e647c4a53a5491275b8ffb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8ea9cff89e647c4a53a5491275b8ffb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bea0b22448ee40f6b09196f442ee62e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bea0b22448ee40f6b09196f442ee62e4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1268,7 +1274,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7cf019661462490eb64ebe41bf25cb99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7cf019661462490eb64ebe41bf25cb99-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72504b8ec0d54bd79b62c9664f334116-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72504b8ec0d54bd79b62c9664f334116-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1289,7 +1295,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e6e932c17ac54f3aa7e9d85258fe07cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6e932c17ac54f3aa7e9d85258fe07cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a88ef26e2a4e4eb9866a18ed5b083d3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a88ef26e2a4e4eb9866a18ed5b083d3e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1338,7 +1344,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5090dd0f3f50429d98c6703460a2be84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5090dd0f3f50429d98c6703460a2be84-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3401333a83c240c4ab4392a482da4306-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3401333a83c240c4ab4392a482da4306-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1387,7 +1393,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ed3fd03c9e84deb989b42a7fd7bf949-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ed3fd03c9e84deb989b42a7fd7bf949-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d2e6bec429f4706a6f1186c783271a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d2e6bec429f4706a6f1186c783271a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1409,7 +1415,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82fa0c1f63ce48e9b6d3013cb1cc64cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82fa0c1f63ce48e9b6d3013cb1cc64cb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d017d6f7e2a54d04a6390ced04215e7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d017d6f7e2a54d04a6390ced04215e7c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1431,7 +1437,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/861bdc5a3b3b443fbcdb08035936845d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/861bdc5a3b3b443fbcdb08035936845d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b7e28ced93d4448b64cec28bef3d780-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b7e28ced93d4448b64cec28bef3d780-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1452,7 +1458,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4f4712d17b142f49d21924bc4c408d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4f4712d17b142f49d21924bc4c408d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35e77a9b5305487889b158d2aa0577cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35e77a9b5305487889b158d2aa0577cc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1474,7 +1480,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a915c5d1c3543648d925a509ffe1023-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a915c5d1c3543648d925a509ffe1023-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77c0d182aebd412894caf6dfb0250c24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77c0d182aebd412894caf6dfb0250c24-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1496,7 +1502,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c655ae07de8d4f2397ac487000fc2952-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c655ae07de8d4f2397ac487000fc2952-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/86515215e8b5431b94373f3fdc19da41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/86515215e8b5431b94373f3fdc19da41-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1514,7 +1520,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32a0d001d4a64f33be0a16f824c9a6bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32a0d001d4a64f33be0a16f824c9a6bd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/972bcd2f10ce4d75906d0349b7845726-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/972bcd2f10ce4d75906d0349b7845726-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1532,7 +1538,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc7a33549ee845da950a2fc56a2e8b04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc7a33549ee845da950a2fc56a2e8b04-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b552ac0ed07246ea86c5079970355a50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b552ac0ed07246ea86c5079970355a50-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1550,7 +1556,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d5cb53cfa864478b32a02554d9a556a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d5cb53cfa864478b32a02554d9a556a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46d072352f874d19b034ea5da3a2dfff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46d072352f874d19b034ea5da3a2dfff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1568,7 +1574,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b4c7a88623f4476bd4ef21aaa0bdd4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b4c7a88623f4476bd4ef21aaa0bdd4a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/69688793fcd247b89bbcbf90486c8459-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69688793fcd247b89bbcbf90486c8459-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1586,7 +1592,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/989cd0f5d3d340ac97d6f2e4c17c9007-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/989cd0f5d3d340ac97d6f2e4c17c9007-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/37b36271315c484fa4576dbd4e33665a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/37b36271315c484fa4576dbd4e33665a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1625,7 +1631,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f7ed1c3f06ae45719b641394b47fdee0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7ed1c3f06ae45719b641394b47fdee0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c364241ec5f44f10b83f39b42a3c5962-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c364241ec5f44f10b83f39b42a3c5962-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1672,7 +1678,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db4dbfb7f3ca4bc4bf49f276ef09a9ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db4dbfb7f3ca4bc4bf49f276ef09a9ee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d94cb1ce5b85420c9a269637436165cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d94cb1ce5b85420c9a269637436165cd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1719,7 +1725,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6415585922454999b6d51ea0ee8988b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6415585922454999b6d51ea0ee8988b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c78f1f775a5847c89b03f8188c24219c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c78f1f775a5847c89b03f8188c24219c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1767,7 +1773,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84c9fcfdaedc471e97cfbb2e27cdb135-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84c9fcfdaedc471e97cfbb2e27cdb135-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71a56399380f4aad83a655df1623ae18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71a56399380f4aad83a655df1623ae18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1814,7 +1820,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/105dc79203b64c749fa66019dd2d5bf4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/105dc79203b64c749fa66019dd2d5bf4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ec57b074a424727a9cc4e3130944ca9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ec57b074a424727a9cc4e3130944ca9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1862,7 +1868,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f62a3c0bbd144feaa1893744f40d54e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f62a3c0bbd144feaa1893744f40d54e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c7e2d6bf6be5499fbb5a2f8205f55986-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c7e2d6bf6be5499fbb5a2f8205f55986-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1880,7 +1886,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3155f58b70e4aaeb5f8fb9e83438629-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3155f58b70e4aaeb5f8fb9e83438629-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90dd37b06cb3447db944ed0310b1426a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90dd37b06cb3447db944ed0310b1426a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1898,7 +1904,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46dfb0d813954c84b56c9d805f456b44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46dfb0d813954c84b56c9d805f456b44-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8bb0518da09488a8f6bdaa54cb4550c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8bb0518da09488a8f6bdaa54cb4550c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1916,7 +1922,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/118f487e8b9f4a07afbaacbb3eb11ba0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/118f487e8b9f4a07afbaacbb3eb11ba0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b84b3ff561f24b0380bbc0bb51f18a8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b84b3ff561f24b0380bbc0bb51f18a8b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1934,7 +1940,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bba71fa892984fbd9b63a37035060ffc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bba71fa892984fbd9b63a37035060ffc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4eea78d1883441439b80b4d927ef601c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4eea78d1883441439b80b4d927ef601c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1952,7 +1958,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89c7e26a67d74990b45a9f2ee6c9cbe6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c7e26a67d74990b45a9f2ee6c9cbe6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e6cdf081aae644ce95f2ab95207aa599-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6cdf081aae644ce95f2ab95207aa599-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -1973,7 +1979,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f7940bacfaa4ae5a7d2973df614bdd8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f7940bacfaa4ae5a7d2973df614bdd8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3706163267842298c7b8683c7d1ba72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3706163267842298c7b8683c7d1ba72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2021,7 +2027,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f2098e2f8f545c8a29f5b7ba3af73cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f2098e2f8f545c8a29f5b7ba3af73cc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1325376bba948788cb22b5f7e5cf822-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1325376bba948788cb22b5f7e5cf822-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2069,7 +2075,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3ff2adcb85e47a8ae5b3ddf3712fee1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3ff2adcb85e47a8ae5b3ddf3712fee1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a70e18e408f4ffeb161cc0df5833968-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a70e18e408f4ffeb161cc0df5833968-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2117,7 +2123,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1969bacbfb6478798797357a6265496-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1969bacbfb6478798797357a6265496-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b10d2fcf87d47bdaae8e4624b55a9ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b10d2fcf87d47bdaae8e4624b55a9ba-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2135,7 +2141,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5127376a20b849a18fb15cdee9ec6edb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5127376a20b849a18fb15cdee9ec6edb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/349f01542f0445d98c74303b4052626d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/349f01542f0445d98c74303b4052626d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2153,7 +2159,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/deab5427f1d241e48234ddc20d692e2d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/deab5427f1d241e48234ddc20d692e2d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d3511175c2d4cb480a6b7b65f22853d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d3511175c2d4cb480a6b7b65f22853d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2171,7 +2177,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a8dbc55f7274754a4f3492dc1274449-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a8dbc55f7274754a4f3492dc1274449-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a1df2d893be48a981c4d850321e8ac7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a1df2d893be48a981c4d850321e8ac7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2189,7 +2195,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eb9f9b97c1a54074be367ca7d99ec08a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb9f9b97c1a54074be367ca7d99ec08a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4834350bb6a4ac78a3033159aa0e729-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4834350bb6a4ac78a3033159aa0e729-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2207,7 +2213,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9679a4a53cb4fb49447eab445bedd51-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9679a4a53cb4fb49447eab445bedd51-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a29cb0884e374e3e90b95b8457ca349d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a29cb0884e374e3e90b95b8457ca349d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2225,7 +2231,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0526cada9c6e4197920778c058effcc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0526cada9c6e4197920778c058effcc7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b00379c3a9943c486ca88761729be8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b00379c3a9943c486ca88761729be8f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2246,7 +2252,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b50c049758e44eeaee13069a3a689b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b50c049758e44eeaee13069a3a689b2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/94f49c29db344e669267ebdee236e025-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94f49c29db344e669267ebdee236e025-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2294,7 +2300,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f085f270960440bb839d220a541c2a4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f085f270960440bb839d220a541c2a4a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c0694b33db474cf298d2a8b713bf3c23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0694b33db474cf298d2a8b713bf3c23-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2312,7 +2318,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc24a2f009804287a1dbe568f753bebe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc24a2f009804287a1dbe568f753bebe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b774d37ef544253a9eac73f352c7c50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b774d37ef544253a9eac73f352c7c50-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2330,7 +2336,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00469d84888d4c1b9c59afde586d9fb4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00469d84888d4c1b9c59afde586d9fb4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8accd2609e04d61ba6abcae4f07cb9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8accd2609e04d61ba6abcae4f07cb9c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2348,7 +2354,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7834306c30214dafaccbfebcf6be5c1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7834306c30214dafaccbfebcf6be5c1d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f2fc1b002ca444ab49cc20f0615cf63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f2fc1b002ca444ab49cc20f0615cf63-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2366,7 +2372,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4c2f919b18f94069a5c707a9af8557c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4c2f919b18f94069a5c707a9af8557c6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/070502ddd5d04e33a4c4fde1df545e4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/070502ddd5d04e33a4c4fde1df545e4b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2384,7 +2390,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2324406cf4c9431e9675975d65503403-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2324406cf4c9431e9675975d65503403-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2d9675c869141f3a0f2f46a4f16ee91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2d9675c869141f3a0f2f46a4f16ee91-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2402,7 +2408,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b07d5e718c5b4dbba7295a3d0d9199c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b07d5e718c5b4dbba7295a3d0d9199c8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3166c9c0768c4c248d2e8423ca89322d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3166c9c0768c4c248d2e8423ca89322d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2420,7 +2426,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78f9178490514e4db709de6dcfe2c8f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78f9178490514e4db709de6dcfe2c8f9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/083fc07022994c72879d457dc12d1ccd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/083fc07022994c72879d457dc12d1ccd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2438,7 +2444,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c28dbc73281f41f3bd100666f7b336a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c28dbc73281f41f3bd100666f7b336a0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1373724c5c245f1a6d2b03592c4459e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1373724c5c245f1a6d2b03592c4459e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2456,7 +2462,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92b2a9bbb86549408708a2f4019bf58c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92b2a9bbb86549408708a2f4019bf58c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1a8185f710a492b8dedae2a4dc41f22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1a8185f710a492b8dedae2a4dc41f22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2474,7 +2480,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e9891f0026434043a4982e90ef7f8c12-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9891f0026434043a4982e90ef7f8c12-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2ba3bbe316949108b9e774a9174b0a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ba3bbe316949108b9e774a9174b0a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2492,7 +2498,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9e70f7c324f4886ab11b9c155d8348e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9e70f7c324f4886ab11b9c155d8348e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea86e6325cbc447b8dfa752263a5c903-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea86e6325cbc447b8dfa752263a5c903-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2510,7 +2516,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/627910d197854669989c43e705caaca1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/627910d197854669989c43e705caaca1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee06a8264e8a4e3cbcda71cd4cca4af8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee06a8264e8a4e3cbcda71cd4cca4af8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2528,7 +2534,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f85a9f82016b4e15882b7231c02acae8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f85a9f82016b4e15882b7231c02acae8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc2ba71f3925409d8078b542dbdbad17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc2ba71f3925409d8078b542dbdbad17-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2546,7 +2552,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea147ad4b39a40da9e731296bb94a5bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea147ad4b39a40da9e731296bb94a5bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b771b4e037c1442f9b0cd3d6e56c40c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b771b4e037c1442f9b0cd3d6e56c40c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2564,7 +2570,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/489c36154e1e4d249450f4899dd1611b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/489c36154e1e4d249450f4899dd1611b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/812e7d97b0974a9cb0dacfc9a83f475c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/812e7d97b0974a9cb0dacfc9a83f475c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2582,7 +2588,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5069691da354836a0c50b89d61edd19-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5069691da354836a0c50b89d61edd19-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9cd0a771fbf94f63af953da0156f9a91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cd0a771fbf94f63af953da0156f9a91-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2600,7 +2606,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/feb78a1a70e3400d9e6e2ade73017e67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/feb78a1a70e3400d9e6e2ade73017e67-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7dbe4651dc5445bda6544d786e8a9b24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7dbe4651dc5445bda6544d786e8a9b24-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2618,7 +2624,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d7329af807d84c89af912d0cf442ead6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7329af807d84c89af912d0cf442ead6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9e0d26d25c5453bbac8fe9b6e3e0567-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9e0d26d25c5453bbac8fe9b6e3e0567-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2636,7 +2642,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d50e8c341f9c46d1ac6bb85f1b41e7ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d50e8c341f9c46d1ac6bb85f1b41e7ba-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd056e2506714729b2b1410efb95dc7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd056e2506714729b2b1410efb95dc7f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2654,7 +2660,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/404bb5483744436aa74f240ed034a132-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/404bb5483744436aa74f240ed034a132-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9cc871698c14008b0f9a47855730b65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9cc871698c14008b0f9a47855730b65-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2672,7 +2678,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/14cc1342c10447798188ca6927ecbea0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14cc1342c10447798188ca6927ecbea0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f222df8c194e4ed68e26e85c0f243f7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f222df8c194e4ed68e26e85c0f243f7f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2690,7 +2696,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/024364e78ed142f2a71013953e11371a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/024364e78ed142f2a71013953e11371a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/567bf140d9a9478e9329709e794183aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/567bf140d9a9478e9329709e794183aa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2708,7 +2714,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8082d674f67d4a7eb0cf838be3e55a06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8082d674f67d4a7eb0cf838be3e55a06-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e7aa92744eb41bf9b9b27ac9699b9da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e7aa92744eb41bf9b9b27ac9699b9da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2726,7 +2732,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87389887b4714e419dd1a8ead540eb17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87389887b4714e419dd1a8ead540eb17-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a2550bbf00349b2b19c84d3e72f7e9e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a2550bbf00349b2b19c84d3e72f7e9e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2744,7 +2750,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd9b83b5171740bf9858fa61cda36ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd9b83b5171740bf9858fa61cda36ed5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d5d61f68dd0488497f5c581c9733f3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d5d61f68dd0488497f5c581c9733f3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2764,7 +2770,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f541dc1b443149c4a58248e881075922-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f541dc1b443149c4a58248e881075922-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/728b14810262449d86ca97276437938b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/728b14810262449d86ca97276437938b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2785,7 +2791,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3660e01145d1409bb228d2967cec7552-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3660e01145d1409bb228d2967cec7552-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a7999cf30e94c538a3b5f07767dd765-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a7999cf30e94c538a3b5f07767dd765-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2806,7 +2812,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4988f31f10424450983465f8811c2654-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4988f31f10424450983465f8811c2654-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57a87369e2484f5d9847de3a48b02cf4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57a87369e2484f5d9847de3a48b02cf4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2827,7 +2833,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5d798549f564bab84a6a0c992ca9569-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5d798549f564bab84a6a0c992ca9569-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f290741ecbe3425b9ade731d7916ab80-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f290741ecbe3425b9ade731d7916ab80-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2848,7 +2854,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3ff599762ac40c7a6beb69cdd4aad39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3ff599762ac40c7a6beb69cdd4aad39-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/37bfa91eef304c0db5f77e568229219c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/37bfa91eef304c0db5f77e568229219c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2869,7 +2875,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cdc3452bec3c435cbb4968413707fa6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdc3452bec3c435cbb4968413707fa6d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3c485bc9f70412fa718236bd4dfe8a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3c485bc9f70412fa718236bd4dfe8a6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2890,7 +2896,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f0c4eaff75c4f738188da8fa1c2e5c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f0c4eaff75c4f738188da8fa1c2e5c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/882de284e3944eb2b5abef8b0a5dbf9f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/882de284e3944eb2b5abef8b0a5dbf9f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2930,7 +2936,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1faedc91af174f9aaa07e56543843e2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1faedc91af174f9aaa07e56543843e2e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c372895e59441d5b6b4f4555426e9cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c372895e59441d5b6b4f4555426e9cf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2969,7 +2975,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ee5ad20822e40b088dda35b3cbe8c98-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ee5ad20822e40b088dda35b3cbe8c98-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2e4cdbd09ab46d4bb402536f3115d55-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2e4cdbd09ab46d4bb402536f3115d55-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -2991,7 +2997,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/76388459f51e48619a59d5403293fe81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/76388459f51e48619a59d5403293fe81-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6deb317b619e4990abdaa0b34d3bbc27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6deb317b619e4990abdaa0b34d3bbc27-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3030,7 +3036,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5ada6cc115dc449ab43d53905192190a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ada6cc115dc449ab43d53905192190a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2417fee9c2440cfbfe3fd7d90586051-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2417fee9c2440cfbfe3fd7d90586051-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3048,7 +3054,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2fccf8add9514e65bf74a21770569635-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2fccf8add9514e65bf74a21770569635-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e6503709496d425a8a98af6dbf75e0c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6503709496d425a8a98af6dbf75e0c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3066,7 +3072,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b726a956d69f4ecfb50e0e99b1d3aeb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b726a956d69f4ecfb50e0e99b1d3aeb0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8dc52af2e9949dc8150bee62596b15c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8dc52af2e9949dc8150bee62596b15c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3084,7 +3090,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/69eb21a9fa8844b68df2ab5ac55a23dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69eb21a9fa8844b68df2ab5ac55a23dc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/28658464f3de432fb9163c73cea8e0f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28658464f3de432fb9163c73cea8e0f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3102,7 +3108,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6eb42834b6cf4d9eb55fbc7c350e8fc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6eb42834b6cf4d9eb55fbc7c350e8fc9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e312bcde6ae492e8fe18c56f0984516-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e312bcde6ae492e8fe18c56f0984516-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3123,7 +3129,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e7236589f5bc43cdb8996bfb6b27850c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e7236589f5bc43cdb8996bfb6b27850c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3900a678e10847ceabaa65ef18e51614-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3900a678e10847ceabaa65ef18e51614-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3172,7 +3178,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2160b90109f44ce7acbac0fd5fface6a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2160b90109f44ce7acbac0fd5fface6a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/897b7f3e5a3c4a548000b66d73bc0755-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/897b7f3e5a3c4a548000b66d73bc0755-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3221,7 +3227,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/346c7eb64e2240e2849a1a45f93246a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/346c7eb64e2240e2849a1a45f93246a0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f30938b49aa74faba6bce507fd2956a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f30938b49aa74faba6bce507fd2956a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3270,7 +3276,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3671796a1f1c4359a0fc73802361cc37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3671796a1f1c4359a0fc73802361cc37-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ea786e84bd64264afa351c96c6b73de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ea786e84bd64264afa351c96c6b73de-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3292,7 +3298,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30b3c3cb72074c6db5312571c1883a99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30b3c3cb72074c6db5312571c1883a99-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/095fbb2fa9d04a7bb61e5d29e71c1690-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/095fbb2fa9d04a7bb61e5d29e71c1690-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3314,7 +3320,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a54bbbc949f340e8a0a2d7a7c8a269f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a54bbbc949f340e8a0a2d7a7c8a269f4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34317652692f4f5399d637fe10cbd462-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34317652692f4f5399d637fe10cbd462-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3336,7 +3342,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/399dc474826d419e85ce13b8e848332f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/399dc474826d419e85ce13b8e848332f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fba91d038ca44e5da894ae6a29b76787-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fba91d038ca44e5da894ae6a29b76787-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3358,7 +3364,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ec3d0898c3e84b18bea3402dec89427d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec3d0898c3e84b18bea3402dec89427d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33db401805dd4182a6e295d23af9bdc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33db401805dd4182a6e295d23af9bdc5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3380,7 +3386,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83e47a2bf1cb4fa6a05908eeaf14c0b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83e47a2bf1cb4fa6a05908eeaf14c0b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d9d06cbe590346da9ce6ca88964adeb2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d9d06cbe590346da9ce6ca88964adeb2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3398,7 +3404,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e29ce9c52a394aa38f21fa3e645b0967-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e29ce9c52a394aa38f21fa3e645b0967-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee702985cbd94e60a7d3fd086f5deebd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee702985cbd94e60a7d3fd086f5deebd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3416,7 +3422,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78a98fa55be8498eb4310d13a420810e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78a98fa55be8498eb4310d13a420810e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e39e73ed7134ef19412b5d63bc4cfc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e39e73ed7134ef19412b5d63bc4cfc7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3434,7 +3440,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1938c4774b34ce4b597cce33a87f9a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1938c4774b34ce4b597cce33a87f9a1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3879eb4052534247ad93605bf96ce3a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3879eb4052534247ad93605bf96ce3a0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3452,7 +3458,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87400cb37f87445bac0d82080bbeb1b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87400cb37f87445bac0d82080bbeb1b8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e884fc4cdab84b599978607f3b18ed89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e884fc4cdab84b599978607f3b18ed89-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3470,7 +3476,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/466f686227094a8f8c5fbe76582ec86d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/466f686227094a8f8c5fbe76582ec86d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/816382328cd04421bfd06b5e086943f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/816382328cd04421bfd06b5e086943f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3491,7 +3497,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9f394d5cc494a24b7126cc4e6617b92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f394d5cc494a24b7126cc4e6617b92-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64243a87711f490e8df748725e0225a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64243a87711f490e8df748725e0225a1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3530,7 +3536,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8fd56e2d759c4d66a739c45d92c3c348-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8fd56e2d759c4d66a739c45d92c3c348-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3848261c83184ffabb9ab37cef28b67f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3848261c83184ffabb9ab37cef28b67f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3579,7 +3585,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88435f93db574782a6b5a8656cc102da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88435f93db574782a6b5a8656cc102da-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7af5172dbd804ec2a98be952f2bfc7b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7af5172dbd804ec2a98be952f2bfc7b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3601,7 +3607,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27b6eede559e4380bcc2be8c95704ea3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27b6eede559e4380bcc2be8c95704ea3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7dfc6c4f8c9d4f22a5a6d30a00a987e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7dfc6c4f8c9d4f22a5a6d30a00a987e9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3622,7 +3628,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ac8a7f67b6c49f2b589d82af8bb7577-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ac8a7f67b6c49f2b589d82af8bb7577-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ddd2afc9b0d84657872826dd44f5f611-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ddd2afc9b0d84657872826dd44f5f611-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3643,7 +3649,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/601c1925fb004578973380d50a18bdcb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/601c1925fb004578973380d50a18bdcb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02bfa0c949f948a299ba42ae1a1c2de0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02bfa0c949f948a299ba42ae1a1c2de0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3665,7 +3671,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4170f1248f74660904d0479ca112567-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4170f1248f74660904d0479ca112567-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d6af64ab702b44a3b572909feb57f9da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6af64ab702b44a3b572909feb57f9da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3683,7 +3689,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a393205687d24cab8879f4c298c86c8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a393205687d24cab8879f4c298c86c8b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/41af4d0b3d25430b8361ff462ed747b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41af4d0b3d25430b8361ff462ed747b7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3701,7 +3707,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/020470a0e87c4803aebdef148d26cff7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/020470a0e87c4803aebdef148d26cff7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78f9dfd8e0064d5ebfbf6c1eba66503f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78f9dfd8e0064d5ebfbf6c1eba66503f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3719,7 +3725,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/36125dee5b574796b33c98df1633f66d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36125dee5b574796b33c98df1633f66d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8de0c9a130a442f2b60f454544b6663c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8de0c9a130a442f2b60f454544b6663c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3737,7 +3743,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e6da4d8fd964648a6d56a486420927b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e6da4d8fd964648a6d56a486420927b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/da053e4638954f0c951d96ae5043899a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da053e4638954f0c951d96ae5043899a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3755,7 +3761,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/983669684cf947829d52033e343308bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/983669684cf947829d52033e343308bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/08b84d4facc64d2aa3a33da560d0797f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08b84d4facc64d2aa3a33da560d0797f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3776,7 +3782,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b472be77b8264510af2a12e306b67379-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b472be77b8264510af2a12e306b67379-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad272167487a42e5b40aeb6d215b5285-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad272167487a42e5b40aeb6d215b5285-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3823,7 +3829,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2499bb39c6ff4dd59d6dc740e37894bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2499bb39c6ff4dd59d6dc740e37894bf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef38b89e7a5243c38c5d291c9989090e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef38b89e7a5243c38c5d291c9989090e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3871,7 +3877,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e899f566a2ca4b84b79c289d33dc4a72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e899f566a2ca4b84b79c289d33dc4a72-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73ce8f4c6f2848bcbb207884e7958182-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73ce8f4c6f2848bcbb207884e7958182-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3919,7 +3925,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aae304fdd3334022aa29fe3c0b302328-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aae304fdd3334022aa29fe3c0b302328-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/990e25dd9f8d4cfc9d9922f1ef2c680c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/990e25dd9f8d4cfc9d9922f1ef2c680c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3967,7 +3973,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/28dcc04cfb4242e8b13bcd52cb36d045-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28dcc04cfb4242e8b13bcd52cb36d045-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c2d50ac442704a17864a7bc04f16a7f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2d50ac442704a17864a7bc04f16a7f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -3985,7 +3991,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68a2ccbec0bf476d96d480b9b5d67bae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68a2ccbec0bf476d96d480b9b5d67bae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f342d22f1c24952bc16a8b3755ac572-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f342d22f1c24952bc16a8b3755ac572-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4003,7 +4009,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e929b658969943b0be3d2370fe7e9b5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e929b658969943b0be3d2370fe7e9b5a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e04f590d13f94e4f8c36aff6d941bdff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e04f590d13f94e4f8c36aff6d941bdff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4021,7 +4027,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2a7fa1f5803d4848bf7c9fd51a7a085a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a7fa1f5803d4848bf7c9fd51a7a085a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/567d0d12cbbf4880bf8e7a48443dc31e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/567d0d12cbbf4880bf8e7a48443dc31e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4039,7 +4045,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53eecf1bf52c4abeb137e5feb4e0e575-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53eecf1bf52c4abeb137e5feb4e0e575-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/584818ed56e64808ba292d33f6bd33c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/584818ed56e64808ba292d33f6bd33c4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4057,7 +4063,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a4ac8cae71f442e89942f32836399498-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4ac8cae71f442e89942f32836399498-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/baf5bdcd7c0d43bfa7d4b1495371a36d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baf5bdcd7c0d43bfa7d4b1495371a36d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4075,7 +4081,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1687abf606647d8a8a1a6d70c24e271-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1687abf606647d8a8a1a6d70c24e271-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c2043ad1fa8e453f82d8331993b61a76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2043ad1fa8e453f82d8331993b61a76-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4096,7 +4102,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b962f62c64804ddb9abd361e813b8496-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b962f62c64804ddb9abd361e813b8496-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b189cf1636e4f07aafa1b3f36f09900-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b189cf1636e4f07aafa1b3f36f09900-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4144,7 +4150,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc4c912f4b174e1493ca9dd2aff01f97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc4c912f4b174e1493ca9dd2aff01f97-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9231b6773214cb3b8a3d873c6bfa9f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9231b6773214cb3b8a3d873c6bfa9f7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4192,7 +4198,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/10d8c8eed15e4753a081a0fe7f0ca34e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10d8c8eed15e4753a081a0fe7f0ca34e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/681045f79bb64f3c8440b7e1e1874771-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/681045f79bb64f3c8440b7e1e1874771-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4210,7 +4216,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ba74c4c6dd24ca4b8b06f2bd77d7c17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ba74c4c6dd24ca4b8b06f2bd77d7c17-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e78d775bf40e4ccd9f574aba36d8adc6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e78d775bf40e4ccd9f574aba36d8adc6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4228,7 +4234,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c2c8579f1144521b6099846432ed6d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c2c8579f1144521b6099846432ed6d1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/900e30ac1d7141bb9facd630b505b52b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/900e30ac1d7141bb9facd630b505b52b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4246,7 +4252,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9a7bfbaa8a545bea506d8e6fef330ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9a7bfbaa8a545bea506d8e6fef330ca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e48949d6e9744c1f9dd4254ca2e9538a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e48949d6e9744c1f9dd4254ca2e9538a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4264,7 +4270,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b5385ba9e2e48bcb3fecb1e7b8622be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b5385ba9e2e48bcb3fecb1e7b8622be-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98a4e333eabf421ba4a14c1c69a5035d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98a4e333eabf421ba4a14c1c69a5035d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4282,7 +4288,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bcd577f8d28d499594813226fe04b854-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcd577f8d28d499594813226fe04b854-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ab5af2c782143eea4c417c60c2ff092-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ab5af2c782143eea4c417c60c2ff092-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4300,7 +4306,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4e42bb81b372429cb133f9e549668457-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e42bb81b372429cb133f9e549668457-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b7ce0cf4b55b430891f4e9f38c40924f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7ce0cf4b55b430891f4e9f38c40924f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4321,7 +4327,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c3ddd496fb0e4300a9a99f55d094bac3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3ddd496fb0e4300a9a99f55d094bac3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0b00936a1ce14380bb27909a4598d38f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b00936a1ce14380bb27909a4598d38f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4339,7 +4345,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa0864bb3ce1492b98bc8a7dbed8ba31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa0864bb3ce1492b98bc8a7dbed8ba31-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/446f0c1d52ce4e9fb415b56fa876e486-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/446f0c1d52ce4e9fb415b56fa876e486-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4357,7 +4363,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02105a0804554e0a9210ccb0a31014f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02105a0804554e0a9210ccb0a31014f8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e9378c1481f24291a152f222ebbbcadc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9378c1481f24291a152f222ebbbcadc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4375,7 +4381,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b328d2905c79464289003fc68d489a22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b328d2905c79464289003fc68d489a22-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b88b5760d2ed4c19af7be862f2dfff78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b88b5760d2ed4c19af7be862f2dfff78-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4393,7 +4399,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fbbf91e6fcb41fea96c8c14c3c68f7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fbbf91e6fcb41fea96c8c14c3c68f7f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bfc51bbe5654f8fa2546398add558f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bfc51bbe5654f8fa2546398add558f4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4411,7 +4417,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72293fcb074e48b2a3f1377dc27f39f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72293fcb074e48b2a3f1377dc27f39f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02a86e2a819a4559b4e7c2e85d0748e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02a86e2a819a4559b4e7c2e85d0748e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4429,7 +4435,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f2b3aa53c167495cb0d04487d7346b0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f2b3aa53c167495cb0d04487d7346b0e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/785353811d404776928dac0b238f87b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/785353811d404776928dac0b238f87b7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4447,7 +4453,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87e75acc42e043ebb1d171a75124d105-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87e75acc42e043ebb1d171a75124d105-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4bf216da759b4aa8908a5378eb304f98-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bf216da759b4aa8908a5378eb304f98-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4465,7 +4471,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/edc0f1c7e81b434c8e98cd188e2ebbdd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/edc0f1c7e81b434c8e98cd188e2ebbdd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/454ea23fc1b54097a2188e4b066d780d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/454ea23fc1b54097a2188e4b066d780d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4483,7 +4489,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c7c664c970a45f9b756f8196e128332-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c7c664c970a45f9b756f8196e128332-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77f12c729fea4512897eba94364d49e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77f12c729fea4512897eba94364d49e6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4501,7 +4507,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/744b27892acb4c64b1a5139e47f8adf1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/744b27892acb4c64b1a5139e47f8adf1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef18e67e39a84526b475eac33c1bec8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef18e67e39a84526b475eac33c1bec8b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4519,7 +4525,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98166e4a39534d9d9bbd3a15368e3014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98166e4a39534d9d9bbd3a15368e3014-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c9c808591d64417386f86e7f005454d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9c808591d64417386f86e7f005454d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4537,7 +4543,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ccf696d6e6647edbc3c32c14bd81435-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ccf696d6e6647edbc3c32c14bd81435-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc2fea99557b43d088dca25ac362a949-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc2fea99557b43d088dca25ac362a949-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4555,7 +4561,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a982e4992cf940ebb710fef4aca1dfd7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a982e4992cf940ebb710fef4aca1dfd7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f935c36bdc704b4cac45d74df1329790-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f935c36bdc704b4cac45d74df1329790-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4573,7 +4579,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88eb10d70e394aaa8669b034e7767e08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88eb10d70e394aaa8669b034e7767e08-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e3861c4894694497b31952adb131cd6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3861c4894694497b31952adb131cd6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4591,7 +4597,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d388b49b0f74651be69785fb7246045-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d388b49b0f74651be69785fb7246045-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c06b515377e3424fba6664ec28985f26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c06b515377e3424fba6664ec28985f26-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4609,7 +4615,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/678cd19ebea74e90a501d04aefd80492-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/678cd19ebea74e90a501d04aefd80492-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbc745b94c074edc88f98bb5f0c27e3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbc745b94c074edc88f98bb5f0c27e3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4627,7 +4633,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b391e8ffb814ccdaf1b31373e009ade-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b391e8ffb814ccdaf1b31373e009ade-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/49bdd2304ca74a7da664e80e63661cfe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49bdd2304ca74a7da664e80e63661cfe-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4645,7 +4651,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/62200d55b56e42778e5beed686d91dc0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62200d55b56e42778e5beed686d91dc0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80b6035bd6d44cee90f8d1d5e1ff8882-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80b6035bd6d44cee90f8d1d5e1ff8882-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4663,7 +4669,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/313ed2a1568b40a3a804856601156d32-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/313ed2a1568b40a3a804856601156d32-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d71c88203e8c42ce8e95c4d010690efc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d71c88203e8c42ce8e95c4d010690efc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4681,7 +4687,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9668de0e235a410e8f01ed6349cf491c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9668de0e235a410e8f01ed6349cf491c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5763707868840f0b4b3f89ac2d08250-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5763707868840f0b4b3f89ac2d08250-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4699,7 +4705,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3040789686a74da18bd31ee976a12e2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3040789686a74da18bd31ee976a12e2a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/551235ed299d41cca4c92d18ffe86d5d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/551235ed299d41cca4c92d18ffe86d5d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4717,7 +4723,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/82fab14bf9c24e5e99148dbf96ed2296-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82fab14bf9c24e5e99148dbf96ed2296-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/164650d61f37494fa5f11e4794e39f10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/164650d61f37494fa5f11e4794e39f10-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4735,7 +4741,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/162a91e3bc1d4eb2ac0e1dd08b0a8ac1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/162a91e3bc1d4eb2ac0e1dd08b0a8ac1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/26356302c24c434c88089922579522aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26356302c24c434c88089922579522aa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4756,7 +4762,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c9a28527e70743af8a9d26b7ced8700d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9a28527e70743af8a9d26b7ced8700d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ffcfe845e81848f29f27fa075daed92b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffcfe845e81848f29f27fa075daed92b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4805,7 +4811,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1ac952c110246e7a8d13ab3dc4d8521-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1ac952c110246e7a8d13ab3dc4d8521-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57969e42fe1a467cb60cbb94283f44d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57969e42fe1a467cb60cbb94283f44d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4844,7 +4850,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7217c4328bdd4e86a7f8f7398e7781ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7217c4328bdd4e86a7f8f7398e7781ca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/340d054b1dcf44dc8336f5fa1aff07c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/340d054b1dcf44dc8336f5fa1aff07c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4866,7 +4872,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90842800e62f403eb5352f55a9af1d2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90842800e62f403eb5352f55a9af1d2f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f92c83db0cc4aab8be47ca1786959c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f92c83db0cc4aab8be47ca1786959c8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4888,7 +4894,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c2f38606a7a4e03aabc4c06d9bf6ea9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c2f38606a7a4e03aabc4c06d9bf6ea9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b392a262da8d42e7955675afd46100f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b392a262da8d42e7955675afd46100f3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4910,7 +4916,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2cc1a769c5a94c5593d7f16615012c01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cc1a769c5a94c5593d7f16615012c01-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8574c7326234aa8b8a04fcbfbeecec7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8574c7326234aa8b8a04fcbfbeecec7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4932,7 +4938,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bb514a1903104aaeb88654e89090ec67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bb514a1903104aaeb88654e89090ec67-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3df5958f54348f3a012cb1da98a9662-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3df5958f54348f3a012cb1da98a9662-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4954,7 +4960,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0aeabeb55c9c4df5975e87e12ec37165-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0aeabeb55c9c4df5975e87e12ec37165-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc293c6662ab4be28401efc5ad8ed301-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc293c6662ab4be28401efc5ad8ed301-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4972,7 +4978,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/94e05492e94b4f1f9fc1fc78269a0355-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94e05492e94b4f1f9fc1fc78269a0355-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/05fb27442ae2464b9040c1c430581d96-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05fb27442ae2464b9040c1c430581d96-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -4990,7 +4996,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/375ddd6eeac045c880eb892e90111a02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/375ddd6eeac045c880eb892e90111a02-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f84d262c4ce482ab6bae18283cb90dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f84d262c4ce482ab6bae18283cb90dc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5008,7 +5014,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a50327c557004045bfb64d3922056869-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a50327c557004045bfb64d3922056869-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/964658393f9c4910aeb16917a4803f35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/964658393f9c4910aeb16917a4803f35-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5026,7 +5032,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f2bf7c535ea40869b2f1a5af31870cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f2bf7c535ea40869b2f1a5af31870cd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b7cf7ec165c64055a14e3c3d7c3d60e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7cf7ec165c64055a14e3c3d7c3d60e7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5044,7 +5050,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2a9228555cf143f3b43edeb020d95389-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a9228555cf143f3b43edeb020d95389-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bfbdf6e1840442f6b18701bd496e0983-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfbdf6e1840442f6b18701bd496e0983-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5093,7 +5099,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef6a26918aa0437f8fa3980a03ff8ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef6a26918aa0437f8fa3980a03ff8ed5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a3a72d040854c9f9c42f2896ae5f477-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a3a72d040854c9f9c42f2896ae5f477-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5115,7 +5121,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c8412c397d6e4cb2ac2b2dd4881bb643-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8412c397d6e4cb2ac2b2dd4881bb643-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/731e8ff2a3b74e479afb6c4af4011ee6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/731e8ff2a3b74e479afb6c4af4011ee6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5137,7 +5143,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/66174556a7184e15970b13340348bc11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/66174556a7184e15970b13340348bc11-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3481fa25c6cc4c1e95e69fdca338e180-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3481fa25c6cc4c1e95e69fdca338e180-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5159,7 +5165,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6904f5b52569463aafa0c19fb549b46c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6904f5b52569463aafa0c19fb549b46c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/020f26f3b101451c91f338b795d43144-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/020f26f3b101451c91f338b795d43144-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5181,7 +5187,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0a3db9e30454d0a8d999fd183d43ecc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0a3db9e30454d0a8d999fd183d43ecc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c01f63c3c064bcebf6b38445e1711f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c01f63c3c064bcebf6b38445e1711f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5203,7 +5209,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/340c0fb03a4948edae9a81916cfaab6e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/340c0fb03a4948edae9a81916cfaab6e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/139f6919537c45c4a6a15acd96dee39e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/139f6919537c45c4a6a15acd96dee39e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5221,7 +5227,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fbb0f9aac161467781195579f0e8c6a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbb0f9aac161467781195579f0e8c6a1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6443142c208b493e9b44c64b560bc07f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6443142c208b493e9b44c64b560bc07f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5239,7 +5245,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/105e525ec64f4df58cbeeb6585776f4f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/105e525ec64f4df58cbeeb6585776f4f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/31d0482351da4ade9fdf5a00c913d428-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/31d0482351da4ade9fdf5a00c913d428-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5257,7 +5263,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a639f4c42c5b4bf0840feb095ae926d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a639f4c42c5b4bf0840feb095ae926d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6115042d15b248c9a91ab9f2148c042e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6115042d15b248c9a91ab9f2148c042e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5275,7 +5281,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6208064ec448415baedf562e9381be24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6208064ec448415baedf562e9381be24-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a07c10ce139d4b2191f3205a6430bd0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a07c10ce139d4b2191f3205a6430bd0c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5293,7 +5299,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/083c95d236b44645914f3aec883fd671-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/083c95d236b44645914f3aec883fd671-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/863648b005484f60953378f9e9dce9dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/863648b005484f60953378f9e9dce9dd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5311,7 +5317,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d385ce961eb14558b6322b969b5f8a48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d385ce961eb14558b6322b969b5f8a48-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46900b4d134e4ff082f080ebec8808ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46900b4d134e4ff082f080ebec8808ab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5333,7 +5339,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75a71eb9669b423282a68a4c31aef423-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75a71eb9669b423282a68a4c31aef423-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f051009bd62e485f8cbceacc205595ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f051009bd62e485f8cbceacc205595ae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5355,7 +5361,7 @@ "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 6 (TwoMirCuts) - 3 row cuts average 3.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.00 seconds)\n", + "Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.01 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", "Probing was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", @@ -5372,17 +5378,17 @@ "No feasible solution found\n", "Enumerated nodes: 0\n", "Total iterations: 0\n", - "Time (CPU seconds): 0.00\n", - "Time (Wallclock seconds): 0.00\n", + "Time (CPU seconds): 0.01\n", + "Time (Wallclock seconds): 0.01\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4e76349f007a4d4ab6984a449117e78e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e76349f007a4d4ab6984a449117e78e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9db8c72aab2e482aaf7f50489e939c68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9db8c72aab2e482aaf7f50489e939c68-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5431,7 +5437,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/888f82801b9141de90f195da0e7caaf5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/888f82801b9141de90f195da0e7caaf5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93d57fc02ecd4da0843c70ecfdfdc85e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93d57fc02ecd4da0843c70ecfdfdc85e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5480,7 +5486,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bba062984ae04ed691d1c7c7d9e9b9ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bba062984ae04ed691d1c7c7d9e9b9ae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a610f0358f01494cb4dc8f45b3880eb7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a610f0358f01494cb4dc8f45b3880eb7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5498,7 +5504,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6bceb4a71a5749d2ae6b08849d2125b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bceb4a71a5749d2ae6b08849d2125b4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c45b6b7f86940eea263b146b7aa5f13-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c45b6b7f86940eea263b146b7aa5f13-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5516,7 +5522,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d9fa9f5f96d475e987e0612cbda335e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d9fa9f5f96d475e987e0612cbda335e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3479b17ef2ef4f4c8542354b871717b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3479b17ef2ef4f4c8542354b871717b8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5534,7 +5540,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dcd53196663d4754bb8f0eb56178289e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dcd53196663d4754bb8f0eb56178289e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca70d63013514a0dbc99fc7f4e87ed17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca70d63013514a0dbc99fc7f4e87ed17-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5552,7 +5558,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/543f74967e6d46aaa48de850279e34d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/543f74967e6d46aaa48de850279e34d7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af16eb2ebd5e4ded86f4a1eb09c0d780-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af16eb2ebd5e4ded86f4a1eb09c0d780-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5570,7 +5576,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9bcea30ef63344c5a151102060fcbdbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bcea30ef63344c5a151102060fcbdbf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3d83cb9eaecc435ca137f2db295d02d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d83cb9eaecc435ca137f2db295d02d3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5582,13 +5588,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9da0b84f4b8b4d3998b79fd9b42e49e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9da0b84f4b8b4d3998b79fd9b42e49e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/655cd0cd6fcc43848628061596902836-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/655cd0cd6fcc43848628061596902836-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5610,7 +5616,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5bf0d5e6668490195bd99a6f2d1682b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5bf0d5e6668490195bd99a6f2d1682b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd593acb6540442397db9e9f508e2579-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd593acb6540442397db9e9f508e2579-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5659,7 +5665,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b4f8203a4bd74045acef2e45a0a49017-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4f8203a4bd74045acef2e45a0a49017-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd73a2ec0f154e6f9453751ccec1a62f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd73a2ec0f154e6f9453751ccec1a62f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5677,7 +5683,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/47fbd79dac1e48348472f94a15070c78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47fbd79dac1e48348472f94a15070c78-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/727324152aaa499ab84d24ce8d5a40be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/727324152aaa499ab84d24ce8d5a40be-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5695,7 +5701,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f61cecd976eb405697c85e60f19c1235-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f61cecd976eb405697c85e60f19c1235-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d4d13e9980341e89c670a7ab95d0cae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d4d13e9980341e89c670a7ab95d0cae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5713,7 +5719,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2268474eef7541099e17dad02a28ad47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2268474eef7541099e17dad02a28ad47-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d463b924fc5343de96b1a847ab5297ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d463b924fc5343de96b1a847ab5297ca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5731,7 +5737,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3b8ecc29dae6465bb5f532d91fa674e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b8ecc29dae6465bb5f532d91fa674e7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54c84406bcbb46fc9595a6e5a9e7193e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54c84406bcbb46fc9595a6e5a9e7193e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5749,7 +5755,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a2fc08714f3b4c92890a4e0ed592e3ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2fc08714f3b4c92890a4e0ed592e3ce-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bfa7f58cda554e1cab2dff276868cf13-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfa7f58cda554e1cab2dff276868cf13-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5767,7 +5773,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/623b218e7b7c445cb6527bddd740e12d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/623b218e7b7c445cb6527bddd740e12d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60c404cbc485490998da4f396b006e9e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60c404cbc485490998da4f396b006e9e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5785,7 +5791,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/822566839f5d491ab386e5d3cd94c0e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/822566839f5d491ab386e5d3cd94c0e6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5db7e7a262941608d1e69b0a81e5dac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5db7e7a262941608d1e69b0a81e5dac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5803,7 +5809,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6764cb6256654058ae7224774e3bd709-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6764cb6256654058ae7224774e3bd709-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c7ebbf5cc174a26bd7698486cb1e50e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c7ebbf5cc174a26bd7698486cb1e50e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5821,7 +5827,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efa9e190c22f43b7afa5b26b549c0727-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efa9e190c22f43b7afa5b26b549c0727-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed07f984cd6c4a528287a2f539613180-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed07f984cd6c4a528287a2f539613180-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5839,7 +5845,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2bb92fb236f94bb3b0613422428bf3b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2bb92fb236f94bb3b0613422428bf3b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b524a72db4a445debc2d4336c26b493a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b524a72db4a445debc2d4336c26b493a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5857,7 +5863,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fa5664ce1ae4bd1804cf57ff08e5abc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fa5664ce1ae4bd1804cf57ff08e5abc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44e6bb744cf547348cd79c9f7df1f7bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44e6bb744cf547348cd79c9f7df1f7bd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5875,7 +5881,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3c1237e86b4472e92c54c862495f265-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3c1237e86b4472e92c54c862495f265-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2fa49be7f7c945b8b44e7c6edd18bfb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2fa49be7f7c945b8b44e7c6edd18bfb0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5893,7 +5899,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cccaeac856246448ed1b72ce6838061-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cccaeac856246448ed1b72ce6838061-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/120cf124bac744448d8ec7f591eb2573-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/120cf124bac744448d8ec7f591eb2573-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5911,7 +5917,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c040992370914b3294e6240159b2c460-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c040992370914b3294e6240159b2c460-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/218d5edab2964511af144c746da1bf6e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/218d5edab2964511af144c746da1bf6e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5929,7 +5935,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d2a97facd8c4351aee08a1435540897-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d2a97facd8c4351aee08a1435540897-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3b87857bacb463bad8ad04cf113e528-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3b87857bacb463bad8ad04cf113e528-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5947,7 +5953,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbd63c5a782e4b6b9098fba44cfae2d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbd63c5a782e4b6b9098fba44cfae2d2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f757ce08e094de0ad7310b329932b45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f757ce08e094de0ad7310b329932b45-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5965,7 +5971,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57403e48857d4c9da5c3bfe2f31eca22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57403e48857d4c9da5c3bfe2f31eca22-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/da28b82a903f4eafa946910a6e59ca22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da28b82a903f4eafa946910a6e59ca22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -5983,7 +5989,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9652d2c0b43d4ad5a4b22e4fdd275776-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9652d2c0b43d4ad5a4b22e4fdd275776-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3430a368ffc14e2c83363d1ea509cb25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3430a368ffc14e2c83363d1ea509cb25-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6001,7 +6007,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9dd3a224b5ce4af7a7c396ab0f4aa319-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9dd3a224b5ce4af7a7c396ab0f4aa319-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8db9836de4644293a35205eae6749412-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8db9836de4644293a35205eae6749412-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6019,7 +6025,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/874e32efe9704f779d14c1a371da40c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/874e32efe9704f779d14c1a371da40c7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/383138cd8f67416f959618e32d6cba86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/383138cd8f67416f959618e32d6cba86-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6037,7 +6043,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1a17d46bf6e45d8a09567159079da76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1a17d46bf6e45d8a09567159079da76-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73fb808863d54427b854eebb38d73356-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73fb808863d54427b854eebb38d73356-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6055,7 +6061,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c680e208e8be479aa2da2642822b8621-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c680e208e8be479aa2da2642822b8621-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e44bebcf45664abb97b42dad55f388e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e44bebcf45664abb97b42dad55f388e2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6073,7 +6079,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3519434bb6dc45fbbaca6ff3eadfa232-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3519434bb6dc45fbbaca6ff3eadfa232-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c63a993a3014b2d8b888c9040445921-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c63a993a3014b2d8b888c9040445921-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6091,7 +6097,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/856c8d0d2a484e7b8b5f82306613968f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/856c8d0d2a484e7b8b5f82306613968f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4125b3d53cfb4d5a802d972c8e1c9a6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4125b3d53cfb4d5a802d972c8e1c9a6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6109,7 +6115,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/747d515300bf44f49d16df8c13d8e3ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/747d515300bf44f49d16df8c13d8e3ef-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83eb3eb484eb4798bfebacd0e0171626-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83eb3eb484eb4798bfebacd0e0171626-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6121,13 +6127,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c76145ca2ed4afd8a89dbf7c01810b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c76145ca2ed4afd8a89dbf7c01810b6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0255a3dd062b4294a84c42a80439c638-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0255a3dd062b4294a84c42a80439c638-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6139,13 +6145,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3817b181dd94aef8f3612fed1d45014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3817b181dd94aef8f3612fed1d45014-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ea2f7af7a09432e8c40960baee19e5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ea2f7af7a09432e8c40960baee19e5f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6163,7 +6169,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c72e6f9f3b134bcabe8810fd2f9897bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c72e6f9f3b134bcabe8810fd2f9897bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/839fb5cf17124602b05276037b14e012-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/839fb5cf17124602b05276037b14e012-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6184,7 +6190,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b5dc08acc2549fd89ccb2859d3b6305-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b5dc08acc2549fd89ccb2859d3b6305-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a6bbd8f52464959ad0b58968d2cf9fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a6bbd8f52464959ad0b58968d2cf9fd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6206,7 +6212,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ce8418dc712498ca95467ec9749a8d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ce8418dc712498ca95467ec9749a8d6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa1ca97b785b472ab348e1269eafb6e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa1ca97b785b472ab348e1269eafb6e1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6255,7 +6261,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/857829e2af5745e98cd8d4ed4b246441-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/857829e2af5745e98cd8d4ed4b246441-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bdbff3d459547b8b3afc3f8079e67da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bdbff3d459547b8b3afc3f8079e67da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6277,7 +6283,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/20d3a1bee52d427a8d624505a68e9eea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20d3a1bee52d427a8d624505a68e9eea-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/248a9bcd11924fdc9db24ca739c061c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/248a9bcd11924fdc9db24ca739c061c4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6298,7 +6304,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/516fae332f444197ade9c4b360bb4747-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/516fae332f444197ade9c4b360bb4747-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d5072d1f7a24e238d3d8c5fa35da167-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d5072d1f7a24e238d3d8c5fa35da167-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6316,7 +6322,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84b1363e40024fe788bc8d48d1001073-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84b1363e40024fe788bc8d48d1001073-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9e25a7ae0ea8428eb0b1994e276451c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e25a7ae0ea8428eb0b1994e276451c7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6334,7 +6340,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b8e335ed20c4433b7450b0c1452727a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b8e335ed20c4433b7450b0c1452727a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db9e27a3e9364b3c927778d7bb894ff2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db9e27a3e9364b3c927778d7bb894ff2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6352,7 +6358,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6df50acc1fd745adbad2b215f6b7c646-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6df50acc1fd745adbad2b215f6b7c646-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d249245714b34fc4ad7ec1170108ba86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d249245714b34fc4ad7ec1170108ba86-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6370,7 +6376,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42cffa01dcbc4e00b8ab5e24a9de9e90-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42cffa01dcbc4e00b8ab5e24a9de9e90-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f470aacde37a4b5b862354f79377bbc8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f470aacde37a4b5b862354f79377bbc8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6388,7 +6394,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de8e8c86d49f4baf804842d0ebbb59ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de8e8c86d49f4baf804842d0ebbb59ff-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35be996e3a6e4f90a22ec36ccc72fed8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35be996e3a6e4f90a22ec36ccc72fed8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6406,7 +6412,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2459f079e39c4895ac0380c8ce393566-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2459f079e39c4895ac0380c8ce393566-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0b8448f5c2e4e27ae1e7f16d267fbd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0b8448f5c2e4e27ae1e7f16d267fbd1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6455,7 +6461,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2bebe270481c4214b12016fc53e646ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2bebe270481c4214b12016fc53e646ca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bd04244809fd49a2a28cd002d4db9f37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd04244809fd49a2a28cd002d4db9f37-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6504,7 +6510,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e3c83b09f74c4290ad0f8c00b0d5c621-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3c83b09f74c4290ad0f8c00b0d5c621-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fcc8a88061f94635a5f6b75c44c8bd94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fcc8a88061f94635a5f6b75c44c8bd94-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6553,7 +6559,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c1dd398141a4639b92825e9fd0205c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c1dd398141a4639b92825e9fd0205c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/595dd7bbfb794022b54192415e9d6eed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/595dd7bbfb794022b54192415e9d6eed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6571,7 +6577,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42334c2a9acf45e395f84b4f8efb915b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42334c2a9acf45e395f84b4f8efb915b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/97f7d5981cb640bba36c249d2c6de553-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97f7d5981cb640bba36c249d2c6de553-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6589,7 +6595,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/793ffa29f7364898928358804ce5a814-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/793ffa29f7364898928358804ce5a814-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/adccbb225aeb445c89bb41fa47c77c20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/adccbb225aeb445c89bb41fa47c77c20-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6607,7 +6613,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8cb180f6391145f18d429ad23aedb11a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8cb180f6391145f18d429ad23aedb11a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df3ca4f7901f4f53b597c2e30218b143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df3ca4f7901f4f53b597c2e30218b143-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6625,7 +6631,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c6e3b3b402a4f5e982a9f25c1e2e7c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c6e3b3b402a4f5e982a9f25c1e2e7c0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/213eae9c30144e77bf636f258cbb737c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/213eae9c30144e77bf636f258cbb737c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6643,7 +6649,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c67c7d2046b24d758cf51c2e606e08f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c67c7d2046b24d758cf51c2e606e08f3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9837b2513a184f4986fc37b1d796034c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9837b2513a184f4986fc37b1d796034c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6661,7 +6667,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ef3ae4386904dfbb02a7e6cd66773de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ef3ae4386904dfbb02a7e6cd66773de-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8dcbb730969459f8f8b31e4514db9b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8dcbb730969459f8f8b31e4514db9b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6679,7 +6685,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89279b05a696401f9b51c5037205eef8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89279b05a696401f9b51c5037205eef8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0163b02bafe7490ca11b087732f25126-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0163b02bafe7490ca11b087732f25126-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6728,7 +6734,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d138389f08694ddfbc43a93f9fa60e08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d138389f08694ddfbc43a93f9fa60e08-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9fca54bbf6ce4d37a1a9bb981aa974e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9fca54bbf6ce4d37a1a9bb981aa974e8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6746,7 +6752,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/008b2227c9c642e0bbd9a4f2ae946885-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/008b2227c9c642e0bbd9a4f2ae946885-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e28c89176424a69b6984e2f778346c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e28c89176424a69b6984e2f778346c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6764,7 +6770,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/883ef7558eea466797892a52453e6fc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/883ef7558eea466797892a52453e6fc2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a063202b9f24088b25827efb8620ae3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a063202b9f24088b25827efb8620ae3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6782,7 +6788,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/95318ae9f8994ffbbd21331c52266b92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/95318ae9f8994ffbbd21331c52266b92-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/04cf6fd3f33b495ea32c25938ed4c600-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04cf6fd3f33b495ea32c25938ed4c600-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6800,7 +6806,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ceaf18c900e848608e3f2655084c083e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ceaf18c900e848608e3f2655084c083e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed1b19a6a2f44845b71f92f227f75383-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed1b19a6a2f44845b71f92f227f75383-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6818,7 +6824,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b860fc88e6448738bbbf9e009d17688-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b860fc88e6448738bbbf9e009d17688-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54c49bd3d3a54ee580267c1003f18fd8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54c49bd3d3a54ee580267c1003f18fd8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6836,7 +6842,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9b431eefebba4a33a6267f2a2fb9e7e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b431eefebba4a33a6267f2a2fb9e7e5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6cf109282aab439cab224460d86a8ef3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6cf109282aab439cab224460d86a8ef3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6854,7 +6860,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c8a47bd01514da0af95f87442b8b1b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c8a47bd01514da0af95f87442b8b1b1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a511deef5e446a6b24de7375274bd1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a511deef5e446a6b24de7375274bd1e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6872,7 +6878,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/264e977342a44c148ff1d4f8bd9df71a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/264e977342a44c148ff1d4f8bd9df71a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d6e32bdeca8a4f3cb04febf5b2d78d91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6e32bdeca8a4f3cb04febf5b2d78d91-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6890,7 +6896,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5247407d61a24955ad8cff3c5f8e7789-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5247407d61a24955ad8cff3c5f8e7789-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a070b8aab0941d2a7d0a66eb2cf6a55-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a070b8aab0941d2a7d0a66eb2cf6a55-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6908,7 +6914,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/144cf395197a47cf9d47912d120c1b7b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/144cf395197a47cf9d47912d120c1b7b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a6ab4a9f37a4ec48a046d5e2507cd6b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a6ab4a9f37a4ec48a046d5e2507cd6b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6926,7 +6932,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d9d1fa9287dc4ea6ab17304278ee5b68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d9d1fa9287dc4ea6ab17304278ee5b68-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a4e35fb91b44cb0864a07d7355b7346-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a4e35fb91b44cb0864a07d7355b7346-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6944,7 +6950,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/868cef53c21d4b25acb8802964c30897-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/868cef53c21d4b25acb8802964c30897-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c8d30463339b4600b964e042333d6bda-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8d30463339b4600b964e042333d6bda-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6962,7 +6968,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/068eb76a7a9045c7b8ee01605c7f5592-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/068eb76a7a9045c7b8ee01605c7f5592-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce47e222bfe54cea9385935a86149fbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce47e222bfe54cea9385935a86149fbf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6980,7 +6986,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18c333b18574415fb3947668aa66e73c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18c333b18574415fb3947668aa66e73c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c2b70780d504231b00d4f274a74e042-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c2b70780d504231b00d4f274a74e042-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -6998,7 +7004,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2a77acab744e4c3f9b5ffb3317f738ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a77acab744e4c3f9b5ffb3317f738ea-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2cf88ad8f2a94634bebea0ef6e4f40a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cf88ad8f2a94634bebea0ef6e4f40a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7016,7 +7022,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4e2f40b06b5b43b8bbf9458d42d51618-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e2f40b06b5b43b8bbf9458d42d51618-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/25a8bf291f4043b099cd03c5c0108407-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/25a8bf291f4043b099cd03c5c0108407-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7034,7 +7040,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7783c62f5eb840f39f878d27ec0f7658-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7783c62f5eb840f39f878d27ec0f7658-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ebf08f98b9f246c1a173929531135597-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ebf08f98b9f246c1a173929531135597-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7052,7 +7058,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5405a54207b143deb27cad6bb55e000d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5405a54207b143deb27cad6bb55e000d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b5d2f206a8848f591ffdd036193dcc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b5d2f206a8848f591ffdd036193dcc3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7070,7 +7076,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efec6407926e438c919f73bbeca13685-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efec6407926e438c919f73bbeca13685-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/19c67bbe5d6a4d5c9fddc76cdd205c73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19c67bbe5d6a4d5c9fddc76cdd205c73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7088,7 +7094,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe5ca4cf00374b42bcd68d9ca0f4833a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe5ca4cf00374b42bcd68d9ca0f4833a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/42c687115e37425b819719b799beea36-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42c687115e37425b819719b799beea36-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7106,7 +7112,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/11c6841860564050ae571c155ac6b218-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11c6841860564050ae571c155ac6b218-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0671268529e14355875d15e11be7d4e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0671268529e14355875d15e11be7d4e9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7124,7 +7130,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/331d2d4b39cc42078be54d37e07d9146-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/331d2d4b39cc42078be54d37e07d9146-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/571de66453884c1abc3ade369e363ce0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/571de66453884c1abc3ade369e363ce0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7136,13 +7142,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe41bf81e39644db8d932ac55fc51675-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe41bf81e39644db8d932ac55fc51675-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1790cbae35f44a119c210fc8ef21bbe6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1790cbae35f44a119c210fc8ef21bbe6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7160,7 +7166,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8193ebbe7c934b2eb2baa8939e11ca4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8193ebbe7c934b2eb2baa8939e11ca4e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cffa24be67a24ea49639b8640e324db6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cffa24be67a24ea49639b8640e324db6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7178,7 +7184,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3bd98da988a4efdb814edace8cd7e61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3bd98da988a4efdb814edace8cd7e61-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c87a160dcb2b4a5f83d5882113458c35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c87a160dcb2b4a5f83d5882113458c35-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7190,13 +7196,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5889ac97c0924ec8901dae12be0d5ccb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5889ac97c0924ec8901dae12be0d5ccb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1684e29363194badb973ba685990d62c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1684e29363194badb973ba685990d62c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7217,7 +7223,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/daa115562993455b8cba33d17ec335ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/daa115562993455b8cba33d17ec335ae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b05cc7ab546426fb067d66c0f39d1cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b05cc7ab546426fb067d66c0f39d1cf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7265,7 +7271,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7916a405941e4d1ba1234f61ff313eb7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7916a405941e4d1ba1234f61ff313eb7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f10c81cfa8db4cdda2a1f516d3d2a46b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f10c81cfa8db4cdda2a1f516d3d2a46b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7283,7 +7289,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9df89ba4150d414dbf7f527bd0469411-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9df89ba4150d414dbf7f527bd0469411-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0221bbff9d84330b999993b1a4c5f88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0221bbff9d84330b999993b1a4c5f88-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7301,7 +7307,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/67b083dba5934c5d8ee065c89b860195-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67b083dba5934c5d8ee065c89b860195-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a7466c26247e4e7895786f1268f6b57f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7466c26247e4e7895786f1268f6b57f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7319,7 +7325,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3bbb8beb041448e7a87f84e68c205e0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3bbb8beb041448e7a87f84e68c205e0b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6b72ee5a12e49bf8ad8c421a5c26814-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6b72ee5a12e49bf8ad8c421a5c26814-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7337,7 +7343,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ad857d2809b491ba5d0a4255a5ef4e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ad857d2809b491ba5d0a4255a5ef4e9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efa2f9d4772043deab8c536acff1c382-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efa2f9d4772043deab8c536acff1c382-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7355,7 +7361,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73b0bfa203ae47fdb96e3542dabb1468-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73b0bfa203ae47fdb96e3542dabb1468-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5c8be55b5584bcbbbc0eb936bbb772e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5c8be55b5584bcbbbc0eb936bbb772e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7373,7 +7379,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f11ea90ddff43c6b10750b5b9bccfa8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f11ea90ddff43c6b10750b5b9bccfa8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/10df3d177eae41a796b8a9b4a1a48095-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10df3d177eae41a796b8a9b4a1a48095-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7391,7 +7397,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2584b0f4a5ff429f8f98dd15b1655b8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2584b0f4a5ff429f8f98dd15b1655b8b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f4f004638144f00b74302b8032f3c99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f4f004638144f00b74302b8032f3c99-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7409,7 +7415,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b27cf4f7fb3493da17e998a593bb3ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b27cf4f7fb3493da17e998a593bb3ad-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8db2eb3deeb4e0bacfc63d1396df28c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8db2eb3deeb4e0bacfc63d1396df28c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7427,7 +7433,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/604da1f36905491d824d40562b997831-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/604da1f36905491d824d40562b997831-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2be2901358941f4a1a0429189dd9604-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2be2901358941f4a1a0429189dd9604-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7445,7 +7451,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b659c6621cd41ec914fe5b430962369-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b659c6621cd41ec914fe5b430962369-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e45af2de208840ebb812bb67eb98c367-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e45af2de208840ebb812bb67eb98c367-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7463,7 +7469,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0cae2d20b7f47ad8c63f1028c9b0a85-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0cae2d20b7f47ad8c63f1028c9b0a85-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ea1889f4e424fc1a86f086243f1b724-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ea1889f4e424fc1a86f086243f1b724-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7481,7 +7487,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/74f769a4ace24b598b6a903573848b75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74f769a4ace24b598b6a903573848b75-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87bd872a4c934d6d8ad4811b700f079b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87bd872a4c934d6d8ad4811b700f079b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7499,7 +7505,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/631a6b8e68ab441ba6a9166364b53507-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/631a6b8e68ab441ba6a9166364b53507-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/85143d1a230747448ded2db126f73fc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85143d1a230747448ded2db126f73fc2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7517,7 +7523,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/068393705675408bb07cb24bc7c3d7f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/068393705675408bb07cb24bc7c3d7f2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71757896f9bf499782ce8bf9cbbf10da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71757896f9bf499782ce8bf9cbbf10da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7535,7 +7541,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6bf0d353ff6243beba1c2571547122f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bf0d353ff6243beba1c2571547122f6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73605d147fd14145bd1d0c8e1a051d47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73605d147fd14145bd1d0c8e1a051d47-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7553,7 +7559,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e90102ec7b084716b563ee0d9013ad9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e90102ec7b084716b563ee0d9013ad9c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f959fbcd15c448ee920a56fb274c255f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f959fbcd15c448ee920a56fb274c255f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7571,7 +7577,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a20769837ff94f85a4cd56371b10d97f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a20769837ff94f85a4cd56371b10d97f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ce167bb7c6fe414794996c86ff1a9cb5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce167bb7c6fe414794996c86ff1a9cb5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7589,7 +7595,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a056ae24d9c4556b8a8b0b33bf57335-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a056ae24d9c4556b8a8b0b33bf57335-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c72ab84e59e14fd9a4382967905fb38d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c72ab84e59e14fd9a4382967905fb38d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7607,7 +7613,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e422a14d08ad4333b5dc72abe08cd657-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e422a14d08ad4333b5dc72abe08cd657-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fcd5bd6e39ac490284c2dc7413b38d82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fcd5bd6e39ac490284c2dc7413b38d82-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7625,7 +7631,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34e493ec6cf043b0a51de90de3dd228e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34e493ec6cf043b0a51de90de3dd228e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d96080d4f3343a9b1af4b7f29bd94e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d96080d4f3343a9b1af4b7f29bd94e8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7643,7 +7649,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ff4d86f772fb49acb88ea0276657de8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff4d86f772fb49acb88ea0276657de8c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae7b1b0cfa82494cb2b504ca494a3262-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae7b1b0cfa82494cb2b504ca494a3262-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7661,7 +7667,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df419082c61d4a8fa29fc5eadd4813c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df419082c61d4a8fa29fc5eadd4813c7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03345cdefd2347ac9eb5336c243790f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03345cdefd2347ac9eb5336c243790f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7679,7 +7685,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/70ce75b587dc4d8d87f80d1c625825d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70ce75b587dc4d8d87f80d1c625825d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29532fe6e829482ca12d8a4e2b0d42f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29532fe6e829482ca12d8a4e2b0d42f9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7697,7 +7703,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb73d20aa1b6421187185e1ef9e2cfd4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb73d20aa1b6421187185e1ef9e2cfd4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92e7e6cf6bd84fbd9a0af0a26084d277-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92e7e6cf6bd84fbd9a0af0a26084d277-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7715,7 +7721,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53e9d3708c1248569096c199469bfeeb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53e9d3708c1248569096c199469bfeeb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93ffff9b0ea3466c9f186502366248a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93ffff9b0ea3466c9f186502366248a8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7733,7 +7739,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/599d8c8ca95b4142a85c7ef5e9731cc1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/599d8c8ca95b4142a85c7ef5e9731cc1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/305b8d981d784cd6b26599d4739631b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/305b8d981d784cd6b26599d4739631b6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7751,7 +7757,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5377615b12c446c9b2b17465633d221b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5377615b12c446c9b2b17465633d221b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e027727bf434edd9c68093b62e632c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e027727bf434edd9c68093b62e632c9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7769,7 +7775,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/001ff1ca15774c36b8d4e0223abce717-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/001ff1ca15774c36b8d4e0223abce717-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/150e5671671e4819a3012d72f3752e66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/150e5671671e4819a3012d72f3752e66-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7787,7 +7793,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df08c5c3e9aa48f68d69bf3e74ad530d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df08c5c3e9aa48f68d69bf3e74ad530d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cda753ce51434c8a90ecdd3b0c5ec041-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cda753ce51434c8a90ecdd3b0c5ec041-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7805,7 +7811,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ede84f62e9bb4801977f86c5b3356120-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ede84f62e9bb4801977f86c5b3356120-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b632c3d3a940434e944dbf6e109523e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b632c3d3a940434e944dbf6e109523e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7823,7 +7829,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f358b2d91084131bf9da3ed0546d3be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f358b2d91084131bf9da3ed0546d3be-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a23d1c4fe2ef440c8501c743b440366b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a23d1c4fe2ef440c8501c743b440366b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7841,7 +7847,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0e3e800c8ac24ec4add226c2231a8e88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e3e800c8ac24ec4add226c2231a8e88-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6c597bb46f01469cbc6cfb6a59f5de5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6c597bb46f01469cbc6cfb6a59f5de5e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7859,7 +7865,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d4ca70482dcc4bffab20739be9cab280-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4ca70482dcc4bffab20739be9cab280-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/133e1a2f77694bd0b8077201e3c61154-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/133e1a2f77694bd0b8077201e3c61154-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7877,7 +7883,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/786e1d5d2b2b4086a5a4a47007476f5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/786e1d5d2b2b4086a5a4a47007476f5f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca8a354b4d26409a992c68272e6ac4af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca8a354b4d26409a992c68272e6ac4af-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7895,7 +7901,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd6a4c30d3224c9498fb3648d326a978-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd6a4c30d3224c9498fb3648d326a978-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f43fbfa6182843ed87c7aff83de2fae0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f43fbfa6182843ed87c7aff83de2fae0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7913,7 +7919,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5c74b325dbd430f995ecda8eca7a0dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5c74b325dbd430f995ecda8eca7a0dd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8af14e41cae14119a4142829f82e0462-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8af14e41cae14119a4142829f82e0462-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7931,7 +7937,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a739bb1be2b4f378d0ed4d3db42fcf6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a739bb1be2b4f378d0ed4d3db42fcf6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/600d1553f5394e6fa1c322a62945bbc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/600d1553f5394e6fa1c322a62945bbc4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7949,7 +7955,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9f65e2ebb0c41ea87ee3025539bb211-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9f65e2ebb0c41ea87ee3025539bb211-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27b2c96a73f6444d979a36be7c6d6b51-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27b2c96a73f6444d979a36be7c6d6b51-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7967,7 +7973,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aa52be4e3b8d49c8b4d920def47aab72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa52be4e3b8d49c8b4d920def47aab72-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b186ecf2cc44545a995f8cc1ab05361-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b186ecf2cc44545a995f8cc1ab05361-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -7985,7 +7991,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3cee73616a3407ba1a989186705b0e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3cee73616a3407ba1a989186705b0e6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f6378d533aa54194b007959bb677ab0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6378d533aa54194b007959bb677ab0e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8003,7 +8009,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f440c106d2e49e285a6750a171fa36b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f440c106d2e49e285a6750a171fa36b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b64811920b3a49b3abda0b1cfe61bf69-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b64811920b3a49b3abda0b1cfe61bf69-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8021,7 +8027,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1a28cc596ab441aadd45ab6819fa302-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1a28cc596ab441aadd45ab6819fa302-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d74644b9dad482193c797c170ba5359-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d74644b9dad482193c797c170ba5359-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8039,7 +8045,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f65eba5abfb4893bb39f9df85721839-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f65eba5abfb4893bb39f9df85721839-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/735fc91cd75e4eb5b3277a2c4fcadf15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/735fc91cd75e4eb5b3277a2c4fcadf15-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8057,7 +8063,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d56ceab269894d1d9c3dd68c6f903e30-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d56ceab269894d1d9c3dd68c6f903e30-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3eca6bb94e7d4a8989ac9460aa3fc030-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3eca6bb94e7d4a8989ac9460aa3fc030-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8075,7 +8081,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53ace5d2b6224b6ab4656cd8558da263-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53ace5d2b6224b6ab4656cd8558da263-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72fd3b128fec499ea9611a0aa159edea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72fd3b128fec499ea9611a0aa159edea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8093,7 +8099,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e9c0267bb70490383824f16d2319528-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e9c0267bb70490383824f16d2319528-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1cbbeeaad4b4f1dbe03c46c4e9e767f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1cbbeeaad4b4f1dbe03c46c4e9e767f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8111,7 +8117,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3881cb96a0845ff89bc589578c836c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3881cb96a0845ff89bc589578c836c8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d720aa97f9db47528b49a995c1b223c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d720aa97f9db47528b49a995c1b223c1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8129,7 +8135,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6cf1ede6485444158270c2aa04f17bb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6cf1ede6485444158270c2aa04f17bb0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a6c5f904b5e4ec78240be0670a1c286-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a6c5f904b5e4ec78240be0670a1c286-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8147,7 +8153,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b68410beadf64fb7b63c2cad84f2a455-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b68410beadf64fb7b63c2cad84f2a455-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd5d39cd2b094cc989c61a8fa2767047-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd5d39cd2b094cc989c61a8fa2767047-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8165,7 +8171,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b7a4946c60f046719a8fcb1bbecfc94e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7a4946c60f046719a8fcb1bbecfc94e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/321f2edb826a45aa957024af90fa6b99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/321f2edb826a45aa957024af90fa6b99-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8183,7 +8189,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3fe1e147fb4418ba0421a5cd87f082e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3fe1e147fb4418ba0421a5cd87f082e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/397c86c544084d5bbca1c8400a7fc269-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/397c86c544084d5bbca1c8400a7fc269-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8201,7 +8207,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5d8365e7adc4d6f9c670419bc2d336f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5d8365e7adc4d6f9c670419bc2d336f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f5625d2f63a49ae9fb367db6deb603e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f5625d2f63a49ae9fb367db6deb603e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8219,7 +8225,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0a41f6c820546ccbd372929f3dd1d37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0a41f6c820546ccbd372929f3dd1d37-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3e66ef0273924d20b404b81d70075bc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e66ef0273924d20b404b81d70075bc4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8237,7 +8243,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a6bf98697d9846d386c661a4772c6e10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6bf98697d9846d386c661a4772c6e10-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8da08557d7e5487c9aca7a157c35979a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8da08557d7e5487c9aca7a157c35979a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8255,7 +8261,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d8e574aac0a43a49e629f5e65851855-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d8e574aac0a43a49e629f5e65851855-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aaca8c04e1da4daba1dee95d4c2cbb85-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaca8c04e1da4daba1dee95d4c2cbb85-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8273,7 +8279,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4dcf18cca8d142ff84dabd5e7658aee4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4dcf18cca8d142ff84dabd5e7658aee4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13a18c94bc94458d8a7306210341edbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13a18c94bc94458d8a7306210341edbf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8291,7 +8297,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9cf0bf80e3624f20a0bf310ff752661a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cf0bf80e3624f20a0bf310ff752661a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc9ec6945462413c9f398bf93225ac02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc9ec6945462413c9f398bf93225ac02-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8309,7 +8315,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de1b0117cd3a435782188040e41bd0dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de1b0117cd3a435782188040e41bd0dd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2de592727fad44249abd9ecb556d6ac5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2de592727fad44249abd9ecb556d6ac5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8327,7 +8333,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c6b9d262eda7431382a23f034fbbcf89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6b9d262eda7431382a23f034fbbcf89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc3508c09bf24e42b1f561bf32e2d43a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc3508c09bf24e42b1f561bf32e2d43a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8345,7 +8351,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eae86e0afc6e4cec9a01f160f80f3303-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eae86e0afc6e4cec9a01f160f80f3303-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/01aadeb334784120984e5992064022b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01aadeb334784120984e5992064022b7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8363,7 +8369,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ed1d875c53a24cf4a933d20511b15caa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed1d875c53a24cf4a933d20511b15caa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03f9d10901cb45eb82941d7f0db0f46d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03f9d10901cb45eb82941d7f0db0f46d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8381,7 +8387,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f04795142f174f2e9ac61ca399f672d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f04795142f174f2e9ac61ca399f672d4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb7483d8ed6b46a0b70d3e824b7d758d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb7483d8ed6b46a0b70d3e824b7d758d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8399,7 +8405,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b330f85ecc4f490eb8b785523f972ba8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b330f85ecc4f490eb8b785523f972ba8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6417136b367549caa24e3e5bb967ce37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6417136b367549caa24e3e5bb967ce37-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8417,7 +8423,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bee673bfffd047eebb98c75d7da71c2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bee673bfffd047eebb98c75d7da71c2c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27e4fe48c5544f3f9c63ec7d32bcc948-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27e4fe48c5544f3f9c63ec7d32bcc948-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8435,7 +8441,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/575f4d652c2f4f50bd3c406f5b4df376-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/575f4d652c2f4f50bd3c406f5b4df376-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29ebecf836d94b728e94157a9ab416ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29ebecf836d94b728e94157a9ab416ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8453,7 +8459,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0693762c18f44f37b55260083e71b57f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0693762c18f44f37b55260083e71b57f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29001d3e8b0946dc9dc1cac5db5c91a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29001d3e8b0946dc9dc1cac5db5c91a9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8471,7 +8477,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e374560f192f493fb993fe9b88b05e58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e374560f192f493fb993fe9b88b05e58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68c8e46f22d54500981d19ef3cd9553e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68c8e46f22d54500981d19ef3cd9553e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8489,7 +8495,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7190fb4413334df98bb27cf9d198951b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7190fb4413334df98bb27cf9d198951b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1b34737f65745bfa0bd6c780f08598e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1b34737f65745bfa0bd6c780f08598e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8507,7 +8513,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bba0d663e17f4a66bb30f5a7e8a793fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bba0d663e17f4a66bb30f5a7e8a793fe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7044dd482c4a4830ade7455cd67a4c22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7044dd482c4a4830ade7455cd67a4c22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8525,7 +8531,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0290337d1b36497ab4503e27d8418bbe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0290337d1b36497ab4503e27d8418bbe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5a8b7bbab1e24a72803046c38b805a58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5a8b7bbab1e24a72803046c38b805a58-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8545,7 +8551,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1f790bee32f74ed2b0a643c9e0bd4ec7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f790bee32f74ed2b0a643c9e0bd4ec7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92cfa2b5d04b4510868930ab82b4f359-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92cfa2b5d04b4510868930ab82b4f359-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8566,7 +8572,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b4a9f5ae9b444a5381fa1fbcc811f846-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4a9f5ae9b444a5381fa1fbcc811f846-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3a42779ed7ff43999cb84e44d891acd6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a42779ed7ff43999cb84e44d891acd6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8587,7 +8593,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b0cacf046aec43d1851c6bb323bd022e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0cacf046aec43d1851c6bb323bd022e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2058867de18c421dbb0e61e44d489bc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2058867de18c421dbb0e61e44d489bc4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8608,7 +8614,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc0358ebeb574126b8bdd75fc2cc0256-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc0358ebeb574126b8bdd75fc2cc0256-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/919b906c087f454fb1b15767ff654575-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/919b906c087f454fb1b15767ff654575-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8629,7 +8635,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a315c3d8fb7c4d5987a7de6736e1c8ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a315c3d8fb7c4d5987a7de6736e1c8ea-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf0e250d1c1b406d91aa3ece32581a2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf0e250d1c1b406d91aa3ece32581a2b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8650,7 +8656,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c03f91f0ef4c4c6c831bc5b7f51847a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c03f91f0ef4c4c6c831bc5b7f51847a4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d570ce2055d4fb8bb22bf9a6c5b787b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d570ce2055d4fb8bb22bf9a6c5b787b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8671,7 +8677,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/19035d7db5cf4d8eb79b7e487c8baa89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19035d7db5cf4d8eb79b7e487c8baa89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3bc9327a85d14e5ca5f5ad19e623edf7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3bc9327a85d14e5ca5f5ad19e623edf7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8692,7 +8698,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/316e50c2990d47bd81a19060bec53eb8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/316e50c2990d47bd81a19060bec53eb8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e90dfbabbff14854a425692a6c911805-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e90dfbabbff14854a425692a6c911805-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8714,7 +8720,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b1a66ed112d4d31ae4a05f5ae034523-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b1a66ed112d4d31ae4a05f5ae034523-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5e631bf0c58a429ea1974c96b322fb52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e631bf0c58a429ea1974c96b322fb52-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8736,7 +8742,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1193145eab734b85967586cef3e1af48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1193145eab734b85967586cef3e1af48-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f5cdea6e38441b5b18147103be16fec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f5cdea6e38441b5b18147103be16fec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8754,7 +8760,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d73ecc606ab0460ab73bef917643c73c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d73ecc606ab0460ab73bef917643c73c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c8934efd71c497285781ae9f6e92b0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c8934efd71c497285781ae9f6e92b0d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8772,7 +8778,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b6a7c0a76364d3897908367ac7149c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b6a7c0a76364d3897908367ac7149c7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f4421e03824e41c983e357e365f5925d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4421e03824e41c983e357e365f5925d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8790,7 +8796,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/953d580217e04a3390892cbef139b365-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/953d580217e04a3390892cbef139b365-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/897a5c4317b54a9287dfbab8aa35f58a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/897a5c4317b54a9287dfbab8aa35f58a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8808,7 +8814,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/785afe73308045fab0a417ff9bcbcf5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/785afe73308045fab0a417ff9bcbcf5b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4fbb277cc7c24b19913390082cb5ad02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fbb277cc7c24b19913390082cb5ad02-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8826,7 +8832,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/296119015c1a448bb32aea4fe0c3d9fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/296119015c1a448bb32aea4fe0c3d9fa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9461b5af79247eaaab0351b698443e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9461b5af79247eaaab0351b698443e5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8847,7 +8853,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad27fbaa633741769f897adaf8e5ef37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad27fbaa633741769f897adaf8e5ef37-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f66a47b02bd6412ca02211a64eb2cb36-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f66a47b02bd6412ca02211a64eb2cb36-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8896,7 +8902,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b56caca810c241199fb2f30c780cfd89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b56caca810c241199fb2f30c780cfd89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38ea321d41c74edaa100416184b2fbad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38ea321d41c74edaa100416184b2fbad-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8935,7 +8941,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b3f3200c41743c19ba76a5e1b198904-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b3f3200c41743c19ba76a5e1b198904-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75791f699109455e9d8dce3255b9be07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75791f699109455e9d8dce3255b9be07-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -8984,7 +8990,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/336aaff5540344e8a1220399cd5f614e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/336aaff5540344e8a1220399cd5f614e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ad6ade40a9a4250ac82b1dd4b0125ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ad6ade40a9a4250ac82b1dd4b0125ab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9005,7 +9011,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af6bafd753d44a57980a20ed12835f9e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af6bafd753d44a57980a20ed12835f9e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8ada32778c7455f97d332f29ee24edc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8ada32778c7455f97d332f29ee24edc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9027,7 +9033,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/26c0662106c24bd2a604761442ccaee9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26c0662106c24bd2a604761442ccaee9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8beb80b5e82d4300a9efcec9d5140c1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8beb80b5e82d4300a9efcec9d5140c1a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9049,7 +9055,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/789b26e615b949e3b3710b047dd18fed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/789b26e615b949e3b3710b047dd18fed-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d4eaa4ca40a44ea9cbfe31e5f85f0bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d4eaa4ca40a44ea9cbfe31e5f85f0bd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9065,13 +9071,13 @@ "1 infeasibilities\n", "Problem is infeasible!\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5179e761f32c4c7e9a063499fe5a47ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5179e761f32c4c7e9a063499fe5a47ce-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee049c9162a44259a09f3e5a26761ed0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee049c9162a44259a09f3e5a26761ed0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9089,7 +9095,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e8200b3c767543309d676dbb6611a58d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8200b3c767543309d676dbb6611a58d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f89bc8b90a5a484b87f92d0ba1000cca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f89bc8b90a5a484b87f92d0ba1000cca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9107,7 +9113,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c458f0e6aa9f4d4aa924f4176f9b2fcf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c458f0e6aa9f4d4aa924f4176f9b2fcf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/317ead829dd743248e01e1318ee95798-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/317ead829dd743248e01e1318ee95798-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9125,7 +9131,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/41a4d753706d46c2b19f6100fa0fdcaf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41a4d753706d46c2b19f6100fa0fdcaf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c4ba6b1aa30b4bbe82f248584d81e2b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4ba6b1aa30b4bbe82f248584d81e2b1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9143,7 +9149,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44dbc259d79d48b993c3113b5658f16f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44dbc259d79d48b993c3113b5658f16f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbdac92a20204c1892c13b1990572d72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbdac92a20204c1892c13b1990572d72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9161,7 +9167,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/63f820d185bc495f8f61aca1b9e42e88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63f820d185bc495f8f61aca1b9e42e88-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eca9950de6294ad99a097a016fffebbd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eca9950de6294ad99a097a016fffebbd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9182,7 +9188,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bf7bdfb07f264698a4e4a6d494cd104f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf7bdfb07f264698a4e4a6d494cd104f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b291849630b94bbf92534da4050412e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b291849630b94bbf92534da4050412e9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9231,7 +9237,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1efa14528ab453b9b114ac90ab6c20d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1efa14528ab453b9b114ac90ab6c20d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5bf4f1d8405483c80a8ad7be6b82d6c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5bf4f1d8405483c80a8ad7be6b82d6c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9280,7 +9286,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/929475798e76482581a82a07af23ea71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/929475798e76482581a82a07af23ea71-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/51c07d0cc3344332929272db64e22ef1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/51c07d0cc3344332929272db64e22ef1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9301,7 +9307,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/590c03333ab84587ba6506c3c9b11027-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/590c03333ab84587ba6506c3c9b11027-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46cdbcc203c54dff8e46fe8f40bee877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46cdbcc203c54dff8e46fe8f40bee877-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9323,7 +9329,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6cf35706a6ff4261b0a349bb86c5d30e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6cf35706a6ff4261b0a349bb86c5d30e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a28d427b88f344df94537521ad221d1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a28d427b88f344df94537521ad221d1f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9344,7 +9350,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b229cf9164ab4765bd1a7d46cd7fbf82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b229cf9164ab4765bd1a7d46cd7fbf82-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/879e09a2706d4ec1be9f6eefe1ba285c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/879e09a2706d4ec1be9f6eefe1ba285c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9362,7 +9368,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eb57e2b6d38a4279bd5247086a9cb1b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb57e2b6d38a4279bd5247086a9cb1b1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f28f6e70678c4355b2d8d64e259cc0c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f28f6e70678c4355b2d8d64e259cc0c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9380,7 +9386,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c63a0b4376a4baaa65b8fcb512e2280-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c63a0b4376a4baaa65b8fcb512e2280-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/009af0042c1347098f64e44e386c27b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/009af0042c1347098f64e44e386c27b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9398,7 +9404,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e81108ee789a45f7bd1c7516e96fc1a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e81108ee789a45f7bd1c7516e96fc1a9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75f016aea8974e368d7936b65129cb3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75f016aea8974e368d7936b65129cb3d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9416,7 +9422,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/053ba3cb46f34ad5a4586e68cc7e79de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/053ba3cb46f34ad5a4586e68cc7e79de-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f194252e3ca44dea95205d6489bb39c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f194252e3ca44dea95205d6489bb39c3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9434,7 +9440,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/76fb5228ff2c41b987e1bff114b18a5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/76fb5228ff2c41b987e1bff114b18a5a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/026028fbbf93439888135cdb33115d09-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/026028fbbf93439888135cdb33115d09-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9452,7 +9458,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ace1596444344c2a4bddf72e30b0f14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ace1596444344c2a4bddf72e30b0f14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44673adfdf7946078836c195be19f5ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44673adfdf7946078836c195be19f5ac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9473,7 +9479,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7102e691812746e8a4dab6b61a24f0f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7102e691812746e8a4dab6b61a24f0f9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a03455c1a6d41499f9fd484a706fa73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a03455c1a6d41499f9fd484a706fa73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9521,7 +9527,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/50d51d5ffd714aed95293fe34a71d981-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50d51d5ffd714aed95293fe34a71d981-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/064f0570051e488b8db24dbca7a5ece6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/064f0570051e488b8db24dbca7a5ece6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9569,7 +9575,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38f531df576b4ae1b8a90ca7dd754024-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38f531df576b4ae1b8a90ca7dd754024-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9e9dd2b026ee45f2aec3d479dba35829-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e9dd2b026ee45f2aec3d479dba35829-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9616,7 +9622,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f8330eb2d504342857ffd7b3444b8ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f8330eb2d504342857ffd7b3444b8ab-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9eabaa3d150846d1a562d7b25f03688d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9eabaa3d150846d1a562d7b25f03688d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9634,7 +9640,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/63d08ab3bba147a894da6ba0f6706397-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63d08ab3bba147a894da6ba0f6706397-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/898aabf35af64125a44fcd9aee8ad12a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/898aabf35af64125a44fcd9aee8ad12a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9652,7 +9658,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5458d7ca8b0646f49cb83d14a943acf8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5458d7ca8b0646f49cb83d14a943acf8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be086ddccaa64d5688ac03ba9ddbd408-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be086ddccaa64d5688ac03ba9ddbd408-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9670,7 +9676,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4749b7dd13f64efc828feea540d6f80b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4749b7dd13f64efc828feea540d6f80b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13f6174540914b17b3913ac11097cb41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13f6174540914b17b3913ac11097cb41-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9688,7 +9694,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b959582504f94d2992bf09143a1b4e1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b959582504f94d2992bf09143a1b4e1e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80553692b72443af95b296f294033c47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80553692b72443af95b296f294033c47-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9706,7 +9712,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/37863a3886434c44bc239e55536a448d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/37863a3886434c44bc239e55536a448d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/56f145154d9a4ecf87ddf53ec62ee785-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56f145154d9a4ecf87ddf53ec62ee785-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9724,7 +9730,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d640f190786348e69a4b35fcf44e9440-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d640f190786348e69a4b35fcf44e9440-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4638a11c8d4945d7821285a89fd0c4d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4638a11c8d4945d7821285a89fd0c4d7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9745,7 +9751,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c80f496c39f64f7ba70a181a5fe22467-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c80f496c39f64f7ba70a181a5fe22467-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c26cbd3e56a5458cb8f6cefe3e018047-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c26cbd3e56a5458cb8f6cefe3e018047-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9792,7 +9798,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf97c43a758d47399b40e65bcb2a4f82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf97c43a758d47399b40e65bcb2a4f82-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1e92b3bb266414ab06380fdb7f181ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1e92b3bb266414ab06380fdb7f181ca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9810,7 +9816,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e065f2e630474ec6ad420c79b5d67f3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e065f2e630474ec6ad420c79b5d67f3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a57bf177ac294ed8be1bf0bf76e3b122-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a57bf177ac294ed8be1bf0bf76e3b122-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9828,7 +9834,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7bdd1ae3fecf452284deded6c739a662-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bdd1ae3fecf452284deded6c739a662-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d077e482693f4f41b0727745369f974f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d077e482693f4f41b0727745369f974f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9846,7 +9852,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00ed44d0105046a69f87b820a65f632c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00ed44d0105046a69f87b820a65f632c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b013912e802843a296dd9c5fc9eaeb7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b013912e802843a296dd9c5fc9eaeb7c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9864,7 +9870,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33c55eed72f243acab35dd34f68754e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33c55eed72f243acab35dd34f68754e9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b3044427ab64a658cdcb7722d7fcb02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b3044427ab64a658cdcb7722d7fcb02-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9882,7 +9888,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d871a0cfe7e148dbbf5eb56daad821d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d871a0cfe7e148dbbf5eb56daad821d2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae2c4b8adcf946bf90acce5ab456cb3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae2c4b8adcf946bf90acce5ab456cb3f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9900,7 +9906,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fce9bd557e2b47f8a22207c00f1b56e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fce9bd557e2b47f8a22207c00f1b56e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fcb061eae95c49a1be01361bb5369be2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fcb061eae95c49a1be01361bb5369be2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9918,7 +9924,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bad68e5d6cea4d9f8d2bb775ccf83d89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bad68e5d6cea4d9f8d2bb775ccf83d89-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9dae0da3b9804a2aabc764885f627a7e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9dae0da3b9804a2aabc764885f627a7e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9936,7 +9942,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4f1dc002a508429abc5724eadeb9ffbc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f1dc002a508429abc5724eadeb9ffbc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ac08b12d981430ca9ebecba450c3c5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ac08b12d981430ca9ebecba450c3c5b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9954,7 +9960,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c20f5f4da351408aadf8e0dbbb96e8a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c20f5f4da351408aadf8e0dbbb96e8a1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a34da75f95fa4c52baa8658c4335543e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a34da75f95fa4c52baa8658c4335543e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9972,7 +9978,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c7e4509ef47e4c0ab60607e9512e39ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c7e4509ef47e4c0ab60607e9512e39ac-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c461d0b3fbcc4d758047920e1c372a67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c461d0b3fbcc4d758047920e1c372a67-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -9990,7 +9996,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe8df827e8c245569ac4e8bbbfb289b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe8df827e8c245569ac4e8bbbfb289b4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d5e745ff5b5f44c9b9867c96aefa4c1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5e745ff5b5f44c9b9867c96aefa4c1d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10008,7 +10014,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/39a22a42283d43b3a601ac28455395ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39a22a42283d43b3a601ac28455395ec-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3b96a43e7c1d451d8b04af043267b05a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b96a43e7c1d451d8b04af043267b05a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10026,7 +10032,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5e7cfd9126cf498f925dcea00d210caa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e7cfd9126cf498f925dcea00d210caa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eb8dcce44055465c8aa5ee55c252da3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb8dcce44055465c8aa5ee55c252da3e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10044,7 +10050,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ec8592079694d70b766fd7766dbc46a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ec8592079694d70b766fd7766dbc46a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/750b750ed2e64897a95d47d4c13197f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/750b750ed2e64897a95d47d4c13197f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10062,7 +10068,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13886f7a38354924a3acb573177c593d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13886f7a38354924a3acb573177c593d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c121f19bdee41fda771f2aa5148d509-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c121f19bdee41fda771f2aa5148d509-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10080,7 +10086,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f69df01eeecf46e7bb9a214b853d3477-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f69df01eeecf46e7bb9a214b853d3477-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2dc7de49f4a4f018fe30a5d6b305aa3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2dc7de49f4a4f018fe30a5d6b305aa3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10098,7 +10104,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6310211eda584b45be1606444fe0c30b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6310211eda584b45be1606444fe0c30b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c0eaf80bf76b488a887a126251503eaf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0eaf80bf76b488a887a126251503eaf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10116,7 +10122,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eaa5658c8acd4c288286efb1b18424bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eaa5658c8acd4c288286efb1b18424bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4029193ba8bb43838a96bf4a45360143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4029193ba8bb43838a96bf4a45360143-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10134,7 +10140,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a77ae989939414f9fd0e626fff06628-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a77ae989939414f9fd0e626fff06628-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ec32ecf58ed54afc947948b893fed16f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec32ecf58ed54afc947948b893fed16f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10152,7 +10158,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8c5e522904d4a65bfc80927ebd51b95-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8c5e522904d4a65bfc80927ebd51b95-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/19889df5df4443709666a418070c1ce6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19889df5df4443709666a418070c1ce6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10170,7 +10176,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5eccc82c532d41e8ae4d35e1bf24b2ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5eccc82c532d41e8ae4d35e1bf24b2ab-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9cfc6272c9ca4ae88aaf58a1cf5deec2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cfc6272c9ca4ae88aaf58a1cf5deec2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10188,7 +10194,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ab85ac4668d4ed0a987fdb6042e9c8e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ab85ac4668d4ed0a987fdb6042e9c8e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a5071f4df3a42328f9733f24b9622e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a5071f4df3a42328f9733f24b9622e6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10206,7 +10212,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b6717053e7349e38740f3b01dbd698d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b6717053e7349e38740f3b01dbd698d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c7168d1aa24143a59db0ccf4dc0582c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c7168d1aa24143a59db0ccf4dc0582c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10224,7 +10230,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de3ccc3be3394acbbd41bf74d1c8a1fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de3ccc3be3394acbbd41bf74d1c8a1fd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87974044d68441b78f1389b9674c40d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87974044d68441b78f1389b9674c40d1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10242,7 +10248,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f47cf82dc0bf4dc89845925d29b8d2d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f47cf82dc0bf4dc89845925d29b8d2d1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/551fb477a0ee41d2b452cbca2130c92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/551fb477a0ee41d2b452cbca2130c92d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10260,7 +10266,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b06877bd4a5487b94cb5c7c9e629dd9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b06877bd4a5487b94cb5c7c9e629dd9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ebbd56a30e6e4164b08cd1ef33cfdf97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ebbd56a30e6e4164b08cd1ef33cfdf97-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10278,7 +10284,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ec5ae3193ba4403e98b43fdc3113d7fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec5ae3193ba4403e98b43fdc3113d7fa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1166aee239148f7af71df3ef27b8515-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1166aee239148f7af71df3ef27b8515-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10296,7 +10302,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/682188237ccd4cfa996af549a071e41f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/682188237ccd4cfa996af549a071e41f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a0440d9155d48ee97ff6770c228935c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a0440d9155d48ee97ff6770c228935c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10317,7 +10323,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8729b5ebbfbd4ac1aca03f09709bc852-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8729b5ebbfbd4ac1aca03f09709bc852-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc9233d5902a4aa88136c260bf9c6fc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc9233d5902a4aa88136c260bf9c6fc9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10366,7 +10372,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd42d3b290504592aea1154d8c42c0f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd42d3b290504592aea1154d8c42c0f0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00a58ca67d754cdd88929624dd92282d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00a58ca67d754cdd88929624dd92282d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10415,7 +10421,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eafdde4f4e814273ad0219ca5b22b98a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eafdde4f4e814273ad0219ca5b22b98a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/743adb2f4be24b05b1c455863e498930-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/743adb2f4be24b05b1c455863e498930-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10464,7 +10470,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7368fef02d504858b861bdc7f1674a91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7368fef02d504858b861bdc7f1674a91-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/41d3e4db4ca7446bb5a8d9d45214cd74-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41d3e4db4ca7446bb5a8d9d45214cd74-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10486,7 +10492,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/63c2243449f84b6c9c50c8effdc4b35e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63c2243449f84b6c9c50c8effdc4b35e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee2b602f311d4a8198cece5f390ed647-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee2b602f311d4a8198cece5f390ed647-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10508,7 +10514,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f12c6fc4c4a4ad8902442666f33c75a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f12c6fc4c4a4ad8902442666f33c75a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e28de0ca8cfb4d16b53d1f96201c107e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e28de0ca8cfb4d16b53d1f96201c107e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10529,7 +10535,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc6206f3ce9f402a961060a835bbc012-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc6206f3ce9f402a961060a835bbc012-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b279a0024df4a4eb04d1e2280cb9d3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b279a0024df4a4eb04d1e2280cb9d3f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10547,7 +10553,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e83349b8984a475f89347f4f48749002-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e83349b8984a475f89347f4f48749002-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/236e6876c02841aca728c4d9c1a9b784-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/236e6876c02841aca728c4d9c1a9b784-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10565,7 +10571,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d1b505662a942459fb4cb52fd9ea337-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d1b505662a942459fb4cb52fd9ea337-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f98e07d9607642619f6bdc1fc139ce22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f98e07d9607642619f6bdc1fc139ce22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10583,7 +10589,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/14201552e7c840dfb91ba583eafd8bcf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14201552e7c840dfb91ba583eafd8bcf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f1d00368b4f4975a63f57278a901f14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f1d00368b4f4975a63f57278a901f14-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10601,7 +10607,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbffb92c6edd43638f71c999eb46e456-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbffb92c6edd43638f71c999eb46e456-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c89a374af5f2484fa901128c2a359046-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c89a374af5f2484fa901128c2a359046-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10619,7 +10625,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/152208c7d632474e8391ee7f7f7a4a20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/152208c7d632474e8391ee7f7f7a4a20-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73c619e2316947e5900b791d5935c7ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73c619e2316947e5900b791d5935c7ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10637,7 +10643,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de645ba6b8584511b12e708381a4efc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de645ba6b8584511b12e708381a4efc7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba1c966a73ff4e7c8591c4eaaa5a74ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba1c966a73ff4e7c8591c4eaaa5a74ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10686,7 +10692,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea87a1fc067f4242b473f03ff6f55950-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea87a1fc067f4242b473f03ff6f55950-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2dd7b1f6d93a4608891b0ee634f30aea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2dd7b1f6d93a4608891b0ee634f30aea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10709,7 +10715,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5065932932649ae864f62f089ecee05-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5065932932649ae864f62f089ecee05-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b4732c05a1d4647a15af8b3357ee2d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b4732c05a1d4647a15af8b3357ee2d9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10732,7 +10738,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ed3f4354b744d2c857052984667a28a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ed3f4354b744d2c857052984667a28a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4fc2aceaf39a48798a9bd96c89fbb9f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fc2aceaf39a48798a9bd96c89fbb9f5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10754,7 +10760,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9723de263bb74b91831b847580d55312-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9723de263bb74b91831b847580d55312-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/12d91fb80cc645ae9097075f9769245b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12d91fb80cc645ae9097075f9769245b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10775,7 +10781,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d042a712a90c4e1f9c1b5a449aaefbc0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d042a712a90c4e1f9c1b5a449aaefbc0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea7747629a3a4e7ea788b0f4fb58e3a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea7747629a3a4e7ea788b0f4fb58e3a3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10793,7 +10799,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/975184ffbf7c4fbdb19515959e6c7b44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/975184ffbf7c4fbdb19515959e6c7b44-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6411815919e48e49468bedfce94f8f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6411815919e48e49468bedfce94f8f0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10811,7 +10817,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/48a50d9148674fc19013aa1169ed21bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48a50d9148674fc19013aa1169ed21bc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7fe02699d2d54dcdbfdf6e775ceabbeb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7fe02699d2d54dcdbfdf6e775ceabbeb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10829,7 +10835,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c0d424ba5c6c4f75a37b8c6efd82959f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0d424ba5c6c4f75a37b8c6efd82959f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f112281765f54d8cab88df9d9d0d654e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f112281765f54d8cab88df9d9d0d654e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10847,7 +10853,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d16f56a09114fbfb9eea3576edd8f2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d16f56a09114fbfb9eea3576edd8f2b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0fff35eaca34321b46e43216b29badb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0fff35eaca34321b46e43216b29badb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10865,7 +10871,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f27bd49c0484444798ca349c9103afdb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f27bd49c0484444798ca349c9103afdb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c47fc69ca2214bb18f6460c3157658fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c47fc69ca2214bb18f6460c3157658fa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10883,7 +10889,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18c997e5bcb4436680f9e2d836d3d103-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18c997e5bcb4436680f9e2d836d3d103-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/859849b2103d44f9b3e9754935d2e13a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/859849b2103d44f9b3e9754935d2e13a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10932,7 +10938,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1a9aac7276da4b6a9cb7ef77bec18def-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a9aac7276da4b6a9cb7ef77bec18def-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d8bcfabb76584b119cb6f4f66fd60372-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8bcfabb76584b119cb6f4f66fd60372-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -10981,7 +10987,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/716b0519773f4b7787a73f1870ed258e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/716b0519773f4b7787a73f1870ed258e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72c9d4eaae104eb6b88af35bb96a700e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72c9d4eaae104eb6b88af35bb96a700e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11029,7 +11035,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d5bf37295910451fbcc65682f33d3754-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5bf37295910451fbcc65682f33d3754-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8310befed33e4dee9000e34bddaeed08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8310befed33e4dee9000e34bddaeed08-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11047,7 +11053,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9e66a8a7ba3400ba8918bdc8573409a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9e66a8a7ba3400ba8918bdc8573409a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4555c61a2d264a8e88d9aa0b6ecd711f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4555c61a2d264a8e88d9aa0b6ecd711f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11065,7 +11071,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fdb8665ec5004df29cc7d9e98e467ecc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdb8665ec5004df29cc7d9e98e467ecc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7009dc68041743b1a5b7eaaa108766ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7009dc68041743b1a5b7eaaa108766ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11083,7 +11089,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef454b9260044b33a344ee8abb50afe4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef454b9260044b33a344ee8abb50afe4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0e1b401493294a88bb4dd731203ec44b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e1b401493294a88bb4dd731203ec44b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11101,7 +11107,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f9c358012a74bb3afa0fc6a8097cfcf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f9c358012a74bb3afa0fc6a8097cfcf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2d67590dcc5417aab66edbc1b5bf0ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2d67590dcc5417aab66edbc1b5bf0ce-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11119,7 +11125,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef02db4966be4fd1ad33d30d8e264759-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef02db4966be4fd1ad33d30d8e264759-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f91ff276f992445d93d53725efba3da6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f91ff276f992445d93d53725efba3da6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11137,7 +11143,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f34769e12be4bd084474d6e28547e7b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f34769e12be4bd084474d6e28547e7b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2d25afc8c82045b3abd98cb97bbb554b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d25afc8c82045b3abd98cb97bbb554b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11155,7 +11161,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/876589a672ef4fb6943983ce7e99c59a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/876589a672ef4fb6943983ce7e99c59a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ec7278b60f7a4b84974404fbdc253926-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec7278b60f7a4b84974404fbdc253926-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11204,7 +11210,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5078348e0fb4960884b6333cd7ae36f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5078348e0fb4960884b6333cd7ae36f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f2c09d8abcf4402f88d9b2b1795d6b67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f2c09d8abcf4402f88d9b2b1795d6b67-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11222,7 +11228,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef8082b835a94a72a00e15081418444d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef8082b835a94a72a00e15081418444d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/12802603548a4deeafd64440216da320-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12802603548a4deeafd64440216da320-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11240,7 +11246,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0523a70a74104ce28d5b21d3a4d5ca63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0523a70a74104ce28d5b21d3a4d5ca63-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77e042546d9f4acc80bbe0ffd4307b45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77e042546d9f4acc80bbe0ffd4307b45-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11258,7 +11264,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33524d9119d24326ae2d15790a578751-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33524d9119d24326ae2d15790a578751-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2d45f0dacbcb49d394006817ae7a1dff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d45f0dacbcb49d394006817ae7a1dff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11276,7 +11282,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30735db5cdc744dd95f36a2b49280433-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30735db5cdc744dd95f36a2b49280433-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c16395f9d2004eeeac600e96fe4d9ebb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c16395f9d2004eeeac600e96fe4d9ebb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11294,7 +11300,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9574fbfd8e494e5693cdfe03d1fdb583-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9574fbfd8e494e5693cdfe03d1fdb583-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18f5ecadd14d4759a0e709f325547a3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18f5ecadd14d4759a0e709f325547a3b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11312,7 +11318,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a2dc80ebc1904bd1a2c181d561140835-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2dc80ebc1904bd1a2c181d561140835-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ac97b6c2d7ca48349504d656ee6430a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac97b6c2d7ca48349504d656ee6430a3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11330,7 +11336,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b641bf5771e946ecb616c27d9799d0e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b641bf5771e946ecb616c27d9799d0e2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e72bc657ba734ea29328cfc28ccdf4bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e72bc657ba734ea29328cfc28ccdf4bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11348,7 +11354,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1db750f8857d4f8fbe411e25bf142df9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1db750f8857d4f8fbe411e25bf142df9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/35fd258e1c0d4a5d86dc2c2d3e549a2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35fd258e1c0d4a5d86dc2c2d3e549a2e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11366,7 +11372,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84c59afc21104cb0a5075fc031d58788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84c59afc21104cb0a5075fc031d58788-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a49bad8a8f8a4c6cbb11ae1d9a053d00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a49bad8a8f8a4c6cbb11ae1d9a053d00-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11384,7 +11390,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efea0361546549c5a1cd4c37d6447c03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efea0361546549c5a1cd4c37d6447c03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00bccbcf104744728b6ff64cbecf3f73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00bccbcf104744728b6ff64cbecf3f73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11402,7 +11408,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cfec16e283504029a80ad7f176da52d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cfec16e283504029a80ad7f176da52d6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3dfb2a96f874ac1bf0eb90e87f448d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3dfb2a96f874ac1bf0eb90e87f448d1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11420,7 +11426,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80541171ed45477fbbd156690dbaed4f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80541171ed45477fbbd156690dbaed4f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93d5fcb4e2b24f72b2fa2680426068ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93d5fcb4e2b24f72b2fa2680426068ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11438,7 +11444,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4d47ff7d250340d39c75164cd72eb143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d47ff7d250340d39c75164cd72eb143-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54973a2e21c7497ea40d2cca9d2bb143-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54973a2e21c7497ea40d2cca9d2bb143-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11456,7 +11462,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b16a538014946649fa28bb7af57e650-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b16a538014946649fa28bb7af57e650-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9359be6fc60e4f20b70aecc2d4f194cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9359be6fc60e4f20b70aecc2d4f194cb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11474,7 +11480,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/caef72c53c9a439d83c92a23f344a8b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/caef72c53c9a439d83c92a23f344a8b4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59cacf57df4f4c44974725df759fc6fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59cacf57df4f4c44974725df759fc6fd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11492,7 +11498,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bedd473426a744bd9cc50b926b3edd96-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bedd473426a744bd9cc50b926b3edd96-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ccb8130c7c434b2e87d8aaa2328678f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ccb8130c7c434b2e87d8aaa2328678f6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11510,7 +11516,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/176e7065c4324afdaba66b70293df0a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/176e7065c4324afdaba66b70293df0a2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/104c06b310bc4f1683a830dc9664056e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/104c06b310bc4f1683a830dc9664056e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11528,7 +11534,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6bea87bf11974ea7b93f5f07020976b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bea87bf11974ea7b93f5f07020976b5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eb416d3beb094f67aa251c714d54f25a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb416d3beb094f67aa251c714d54f25a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11546,7 +11552,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d8d6a3fda9604883afaace131557d3b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8d6a3fda9604883afaace131557d3b9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fda2e95ceef64ac8a63b2f198ab65e0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fda2e95ceef64ac8a63b2f198ab65e0c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11564,7 +11570,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/34891fb98dad46eaa4bc304ea090e967-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34891fb98dad46eaa4bc304ea090e967-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/38a28c60168a40b3becde685a6b90bc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38a28c60168a40b3becde685a6b90bc9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11582,7 +11588,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db5bf2d7c32d491685623e4b9fcf0f37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db5bf2d7c32d491685623e4b9fcf0f37-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/baf9d7c446b443aca96062b367ee5a78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baf9d7c446b443aca96062b367ee5a78-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11600,7 +11606,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1904e7eb75bd4c37be4dbd0383991825-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1904e7eb75bd4c37be4dbd0383991825-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/86a1eb142e884fdeb0fde1a1d02220c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/86a1eb142e884fdeb0fde1a1d02220c8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11618,7 +11624,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/88a32ee402b34e5499ab3eeb699f6c72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88a32ee402b34e5499ab3eeb699f6c72-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/984ead7ff3504cd5ac8f0b705e9b26f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/984ead7ff3504cd5ac8f0b705e9b26f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11636,7 +11642,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5cffbec502c400a883efa0cc5140224-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5cffbec502c400a883efa0cc5140224-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1f474c725d04d2094c764a3b8cf0a06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1f474c725d04d2094c764a3b8cf0a06-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11654,7 +11660,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb31378b0f7340a9b7acbefd5b2c47f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb31378b0f7340a9b7acbefd5b2c47f3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/580be3a0a2054b99afbc22af48bfd250-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/580be3a0a2054b99afbc22af48bfd250-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11672,7 +11678,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0c9c5beb06b8463ab77f6f1401573d42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c9c5beb06b8463ab77f6f1401573d42-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ac029bc334644e4b0c66f254ae260c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ac029bc334644e4b0c66f254ae260c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11693,7 +11699,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8885f819c7a45abbd35fd3faf94e6c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8885f819c7a45abbd35fd3faf94e6c7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d9c2f46400e476db3146785c9b9bedf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d9c2f46400e476db3146785c9b9bedf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11742,7 +11748,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df369e666592471fa63279c5df486065-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df369e666592471fa63279c5df486065-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dad4b69e85aa40e7a12f43491db63b36-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dad4b69e85aa40e7a12f43491db63b36-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11791,7 +11797,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3d13792018f44329e4265cbef76f7d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3d13792018f44329e4265cbef76f7d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1063c8f323c845089fc60f4ca944a6ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1063c8f323c845089fc60f4ca944a6ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11812,7 +11818,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c8a0a0218ee741858deae18e062677a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8a0a0218ee741858deae18e062677a0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ac14e8ff46e343929dd9e5cb00e5ccd6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac14e8ff46e343929dd9e5cb00e5ccd6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11830,7 +11836,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d7a4378a1cb4060b5d1851c2138fcb3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d7a4378a1cb4060b5d1851c2138fcb3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b2a4bedbf0049979439ea636471bdfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b2a4bedbf0049979439ea636471bdfd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11848,7 +11854,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3a9761959b024d93a1022d508028aa5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a9761959b024d93a1022d508028aa5b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fbbdff2fbf34401b9dcaad34ef3b4c2d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbbdff2fbf34401b9dcaad34ef3b4c2d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11866,7 +11872,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/18ebe6ee67ea403b9065f948bf35401e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18ebe6ee67ea403b9065f948bf35401e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2a0c064167547028221a5a72662e3db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2a0c064167547028221a5a72662e3db-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11884,7 +11890,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/280663344ac3486c9d6fd6b376a0b9f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/280663344ac3486c9d6fd6b376a0b9f1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/07cd065f801844878401445352025f2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07cd065f801844878401445352025f2e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11902,7 +11908,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc9aacbd2f4140c39183c0b86ea86a3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc9aacbd2f4140c39183c0b86ea86a3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/538b10ad39814c7d8373e00caabb2654-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/538b10ad39814c7d8373e00caabb2654-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11920,7 +11926,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7af302fea63c48cfbe2e180c3661ea9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7af302fea63c48cfbe2e180c3661ea9a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71267ec8940a450987a124d2826f6e3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71267ec8940a450987a124d2826f6e3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11938,7 +11944,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5110ffc97894c828c540fb78b619c71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5110ffc97894c828c540fb78b619c71-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4a3cab4056c748c784260d7df55afe8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a3cab4056c748c784260d7df55afe8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -11987,7 +11993,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7b8390647bc9407ca834cd9302b06916-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b8390647bc9407ca834cd9302b06916-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58ee79e6d360455795d85b1fc9ce8f29-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58ee79e6d360455795d85b1fc9ce8f29-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12035,7 +12041,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e456e6a21c0945b0a2a224410aa503ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e456e6a21c0945b0a2a224410aa503ab-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/99a594c51a374ac8ba914fdb101ea703-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/99a594c51a374ac8ba914fdb101ea703-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12053,7 +12059,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03a4839fba964a56a24165e703bc227d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03a4839fba964a56a24165e703bc227d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d53e3a0e1c2345b496406969fbd005d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d53e3a0e1c2345b496406969fbd005d8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12071,7 +12077,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b170bfabdcbb41bca49fc337184c195d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b170bfabdcbb41bca49fc337184c195d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83da5168feae4212901a7c6b143c538b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83da5168feae4212901a7c6b143c538b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12089,7 +12095,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2905095f28714181bbb4fb2f06f4cf22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2905095f28714181bbb4fb2f06f4cf22-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44043a4f97af47159f86ca4f5d4fd1f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44043a4f97af47159f86ca4f5d4fd1f5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12107,7 +12113,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/421e7a163882404ca77c3d85bc829b6c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/421e7a163882404ca77c3d85bc829b6c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1879502e3b74cdabfafbfbc96a08d71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1879502e3b74cdabfafbfbc96a08d71-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12125,7 +12131,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a58f7991195b4b9c9ce0da0645e8c766-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a58f7991195b4b9c9ce0da0645e8c766-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d2b7367d27c84efcaa66c597751407f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d2b7367d27c84efcaa66c597751407f5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12143,7 +12149,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0451fae6e2234e2581b2d50cef745567-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0451fae6e2234e2581b2d50cef745567-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db01ff15ba4144c5965f6f075890d026-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db01ff15ba4144c5965f6f075890d026-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12161,7 +12167,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b1151aa6cf74fb1930d726da3f00b03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b1151aa6cf74fb1930d726da3f00b03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b54ae678d96432d96f75c80968b82e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b54ae678d96432d96f75c80968b82e9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12179,7 +12185,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/91f4c9073e57400488bb28c33714909c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91f4c9073e57400488bb28c33714909c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ab62be0d64e4365ac5cc403788d410b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ab62be0d64e4365ac5cc403788d410b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12197,7 +12203,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33eef064d4a54dd18d31ae84b031e70d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33eef064d4a54dd18d31ae84b031e70d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eadb438bdff34b189f443a4e81fb3c6e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eadb438bdff34b189f443a4e81fb3c6e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12215,7 +12221,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d98c0875d1a545238761741439284500-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d98c0875d1a545238761741439284500-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eeca472836454aa79511373d5c3806dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eeca472836454aa79511373d5c3806dd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12233,7 +12239,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0755a841747947cb82c4591b17b7a780-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0755a841747947cb82c4591b17b7a780-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3187200df80345ab9e97982d32f6dee0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3187200df80345ab9e97982d32f6dee0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12251,7 +12257,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/afacdc1f107c4d3bad7de4099f84b759-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afacdc1f107c4d3bad7de4099f84b759-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1a62b0124df44e0bf9ae96f52826e22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1a62b0124df44e0bf9ae96f52826e22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12269,7 +12275,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/155f9530f6af4fdbb094cf4e4e2dcba5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/155f9530f6af4fdbb094cf4e4e2dcba5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c238f9db4f9a41ddb30ee0250a6ea643-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c238f9db4f9a41ddb30ee0250a6ea643-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12287,7 +12293,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8bd81461dffd47ba958fc3cf9eb88c1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bd81461dffd47ba958fc3cf9eb88c1e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/443c60d71b88487eadb43cfb5e0e38cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/443c60d71b88487eadb43cfb5e0e38cc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12305,7 +12311,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/edc328e820ab4e51a0b918366e73e9f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/edc328e820ab4e51a0b918366e73e9f3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8118ed10f3c2466d953c694d1e04ee2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8118ed10f3c2466d953c694d1e04ee2b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12323,7 +12329,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59ba85f781ef4e0397d4b308d234a311-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59ba85f781ef4e0397d4b308d234a311-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/01f56c5fa5344efc960f7f2393b0c0be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01f56c5fa5344efc960f7f2393b0c0be-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12341,7 +12347,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/258b3c3baf564aae8dfd65a2c0454358-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/258b3c3baf564aae8dfd65a2c0454358-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/49e45067762c4d17a5c8f9a8033a0104-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49e45067762c4d17a5c8f9a8033a0104-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12359,7 +12365,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/958f2e0a17024488aa3847034487c790-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/958f2e0a17024488aa3847034487c790-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32a93af4e2c348479d0fa3b2b12f7202-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32a93af4e2c348479d0fa3b2b12f7202-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12377,7 +12383,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9de226e46cb44115ad2e8fefd64e1b38-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9de226e46cb44115ad2e8fefd64e1b38-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ce8e9d10cf04eaaaf6bca047a57239d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ce8e9d10cf04eaaaf6bca047a57239d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12395,7 +12401,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27feb9cfaa5946cfb21c78f101040100-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27feb9cfaa5946cfb21c78f101040100-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6fde17fbe2c04f79b3b411ae966ec68d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fde17fbe2c04f79b3b411ae966ec68d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12413,7 +12419,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7273f68370a04332ab60c6584aabecb1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7273f68370a04332ab60c6584aabecb1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4f4959789c8d44628e4a3031f5f6f43b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f4959789c8d44628e4a3031f5f6f43b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12431,7 +12437,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5659818d410742d7b07261ef3d145c14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5659818d410742d7b07261ef3d145c14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f5004071df074f0aa13ccda17d0af70b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f5004071df074f0aa13ccda17d0af70b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12449,7 +12455,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c11f914c424448e82fdbbc759021e8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c11f914c424448e82fdbbc759021e8c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/490e449310fb44e395dd84a969995b2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/490e449310fb44e395dd84a969995b2a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12467,7 +12473,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/385d73dde12b478282b5e38a4c3b64eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/385d73dde12b478282b5e38a4c3b64eb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c56844d15ed2418e9efb37f6a797a3ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c56844d15ed2418e9efb37f6a797a3ff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12485,7 +12491,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f940bfbb519d4c3aa01bde3f383770d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f940bfbb519d4c3aa01bde3f383770d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9b4595610de4185852f31a9bf44884d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9b4595610de4185852f31a9bf44884d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12503,7 +12509,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2b080d2ce8a496da759adeaa39cd71e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2b080d2ce8a496da759adeaa39cd71e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/926717364eea40cc859b1aea48fb6b12-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/926717364eea40cc859b1aea48fb6b12-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12521,7 +12527,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d14af1347b6e4ce68e95f4e71a73b6c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d14af1347b6e4ce68e95f4e71a73b6c3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03e9d7e550084f85bf2ae17da50386e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03e9d7e550084f85bf2ae17da50386e8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12539,7 +12545,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f24c7a53a944922b327019eca0dbecb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f24c7a53a944922b327019eca0dbecb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/62f6374afa7746a9bfacec3d35616372-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62f6374afa7746a9bfacec3d35616372-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12557,7 +12563,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/251542d4a1a54507bc715a9a16492a14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/251542d4a1a54507bc715a9a16492a14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7cbd5d5716e34b02b8a909689474e7f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7cbd5d5716e34b02b8a909689474e7f7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12575,7 +12581,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d68243cc1e9741de836b0256b5544e47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d68243cc1e9741de836b0256b5544e47-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1119de3b28c4e5e870cd164e9baa76d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1119de3b28c4e5e870cd164e9baa76d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12593,7 +12599,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53510aaa111440999cb8a3dee1078b08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53510aaa111440999cb8a3dee1078b08-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f3c8477e69f42b4b79f36fdcad809cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f3c8477e69f42b4b79f36fdcad809cd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12614,7 +12620,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5c28704e9914df78742a850543d52fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5c28704e9914df78742a850543d52fc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/804f653c822246e693d999f792f5b45f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/804f653c822246e693d999f792f5b45f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12632,7 +12638,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dcaf19fd7ea84d5ca732bcac526e36bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dcaf19fd7ea84d5ca732bcac526e36bb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/41b4d11389fd4d9c8ffae553b6fc207c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41b4d11389fd4d9c8ffae553b6fc207c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12650,7 +12656,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5f1f55f76ce543bea1dd6edb278d0ed0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f1f55f76ce543bea1dd6edb278d0ed0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d2a2d6b95be54d4a82ae852c0878bf72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d2a2d6b95be54d4a82ae852c0878bf72-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12668,7 +12674,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f00f762558134e9ea6990bdba25fbb07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f00f762558134e9ea6990bdba25fbb07-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d149392e6104a5b9611ee2021c166ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d149392e6104a5b9611ee2021c166ca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12686,7 +12692,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c7c7be69ff84b209fc1a0d625b4595a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c7c7be69ff84b209fc1a0d625b4595a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8b67eb6895cc4733888380b43667a9f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b67eb6895cc4733888380b43667a9f8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12704,7 +12710,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fed439bc88a046eaa5aff7f18b7c685b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fed439bc88a046eaa5aff7f18b7c685b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/082c35749e4544e985b913a2526ecf23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/082c35749e4544e985b913a2526ecf23-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12722,7 +12728,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78399a0049834f06a2ac77dec3b72546-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78399a0049834f06a2ac77dec3b72546-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d4fcdd9560a4c85a7a9e66b24d694ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d4fcdd9560a4c85a7a9e66b24d694ce-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12740,7 +12746,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3ae77b1565c4d1dba706c18d0f56deb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3ae77b1565c4d1dba706c18d0f56deb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7818e6f19a814bcf90702182fce9d34b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7818e6f19a814bcf90702182fce9d34b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12758,7 +12764,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba2882d2c0b24aaf8b6116b665f508d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba2882d2c0b24aaf8b6116b665f508d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2208a25dbd444b5e819ae9039d059966-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2208a25dbd444b5e819ae9039d059966-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12776,7 +12782,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6233d27fa67348f7856ee6261ba4c03c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6233d27fa67348f7856ee6261ba4c03c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8551fc06877f4b049f771295fa4d30c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8551fc06877f4b049f771295fa4d30c9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12794,7 +12800,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ab44e4ff5a8464c9769c41c9476d965-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ab44e4ff5a8464c9769c41c9476d965-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a27a292835549668fe09772ffa17a65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a27a292835549668fe09772ffa17a65-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12812,7 +12818,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/85ec334c754e475f92afe8c14c945bb7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85ec334c754e475f92afe8c14c945bb7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4e3d8d39dfee4ba5aca48e199631cfe9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e3d8d39dfee4ba5aca48e199631cfe9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12830,7 +12836,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2844cd6ddb7948bfbdf56a0e8f61be4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2844cd6ddb7948bfbdf56a0e8f61be4b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f268eebf7d14a739a6732b28672fede-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f268eebf7d14a739a6732b28672fede-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12848,7 +12854,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/165ea30c4f45414ab69ef486473fe706-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/165ea30c4f45414ab69ef486473fe706-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13f0b948429a45879ef59461fe761a73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13f0b948429a45879ef59461fe761a73-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12866,7 +12872,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5342bdfbf92e4f0caa1fff70dd10c980-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5342bdfbf92e4f0caa1fff70dd10c980-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9afd65e7c06544768d05aac573d3d3e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9afd65e7c06544768d05aac573d3d3e1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12884,7 +12890,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ceaf1af839f84b5f83f8b030fb97ce52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ceaf1af839f84b5f83f8b030fb97ce52-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c35ebe16d7b747a5a36c662deea109a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c35ebe16d7b747a5a36c662deea109a3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12902,7 +12908,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d8af28536394290bbdfb8b55113f717-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d8af28536394290bbdfb8b55113f717-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1cac426e23664aa289d906f6c7ec00c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cac426e23664aa289d906f6c7ec00c4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12920,7 +12926,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/46454fc9df3d445aa71f6bdec19bf04e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46454fc9df3d445aa71f6bdec19bf04e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa3c7f95a0184d35911a3d697daf471f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa3c7f95a0184d35911a3d697daf471f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12938,7 +12944,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b6cbb2109b9744f3a897810e0813d7e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6cbb2109b9744f3a897810e0813d7e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/07b413ddfe4a43c88753e9e81ce274a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07b413ddfe4a43c88753e9e81ce274a6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12956,7 +12962,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9638f56389064745afd530372051a806-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9638f56389064745afd530372051a806-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/baee24d9151b432a83a7bb22963ef5d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baee24d9151b432a83a7bb22963ef5d0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12974,7 +12980,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d885b028a37405585b36e4b3eae8cb2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d885b028a37405585b36e4b3eae8cb2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/432a7ae5002945929c2b2546f1e74769-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/432a7ae5002945929c2b2546f1e74769-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -12992,7 +12998,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9e0e4c761bc64ab5a518e8f5d0e96451-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e0e4c761bc64ab5a518e8f5d0e96451-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f501dc85c8b546b3ba20fd3f1cf096e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f501dc85c8b546b3ba20fd3f1cf096e5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13010,7 +13016,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0115f56974494456bb2ac8207e7b7921-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0115f56974494456bb2ac8207e7b7921-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3ea487dca89349ea861163440961015a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ea487dca89349ea861163440961015a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13028,7 +13034,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9840aed344ca4eb0a386e3b5155ed77c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9840aed344ca4eb0a386e3b5155ed77c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bcd4d9235eb44527a1e9022f35480b22-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcd4d9235eb44527a1e9022f35480b22-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13046,7 +13052,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5ba2f3c397fa40079612ce69c2cc7a2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ba2f3c397fa40079612ce69c2cc7a2c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/48d3d1438256470caf7dbd50f5093ce1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48d3d1438256470caf7dbd50f5093ce1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13064,7 +13070,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c25662db607c4f0e904040dd7c52ae19-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c25662db607c4f0e904040dd7c52ae19-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d208bd5edcd74d4194e114321cd000b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d208bd5edcd74d4194e114321cd000b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13082,7 +13088,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/de991ec9525a4df7b454fc244e371494-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de991ec9525a4df7b454fc244e371494-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4eb93adb327748da9f5aff8a6a79e8ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4eb93adb327748da9f5aff8a6a79e8ff-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13100,7 +13106,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/91aa72bca5c1436e89b8d1f8c3d19185-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91aa72bca5c1436e89b8d1f8c3d19185-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c6ca2f03fcb43799b8896bd2a6eb938-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c6ca2f03fcb43799b8896bd2a6eb938-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13118,7 +13124,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/40517b8e997f4260899ff48204098896-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40517b8e997f4260899ff48204098896-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e031f9e799541cc9530e8fedc8120c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e031f9e799541cc9530e8fedc8120c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13136,7 +13142,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d71511b641e44d6e95e8d6f1ce1afd3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d71511b641e44d6e95e8d6f1ce1afd3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78d93c93a82845fba7430fe54989afb6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78d93c93a82845fba7430fe54989afb6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13154,7 +13160,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/afacdc565c504a7abb8da7f09d55382c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afacdc565c504a7abb8da7f09d55382c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e9895a278cd43a9a6add95139050a5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e9895a278cd43a9a6add95139050a5e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13172,7 +13178,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a6650d2b4ee94e9d9013cd24f1ac1686-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6650d2b4ee94e9d9013cd24f1ac1686-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f6d425f2e604b35b8bd3d43a271b0c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f6d425f2e604b35b8bd3d43a271b0c3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13190,7 +13196,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8292886c4b684845bfba23989b3d4bb6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8292886c4b684845bfba23989b3d4bb6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bf131c28ca164ab1beccbce245e6115a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf131c28ca164ab1beccbce245e6115a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13208,7 +13214,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fdb32ed8235e44b0905a9432cf1909d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdb32ed8235e44b0905a9432cf1909d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/06ad1e4247ba4337aae026793b4540ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06ad1e4247ba4337aae026793b4540ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13226,7 +13232,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/122cf1b5b374454089d18fc3f04a3b1c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/122cf1b5b374454089d18fc3f04a3b1c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b3c7352dcd1d4ab4a78dd977e03699f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3c7352dcd1d4ab4a78dd977e03699f8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13244,7 +13250,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68a54869430348109fa2588bbae73b2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68a54869430348109fa2588bbae73b2e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/23191bb1bd4c497d9bac2ca1c52b1030-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23191bb1bd4c497d9bac2ca1c52b1030-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13262,7 +13268,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d4def9af2d074a83aa57930f0379ed0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4def9af2d074a83aa57930f0379ed0f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/102d18ebd0d043828606545738a315e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/102d18ebd0d043828606545738a315e5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13280,7 +13286,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72b54888732a4ae9a8bda410c25e94dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72b54888732a4ae9a8bda410c25e94dd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fb84d458ef9049ac9f9849966850cfaf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb84d458ef9049ac9f9849966850cfaf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13298,7 +13304,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c5ecc77407554653b39005cd1a9f1ce1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5ecc77407554653b39005cd1a9f1ce1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3490bdab57fc443ca3aa460510730dfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3490bdab57fc443ca3aa460510730dfd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13316,7 +13322,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e752a4a1c26b4aa0a328f316b3ce5478-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e752a4a1c26b4aa0a328f316b3ce5478-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2587e331bbc147b1b17b8037cb811226-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2587e331bbc147b1b17b8037cb811226-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13334,7 +13340,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8de95fe9c841447283be970f0504ed17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8de95fe9c841447283be970f0504ed17-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98ae1e1ff8054a35b84a49c289a0fea7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98ae1e1ff8054a35b84a49c289a0fea7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13352,7 +13358,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cbcdb2a7d2a9477eb600ef0faa309fd7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbcdb2a7d2a9477eb600ef0faa309fd7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/92357968af884312bed720fd5c1b4886-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92357968af884312bed720fd5c1b4886-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13370,7 +13376,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b39b388d96eb4e059d2520eb8c58def0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b39b388d96eb4e059d2520eb8c58def0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/401e65b7c8304c2ead6491dc0afa31cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/401e65b7c8304c2ead6491dc0afa31cd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13388,7 +13394,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/faabb1ac19454b1d85803d4eea7041bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/faabb1ac19454b1d85803d4eea7041bd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80924546c91b4c88be498e0e60580f71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80924546c91b4c88be498e0e60580f71-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13406,7 +13412,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64d88035912d4a7680741828ffcdf123-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64d88035912d4a7680741828ffcdf123-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d855333e0ee94bdfa52ce852a3bdd75b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d855333e0ee94bdfa52ce852a3bdd75b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13424,7 +13430,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/834729508e92470e8931d5e095cb3b81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/834729508e92470e8931d5e095cb3b81-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee89433a10b041df85e1763c146bc156-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee89433a10b041df85e1763c146bc156-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13442,7 +13448,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75eca8c90b984eaf841ae07ca6ab0a7e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75eca8c90b984eaf841ae07ca6ab0a7e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a67228c606124c55974dd109c7167e5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a67228c606124c55974dd109c7167e5b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13460,7 +13466,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a5b00a0b16984d3ca1d30475f7527c8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a5b00a0b16984d3ca1d30475f7527c8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64cf2ec644dd46b88397434ac5cc5484-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64cf2ec644dd46b88397434ac5cc5484-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13478,7 +13484,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa1710a646b04d3081ce23ef16b64b37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa1710a646b04d3081ce23ef16b64b37-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f95bf16495fd44cb905663dad97bfa8d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f95bf16495fd44cb905663dad97bfa8d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13496,7 +13502,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8bd171a70bdd4e1bbb249172e9cfa16e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bd171a70bdd4e1bbb249172e9cfa16e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e59b57f378f543f59fea9b7b72217680-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e59b57f378f543f59fea9b7b72217680-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13514,7 +13520,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3b042ab9f4c4410190ea208489e94343-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b042ab9f4c4410190ea208489e94343-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8405f91b55b04303a69b3718d27197ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8405f91b55b04303a69b3718d27197ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13532,7 +13538,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93dde657b8dd488687ae5e4db87f35ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93dde657b8dd488687ae5e4db87f35ce-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e9f1dcd27dfa4c3aa146c60da71456d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9f1dcd27dfa4c3aa146c60da71456d8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13550,7 +13556,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9011819dbd0f427ba0d084e1f4500b4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9011819dbd0f427ba0d084e1f4500b4b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c520177aa4c94880938941400b3d2bf5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c520177aa4c94880938941400b3d2bf5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13568,7 +13574,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca63fd870dc042159d45f0f151297e8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca63fd870dc042159d45f0f151297e8b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3fcabff0c325435880759bb02a877e42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fcabff0c325435880759bb02a877e42-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13586,7 +13592,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b5c6e436fd994206899df8fd1ab70df7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5c6e436fd994206899df8fd1ab70df7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1232ca85b5c848328018e77ac65ff539-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1232ca85b5c848328018e77ac65ff539-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13604,7 +13610,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98fa4bfe7b664a7796678213be4b9a35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98fa4bfe7b664a7796678213be4b9a35-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9a3ede95eda249dd84a202d7ec85852f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a3ede95eda249dd84a202d7ec85852f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13622,7 +13628,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1de1255bfea4504a16fe37725836567-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1de1255bfea4504a16fe37725836567-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1bd836472da748c5a755f3ec2fb3c60b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1bd836472da748c5a755f3ec2fb3c60b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13640,7 +13646,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5914fcbf1ba94f738de17669f953d41f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5914fcbf1ba94f738de17669f953d41f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3dc4d9fcbabf4c988fd0e6ee0c87babf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3dc4d9fcbabf4c988fd0e6ee0c87babf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13658,7 +13664,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8db2317e1254512848874d38e15811d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8db2317e1254512848874d38e15811d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/aaf4368fd5a642ad8d33a071a944e577-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaf4368fd5a642ad8d33a071a944e577-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13676,7 +13682,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6dde0156dbfd45e2b91ebe6184fe1768-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6dde0156dbfd45e2b91ebe6184fe1768-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9385a961548424fa5aedf074efd5f74-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9385a961548424fa5aedf074efd5f74-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13694,7 +13700,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b109f803b7ed4991ba758a6971fc96aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b109f803b7ed4991ba758a6971fc96aa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1a529496dde44b7b90a2283a4c61349f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a529496dde44b7b90a2283a4c61349f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13712,7 +13718,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8d09606f1671425f93d0480bdb49a6a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d09606f1671425f93d0480bdb49a6a9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8aa5eebc9c8243eba9e19c930e3efe71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8aa5eebc9c8243eba9e19c930e3efe71-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13730,7 +13736,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/610334e0892345c3bb77c19f929bb950-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/610334e0892345c3bb77c19f929bb950-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cbebc6dbdb84d7f9e1d729600e2e083-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cbebc6dbdb84d7f9e1d729600e2e083-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13748,7 +13754,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d6500c1ac75b47eb8f4c7181052fac0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6500c1ac75b47eb8f4c7181052fac0e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c8f964fbecd41dea79cd6fd4424d67c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c8f964fbecd41dea79cd6fd4424d67c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13768,7 +13774,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4b6155696e58406fac42df42168d6c42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b6155696e58406fac42df42168d6c42-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2013fd805d3491a8715b95a82313eea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2013fd805d3491a8715b95a82313eea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13852,7 +13858,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b7ca7ea2fbd24262857104a2d0bf0b9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7ca7ea2fbd24262857104a2d0bf0b9b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a21f5d5997d545499d6a3c8d4a6e052d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a21f5d5997d545499d6a3c8d4a6e052d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13901,7 +13907,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c73b50e6b8349779b2a55a8edb40b3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c73b50e6b8349779b2a55a8edb40b3f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/56a7525ad7e24fe7af576c1055da502b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56a7525ad7e24fe7af576c1055da502b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13950,7 +13956,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5b6d8c2ec2654301bf4b58d37293b89d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b6d8c2ec2654301bf4b58d37293b89d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c82fad999fc4a209e5e157ab74251d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c82fad999fc4a209e5e157ab74251d8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13972,7 +13978,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b81d0404c630490888f9cd3adb95a0fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b81d0404c630490888f9cd3adb95a0fb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d251c171a6a14cffb8bd5e5b77f4b014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d251c171a6a14cffb8bd5e5b77f4b014-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -13993,7 +13999,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d0227a3dbfb44fd9e0fb861f6386006-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d0227a3dbfb44fd9e0fb861f6386006-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6af282f970fe4bfcbf1314459e4d70e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6af282f970fe4bfcbf1314459e4d70e4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14011,7 +14017,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e2ceadfa71ff4876b5d1577d1de4680c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ceadfa71ff4876b5d1577d1de4680c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9477a0769c524492be7afb1ce7e99efa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9477a0769c524492be7afb1ce7e99efa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14029,7 +14035,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/49f23abcebda437ca6459ad0e39f7db0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49f23abcebda437ca6459ad0e39f7db0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e003e5699b2944dd9fc21c287439d560-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e003e5699b2944dd9fc21c287439d560-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14047,7 +14053,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/11a85464ac544b3fa95bf6869c28d462-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11a85464ac544b3fa95bf6869c28d462-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/06c39d6b698f4d4582f4518588b26543-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06c39d6b698f4d4582f4518588b26543-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14065,7 +14071,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b29f60e5b41d41bb85355066164d9144-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b29f60e5b41d41bb85355066164d9144-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc8d126f332440ab91da7290c51b9fca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc8d126f332440ab91da7290c51b9fca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14083,7 +14089,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8459e6126681412f82bd3e91e4b08d91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8459e6126681412f82bd3e91e4b08d91-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/259eb4d4424440749205cfc8a9e9ba6a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/259eb4d4424440749205cfc8a9e9ba6a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14101,7 +14107,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d62039fee0c4605a87b89eca093f608-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d62039fee0c4605a87b89eca093f608-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58456739b7df4c9a8ab3bcd68d063e0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58456739b7df4c9a8ab3bcd68d063e0f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14185,7 +14191,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/90690c15de7647dbb4210af339d3edc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90690c15de7647dbb4210af339d3edc2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0861ba5f682548339e12a915a599968b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0861ba5f682548339e12a915a599968b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14208,7 +14214,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5cc7773e099f4edd98876ee43ce6744d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5cc7773e099f4edd98876ee43ce6744d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/12a0639f07374c9f9bc2e78934e848ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12a0639f07374c9f9bc2e78934e848ca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14231,7 +14237,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9aabee0f3764c6d8498325ee087f645-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9aabee0f3764c6d8498325ee087f645-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/74b570369d6c497495217ddce2e72855-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74b570369d6c497495217ddce2e72855-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14252,7 +14258,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb3a4b3e07b44fec8ccd184df50c4c3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb3a4b3e07b44fec8ccd184df50c4c3e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/413b9f87e4cd4659b125250738c60ce4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/413b9f87e4cd4659b125250738c60ce4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14270,7 +14276,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/10363b71453c4067983bef2dcd8957be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10363b71453c4067983bef2dcd8957be-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dab02360a5cf40c8893fe5db75a2d1a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dab02360a5cf40c8893fe5db75a2d1a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14288,7 +14294,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae13813cf9494112adf6166665d21ad4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae13813cf9494112adf6166665d21ad4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dc5a2beb1d114e148a881966fec28ed1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc5a2beb1d114e148a881966fec28ed1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14306,7 +14312,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b6cc84328a04371be94c32c99e72494-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b6cc84328a04371be94c32c99e72494-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/676a7629f0ca454ba2b6858e39db1c7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/676a7629f0ca454ba2b6858e39db1c7f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14324,7 +14330,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5fefb2844328470da05f53c0ea783bca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5fefb2844328470da05f53c0ea783bca-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/df5e3e8b803e42a1b83dcac661e7dc54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df5e3e8b803e42a1b83dcac661e7dc54-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14342,7 +14348,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dfd90e3279f540d5890363e9de23d4da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dfd90e3279f540d5890363e9de23d4da-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/978c0a91fcdd46f4acbc2ed5ba1efed0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/978c0a91fcdd46f4acbc2ed5ba1efed0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14360,7 +14366,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bbc3199e7b794815ac82d6d00b4f2a86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbc3199e7b794815ac82d6d00b4f2a86-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c92f9d4707274aef9ecc0eb173220e9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c92f9d4707274aef9ecc0eb173220e9c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14378,7 +14384,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1007cd96b1e94679aa95fa6036fcc606-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1007cd96b1e94679aa95fa6036fcc606-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f4bda8c3a6b74adf887fe0a9aeee4f8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4bda8c3a6b74adf887fe0a9aeee4f8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14427,7 +14433,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24cfe2c1906a4a87a5344423863ca859-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24cfe2c1906a4a87a5344423863ca859-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/014323372ec446cf971b0e39be4d640c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/014323372ec446cf971b0e39be4d640c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14475,7 +14481,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3a28df6eb3e2485799a6a069421682a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a28df6eb3e2485799a6a069421682a8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/faaadf1426204ad4a2c4444c0d10ae79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/faaadf1426204ad4a2c4444c0d10ae79-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14493,7 +14499,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6141a35f007a468dbf31b4fe70de2b58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6141a35f007a468dbf31b4fe70de2b58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ecf5b113dff446dcaf89c382620a160f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecf5b113dff446dcaf89c382620a160f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14511,7 +14517,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc16e9264e6f46ffbb007de453ba6343-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc16e9264e6f46ffbb007de453ba6343-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a33691c55aed49f1954af6afa18a2677-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a33691c55aed49f1954af6afa18a2677-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14529,7 +14535,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bdd763ccb164499285fe86f241ca1147-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bdd763ccb164499285fe86f241ca1147-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3424a89b31c14e408665a442d2571c76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3424a89b31c14e408665a442d2571c76-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14547,7 +14553,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/48cb57312cdf455e9f848aacb020a92e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48cb57312cdf455e9f848aacb020a92e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ecfe1d4abf6143278c57f8b35015b191-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecfe1d4abf6143278c57f8b35015b191-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14565,7 +14571,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71b9b49269804760a8edc57177645bd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71b9b49269804760a8edc57177645bd1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5684be54424546ab81dd5098249773a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5684be54424546ab81dd5098249773a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14583,7 +14589,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bf3781b095c544958bdb2e395dd30a8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf3781b095c544958bdb2e395dd30a8a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b1c3080c9bfd4f75b84607fb01c2852a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1c3080c9bfd4f75b84607fb01c2852a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14601,7 +14607,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/15087c3bda4f4682830cb463c584ceb9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/15087c3bda4f4682830cb463c584ceb9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ecc5b6b940464aa49bcba3826cb886da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecc5b6b940464aa49bcba3826cb886da-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14619,7 +14625,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ceb44239de5a430f902e9a329bc46740-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ceb44239de5a430f902e9a329bc46740-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/83ce0c891f8146e9a9fdb93455651b5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83ce0c891f8146e9a9fdb93455651b5e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14637,7 +14643,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/070a3cca3c7346f6975002368e66dcbc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/070a3cca3c7346f6975002368e66dcbc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/392153baf3364935b853d2582495c231-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/392153baf3364935b853d2582495c231-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14655,7 +14661,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d13ed497210743a092dd05b7f853bca6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d13ed497210743a092dd05b7f853bca6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0922cf70a34f4cf2b8887d7839a2eef9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0922cf70a34f4cf2b8887d7839a2eef9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14673,7 +14679,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6447463cdc0347689d4e6283102ade2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6447463cdc0347689d4e6283102ade2b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/da4d070aab5947658e18a073effe7822-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da4d070aab5947658e18a073effe7822-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14691,7 +14697,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b26f1136e6d44018e0e8cab5c640d83-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b26f1136e6d44018e0e8cab5c640d83-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27456aee31c5411da91c1fedecf63992-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27456aee31c5411da91c1fedecf63992-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14709,7 +14715,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7f00e722d729478197f3374519296759-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f00e722d729478197f3374519296759-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cae0b0f438ea44a6bc6c4d2739e35b25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cae0b0f438ea44a6bc6c4d2739e35b25-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14727,7 +14733,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/926ffd03ce2944e7922d622d1aee1022-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/926ffd03ce2944e7922d622d1aee1022-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d12cac46983643d6bcaa88d27929e3b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d12cac46983643d6bcaa88d27929e3b0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14745,7 +14751,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cb4e6139f9ac489496d7323f080d5f31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb4e6139f9ac489496d7323f080d5f31-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e083e86e24494491909f628c5c7034a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e083e86e24494491909f628c5c7034a7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14763,7 +14769,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5a5bde0d96f44771b357b24c0a1efe8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5a5bde0d96f44771b357b24c0a1efe8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dea506fd3e2540c88742616690b92f59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dea506fd3e2540c88742616690b92f59-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14781,7 +14787,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1097f48471f446a9b893ecc714755abd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1097f48471f446a9b893ecc714755abd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad1d7c49eafa4011b622796bd4e7d938-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad1d7c49eafa4011b622796bd4e7d938-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14799,7 +14805,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b64eeee294354261b06cc6e7f28043b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b64eeee294354261b06cc6e7f28043b3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d01a4aa591f4aae87505287cffc02ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d01a4aa591f4aae87505287cffc02ba-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14817,7 +14823,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/edc898ab848446b4aefc087321de0c69-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/edc898ab848446b4aefc087321de0c69-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c00dc9cd17e4e32807f112b7ee30f60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c00dc9cd17e4e32807f112b7ee30f60-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14835,7 +14841,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/146d3a1db0be439da7836a52cb9314c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/146d3a1db0be439da7836a52cb9314c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8853514b831440c193703818e2ecf504-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8853514b831440c193703818e2ecf504-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14853,7 +14859,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c4de9da53e984cdba1fe76b08fe43e66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4de9da53e984cdba1fe76b08fe43e66-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e799993c695412d8dfff8abdda13005-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e799993c695412d8dfff8abdda13005-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14871,7 +14877,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/344320a518cb419087901df6e85538cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/344320a518cb419087901df6e85538cf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/762b409ac05e455f934f62aa6a3e5a58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/762b409ac05e455f934f62aa6a3e5a58-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14889,7 +14895,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1efe503399c8438c866f916efd9b4420-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1efe503399c8438c866f916efd9b4420-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/551f621d9fb84ee7bb2547129118cee0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/551f621d9fb84ee7bb2547129118cee0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14907,7 +14913,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c14df202dc04af7935e19c1313cb03d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c14df202dc04af7935e19c1313cb03d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/801ee522fbb84386920dfcca1157f6de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/801ee522fbb84386920dfcca1157f6de-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14925,7 +14931,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89a4e2db01114f0699a90190b00ee577-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89a4e2db01114f0699a90190b00ee577-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ee5ab7990a04858be61c8b4019b0a84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ee5ab7990a04858be61c8b4019b0a84-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14943,7 +14949,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2797df3b90194aaf96ebe0ee4671cd8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2797df3b90194aaf96ebe0ee4671cd8f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/78aef4b3dcc44deda082d3c71ab9b34d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78aef4b3dcc44deda082d3c71ab9b34d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14961,7 +14967,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8ee9695a5f7404fb2f0b8ad03d61789-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8ee9695a5f7404fb2f0b8ad03d61789-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/987532e0a41644f1946aa2e2453b5ecc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/987532e0a41644f1946aa2e2453b5ecc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14979,7 +14985,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/95715f4ab2ef47ae9583eb8cdb24cf3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/95715f4ab2ef47ae9583eb8cdb24cf3b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/17101464163f4a828ba25dcc334c1408-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17101464163f4a828ba25dcc334c1408-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -14997,7 +15003,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab2fe16951334b68aabfe12b0eab3600-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab2fe16951334b68aabfe12b0eab3600-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c690ffc9965a4121bbd743a5a8caafa9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c690ffc9965a4121bbd743a5a8caafa9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15015,7 +15021,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89c779b1a2874919a9ef27c46415c9f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c779b1a2874919a9ef27c46415c9f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c535787dd3ae44529f583313a643316a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c535787dd3ae44529f583313a643316a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15033,7 +15039,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/87a0ee0b0a5744919e09e68239eaeb5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87a0ee0b0a5744919e09e68239eaeb5c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/833410c694d940f097b1cf0a2e326d32-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/833410c694d940f097b1cf0a2e326d32-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15117,7 +15123,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6f36b725ed4647beb1387083c83ef1f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f36b725ed4647beb1387083c83ef1f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/93f66efddf4b4425a94befb8ab06d692-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93f66efddf4b4425a94befb8ab06d692-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15139,7 +15145,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/80be2bc236894104831f764dd9f0dcdf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80be2bc236894104831f764dd9f0dcdf-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2f63b2b319d944be8b4fe8e4b4176e89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f63b2b319d944be8b4fe8e4b4176e89-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15189,7 +15195,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ceeba03e41a4038a094943dd6ee29f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ceeba03e41a4038a094943dd6ee29f5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/52d3441b1f20453d8c6a08bdc5b4cd96-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52d3441b1f20453d8c6a08bdc5b4cd96-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15207,7 +15213,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e215f5d09cf6437d9c749a33ce78301c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e215f5d09cf6437d9c749a33ce78301c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/28d49f55692c44e5942af119c1ed4fa4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28d49f55692c44e5942af119c1ed4fa4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15225,7 +15231,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1349f463584e42b49a5a8034adda011e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1349f463584e42b49a5a8034adda011e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4de2e155ccd24b65a95b4a350488e8e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4de2e155ccd24b65a95b4a350488e8e4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15243,7 +15249,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3d038c7b72284c0696eadb81ef017eab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d038c7b72284c0696eadb81ef017eab-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f79e005683a140cfb2c84ba6831592e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f79e005683a140cfb2c84ba6831592e7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15261,7 +15267,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d05ab52aa0504f328e6e0d325989f90a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d05ab52aa0504f328e6e0d325989f90a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75b81a9ff26040588749d3074872c51c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75b81a9ff26040588749d3074872c51c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15279,7 +15285,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c270592943b5483aa6a282ced0a68b7e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c270592943b5483aa6a282ced0a68b7e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8dc7cf7310c743c4927d7cf4cde6cd8e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8dc7cf7310c743c4927d7cf4cde6cd8e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15297,7 +15303,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0bc5d11e09d34dbab9b8a2dfc86614b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0bc5d11e09d34dbab9b8a2dfc86614b9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/59797ff1e59c46ccba6aa02a592d8870-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59797ff1e59c46ccba6aa02a592d8870-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15315,7 +15321,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1c2d3eb649154be59fd668252c20700e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c2d3eb649154be59fd668252c20700e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a82cf352a6db4138b1197e6d19d5c13d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a82cf352a6db4138b1197e6d19d5c13d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15338,7 +15344,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd8e35477dd94a2fbc57c29a85cf02c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd8e35477dd94a2fbc57c29a85cf02c4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89b7f54cc7e947baa127298eea236a1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89b7f54cc7e947baa127298eea236a1f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15356,7 +15362,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e674d6a383cf4358b5459040b28e2cf7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e674d6a383cf4358b5459040b28e2cf7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4200dad078734f6c9b9a5903f8a03b0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4200dad078734f6c9b9a5903f8a03b0b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15374,7 +15380,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c9b5114743344e0ba6693dbe80203f96-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9b5114743344e0ba6693dbe80203f96-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b05c84bce5f346a1962c73bc2a181cae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b05c84bce5f346a1962c73bc2a181cae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15392,7 +15398,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0c375c8522684f1881c5aa0f05e4db44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c375c8522684f1881c5aa0f05e4db44-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7357f21f3c0343d5986277fb3aa4f48b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7357f21f3c0343d5986277fb3aa4f48b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15410,7 +15416,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c4ed1c68fe8c4934a5420d7520fe508b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4ed1c68fe8c4934a5420d7520fe508b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fec849cf9dea49ddb7f9afbb039c5dd0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fec849cf9dea49ddb7f9afbb039c5dd0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15428,7 +15434,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/104247e6594f4c11bae14436c333bc8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/104247e6594f4c11bae14436c333bc8c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e650eb9dcae74732882a66727aa48e65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e650eb9dcae74732882a66727aa48e65-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15446,7 +15452,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b3199f4aff84334ab07fadbb3b3b7e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b3199f4aff84334ab07fadbb3b3b7e7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e72f0b6aff7f4af3977f75a31eda8513-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e72f0b6aff7f4af3977f75a31eda8513-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15464,7 +15470,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e7dbb9b459e4e66883bf45092d8e54e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e7dbb9b459e4e66883bf45092d8e54e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d1269ce1229c447ea78e9257dc19af61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1269ce1229c447ea78e9257dc19af61-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15482,7 +15488,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f4bd31966f3546c69cd8213c4e6836c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4bd31966f3546c69cd8213c4e6836c9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77c48b7531c54f5488ee9338a7649322-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77c48b7531c54f5488ee9338a7649322-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15500,7 +15506,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9b48b40ab7bc406b9adfd61f89697f28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b48b40ab7bc406b9adfd61f89697f28-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e1c144bbcb941fea3fc4ff8275019c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e1c144bbcb941fea3fc4ff8275019c0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15518,7 +15524,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c48ba6ceb1ed40d1b87cb05cd4252b7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c48ba6ceb1ed40d1b87cb05cd4252b7f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4ee1292bb31c4e5d924685052051cc17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ee1292bb31c4e5d924685052051cc17-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15536,7 +15542,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/75d7c35f466f436a90a0066b3e8fe48f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75d7c35f466f436a90a0066b3e8fe48f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64436ec36f3c427987a97bddad735383-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64436ec36f3c427987a97bddad735383-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15554,7 +15560,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e5516fa324b47a79673d2d43becae0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e5516fa324b47a79673d2d43becae0a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2210747cd3a34035b68ec9081d834f7d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2210747cd3a34035b68ec9081d834f7d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15572,7 +15578,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/16a00288835c45fd8d9ff434d2069041-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/16a00288835c45fd8d9ff434d2069041-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/114a6831de174a06aa61d15ae837b010-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/114a6831de174a06aa61d15ae837b010-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15590,7 +15596,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ede680c1b36d40c7bde08e6b9aa1e203-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ede680c1b36d40c7bde08e6b9aa1e203-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24c35fd9105445af8cb6d829e99cc74c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24c35fd9105445af8cb6d829e99cc74c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15608,7 +15614,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c79c6ce4a75b45d6b48746426aac9985-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c79c6ce4a75b45d6b48746426aac9985-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2cc423286f934a5dbe2c9062b14a0cc1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cc423286f934a5dbe2c9062b14a0cc1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15626,7 +15632,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a13cf87789e64c4cb2ef3dbdf50421b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a13cf87789e64c4cb2ef3dbdf50421b9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f47bb3199d98437282788e13ea4f84f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f47bb3199d98437282788e13ea4f84f8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15644,7 +15650,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/02ea11618c8a46409ae45e46621aa22e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02ea11618c8a46409ae45e46621aa22e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1902bc46f68c423da127a777b5623139-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1902bc46f68c423da127a777b5623139-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15662,7 +15668,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e71ce811dae54212a168369d44d3795d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e71ce811dae54212a168369d44d3795d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bf1f139199144799de7b23f280cc436-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bf1f139199144799de7b23f280cc436-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15680,7 +15686,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad76488995494bae9fdf554351373503-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad76488995494bae9fdf554351373503-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2cde269795cc4f5a8c93e2974c1be7ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cde269795cc4f5a8c93e2974c1be7ec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15698,7 +15704,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/289a803df8f14f4b8f441bfdec43b2fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/289a803df8f14f4b8f441bfdec43b2fd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e54219c9355423aa3e2cb730df5c751-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e54219c9355423aa3e2cb730df5c751-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15716,7 +15722,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a399e3f0b6d47aba8326048884e0493-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a399e3f0b6d47aba8326048884e0493-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e6633c05110944d3ae58d46783dbbd7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6633c05110944d3ae58d46783dbbd7c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15734,7 +15740,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1d649cdfcce54c9dacf107a549710e03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d649cdfcce54c9dacf107a549710e03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/09861532951940f1bd1f315ed4f54b6e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09861532951940f1bd1f315ed4f54b6e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15752,7 +15758,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dec96a1575e340378279ac1177dfb4d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dec96a1575e340378279ac1177dfb4d0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0a88538bcc8740279e32eab02e1e9d9f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a88538bcc8740279e32eab02e1e9d9f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15770,7 +15776,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24c4050a754c4cb09bc9e4804b1e895e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24c4050a754c4cb09bc9e4804b1e895e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/603016c9335e4757ad2ea9bfb3f3698d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/603016c9335e4757ad2ea9bfb3f3698d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15788,7 +15794,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a466eb9a9154bff95c69fc95a7cf432-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a466eb9a9154bff95c69fc95a7cf432-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d7d3687ef1c1410581769106662a058f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7d3687ef1c1410581769106662a058f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15806,7 +15812,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/406bcf4c0b7a4e208a317968b7db6abe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/406bcf4c0b7a4e208a317968b7db6abe-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/249983b188744844a70647c741a5d0d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/249983b188744844a70647c741a5d0d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15824,7 +15830,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b563773e18c47438f7056e0f249e224-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b563773e18c47438f7056e0f249e224-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d3c35a7b6252475db02c07795c8bdaa7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3c35a7b6252475db02c07795c8bdaa7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15842,7 +15848,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db397bc7364c4ab49d2dcff1aee1a60a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db397bc7364c4ab49d2dcff1aee1a60a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0f56ca4a86a4818a38fca786e7189f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0f56ca4a86a4818a38fca786e7189f7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15860,7 +15866,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/04a7a8f58b6d4e318b5ba4a515199c02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04a7a8f58b6d4e318b5ba4a515199c02-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/103194c706654c07819df9a290b6becf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/103194c706654c07819df9a290b6becf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15878,7 +15884,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ada5d03c971c47d482c91a342de4651e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ada5d03c971c47d482c91a342de4651e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/869f2d4618344171ac27b1fdf3d14c50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/869f2d4618344171ac27b1fdf3d14c50-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15896,7 +15902,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1d55ddc35b664cafa9c674d78858f3ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d55ddc35b664cafa9c674d78858f3ed-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0027c69995c5461fa867c06f9369dad6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0027c69995c5461fa867c06f9369dad6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15914,7 +15920,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab9b758aa4cb4b9489bd16c7ab2b8574-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab9b758aa4cb4b9489bd16c7ab2b8574-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64de3f9b8379486a9e670a262251169a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64de3f9b8379486a9e670a262251169a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15932,7 +15938,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d85cd6fa45ba46c7b4f383035186f333-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d85cd6fa45ba46c7b4f383035186f333-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/31210e2e33fa4ce1b1714791496414bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/31210e2e33fa4ce1b1714791496414bc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15950,7 +15956,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1cfd05631bfc4734b8f8e1381477f20c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cfd05631bfc4734b8f8e1381477f20c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8fde06d8ea04680a5d361114258210c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8fde06d8ea04680a5d361114258210c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15968,7 +15974,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3395dad8b8e54bcbb60a392b4c88bfcd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3395dad8b8e54bcbb60a392b4c88bfcd-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d42b6a21e4a841fd952a64d5dd398338-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d42b6a21e4a841fd952a64d5dd398338-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -15986,7 +15992,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1cb136e3f5334a349016b4f2de813b79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cb136e3f5334a349016b4f2de813b79-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/baa5c9339cd5471c997cda7dcf6956ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baa5c9339cd5471c997cda7dcf6956ac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16004,7 +16010,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f6436dfb7eb4c6abe1a2b2d9450fe72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f6436dfb7eb4c6abe1a2b2d9450fe72-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a656a8cd7085425bb6aafd96606606e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a656a8cd7085425bb6aafd96606606e0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16022,7 +16028,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/71088b1ea3ff48b29d69bab1eeff4fa2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/71088b1ea3ff48b29d69bab1eeff4fa2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1b9f45be3d441c59c99bc4244d5f400-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1b9f45be3d441c59c99bc4244d5f400-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16040,7 +16046,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ac4777a9c0a24973a213b8e0e4082925-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac4777a9c0a24973a213b8e0e4082925-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba4220cf657b4a2bb6ab243731be3e9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba4220cf657b4a2bb6ab243731be3e9d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16058,7 +16064,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a41cd974cc724af3a633b9c31f7bf5af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a41cd974cc724af3a633b9c31f7bf5af-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ccbb128c723047a5a655316bad597437-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ccbb128c723047a5a655316bad597437-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16076,7 +16082,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fbdffc89d7964d47a912740fb091354b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbdffc89d7964d47a912740fb091354b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4afb1ef3fafd43cda4a38b9e88a92397-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4afb1ef3fafd43cda4a38b9e88a92397-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16094,7 +16100,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ddb5ecda5cfe4362a03d867f27833ad2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ddb5ecda5cfe4362a03d867f27833ad2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/27fc2ee155b54bc38f1fb13364eea40d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27fc2ee155b54bc38f1fb13364eea40d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16112,7 +16118,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/503f79f9064f46d1933558f11b66f5a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/503f79f9064f46d1933558f11b66f5a8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/afee7095f1774e71b24b7d61f2d2f085-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afee7095f1774e71b24b7d61f2d2f085-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16130,7 +16136,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbeb9b453613461199cff124c669c297-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbeb9b453613461199cff124c669c297-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f19e8a2e5967404081a57e83bc2c3df4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f19e8a2e5967404081a57e83bc2c3df4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16148,7 +16154,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bd4bc6f7884b446089485f4e9393801d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd4bc6f7884b446089485f4e9393801d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/25c0388b52e340f78627823301ca735c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/25c0388b52e340f78627823301ca735c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16166,7 +16172,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/39ea0259f5e64deea6d39397041d35b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39ea0259f5e64deea6d39397041d35b1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a850b999761f47c49ac65eaef45006fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a850b999761f47c49ac65eaef45006fb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16184,7 +16190,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fe8726803db942d6b7ec59bffa4d5d50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe8726803db942d6b7ec59bffa4d5d50-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/abe48837a691474aa913840badfe4359-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abe48837a691474aa913840badfe4359-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16202,7 +16208,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d0f14d7e05cd43ef8d97255e8fc270c8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0f14d7e05cd43ef8d97255e8fc270c8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4280a9288d734f2e9c213502a1977022-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4280a9288d734f2e9c213502a1977022-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16220,7 +16226,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1b2b85c48a9d40f39cf4727d30083482-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b2b85c48a9d40f39cf4727d30083482-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6811fa1e45f24d538dd99f83b2873a77-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6811fa1e45f24d538dd99f83b2873a77-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16238,7 +16244,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/781f5e58d0df485db7c64d35ba58d5a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/781f5e58d0df485db7c64d35ba58d5a2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ebfe63e1df9646579d331a9d2dbb2ee8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ebfe63e1df9646579d331a9d2dbb2ee8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16256,7 +16262,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53b2fe47a76d4f08abc6f4739ac3da03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53b2fe47a76d4f08abc6f4739ac3da03-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/192b400f8bdb476492d577ea693c63c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/192b400f8bdb476492d577ea693c63c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16274,7 +16280,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3cdce5d5dbf64a74a6dbc70c3c831c33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3cdce5d5dbf64a74a6dbc70c3c831c33-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b1a3877d5cf49c9aeba5bc30294512c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b1a3877d5cf49c9aeba5bc30294512c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16292,7 +16298,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8f7355f38894d2fb2511489a503b42a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8f7355f38894d2fb2511489a503b42a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0bdb81d2fcab40acbc64bc86ab4970f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0bdb81d2fcab40acbc64bc86ab4970f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16310,7 +16316,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8348c0d8a56442afb07b9195133479ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8348c0d8a56442afb07b9195133479ae-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e136bd43c54946e98bf147e506c87afc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e136bd43c54946e98bf147e506c87afc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16328,7 +16334,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/81ccff339b624585b6e5229ddded6bc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81ccff339b624585b6e5229ddded6bc4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d47e8747a33d4349a7e3a3abb45da46f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d47e8747a33d4349a7e3a3abb45da46f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16346,7 +16352,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/84ded7a652ec4aa48c108a05e8b24383-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84ded7a652ec4aa48c108a05e8b24383-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3f4e7067786d4c23a601fc7bd5990192-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f4e7067786d4c23a601fc7bd5990192-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16364,7 +16370,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6fa795f331c24c8682d033744dfd510b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fa795f331c24c8682d033744dfd510b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e22dada7eed4b7499f5e0f81e946d5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e22dada7eed4b7499f5e0f81e946d5e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16382,7 +16388,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ab25d94848a4927b0ebb48ca4e414d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ab25d94848a4927b0ebb48ca4e414d8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/04f40b8909da410ebaece930ded2112c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04f40b8909da410ebaece930ded2112c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16400,7 +16406,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e242b243a863456798f23a9604879266-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e242b243a863456798f23a9604879266-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b9c1f7c7df0945e8a9a823de78598921-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9c1f7c7df0945e8a9a823de78598921-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16418,7 +16424,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4864c86aff44475fa1593cf2bab8e492-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4864c86aff44475fa1593cf2bab8e492-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ccb7c77c359f4f0b9c6cae95b46a86b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ccb7c77c359f4f0b9c6cae95b46a86b5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16436,7 +16442,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7dadf1a7ef82488c8e75529708f17671-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7dadf1a7ef82488c8e75529708f17671-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f9f2798471464308adba375191562ef2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f2798471464308adba375191562ef2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16448,13 +16454,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b2d737b15a65434d90e4f7d9cc36f633-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2d737b15a65434d90e4f7d9cc36f633-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6a42c9b9467d4ba3adcb7e76e39fb1d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a42c9b9467d4ba3adcb7e76e39fb1d0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16472,7 +16478,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/955dcaabc3d0407a9d4a4065eb168b44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/955dcaabc3d0407a9d4a4065eb168b44-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3501d15c74e3450ba83d0a8f1033e7f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3501d15c74e3450ba83d0a8f1033e7f1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16490,7 +16496,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/723b87ff1466478daf127d3c0b727914-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/723b87ff1466478daf127d3c0b727914-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/547cd3d7972e46b9a085ecfc47e7e22d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/547cd3d7972e46b9a085ecfc47e7e22d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16508,7 +16514,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/efed4645d7694412a87e44f374df55e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efed4645d7694412a87e44f374df55e1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f035cd79666c4361b41ba75a3392ed6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f035cd79666c4361b41ba75a3392ed6d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16526,7 +16532,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/98a087b3b9724f569ba44e4c71f65ccc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98a087b3b9724f569ba44e4c71f65ccc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/853a38a249da40cbb83d17eb4c366460-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/853a38a249da40cbb83d17eb4c366460-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16544,7 +16550,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c25a1ff12dd9475ba076485907fa7208-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c25a1ff12dd9475ba076485907fa7208-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ad0d87f504cd43d78925d3fedf435267-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad0d87f504cd43d78925d3fedf435267-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16562,7 +16568,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32dc2c03494e4068b6a5a3652a64e76c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32dc2c03494e4068b6a5a3652a64e76c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dd8ccb240dd841ab986834fa1d6eae3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd8ccb240dd841ab986834fa1d6eae3c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16580,7 +16586,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dac5b02868aa492980d8a2ec693b6f7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dac5b02868aa492980d8a2ec693b6f7c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a23efb6884c4407c8c1c013788819679-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a23efb6884c4407c8c1c013788819679-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16598,7 +16604,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/23923074fbbe49e0b61e5c31b457b905-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23923074fbbe49e0b61e5c31b457b905-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f40b03dc7df9434bbe8882cb09127c9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f40b03dc7df9434bbe8882cb09127c9c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16616,7 +16622,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef75b270a72241c59ac744afc697c658-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef75b270a72241c59ac744afc697c658-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/013c62cfe2d1415c9a234b4261afedb5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/013c62cfe2d1415c9a234b4261afedb5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16634,7 +16640,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/972b92b7691248a986e79ba444f04b17-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/972b92b7691248a986e79ba444f04b17-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/154bf0774fbf4689a7aab046bfc753d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/154bf0774fbf4689a7aab046bfc753d2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16652,7 +16658,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/246cd69bd9e841d196aad349573460a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/246cd69bd9e841d196aad349573460a2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f8ad9a8f07a8463abc4de76f1dbf4b5d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8ad9a8f07a8463abc4de76f1dbf4b5d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16670,7 +16676,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c4fd187a4cb54930b2b771f94f1eec1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4fd187a4cb54930b2b771f94f1eec1f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cbc150e76da446719a4284d885d8e298-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbc150e76da446719a4284d885d8e298-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16688,7 +16694,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4afbd13492414ac094ce4bbc464ba872-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4afbd13492414ac094ce4bbc464ba872-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc7df48e9b03498d8f7de1ff56a56823-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc7df48e9b03498d8f7de1ff56a56823-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16706,7 +16712,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bd43e65fce00482dbc9f314f8ec18cef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd43e65fce00482dbc9f314f8ec18cef-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f0a2cd67daf14d8fafbb83d3cc16913a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0a2cd67daf14d8fafbb83d3cc16913a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16724,7 +16730,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f321f05b417e43abbb7bb22d97e67174-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f321f05b417e43abbb7bb22d97e67174-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7659b7fdbf1840f284077a9b592a6305-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7659b7fdbf1840f284077a9b592a6305-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16742,7 +16748,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7651eb0f0f2a410397ecbac693910604-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7651eb0f0f2a410397ecbac693910604-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d5e10bc8e23347d692be4456d8d56c54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5e10bc8e23347d692be4456d8d56c54-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16760,7 +16766,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ca1d249019f14f0cb8f3634b9873eb3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca1d249019f14f0cb8f3634b9873eb3b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba5270b05dbb4d0391f05c9ec11cf1c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba5270b05dbb4d0391f05c9ec11cf1c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16778,7 +16784,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4dc3af56b2194bbab2166cfb2d19d7a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4dc3af56b2194bbab2166cfb2d19d7a0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/311d34e4dfda42fe9628d9f4c377931d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/311d34e4dfda42fe9628d9f4c377931d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16796,7 +16802,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f407d16f3ff94ea0a66c606155f83b58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f407d16f3ff94ea0a66c606155f83b58-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b23621a41462456cafb4b3412357a37b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b23621a41462456cafb4b3412357a37b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16814,7 +16820,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/33618bf9951441ac8cd0004249df8d57-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33618bf9951441ac8cd0004249df8d57-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7e0060bffb9d4e758be022f7d82c7117-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e0060bffb9d4e758be022f7d82c7117-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16832,7 +16838,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/24e5cb9789444201916961f2cb51cfff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24e5cb9789444201916961f2cb51cfff-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f77b335f420b4880a9582a14e0d720cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f77b335f420b4880a9582a14e0d720cd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16852,7 +16858,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/65c53000282d40d4b07f7fad511fc934-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65c53000282d40d4b07f7fad511fc934-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/60cf92e3eb104d77809c068129de1732-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60cf92e3eb104d77809c068129de1732-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16870,7 +16876,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ad3e4f234f440fab0fc015813e1a71b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ad3e4f234f440fab0fc015813e1a71b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73692049cff6405cb641b38a24134d27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73692049cff6405cb641b38a24134d27-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16888,7 +16894,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a11d0c93ce1c4407967102b5402f65c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a11d0c93ce1c4407967102b5402f65c2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/468755c9b414435886545cda25ff0c0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/468755c9b414435886545cda25ff0c0e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16906,7 +16912,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4acb6dd3750c4e1b8e290df0d01b95a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4acb6dd3750c4e1b8e290df0d01b95a1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dff843b2f5b04f1ea68ee7045289cc61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dff843b2f5b04f1ea68ee7045289cc61-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16924,7 +16930,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c105518ab53749aaa8e3c475b5264c2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c105518ab53749aaa8e3c475b5264c2a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8450f947138b41f8b7220d248f699d61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8450f947138b41f8b7220d248f699d61-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16942,7 +16948,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b1d4589382f49aab6f912f3ded8e610-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b1d4589382f49aab6f912f3ded8e610-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/44df967bba2c45db806b4449f5203bcb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44df967bba2c45db806b4449f5203bcb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16960,7 +16966,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b450efebbfbd4bec953510f310141f41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b450efebbfbd4bec953510f310141f41-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c7c8191c798435489664e0d610ec4f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c7c8191c798435489664e0d610ec4f3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16978,7 +16984,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a90e5d5af84d43f198f4e0c3a2752c39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a90e5d5af84d43f198f4e0c3a2752c39-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/63a51b853a5a4ec088a0cda3c14c04f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63a51b853a5a4ec088a0cda3c14c04f6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -16996,7 +17002,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9f784e0d01db4a9a9dc185aee229d711-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f784e0d01db4a9a9dc185aee229d711-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ba2d2df195074a3b9d9f68615bc56d31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba2d2df195074a3b9d9f68615bc56d31-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17014,7 +17020,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5df0a0b35b8746c3b0662ab961afabb5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5df0a0b35b8746c3b0662ab961afabb5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5d64451bfc42411c8ee32c37689cabfc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d64451bfc42411c8ee32c37689cabfc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17032,7 +17038,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6fe2d1da94fa4251a6d6160b2869e030-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fe2d1da94fa4251a6d6160b2869e030-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f880ec6badf64ea087c3db5c96a0b11f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f880ec6badf64ea087c3db5c96a0b11f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17050,7 +17056,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bfb294de6fa74285bd3091f6ad8095a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfb294de6fa74285bd3091f6ad8095a3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1620791b508449daa9215a454862dd56-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1620791b508449daa9215a454862dd56-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17068,7 +17074,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/395e8b3d99f548a99948f29268053519-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/395e8b3d99f548a99948f29268053519-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/513c86bdec80417582132033293fca8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/513c86bdec80417582132033293fca8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17086,7 +17092,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c26a5545213d40a18dcf293d3741db53-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c26a5545213d40a18dcf293d3741db53-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5418bf13e174b28bfae7bd37c43c037-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5418bf13e174b28bfae7bd37c43c037-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17104,7 +17110,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c258f10896cb4b59a606132cbfd4f56b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c258f10896cb4b59a606132cbfd4f56b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/194e22d3802d4653a5cb79af0c5a5f2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/194e22d3802d4653a5cb79af0c5a5f2f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17122,7 +17128,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5343591d6d7e4f30962961c0cc44aa75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5343591d6d7e4f30962961c0cc44aa75-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8434b5836954411ab55a72b48430f6ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8434b5836954411ab55a72b48430f6ea-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17140,7 +17146,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f443d5c8759944eb9d05594d0ba5bc3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f443d5c8759944eb9d05594d0ba5bc3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c3b1cc2b89374b21a2d70fe05193e40c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3b1cc2b89374b21a2d70fe05193e40c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17158,7 +17164,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7a9f679cc7094cf5b1eab228003006d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a9f679cc7094cf5b1eab228003006d9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b75bc81277dc4f52ae0ad166e6ae3c94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b75bc81277dc4f52ae0ad166e6ae3c94-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17176,7 +17182,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3de19c928df74b6da3a3b5b521761505-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3de19c928df74b6da3a3b5b521761505-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f526bb999944407b547e2fff21d5a95-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f526bb999944407b547e2fff21d5a95-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17194,7 +17200,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3bf27b84925b4ea5959334026dc9fe71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3bf27b84925b4ea5959334026dc9fe71-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6075445919744fee9e10e602cb171b92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6075445919744fee9e10e602cb171b92-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17212,7 +17218,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/69442bd1ee5c4957ad4fb4a422ac963c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69442bd1ee5c4957ad4fb4a422ac963c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e6866d4cbca74d66ba1644271fd79d9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6866d4cbca74d66ba1644271fd79d9a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17230,7 +17236,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6aac48d05a0440bcad24cd33b7d3c820-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6aac48d05a0440bcad24cd33b7d3c820-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/89123a74727e4a0b8fc24d3e1f8411f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89123a74727e4a0b8fc24d3e1f8411f2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17248,7 +17254,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f12eb6f17256456bb62cfdc9138409ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f12eb6f17256456bb62cfdc9138409ed-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d37f3c9ca824c0f8fd8fc1407ff220c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d37f3c9ca824c0f8fd8fc1407ff220c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17266,7 +17272,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f953de4cd94740aba7bac4cc93cef0de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f953de4cd94740aba7bac4cc93cef0de-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b49920aa6664a77bcef36e1a493434d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b49920aa6664a77bcef36e1a493434d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17284,7 +17290,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f385674b34ad4b4aacca8f327124abe3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f385674b34ad4b4aacca8f327124abe3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b09bec97d5264179929279b0705e1bf4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b09bec97d5264179929279b0705e1bf4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17302,7 +17308,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/763ff33c84e644e499ae73bc7c3765f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/763ff33c84e644e499ae73bc7c3765f1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1c4f39862784908bc0b41ca72f190cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1c4f39862784908bc0b41ca72f190cf-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17320,7 +17326,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/17fd0f67ab81463eacda89a8623469f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17fd0f67ab81463eacda89a8623469f7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57d36e247d824145a5c2f497bf8088e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57d36e247d824145a5c2f497bf8088e2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17338,7 +17344,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1260f42a4f5043c3a5d302ff3fa9785c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1260f42a4f5043c3a5d302ff3fa9785c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32db34be8dbe43d2ab9540d6d6fd1ac7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32db34be8dbe43d2ab9540d6d6fd1ac7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17356,7 +17362,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d00020eaacbb4306acd577ac2593706c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d00020eaacbb4306acd577ac2593706c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/85d80e0583394fa4af97c47a679f168f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85d80e0583394fa4af97c47a679f168f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17374,7 +17380,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/36f007a40844468fb005ac2439f222b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36f007a40844468fb005ac2439f222b9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e54a046588f40c897cd78e8cc67549c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e54a046588f40c897cd78e8cc67549c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17392,7 +17398,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/64776df3844c4d57bd9addabc72fedfc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64776df3844c4d57bd9addabc72fedfc-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e1bc59b38e4342b6a20ac2c0bda949f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1bc59b38e4342b6a20ac2c0bda949f6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17410,7 +17416,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5ca88f7fcb9d451298c2f87f81c3520f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ca88f7fcb9d451298c2f87f81c3520f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/773a953dda58433aa261ecb7d59d336b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/773a953dda58433aa261ecb7d59d336b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17428,7 +17434,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/79712257ecb646f3a4b682ec8c9fdf14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79712257ecb646f3a4b682ec8c9fdf14-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a8b8226be4e6466f9553798ed756a416-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8b8226be4e6466f9553798ed756a416-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17438,15 +17444,15 @@ "Problem MODEL has 6 rows, 11 columns and 40 elements\n", "Coin0008I MODEL read with 0 errors\n", "Option for timeMode changed from cpu to elapsed\n", - "Problem is infeasible - 0.00 seconds\n", + "Problem is infeasible - 0.01 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/58ad8aa427a94ef98cb9e88ae16e3051-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58ad8aa427a94ef98cb9e88ae16e3051-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/45824060c51343b48f32b2703d00eb53-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45824060c51343b48f32b2703d00eb53-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17456,15 +17462,15 @@ "Problem MODEL has 6 rows, 11 columns and 40 elements\n", "Coin0008I MODEL read with 0 errors\n", "Option for timeMode changed from cpu to elapsed\n", - "Problem is infeasible - 0.00 seconds\n", + "Problem is infeasible - 0.01 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be8e57f0b09a464695f227d27526e3f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be8e57f0b09a464695f227d27526e3f1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6eb5b2e0603b47708c437068255f2b8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6eb5b2e0603b47708c437068255f2b8c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17482,7 +17488,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5c82410b74d7436b830e6cf0002be063-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c82410b74d7436b830e6cf0002be063-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c468314eed740b09f48b66d2e037661-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c468314eed740b09f48b66d2e037661-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17500,7 +17506,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a3647fdc81414911a596bd1c3a4dc527-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3647fdc81414911a596bd1c3a4dc527-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/50278a8a5431464198e232e740368203-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50278a8a5431464198e232e740368203-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17518,7 +17524,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/840bcb647cd1463a9e3fafb9b21e5077-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/840bcb647cd1463a9e3fafb9b21e5077-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9935ffd5c2fe4ba59c034d291cafb7d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9935ffd5c2fe4ba59c034d291cafb7d2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17536,7 +17542,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/408f8f92807f4cc6b7c06ecf59cbc849-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/408f8f92807f4cc6b7c06ecf59cbc849-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8a31e2ff858d4cf38cea4ce79c857d0c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a31e2ff858d4cf38cea4ce79c857d0c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17554,7 +17560,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e8092fa4cf834cd4994c97781d600b27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8092fa4cf834cd4994c97781d600b27-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9bda512a742646ed8604437a833b307b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bda512a742646ed8604437a833b307b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17572,7 +17578,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/347ffd782cb44922bf44c599a0c09a3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/347ffd782cb44922bf44c599a0c09a3a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7c524c62ed6a43dc9cead8b7b129874b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c524c62ed6a43dc9cead8b7b129874b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17590,7 +17596,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2453387d8b54437b898d1d8bae52ddb8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2453387d8b54437b898d1d8bae52ddb8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/012da964533b412497c8b5b20b0848b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/012da964533b412497c8b5b20b0848b6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17608,7 +17614,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/373222932f63400a99c937eecaaba549-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/373222932f63400a99c937eecaaba549-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ae7f4f2d7264affa0ba1f23ab6fadb9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ae7f4f2d7264affa0ba1f23ab6fadb9-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17626,7 +17632,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fb15987c05a345afb1a51b98a0543f6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb15987c05a345afb1a51b98a0543f6d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0209ca7dc1d44e9db76ac0a19784009e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0209ca7dc1d44e9db76ac0a19784009e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17644,7 +17650,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2507f6afe3ab431c8f469c23ac3c5779-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2507f6afe3ab431c8f469c23ac3c5779-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/070f3379961f44d1b573370bd46ca86b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/070f3379961f44d1b573370bd46ca86b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17662,7 +17668,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e79f0607c2cb4020bc857776f4249196-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e79f0607c2cb4020bc857776f4249196-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/810086ec45d146f9967c945889cdccfc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/810086ec45d146f9967c945889cdccfc-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17680,7 +17686,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/68834f69a39345e4b76a51ae6e4bf732-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68834f69a39345e4b76a51ae6e4bf732-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/040dc1f7b12b4dde99b4e0adc2ef9ce0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/040dc1f7b12b4dde99b4e0adc2ef9ce0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17698,7 +17704,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd201bfb3e27418582786dc968cb730c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd201bfb3e27418582786dc968cb730c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3326b80320074949b4a311cbc104355d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3326b80320074949b4a311cbc104355d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17716,7 +17722,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/13ce369ea98d40c98d08be83dc31c47b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13ce369ea98d40c98d08be83dc31c47b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00779548df364b078465781fb0b63dcd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00779548df364b078465781fb0b63dcd-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17734,7 +17740,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a260f49abf8d4c4797f5337381549f19-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a260f49abf8d4c4797f5337381549f19-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f34e432887eb49e1a086a6f0412e2f36-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f34e432887eb49e1a086a6f0412e2f36-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17752,7 +17758,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/14ec0a6f2f594ffca8b078cd79e3550e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14ec0a6f2f594ffca8b078cd79e3550e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ecc794cf67cb4f5e9c40a9a8e32651ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecc794cf67cb4f5e9c40a9a8e32651ee-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17770,7 +17776,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae9eabcec4024d008ff9ebf2ff8c1c48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae9eabcec4024d008ff9ebf2ff8c1c48-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ef004e4d3cb54823958f900720949f6c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef004e4d3cb54823958f900720949f6c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17788,7 +17794,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9d3cd612c33c4b279ade7f3f5dc9506f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d3cd612c33c4b279ade7f3f5dc9506f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab54737dd9ff44148b348ead5c6e4764-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab54737dd9ff44148b348ead5c6e4764-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17806,7 +17812,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4335a35c4944eb8b1b4b37f90f41c33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4335a35c4944eb8b1b4b37f90f41c33-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/812e0a7ede3449808c12a9f0079faa0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/812e0a7ede3449808c12a9f0079faa0b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17824,7 +17830,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/30df3ab81f954c4fa1489a33fe38c54e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30df3ab81f954c4fa1489a33fe38c54e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7acac09389e24c42b3540ec4b44f4b09-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7acac09389e24c42b3540ec4b44f4b09-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17842,7 +17848,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1d77c229b16b4420962687d50e2bd9d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d77c229b16b4420962687d50e2bd9d3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8c66cf8bdb4945438fdb9a402fc99382-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c66cf8bdb4945438fdb9a402fc99382-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17860,7 +17866,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/370212dd7ab54206a62f83ed7fa9c619-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/370212dd7ab54206a62f83ed7fa9c619-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd536713856b4ed7ab7dd162b53d027c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd536713856b4ed7ab7dd162b53d027c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17878,7 +17884,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e395fd8d55494951a2eaa9306ec6bc0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e395fd8d55494951a2eaa9306ec6bc0d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e07133a0e2a740c2853783141b4a0fb1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e07133a0e2a740c2853783141b4a0fb1-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17896,7 +17902,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c75c0954550c49a692770ce33cf9fe34-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c75c0954550c49a692770ce33cf9fe34-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bcb9668d92aa49e593b6f907e89f866d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcb9668d92aa49e593b6f907e89f866d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17914,7 +17920,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/72d3505e1a6f400d98f72631b0fea265-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72d3505e1a6f400d98f72631b0fea265-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/61538e3bdcb745a7923b70de5cd4e98c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/61538e3bdcb745a7923b70de5cd4e98c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17932,7 +17938,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/91d659c184914440aea03e22763237f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91d659c184914440aea03e22763237f8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ff805ed15ae54773bbcb2cdfa9d92fdb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff805ed15ae54773bbcb2cdfa9d92fdb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17950,7 +17956,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2fbca6e3a8584dd8b7d409e44f473faa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2fbca6e3a8584dd8b7d409e44f473faa-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5bb48e44c7d4478d841ceb2aa539862a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bb48e44c7d4478d841ceb2aa539862a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17968,7 +17974,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d15769a507e24558b26af165d07e0d81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d15769a507e24558b26af165d07e0d81-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5413e271e5dc4bc1bba659adab7471bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5413e271e5dc4bc1bba659adab7471bb-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -17986,7 +17992,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/abc11db3cde44ebdad521d78a6ef66a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abc11db3cde44ebdad521d78a6ef66a4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c918a3b609be4910a2958a68193f8e1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c918a3b609be4910a2958a68193f8e1a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18004,7 +18010,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b5b28090dc34c2ebbe4f2f489770f90-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b5b28090dc34c2ebbe4f2f489770f90-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f46209c726bd4b0d90cfedbfe46bd1c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f46209c726bd4b0d90cfedbfe46bd1c7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18022,7 +18028,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4f6cec88218f4de3a9d8cf75a751ff99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f6cec88218f4de3a9d8cf75a751ff99-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ff417b8b7a44f3daa578299aceb8bbe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ff417b8b7a44f3daa578299aceb8bbe-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18040,7 +18046,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae1bcee4c8d94b8d9e1d09b5a02a5f35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae1bcee4c8d94b8d9e1d09b5a02a5f35-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ba20e6f78214294a13c019aaa2f913e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ba20e6f78214294a13c019aaa2f913e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18058,7 +18064,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cdb024265a5049e69d41e39450e9253d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdb024265a5049e69d41e39450e9253d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b852a8e705d242d8ad8e37410499b92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b852a8e705d242d8ad8e37410499b92d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18076,7 +18082,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cefe84b0f7ce434289ad6e258245748a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cefe84b0f7ce434289ad6e258245748a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32423aeb8de8476a9ddd6c4961e28a64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32423aeb8de8476a9ddd6c4961e28a64-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18094,7 +18100,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00405506154c4b13a4bda2b27b6aa3e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00405506154c4b13a4bda2b27b6aa3e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6be115330a9e4ca29fecad44a30e495e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6be115330a9e4ca29fecad44a30e495e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18112,7 +18118,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/be863a9ccaa44edcad9cdab429667915-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be863a9ccaa44edcad9cdab429667915-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/232ac9a5bb064a688e21dc9e863c6e3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/232ac9a5bb064a688e21dc9e863c6e3b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18130,7 +18136,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/56b4466fcff7405db14673d85d317dc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56b4466fcff7405db14673d85d317dc9-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fb55c463c6274e349ee42d3f38faff12-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb55c463c6274e349ee42d3f38faff12-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18148,7 +18154,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd7287e81f514ee0b3db3e78808dd138-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd7287e81f514ee0b3db3e78808dd138-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/73228163de4b4b69b6ac988c7ec6c665-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73228163de4b4b69b6ac988c7ec6c665-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18166,7 +18172,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/129af26b8d6f4fe5a75e5d40bc7301c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/129af26b8d6f4fe5a75e5d40bc7301c6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7ecd2937ecf647cf874c170ea00711f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ecd2937ecf647cf874c170ea00711f5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18184,7 +18190,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8e82eed9433f42599fdf5084f849b21d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e82eed9433f42599fdf5084f849b21d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2d0bd041751c44448d36bc28fc4fd776-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d0bd041751c44448d36bc28fc4fd776-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18202,7 +18208,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8f0cfa007fd0448fb33e62ae99e9a49c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f0cfa007fd0448fb33e62ae99e9a49c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c1f2bdbe2f8f4db49f1612232155611d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c1f2bdbe2f8f4db49f1612232155611d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18220,7 +18226,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/545fcbdfc2c24b63a215e438eb6bf15a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/545fcbdfc2c24b63a215e438eb6bf15a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f6b619f52933455bbb9be02e270d750b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6b619f52933455bbb9be02e270d750b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18238,7 +18244,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a18b9a8e62c74031a49d2c253578d375-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a18b9a8e62c74031a49d2c253578d375-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0914c4d3b4d34f14b83f89f90514d7d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0914c4d3b4d34f14b83f89f90514d7d3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18256,7 +18262,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/20edf09633a348769e5fbe4b991c7497-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20edf09633a348769e5fbe4b991c7497-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4215f4635a294104a0ce96446ec93afe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4215f4635a294104a0ce96446ec93afe-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18274,7 +18280,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/500ec4f433644c3087349ac450795b2d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/500ec4f433644c3087349ac450795b2d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2c37c089c14244df95ee144d7d59eb33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c37c089c14244df95ee144d7d59eb33-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18292,7 +18298,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4f4a410470414301aa0a9e4fd2d61ea1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f4a410470414301aa0a9e4fd2d61ea1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0a0da111af248ae8f4487dd68759b0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0a0da111af248ae8f4487dd68759b0b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18310,7 +18316,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a816ef3b2dfb4b8094f4f88c16116719-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a816ef3b2dfb4b8094f4f88c16116719-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b42314d9dac442d79138fac23f8ab270-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b42314d9dac442d79138fac23f8ab270-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18328,7 +18334,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1d8eddc05ece48a995ffda92a3e83c79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d8eddc05ece48a995ffda92a3e83c79-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7d2f353b16c24e259d6298abdff22679-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d2f353b16c24e259d6298abdff22679-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18346,7 +18352,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2404585b911d456cbb303241502f45a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2404585b911d456cbb303241502f45a4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf493651442745e7b4d8f408093ec38f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf493651442745e7b4d8f408093ec38f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18364,7 +18370,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cc31a622f085435c9aed78dc2c1a14a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc31a622f085435c9aed78dc2c1a14a7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c8e803658534ca39f09e61b74b17c32-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c8e803658534ca39f09e61b74b17c32-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18376,13 +18382,13 @@ "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", "\n", "Welcome to the CBC MILP Solver \n", "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1e6b668f8a9c4f468482f041b7ddc9ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e6b668f8a9c4f468482f041b7ddc9ee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dbec9f826616447ab9c19df4221f1c11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbec9f826616447ab9c19df4221f1c11-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18400,7 +18406,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/709057086a3d4de58f073dd0758dccab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/709057086a3d4de58f073dd0758dccab-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c59ad4aef2647ae9659407193ed7bb8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c59ad4aef2647ae9659407193ed7bb8-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18418,7 +18424,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f81872b21530495fbf89fdce89c16898-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f81872b21530495fbf89fdce89c16898-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f843b1f45b954a148b97cefa4c8161ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f843b1f45b954a148b97cefa4c8161ec-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18436,7 +18442,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d6da9d29515646e0b5349290fd0902b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6da9d29515646e0b5349290fd0902b7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c02079685de94149a9753ea4a5407d7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c02079685de94149a9753ea4a5407d7a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18454,7 +18460,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab27049021144c649c470805d3045501-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab27049021144c649c470805d3045501-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3026586a80634144b5800f048c8e7614-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3026586a80634144b5800f048c8e7614-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18472,7 +18478,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b090d6e630234725aef0124919dd0c4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b090d6e630234725aef0124919dd0c4b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d8107b60913c4c29bc5cbcd168068245-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8107b60913c4c29bc5cbcd168068245-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18490,7 +18496,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/45b48418ac394d43a24dad44f1ca8162-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45b48418ac394d43a24dad44f1ca8162-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9d99fcc29754815975bd0b2f1b48e20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9d99fcc29754815975bd0b2f1b48e20-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18508,7 +18514,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e7f982da1c724bd39a4002242de024b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e7f982da1c724bd39a4002242de024b3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5fdea6ebd7574f4581216cc79cad1f6c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5fdea6ebd7574f4581216cc79cad1f6c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18526,7 +18532,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/20386972fe0049eba213ba596aae9a87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20386972fe0049eba213ba596aae9a87-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f6680890449043969001f7eb647481a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6680890449043969001f7eb647481a6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18544,7 +18550,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6b6cf788eff64b8192c73487ee13f42b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b6cf788eff64b8192c73487ee13f42b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fd5d38ace7e8415dac5533d97fb691d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd5d38ace7e8415dac5533d97fb691d0-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18562,7 +18568,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f3c5eda2f75f4efe9db2ab693f9a1229-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3c5eda2f75f4efe9db2ab693f9a1229-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/600a00f0eae245b4b19be4c7004f31af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/600a00f0eae245b4b19be4c7004f31af-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18580,7 +18586,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/7dd0b38f9d824f2dbf1729de99c82ee6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7dd0b38f9d824f2dbf1729de99c82ee6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/43d998a5323a4ac8a7346cd5954e295d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43d998a5323a4ac8a7346cd5954e295d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18598,7 +18604,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/77f1275a35334f0d899a1e6e76ee39f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77f1275a35334f0d899a1e6e76ee39f7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8016bce60333455f9ca47c21e9b3dea7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8016bce60333455f9ca47c21e9b3dea7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18616,7 +18622,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f7a262fdb9b04e7c98f6e4437bc7f7cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7a262fdb9b04e7c98f6e4437bc7f7cb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3136e9a9e77949b691cd1b7cf548d225-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3136e9a9e77949b691cd1b7cf548d225-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18634,7 +18640,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ab99e626f7484608b058226a6476fcd4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab99e626f7484608b058226a6476fcd4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/50aeb7ab7420497487de6908a0e54eca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50aeb7ab7420497487de6908a0e54eca-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18652,7 +18658,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8dd71462b5b14da291684b91774f9ff7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8dd71462b5b14da291684b91774f9ff7-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c462b95ef2944184af931e72854b227b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c462b95ef2944184af931e72854b227b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18670,7 +18676,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fa92ee860d63440e8bbeca80bf576241-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa92ee860d63440e8bbeca80bf576241-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8ab21969a93e4b5bb03b0e825d1f76ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ab21969a93e4b5bb03b0e825d1f76ef-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18688,7 +18694,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1d8866724bac45daa1e124b495a5db4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d8866724bac45daa1e124b495a5db4b-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/21dae29c98b94c459f038776c77bc941-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21dae29c98b94c459f038776c77bc941-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18706,7 +18712,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/39f150ab23404df08bcf30da932a61da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39f150ab23404df08bcf30da932a61da-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/796667d21d2f427398c16f3481acec99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/796667d21d2f427398c16f3481acec99-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18724,7 +18730,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8961189138f9437881c16068b3fa21e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8961189138f9437881c16068b3fa21e3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/79d30f6c12ff48f59a00c227bb08ea12-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79d30f6c12ff48f59a00c227bb08ea12-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18742,7 +18748,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/32f1e41eb98d49659b95ae052deb502c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32f1e41eb98d49659b95ae052deb502c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/029d9f421b5541bc99cc6a346b186ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/029d9f421b5541bc99cc6a346b186ed5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18760,7 +18766,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0e96aefc36834548825822e7863c04b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e96aefc36834548825822e7863c04b1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/eae29e476a974143a7f7c6d4be1a3609-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eae29e476a974143a7f7c6d4be1a3609-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18778,7 +18784,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/54f1c8ecb2bb49f2ab64ae3b3ff18f08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54f1c8ecb2bb49f2ab64ae3b3ff18f08-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e0911683e440433fa8334cf55a18b7c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0911683e440433fa8334cf55a18b7c5-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18796,7 +18802,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2ecc2deacaba40f398275166f8f87c5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ecc2deacaba40f398275166f8f87c5e-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0dcd281e376047d6b50c9792bb8e2657-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dcd281e376047d6b50c9792bb8e2657-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18814,7 +18820,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4047d114d1244cf88771a5dbdf9d3115-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4047d114d1244cf88771a5dbdf9d3115-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2b04df5f36314eb5b86470a566a4c887-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2b04df5f36314eb5b86470a566a4c887-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18832,7 +18838,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/836bbe10e2c247b081cbbe63845cdbd5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/836bbe10e2c247b081cbbe63845cdbd5-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e28189a287c640ad94796db33335544b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e28189a287c640ad94796db33335544b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18850,7 +18856,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c44647beea064db590b8f48ce1d77feb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c44647beea064db590b8f48ce1d77feb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0f6f1136bca445fd8eb6ac3a7982405c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f6f1136bca445fd8eb6ac3a7982405c-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18868,7 +18874,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5be9b3890ab34761933ff0b7182effcb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5be9b3890ab34761933ff0b7182effcb-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/072ee0798b8c45fcad77a52aa712daab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/072ee0798b8c45fcad77a52aa712daab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18886,7 +18892,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ee1ea0337bda494f876da5f75ee03ef4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ee1ea0337bda494f876da5f75ee03ef4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e4df141553df49d9a51ef9443e1a1e0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4df141553df49d9a51ef9443e1a1e0a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18904,7 +18910,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1cae732553cc4f27877f991ad24cd244-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cae732553cc4f27877f991ad24cd244-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dab36f1ad36142098b371a5538051170-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dab36f1ad36142098b371a5538051170-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18922,7 +18928,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ab2b8813e0f48f3b830275620cd8f66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ab2b8813e0f48f3b830275620cd8f66-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ae6663b8b18a4c13a07344ce6269d15f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae6663b8b18a4c13a07344ce6269d15f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18940,7 +18946,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2e7cc11b50e147fc83011d31f6133e6f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e7cc11b50e147fc83011d31f6133e6f-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a760dd896fa342c6bb52c20f875c773a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a760dd896fa342c6bb52c20f875c773a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18958,7 +18964,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1872ff1ae4a541df821ec8e3a2f81888-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1872ff1ae4a541df821ec8e3a2f81888-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b188b84f538c4aaca8e1fab064d46df6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b188b84f538c4aaca8e1fab064d46df6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18976,7 +18982,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bce9494c45034fe5a7e7ea7dc5f65aa1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bce9494c45034fe5a7e7ea7dc5f65aa1-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/264851f02e2e4f349dc78aa9f058a5e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/264851f02e2e4f349dc78aa9f058a5e7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -18994,7 +19000,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1177137dca7840eca704fba9db363a23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1177137dca7840eca704fba9db363a23-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/57d2190f850a469b96cc374b688c28ed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57d2190f850a469b96cc374b688c28ed-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19012,7 +19018,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0ecdde0f25f3453e8bd8857570481de2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ecdde0f25f3453e8bd8857570481de2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ffe2b672fbf84fa9b4937823039f2340-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffe2b672fbf84fa9b4937823039f2340-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19030,7 +19036,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/502f16f218734e199a2550f36f3dd528-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/502f16f218734e199a2550f36f3dd528-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ffa7ab38abdb453398366461c743a870-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffa7ab38abdb453398366461c743a870-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19048,7 +19054,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/030b47e670c54842a00583c46b087a99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/030b47e670c54842a00583c46b087a99-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6d28bebf4cb74f0a85ee4280e8573f23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d28bebf4cb74f0a85ee4280e8573f23-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19066,7 +19072,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/ea641d9885d44936ba5bb8fac3b60ef0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea641d9885d44936ba5bb8fac3b60ef0-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d74c697a163e439b8f683accde90ea18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d74c697a163e439b8f683accde90ea18-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19084,7 +19090,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1ad010d265794b3eb0dc70796f3daa2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ad010d265794b3eb0dc70796f3daa2c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/dba383a585cf4f9486b65b30a014bd8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dba383a585cf4f9486b65b30a014bd8f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19102,7 +19108,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc6423e409654bdc9656630be17c9796-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc6423e409654bdc9656630be17c9796-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/850e0e0da43e4101bd707bc7238c66c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/850e0e0da43e4101bd707bc7238c66c6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19120,7 +19126,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/2711d69a600d4a8295bcec285acafb97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2711d69a600d4a8295bcec285acafb97-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0d150b0109a948c4baa8ec56839573a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d150b0109a948c4baa8ec56839573a4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19138,7 +19144,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/00b7f6cdc0e342f0980e186a07c96fad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00b7f6cdc0e342f0980e186a07c96fad-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/29cba231ec8e4b55a4c91fdbe15b64d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29cba231ec8e4b55a4c91fdbe15b64d6-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19156,7 +19162,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cf510f4c7e2d4f3780ea6caec9895c16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf510f4c7e2d4f3780ea6caec9895c16-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c9e84acb769403e8ef057f10237deb7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c9e84acb769403e8ef057f10237deb7-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19174,7 +19180,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c2dce21f8494000b6efadbd5e860ce4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c2dce21f8494000b6efadbd5e860ce4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d77939a21457455f9be35bfd44016307-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d77939a21457455f9be35bfd44016307-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19192,7 +19198,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/d80b90f5b2b746c09e20e727bf783ca8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d80b90f5b2b746c09e20e727bf783ca8-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6ddaaeb87dea496893c002a84582f897-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ddaaeb87dea496893c002a84582f897-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19210,7 +19216,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/654ea3c66a064618b31a2a4dae755ca4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/654ea3c66a064618b31a2a4dae755ca4-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/068956a72ec3446cb9a6801260a59bac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/068956a72ec3446cb9a6801260a59bac-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19228,7 +19234,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/97afdc224e1b4396873dc19ca2530259-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97afdc224e1b4396873dc19ca2530259-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/8211c9dc26004a548c56adabcee7e7aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8211c9dc26004a548c56adabcee7e7aa-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19246,7 +19252,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5972f849c3e240a5be6cfd4982239564-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5972f849c3e240a5be6cfd4982239564-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8d0c6fe33bb497292522bcc090fe652-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8d0c6fe33bb497292522bcc090fe652-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19264,7 +19270,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b8ebefe52dbd48aca8f76d371f73f432-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b8ebefe52dbd48aca8f76d371f73f432-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e5d94f8891394b38b2b2d0b75812c437-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5d94f8891394b38b2b2d0b75812c437-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19282,7 +19288,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9c1dad9b78414db795c9086000273693-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c1dad9b78414db795c9086000273693-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/fc8d1624a4374eec9ee5cf801307173f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fc8d1624a4374eec9ee5cf801307173f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19300,7 +19306,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/3c50eaad901d4044b932b32454a37619-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c50eaad901d4044b932b32454a37619-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/53eaa766625941788baa0892548ffb6f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53eaa766625941788baa0892548ffb6f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19318,7 +19324,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/666b60fb80584ca0acb464ce1e1c026a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/666b60fb80584ca0acb464ce1e1c026a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/09bdd6000096436684aeb199695e14c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09bdd6000096436684aeb199695e14c4-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19336,7 +19342,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/1ce5df4e992e47ad99eb3ed171d4e7d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ce5df4e992e47ad99eb3ed171d4e7d6-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/af3ea97053a048898cf55c0f9c856f8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af3ea97053a048898cf55c0f9c856f8b-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19354,7 +19360,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/66c9494d612a4e1d9afa347d17b8d839-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/66c9494d612a4e1d9afa347d17b8d839-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/db9586d7ac6f447fa5af3301badf06e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db9586d7ac6f447fa5af3301badf06e2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -19377,7 +19383,7 @@ }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 7, "metadata": {}, "outputs": [ { @@ -19386,7 +19392,7 @@ "True" ] }, - "execution_count": 6, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } @@ -19411,9 +19417,21 @@ }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 8, "metadata": {}, - "outputs": [], + "outputs": [ + { + "ename": "ImportError", + "evalue": "cannot import name 'check_1_dataset_known_folds_mos_scores' from 'mlscorecheck.check' (/home/gykovacs/workspaces/mlscorecheck/mlscorecheck/check/__init__.py)", + "output_type": "error", + "traceback": [ + "\u001b[0;31m---------------------------------------------------------------------------\u001b[0m", + "\u001b[0;31mImportError\u001b[0m Traceback (most recent call last)", + "\u001b[1;32m/home/gykovacs/workspaces/mlscorecheck/notebooks/illustration/bundles/07_tpehg.ipynb Cell 11\u001b[0m line \u001b[0;36m2\n\u001b[1;32m 1\u001b[0m \u001b[39mfrom\u001b[39;00m \u001b[39mmlscorecheck\u001b[39;00m\u001b[39m.\u001b[39;00m\u001b[39maggregated\u001b[39;00m \u001b[39mimport\u001b[39;00m fold_partitioning_generator\n\u001b[0;32m----> 2\u001b[0m \u001b[39mfrom\u001b[39;00m \u001b[39mmlscorecheck\u001b[39;00m\u001b[39m.\u001b[39;00m\u001b[39mcheck\u001b[39;00m \u001b[39mimport\u001b[39;00m check_1_dataset_known_folds_mos_scores, check_1_dataset_unknown_folds_mos_scores\n", + "\u001b[0;31mImportError\u001b[0m: cannot import name 'check_1_dataset_known_folds_mos_scores' from 'mlscorecheck.check' (/home/gykovacs/workspaces/mlscorecheck/mlscorecheck/check/__init__.py)" + ] + } + ], "source": [ "from mlscorecheck.aggregated import fold_partitioning_generator\n", "from mlscorecheck.check import check_1_dataset_known_folds_mos_scores, check_1_dataset_unknown_folds_mos_scores" @@ -19421,7 +19439,7 @@ }, { "cell_type": "code", - "execution_count": 8, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -19432,7 +19450,7 @@ }, { "cell_type": "code", - "execution_count": 9, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -19446,7 +19464,7 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": null, "metadata": {}, "outputs": [ { @@ -19466,7 +19484,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": null, "metadata": {}, "outputs": [ { @@ -19486,7 +19504,7 @@ }, { "cell_type": "code", - "execution_count": 12, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -19499,7 +19517,7 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": null, "metadata": {}, "outputs": [ { @@ -19516,7 +19534,7 @@ }, { "cell_type": "code", - "execution_count": 14, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -19533,7 +19551,7 @@ }, { "cell_type": "code", - "execution_count": 15, + "execution_count": null, "metadata": {}, "outputs": [ { @@ -19553,7 +19571,7 @@ }, { "cell_type": "code", - "execution_count": 16, + "execution_count": null, "metadata": {}, "outputs": [ { diff --git a/notebooks/illustration/bundles/08_isic2016.ipynb b/notebooks/illustration/bundles/08_isic2016.ipynb index 400d3f0..a58cf67 100644 --- a/notebooks/illustration/bundles/08_isic2016.ipynb +++ b/notebooks/illustration/bundles/08_isic2016.ipynb @@ -13,7 +13,7 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.skinlesion import check_isic2016" + "from mlscorecheck.check.bundles.skinlesion import check_isic2016" ] }, { @@ -34,30 +34,30 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:44:09,399:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:44:09,401:INFO:calling the score check with scores {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145}, uncertainty 0.0001, p 75 and n 304\n", - "2023-10-26 23:44:09,402:INFO:checking the scores {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145}\n", - "2023-10-26 23:44:09,404:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:44:09,404:INFO:intervals before: (0, 75), (0, 304)\n", - "2023-10-26 23:44:09,405:INFO:the tp solutions: (21.98985, 22.00515)\n", - "2023-10-26 23:44:09,407:INFO:the tn solutions: (277.97259199999996, 278.06520800000004)\n", - "2023-10-26 23:44:09,409:INFO:intervals after: [(22, 22)], [(278, 278)]\n", - "2023-10-26 23:44:09,410:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-10-26 23:44:09,410:INFO:intervals before: [(22, 22)], [(278, 278)]\n", - "2023-10-26 23:44:09,411:INFO:the tp solutions: (21.938733999999954, 22.078066000000035)\n", - "2023-10-26 23:44:09,412:INFO:the tn solutions: (277.976992, 278.039008)\n", - "2023-10-26 23:44:09,413:INFO:intervals after: [(22, 22)], [(278, 278)]\n", - "2023-10-26 23:44:09,414:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-10-26 23:44:09,415:INFO:intervals before: [(22, 22)], [(278, 278)]\n", - "2023-10-26 23:44:09,415:INFO:the tp solutions: (21.98985, 22.00515)\n", - "2023-10-26 23:44:09,416:INFO:the tn solutions: (277.976992, 278.039008)\n", - "2023-10-26 23:44:09,417:INFO:intervals after: [(22, 22)], [(278, 278)]\n", - "2023-10-26 23:44:09,419:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-10-26 23:44:09,421:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-10-26 23:44:09,421:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-10-26 23:44:09,422:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:44:09,423:INFO:final number of intervals: 1\n", - "2023-10-26 23:44:09,424:INFO:final number of pairs: 1\n" + "2023-11-03 08:52:30,546:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:52:30,547:INFO:calling the score check with scores {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145}, uncertainty 0.0001, p 75 and n 304\n", + "2023-11-03 08:52:30,549:INFO:checking the scores {'acc': 0.7916, 'sens': 0.2933, 'spec': 0.9145}\n", + "2023-11-03 08:52:30,551:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:52:30,552:INFO:intervals before: (0, 75), (0, 304)\n", + "2023-11-03 08:52:30,554:INFO:the tp solutions: (21.98985, 22.00515)\n", + "2023-11-03 08:52:30,555:INFO:the tn solutions: (277.97259199999996, 278.06520800000004)\n", + "2023-11-03 08:52:30,557:INFO:intervals after: [(22, 22)], [(278, 278)]\n", + "2023-11-03 08:52:30,558:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 08:52:30,559:INFO:intervals before: [(22, 22)], [(278, 278)]\n", + "2023-11-03 08:52:30,560:INFO:the tp solutions: (21.938733999999954, 22.078066000000035)\n", + "2023-11-03 08:52:30,561:INFO:the tn solutions: (277.976992, 278.039008)\n", + "2023-11-03 08:52:30,561:INFO:intervals after: [(22, 22)], [(278, 278)]\n", + "2023-11-03 08:52:30,562:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 08:52:30,565:INFO:intervals before: [(22, 22)], [(278, 278)]\n", + "2023-11-03 08:52:30,566:INFO:the tp solutions: (21.98985, 22.00515)\n", + "2023-11-03 08:52:30,567:INFO:the tn solutions: (277.976992, 278.039008)\n", + "2023-11-03 08:52:30,567:INFO:intervals after: [(22, 22)], [(278, 278)]\n", + "2023-11-03 08:52:30,568:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 08:52:30,569:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 08:52:30,570:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 08:52:30,571:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:52:30,572:INFO:final number of intervals: 1\n", + "2023-11-03 08:52:30,574:INFO:final number of pairs: 1\n" ] }, { diff --git a/notebooks/illustration/bundles/09_isic2017.ipynb b/notebooks/illustration/bundles/09_isic2017.ipynb index 72f4202..43aee2d 100644 --- a/notebooks/illustration/bundles/09_isic2017.ipynb +++ b/notebooks/illustration/bundles/09_isic2017.ipynb @@ -13,7 +13,7 @@ "metadata": {}, "outputs": [], "source": [ - "from mlscorecheck.bundles.skinlesion import check_isic2017" + "from mlscorecheck.check.bundles.skinlesion import check_isic2017" ] }, { @@ -34,46 +34,46 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-10-26 23:44:15,476:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", - "2023-10-26 23:44:15,478:INFO:calling the score check with scores {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362}, uncertainty 0.0001, p 117 and n 483\n", - "2023-10-26 23:44:15,478:INFO:checking the scores {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362}\n", - "2023-10-26 23:44:15,479:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-10-26 23:44:15,480:INFO:intervals before: (0, 117), (0, 483)\n", - "2023-10-26 23:44:15,480:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", - "2023-10-26 23:44:15,481:INFO:the tn solutions: (312.90996599999994, 313.056234)\n", - "2023-10-26 23:44:15,482:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,483:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-10-26 23:44:15,484:INFO:intervals before: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,485:INFO:the tp solutions: (57.93786563072341, 58.095971377363604)\n", - "2023-10-26 23:44:15,486:INFO:the tn solutions: (312.4997080154006, 313.4269057132848)\n", - "2023-10-26 23:44:15,488:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,489:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-10-26 23:44:15,490:INFO:intervals before: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,491:INFO:the tp solutions: (57.95478456338436, 58.03879605061339)\n", - "2023-10-26 23:44:15,492:INFO:the tn solutions: (312.7528628906073, 313.2136402080464)\n", - "2023-10-26 23:44:15,492:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,494:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-10-26 23:44:15,495:INFO:intervals before: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,496:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", - "2023-10-26 23:44:15,496:INFO:the tn solutions: (312.6205722700333, 313.4230873646981)\n", - "2023-10-26 23:44:15,497:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,498:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-10-26 23:44:15,499:INFO:intervals before: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,500:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", - "2023-10-26 23:44:15,501:INFO:the tn solutions: (312.605227154962, 313.3602547229319)\n", - "2023-10-26 23:44:15,503:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,504:INFO:evaluating the tp and tn solution for ppv and f1p\n", - "2023-10-26 23:44:15,506:INFO:intervals before: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,507:INFO:the tp solutions: (57.83419173925718, 58.121438922237544)\n", - "2023-10-26 23:44:15,507:INFO:the tn solutions: (311.5597304712854, 314.6024074992048)\n", - "2023-10-26 23:44:15,508:INFO:intervals after: [(58, 58)], [(313, 313)]\n", - "2023-10-26 23:44:15,510:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-10-26 23:44:15,511:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-10-26 23:44:15,512:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-10-26 23:44:15,513:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-10-26 23:44:15,514:INFO:constructing final tp, tn pair set\n", - "2023-10-26 23:44:15,515:INFO:final number of intervals: 1\n", - "2023-10-26 23:44:15,516:INFO:final number of pairs: 1\n" + "2023-11-03 08:52:48,649:INFO:Use this function if the scores originate from the tp and tn statistics calculated on one test set with no aggregation of any kind.\n", + "2023-11-03 08:52:48,650:INFO:calling the score check with scores {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362}, uncertainty 0.0001, p 117 and n 483\n", + "2023-11-03 08:52:48,651:INFO:checking the scores {'acc': 0.6183, 'sens': 0.4957, 'ppv': 0.2544, 'f1p': 0.3362}\n", + "2023-11-03 08:52:48,652:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 08:52:48,653:INFO:intervals before: (0, 117), (0, 483)\n", + "2023-11-03 08:52:48,654:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", + "2023-11-03 08:52:48,656:INFO:the tn solutions: (312.90996599999994, 313.056234)\n", + "2023-11-03 08:52:48,657:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,658:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 08:52:48,659:INFO:intervals before: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,660:INFO:the tp solutions: (57.93786563072341, 58.095971377363604)\n", + "2023-11-03 08:52:48,660:INFO:the tn solutions: (312.4997080154006, 313.4269057132848)\n", + "2023-11-03 08:52:48,662:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,663:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 08:52:48,664:INFO:intervals before: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,665:INFO:the tp solutions: (57.95478456338436, 58.03879605061339)\n", + "2023-11-03 08:52:48,666:INFO:the tn solutions: (312.7528628906073, 313.2136402080464)\n", + "2023-11-03 08:52:48,666:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,667:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 08:52:48,668:INFO:intervals before: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,669:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", + "2023-11-03 08:52:48,669:INFO:the tn solutions: (312.6205722700333, 313.4230873646981)\n", + "2023-11-03 08:52:48,670:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,674:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 08:52:48,675:INFO:intervals before: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,676:INFO:the tp solutions: (57.984966, 58.00883399999999)\n", + "2023-11-03 08:52:48,676:INFO:the tn solutions: (312.605227154962, 313.3602547229319)\n", + "2023-11-03 08:52:48,677:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,678:INFO:evaluating the tp and tn solution for ppv and f1p\n", + "2023-11-03 08:52:48,679:INFO:intervals before: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,680:INFO:the tp solutions: (57.83419173925718, 58.121438922237544)\n", + "2023-11-03 08:52:48,681:INFO:the tn solutions: (311.5597304712854, 314.6024074992048)\n", + "2023-11-03 08:52:48,682:INFO:intervals after: [(58, 58)], [(313, 313)]\n", + "2023-11-03 08:52:48,683:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 08:52:48,685:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 08:52:48,686:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-03 08:52:48,687:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 08:52:48,688:INFO:constructing final tp, tn pair set\n", + "2023-11-03 08:52:48,689:INFO:final number of intervals: 1\n", + "2023-11-03 08:52:48,691:INFO:final number of pairs: 1\n" ] }, { diff --git a/tests/individual/test_interval.py b/tests/individual/test_interval.py index 64cc352..cdaa838 100644 --- a/tests/individual/test_interval.py +++ b/tests/individual/test_interval.py @@ -651,3 +651,15 @@ def test_odd_power(): assert Interval(0, 2)**3 == Interval(0, 8) assert Interval(-1, 2)**3 == Interval(-1, 8) assert Interval(-2, -1)**3 == Interval(-8, -1) + +def test_representing_integer(): + """ + Testing the extraction of a representing integer + """ + + assert Interval(0, 1).representing_int() == 0 + assert Interval(1, 0).representing_int() is None + + assert IntervalUnion([Interval(0, 1)]).representing_int() == 0 + assert IntervalUnion([Interval(1, 0)]).representing_int() is None + assert IntervalUnion([]).representing_int() is None From 8613023e30aea52b119772b3d7d284c14d78d122 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 09:41:33 +0100 Subject: [PATCH 12/40] generators factored out --- mlscorecheck/aggregated/__init__.py | 1 + mlscorecheck/aggregated/_fold_enumeration.py | 317 +++++++++++++++++++ mlscorecheck/aggregated/_folding_utils.py | 311 ------------------ 3 files changed, 318 insertions(+), 311 deletions(-) create mode 100644 mlscorecheck/aggregated/_fold_enumeration.py diff --git a/mlscorecheck/aggregated/__init__.py b/mlscorecheck/aggregated/__init__.py index f931259..e235f02 100644 --- a/mlscorecheck/aggregated/__init__.py +++ b/mlscorecheck/aggregated/__init__.py @@ -4,6 +4,7 @@ from ._folding import * from ._fold import * +from ._fold_enumeration import * from ._dataset import * from ._evaluation import * from ._experiment import * diff --git a/mlscorecheck/aggregated/_fold_enumeration.py b/mlscorecheck/aggregated/_fold_enumeration.py new file mode 100644 index 0000000..333750f --- /dev/null +++ b/mlscorecheck/aggregated/_fold_enumeration.py @@ -0,0 +1,317 @@ +""" +This module implements the functionalities for enumerating fold configurations +""" + +import copy +import itertools + +from ..core import logger +from ..experiments import dataset_statistics +from ._utils import random_identifier + +__all__ = ['integer_partitioning_generator', + 'all_integer_partitioning_generator', + 'fold_partitioning_generator', + 'determine_min_max_p', + 'kfolds_generator', + 'repeated_kfolds_generator', + 'experiment_kfolds_generator', + '_check_specification_and_determine_p_n'] + +def integer_partitioning_generator(n: int, m: int): # pylint: disable=invalid-name + """ + Integer partitioning generator + + Integer partitioning algorithm implemented following the algorithm on page 343 in + https://doi.org/10.1007/978-3-642-14764-7 + + Args: + n (int): the integer to partition + m (int): the number of partitions + + Yields: + list: the next configuration + """ + x = [0] * (m+1) # pylint: disable=invalid-name + s = [0] * (m+1) # pylint: disable=invalid-name + + for k in range(1, m): # pylint: disable=invalid-name + x[k] = 1 + + x[m] = n - m + 1 + + for k in range(1, m + 1): # pylint: disable=invalid-name + s[k] = x[k] + s[k-1] + + while True: + yield x[1:] + + u = x[m] # pylint: disable=invalid-name + k = m # pylint: disable=invalid-name + while k > 0: + k -= 1 # pylint: disable=invalid-name + if x[k] + 2 <= u: + break + + if k == 0: + return + + f = x[k] + 1 # pylint: disable=invalid-name + s_ = s[k-1] # pylint: disable=invalid-name + while k < m: + x[k] = f + s_ += f # pylint: disable=invalid-name + s[k] = s_ + k += 1 # pylint: disable=invalid-name + + x[m] = n - s[m-1] + +def all_integer_partitioning_generator(n, k, non_zero, max_count): # pylint: disable=invalid-name + """ + Generate all integer partitioning of n to k parts (including 0 parts) + + Args: + n (int): the integer to partition + k (int): the maximum number of parts + non_zero (bool): True if all parts must be greater than zero, False otherwise + max_count (int): the maximum value a part can take + + Yields: + list: the list of parts + """ + if n == 0: + yield [0] * k + else: + lower_bound = min(k, n) if non_zero else 1 + upper_bound = min(k, n) + for m in range(lower_bound, upper_bound + 1):# pylint: disable=invalid-name + for positives in integer_partitioning_generator(n, m): + if all(pos <= max_count for pos in positives): + yield [0] * (k - m) + positives + +def not_enough_diverse_folds(p_values, n_values): + """ + Checks if there are enough folds with positive and negative samples + + Args: + p_values (list): the list of counts of positives + n_values (list): the list of counts of negatives + + Returns: + bool: True, if the configuration is incorrect, False otherwise + """ + + return (len(p_values) > 1 and (sum(p_tmp > 0 for p_tmp in p_values) < 2 + or sum(n_tmp > 0 for n_tmp in n_values) < 2)) + +def determine_min_max_p(*, p, n, k_a, k_b, c_a, p_non_zero, n_non_zero): # pylint: disable=too-many-locals + """ + Determines the minimum and maximum number of positives that can appear in folds + of type A + + Args: + p (int): the total number of positives + n (int): the total number of negatives + k_a (int): the number of folds of type A + k_b (int): the number of folds of type B + c_a (int): the count of elements in folds of type A + p_non_zero (bool): whether all p should be non-zero + n_non_zero (bool): whether all n should be non-zero + + Returns: + int, int: the minimum and maximum number of positives in all folds of + type A + """ + + total_a = k_a * c_a + + min_p_a = max(p_non_zero*k_a, total_a - (n - n_non_zero*k_b)) + max_p_a = min(p - p_non_zero*k_b, total_a - n_non_zero*k_a) + + return min_p_a, max_p_a + +def fold_partitioning_generator(*, p, n, k, p_non_zero=True, n_non_zero=True, p_min=-1): #pylint: disable=invalid-name,too-many-locals + """ + Generates the fold partitioning + + Args: + p (int): the number of positives + n (int): the number of negatives + k (int): the number of folds + p_zero (bool): whether any p can be zero + n_zero (bool): whether any n can be zero + + Yields: + list, list: the list of positive and negative counts in folds + """ + k_div = (p + n) // k + k_mod = (p + n) % k + + k_b = k - k_mod + k_a = k_mod + c_a = k_div + 1 + c_b = k_div + + min_p_a, max_p_a = determine_min_max_p(p=p, + n=n, + k_a=k_a, + k_b=k_b, + c_a=c_a, + p_non_zero=p_non_zero, + n_non_zero=n_non_zero) + + for p_a in range(min_p_a, max_p_a + 1): + p_b = p - p_a + + for ps_a in all_integer_partitioning_generator(p_a, k_a, p_non_zero, c_a - n_non_zero): + + if any(p_tmp < p_min for p_tmp in ps_a): + continue + + ns_a = [c_a - tmp for tmp in ps_a] + + for ps_b in all_integer_partitioning_generator(p_b, k_b, p_non_zero, c_b - n_non_zero): + + if any(p_tmp < p_min for p_tmp in ps_b): + continue + + ns_b = [c_b - tmp for tmp in ps_b] + + ps_all = ps_a + ps_b + ns_all = ns_a + ns_b + + if not_enough_diverse_folds(ps_all, ns_all): + continue + + yield ps_all, ns_all + +def _check_specification_and_determine_p_n(dataset: dict, folding: dict) -> (int, int): + """ + Checking if the dataset specification is correct and determining the p and n values + + Args: + dataset (dict): the dataset specification + folding (dict): the folding specification + + Returns: + int, int: the number of positives and negatives + + Raises: + ValueError: if the specification is not suitable + """ + if folding.get('folds') is not None: + raise ValueError('do not specify the "folds" key for the generation of folds') + if (dataset.get('p') is not None and dataset.get('n') is None)\ + or (dataset.get('p') is None and dataset.get('n') is not None): + raise ValueError('either specify both "p" and "n" or None of them') + if dataset.get('dataset_name') is not None and dataset.get('p') is not None: + raise ValueError('either specify "dataset_name" or "p" and "n"') + + p = (dataset_statistics[dataset['dataset_name']]["p"] + if dataset.get('dataset_name') is not None else dataset["p"]) + n = (dataset_statistics[dataset['dataset_name']]["n"] + if dataset.get('dataset_name') is not None else dataset["n"]) + + return p, n + +def kfolds_generator(evaluation: dict, + available_scores: list, + repeat_idx=0): + """ + Generates the fold configurations + + Args: + evaluation (dict): the evaluation to generate the configurations for + available_scores (list): the list of available scores + repeat_idx (int): the index of the repeat + + Returns: + Generator: the generator + + Yields: + list(dict): the list of fold specifications + """ + p, n = _check_specification_and_determine_p_n(evaluation.get('dataset'), + evaluation.get('folding')) + + p_zero = False + n_zero = False + + if 'sens' not in available_scores and 'bacc' not in available_scores: + p_zero = True + logger.info('sens and bacc not among the reported scores, p=0 folds are also considered') + if 'spec' not in available_scores and 'bacc' not in available_scores: + n_zero = True + logger.info('spec and bacc not among the reported scores, n=0 folds are also considered') + + if evaluation['dataset'].get('dataset_name') is not None: + evaluation['dataset']['identifier'] = \ + f'{evaluation["dataset"]["dataset_name"]}_{random_identifier(3)}' + else: + evaluation['dataset']['identifier'] = random_identifier(6) + + for jdx, (p_vals, n_vals) in enumerate(fold_partitioning_generator(p=p, + n=n, + k=evaluation['folding'].get('n_folds', 1), + p_non_zero=not p_zero, + n_non_zero=not n_zero)): + yield [{'p': p_, + 'n': n_, + 'identifier': f"{evaluation['dataset']['identifier']}_f{idx}_k{jdx}_r{repeat_idx}"} + for idx, (p_, n_) in enumerate(zip(p_vals, n_vals))] + +def repeated_kfolds_generator(evaluation: dict, + available_scores: list): + """ + Generates the evaluation variations + + Args: + evaluation (dict): the evaluation to generate the configurations for + available_scores (list): the list of available scores + + Returns: + Generator: the generator + + Yields: + dict: one evaluation + """ + n_repeats = evaluation['folding'].get('n_repeats', 1) + generators = [kfolds_generator(evaluation, available_scores, idx) for idx in range(n_repeats)] + + if n_repeats > 1: + + for folds in itertools.product(*generators): + yield {'dataset': copy.deepcopy(evaluation['dataset']), + 'folding': { + 'folds': [fold for fold_list in folds for fold in fold_list]}, + 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), + 'aggregation': evaluation.get('aggregation')} + else: + for fold_list in generators[0]: + yield {'dataset': copy.deepcopy(evaluation['dataset']), + 'folding': { + 'folds': fold_list}, + 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), + 'aggregation': evaluation.get('aggregation')} + +def experiment_kfolds_generator(experiment: dict, + available_scores: list): + """ + Generates the experiment variations + + Args: + experiment (dict): the experiment to generate the configurations for + available_scores (list): the list of available scores + + Returns: + Generator: the generator + + Yields: + dict: one experiment + """ + generators = [repeated_kfolds_generator(evaluation, available_scores) + for evaluation in experiment['evaluations']] + for evaluations in itertools.product(*generators): + yield {'evaluations': list(evaluations), + 'dataset_score_bounds': experiment.get('dataset_score_bounds'), + 'aggregation': experiment['aggregation']} diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index b023d76..2c3550c 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -3,27 +3,14 @@ """ import copy -import itertools import numpy as np from sklearn.model_selection import StratifiedKFold -from ..core import logger -from ..experiments import dataset_statistics -from ._utils import random_identifier - __all__ = ['stratified_configurations_sklearn', 'determine_fold_configurations', '_create_folds', - 'integer_partitioning_generator', - 'all_integer_partitioning_generator', - 'fold_partitioning_generator', - '_check_specification_and_determine_p_n', - 'determine_min_max_p', - 'kfolds_generator', - 'repeated_kfolds_generator', - 'experiment_kfolds_generator', 'multiclass_stratified_folds', 'transform_multiclass_fold_to_binary', 'create_folds_multiclass'] @@ -144,304 +131,6 @@ def _create_folds(p: int, return folds -def integer_partitioning_generator(n: int, m: int): # pylint: disable=invalid-name - """ - Integer partitioning generator - - Integer partitioning algorithm implemented following the algorithm on page 343 in - https://doi.org/10.1007/978-3-642-14764-7 - - Args: - n (int): the integer to partition - m (int): the number of partitions - - Yields: - list: the next configuration - """ - x = [0] * (m+1) # pylint: disable=invalid-name - s = [0] * (m+1) # pylint: disable=invalid-name - - for k in range(1, m): # pylint: disable=invalid-name - x[k] = 1 - - x[m] = n - m + 1 - - for k in range(1, m + 1): # pylint: disable=invalid-name - s[k] = x[k] + s[k-1] - - while True: - yield x[1:] - - u = x[m] # pylint: disable=invalid-name - k = m # pylint: disable=invalid-name - while k > 0: - k -= 1 # pylint: disable=invalid-name - if x[k] + 2 <= u: - break - - if k == 0: - return - - f = x[k] + 1 # pylint: disable=invalid-name - s_ = s[k-1] # pylint: disable=invalid-name - while k < m: - x[k] = f - s_ += f # pylint: disable=invalid-name - s[k] = s_ - k += 1 # pylint: disable=invalid-name - - x[m] = n - s[m-1] - -def all_integer_partitioning_generator(n, k, non_zero, max_count): # pylint: disable=invalid-name - """ - Generate all integer partitioning of n to k parts (including 0 parts) - - Args: - n (int): the integer to partition - k (int): the maximum number of parts - non_zero (bool): True if all parts must be greater than zero, False otherwise - max_count (int): the maximum value a part can take - - Yields: - list: the list of parts - """ - if n == 0: - yield [0] * k - else: - lower_bound = min(k, n) if non_zero else 1 - upper_bound = min(k, n) - for m in range(lower_bound, upper_bound + 1):# pylint: disable=invalid-name - for positives in integer_partitioning_generator(n, m): - if all(pos <= max_count for pos in positives): - yield [0] * (k - m) + positives - -def not_enough_diverse_folds(p_values, n_values): - """ - Checks if there are enough folds with positive and negative samples - - Args: - p_values (list): the list of counts of positives - n_values (list): the list of counts of negatives - - Returns: - bool: True, if the configuration is incorrect, False otherwise - """ - - return (len(p_values) > 1 and (sum(p_tmp > 0 for p_tmp in p_values) < 2 - or sum(n_tmp > 0 for n_tmp in n_values) < 2)) - -def determine_min_max_p(*, p, n, k_a, k_b, c_a, p_non_zero, n_non_zero): # pylint: disable=too-many-locals - """ - Determines the minimum and maximum number of positives that can appear in folds - of type A - - Args: - p (int): the total number of positives - n (int): the total number of negatives - k_a (int): the number of folds of type A - k_b (int): the number of folds of type B - c_a (int): the count of elements in folds of type A - p_non_zero (bool): whether all p should be non-zero - n_non_zero (bool): whether all n should be non-zero - - Returns: - int, int: the minimum and maximum number of positives in all folds of - type A - """ - - total_a = k_a * c_a - - min_p_a = max(p_non_zero*k_a, total_a - (n - n_non_zero*k_b)) - max_p_a = min(p - p_non_zero*k_b, total_a - n_non_zero*k_a) - - return min_p_a, max_p_a - -def fold_partitioning_generator(*, p, n, k, p_non_zero=True, n_non_zero=True, p_min=-1): #pylint: disable=invalid-name,too-many-locals - """ - Generates the fold partitioning - - Args: - p (int): the number of positives - n (int): the number of negatives - k (int): the number of folds - p_zero (bool): whether any p can be zero - n_zero (bool): whether any n can be zero - - Yields: - list, list: the list of positive and negative counts in folds - """ - k_div = (p + n) // k - k_mod = (p + n) % k - - k_b = k - k_mod - k_a = k_mod - c_a = k_div + 1 - c_b = k_div - - min_p_a, max_p_a = determine_min_max_p(p=p, - n=n, - k_a=k_a, - k_b=k_b, - c_a=c_a, - p_non_zero=p_non_zero, - n_non_zero=n_non_zero) - - for p_a in range(min_p_a, max_p_a + 1): - p_b = p - p_a - - for ps_a in all_integer_partitioning_generator(p_a, k_a, p_non_zero, c_a - n_non_zero): - - if any(p_tmp < p_min for p_tmp in ps_a): - continue - - ns_a = [c_a - tmp for tmp in ps_a] - - for ps_b in all_integer_partitioning_generator(p_b, k_b, p_non_zero, c_b - n_non_zero): - - if any(p_tmp < p_min for p_tmp in ps_b): - continue - - ns_b = [c_b - tmp for tmp in ps_b] - - ps_all = ps_a + ps_b - ns_all = ns_a + ns_b - - if not_enough_diverse_folds(ps_all, ns_all): - continue - - yield ps_all, ns_all - -def _check_specification_and_determine_p_n(dataset: dict, folding: dict) -> (int, int): - """ - Checking if the dataset specification is correct and determining the p and n values - - Args: - dataset (dict): the dataset specification - folding (dict): the folding specification - - Returns: - int, int: the number of positives and negatives - - Raises: - ValueError: if the specification is not suitable - """ - if folding.get('folds') is not None: - raise ValueError('do not specify the "folds" key for the generation of folds') - if (dataset.get('p') is not None and dataset.get('n') is None)\ - or (dataset.get('p') is None and dataset.get('n') is not None): - raise ValueError('either specify both "p" and "n" or None of them') - if dataset.get('dataset_name') is not None and dataset.get('p') is not None: - raise ValueError('either specify "dataset_name" or "p" and "n"') - - p = (dataset_statistics[dataset['dataset_name']]["p"] - if dataset.get('dataset_name') is not None else dataset["p"]) - n = (dataset_statistics[dataset['dataset_name']]["n"] - if dataset.get('dataset_name') is not None else dataset["n"]) - - return p, n - -def kfolds_generator(evaluation: dict, - available_scores: list, - repeat_idx=0): - """ - Generates the fold configurations - - Args: - evaluation (dict): the evaluation to generate the configurations for - available_scores (list): the list of available scores - repeat_idx (int): the index of the repeat - - Returns: - Generator: the generator - - Yields: - list(dict): the list of fold specifications - """ - p, n = _check_specification_and_determine_p_n(evaluation.get('dataset'), - evaluation.get('folding')) - - p_zero = False - n_zero = False - - if 'sens' not in available_scores and 'bacc' not in available_scores: - p_zero = True - logger.info('sens and bacc not among the reported scores, p=0 folds are also considered') - if 'spec' not in available_scores and 'bacc' not in available_scores: - n_zero = True - logger.info('spec and bacc not among the reported scores, n=0 folds are also considered') - - if evaluation['dataset'].get('dataset_name') is not None: - evaluation['dataset']['identifier'] = \ - f'{evaluation["dataset"]["dataset_name"]}_{random_identifier(3)}' - else: - evaluation['dataset']['identifier'] = random_identifier(6) - - for jdx, (p_vals, n_vals) in enumerate(fold_partitioning_generator(p=p, - n=n, - k=evaluation['folding'].get('n_folds', 1), - p_non_zero=not p_zero, - n_non_zero=not n_zero)): - yield [{'p': p_, - 'n': n_, - 'identifier': f"{evaluation['dataset']['identifier']}_f{idx}_k{jdx}_r{repeat_idx}"} - for idx, (p_, n_) in enumerate(zip(p_vals, n_vals))] - -def repeated_kfolds_generator(evaluation: dict, - available_scores: list): - """ - Generates the evaluation variations - - Args: - evaluation (dict): the evaluation to generate the configurations for - available_scores (list): the list of available scores - - Returns: - Generator: the generator - - Yields: - dict: one evaluation - """ - n_repeats = evaluation['folding'].get('n_repeats', 1) - generators = [kfolds_generator(evaluation, available_scores, idx) for idx in range(n_repeats)] - - if n_repeats > 1: - - for folds in itertools.product(*generators): - yield {'dataset': copy.deepcopy(evaluation['dataset']), - 'folding': { - 'folds': [fold for fold_list in folds for fold in fold_list]}, - 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), - 'aggregation': evaluation.get('aggregation')} - else: - for fold_list in generators[0]: - yield {'dataset': copy.deepcopy(evaluation['dataset']), - 'folding': { - 'folds': fold_list}, - 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), - 'aggregation': evaluation.get('aggregation')} - -def experiment_kfolds_generator(experiment: dict, - available_scores: list): - """ - Generates the experiment variations - - Args: - experiment (dict): the experiment to generate the configurations for - available_scores (list): the list of available scores - - Returns: - Generator: the generator - - Yields: - dict: one experiment - """ - generators = [repeated_kfolds_generator(evaluation, available_scores) - for evaluation in experiment['evaluations']] - for evaluations in itertools.product(*generators): - yield {'evaluations': list(evaluations), - 'dataset_score_bounds': experiment.get('dataset_score_bounds'), - 'aggregation': experiment['aggregation']} - def multiclass_stratified_folds(dataset: dict, n_folds: int) -> list: """ Generating the folds for an sklearn stratified multiclass setup From ba944409f0e8bb48f7036cd3f979ce4f3d2a6ffb Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 11:46:24 +0100 Subject: [PATCH 13/40] minor fix --- mlscorecheck/aggregated/_folding_utils.py | 10 +++++++++- mlscorecheck/aggregated/_generate_problems.py | 6 ++++-- .../test_1_dataset_known_folds_mos_macro.py | 20 +++++++++++-------- .../test_1_dataset_known_folds_mos_micro.py | 20 +++++++++++-------- 4 files changed, 37 insertions(+), 19 deletions(-) diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index 2c3550c..cc2568e 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -8,6 +8,8 @@ from sklearn.model_selection import StratifiedKFold +from ._utils import random_identifier + __all__ = ['stratified_configurations_sklearn', 'determine_fold_configurations', '_create_folds', @@ -160,7 +162,13 @@ def transform_multiclass_fold_to_binary(fold: dict) -> list: list(dict): the list of binary folds """ n_total = sum(fold.values()) - return [{'p': value, 'n': n_total - value} for value in fold.values()] + folds = [{'p': value, 'n': n_total - value} for value in fold.values()] + identifier = fold.get('identifier', random_identifier(4)) + + for idx, fold in enumerate(folds): + fold['identifier'] = f'{identifier}_{idx}' + + return folds def create_folds_multiclass(dataset: dict, folding: dict) -> list: """ diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index 784f501..c08a1c0 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -383,14 +383,16 @@ def generate_dataset_folding_multiclass(*, max_class_size=max_class_size, min_class_size=min_class_size) + n_folds = min([min(list(dataset.values())), random_state.randint(2, max_n_folds)]) + if random_state.randint(2) == 0: - folding = {'n_folds': random_state.randint(2, max_n_folds), + folding = {'n_folds': n_folds, 'n_repeats': random_state.randint(1, max_n_repeats), 'strategy': 'stratified_sklearn'} elif random_state.randint(2) == 0: folding = \ {'folds': multiclass_stratified_folds(dataset=dataset, - n_folds=random_state.randint(2, max_n_repeats))} + n_folds=n_folds)} else: folding = {'n_folds': 1} diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py index 67d3a0d..6d8b864 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -16,10 +16,12 @@ def test_consistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='macro', - aggregation='mos', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average='macro', + aggregation='mos', + rounding_decimals=4, + subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) result = check_1_dataset_known_folds_mos_macro(dataset=dataset, folding=folding, @@ -37,10 +39,12 @@ def test_inconsistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='macro', - aggregation='mos', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average='macro', + aggregation='mos', + rounding_decimals=4, + subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) scores['acc'] = (1.0 + scores['spec']) / 2.0 diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py index 752f74c..74eeeed 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py @@ -16,10 +16,12 @@ def test_consistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='micro', - aggregation='mos', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average='micro', + aggregation='mos', + rounding_decimals=4, + subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) result = check_1_dataset_known_folds_mos_micro(dataset=dataset, folding=folding, @@ -37,10 +39,12 @@ def test_inconsistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='micro', - aggregation='mos', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average='micro', + aggregation='mos', + rounding_decimals=4, + subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) scores['acc'] = (1.0 + scores['spec']) / 2.0 From 9de84389f4386954c24149ec6aa69b7fb0d049b7 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 14:54:36 +0100 Subject: [PATCH 14/40] interval union fix --- docs/01c_consistency_checking.rst | 12 +++++++++++- mlscorecheck/aggregated/_folding_utils.py | 4 ++-- mlscorecheck/aggregated/_generate_problems.py | 11 +++++------ .../_check_1_dataset_known_folds_som_micro.py | 2 -- mlscorecheck/individual/_check_scores_tptn.py | 1 + mlscorecheck/individual/_interval.py | 7 ++++++- mlscorecheck/individual/_problem_generator.py | 16 ++++++++++++---- mlscorecheck/individual/_utils.py | 5 ++++- .../test_1_dataset_known_folds_mos_macro.py | 6 ++++-- .../test_1_dataset_known_folds_mos_micro.py | 6 ++++-- 10 files changed, 49 insertions(+), 21 deletions(-) diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index d6ed11c..f869018 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -6,10 +6,14 @@ Numerous experimental setups are supported by the package. In this section we go We emphasize again, that the tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. A note on the *Score of Means* and *Mean of Scores* aggregations -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). + +Binary classification +~~~~~~~~~~~~~~~~~~~~~ + The two types of tests ^^^^^^^^^^^^^^^^^^^^^^ @@ -401,3 +405,9 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th eps=1e-3) >>> result['inconsistency'] # True + +Multiclass classification +~~~~~~~~~~~~~~~~~~~~~~~~~ + +Regression +~~~~~~~~~~ diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index cc2568e..64458b4 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -165,8 +165,8 @@ def transform_multiclass_fold_to_binary(fold: dict) -> list: folds = [{'p': value, 'n': n_total - value} for value in fold.values()] identifier = fold.get('identifier', random_identifier(4)) - for idx, fold in enumerate(folds): - fold['identifier'] = f'{identifier}_{idx}' + for idx, fold_ in enumerate(folds): + fold_['identifier'] = f'{identifier}_{idx}' return folds diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index c08a1c0..f2ea3c9 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -343,7 +343,7 @@ def generate_scores_for_testsets(testsets, def generate_dataset_folding_multiclass(*, random_state=None, max_n_classes=5, - min_n_classes=2, + min_n_classes=3, max_class_size=200, min_class_size=10, max_n_folds=5, @@ -383,16 +383,15 @@ def generate_dataset_folding_multiclass(*, max_class_size=max_class_size, min_class_size=min_class_size) - n_folds = min([min(list(dataset.values())), random_state.randint(2, max_n_folds)]) + folding = {'n_folds': min([min(list(dataset.values())), random_state.randint(2, max_n_folds)])} if random_state.randint(2) == 0: - folding = {'n_folds': n_folds, - 'n_repeats': random_state.randint(1, max_n_repeats), - 'strategy': 'stratified_sklearn'} + folding = folding | {'n_repeats': random_state.randint(1, max_n_repeats), + 'strategy': 'stratified_sklearn'} elif random_state.randint(2) == 0: folding = \ {'folds': multiclass_stratified_folds(dataset=dataset, - n_folds=n_folds)} + n_folds=folding['n_folds'])} else: folding = {'n_folds': 1} diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index d621d01..bac6732 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -84,8 +84,6 @@ class level scores on a single multiclass dataset and averaging across the folds """ folds = create_folds_multiclass(dataset, folding) - print(folds) - testset = copy.deepcopy(folds[0]) for fold in folds[1:]: for key in fold: diff --git a/mlscorecheck/individual/_check_scores_tptn.py b/mlscorecheck/individual/_check_scores_tptn.py index 216f59c..e32bb9b 100644 --- a/mlscorecheck/individual/_check_scores_tptn.py +++ b/mlscorecheck/individual/_check_scores_tptn.py @@ -45,6 +45,7 @@ def iterate_tptn(*, results = {} for value in valid_pairs: + if not is_applicable_tptn(score, score_value, 'tp' if iterate_by == 'tn' else 'tn'): results[value] = valid_pairs[value] continue diff --git a/mlscorecheck/individual/_interval.py b/mlscorecheck/individual/_interval.py index 23cfb6b..7ffe1a0 100644 --- a/mlscorecheck/individual/_interval.py +++ b/mlscorecheck/individual/_interval.py @@ -391,6 +391,7 @@ def __init__(self, intervals): intervals (Interval|tuple|list(Interval)): a specification of one interval or a list of intervals """ + if isinstance(intervals, Interval): self.intervals = [intervals] elif isinstance(intervals, tuple): @@ -428,7 +429,11 @@ def simplify(self): to_drop = [] for idx, int0 in enumerate(intervals): for jdx, int1 in enumerate(intervals): - if idx < jdx: + if idx != jdx: + if (int0.lower_bound == int1.lower_bound) \ + and (int0.upper_bound == int1.upper_bound) \ + and idx > jdx: + continue if (int0.lower_bound <= int1.lower_bound) \ and (int0.upper_bound >= int1.upper_bound): # the interval widh index jdx is contained in the interval with index idx diff --git a/mlscorecheck/individual/_problem_generator.py b/mlscorecheck/individual/_problem_generator.py index ed4183c..c3b3259 100644 --- a/mlscorecheck/individual/_problem_generator.py +++ b/mlscorecheck/individual/_problem_generator.py @@ -137,7 +137,7 @@ def generate_problems(*, def generate_multiclass_dataset(random_state=None, max_n_classes: int=5, - min_n_classes: int=2, + min_n_classes: int=3, max_class_size: int=200, min_class_size: int=10) -> dict: """ @@ -198,8 +198,16 @@ def sample_multiclass_dataset(dataset: dict, random_state=None) -> np.array: sample = np.zeros(shape=(len(dataset), len(dataset)), dtype=int) for class_idx, count in dataset.items(): - sample[class_idx, :] = random_state.multinomial(count, - np.ones(len(dataset))/len(dataset), - size=1)[0] + sample_row = random_state.multinomial(count, + np.ones(len(dataset))/len(dataset), + size=1)[0] + + #while np.any(sample_row == 0): + # zidx = np.where(sample_row == 0)[0][0] + # nzidx = np.where(sample_row > 1)[0][0] + # sample_row[zidx] += 1 + # sample_row[nzidx] -= 1 + + sample[class_idx, :] = sample_row return sample diff --git a/mlscorecheck/individual/_utils.py b/mlscorecheck/individual/_utils.py index 0e5ce00..4081dad 100644 --- a/mlscorecheck/individual/_utils.py +++ b/mlscorecheck/individual/_utils.py @@ -161,6 +161,7 @@ def unify_results(value_list): Returns: obj (list|IntervalUnion): the unified result """ + if len(value_list) == 0: return None if all(value is None for value in value_list): @@ -177,4 +178,6 @@ def unify_results(value_list): elif interval is not None: intervals.append(Interval(interval, interval)) - return IntervalUnion(intervals) + intu = IntervalUnion(intervals) + + return intu diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py index 6d8b864..b708812 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -21,7 +21,8 @@ def test_consistent(random_seed: int): average='macro', aggregation='mos', rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) + #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) result = check_1_dataset_known_folds_mos_macro(dataset=dataset, folding=folding, @@ -44,7 +45,8 @@ def test_inconsistent(random_seed: int): average='macro', aggregation='mos', rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) + #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) scores['acc'] = (1.0 + scores['spec']) / 2.0 diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py index 74eeeed..76716a0 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py @@ -21,7 +21,8 @@ def test_consistent(random_seed: int): average='micro', aggregation='mos', rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) + #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) result = check_1_dataset_known_folds_mos_micro(dataset=dataset, folding=folding, @@ -44,7 +45,8 @@ def test_inconsistent(random_seed: int): average='micro', aggregation='mos', rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p', 'bacc']) + #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) scores['acc'] = (1.0 + scores['spec']) / 2.0 From bd7ac78430ce01a2f93421bf31f5b2cae130e54b Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 16:07:25 +0100 Subject: [PATCH 15/40] regression tests added --- mlscorecheck/check/regression/__init__.py | 2 +- .../check/regression/_check_regression.py | 162 +++++++++++++++++- mlscorecheck/individual/_interval.py | 2 +- tests/{ => check}/bundles/test_isic2016.py | 0 tests/{ => check}/bundles/test_isic2017.py | 0 .../bundles/test_retina_chasedb1.py | 0 .../bundles/test_retina_diaretdb0.py | 0 .../bundles/test_retina_diaretdb1.py | 0 .../bundles/test_retina_drishti_gs.py | 0 .../{ => check}/bundles/test_retina_drive.py | 0 tests/{ => check}/bundles/test_retina_hrf.py | 0 .../{ => check}/bundles/test_retina_stare.py | 0 tests/{ => check}/bundles/test_tpehg.py | 0 .../test_check_1_testset_no_kfold.py | 56 ++++++ 14 files changed, 214 insertions(+), 8 deletions(-) rename tests/{ => check}/bundles/test_isic2016.py (100%) rename tests/{ => check}/bundles/test_isic2017.py (100%) rename tests/{ => check}/bundles/test_retina_chasedb1.py (100%) rename tests/{ => check}/bundles/test_retina_diaretdb0.py (100%) rename tests/{ => check}/bundles/test_retina_diaretdb1.py (100%) rename tests/{ => check}/bundles/test_retina_drishti_gs.py (100%) rename tests/{ => check}/bundles/test_retina_drive.py (100%) rename tests/{ => check}/bundles/test_retina_hrf.py (100%) rename tests/{ => check}/bundles/test_retina_stare.py (100%) rename tests/{ => check}/bundles/test_tpehg.py (100%) create mode 100644 tests/check/regression/test_check_1_testset_no_kfold.py diff --git a/mlscorecheck/check/regression/__init__.py b/mlscorecheck/check/regression/__init__.py index f08812e..25bbf9f 100644 --- a/mlscorecheck/check/regression/__init__.py +++ b/mlscorecheck/check/regression/__init__.py @@ -2,4 +2,4 @@ This module implements the tests for regression scores. """ -from ._check_regression import check_regression +from ._check_regression import * diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index 73e5a26..7c90439 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -2,12 +2,162 @@ This module implements the testing of regression scores """ -__all__ = ['check_regression'] +import numpy as np -def check_regression(scores, - eps): +from ...individual import Interval +from ...core import NUMERICAL_TOLERANCE, round_scores + +__all__ = ['check_1_testset_no_kfold', + 'expand_regression_scores', + 'mean_average_error', + 'mean_squared_error', + 'root_mean_squared_error', + 'r_squared', + 'calculate_regression_scores', + 'generate_regression_problem_and_scores', + 'check_relations'] + +rules = [{'score0': 'mae', 'score1': 'rmse', 'relation': 'le'}] + +def mean_average_error(y_true: np.array, y_pred: np.array): + return np.mean(np.abs(y_true - y_pred)) + +def mean_squared_error(y_true: np.array, y_pred: np.array): + return np.mean((y_true - y_pred)**2) + +def root_mean_squared_error(y_true: np.array, y_pred: np.array): + return np.sqrt(np.mean((y_true - y_pred)**2)) + +def r_squared(y_true: np.array, y_pred: np.array): + return 1.0 - np.sum((y_true - y_pred)**2) / (np.var(y_true) * y_true.shape[0]) + +regression_scores = {'mae': mean_average_error, + 'mse': mean_squared_error, + 'rmse': root_mean_squared_error, + 'r2': r_squared} + +def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None): + scores = {} + + for key, function in regression_scores.items(): + if subset is None or key in subset: + scores[key] = function(y_true, y_pred) + + return scores + +def generate_regression_problem_and_scores(random_state=None, + max_n_samples=1000, + subset=None, + rounding_decimals=None): + if not isinstance(random_state, np.random.RandomState): + random_state = np.random.RandomState(random_state) + + n_samples = random_state.randint(2, max_n_samples) + + y_true = np.random.random_sample(n_samples) + y_pred = (np.random.random_sample(n_samples) - 0.5) / 20 + + scores = calculate_regression_scores(y_true, y_pred, subset) + + scores = round_scores(scores, rounding_decimals) + + return np.var(y_true), n_samples, scores + +def expand_regression_scores(var: float, + n_samples: int, + scores: dict, + eps, + numerical_tolerance: float) -> dict: + """ + Generate scores from the ones available and expand the scores to intervals given the + numerical uncertainty. + + Args: + var (float): the variance of the evaluation set + n_samples (int): the number of samples in the evaluation set + scores (dict(str,float)): the scores to check ('mae', 'rmse', 'mse', 'r2') + eps (float,dict(str,float)): the numerical uncertainty of the scores + numerical_tolerance (float): the numerical tolerance of the test + + Returns: + dict: the extended set of score intervals + """ + scores = {key: Interval(value - eps - numerical_tolerance, + value + eps + numerical_tolerance) for key, value in scores.items()} + + if 'rmse' in scores and 'mse' not in scores: + scores['mse'] = scores['rmse'] ** 2 + + if 'mse' in scores and 'rmse' not in scores: + scores['rmse'] = scores['mse'] ** 0.5 + + if 'r2' in scores and 'mse' not in scores: + scores['mse'] = (1 - scores['r2']) * var / n_samples + + if 'r2' in scores and 'rmse' not in scores: + scores['mse'] = ((1 - scores['r2']) * var / n_samples) ** 0.5 + + if 'mse' in scores and 'r2' not in scores: + scores['r2'] = 1 - scores['mse'] * n_samples / var + + if 'rmse' in scores and 'r2' not in scores: + scores['r2'] = 1 - scores['rmse'] ** 2 * n_samples / var + + return scores + +def check_relations(scores: dict) -> dict: """ - The consistency test for regression scores + Check the relations of the scores + + Args: + scores (dict(str,Interval)): the score and figure intervals + + Returns: + dict: a summary of the analysis, with the following entries: + + - ``'inconsistency'`` (bool): whether an inconsistency has been identified + - ``'details'`` (list(dict)): the details of the analysis, with the following entries """ - _ = scores - _ = eps + results = {'details': []} + + for rule in rules: + if rule['score0'] in scores and rule['score1'] in scores: + score0 = scores[rule['score0']] + score1 = scores[rule['score1']] + if rule['relation'] == 'le': + value = score0.lower_bound <= score1.upper_bound + results['details'].append(rule | {'value': value}) + + results['inconsistency'] = any(not result['value'] for result in results['details']) + + return results + +def check_1_testset_no_kfold(var: float, + n_samples: int, + scores: dict, + eps, + numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + """ + The consistency test for regression scores calculated on a single test set + with no k-folding + + Args: + var (float): the variance of the evaluation set + n_samples (int): the number of samples in the evaluation set + scores (dict(str,float)): the scores to check ('mae', 'rmse', 'mse', 'r2') + eps (float,dict(str,float)): the numerical uncertainty of the scores + numerical_tolerance (float): the numerical tolerance of the test + + Returns: + dict: a summary of the analysis, with the following entries: + + - ``'inconsistency'`` (bool): whether an inconsistency has been identified + - ``'details'`` (list(dict)): the details of the analysis, with the following entries + """ + intervals = expand_regression_scores(var, + n_samples, + scores, + eps, + numerical_tolerance) + + return check_relations(intervals) diff --git a/mlscorecheck/individual/_interval.py b/mlscorecheck/individual/_interval.py index 7ffe1a0..b2b09e1 100644 --- a/mlscorecheck/individual/_interval.py +++ b/mlscorecheck/individual/_interval.py @@ -433,7 +433,7 @@ def simplify(self): if (int0.lower_bound == int1.lower_bound) \ and (int0.upper_bound == int1.upper_bound) \ and idx > jdx: - continue + continue if (int0.lower_bound <= int1.lower_bound) \ and (int0.upper_bound >= int1.upper_bound): # the interval widh index jdx is contained in the interval with index idx diff --git a/tests/bundles/test_isic2016.py b/tests/check/bundles/test_isic2016.py similarity index 100% rename from tests/bundles/test_isic2016.py rename to tests/check/bundles/test_isic2016.py diff --git a/tests/bundles/test_isic2017.py b/tests/check/bundles/test_isic2017.py similarity index 100% rename from tests/bundles/test_isic2017.py rename to tests/check/bundles/test_isic2017.py diff --git a/tests/bundles/test_retina_chasedb1.py b/tests/check/bundles/test_retina_chasedb1.py similarity index 100% rename from tests/bundles/test_retina_chasedb1.py rename to tests/check/bundles/test_retina_chasedb1.py diff --git a/tests/bundles/test_retina_diaretdb0.py b/tests/check/bundles/test_retina_diaretdb0.py similarity index 100% rename from tests/bundles/test_retina_diaretdb0.py rename to tests/check/bundles/test_retina_diaretdb0.py diff --git a/tests/bundles/test_retina_diaretdb1.py b/tests/check/bundles/test_retina_diaretdb1.py similarity index 100% rename from tests/bundles/test_retina_diaretdb1.py rename to tests/check/bundles/test_retina_diaretdb1.py diff --git a/tests/bundles/test_retina_drishti_gs.py b/tests/check/bundles/test_retina_drishti_gs.py similarity index 100% rename from tests/bundles/test_retina_drishti_gs.py rename to tests/check/bundles/test_retina_drishti_gs.py diff --git a/tests/bundles/test_retina_drive.py b/tests/check/bundles/test_retina_drive.py similarity index 100% rename from tests/bundles/test_retina_drive.py rename to tests/check/bundles/test_retina_drive.py diff --git a/tests/bundles/test_retina_hrf.py b/tests/check/bundles/test_retina_hrf.py similarity index 100% rename from tests/bundles/test_retina_hrf.py rename to tests/check/bundles/test_retina_hrf.py diff --git a/tests/bundles/test_retina_stare.py b/tests/check/bundles/test_retina_stare.py similarity index 100% rename from tests/bundles/test_retina_stare.py rename to tests/check/bundles/test_retina_stare.py diff --git a/tests/bundles/test_tpehg.py b/tests/check/bundles/test_tpehg.py similarity index 100% rename from tests/bundles/test_tpehg.py rename to tests/check/bundles/test_tpehg.py diff --git a/tests/check/regression/test_check_1_testset_no_kfold.py b/tests/check/regression/test_check_1_testset_no_kfold.py new file mode 100644 index 0000000..086f35b --- /dev/null +++ b/tests/check/regression/test_check_1_testset_no_kfold.py @@ -0,0 +1,56 @@ +""" +Testing the consistency tests for regression scores in the 1 testset no kfold case +""" + +import pytest + +import numpy as np + +from mlscorecheck.check.regression import (generate_regression_problem_and_scores, + check_1_testset_no_kfold) + +@pytest.mark.parametrize('random_seed', list(range(20))) +@pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], + ['mae', 'mse'], ['mae', 'r2'], ['mae']]) +def test_consistency(random_seed, subset): + """ + Testing a consistent configuration + + Args: + random_seed (int): the random seed to test + subset (list): the score subset to use + """ + + random_state = np.random.RandomState(random_seed) + + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state, + rounding_decimals=4, + subset=subset) + + result = check_1_testset_no_kfold(var, n_samples, scores, eps=1e-4) + + assert not result['inconsistency'] + +@pytest.mark.parametrize('random_seed', list(range(20))) +@pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], ['mae', 'mse'], ['mae', 'r2'], ['mae']]) +def test_inconsistency(random_seed, subset): + """ + Testing an iconsistent configuration + + Args: + random_seed (int): the random seed to test + subset (list): the score subset to use + """ + + random_state = np.random.RandomState(random_seed) + + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state, + rounding_decimals=4, + subset=subset) + + scores['mae'] = 0.6 + scores['rmse'] = 0.5 + + result = check_1_testset_no_kfold(var, n_samples, scores, eps=1e-4) + + assert result['inconsistency'] From 9707b118895b719eb3495a92942a1edd9b4af46d Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 16:52:17 +0100 Subject: [PATCH 16/40] some more refinement --- .../check/regression/_check_regression.py | 121 +++++++++++++----- .../test_check_1_testset_no_kfold.py | 27 +++- 2 files changed, 116 insertions(+), 32 deletions(-) diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index 7c90439..2702f96 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -15,20 +15,61 @@ 'r_squared', 'calculate_regression_scores', 'generate_regression_problem_and_scores', - 'check_relations'] + 'check_relations', + 'score_formulas'] rules = [{'score0': 'mae', 'score1': 'rmse', 'relation': 'le'}] -def mean_average_error(y_true: np.array, y_pred: np.array): +def mean_average_error(y_true: np.array, y_pred: np.array) -> float: + """ + The mean average error (MAE) regression performance score + + Args: + y_true (np.array): the true labels + y_pred (np.array): the predicted labels + + Returns: + float: the MAE score + """ return np.mean(np.abs(y_true - y_pred)) -def mean_squared_error(y_true: np.array, y_pred: np.array): +def mean_squared_error(y_true: np.array, y_pred: np.array) -> float: + """ + The mean squared error (MSE) regression performance score + + Args: + y_true (np.array): the true labels + y_pred (np.array): the predicted labels + + Returns: + float: the MSE score + """ return np.mean((y_true - y_pred)**2) -def root_mean_squared_error(y_true: np.array, y_pred: np.array): - return np.sqrt(np.mean((y_true - y_pred)**2)) +def root_mean_squared_error(y_true: np.array, y_pred: np.array) -> float: + """ + The root mean squared error (RMSE) regression performance score + + Args: + y_true (np.array): the true labels + y_pred (np.array): the predicted labels + + Returns: + float: the RMSE score + """ + return np.sqrt(mean_squared_error(y_true, y_pred)) + +def r_squared(y_true: np.array, y_pred: np.array) -> float: + """ + The R squared (r2) regression performance score + + Args: + y_true (np.array): the true labels + y_pred (np.array): the predicted labels -def r_squared(y_true: np.array, y_pred: np.array): + Returns: + float: the R2 score + """ return 1.0 - np.sum((y_true - y_pred)**2) / (np.var(y_true) * y_true.shape[0]) regression_scores = {'mae': mean_average_error, @@ -36,7 +77,18 @@ def r_squared(y_true: np.array, y_pred: np.array): 'rmse': root_mean_squared_error, 'r2': r_squared} -def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None): +def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None) -> dict: + """ + Calculate the performance scores for a regression problem + + Args: + y_true (np.array): the true labels + y_pred (np.array): the predicted labels + subset (None|list(str)): the scores to calculate + + Returns: + dict: the calculated scores + """ scores = {} for key, function in regression_scores.items(): @@ -45,10 +97,23 @@ def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None) return scores -def generate_regression_problem_and_scores(random_state=None, - max_n_samples=1000, - subset=None, - rounding_decimals=None): +def generate_regression_problem_and_scores( + random_state=None, + max_n_samples=1000, + subset=None, + rounding_decimals=None) -> (float, int, dict): + """ + Generate a regression problem and corresponding scores + + Args: + random_state (None|int|np.random.RandomState): the random state/seed to use + max_n_samples (int): the maximum number of samples to be used + subset (None|list(str)): the list of scores to be used + rounding_decimals (None|int): the number of decimals to round to + + Returns: + float, int, dict: the variance, the number of samples and the scores + """ if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) @@ -63,6 +128,14 @@ def generate_regression_problem_and_scores(random_state=None, return np.var(y_true), n_samples, scores +score_formulas = {'mse': {'rmse': 'rmse**2', + 'r2': '((1 - r2) * (var))'}, + 'rmse': {'mse': 'mse ** 0.5', + 'r2': '((1 - r2) * (var)) ** 0.5'}, + 'r2': {'mse': '(1 - mse / var)', + 'rmse': '(1 - rmse**2 / var)'}, + } + def expand_regression_scores(var: float, n_samples: int, scores: dict, @@ -85,25 +158,15 @@ def expand_regression_scores(var: float, scores = {key: Interval(value - eps - numerical_tolerance, value + eps + numerical_tolerance) for key, value in scores.items()} - if 'rmse' in scores and 'mse' not in scores: - scores['mse'] = scores['rmse'] ** 2 - - if 'mse' in scores and 'rmse' not in scores: - scores['rmse'] = scores['mse'] ** 0.5 + to_add = {} + for key, value in score_formulas.items(): + if key not in scores: + for sol, formula in value.items(): + if sol in scores: + to_add[key] = eval(formula, scores | {'var': var, 'n_samples': n_samples}) + break - if 'r2' in scores and 'mse' not in scores: - scores['mse'] = (1 - scores['r2']) * var / n_samples - - if 'r2' in scores and 'rmse' not in scores: - scores['mse'] = ((1 - scores['r2']) * var / n_samples) ** 0.5 - - if 'mse' in scores and 'r2' not in scores: - scores['r2'] = 1 - scores['mse'] * n_samples / var - - if 'rmse' in scores and 'r2' not in scores: - scores['r2'] = 1 - scores['rmse'] ** 2 * n_samples / var - - return scores + return scores | to_add def check_relations(scores: dict) -> dict: """ diff --git a/tests/check/regression/test_check_1_testset_no_kfold.py b/tests/check/regression/test_check_1_testset_no_kfold.py index 086f35b..983b3fe 100644 --- a/tests/check/regression/test_check_1_testset_no_kfold.py +++ b/tests/check/regression/test_check_1_testset_no_kfold.py @@ -7,7 +7,9 @@ import numpy as np from mlscorecheck.check.regression import (generate_regression_problem_and_scores, - check_1_testset_no_kfold) + check_1_testset_no_kfold, + score_formulas, + calculate_regression_scores) @pytest.mark.parametrize('random_seed', list(range(20))) @pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], @@ -17,7 +19,7 @@ def test_consistency(random_seed, subset): Testing a consistent configuration Args: - random_seed (int): the random seed to test + random_seed (int): the random seed to use subset (list): the score subset to use """ @@ -38,7 +40,7 @@ def test_inconsistency(random_seed, subset): Testing an iconsistent configuration Args: - random_seed (int): the random seed to test + random_seed (int): the random seed to use subset (list): the score subset to use """ @@ -54,3 +56,22 @@ def test_inconsistency(random_seed, subset): result = check_1_testset_no_kfold(var, n_samples, scores, eps=1e-4) assert result['inconsistency'] + +@pytest.mark.parametrize('random_seed', list(range(20))) +def test_score_formulas(random_seed): + """ + Testing the score formulas + + Args: + random_seed (int): the random seed to use + """ + + random_state = np.random.RandomState(random_seed) + + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state) + + for key, solutions in score_formulas.items(): + for sol_key, solution in solutions.items(): + score_tmp = eval(solution, scores | {'var': var, 'n_samples': n_samples}) + print(key, sol_key, score_tmp, scores[key]) + assert abs(score_tmp - scores[key]) < 1e-8 From 55b71dd7e57de6914fb1aba93ef7191ce06f8ec4 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 17:07:39 +0100 Subject: [PATCH 17/40] regression formulas tested --- .../check/regression/_check_regression.py | 4 ++-- .../test_check_1_testset_no_kfold.py | 18 ++++++------------ 2 files changed, 8 insertions(+), 14 deletions(-) diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index 2702f96..8bb72e9 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -5,7 +5,7 @@ import numpy as np from ...individual import Interval -from ...core import NUMERICAL_TOLERANCE, round_scores +from ...core import NUMERICAL_TOLERANCE, round_scores, safe_eval __all__ = ['check_1_testset_no_kfold', 'expand_regression_scores', @@ -163,7 +163,7 @@ def expand_regression_scores(var: float, if key not in scores: for sol, formula in value.items(): if sol in scores: - to_add[key] = eval(formula, scores | {'var': var, 'n_samples': n_samples}) + to_add[key] = safe_eval(formula, scores | {'var': var, 'n_samples': n_samples}) break return scores | to_add diff --git a/tests/check/regression/test_check_1_testset_no_kfold.py b/tests/check/regression/test_check_1_testset_no_kfold.py index 983b3fe..25a73c6 100644 --- a/tests/check/regression/test_check_1_testset_no_kfold.py +++ b/tests/check/regression/test_check_1_testset_no_kfold.py @@ -6,10 +6,10 @@ import numpy as np +from mlscorecheck.core import safe_eval from mlscorecheck.check.regression import (generate_regression_problem_and_scores, check_1_testset_no_kfold, - score_formulas, - calculate_regression_scores) + score_formulas) @pytest.mark.parametrize('random_seed', list(range(20))) @pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], @@ -23,9 +23,7 @@ def test_consistency(random_seed, subset): subset (list): the score subset to use """ - random_state = np.random.RandomState(random_seed) - - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state, + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed, rounding_decimals=4, subset=subset) @@ -44,9 +42,7 @@ def test_inconsistency(random_seed, subset): subset (list): the score subset to use """ - random_state = np.random.RandomState(random_seed) - - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state, + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed, rounding_decimals=4, subset=subset) @@ -66,12 +62,10 @@ def test_score_formulas(random_seed): random_seed (int): the random seed to use """ - random_state = np.random.RandomState(random_seed) - - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_state) + var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed) for key, solutions in score_formulas.items(): for sol_key, solution in solutions.items(): - score_tmp = eval(solution, scores | {'var': var, 'n_samples': n_samples}) + score_tmp = safe_eval(solution, scores | {'var': var, 'n_samples': n_samples}) print(key, sol_key, score_tmp, scores[key]) assert abs(score_tmp - scores[key]) < 1e-8 From 74ec311b87297c7c3db8cb0257f629b99e8e0e60 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 17:18:18 +0100 Subject: [PATCH 18/40] regression examples added --- .../check/regression/_check_regression.py | 22 +++- .../regression/00_1_testset_no_kfold.ipynb | 123 ++++++++++++++++++ 2 files changed, 144 insertions(+), 1 deletion(-) create mode 100644 notebooks/illustration/regression/00_1_testset_no_kfold.ipynb diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index 8bb72e9..cf80d4e 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -120,7 +120,7 @@ def generate_regression_problem_and_scores( n_samples = random_state.randint(2, max_n_samples) y_true = np.random.random_sample(n_samples) - y_pred = (np.random.random_sample(n_samples) - 0.5) / 20 + y_pred = y_true + (np.random.random_sample(n_samples) - 0.5) / 10 scores = calculate_regression_scores(y_true, y_pred, subset) @@ -216,6 +216,26 @@ def check_1_testset_no_kfold(var: float, - ``'inconsistency'`` (bool): whether an inconsistency has been identified - ``'details'`` (list(dict)): the details of the analysis, with the following entries + + Examples: + >>> from mlscorecheck.check.regression import check_1_testset_no_kfold + >>> var = 0.08316192579267838 + >>> n_samples = 100 + >>> scores = {'mae': 0.0254, 'r2': 0.9897} + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + + >>> scores['mae'] = 0.03 + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True """ intervals = expand_regression_scores(var, n_samples, diff --git a/notebooks/illustration/regression/00_1_testset_no_kfold.ipynb b/notebooks/illustration/regression/00_1_testset_no_kfold.ipynb new file mode 100644 index 0000000..c3235bf --- /dev/null +++ b/notebooks/illustration/regression/00_1_testset_no_kfold.ipynb @@ -0,0 +1,123 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 4, + "metadata": {}, + "outputs": [], + "source": [ + "from mlscorecheck.check.regression import (generate_regression_problem_and_scores,\n", + " check_1_testset_no_kfold,\n", + " score_formulas)" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [], + "source": [ + "var, n_samples, scores = generate_regression_problem_and_scores(random_state=None,\n", + " rounding_decimals=4,\n", + " subset=None)\n", + "\n" + ] + }, + { + "cell_type": "code", + "execution_count": 9, + "metadata": {}, + "outputs": [], + "source": [ + "var = 0.08316192579267838\n", + "n_samples = 100\n", + "scores = {'mae': 0.0254, 'r2': 0.9897}" + ] + }, + { + "cell_type": "code", + "execution_count": 10, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "False" + ] + }, + "execution_count": 10, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_testset_no_kfold(var=var,\n", + " n_samples=n_samples,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": 11, + "metadata": {}, + "outputs": [], + "source": [ + "scores['mae'] = 0.03" + ] + }, + { + "cell_type": "code", + "execution_count": 12, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 12, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = check_1_testset_no_kfold(var=var,\n", + " n_samples=n_samples,\n", + " scores=scores,\n", + " eps=1e-4)\n", + "result['inconsistency']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "mlscorecheck", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.10.0" + } + }, + "nbformat": 4, + "nbformat_minor": 2 +} From 75c3acbc640e11213eb9dbd026d14032f6851906 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 17:24:10 +0100 Subject: [PATCH 19/40] numpy import removed --- tests/check/regression/test_check_1_testset_no_kfold.py | 2 -- 1 file changed, 2 deletions(-) diff --git a/tests/check/regression/test_check_1_testset_no_kfold.py b/tests/check/regression/test_check_1_testset_no_kfold.py index 25a73c6..7c4c058 100644 --- a/tests/check/regression/test_check_1_testset_no_kfold.py +++ b/tests/check/regression/test_check_1_testset_no_kfold.py @@ -4,8 +4,6 @@ import pytest -import numpy as np - from mlscorecheck.core import safe_eval from mlscorecheck.check.regression import (generate_regression_problem_and_scores, check_1_testset_no_kfold, From bb8e1c4f3db2ece6fd24966aba8414f0dd834ceb Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Fri, 3 Nov 2023 21:02:05 +0100 Subject: [PATCH 20/40] documentation extended --- docs/01c_consistency_checking.rst | 227 + .../00_check_1_testset_no_kfold_macro.ipynb | 64 +- .../01_check_1_testset_no_kfold_micro.ipynb | 343 +- ...heck_1_dataset_known_folds_mos_macro.ipynb | 67 +- ...heck_1_dataset_known_folds_mos_micro.ipynb | 78 +- ...heck_1_dataset_known_folds_som_macro.ipynb | 22557 +++++++++++++++- ...heck_1_dataset_known_folds_som_micro.ipynb | 216 +- 7 files changed, 23137 insertions(+), 415 deletions(-) diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index f869018..bbcde29 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -409,5 +409,232 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th Multiclass classification ~~~~~~~~~~~~~~~~~~~~~~~~~ +In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. + +1 testset, no k-fold, micro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In this scenario, we suppose there is a multiclass classification testset and the class level scores on the testset are aggregated by micro-averaging. The test is based on exhaustive enumeration, so all 20 performance scores are supported. In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro + + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, + 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # False + +As the test confirms, the setup is consistent. However, if one of the scores is adjusted a little, for example, accuracy is changed to 0.5258, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.5258 + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # True + +1 testset, no k-fold, micro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +This scenario is similar to the previous one, except the scores are aggregated by macro-averaging. The test is based on linear programming, so only accuracy, sensitivity, specificity and balanced accuracy are supported. In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro + + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308} + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # False + +As the test confirms, the configuration shows no inconsistency. However, if one of the scores is adjusted a little, for example, accuracy is changed to 0.601, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.601 + >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) + >>> results['inconsistency'] + # True + +1 dataset, known k-folds, score of means aggregation, micro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by micro-averaging, and the fold level results are aggregated in the score of means fashion. The test is based on exhaustive enumeration, therefore, all 20 performance scores are supported. + +In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro + + >>> dataset = {0: 86, 1: 96, 2: 59, 3: 105} + >>> folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]} + >>> scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543} + + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the test confirms, the scenario is feasible. However, if one of the scores is adjusted a little, for example, sensitivity is changed to 0.2553, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['sens'] = 0.2553 + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + +1 dataset, known k-folds, score of means aggregation, macro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by macro-averaging, and the fold level results are aggregated in the score of means fashion. The test is based on linear programming, thus, only accuracy, sensitivity, specificity and balanced accuracy are supported. + +In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro + + >>> dataset = {0: 129, 1: 81, 2: 135} + >>> folding = {'n_folds': 2, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.5662, 'sens': 0.3577, 'spec': 0.6767, 'f1p': 0.3481} + + >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the results show, no inconsistency has been identified. However, if accuracy is changed to 0.6662, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.6662 + >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + +1 dataset, known k-folds, mean of scores aggregation, micro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by micro-averaging, and the fold level results are aggregated in the mean of scores fashion. The test is based on linear programming, thus, only accuracy, sensitivity, specificity and balanced accuracy are supported. + +In the first example, an artificially generated, consistent scenario is tested: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro + + >>> dataset = {0: 66, 1: 178, 2: 151} + >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} + >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} + + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the results show, inconsistencies have not been identified. However, if one of the scores, say, accuracy is adjusted to 0.5746, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.5746 + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + +1 dataset, known k-folds, mean of scores aggregation, macro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In the last multiclass scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by macro-averaging, and the fold level results are aggregated in the mean of scores fashion. The test is based on linear programming, thus, only accuracy, sensitivity, specificity and balanced accuracy are supported. + +In the first example, an artificially generated, consistent scenario is tested: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro + + >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} + >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} + + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the results show, there are no inconsistencies in the configuration. However, if accuracy is changed to 0.656, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.656 + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + Regression ~~~~~~~~~~ + +From the point of view of consistency testing, regression is the hardest problem as the predictions can produce any performance scores. The tests implemented in the package allow testing the relation of the *mean squared error* (``mse``), *root mean squared error* (``rmse``), *mean average error* (``mae``) and *r^2 scores* (``r2``). + +1 testset, no k-fold +^^^^^^^^^^^^^^^^^^^^ + +In this scenario, we assume there is a regression testset, and the performance scores are calculated on the testset. + +In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.regression import check_1_testset_no_kfold + + >>> var = 0.0831619 # the variance of the target values in the testset + >>> n_samples = 100 + >>> scores = {'mae': 0.0254, 'r2': 0.9897} + + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the results show, there is no inconsistency detected. However, if the mae score is adjusted slightly to 0.03, the configuration becomes inconsistent: + +.. code-block:: Python + + >>> scores['mae'] = 0.03 + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True diff --git a/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb index 6e4ecb6..0975792 100644 --- a/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb +++ b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb @@ -40,7 +40,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/badad7e8f243451a8bf6d68fc8fc15ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/badad7e8f243451a8bf6d68fc8fc15ea-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f6fc4d6fe990483db85d417dd55b4cf3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6fc4d6fe990483db85d417dd55b4cf3-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -55,7 +55,7 @@ "Cbc0031I 2 added rows had average density of 6\n", "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 39 passes\n", "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 86 row cuts average 5.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 86 row cuts average 5.7 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 8 row cuts average 2.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", @@ -68,7 +68,7 @@ "Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", "Probing was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Gomory was tried 39 times and created 86 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 39 times and created 86 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Knapsack was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "Clique was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "MixedIntegerRounding2 was tried 39 times and created 8 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", @@ -81,11 +81,11 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 3\n", "Total iterations: 81\n", - "Time (CPU seconds): 0.02\n", + "Time (CPU seconds): 0.03\n", "Time (Wallclock seconds): 0.03\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.04\n", + "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04\n", "\n" ] }, @@ -118,20 +118,9 @@ "cell_type": "code", "execution_count": 6, "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "0.8464" - ] - }, - "execution_count": 6, - "metadata": {}, - "output_type": "execute_result" - } - ], + "outputs": [], "source": [ - "scores['acc']" + "scores['acc'] = 0.601" ] }, { @@ -147,7 +136,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5952abbbfeb145e294b218834ac9311c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5952abbbfeb145e294b218834ac9311c-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b026655b35024810ad4b2a8bb71f0907-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b026655b35024810ad4b2a8bb71f0907-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -157,9 +146,42 @@ "Problem MODEL has 6 rows, 7 columns and 24 elements\n", "Coin0008I MODEL read with 0 errors\n", "Option for timeMode changed from cpu to elapsed\n", - "Problem is infeasible - 0.00 seconds\n", + "Continuous objective value is 0 - 0.00 seconds\n", + "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", + "Cbc0031I 2 added rows had average density of 6\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 31 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 65 row cuts average 5.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 3 row cuts average 2.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 10 row cuts average 3.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", + "Cbc0010I After 1000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (0.78 seconds)\n", + "Cbc0001I Search completed - best objective 1e+50, took 201914 iterations and 126163 nodes (0.88 seconds)\n", + "Cbc0032I Strong branching done 3252 times (5439 iterations), fathomed 277 nodes and fixed 436 variables\n", + "Cbc0041I Maximum depth 48, 0 variables fixed on reduced cost (complete fathoming 52 times, 124723 nodes taking 189250 iterations)\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 31 times and created 65 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 31 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 31 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Problem proven infeasible\n", + "\n", + "No feasible solution found\n", + "Enumerated nodes: 126163\n", + "Total iterations: 201914\n", + "Time (CPU seconds): 0.88\n", + "Time (Wallclock seconds): 0.88\n", + "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.88 (Wallclock seconds): 0.88\n", "\n" ] }, diff --git a/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb index 7c6be93..a4b1a70 100644 --- a/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb +++ b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb @@ -37,91 +37,91 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 07:31:27,081:INFO:checking the scores {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", - "2023-11-03 07:31:27,084:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 07:31:27,086:INFO:intervals before: (0, 190), (0, 380)\n", - "2023-11-03 07:31:27,088:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,090:INFO:the tn solutions: (241.92548, 242.08052000000006)\n", - "2023-11-03 07:31:27,091:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,093:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 07:31:27,094:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,096:INFO:the tp solutions: (51.92509999999996, 52.11890000000008)\n", - "2023-11-03 07:31:27,097:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,099:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,100:INFO:evaluating the tp and tn solution for acc and bacc\n", - "2023-11-03 07:31:27,102:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,103:INFO:the tp solutions: (51.886339999999905, 52.157659999999964)\n", - "2023-11-03 07:31:27,104:INFO:the tn solutions: (241.79020000000003, 242.17780000000016)\n", - "2023-11-03 07:31:27,106:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,107:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-11-03 07:31:27,108:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,110:INFO:the tp solutions: (51.92507006183688, 52.081026437634286)\n", - "2023-11-03 07:31:27,112:INFO:the tn solutions: (241.57858662847494, 242.42776991777123)\n", - "2023-11-03 07:31:27,113:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,114:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-11-03 07:31:27,115:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,117:INFO:the tp solutions: (51.36701642883198, 52.50098353406811)\n", - "2023-11-03 07:31:27,119:INFO:the tn solutions: (241.71814351243938, 242.4273174965254)\n", - "2023-11-03 07:31:27,120:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,122:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 07:31:27,124:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,126:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,128:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,129:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,131:INFO:evaluating the tp and tn solution for sens and bacc\n", - "2023-11-03 07:31:27,133:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,135:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,137:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", - "2023-11-03 07:31:27,139:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,140:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-11-03 07:31:27,142:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,143:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,145:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", - "2023-11-03 07:31:27,147:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,149:INFO:evaluating the tp and tn solution for sens and npv\n", - "2023-11-03 07:31:27,151:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,153:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,154:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", - "2023-11-03 07:31:27,156:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,158:INFO:evaluating the tp and tn solution for spec and bacc\n", - "2023-11-03 07:31:27,160:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,161:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", - "2023-11-03 07:31:27,163:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,164:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,166:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-11-03 07:31:27,168:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,170:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", - "2023-11-03 07:31:27,172:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,173:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,175:INFO:evaluating the tp and tn solution for spec and npv\n", - "2023-11-03 07:31:27,177:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,178:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", - "2023-11-03 07:31:27,180:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,182:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,186:INFO:evaluating the tp and tn solution for bacc and ppv\n", - "2023-11-03 07:31:27,220:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,221:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", - "2023-11-03 07:31:27,223:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", - "2023-11-03 07:31:27,224:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,226:INFO:evaluating the tp and tn solution for bacc and npv\n", - "2023-11-03 07:31:27,227:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,228:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", - "2023-11-03 07:31:27,230:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", - "2023-11-03 07:31:27,231:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,237:INFO:evaluating the tp and tn solution for ppv and npv\n", - "2023-11-03 07:31:27,239:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,240:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", - "2023-11-03 07:31:27,242:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", - "2023-11-03 07:31:27,243:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 07:31:27,246:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,247:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,250:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,251:INFO:testing bacc, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,253:INFO:testing npv, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,255:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-11-03 07:31:27,257:INFO:constructing final tp, tn pair set\n", - "2023-11-03 07:31:27,259:INFO:final number of intervals: 1\n", - "2023-11-03 07:31:27,260:INFO:final number of pairs: 1\n" + "2023-11-03 20:15:50,791:INFO:checking the scores {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-03 20:15:50,796:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 20:15:50,798:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-03 20:15:50,800:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:15:50,801:INFO:the tn solutions: (241.92548, 242.08052000000006)\n", + "2023-11-03 20:15:50,802:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,803:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 20:15:50,803:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,804:INFO:the tp solutions: (51.92509999999996, 52.11890000000008)\n", + "2023-11-03 20:15:50,805:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:15:50,806:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,807:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 20:15:50,809:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,810:INFO:the tp solutions: (51.886339999999905, 52.157659999999964)\n", + "2023-11-03 20:15:50,811:INFO:the tn solutions: (241.79020000000003, 242.17780000000016)\n", + "2023-11-03 20:15:50,812:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,813:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 20:15:50,814:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,815:INFO:the tp solutions: (51.92507006183688, 52.081026437634286)\n", + "2023-11-03 20:15:50,815:INFO:the tn solutions: (241.57858662847494, 242.42776991777123)\n", + "2023-11-03 20:15:50,816:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,817:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 20:15:50,818:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,818:INFO:the tp solutions: (51.36701642883198, 52.50098353406811)\n", + "2023-11-03 20:15:50,819:INFO:the tn solutions: (241.71814351243938, 242.4273174965254)\n", + "2023-11-03 20:15:50,820:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,821:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 20:15:50,822:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,822:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:15:50,823:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:15:50,824:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,825:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-03 20:15:50,826:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,826:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:15:50,827:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-03 20:15:50,828:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,829:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 20:15:50,830:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,833:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:15:50,836:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-03 20:15:50,837:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,838:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-03 20:15:50,838:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,839:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:15:50,840:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-03 20:15:50,841:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,842:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 20:15:50,844:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,845:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-03 20:15:50,846:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:15:50,847:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,847:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 20:15:50,848:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,849:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-03 20:15:50,849:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:15:50,850:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,851:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 20:15:50,852:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,852:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-03 20:15:50,853:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:15:50,853:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,854:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-03 20:15:50,855:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,856:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-03 20:15:50,857:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-03 20:15:50,857:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,862:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-03 20:15:50,864:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,864:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-03 20:15:50,866:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-03 20:15:50,867:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,869:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-03 20:15:50,871:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,871:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-03 20:15:50,872:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-03 20:15:50,873:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-03 20:15:50,874:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,875:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,876:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,877:INFO:testing bacc, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,879:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,880:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-03 20:15:50,881:INFO:constructing final tp, tn pair set\n", + "2023-11-03 20:15:50,882:INFO:final number of intervals: 1\n", + "2023-11-03 20:15:50,882:INFO:final number of pairs: 1\n" ] }, { @@ -175,92 +175,101 @@ "cell_type": "code", "execution_count": 7, "metadata": {}, + "outputs": [], + "source": [ + "scores['acc'] = 0.5258" + ] + }, + { + "cell_type": "code", + "execution_count": 8, + "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 07:31:27,328:INFO:checking the scores {'acc': 0.8184, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", - "2023-11-03 07:31:27,332:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 07:31:27,333:INFO:intervals before: (0, 190), (0, 380)\n", - "2023-11-03 07:31:27,337:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,338:INFO:the tn solutions: (414.40747999999996, 414.56252000000006)\n", - "2023-11-03 07:31:27,341:INFO:intervals after: [(52, 52)], []\n", - "2023-11-03 07:31:27,342:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 07:31:27,344:INFO:intervals before: [(52, 52)], []\n", - "2023-11-03 07:31:27,346:INFO:the tp solutions: (224.40709999999993, 224.60090000000005)\n", - "2023-11-03 07:31:27,348:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,350:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,352:INFO:evaluating the tp and tn solution for acc and bacc\n", - "2023-11-03 07:31:27,354:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,356:INFO:the tp solutions: (-120.5956600000001, -120.32434000000003)\n", - "2023-11-03 07:31:27,357:INFO:the tn solutions: (586.7542, 587.1418000000001)\n", - "2023-11-03 07:31:27,358:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,360:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-11-03 07:31:27,362:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,363:INFO:the tp solutions: (-52.380008276554186, -52.22355994266834)\n", - "2023-11-03 07:31:27,365:INFO:the tn solutions: (518.2017689236844, 519.3782066236661)\n", - "2023-11-03 07:31:27,374:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,375:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-11-03 07:31:27,377:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,378:INFO:the tp solutions: (-177.7588589361954, -176.30973375743184)\n", - "2023-11-03 07:31:27,379:INFO:the tn solutions: (642.8041190131622, 644.2405509161804)\n", - "2023-11-03 07:31:27,381:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,382:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 07:31:27,384:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,386:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,387:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,389:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,390:INFO:evaluating the tp and tn solution for sens and bacc\n", - "2023-11-03 07:31:27,392:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,395:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,396:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", - "2023-11-03 07:31:27,398:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,399:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-11-03 07:31:27,401:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,403:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,404:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", - "2023-11-03 07:31:27,413:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,415:INFO:evaluating the tp and tn solution for sens and npv\n", - "2023-11-03 07:31:27,417:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,420:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 07:31:27,421:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", - "2023-11-03 07:31:27,423:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,425:INFO:evaluating the tp and tn solution for spec and bacc\n", - "2023-11-03 07:31:27,427:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,429:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", - "2023-11-03 07:31:27,430:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,432:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,434:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-11-03 07:31:27,436:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,438:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", - "2023-11-03 07:31:27,439:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,440:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,442:INFO:evaluating the tp and tn solution for spec and npv\n", - "2023-11-03 07:31:27,443:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,444:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", - "2023-11-03 07:31:27,445:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 07:31:27,446:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,448:INFO:evaluating the tp and tn solution for bacc and ppv\n", - "2023-11-03 07:31:27,450:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,451:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", - "2023-11-03 07:31:27,453:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", - "2023-11-03 07:31:27,455:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,456:INFO:evaluating the tp and tn solution for bacc and npv\n", - "2023-11-03 07:31:27,458:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,460:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", - "2023-11-03 07:31:27,461:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", - "2023-11-03 07:31:27,463:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,464:INFO:evaluating the tp and tn solution for ppv and npv\n", - "2023-11-03 07:31:27,466:INFO:intervals before: [], []\n", - "2023-11-03 07:31:27,467:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", - "2023-11-03 07:31:27,470:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", - "2023-11-03 07:31:27,472:INFO:intervals after: [], []\n", - "2023-11-03 07:31:27,473:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-11-03 07:31:27,475:INFO:no more feasible tp,tn pairs left\n", - "2023-11-03 07:31:27,476:INFO:constructing final tp, tn pair set\n", - "2023-11-03 07:31:27,479:INFO:final number of intervals: 0\n", - "2023-11-03 07:31:27,481:INFO:final number of pairs: 0\n" + "2023-11-03 20:16:02,927:INFO:checking the scores {'acc': 0.5258, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-03 20:16:02,929:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 20:16:02,930:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-03 20:16:02,930:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:16:02,931:INFO:the tn solutions: (247.62548000000004, 247.78052000000005)\n", + "2023-11-03 20:16:02,932:INFO:intervals after: [(52, 52)], [(1, 0)]\n", + "2023-11-03 20:16:02,932:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 20:16:02,933:INFO:intervals before: [(52, 52)], [(1, 0)]\n", + "2023-11-03 20:16:02,935:INFO:the tp solutions: (57.6251, 57.81890000000007)\n", + "2023-11-03 20:16:02,936:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:16:02,937:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,938:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-03 20:16:02,938:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,939:INFO:the tp solutions: (46.18633999999993, 46.45765999999995)\n", + "2023-11-03 20:16:02,940:INFO:the tn solutions: (253.19020000000012, 253.57780000000014)\n", + "2023-11-03 20:16:02,940:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,941:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-03 20:16:02,942:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,944:INFO:the tp solutions: (48.48095605224332, 48.631235988558664)\n", + "2023-11-03 20:16:02,945:INFO:the tn solutions: (250.7201326395527, 251.58013068134997)\n", + "2023-11-03 20:16:02,946:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,946:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-03 20:16:02,947:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,948:INFO:the tp solutions: (43.80386395479962, 44.93079743039423)\n", + "2023-11-03 20:16:02,949:INFO:the tn solutions: (254.97280231946934, 255.70600994264748)\n", + "2023-11-03 20:16:02,951:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,951:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 20:16:02,952:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,952:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:16:02,953:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:16:02,954:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,955:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-03 20:16:02,957:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,958:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:16:02,959:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-03 20:16:02,960:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,961:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-03 20:16:02,962:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,963:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:16:02,963:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-03 20:16:02,966:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,966:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-03 20:16:02,967:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,968:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-03 20:16:02,968:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-03 20:16:02,969:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,970:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-03 20:16:02,971:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,971:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-03 20:16:02,972:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:16:02,972:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,974:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-03 20:16:02,975:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,976:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-03 20:16:02,977:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:16:02,978:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,978:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-03 20:16:02,979:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,980:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-03 20:16:02,980:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-03 20:16:02,981:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,983:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-03 20:16:02,984:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,985:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-03 20:16:02,985:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-03 20:16:02,986:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,986:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-03 20:16:02,987:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,988:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-03 20:16:02,989:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-03 20:16:02,990:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,990:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-03 20:16:02,991:INFO:intervals before: [], []\n", + "2023-11-03 20:16:02,992:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-03 20:16:02,996:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-03 20:16:02,997:INFO:intervals after: [], []\n", + "2023-11-03 20:16:02,998:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 20:16:02,998:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 20:16:02,999:INFO:constructing final tp, tn pair set\n", + "2023-11-03 20:16:03,000:INFO:final number of intervals: 0\n", + "2023-11-03 20:16:03,000:INFO:final number of pairs: 0\n" ] }, { @@ -269,7 +278,7 @@ "True" ] }, - "execution_count": 7, + "execution_count": 8, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb index a953e93..fec4469 100644 --- a/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb +++ b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 9, + "execution_count": 1, "metadata": {}, "outputs": [], "source": [ @@ -12,18 +12,18 @@ }, { "cell_type": "code", - "execution_count": 10, + "execution_count": 2, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "({0: 142, 1: 146, 2: 103, 3: 57, 4: 128},\n", - " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.6889, 'sens': 0.2133, 'spec': 0.8045, 'f1p': 0.2106})" + "({0: 62, 1: 81, 2: 132, 3: 105},\n", + " {'n_folds': 3, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6132, 'sens': 0.2343, 'spec': 0.7456, 'f1p': 0.2236})" ] }, - "execution_count": 10, + "execution_count": 2, "metadata": {}, "output_type": "execute_result" } @@ -39,7 +39,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": 3, "metadata": {}, "outputs": [], "source": [ @@ -50,7 +50,7 @@ }, { "cell_type": "code", - "execution_count": 12, + "execution_count": 4, "metadata": {}, "outputs": [ { @@ -61,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0cecdd185da44de4b321667ccbeea9ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cecdd185da44de4b321667ccbeea9ee-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0026927817f044f68794b0e423930702-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0026927817f044f68794b0e423930702-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -105,7 +105,7 @@ "False" ] }, - "execution_count": 12, + "execution_count": 4, "metadata": {}, "output_type": "execute_result" } @@ -120,16 +120,16 @@ }, { "cell_type": "code", - "execution_count": 13, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" + "#scores['acc'] = (1.0 + scores['spec']) / 2.0" ] }, { "cell_type": "code", - "execution_count": 14, + "execution_count": null, "metadata": {}, "outputs": [ { @@ -144,21 +144,50 @@ } ], "source": [ - "scores['acc']" + "#scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [ + "#scores['acc'] = 0.8745" + ] + }, + { + "cell_type": "code", + "execution_count": 5, + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "{'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469}" + ] + }, + "execution_count": 5, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "scores" ] }, { "cell_type": "code", - "execution_count": 15, + "execution_count": 10, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.8745" + "scores['acc'] = 0.656" ] }, { "cell_type": "code", - "execution_count": 16, + "execution_count": 11, "metadata": {}, "outputs": [ { @@ -169,7 +198,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/04fc7f6d0109493d910358249ea0e013-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04fc7f6d0109493d910358249ea0e013-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4fdb093f3d764b499205becb67c53562-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fdb093f3d764b499205becb67c53562-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -191,7 +220,7 @@ "True" ] }, - "execution_count": 16, + "execution_count": 11, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb index 7395622..e296c26 100644 --- a/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb +++ b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb @@ -18,9 +18,9 @@ { "data": { "text/plain": [ - "({0: 199, 1: 60, 2: 23},\n", - " {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.5579, 'sens': 0.3369, 'spec': 0.6684, 'f1p': 0.3369})" + "({0: 181, 1: 169, 2: 118},\n", + " {'n_folds': 3, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.5342, 'sens': 0.3013, 'spec': 0.6506, 'f1p': 0.3013})" ] }, "execution_count": 2, @@ -61,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/6e009025829c4f828555c93d4f4148be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e009025829c4f828555c93d4f4148be-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9bbea2e97a44fc0a26ab83a4282952d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9bbea2e97a44fc0a26ab83a4282952d-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -105,38 +105,38 @@ "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0004I processed model has 3 rows, 4 columns (4 integer (0 of which binary)) and 8 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 16 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 18 iterations and 0 nodes (0.02 seconds)\n", "Cbc0031I 2 added rows had average density of 2\n", - "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 30 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 79 column cuts (79 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 10 row cuts average 1.9 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 33 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 75 column cuts (75 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 19 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 9 row cuts average 1.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 0, took 16 iterations and 0 nodes (0.01 seconds)\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 15 row cuts average 2.1 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 18 iterations and 0 nodes (0.02 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 30 times and created 79 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 30 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 30 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 33 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 33 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Knapsack was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 33 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", "\n", "Objective value: 0.00000000\n", "Enumerated nodes: 0\n", - "Total iterations: 16\n", - "Time (CPU seconds): 0.01\n", - "Time (Wallclock seconds): 0.01\n", + "Total iterations: 18\n", + "Time (CPU seconds): 0.02\n", + "Time (Wallclock seconds): 0.02\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", "\n" ] }, @@ -165,41 +165,59 @@ "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" + "#scores['acc'] = (1.0 + scores['spec']) / 2.0" ] }, { "cell_type": "code", "execution_count": 6, "metadata": {}, + "outputs": [], + "source": [ + "#scores['acc']" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, + "outputs": [], + "source": [ + "#scores['acc'] = 0.8367" + ] + }, + { + "cell_type": "code", + "execution_count": 7, + "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "0.8367" + "{'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469}" ] }, - "execution_count": 6, + "execution_count": 7, "metadata": {}, "output_type": "execute_result" } ], "source": [ - "scores['acc']" + "scores" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 8, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.8367" + "scores['acc'] = 0.5746" ] }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 9, "metadata": {}, "outputs": [ { @@ -210,7 +228,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/03719216d68f4aa2b4ebf4b72e318880-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03719216d68f4aa2b4ebf4b72e318880-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5705aa05247e470281daacd2a5a0c474-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5705aa05247e470281daacd2a5a0c474-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -232,7 +250,7 @@ "True" ] }, - "execution_count": 8, + "execution_count": 9, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb index 2660a19..89cf35e 100644 --- a/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb +++ b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 22, "metadata": {}, "outputs": [], "source": [ @@ -12,23 +12,23 @@ }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 23, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "({0: 186, 1: 115},\n", - " {'folds': [{0: 93, 1: 58}, {0: 93, 1: 57}]},\n", - " {'acc': 0.5017,\n", - " 'sens': 0.4955,\n", - " 'spec': 0.4955,\n", - " 'f1p': 0.4913,\n", + "({0: 141, 1: 186, 2: 76, 3: 101},\n", + " {'n_folds': 3, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6255,\n", + " 'sens': 0.2591,\n", + " 'spec': 0.7518,\n", + " 'f1p': 0.2471,\n", " 'beta_positive': 2,\n", " 'beta_negative': 2})" ] }, - "execution_count": 2, + "execution_count": 23, "metadata": {}, "output_type": "execute_result" } @@ -44,18 +44,18 @@ }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 24, "metadata": {}, "outputs": [], "source": [ - "dataset = {0: 34, 1: 135, 2: 170, 3: 192}\n", - "folding = {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'}\n", - "scores = {'acc': 0.6271, 'sens': 0.2422, 'spec': 0.7525, 'f1p': 0.2333}" + "dataset = {0: 129, 1: 81, 2: 135}\n", + "folding = {'n_folds': 2, 'n_repeats': 2, 'strategy': 'stratified_sklearn'}\n", + "scores = {'acc': 0.5662, 'sens': 0.3577, 'spec': 0.6767, 'f1p': 0.3481}" ] }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 25, "metadata": {}, "outputs": [ { @@ -66,41 +66,52 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/cd1fd9ce724e456fad6499136313e27a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd1fd9ce724e456fad6499136313e27a-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ffe1098237b4125a1ecde690104c6e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ffe1098237b4125a1ecde690104c6e2-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", - "At line 61 RHS\n", - "At line 68 BOUNDS\n", - "At line 78 ENDATA\n", - "Problem MODEL has 6 rows, 9 columns and 32 elements\n", + "At line 49 RHS\n", + "At line 56 BOUNDS\n", + "At line 64 ENDATA\n", + "Problem MODEL has 6 rows, 7 columns and 24 elements\n", "Coin0008I MODEL read with 0 errors\n", "Option for timeMode changed from cpu to elapsed\n", "Continuous objective value is 0 - 0.00 seconds\n", - "Cgl0004I processed model has 3 rows, 8 columns (8 integer (0 of which binary)) and 16 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds)\n", - "Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)\n", + "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", + "Cbc0031I 4 added rows had average density of 4.5\n", + "Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 50 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 84 row cuts average 5.2 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 2.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 19 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.02 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 68 iterations and 1 nodes (0.02 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 68 iterations and 1 nodes (0.02 seconds)\n", + "Cbc0032I Strong branching done 6 times (7 iterations), fathomed 0 nodes and fixed 0 variables\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 50 times and created 84 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 50 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "FlowCover was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 50 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", "\n", "Objective value: 0.00000000\n", - "Enumerated nodes: 0\n", - "Total iterations: 0\n", - "Time (CPU seconds): 0.00\n", - "Time (Wallclock seconds): 0.00\n", + "Enumerated nodes: 1\n", + "Total iterations: 68\n", + "Time (CPU seconds): 0.01\n", + "Time (Wallclock seconds): 0.02\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00\n", + "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02\n", "\n" ] }, @@ -110,7 +121,7 @@ "False" ] }, - "execution_count": 4, + "execution_count": 25, "metadata": {}, "output_type": "execute_result" } @@ -125,45 +136,36 @@ }, { "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [], - "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, - { - "cell_type": "code", - "execution_count": 6, + "execution_count": 26, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "0.87625" + "{'acc': 0.5662, 'sens': 0.3577, 'spec': 0.6767, 'f1p': 0.3481}" ] }, - "execution_count": 6, + "execution_count": 26, "metadata": {}, "output_type": "execute_result" } ], "source": [ - "scores['acc']" + "scores" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 27, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.8762" + "scores['acc'] = 0.6662" ] }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 28, "metadata": {}, "outputs": [ { @@ -174,14 +176,14 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/007c9f03aacd4c34bbdb2a4a5900fa9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/007c9f03aacd4c34bbdb2a4a5900fa9d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1921acbb79047d0b66cefa54c902e59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1921acbb79047d0b66cefa54c902e59-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", - "At line 61 RHS\n", - "At line 68 BOUNDS\n", - "At line 78 ENDATA\n", - "Problem MODEL has 6 rows, 9 columns and 32 elements\n", + "At line 49 RHS\n", + "At line 56 BOUNDS\n", + "At line 64 ENDATA\n", + "Problem MODEL has 6 rows, 7 columns and 24 elements\n", "Coin0008I MODEL read with 0 errors\n", "Option for timeMode changed from cpu to elapsed\n", "Problem is infeasible - 0.00 seconds\n", @@ -196,9 +198,22441 @@ "True" ] }, - "execution_count": 8, + "execution_count": 28, "metadata": {}, "output_type": "execute_result" + }, + { + "name": "stdout", + "output_type": "stream", + "text": [ + "on tree, 1e+50 best solution, best possible 0 (270.34 seconds)\n", + "Cbc0010I After 2898000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (270.51 seconds)\n", + "Cbc0010I After 2899000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (270.65 seconds)\n", + "Cbc0010I After 2900000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (270.76 seconds)\n", + "Cbc0010I After 2901000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (270.83 seconds)\n", + "Cbc0010I After 2902000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (270.90 seconds)\n", + "Cbc0010I After 2903000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (270.98 seconds)\n", + "Cbc0010I After 2904000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (271.08 seconds)\n", + "Cbc0010I After 2905000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (271.17 seconds)\n", + "Cbc0010I After 2906000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (271.26 seconds)\n", + "Cbc0010I After 2907000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (271.36 seconds)\n", + "Cbc0010I After 2908000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (271.43 seconds)\n", + "Cbc0010I After 2909000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (271.50 seconds)\n", + "Cbc0010I After 2910000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (271.57 seconds)\n", + "Cbc0010I After 2911000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (271.65 seconds)\n", + "Cbc0010I After 2912000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (271.75 seconds)\n", + "Cbc0010I After 2913000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (271.87 seconds)\n", + "Cbc0010I After 2914000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (271.94 seconds)\n", + "Cbc0010I After 2915000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (272.02 seconds)\n", + "Cbc0010I After 2916000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (272.13 seconds)\n", + "Cbc0010I After 2917000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (272.22 seconds)\n", + "Cbc0010I After 2918000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (272.35 seconds)\n", + "Cbc0010I After 2919000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (272.53 seconds)\n", + "Cbc0010I After 2920000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (272.64 seconds)\n", + "Cbc0010I After 2921000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (272.83 seconds)\n", + "Cbc0010I After 2922000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (272.99 seconds)\n", + "Cbc0010I After 2923000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (273.10 seconds)\n", + "Cbc0010I After 2924000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (273.20 seconds)\n", + "Cbc0010I After 2925000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (273.29 seconds)\n", + "Cbc0010I After 2926000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (273.43 seconds)\n", + "Cbc0010I After 2927000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (273.57 seconds)\n", + "Cbc0010I After 2928000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (273.73 seconds)\n", + "Cbc0010I After 2929000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (273.89 seconds)\n", + "Cbc0010I After 2930000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (274.02 seconds)\n", + "Cbc0010I After 2931000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (274.12 seconds)\n", + "Cbc0010I After 2932000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (274.23 seconds)\n", + "Cbc0010I After 2933000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (274.33 seconds)\n", + "Cbc0010I After 2934000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (274.45 seconds)\n", + "Cbc0010I After 2935000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (274.54 seconds)\n", + "Cbc0010I After 2936000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (274.64 seconds)\n", + "Cbc0010I After 2937000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (274.73 seconds)\n", + "Cbc0010I After 2938000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (274.80 seconds)\n", + "Cbc0010I After 2939000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (274.8 954 on tree, 1e+50 best solution, best possible 0 (30.83 seconds)\n", + "Cbc0010I After 112000 nodes, 938 on tree, 1e+50 best solution, best possible 0 (30.96 seconds)\n", + "Cbc0010I After 113000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (31.11 seconds)\n", + "Cbc0010I After 114000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (31.24 seconds)\n", + "Cbc0010I After 115000 nodes, 942 on tree, 1e+50 best solution, best possible 0 (31.37 seconds)\n", + "Cbc0010I After 116000 nodes, 949 on tree, 1e+50 best solution, best possible 0 (31.51 seconds)\n", + "Cbc0010I After 117000 nodes, 970 on tree, 1e+50 best solution, best possible 0 (31.69 seconds)\n", + "Cbc0010I After 118000 nodes, 969 on tree, 1e+50 best solution, best possible 0 (31.99 seconds)\n", + "Cbc0010I After 119000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (32.33 seconds)\n", + "Cbc0010I After 120000 nodes, 977 on tree, 1e+50 best solution, best possible 0 (32.56 seconds)\n", + "Cbc0010I After 121000 nodes, 946 on tree, 1e+50 best solution, best possible 0 (32.74 seconds)\n", + "Cbc0010I After 122000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (32.95 seconds)\n", + "Cbc0010I After 123000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (33.22 seconds)\n", + "Cbc0010I After 124000 nodes, 945 on tree, 1e+50 best solution, best possible 0 (33.43 seconds)\n", + "Cbc0010I After 125000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (33.61 seconds)\n", + "Cbc0010I After 126000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (33.77 seconds)\n", + "Cbc0010I After 127000 nodes, 928 on tree, 1e+50 best solution, best possible 0 (33.92 seconds)\n", + "Cbc0010I After 128000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (34.02 seconds)\n", + "Cbc0010I After 129000 nodes, 985 on tree, 1e+50 best solution, best possible 0 (34.13 seconds)\n", + "Cbc0010I After 130000 nodes, 984 on tree, 1e+50 best solution, best possible 0 (34.29 seconds)\n", + "Cbc0010I After 131000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (34.43 seconds)\n", + "Cbc0010I After 132000 nodes, 959 on tree, 1e+50 best solution, best possible 0 (34.63 seconds)\n", + "Cbc0010I After 133000 nodes, 932 on tree, 1e+50 best solution, best possible 0 (34.80 seconds)\n", + "Cbc0010I After 134000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (34.99 seconds)\n", + "Cbc0010I After 135000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (35.15 seconds)\n", + "Cbc0010I After 136000 nodes, 953 on tree, 1e+50 best solution, best possible 0 (35.32 seconds)\n", + "Cbc0010I After 137000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (35.49 seconds)\n", + "Cbc0010I After 138000 nodes, 979 on tree, 1e+50 best solution, best possible 0 (35.62 seconds)\n", + "Cbc0010I After 139000 nodes, 963 on tree, 1e+50 best solution, best possible 0 (35.77 seconds)\n", + "Cbc0010I After 140000 nodes, 974 on tree, 1e+50 best solution, best possible 0 (35.91 seconds)\n", + "Cbc0010I After 141000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (36.04 seconds)\n", + "Cbc0010I After 142000 nodes, 903 on tree, 1e+50 best solution, best possible 0 (36.19 seconds)\n", + "Cbc0010I After 143000 nodes, 924 on tree, 1e+50 best solution, best possible 0 (36.40 seconds)\n", + "Cbc0010I After 144000 nodes, 968 on tree, 1e+50 best solution, best possible 0 (36.65 seconds)\n", + "Cbc0010I After 145000 nodes, 960 on tree, 1e+50 best solution, best possible 0 (36.85 seconds)\n", + "Cbc0010I After 146000 nodes, 942 on tree, 1e+50 best solution, best possible 0 (37.04 seconds)\n", + "Cbc0010I After 147000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (37.20 seconds)\n", + "Cbc0010I After 148000 nodes, 948 on tree, 1e+50 best solution, best possible 0 (37.33 seconds)\n", + "Cbc0010I After 149000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (37.43 seconds)\n", + "Cbc0010I After 150000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (37.54 seconds)\n", + "Cbc0010I After 151000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (37.64 seconds)\n", + "Cbc0010I After 152000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (37.76 seconds)\n", + "Cbc0010I After 153000 nodes, 967 on tree, 1e+50 best solution, best possible 0 (37.90 seconds)\n", + "Cbc0010I After 154000 nodes, 952 on tre9 seconds)\n", + "Cbc0010I After 2940000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (274.97 seconds)\n", + "Cbc0010I After 2941000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (275.04 seconds)\n", + "Cbc0010I After 2942000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (275.12 seconds)\n", + "Cbc0010I After 2943000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (275.19 seconds)\n", + "Cbc0010I After 2944000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (275.26 seconds)\n", + "Cbc0010I After 2945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (275.35 seconds)\n", + "Cbc0010I After 2946000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (275.47 seconds)\n", + "Cbc0010I After 2947000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (275.60 seconds)\n", + "Cbc0010I After 2948000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (275.76 seconds)\n", + "Cbc0010I After 2949000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (275.89 seconds)\n", + "Cbc0010I After 2950000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (276.00 seconds)\n", + "Cbc0010I After 2951000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (276.14 seconds)\n", + "Cbc0010I After 2952000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (276.29 seconds)\n", + "Cbc0010I After 2953000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (276.38 seconds)\n", + "Cbc0010I After 2954000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (276.48 seconds)\n", + "Cbc0010I After 2955000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (276.59 seconds)\n", + "Cbc0010I After 2956000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (276.75 seconds)\n", + "Cbc0010I After 2957000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (276.89 seconds)\n", + "Cbc0010I After 2958000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (277.04 seconds)\n", + "Cbc0010I After 2959000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (277.14 seconds)\n", + "Cbc0010I After 2960000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (277.24 seconds)\n", + "Cbc0010I After 2961000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (277.35 seconds)\n", + "Cbc0010I After 2962000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (277.48 seconds)\n", + "Cbc0010I After 2963000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (277.63 seconds)\n", + "Cbc0010I After 2964000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (277.75 seconds)\n", + "Cbc0010I After 2965000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (277.85 seconds)\n", + "Cbc0010I After 2966000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (277.95 seconds)\n", + "Cbc0010I After 2967000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (278.04 seconds)\n", + "Cbc0010I After 2968000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (278.13 seconds)\n", + "Cbc0010I After 2969000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (278.23 seconds)\n", + "Cbc0010I After 2970000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (278.30 seconds)\n", + "Cbc0010I After 2971000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (278.40 seconds)\n", + "Cbc0010I After 2972000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (278.54 seconds)\n", + "Cbc0010I After 2973000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (278.63 seconds)\n", + "Cbc0010I After 2974000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (278.73 seconds)\n", + "Cbc0010I After 2975000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (278.84 seconds)\n", + "Cbc0010I After 2976000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (278.97 seconds)\n", + "Cbc0010I After 2977000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (279.12 seconds)\n", + "Cbc0010I After 2978000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (279.21 seconds)\n", + "Cbc0010I After 2979000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (279.29 seconds)\n", + "Cbc0010I After 2980000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (279.34 seconds)\n", + "Cbc0010I After 2981000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (279.44 seconds)\n", + "Cbc0010I After 2982000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (279.56 seconds)\n", + "Cbc0010I After 2983000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (279.64 seconds)\n", + "Cbc0010I After 2984000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (279.74 seconds)\n", + "Cbc0010I After 2985000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (279.83 seconds)\n", + "Cbc0010I After 2986000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (279.89 seconds)\n", + "Cbc0010I After 2987000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (280.01 seconds)\n", + "Cbc0010I After 2988000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (280.13 seconds)\n", + "Cbc0010I After 2989000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (280.26 seconds)\n", + "Cbc0010I After 2990000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (280.34 seconds)\n", + "Cbc0010I After 2991000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (280.42 seconds)\n", + "Cbc0010I After 2992000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (280.48 seconds)\n", + "Cbc0010I After 2993000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (280.55 seconds)\n", + "Cbc0010I After 2994000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (280.63 seconds)\n", + "Cbc0010I After 2995000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (280.70 seconds)\n", + "Cbc0010I After 2996000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (280.85 seconds)\n", + "Cbc0010I After 2997000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (281.04 seconds)\n", + "Cbc0010I After 2998000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (281.29 seconds)\n", + "Cbc0010I After 2999000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (281.53 seconds)\n", + "Cbc0010I After 3000000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (281.75 seconds)\n", + "Cbc0010I After 3001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (281.90 seconds)\n", + "Cbc0010I After 3002000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (282.02 seconds)\n", + "Cbc0010I After 3003000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (282.15 seconds)\n", + "Cbc0010I After 3004000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (282.24 seconds)\n", + "Cbc0010I After 3005000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (282.30 seconds)\n", + "Cbc0010I After 3006000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (282.37 seconds)\n", + "Cbc0010I After 3007000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (282.44 seconds)\n", + "Cbc0010I After 3008000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (282.49 seconds)\n", + "Cbc0010I After 3009000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (282.55 seconds)\n", + "Cbc0010I After 3010000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (282.60 seconds)\n", + "Cbc0010I After 3011000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (282.66 seconds)\n", + "Cbc0010I After 3012000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (282.72 seconds)\n", + "Cbc0010I After 3013000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (282.79 seconds)\n", + "Cbc0010I After 3014000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (282.87 seconds)\n", + "Cbc0010I After 3015000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (282.95 seconds)\n", + "Cbc0010I After 3016000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (283.04 seconds)\n", + "Cbc0010I After 3017000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (283.15 seconds)\n", + "Cbc0010I After 3018000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (283.22 seconds)\n", + "Cbc0010I After 3019000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (283.36 seconds)\n", + "Cbc0010I After 3020000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (283.53 seconds)\n", + "Cbc0010I After 3021000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (283.66 seconds)\n", + "Cbc0010I After 3022000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (283.80 seconds)\n", + "Cbc0010I After 3023000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (283.95 seconds)\n", + "Cbc0010I After 3024000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (284.07 see, 1e+50 best solution, best possible 0 (38.05 seconds)\n", + "Cbc0010I After 155000 nodes, 963 on tree, 1e+50 best solution, best possible 0 (38.22 seconds)\n", + "Cbc0010I After 156000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (38.39 seconds)\n", + "Cbc0010I After 157000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (38.55 seconds)\n", + "Cbc0010I After 158000 nodes, 913 on tree, 1e+50 best solution, best possible 0 (38.71 seconds)\n", + "Cbc0010I After 159000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (38.85 seconds)\n", + "Cbc0010I After 160000 nodes, 874 on tree, 1e+50 best solution, best possible 0 (39.03 seconds)\n", + "Cbc0010I After 161000 nodes, 983 on tree, 1e+50 best solution, best possible 0 (39.21 seconds)\n", + "Cbc0010I After 162000 nodes, 973 on tree, 1e+50 best solution, best possible 0 (39.37 seconds)\n", + "Cbc0010I After 163000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (39.53 seconds)\n", + "Cbc0010I After 164000 nodes, 938 on tree, 1e+50 best solution, best possible 0 (39.66 seconds)\n", + "Cbc0010I After 165000 nodes, 921 on tree, 1e+50 best solution, best possible 0 (39.79 seconds)\n", + "Cbc0010I After 166000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (39.92 seconds)\n", + "Cbc0010I After 167000 nodes, 933 on tree, 1e+50 best solution, best possible 0 (40.07 seconds)\n", + "Cbc0010I After 168000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (40.21 seconds)\n", + "Cbc0010I After 169000 nodes, 960 on tree, 1e+50 best solution, best possible 0 (40.36 seconds)\n", + "Cbc0010I After 170000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (40.50 seconds)\n", + "Cbc0010I After 171000 nodes, 920 on tree, 1e+50 best solution, best possible 0 (40.70 seconds)\n", + "Cbc0010I After 172000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (40.92 seconds)\n", + "Cbc0010I After 173000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (41.14 seconds)\n", + "Cbc0010I After 174000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (41.30 seconds)\n", + "Cbc0010I After 175000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (41.43 seconds)\n", + "Cbc0010I After 176000 nodes, 919 on tree, 1e+50 best solution, best possible 0 (41.56 seconds)\n", + "Cbc0010I After 177000 nodes, 921 on tree, 1e+50 best solution, best possible 0 (41.69 seconds)\n", + "Cbc0010I After 178000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (41.82 seconds)\n", + "Cbc0010I After 179000 nodes, 925 on tree, 1e+50 best solution, best possible 0 (41.96 seconds)\n", + "Cbc0010I After 180000 nodes, 957 on tree, 1e+50 best solution, best possible 0 (42.07 seconds)\n", + "Cbc0010I After 181000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (42.19 seconds)\n", + "Cbc0010I After 182000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (42.31 seconds)\n", + "Cbc0010I After 183000 nodes, 896 on tree, 1e+50 best solution, best possible 0 (42.42 seconds)\n", + "Cbc0010I After 184000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (42.54 seconds)\n", + "Cbc0010I After 185000 nodes, 906 on tree, 1e+50 best solution, best possible 0 (42.70 seconds)\n", + "Cbc0010I After 186000 nodes, 885 on tree, 1e+50 best solution, best possible 0 (42.85 seconds)\n", + "Cbc0010I After 187000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (43.04 seconds)\n", + "Cbc0010I After 188000 nodes, 918 on tree, 1e+50 best solution, best possible 0 (43.19 seconds)\n", + "Cbc0010I After 189000 nodes, 941 on tree, 1e+50 best solution, best possible 0 (43.33 seconds)\n", + "Cbc0010I After 190000 nodes, 933 on tree, 1e+50 best solution, best possible 0 (43.47 seconds)\n", + "Cbc0010I After 191000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (43.59 seconds)\n", + "Cbc0010I After 192000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (43.70 seconds)\n", + "Cbc0010I After 193000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (43.84 seconds)\n", + "Cbc0010I After 194000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (43.97 seconds)\n", + "Cbc0010I After 195000 nodes, 917 on tree, 1e+50 best solution, best possible 0 (44.13 seconds)\n", + "Cbc0010I After 196000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (44.33 seconds)\n", + "Cbc0010I After 197000 nodes, 917 on tree, 1e+50 beconds)\n", + "Cbc0010I After 3025000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (284.17 seconds)\n", + "Cbc0010I After 3026000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (284.30 seconds)\n", + "Cbc0010I After 3027000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (284.38 seconds)\n", + "Cbc0010I After 3028000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (284.48 seconds)\n", + "Cbc0010I After 3029000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (284.63 seconds)\n", + "Cbc0010I After 3030000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (284.83 seconds)\n", + "Cbc0010I After 3031000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (285.01 seconds)\n", + "Cbc0010I After 3032000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (285.19 seconds)\n", + "Cbc0010I After 3033000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (285.35 seconds)\n", + "Cbc0010I After 3034000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (285.55 seconds)\n", + "Cbc0010I After 3035000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (285.69 seconds)\n", + "Cbc0010I After 3036000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (285.81 seconds)\n", + "Cbc0010I After 3037000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (285.95 seconds)\n", + "Cbc0010I After 3038000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (286.08 seconds)\n", + "Cbc0010I After 3039000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (286.22 seconds)\n", + "Cbc0010I After 3040000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (286.37 seconds)\n", + "Cbc0010I After 3041000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (286.53 seconds)\n", + "Cbc0010I After 3042000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (286.62 seconds)\n", + "Cbc0010I After 3043000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (286.71 seconds)\n", + "Cbc0010I After 3044000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (286.80 seconds)\n", + "Cbc0010I After 3045000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (286.94 seconds)\n", + "Cbc0010I After 3046000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (287.09 seconds)\n", + "Cbc0010I After 3047000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (287.22 seconds)\n", + "Cbc0010I After 3048000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (287.40 seconds)\n", + "Cbc0010I After 3049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (287.60 seconds)\n", + "Cbc0010I After 3050000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (287.80 seconds)\n", + "Cbc0010I After 3051000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (287.94 seconds)\n", + "Cbc0010I After 3052000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (288.07 seconds)\n", + "Cbc0010I After 3053000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (288.21 seconds)\n", + "Cbc0010I After 3054000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (288.33 seconds)\n", + "Cbc0010I After 3055000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (288.48 seconds)\n", + "Cbc0010I After 3056000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (288.66 seconds)\n", + "Cbc0010I After 3057000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (288.83 seconds)\n", + "Cbc0010I After 3058000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (289.09 seconds)\n", + "Cbc0010I After 3059000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (289.25 seconds)\n", + "Cbc0010I After 3060000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (289.47 seconds)\n", + "Cbc0010I After 3061000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (289.62 seconds)\n", + "Cbc0010I After 3062000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (289.75 seconds)\n", + "Cbc0010I After 3063000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (289.92 seconds)\n", + "Cbc0010I After 3064000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (290.03 seconds)\n", + "Cbc0010I After 3065000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (290.14 seconds)\n", + "Cbc0010I After 3066000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (290.23 seconds)\n", + "Cbc0010I After 3067000 nodes, 94 on tree, 1e+50st solution, best possible 0 (44.49 seconds)\n", + "Cbc0010I After 198000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (44.67 seconds)\n", + "Cbc0010I After 199000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (44.84 seconds)\n", + "Cbc0010I After 200000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (45.03 seconds)\n", + "Cbc0010I After 201000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (45.22 seconds)\n", + "Cbc0010I After 202000 nodes, 939 on tree, 1e+50 best solution, best possible 0 (45.38 seconds)\n", + "Cbc0010I After 203000 nodes, 916 on tree, 1e+50 best solution, best possible 0 (45.57 seconds)\n", + "Cbc0010I After 204000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (45.79 seconds)\n", + "Cbc0010I After 205000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (46.02 seconds)\n", + "Cbc0010I After 206000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (46.17 seconds)\n", + "Cbc0010I After 207000 nodes, 974 on tree, 1e+50 best solution, best possible 0 (46.31 seconds)\n", + "Cbc0010I After 208000 nodes, 936 on tree, 1e+50 best solution, best possible 0 (46.45 seconds)\n", + "Cbc0010I After 209000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (46.60 seconds)\n", + "Cbc0010I After 210000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (46.74 seconds)\n", + "Cbc0010I After 211000 nodes, 894 on tree, 1e+50 best solution, best possible 0 (46.85 seconds)\n", + "Cbc0010I After 212000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (47.04 seconds)\n", + "Cbc0010I After 213000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (47.19 seconds)\n", + "Cbc0010I After 214000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (47.34 seconds)\n", + "Cbc0010I After 215000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (47.49 seconds)\n", + "Cbc0010I After 216000 nodes, 976 on tree, 1e+50 best solution, best possible 0 (47.66 seconds)\n", + "Cbc0010I After 217000 nodes, 954 on tree, 1e+50 best solution, best possible 0 (47.78 seconds)\n", + "Cbc0010I After 218000 nodes, 936 on tree, 1e+50 best solution, best possible 0 (47.92 seconds)\n", + "Cbc0010I After 219000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (48.09 seconds)\n", + "Cbc0010I After 220000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (48.25 seconds)\n", + "Cbc0010I After 221000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (48.45 seconds)\n", + "Cbc0010I After 222000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (48.67 seconds)\n", + "Cbc0010I After 223000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (48.87 seconds)\n", + "Cbc0010I After 224000 nodes, 908 on tree, 1e+50 best solution, best possible 0 (49.10 seconds)\n", + "Cbc0010I After 225000 nodes, 971 on tree, 1e+50 best solution, best possible 0 (49.29 seconds)\n", + "Cbc0010I After 226000 nodes, 953 on tree, 1e+50 best solution, best possible 0 (49.48 seconds)\n", + "Cbc0010I After 227000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (49.66 seconds)\n", + "Cbc0010I After 228000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (49.77 seconds)\n", + "Cbc0010I After 229000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (49.89 seconds)\n", + "Cbc0010I After 230000 nodes, 903 on tree, 1e+50 best solution, best possible 0 (50.02 seconds)\n", + "Cbc0010I After 231000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (50.14 seconds)\n", + "Cbc0010I After 232000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (50.26 seconds)\n", + "Cbc0010I After 233000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (50.37 seconds)\n", + "Cbc0010I After 234000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (50.56 seconds)\n", + "Cbc0010I After 235000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (50.78 seconds)\n", + "Cbc0010I After 236000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (50.96 seconds)\n", + "Cbc0010I After 237000 nodes, 969 on tree, 1e+50 best solution, best possible 0 (51.20 seconds)\n", + "Cbc0010I After 238000 nodes, 950 on tree, 1e+50 best solution, best possible 0 (51.39 seconds)\n", + "Cbc0010I After 239000 nodes, 935 on tree, 1e+50 best solution, best possible 0 (51.63 seconds)\n", + "Cbc0010I After 240000 nodes, 921 on tree, 1e+50 best solution best solution, best possible 0 (290.32 seconds)\n", + "Cbc0010I After 3068000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (290.43 seconds)\n", + "Cbc0010I After 3069000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (290.50 seconds)\n", + "Cbc0010I After 3070000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (290.60 seconds)\n", + "Cbc0010I After 3071000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (290.72 seconds)\n", + "Cbc0010I After 3072000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (290.84 seconds)\n", + "Cbc0010I After 3073000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (290.99 seconds)\n", + "Cbc0010I After 3074000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (291.11 seconds)\n", + "Cbc0010I After 3075000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (291.23 seconds)\n", + "Cbc0010I After 3076000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (291.32 seconds)\n", + "Cbc0010I After 3077000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (291.41 seconds)\n", + "Cbc0010I After 3078000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (291.53 seconds)\n", + "Cbc0010I After 3079000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (291.68 seconds)\n", + "Cbc0010I After 3080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (291.82 seconds)\n", + "Cbc0010I After 3081000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (292.01 seconds)\n", + "Cbc0010I After 3082000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (292.17 seconds)\n", + "Cbc0010I After 3083000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (292.34 seconds)\n", + "Cbc0010I After 3084000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (292.52 seconds)\n", + "Cbc0010I After 3085000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (292.68 seconds)\n", + "Cbc0010I After 3086000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (292.82 seconds)\n", + "Cbc0010I After 3087000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (292.96 seconds)\n", + "Cbc0010I After 3088000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (293.11 seconds)\n", + "Cbc0010I After 3089000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (293.24 seconds)\n", + "Cbc0010I After 3090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (293.41 seconds)\n", + "Cbc0010I After 3091000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.49 seconds)\n", + "Cbc0010I After 3092000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.56 seconds)\n", + "Cbc0010I After 3093000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (293.62 seconds)\n", + "Cbc0010I After 3094000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.71 seconds)\n", + "Cbc0010I After 3095000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (293.76 seconds)\n", + "Cbc0010I After 3096000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.81 seconds)\n", + "Cbc0010I After 3097000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.86 seconds)\n", + "Cbc0010I After 3098000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (293.91 seconds)\n", + "Cbc0010I After 3099000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (293.97 seconds)\n", + "Cbc0010I After 3100000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (294.01 seconds)\n", + "Cbc0010I After 3101000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (294.07 seconds)\n", + "Cbc0010I After 3102000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.11 seconds)\n", + "Cbc0010I After 3103000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (294.22 seconds)\n", + "Cbc0010I After 3104000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (294.31 seconds)\n", + "Cbc0010I After 3105000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (294.38 seconds)\n", + "Cbc0010I After 3106000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.45 seconds)\n", + "Cbc0010I After 3107000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (294.52 seconds)\n", + "Cbc0010I After 3108000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (294.58 seconds)\n", + "Cbc0010I After 3109000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (294.77 seconds)\n", + "Cbc0010I After 3110000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.90 seconds)\n", + "Cbc0010I After 3111000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (295.07 seconds)\n", + "Cbc0010I After 3112000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (295.27 seconds)\n", + "Cbc0010I After 3113000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (295.42 seconds)\n", + "Cbc0010I After 3114000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (295.52 seconds)\n", + "Cbc0010I After 3115000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (295.63 seconds)\n", + "Cbc0010I After 3116000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (295.78 seconds)\n", + "Cbc0010I After 3117000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (295.90 seconds)\n", + "Cbc0010I After 3118000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (295.98 seconds)\n", + "Cbc0010I After 3119000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (296.07 seconds)\n", + "Cbc0010I After 3120000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (296.19 seconds)\n", + "Cbc0010I After 3121000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (296.30 seconds)\n", + "Cbc0010I After 3122000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (296.40 seconds)\n", + "Cbc0010I After 3123000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (296.54 seconds)\n", + "Cbc0010I After 3124000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (296.62 seconds)\n", + "Cbc0010I After 3125000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (296.72 seconds)\n", + "Cbc0010I After 3126000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (296.87 seconds)\n", + "Cbc0010I After 3127000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (296.99 seconds)\n", + "Cbc0010I After 3128000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (297.15 seconds)\n", + "Cbc0010I After 3129000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (297.23 seconds)\n", + "Cbc0010I After 3130000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (297.32 seconds)\n", + "Cbc0010I After 3131000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (297.39 seconds)\n", + "Cbc0010I After 3132000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (297.49 seconds)\n", + "Cbc0010I After 3133000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (297.58 seconds)\n", + "Cbc0010I After 3134000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (297.65 seconds)\n", + "Cbc0010I After 3135000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (297.74 seconds)\n", + "Cbc0010I After 3136000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (297.89 seconds)\n", + "Cbc0010I After 3137000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (298.01 seconds)\n", + "Cbc0010I After 3138000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (298.08 seconds)\n", + "Cbc0010I After 3139000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (298.13 seconds)\n", + "Cbc0010I After 3140000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (298.24 seconds)\n", + "Cbc0010I After 3141000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (298.32 seconds)\n", + "Cbc0010I After 3142000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (298.43 seconds)\n", + "Cbc0010I After 3143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (298.55 seconds)\n", + "Cbc0010I After 3144000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (298.63 seconds)\n", + "Cbc0010I After 3145000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (298.72 seconds)\n", + "Cbc0010I After 3146000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (298.79 seconds)\n", + "Cbc0010I After 3147000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (298.86 seconds)\n", + "Cbc0010I After 3148000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (298.93 seconds)\n", + "Cbc0010I After 3149000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (299.00 seconds)\n", + "Cbc0010I After 3150000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (299.08 seconds)\n", + "Cbc0010I After 3151000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (299.17 seconds)\n", + "Cbc0010I After 3152000 nodes, 103 on tree, 1e+50 best s, best possible 0 (51.82 seconds)\n", + "Cbc0010I After 241000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (51.98 seconds)\n", + "Cbc0010I After 242000 nodes, 882 on tree, 1e+50 best solution, best possible 0 (52.21 seconds)\n", + "Cbc0010I After 243000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (52.41 seconds)\n", + "Cbc0010I After 244000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (52.57 seconds)\n", + "Cbc0010I After 245000 nodes, 949 on tree, 1e+50 best solution, best possible 0 (52.73 seconds)\n", + "Cbc0010I After 246000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (52.87 seconds)\n", + "Cbc0010I After 247000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (52.97 seconds)\n", + "Cbc0010I After 248000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (53.07 seconds)\n", + "Cbc0010I After 249000 nodes, 882 on tree, 1e+50 best solution, best possible 0 (53.22 seconds)\n", + "Cbc0010I After 250000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (53.32 seconds)\n", + "Cbc0010I After 251000 nodes, 871 on tree, 1e+50 best solution, best possible 0 (53.41 seconds)\n", + "Cbc0010I After 252000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (53.51 seconds)\n", + "Cbc0010I After 253000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (53.60 seconds)\n", + "Cbc0010I After 254000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (53.69 seconds)\n", + "Cbc0010I After 255000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (53.82 seconds)\n", + "Cbc0010I After 256000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (53.94 seconds)\n", + "Cbc0010I After 257000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (54.06 seconds)\n", + "Cbc0010I After 258000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (54.25 seconds)\n", + "Cbc0010I After 259000 nodes, 879 on tree, 1e+50 best solution, best possible 0 (54.42 seconds)\n", + "Cbc0010I After 260000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (54.60 seconds)\n", + "Cbc0010I After 261000 nodes, 951 on tree, 1e+50 best solution, best possible 0 (54.84 seconds)\n", + "Cbc0010I After 262000 nodes, 937 on tree, 1e+50 best solution, best possible 0 (55.07 seconds)\n", + "Cbc0010I After 263000 nodes, 918 on tree, 1e+50 best solution, best possible 0 (55.32 seconds)\n", + "Cbc0010I After 264000 nodes, 928 on tree, 1e+50 best solution, best possible 0 (55.54 seconds)\n", + "Cbc0010I After 265000 nodes, 896 on tree, 1e+50 best solution, best possible 0 (55.79 seconds)\n", + "Cbc0010I After 266000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (55.99 seconds)\n", + "Cbc0010I After 267000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (56.22 seconds)\n", + "Cbc0010I After 268000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (56.40 seconds)\n", + "Cbc0010I After 269000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (56.58 seconds)\n", + "Cbc0010I After 270000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (56.81 seconds)\n", + "Cbc0010I After 271000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (56.96 seconds)\n", + "Cbc0010I After 272000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (57.09 seconds)\n", + "Cbc0010I After 273000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (57.29 seconds)\n", + "Cbc0010I After 274000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (57.50 seconds)\n", + "Cbc0010I After 275000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (57.69 seconds)\n", + "Cbc0010I After 276000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (57.86 seconds)\n", + "Cbc0010I After 277000 nodes, 894 on tree, 1e+50 best solution, best possible 0 (58.03 seconds)\n", + "Cbc0010I After 278000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (58.25 seconds)\n", + "Cbc0010I After 279000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (58.44 seconds)\n", + "Cbc0010I After 280000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (58.65 seconds)\n", + "Cbc0010I After 281000 nodes, 851 on tree, 1e+50 best solution, best possible 0 (58.83 seconds)\n", + "Cbc0010I After 282000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (59.12 seconds)\n", + "Cbc0010I After 283000 nodes, 855 on tree, 1e+50 best solution, best possolution, best possible 0 (299.26 seconds)\n", + "Cbc0010I After 3153000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (299.35 seconds)\n", + "Cbc0010I After 3154000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (299.52 seconds)\n", + "Cbc0010I After 3155000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (299.69 seconds)\n", + "Cbc0010I After 3156000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (299.79 seconds)\n", + "Cbc0010I After 3157000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (299.93 seconds)\n", + "Cbc0010I After 3158000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (300.11 seconds)\n", + "Cbc0010I After 3159000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (300.19 seconds)\n", + "Cbc0010I After 3160000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (300.26 seconds)\n", + "Cbc0010I After 3161000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (300.39 seconds)\n", + "Cbc0010I After 3162000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (300.53 seconds)\n", + "Cbc0010I After 3163000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (300.65 seconds)\n", + "Cbc0010I After 3164000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (300.79 seconds)\n", + "Cbc0010I After 3165000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (300.95 seconds)\n", + "Cbc0010I After 3166000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (301.07 seconds)\n", + "Cbc0010I After 3167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (301.19 seconds)\n", + "Cbc0010I After 3168000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (301.31 seconds)\n", + "Cbc0010I After 3169000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (301.40 seconds)\n", + "Cbc0010I After 3170000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (301.48 seconds)\n", + "Cbc0010I After 3171000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (301.56 seconds)\n", + "Cbc0010I After 3172000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (301.67 seconds)\n", + "Cbc0010I After 3173000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (301.76 seconds)\n", + "Cbc0010I After 3174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (301.84 seconds)\n", + "Cbc0010I After 3175000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (302.01 seconds)\n", + "Cbc0010I After 3176000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (302.12 seconds)\n", + "Cbc0010I After 3177000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (302.25 seconds)\n", + "Cbc0010I After 3178000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (302.37 seconds)\n", + "Cbc0010I After 3179000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (302.46 seconds)\n", + "Cbc0010I After 3180000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (302.55 seconds)\n", + "Cbc0010I After 3181000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (302.65 seconds)\n", + "Cbc0010I After 3182000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (302.73 seconds)\n", + "Cbc0010I After 3183000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (302.80 seconds)\n", + "Cbc0010I After 3184000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (302.96 seconds)\n", + "Cbc0010I After 3185000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (303.10 seconds)\n", + "Cbc0010I After 3186000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (303.23 seconds)\n", + "Cbc0010I After 3187000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (303.32 seconds)\n", + "Cbc0010I After 3188000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (303.41 seconds)\n", + "Cbc0010I After 3189000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (303.48 seconds)\n", + "Cbc0010I After 3190000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (303.59 seconds)\n", + "Cbc0010I After 3191000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (303.68 seconds)\n", + "Cbc0010I After 3192000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (303.79 seconds)\n", + "Cbc0010I After 3193000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (303.89 seconds)\n", + "Cbc0010I After 3194000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (303.97 seconds)\n", + "Cbc0010I After 3195000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (304.07 seconds)\n", + "Cbc0010I After 3196000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (304.17 seconds)\n", + "Cbc0010I After 3197000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (304.46 seconds)\n", + "Cbc0010I After 3198000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (304.63 seconds)\n", + "Cbc0010I After 3199000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (304.87 seconds)\n", + "Cbc0010I After 3200000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (305.08 seconds)\n", + "Cbc0010I After 3201000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (305.34 seconds)\n", + "Cbc0010I After 3202000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (305.56 seconds)\n", + "Cbc0010I After 3203000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (305.92 seconds)\n", + "Cbc0010I After 3204000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (306.40 seconds)\n", + "Cbc0010I After 3205000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (306.54 seconds)\n", + "Cbc0010I After 3206000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (306.66 seconds)\n", + "Cbc0010I After 3207000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (306.79 seconds)\n", + "Cbc0010I After 3208000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (306.92 seconds)\n", + "Cbc0010I After 3209000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (307.10 seconds)\n", + "Cbc0010I After 3210000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (307.21 seconds)\n", + "Cbc0010I After 3211000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (307.32 seconds)\n", + "Cbc0010I After 3212000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (307.41 seconds)\n", + "Cbc0010I After 3213000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (307.52 seconds)\n", + "Cbc0010I After 3214000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (307.61 seconds)\n", + "Cbc0010I After 3215000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (307.72 seconds)\n", + "Cbc0010I After 3216000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (307.89 seconds)\n", + "Cbc0010I After 3217000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (308.05 seconds)\n", + "Cbc0010I After 3218000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (308.18 seconds)\n", + "Cbc0010I After 3219000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (308.32 seconds)\n", + "Cbc0010I After 3220000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (308.68 seconds)\n", + "Cbc0010I After 3221000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (308.93 seconds)\n", + "Cbc0010I After 3222000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (309.12 seconds)\n", + "Cbc0010I After 3223000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (309.32 seconds)\n", + "Cbc0010I After 3224000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (309.53 seconds)\n", + "Cbc0010I After 3225000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (309.71 seconds)\n", + "Cbc0010I After 3226000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (309.90 seconds)\n", + "Cbc0010I After 3227000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.12 seconds)\n", + "Cbc0010I After 3228000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.30 seconds)\n", + "Cbc0010I After 3229000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (310.53 seconds)\n", + "Cbc0010I After 3230000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (310.71 seconds)\n", + "Cbc0010I After 3231000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.85 seconds)\n", + "Cbc0010I After 3232000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (311.03 seconds)\n", + "Cbc0010I After 3233000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (311.22 seconds)\n", + "Cbc0010I After 3234000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (311.39 seconds)\n", + "Cbc0010I After 3235000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (311.54 seconds)\n", + "Cbc0010I After 3236000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (311.73 seconds)\n", + "Cbc0010I After 3237000 nodes, 80 on tree, 1e+50 best solution,ible 0 (59.36 seconds)\n", + "Cbc0010I After 284000 nodes, 870 on tree, 1e+50 best solution, best possible 0 (59.51 seconds)\n", + "Cbc0010I After 285000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (59.69 seconds)\n", + "Cbc0010I After 286000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (59.82 seconds)\n", + "Cbc0010I After 287000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (59.96 seconds)\n", + "Cbc0010I After 288000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (60.13 seconds)\n", + "Cbc0010I After 289000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (60.45 seconds)\n", + "Cbc0010I After 290000 nodes, 883 on tree, 1e+50 best solution, best possible 0 (60.77 seconds)\n", + "Cbc0010I After 291000 nodes, 827 on tree, 1e+50 best solution, best possible 0 (61.02 seconds)\n", + "Cbc0010I After 292000 nodes, 870 on tree, 1e+50 best solution, best possible 0 (61.31 seconds)\n", + "Cbc0010I After 293000 nodes, 917 on tree, 1e+50 best solution, best possible 0 (61.61 seconds)\n", + "Cbc0010I After 294000 nodes, 878 on tree, 1e+50 best solution, best possible 0 (61.94 seconds)\n", + "Cbc0010I After 295000 nodes, 877 on tree, 1e+50 best solution, best possible 0 (62.21 seconds)\n", + "Cbc0010I After 296000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (62.43 seconds)\n", + "Cbc0010I After 297000 nodes, 935 on tree, 1e+50 best solution, best possible 0 (62.63 seconds)\n", + "Cbc0010I After 298000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (62.83 seconds)\n", + "Cbc0010I After 299000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (63.06 seconds)\n", + "Cbc0010I After 300000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (63.31 seconds)\n", + "Cbc0010I After 301000 nodes, 905 on tree, 1e+50 best solution, best possible 0 (63.58 seconds)\n", + "Cbc0010I After 302000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (63.91 seconds)\n", + "Cbc0010I After 303000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (64.40 seconds)\n", + "Cbc0010I After 304000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (64.93 seconds)\n", + "Cbc0010I After 305000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (65.39 seconds)\n", + "Cbc0010I After 306000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (65.89 seconds)\n", + "Cbc0010I After 307000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (66.26 seconds)\n", + "Cbc0010I After 308000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (66.62 seconds)\n", + "Cbc0010I After 309000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (66.91 seconds)\n", + "Cbc0010I After 310000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (67.20 seconds)\n", + "Cbc0010I After 311000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (67.67 seconds)\n", + "Cbc0010I After 312000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (68.15 seconds)\n", + "Cbc0010I After 313000 nodes, 822 on tree, 1e+50 best solution, best possible 0 (68.53 seconds)\n", + "Cbc0010I After 314000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (68.87 seconds)\n", + "Cbc0010I After 315000 nodes, 841 on tree, 1e+50 best solution, best possible 0 (69.17 seconds)\n", + "Cbc0010I After 316000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (69.46 seconds)\n", + "Cbc0010I After 317000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (69.75 seconds)\n", + "Cbc0010I After 318000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (70.04 seconds)\n", + "Cbc0010I After 319000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (70.33 seconds)\n", + "Cbc0010I After 320000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (70.59 seconds)\n", + "Cbc0010I After 321000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (70.87 seconds)\n", + "Cbc0010I After 322000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (71.06 seconds)\n", + "Cbc0010I After 323000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (71.33 seconds)\n", + "Cbc0010I After 324000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (71.61 seconds)\n", + "Cbc0010I After 325000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (71.89 seconds)\n", + "Cbc0010I After 326000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (72. best possible 0 (311.97 seconds)\n", + "Cbc0010I After 3238000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (312.14 seconds)\n", + "Cbc0010I After 3239000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (312.30 seconds)\n", + "Cbc0010I After 3240000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (312.46 seconds)\n", + "Cbc0010I After 3241000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (312.66 seconds)\n", + "Cbc0010I After 3242000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (312.89 seconds)\n", + "Cbc0010I After 3243000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (313.15 seconds)\n", + "Cbc0010I After 3244000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (313.38 seconds)\n", + "Cbc0010I After 3245000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (313.55 seconds)\n", + "Cbc0010I After 3246000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (313.68 seconds)\n", + "Cbc0010I After 3247000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (313.78 seconds)\n", + "Cbc0010I After 3248000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (313.87 seconds)\n", + "Cbc0010I After 3249000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (313.94 seconds)\n", + "Cbc0010I After 3250000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (314.04 seconds)\n", + "Cbc0010I After 3251000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (314.13 seconds)\n", + "Cbc0010I After 3252000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (314.21 seconds)\n", + "Cbc0010I After 3253000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (314.27 seconds)\n", + "Cbc0010I After 3254000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (314.34 seconds)\n", + "Cbc0010I After 3255000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (314.42 seconds)\n", + "Cbc0010I After 3256000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (314.56 seconds)\n", + "Cbc0010I After 3257000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (314.77 seconds)\n", + "Cbc0010I After 3258000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (314.85 seconds)\n", + "Cbc0010I After 3259000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (314.92 seconds)\n", + "Cbc0010I After 3260000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (315.07 seconds)\n", + "Cbc0010I After 3261000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (315.21 seconds)\n", + "Cbc0010I After 3262000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (315.42 seconds)\n", + "Cbc0010I After 3263000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (315.60 seconds)\n", + "Cbc0010I After 3264000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (315.76 seconds)\n", + "Cbc0010I After 3265000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (315.92 seconds)\n", + "Cbc0010I After 3266000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (316.07 seconds)\n", + "Cbc0010I After 3267000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (316.20 seconds)\n", + "Cbc0010I After 3268000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (316.34 seconds)\n", + "Cbc0010I After 3269000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (316.46 seconds)\n", + "Cbc0010I After 3270000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (316.55 seconds)\n", + "Cbc0010I After 3271000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (316.65 seconds)\n", + "Cbc0010I After 3272000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (316.78 seconds)\n", + "Cbc0010I After 3273000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (316.90 seconds)\n", + "Cbc0010I After 3274000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (317.03 seconds)\n", + "Cbc0010I After 3275000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (317.18 seconds)\n", + "Cbc0010I After 3276000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.32 seconds)\n", + "Cbc0010I After 3277000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (317.45 seconds)\n", + "Cbc0010I After 3278000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.51 seconds)\n", + "Cbc0010I After 3279000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (317.59 seconds)\n", + "Cbc0010I After16 seconds)\n", + "Cbc0010I After 327000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (72.49 seconds)\n", + "Cbc0010I After 328000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (72.82 seconds)\n", + "Cbc0010I After 329000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (73.12 seconds)\n", + "Cbc0010I After 330000 nodes, 913 on tree, 1e+50 best solution, best possible 0 (73.32 seconds)\n", + "Cbc0010I After 331000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (73.51 seconds)\n", + "Cbc0010I After 332000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (73.68 seconds)\n", + "Cbc0010I After 333000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (73.84 seconds)\n", + "Cbc0010I After 334000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (74.05 seconds)\n", + "Cbc0010I After 335000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (74.31 seconds)\n", + "Cbc0010I After 336000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (74.52 seconds)\n", + "Cbc0010I After 337000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (74.67 seconds)\n", + "Cbc0010I After 338000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (74.92 seconds)\n", + "Cbc0010I After 339000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (75.17 seconds)\n", + "Cbc0010I After 340000 nodes, 852 on tree, 1e+50 best solution, best possible 0 (75.39 seconds)\n", + "Cbc0010I After 341000 nodes, 885 on tree, 1e+50 best solution, best possible 0 (75.58 seconds)\n", + "Cbc0010I After 342000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (75.75 seconds)\n", + "Cbc0010I After 343000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (75.92 seconds)\n", + "Cbc0010I After 344000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (76.10 seconds)\n", + "Cbc0010I After 345000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (76.27 seconds)\n", + "Cbc0010I After 346000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (76.44 seconds)\n", + "Cbc0010I After 347000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (76.61 seconds)\n", + "Cbc0010I After 348000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (76.81 seconds)\n", + "Cbc0010I After 349000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (76.98 seconds)\n", + "Cbc0010I After 350000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (77.08 seconds)\n", + "Cbc0010I After 351000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (77.21 seconds)\n", + "Cbc0010I After 352000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (77.32 seconds)\n", + "Cbc0010I After 353000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (77.41 seconds)\n", + "Cbc0010I After 354000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (77.50 seconds)\n", + "Cbc0010I After 355000 nodes, 887 on tree, 1e+50 best solution, best possible 0 (77.59 seconds)\n", + "Cbc0010I After 356000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (77.67 seconds)\n", + "Cbc0010I After 357000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (77.77 seconds)\n", + "Cbc0010I After 358000 nodes, 857 on tree, 1e+50 best solution, best possible 0 (77.86 seconds)\n", + "Cbc0010I After 359000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (77.95 seconds)\n", + "Cbc0010I After 360000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (78.06 seconds)\n", + "Cbc0010I After 361000 nodes, 813 on tree, 1e+50 best solution, best possible 0 (78.17 seconds)\n", + "Cbc0010I After 362000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (78.28 seconds)\n", + "Cbc0010I After 363000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (78.36 seconds)\n", + "Cbc0010I After 364000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (78.44 seconds)\n", + "Cbc0010I After 365000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (78.53 seconds)\n", + "Cbc0010I After 366000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (78.61 seconds)\n", + "Cbc0010I After 367000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (78.71 seconds)\n", + "Cbc0010I After 368000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (78.80 seconds)\n", + "Cbc0010I After 369000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (78.93 seconds) 3280000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (317.68 seconds)\n", + "Cbc0010I After 3281000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (317.75 seconds)\n", + "Cbc0010I After 3282000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (317.84 seconds)\n", + "Cbc0010I After 3283000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (317.93 seconds)\n", + "Cbc0010I After 3284000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (318.03 seconds)\n", + "Cbc0010I After 3285000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (318.10 seconds)\n", + "Cbc0010I After 3286000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (318.19 seconds)\n", + "Cbc0010I After 3287000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (318.29 seconds)\n", + "Cbc0010I After 3288000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (318.36 seconds)\n", + "Cbc0010I After 3289000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (318.41 seconds)\n", + "Cbc0010I After 3290000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (318.49 seconds)\n", + "Cbc0010I After 3291000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (318.58 seconds)\n", + "Cbc0010I After 3292000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (318.65 seconds)\n", + "Cbc0010I After 3293000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (318.74 seconds)\n", + "Cbc0010I After 3294000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (318.85 seconds)\n", + "Cbc0010I After 3295000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (318.92 seconds)\n", + "Cbc0010I After 3296000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (319.01 seconds)\n", + "Cbc0010I After 3297000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (319.09 seconds)\n", + "Cbc0010I After 3298000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (319.20 seconds)\n", + "Cbc0010I After 3299000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (319.29 seconds)\n", + "Cbc0010I After 3300000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (319.42 seconds)\n", + "Cbc0010I After 3301000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (319.51 seconds)\n", + "Cbc0010I After 3302000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (319.59 seconds)\n", + "Cbc0010I After 3303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (319.69 seconds)\n", + "Cbc0010I After 3304000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (319.77 seconds)\n", + "Cbc0010I After 3305000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (319.88 seconds)\n", + "Cbc0010I After 3306000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (320.05 seconds)\n", + "Cbc0010I After 3307000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (320.22 seconds)\n", + "Cbc0010I After 3308000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (320.39 seconds)\n", + "Cbc0010I After 3309000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (320.61 seconds)\n", + "Cbc0010I After 3310000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (320.81 seconds)\n", + "Cbc0010I After 3311000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (321.00 seconds)\n", + "Cbc0010I After 3312000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (321.18 seconds)\n", + "Cbc0010I After 3313000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (321.30 seconds)\n", + "Cbc0010I After 3314000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (321.42 seconds)\n", + "Cbc0010I After 3315000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (321.51 seconds)\n", + "Cbc0010I After 3316000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (321.61 seconds)\n", + "Cbc0010I After 3317000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (321.69 seconds)\n", + "Cbc0010I After 3318000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (321.75 seconds)\n", + "Cbc0010I After 3319000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (321.86 seconds)\n", + "Cbc0010I After 3320000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (322.04 seconds)\n", + "Cbc0010I After 3321000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (322.15 seconds)\n", + "Cbc0010I After 3322000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (322.27 seconds)\n", + "Cbc0010I After 3323000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (322.40 seconds)\n", + "Cbc0010I After 3324000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (322.53 seconds)\n", + "Cbc0010I After 3325000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (322.66 seconds)\n", + "Cbc0010I After 3326000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (322.77 seconds)\n", + "Cbc0010I After 3327000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (322.91 seconds)\n", + "Cbc0010I After 3328000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (323.01 seconds)\n", + "Cbc0010I After 3329000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (323.10 seconds)\n", + "Cbc0010I After 3330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (323.19 seconds)\n", + "Cbc0010I After 3331000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (323.29 seconds)\n", + "Cbc0010I After 3332000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (323.37 seconds)\n", + "Cbc0010I After 3333000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (323.47 seconds)\n", + "Cbc0010I After 3334000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (323.57 seconds)\n", + "Cbc0010I After 3335000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (323.66 seconds)\n", + "Cbc0010I After 3336000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (323.75 seconds)\n", + "Cbc0010I After 3337000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (323.83 seconds)\n", + "Cbc0010I After 3338000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (323.91 seconds)\n", + "Cbc0010I After 3339000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (324.00 seconds)\n", + "Cbc0010I After 3340000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (324.07 seconds)\n", + "Cbc0010I After 3341000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (324.19 seconds)\n", + "Cbc0010I After 3342000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (324.24 seconds)\n", + "Cbc0010I After 3343000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (324.32 seconds)\n", + "Cbc0010I After 3344000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (324.37 seconds)\n", + "Cbc0010I After 3345000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (324.49 seconds)\n", + "Cbc0010I After 3346000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (324.61 seconds)\n", + "Cbc0010I After 3347000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (324.75 seconds)\n", + "Cbc0010I After 3348000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (324.88 seconds)\n", + "Cbc0010I After 3349000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (324.92 seconds)\n", + "Cbc0010I After 3350000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (325.02 seconds)\n", + "Cbc0010I After 3351000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (325.11 seconds)\n", + "Cbc0010I After 3352000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (325.16 seconds)\n", + "Cbc0010I After 3353000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (325.20 seconds)\n", + "Cbc0010I After 3354000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (325.26 seconds)\n", + "Cbc0010I After 3355000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (325.30 seconds)\n", + "Cbc0010I After 3356000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (325.34 seconds)\n", + "Cbc0010I After 3357000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (325.39 seconds)\n", + "Cbc0010I After 3358000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (325.50 seconds)\n", + "Cbc0010I After 3359000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (325.67 seconds)\n", + "Cbc0010I After 3360000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (325.83 seconds)\n", + "Cbc0010I After 3361000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (325.93 seconds)\n", + "Cbc0010I After 3362000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (326.02 seconds)\n", + "Cbc0010I After 3363000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (326.07 seconds)\n", + "Cbc0010I After 3364000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (326.12 seconds)\n", + "Cbc0010I After 33\n", + "Cbc0010I After 370000 nodes, 861 on tree, 1e+50 best solution, best possible 0 (79.01 seconds)\n", + "Cbc0010I After 371000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (79.10 seconds)\n", + "Cbc0010I After 372000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (79.20 seconds)\n", + "Cbc0010I After 373000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (79.28 seconds)\n", + "Cbc0010I After 374000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (79.39 seconds)\n", + "Cbc0010I After 375000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (79.56 seconds)\n", + "Cbc0010I After 376000 nodes, 801 on tree, 1e+50 best solution, best possible 0 (79.77 seconds)\n", + "Cbc0010I After 377000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (80.01 seconds)\n", + "Cbc0010I After 378000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (80.27 seconds)\n", + "Cbc0010I After 379000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (80.56 seconds)\n", + "Cbc0010I After 380000 nodes, 843 on tree, 1e+50 best solution, best possible 0 (80.78 seconds)\n", + "Cbc0010I After 381000 nodes, 827 on tree, 1e+50 best solution, best possible 0 (80.95 seconds)\n", + "Cbc0010I After 382000 nodes, 869 on tree, 1e+50 best solution, best possible 0 (81.08 seconds)\n", + "Cbc0010I After 383000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (81.21 seconds)\n", + "Cbc0010I After 384000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (81.33 seconds)\n", + "Cbc0010I After 385000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (81.52 seconds)\n", + "Cbc0010I After 386000 nodes, 881 on tree, 1e+50 best solution, best possible 0 (81.71 seconds)\n", + "Cbc0010I After 387000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (81.89 seconds)\n", + "Cbc0010I After 388000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (82.09 seconds)\n", + "Cbc0010I After 389000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (82.23 seconds)\n", + "Cbc0010I After 390000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (82.40 seconds)\n", + "Cbc0010I After 391000 nodes, 854 on tree, 1e+50 best solution, best possible 0 (82.55 seconds)\n", + "Cbc0010I After 392000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (82.74 seconds)\n", + "Cbc0010I After 393000 nodes, 874 on tree, 1e+50 best solution, best possible 0 (82.92 seconds)\n", + "Cbc0010I After 394000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (83.12 seconds)\n", + "Cbc0010I After 395000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (83.30 seconds)\n", + "Cbc0010I After 396000 nodes, 843 on tree, 1e+50 best solution, best possible 0 (83.44 seconds)\n", + "Cbc0010I After 397000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (83.60 seconds)\n", + "Cbc0010I After 398000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (83.73 seconds)\n", + "Cbc0010I After 399000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (83.87 seconds)\n", + "Cbc0010I After 400000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (83.99 seconds)\n", + "Cbc0010I After 401000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (84.12 seconds)\n", + "Cbc0010I After 402000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (84.28 seconds)\n", + "Cbc0010I After 403000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (84.43 seconds)\n", + "Cbc0010I After 404000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (84.55 seconds)\n", + "Cbc0010I After 405000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (84.67 seconds)\n", + "Cbc0010I After 406000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (84.82 seconds)\n", + "Cbc0010I After 407000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (84.93 seconds)\n", + "Cbc0010I After 408000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (85.07 seconds)\n", + "Cbc0010I After 409000 nodes, 808 on tree, 1e+50 best solution, best possible 0 (85.24 seconds)\n", + "Cbc0010I After 410000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (85.40 seconds)\n", + "Cbc0010I After 411000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (85.51 seconds)\n", + "Cbc0010I After 412000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (85.63 seconds)\n", + "Cbc0010I A65000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (326.17 seconds)\n", + "Cbc0010I After 3366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (326.26 seconds)\n", + "Cbc0010I After 3367000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (326.39 seconds)\n", + "Cbc0010I After 3368000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (326.46 seconds)\n", + "Cbc0010I After 3369000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (326.54 seconds)\n", + "Cbc0010I After 3370000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (326.62 seconds)\n", + "Cbc0010I After 3371000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (326.70 seconds)\n", + "Cbc0010I After 3372000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (326.77 seconds)\n", + "Cbc0010I After 3373000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (326.91 seconds)\n", + "Cbc0010I After 3374000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (327.04 seconds)\n", + "Cbc0010I After 3375000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (327.21 seconds)\n", + "Cbc0010I After 3376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (327.35 seconds)\n", + "Cbc0010I After 3377000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (327.48 seconds)\n", + "Cbc0010I After 3378000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (327.66 seconds)\n", + "Cbc0010I After 3379000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (327.73 seconds)\n", + "Cbc0010I After 3380000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (327.80 seconds)\n", + "Cbc0010I After 3381000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (327.87 seconds)\n", + "Cbc0010I After 3382000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (327.94 seconds)\n", + "Cbc0010I After 3383000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (328.02 seconds)\n", + "Cbc0010I After 3384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (328.14 seconds)\n", + "Cbc0010I After 3385000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (328.22 seconds)\n", + "Cbc0010I After 3386000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (328.32 seconds)\n", + "Cbc0010I After 3387000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (328.46 seconds)\n", + "Cbc0010I After 3388000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (328.62 seconds)\n", + "Cbc0010I After 3389000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (328.83 seconds)\n", + "Cbc0010I After 3390000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (328.93 seconds)\n", + "Cbc0010I After 3391000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (329.00 seconds)\n", + "Cbc0010I After 3392000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (329.08 seconds)\n", + "Cbc0010I After 3393000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (329.15 seconds)\n", + "Cbc0010I After 3394000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (329.30 seconds)\n", + "Cbc0010I After 3395000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (329.39 seconds)\n", + "Cbc0010I After 3396000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (329.48 seconds)\n", + "Cbc0010I After 3397000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (329.69 seconds)\n", + "Cbc0010I After 3398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (329.91 seconds)\n", + "Cbc0010I After 3399000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (330.04 seconds)\n", + "Cbc0010I After 3400000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (330.13 seconds)\n", + "Cbc0010I After 3401000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (330.23 seconds)\n", + "Cbc0010I After 3402000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (330.32 seconds)\n", + "Cbc0010I After 3403000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (330.41 seconds)\n", + "Cbc0010I After 3404000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (330.52 seconds)\n", + "Cbc0010I After 3405000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (330.62 seconds)\n", + "Cbc0010I After 3406000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (330.73 seconds)\n", + "Cbc0010I After 3407000 nodes, 88 on tree, 1e+50 best solution, best possible 0 fter 413000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (85.78 seconds)\n", + "Cbc0010I After 414000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (85.92 seconds)\n", + "Cbc0010I After 415000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (86.08 seconds)\n", + "Cbc0010I After 416000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (86.21 seconds)\n", + "Cbc0010I After 417000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (86.35 seconds)\n", + "Cbc0010I After 418000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (86.49 seconds)\n", + "Cbc0010I After 419000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (86.61 seconds)\n", + "Cbc0010I After 420000 nodes, 808 on tree, 1e+50 best solution, best possible 0 (86.78 seconds)\n", + "Cbc0010I After 421000 nodes, 892 on tree, 1e+50 best solution, best possible 0 (86.90 seconds)\n", + "Cbc0010I After 422000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (87.06 seconds)\n", + "Cbc0010I After 423000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (87.23 seconds)\n", + "Cbc0010I After 424000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (87.44 seconds)\n", + "Cbc0010I After 425000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (87.66 seconds)\n", + "Cbc0010I After 426000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (87.86 seconds)\n", + "Cbc0010I After 427000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (88.13 seconds)\n", + "Cbc0010I After 428000 nodes, 887 on tree, 1e+50 best solution, best possible 0 (88.37 seconds)\n", + "Cbc0010I After 429000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (88.56 seconds)\n", + "Cbc0010I After 430000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (88.73 seconds)\n", + "Cbc0010I After 431000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (88.90 seconds)\n", + "Cbc0010I After 432000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (89.11 seconds)\n", + "Cbc0010I After 433000 nodes, 842 on tree, 1e+50 best solution, best possible 0 (89.33 seconds)\n", + "Cbc0010I After 434000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (89.60 seconds)\n", + "Cbc0010I After 435000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (89.85 seconds)\n", + "Cbc0010I After 436000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (90.12 seconds)\n", + "Cbc0010I After 437000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (90.39 seconds)\n", + "Cbc0010I After 438000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (90.60 seconds)\n", + "Cbc0010I After 439000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (90.83 seconds)\n", + "Cbc0010I After 440000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (91.10 seconds)\n", + "Cbc0010I After 441000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (91.34 seconds)\n", + "Cbc0010I After 442000 nodes, 825 on tree, 1e+50 best solution, best possible 0 (91.53 seconds)\n", + "Cbc0010I After 443000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (91.73 seconds)\n", + "Cbc0010I After 444000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (91.90 seconds)\n", + "Cbc0010I After 445000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (92.05 seconds)\n", + "Cbc0010I After 446000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (92.18 seconds)\n", + "Cbc0010I After 447000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (92.31 seconds)\n", + "Cbc0010I After 448000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (92.43 seconds)\n", + "Cbc0010I After 449000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (92.61 seconds)\n", + "Cbc0010I After 450000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (92.75 seconds)\n", + "Cbc0010I After 451000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (92.89 seconds)\n", + "Cbc0010I After 452000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (93.03 seconds)\n", + "Cbc0010I After 453000 nodes, 841 on tree, 1e+50 best solution, best possible 0 (93.19 seconds)\n", + "Cbc0010I After 454000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (93.35 seconds)\n", + "Cbc0010I After 455000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (93.49 seconds)\n", + "Cbc0010I After 456000(330.84 seconds)\n", + "Cbc0010I After 3408000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (330.94 seconds)\n", + "Cbc0010I After 3409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (331.02 seconds)\n", + "Cbc0010I After 3410000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (331.22 seconds)\n", + "Cbc0010I After 3411000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (331.58 seconds)\n", + "Cbc0010I After 3412000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (331.84 seconds)\n", + "Cbc0010I After 3413000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (332.04 seconds)\n", + "Cbc0010I After 3414000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (332.24 seconds)\n", + "Cbc0010I After 3415000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (332.44 seconds)\n", + "Cbc0010I After 3416000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (332.58 seconds)\n", + "Cbc0010I After 3417000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (332.77 seconds)\n", + "Cbc0010I After 3418000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (332.90 seconds)\n", + "Cbc0010I After 3419000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (333.10 seconds)\n", + "Cbc0010I After 3420000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (333.24 seconds)\n", + "Cbc0010I After 3421000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (333.37 seconds)\n", + "Cbc0010I After 3422000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (333.50 seconds)\n", + "Cbc0010I After 3423000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (333.61 seconds)\n", + "Cbc0010I After 3424000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (333.80 seconds)\n", + "Cbc0010I After 3425000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (333.92 seconds)\n", + "Cbc0010I After 3426000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (334.10 seconds)\n", + "Cbc0010I After 3427000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (334.24 seconds)\n", + "Cbc0010I After 3428000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (334.42 seconds)\n", + "Cbc0010I After 3429000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (334.58 seconds)\n", + "Cbc0010I After 3430000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (334.71 seconds)\n", + "Cbc0010I After 3431000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (334.83 seconds)\n", + "Cbc0010I After 3432000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (334.98 seconds)\n", + "Cbc0010I After 3433000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (335.13 seconds)\n", + "Cbc0010I After 3434000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (335.29 seconds)\n", + "Cbc0010I After 3435000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (335.52 seconds)\n", + "Cbc0010I After 3436000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (335.71 seconds)\n", + "Cbc0010I After 3437000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (335.93 seconds)\n", + "Cbc0010I After 3438000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (336.08 seconds)\n", + "Cbc0010I After 3439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (336.26 seconds)\n", + "Cbc0010I After 3440000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (336.42 seconds)\n", + "Cbc0010I After 3441000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (336.53 seconds)\n", + "Cbc0010I After 3442000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (336.62 seconds)\n", + "Cbc0010I After 3443000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (336.71 seconds)\n", + "Cbc0010I After 3444000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (336.77 seconds)\n", + "Cbc0010I After 3445000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (336.83 seconds)\n", + "Cbc0010I After 3446000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (336.92 seconds)\n", + "Cbc0010I After 3447000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (337.03 seconds)\n", + "Cbc0010I After 3448000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (337.11 seconds)\n", + "Cbc0010I After 3449000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (337.21 seconds)\n", + "Cbc0010I After 3450000 node nodes, 847 on tree, 1e+50 best solution, best possible 0 (93.64 seconds)\n", + "Cbc0010I After 457000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (93.78 seconds)\n", + "Cbc0010I After 458000 nodes, 830 on tree, 1e+50 best solution, best possible 0 (93.92 seconds)\n", + "Cbc0010I After 459000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (94.08 seconds)\n", + "Cbc0010I After 460000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (94.24 seconds)\n", + "Cbc0010I After 461000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (94.37 seconds)\n", + "Cbc0010I After 462000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (94.53 seconds)\n", + "Cbc0010I After 463000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (94.71 seconds)\n", + "Cbc0010I After 464000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (94.85 seconds)\n", + "Cbc0010I After 465000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (95.14 seconds)\n", + "Cbc0010I After 466000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (95.41 seconds)\n", + "Cbc0010I After 467000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (95.63 seconds)\n", + "Cbc0010I After 468000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (95.77 seconds)\n", + "Cbc0010I After 469000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (95.92 seconds)\n", + "Cbc0010I After 470000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (96.02 seconds)\n", + "Cbc0010I After 471000 nodes, 842 on tree, 1e+50 best solution, best possible 0 (96.10 seconds)\n", + "Cbc0010I After 472000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (96.21 seconds)\n", + "Cbc0010I After 473000 nodes, 810 on tree, 1e+50 best solution, best possible 0 (96.29 seconds)\n", + "Cbc0010I After 474000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (96.38 seconds)\n", + "Cbc0010I After 475000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (96.46 seconds)\n", + "Cbc0010I After 476000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (96.55 seconds)\n", + "Cbc0010I After 477000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (96.64 seconds)\n", + "Cbc0010I After 478000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (96.73 seconds)\n", + "Cbc0010I After 479000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (96.82 seconds)\n", + "Cbc0010I After 480000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (96.96 seconds)\n", + "Cbc0010I After 481000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (97.11 seconds)\n", + "Cbc0010I After 482000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (97.25 seconds)\n", + "Cbc0010I After 483000 nodes, 826 on tree, 1e+50 best solution, best possible 0 (97.46 seconds)\n", + "Cbc0010I After 484000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (97.58 seconds)\n", + "Cbc0010I After 485000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (97.70 seconds)\n", + "Cbc0010I After 486000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (97.84 seconds)\n", + "Cbc0010I After 487000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (97.96 seconds)\n", + "Cbc0010I After 488000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (98.09 seconds)\n", + "Cbc0010I After 489000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (98.23 seconds)\n", + "Cbc0010I After 490000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (98.36 seconds)\n", + "Cbc0010I After 491000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (98.46 seconds)\n", + "Cbc0010I After 492000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (98.57 seconds)\n", + "Cbc0010I After 493000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (98.68 seconds)\n", + "Cbc0010I After 494000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (98.78 seconds)\n", + "Cbc0010I After 495000 nodes, 875 on tree, 1e+50 best solution, best possible 0 (98.90 seconds)\n", + "Cbc0010I After 496000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (99.06 seconds)\n", + "Cbc0010I After 497000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (99.31 seconds)\n", + "Cbc0010I After 498000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (99.50 seconds)\n", + "Cbc0010I After 499000 nodes, 781s, 100 on tree, 1e+50 best solution, best possible 0 (337.31 seconds)\n", + "Cbc0010I After 3451000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (337.41 seconds)\n", + "Cbc0010I After 3452000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (337.53 seconds)\n", + "Cbc0010I After 3453000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (337.64 seconds)\n", + "Cbc0010I After 3454000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (337.74 seconds)\n", + "Cbc0010I After 3455000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (337.95 seconds)\n", + "Cbc0010I After 3456000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (338.05 seconds)\n", + "Cbc0010I After 3457000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (338.15 seconds)\n", + "Cbc0010I After 3458000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (338.27 seconds)\n", + "Cbc0010I After 3459000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (338.37 seconds)\n", + "Cbc0010I After 3460000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (338.50 seconds)\n", + "Cbc0010I After 3461000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (338.64 seconds)\n", + "Cbc0010I After 3462000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (338.76 seconds)\n", + "Cbc0010I After 3463000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (338.87 seconds)\n", + "Cbc0010I After 3464000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (338.99 seconds)\n", + "Cbc0010I After 3465000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.07 seconds)\n", + "Cbc0010I After 3466000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.18 seconds)\n", + "Cbc0010I After 3467000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.29 seconds)\n", + "Cbc0010I After 3468000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (339.40 seconds)\n", + "Cbc0010I After 3469000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (339.54 seconds)\n", + "Cbc0010I After 3470000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (339.74 seconds)\n", + "Cbc0010I After 3471000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (339.91 seconds)\n", + "Cbc0010I After 3472000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (340.03 seconds)\n", + "Cbc0010I After 3473000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (340.14 seconds)\n", + "Cbc0010I After 3474000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (340.28 seconds)\n", + "Cbc0010I After 3475000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (340.44 seconds)\n", + "Cbc0010I After 3476000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (340.58 seconds)\n", + "Cbc0010I After 3477000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (340.70 seconds)\n", + "Cbc0010I After 3478000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (340.87 seconds)\n", + "Cbc0010I After 3479000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.09 seconds)\n", + "Cbc0010I After 3480000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (341.25 seconds)\n", + "Cbc0010I After 3481000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (341.42 seconds)\n", + "Cbc0010I After 3482000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.54 seconds)\n", + "Cbc0010I After 3483000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (341.68 seconds)\n", + "Cbc0010I After 3484000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (341.78 seconds)\n", + "Cbc0010I After 3485000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.90 seconds)\n", + "Cbc0010I After 3486000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (342.05 seconds)\n", + "Cbc0010I After 3487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (342.17 seconds)\n", + "Cbc0010I After 3488000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (342.27 seconds)\n", + "Cbc0010I After 3489000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (342.37 seconds)\n", + "Cbc0010I After 3490000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (342.47 seconds)\n", + "Cbc0010I After 3491000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (342.58 seconds)\n", + "Cbc0010I After 3492000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (342.68 on tree, 1e+50 best solution, best possible 0 (99.62 seconds)\n", + "Cbc0010I After 500000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (99.75 seconds)\n", + "Cbc0010I After 501000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (99.92 seconds)\n", + "Cbc0010I After 502000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (100.06 seconds)\n", + "Cbc0010I After 503000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (100.21 seconds)\n", + "Cbc0010I After 504000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (100.37 seconds)\n", + "Cbc0010I After 505000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (100.60 seconds)\n", + "Cbc0010I After 506000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (100.81 seconds)\n", + "Cbc0010I After 507000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (101.01 seconds)\n", + "Cbc0010I After 508000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (101.14 seconds)\n", + "Cbc0010I After 509000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (101.28 seconds)\n", + "Cbc0010I After 510000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (101.41 seconds)\n", + "Cbc0010I After 511000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (101.56 seconds)\n", + "Cbc0010I After 512000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (101.70 seconds)\n", + "Cbc0010I After 513000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (101.81 seconds)\n", + "Cbc0010I After 514000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (101.94 seconds)\n", + "Cbc0010I After 515000 nodes, 752 on tree, 1e+50 best solution, best possible 0 (102.06 seconds)\n", + "Cbc0010I After 516000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (102.18 seconds)\n", + "Cbc0010I After 517000 nodes, 799 on tree, 1e+50 best solution, best possible 0 (102.30 seconds)\n", + "Cbc0010I After 518000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (102.48 seconds)\n", + "Cbc0010I After 519000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (102.70 seconds)\n", + "Cbc0010I After 520000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (102.94 seconds)\n", + "Cbc0010I After 521000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (103.14 seconds)\n", + "Cbc0010I After 522000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (103.30 seconds)\n", + "Cbc0010I After 523000 nodes, 739 on tree, 1e+50 best solution, best possible 0 (103.49 seconds)\n", + "Cbc0010I After 524000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (103.65 seconds)\n", + "Cbc0010I After 525000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (103.79 seconds)\n", + "Cbc0010I After 526000 nodes, 861 on tree, 1e+50 best solution, best possible 0 (103.93 seconds)\n", + "Cbc0010I After 527000 nodes, 775 on tree, 1e+50 best solution, best possible 0 (104.05 seconds)\n", + "Cbc0010I After 528000 nodes, 774 on tree, 1e+50 best solution, best possible 0 (104.18 seconds)\n", + "Cbc0010I After 529000 nodes, 822 on tree, 1e+50 best solution, best possible 0 (104.33 seconds)\n", + "Cbc0010I After 530000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (104.46 seconds)\n", + "Cbc0010I After 531000 nodes, 869 on tree, 1e+50 best solution, best possible 0 (104.64 seconds)\n", + "Cbc0010I After 532000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (104.79 seconds)\n", + "Cbc0010I After 533000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (104.90 seconds)\n", + "Cbc0010I After 534000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (105.03 seconds)\n", + "Cbc0010I After 535000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (105.17 seconds)\n", + "Cbc0010I After 536000 nodes, 879 on tree, 1e+50 best solution, best possible 0 (105.29 seconds)\n", + "Cbc0010I After 537000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (105.41 seconds)\n", + "Cbc0010I After 538000 nodes, 753 on tree, 1e+50 best solution, best possible 0 (105.52 seconds)\n", + "Cbc0010I After 539000 nodes, 845 on tree, 1e+50 best solution, best possible 0 (105.64 seconds)\n", + "Cbc0010I After 540000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (105.78 seconds)\n", + "Cbc0010I After 541000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (105.89 seconds)\n", + "Cbcseconds)\n", + "Cbc0010I After 3493000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (342.78 seconds)\n", + "Cbc0010I After 3494000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (342.92 seconds)\n", + "Cbc0010I After 3495000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (343.12 seconds)\n", + "Cbc0010I After 3496000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (343.34 seconds)\n", + "Cbc0010I After 3497000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (343.54 seconds)\n", + "Cbc0010I After 3498000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (343.69 seconds)\n", + "Cbc0010I After 3499000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (343.88 seconds)\n", + "Cbc0010I After 3500000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (344.02 seconds)\n", + "Cbc0010I After 3501000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (344.11 seconds)\n", + "Cbc0010I After 3502000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (344.21 seconds)\n", + "Cbc0010I After 3503000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (344.29 seconds)\n", + "Cbc0010I After 3504000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (344.39 seconds)\n", + "Cbc0010I After 3505000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (344.51 seconds)\n", + "Cbc0010I After 3506000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (344.62 seconds)\n", + "Cbc0010I After 3507000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (344.72 seconds)\n", + "Cbc0010I After 3508000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (344.88 seconds)\n", + "Cbc0010I After 3509000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (345.04 seconds)\n", + "Cbc0010I After 3510000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (345.16 seconds)\n", + "Cbc0010I After 3511000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (345.25 seconds)\n", + "Cbc0010I After 3512000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (345.38 seconds)\n", + "Cbc0010I After 3513000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (345.50 seconds)\n", + "Cbc0010I After 3514000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (345.61 seconds)\n", + "Cbc0010I After 3515000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (345.72 seconds)\n", + "Cbc0010I After 3516000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (345.86 seconds)\n", + "Cbc0010I After 3517000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (345.96 seconds)\n", + "Cbc0010I After 3518000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (346.08 seconds)\n", + "Cbc0010I After 3519000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (346.20 seconds)\n", + "Cbc0010I After 3520000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (346.29 seconds)\n", + "Cbc0010I After 3521000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (346.34 seconds)\n", + "Cbc0010I After 3522000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (346.39 seconds)\n", + "Cbc0010I After 3523000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (346.45 seconds)\n", + "Cbc0010I After 3524000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (346.58 seconds)\n", + "Cbc0010I After 3525000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (346.71 seconds)\n", + "Cbc0010I After 3526000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (346.86 seconds)\n", + "Cbc0010I After 3527000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (347.04 seconds)\n", + "Cbc0010I After 3528000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (347.19 seconds)\n", + "Cbc0010I After 3529000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (347.35 seconds)\n", + "Cbc0010I After 3530000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (347.48 seconds)\n", + "Cbc0010I After 3531000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (347.62 seconds)\n", + "Cbc0010I After 3532000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (347.77 seconds)\n", + "Cbc0010I After 3533000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (347.91 seconds)\n", + "Cbc0010I After 3534000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (348.05 seconds)\n", + "Cbc0010I After 3535000 nodes, 66 on tree, 1e+50010I After 542000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (106.02 seconds)\n", + "Cbc0010I After 543000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (106.13 seconds)\n", + "Cbc0010I After 544000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (106.22 seconds)\n", + "Cbc0010I After 545000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (106.33 seconds)\n", + "Cbc0010I After 546000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (106.43 seconds)\n", + "Cbc0010I After 547000 nodes, 794 on tree, 1e+50 best solution, best possible 0 (106.56 seconds)\n", + "Cbc0010I After 548000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (106.66 seconds)\n", + "Cbc0010I After 549000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (106.76 seconds)\n", + "Cbc0010I After 550000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (106.86 seconds)\n", + "Cbc0010I After 551000 nodes, 825 on tree, 1e+50 best solution, best possible 0 (106.95 seconds)\n", + "Cbc0010I After 552000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (107.04 seconds)\n", + "Cbc0010I After 553000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (107.13 seconds)\n", + "Cbc0010I After 554000 nodes, 760 on tree, 1e+50 best solution, best possible 0 (107.23 seconds)\n", + "Cbc0010I After 555000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (107.32 seconds)\n", + "Cbc0010I After 556000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (107.42 seconds)\n", + "Cbc0010I After 557000 nodes, 735 on tree, 1e+50 best solution, best possible 0 (107.55 seconds)\n", + "Cbc0010I After 558000 nodes, 830 on tree, 1e+50 best solution, best possible 0 (107.65 seconds)\n", + "Cbc0010I After 559000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (107.75 seconds)\n", + "Cbc0010I After 560000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (107.84 seconds)\n", + "Cbc0010I After 561000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (107.95 seconds)\n", + "Cbc0010I After 562000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (108.07 seconds)\n", + "Cbc0010I After 563000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (108.18 seconds)\n", + "Cbc0010I After 564000 nodes, 781 on tree, 1e+50 best solution, best possible 0 (108.28 seconds)\n", + "Cbc0010I After 565000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.40 seconds)\n", + "Cbc0010I After 566000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (108.51 seconds)\n", + "Cbc0010I After 567000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.61 seconds)\n", + "Cbc0010I After 568000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (108.71 seconds)\n", + "Cbc0010I After 569000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.80 seconds)\n", + "Cbc0010I After 570000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (108.91 seconds)\n", + "Cbc0010I After 571000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (109.01 seconds)\n", + "Cbc0010I After 572000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (109.12 seconds)\n", + "Cbc0010I After 573000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (109.21 seconds)\n", + "Cbc0010I After 574000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (109.31 seconds)\n", + "Cbc0010I After 575000 nodes, 785 on tree, 1e+50 best solution, best possible 0 (109.39 seconds)\n", + "Cbc0010I After 576000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (109.48 seconds)\n", + "Cbc0010I After 577000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (109.58 seconds)\n", + "Cbc0010I After 578000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (109.69 seconds)\n", + "Cbc0010I After 579000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (109.78 seconds)\n", + "Cbc0010I After 580000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (109.87 seconds)\n", + "Cbc0010I After 581000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (110.00 seconds)\n", + "Cbc0010I After 582000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (110.14 seconds)\n", + "Cbc0010I After 583000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (110.26 seconds)\n", + "Cbc0010I After 584000 nodes, 756 on tree, 1e+50 best solution, best0 best solution, best possible 0 (348.19 seconds)\n", + "Cbc0010I After 3536000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (348.32 seconds)\n", + "Cbc0010I After 3537000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (348.50 seconds)\n", + "Cbc0010I After 3538000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (348.65 seconds)\n", + "Cbc0010I After 3539000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (348.81 seconds)\n", + "Cbc0010I After 3540000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (348.98 seconds)\n", + "Cbc0010I After 3541000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (349.10 seconds)\n", + "Cbc0010I After 3542000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (349.19 seconds)\n", + "Cbc0010I After 3543000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (349.31 seconds)\n", + "Cbc0010I After 3544000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (349.47 seconds)\n", + "Cbc0010I After 3545000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (349.59 seconds)\n", + "Cbc0010I After 3546000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (349.65 seconds)\n", + "Cbc0010I After 3547000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (349.70 seconds)\n", + "Cbc0010I After 3548000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (349.79 seconds)\n", + "Cbc0010I After 3549000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (349.85 seconds)\n", + "Cbc0010I After 3550000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (349.97 seconds)\n", + "Cbc0010I After 3551000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (350.04 seconds)\n", + "Cbc0010I After 3552000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (350.15 seconds)\n", + "Cbc0010I After 3553000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (350.29 seconds)\n", + "Cbc0010I After 3554000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (350.45 seconds)\n", + "Cbc0010I After 3555000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (350.64 seconds)\n", + "Cbc0010I After 3556000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (350.74 seconds)\n", + "Cbc0010I After 3557000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (350.84 seconds)\n", + "Cbc0010I After 3558000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (351.01 seconds)\n", + "Cbc0010I After 3559000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (351.10 seconds)\n", + "Cbc0010I After 3560000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (351.26 seconds)\n", + "Cbc0010I After 3561000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (351.38 seconds)\n", + "Cbc0010I After 3562000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (351.59 seconds)\n", + "Cbc0010I After 3563000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (351.66 seconds)\n", + "Cbc0010I After 3564000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (351.87 seconds)\n", + "Cbc0010I After 3565000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (352.04 seconds)\n", + "Cbc0010I After 3566000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (352.22 seconds)\n", + "Cbc0010I After 3567000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (352.39 seconds)\n", + "Cbc0010I After 3568000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (352.51 seconds)\n", + "Cbc0010I After 3569000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (352.67 seconds)\n", + "Cbc0010I After 3570000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (352.82 seconds)\n", + "Cbc0010I After 3571000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (352.99 seconds)\n", + "Cbc0010I After 3572000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (353.16 seconds)\n", + "Cbc0010I After 3573000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (353.29 seconds)\n", + "Cbc0010I After 3574000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (353.43 seconds)\n", + "Cbc0010I After 3575000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (353.55 seconds)\n", + "Cbc0010I After 3576000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (353.67 seconds)\n", + "Cbc0010I After 3577000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (353.78 seconds)\n", + "Cbc0010I Aft possible 0 (110.38 seconds)\n", + "Cbc0010I After 585000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (110.49 seconds)\n", + "Cbc0010I After 586000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (110.61 seconds)\n", + "Cbc0010I After 587000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (110.78 seconds)\n", + "Cbc0010I After 588000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (110.97 seconds)\n", + "Cbc0010I After 589000 nodes, 733 on tree, 1e+50 best solution, best possible 0 (111.16 seconds)\n", + "Cbc0010I After 590000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (111.36 seconds)\n", + "Cbc0010I After 591000 nodes, 877 on tree, 1e+50 best solution, best possible 0 (111.52 seconds)\n", + "Cbc0010I After 592000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (111.65 seconds)\n", + "Cbc0010I After 593000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (111.80 seconds)\n", + "Cbc0010I After 594000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (111.90 seconds)\n", + "Cbc0010I After 595000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (111.99 seconds)\n", + "Cbc0010I After 596000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (112.11 seconds)\n", + "Cbc0010I After 597000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (112.25 seconds)\n", + "Cbc0010I After 598000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (112.39 seconds)\n", + "Cbc0010I After 599000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (112.52 seconds)\n", + "Cbc0010I After 600000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (112.64 seconds)\n", + "Cbc0010I After 601000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (112.76 seconds)\n", + "Cbc0010I After 602000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (112.89 seconds)\n", + "Cbc0010I After 603000 nodes, 749 on tree, 1e+50 best solution, best possible 0 (112.98 seconds)\n", + "Cbc0010I After 604000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (113.06 seconds)\n", + "Cbc0010I After 605000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (113.15 seconds)\n", + "Cbc0010I After 606000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (113.23 seconds)\n", + "Cbc0010I After 607000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (113.31 seconds)\n", + "Cbc0010I After 608000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (113.39 seconds)\n", + "Cbc0010I After 609000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (113.48 seconds)\n", + "Cbc0010I After 610000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (113.57 seconds)\n", + "Cbc0010I After 611000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (113.73 seconds)\n", + "Cbc0010I After 612000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (113.87 seconds)\n", + "Cbc0010I After 613000 nodes, 778 on tree, 1e+50 best solution, best possible 0 (113.98 seconds)\n", + "Cbc0010I After 614000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (114.08 seconds)\n", + "Cbc0010I After 615000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (114.16 seconds)\n", + "Cbc0010I After 616000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (114.25 seconds)\n", + "Cbc0010I After 617000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (114.33 seconds)\n", + "Cbc0010I After 618000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (114.43 seconds)\n", + "Cbc0010I After 619000 nodes, 720 on tree, 1e+50 best solution, best possible 0 (114.52 seconds)\n", + "Cbc0010I After 620000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (114.62 seconds)\n", + "Cbc0010I After 621000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (114.72 seconds)\n", + "Cbc0010I After 622000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (114.81 seconds)\n", + "Cbc0010I After 623000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (114.88 seconds)\n", + "Cbc0010I After 624000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (114.97 seconds)\n", + "Cbc0010I After 625000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (115.07 seconds)\n", + "Cbc0010I After 626000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (115.15 seconds)\n", + "Cbc0010I After 627000 nodes, 784 oner 3578000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (353.90 seconds)\n", + "Cbc0010I After 3579000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (354.03 seconds)\n", + "Cbc0010I After 3580000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (354.25 seconds)\n", + "Cbc0010I After 3581000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (354.42 seconds)\n", + "Cbc0010I After 3582000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (354.57 seconds)\n", + "Cbc0010I After 3583000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (354.65 seconds)\n", + "Cbc0010I After 3584000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (354.76 seconds)\n", + "Cbc0010I After 3585000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (354.85 seconds)\n", + "Cbc0010I After 3586000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (354.97 seconds)\n", + "Cbc0010I After 3587000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (355.08 seconds)\n", + "Cbc0010I After 3588000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (355.18 seconds)\n", + "Cbc0010I After 3589000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (355.27 seconds)\n", + "Cbc0010I After 3590000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (355.34 seconds)\n", + "Cbc0010I After 3591000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (355.40 seconds)\n", + "Cbc0010I After 3592000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (355.52 seconds)\n", + "Cbc0010I After 3593000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (355.62 seconds)\n", + "Cbc0010I After 3594000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (355.74 seconds)\n", + "Cbc0010I After 3595000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (355.84 seconds)\n", + "Cbc0010I After 3596000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (355.94 seconds)\n", + "Cbc0010I After 3597000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (356.06 seconds)\n", + "Cbc0010I After 3598000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (356.17 seconds)\n", + "Cbc0010I After 3599000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (356.25 seconds)\n", + "Cbc0010I After 3600000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (356.31 seconds)\n", + "Cbc0010I After 3601000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (356.42 seconds)\n", + "Cbc0010I After 3602000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (356.52 seconds)\n", + "Cbc0010I After 3603000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (356.67 seconds)\n", + "Cbc0010I After 3604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (356.81 seconds)\n", + "Cbc0010I After 3605000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (356.93 seconds)\n", + "Cbc0010I After 3606000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (357.03 seconds)\n", + "Cbc0010I After 3607000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (357.12 seconds)\n", + "Cbc0010I After 3608000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (357.20 seconds)\n", + "Cbc0010I After 3609000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (357.29 seconds)\n", + "Cbc0010I After 3610000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (357.39 seconds)\n", + "Cbc0010I After 3611000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (357.50 seconds)\n", + "Cbc0010I After 3612000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (357.60 seconds)\n", + "Cbc0010I After 3613000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (357.70 seconds)\n", + "Cbc0010I After 3614000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (357.82 seconds)\n", + "Cbc0010I After 3615000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (357.92 seconds)\n", + "Cbc0010I After 3616000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (358.03 seconds)\n", + "Cbc0010I After 3617000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (358.11 seconds)\n", + "Cbc0010I After 3618000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (358.24 seconds)\n", + "Cbc0010I After 3619000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (358.46 seconds)\n", + "Cbc0010I After 3620000 nodes, 83 on tree, 1e+50 best solution, tree, 1e+50 best solution, best possible 0 (115.24 seconds)\n", + "Cbc0010I After 628000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (115.32 seconds)\n", + "Cbc0010I After 629000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (115.42 seconds)\n", + "Cbc0010I After 630000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (115.52 seconds)\n", + "Cbc0010I After 631000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (115.60 seconds)\n", + "Cbc0010I After 632000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (115.70 seconds)\n", + "Cbc0010I After 633000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (115.80 seconds)\n", + "Cbc0010I After 634000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (115.89 seconds)\n", + "Cbc0010I After 635000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (115.98 seconds)\n", + "Cbc0010I After 636000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (116.11 seconds)\n", + "Cbc0010I After 637000 nodes, 727 on tree, 1e+50 best solution, best possible 0 (116.25 seconds)\n", + "Cbc0010I After 638000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (116.41 seconds)\n", + "Cbc0010I After 639000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (116.54 seconds)\n", + "Cbc0010I After 640000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (116.66 seconds)\n", + "Cbc0010I After 641000 nodes, 875 on tree, 1e+50 best solution, best possible 0 (116.77 seconds)\n", + "Cbc0010I After 642000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (116.87 seconds)\n", + "Cbc0010I After 643000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (116.97 seconds)\n", + "Cbc0010I After 644000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (117.07 seconds)\n", + "Cbc0010I After 645000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (117.16 seconds)\n", + "Cbc0010I After 646000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (117.27 seconds)\n", + "Cbc0010I After 647000 nodes, 809 on tree, 1e+50 best solution, best possible 0 (117.37 seconds)\n", + "Cbc0010I After 648000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (117.46 seconds)\n", + "Cbc0010I After 649000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (117.57 seconds)\n", + "Cbc0010I After 650000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (117.69 seconds)\n", + "Cbc0010I After 651000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (117.86 seconds)\n", + "Cbc0010I After 652000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (118.11 seconds)\n", + "Cbc0010I After 653000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (118.27 seconds)\n", + "Cbc0010I After 654000 nodes, 756 on tree, 1e+50 best solution, best possible 0 (118.40 seconds)\n", + "Cbc0010I After 655000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (118.55 seconds)\n", + "Cbc0010I After 656000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (118.69 seconds)\n", + "Cbc0010I After 657000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (118.82 seconds)\n", + "Cbc0010I After 658000 nodes, 743 on tree, 1e+50 best solution, best possible 0 (118.96 seconds)\n", + "Cbc0010I After 659000 nodes, 723 on tree, 1e+50 best solution, best possible 0 (119.09 seconds)\n", + "Cbc0010I After 660000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (119.21 seconds)\n", + "Cbc0010I After 661000 nodes, 867 on tree, 1e+50 best solution, best possible 0 (119.31 seconds)\n", + "Cbc0010I After 662000 nodes, 857 on tree, 1e+50 best solution, best possible 0 (119.43 seconds)\n", + "Cbc0010I After 663000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (119.55 seconds)\n", + "Cbc0010I After 664000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (119.65 seconds)\n", + "Cbc0010I After 665000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (119.77 seconds)\n", + "Cbc0010I After 666000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (119.88 seconds)\n", + "Cbc0010I After 667000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (120.00 seconds)\n", + "Cbc0010I After 668000 nodes, 801 on tree, 1e+50 best solution, best possible 0 (120.12 seconds)\n", + "Cbc0010I After 669000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (120.19 seconds)\n", + "Cbc best possible 0 (358.65 seconds)\n", + "Cbc0010I After 3621000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (358.81 seconds)\n", + "Cbc0010I After 3622000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (358.95 seconds)\n", + "Cbc0010I After 3623000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (359.07 seconds)\n", + "Cbc0010I After 3624000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (359.20 seconds)\n", + "Cbc0010I After 3625000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (359.28 seconds)\n", + "Cbc0010I After 3626000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (359.35 seconds)\n", + "Cbc0010I After 3627000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (359.42 seconds)\n", + "Cbc0010I After 3628000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (359.52 seconds)\n", + "Cbc0010I After 3629000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (359.62 seconds)\n", + "Cbc0010I After 3630000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (359.72 seconds)\n", + "Cbc0010I After 3631000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (359.79 seconds)\n", + "Cbc0010I After 3632000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (359.89 seconds)\n", + "Cbc0010I After 3633000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (359.98 seconds)\n", + "Cbc0010I After 3634000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (360.04 seconds)\n", + "Cbc0010I After 3635000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (360.12 seconds)\n", + "Cbc0010I After 3636000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (360.25 seconds)\n", + "Cbc0010I After 3637000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (360.35 seconds)\n", + "Cbc0010I After 3638000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (360.47 seconds)\n", + "Cbc0010I After 3639000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (360.55 seconds)\n", + "Cbc0010I After 3640000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (360.62 seconds)\n", + "Cbc0010I After 3641000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (360.72 seconds)\n", + "Cbc0010I After 3642000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (360.79 seconds)\n", + "Cbc0010I After 3643000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (360.89 seconds)\n", + "Cbc0010I After 3644000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (360.98 seconds)\n", + "Cbc0010I After 3645000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (361.14 seconds)\n", + "Cbc0010I After 3646000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (361.30 seconds)\n", + "Cbc0010I After 3647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (361.52 seconds)\n", + "Cbc0010I After 3648000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (361.72 seconds)\n", + "Cbc0010I After 3649000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (361.94 seconds)\n", + "Cbc0010I After 3650000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (362.12 seconds)\n", + "Cbc0010I After 3651000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (362.20 seconds)\n", + "Cbc0010I After 3652000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (362.27 seconds)\n", + "Cbc0010I After 3653000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (362.35 seconds)\n", + "Cbc0010I After 3654000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (362.44 seconds)\n", + "Cbc0010I After 3655000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (362.55 seconds)\n", + "Cbc0010I After 3656000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (362.66 seconds)\n", + "Cbc0010I After 3657000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (362.72 seconds)\n", + "Cbc0010I After 3658000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (362.82 seconds)\n", + "Cbc0010I After 3659000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (362.93 seconds)\n", + "Cbc0010I After 3660000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (363.06 seconds)\n", + "Cbc0010I After 3661000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (363.14 seconds)\n", + "Cbc0010I After 3662000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (363.22 seconds)\n", + "Cbc00010I After 670000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (120.28 seconds)\n", + "Cbc0010I After 671000 nodes, 765 on tree, 1e+50 best solution, best possible 0 (120.42 seconds)\n", + "Cbc0010I After 672000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (120.53 seconds)\n", + "Cbc0010I After 673000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (120.68 seconds)\n", + "Cbc0010I After 674000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (120.88 seconds)\n", + "Cbc0010I After 675000 nodes, 729 on tree, 1e+50 best solution, best possible 0 (121.08 seconds)\n", + "Cbc0010I After 676000 nodes, 714 on tree, 1e+50 best solution, best possible 0 (121.19 seconds)\n", + "Cbc0010I After 677000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (121.36 seconds)\n", + "Cbc0010I After 678000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (121.51 seconds)\n", + "Cbc0010I After 679000 nodes, 778 on tree, 1e+50 best solution, best possible 0 (121.65 seconds)\n", + "Cbc0010I After 680000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (121.78 seconds)\n", + "Cbc0010I After 681000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (121.89 seconds)\n", + "Cbc0010I After 682000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (121.99 seconds)\n", + "Cbc0010I After 683000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (122.07 seconds)\n", + "Cbc0010I After 684000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (122.15 seconds)\n", + "Cbc0010I After 685000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (122.23 seconds)\n", + "Cbc0010I After 686000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (122.31 seconds)\n", + "Cbc0010I After 687000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (122.39 seconds)\n", + "Cbc0010I After 688000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (122.49 seconds)\n", + "Cbc0010I After 689000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (122.57 seconds)\n", + "Cbc0010I After 690000 nodes, 774 on tree, 1e+50 best solution, best possible 0 (122.68 seconds)\n", + "Cbc0010I After 691000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (122.79 seconds)\n", + "Cbc0010I After 692000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (122.90 seconds)\n", + "Cbc0010I After 693000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (123.05 seconds)\n", + "Cbc0010I After 694000 nodes, 740 on tree, 1e+50 best solution, best possible 0 (123.26 seconds)\n", + "Cbc0010I After 695000 nodes, 712 on tree, 1e+50 best solution, best possible 0 (123.43 seconds)\n", + "Cbc0010I After 696000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (123.62 seconds)\n", + "Cbc0010I After 697000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (123.80 seconds)\n", + "Cbc0010I After 698000 nodes, 735 on tree, 1e+50 best solution, best possible 0 (123.95 seconds)\n", + "Cbc0010I After 699000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (124.07 seconds)\n", + "Cbc0010I After 700000 nodes, 851 on tree, 1e+50 best solution, best possible 0 (124.16 seconds)\n", + "Cbc0010I After 701000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (124.26 seconds)\n", + "Cbc0010I After 702000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (124.35 seconds)\n", + "Cbc0010I After 703000 nodes, 810 on tree, 1e+50 best solution, best possible 0 (124.45 seconds)\n", + "Cbc0010I After 704000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (124.56 seconds)\n", + "Cbc0010I After 705000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (124.65 seconds)\n", + "Cbc0010I After 706000 nodes, 763 on tree, 1e+50 best solution, best possible 0 (124.76 seconds)\n", + "Cbc0010I After 707000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (124.86 seconds)\n", + "Cbc0010I After 708000 nodes, 740 on tree, 1e+50 best solution, best possible 0 (124.96 seconds)\n", + "Cbc0010I After 709000 nodes, 738 on tree, 1e+50 best solution, best possible 0 (125.05 seconds)\n", + "Cbc0010I After 710000 nodes, 727 on tree, 1e+50 best solution, best possible 0 (125.16 seconds)\n", + "Cbc0010I After 711000 nodes, 721 on tree, 1e+50 best solution, best possible 0 (125.31 seconds)\n", + "Cbc0010I After 712000 nodes, 753 on tree, 1e+50 best solution, best010I After 3663000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (363.32 seconds)\n", + "Cbc0010I After 3664000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (363.38 seconds)\n", + "Cbc0010I After 3665000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (363.56 seconds)\n", + "Cbc0010I After 3666000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (363.74 seconds)\n", + "Cbc0010I After 3667000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (363.81 seconds)\n", + "Cbc0010I After 3668000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (363.88 seconds)\n", + "Cbc0010I After 3669000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (363.99 seconds)\n", + "Cbc0010I After 3670000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (364.13 seconds)\n", + "Cbc0010I After 3671000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (364.32 seconds)\n", + "Cbc0010I After 3672000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (364.39 seconds)\n", + "Cbc0010I After 3673000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (364.55 seconds)\n", + "Cbc0010I After 3674000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (364.69 seconds)\n", + "Cbc0010I After 3675000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (364.82 seconds)\n", + "Cbc0010I After 3676000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (364.91 seconds)\n", + "Cbc0010I After 3677000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (365.05 seconds)\n", + "Cbc0010I After 3678000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (365.13 seconds)\n", + "Cbc0010I After 3679000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (365.25 seconds)\n", + "Cbc0010I After 3680000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (365.37 seconds)\n", + "Cbc0010I After 3681000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (365.50 seconds)\n", + "Cbc0010I After 3682000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (365.65 seconds)\n", + "Cbc0010I After 3683000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (365.80 seconds)\n", + "Cbc0010I After 3684000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (365.93 seconds)\n", + "Cbc0010I After 3685000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (366.03 seconds)\n", + "Cbc0010I After 3686000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (366.08 seconds)\n", + "Cbc0010I After 3687000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (366.15 seconds)\n", + "Cbc0010I After 3688000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (366.21 seconds)\n", + "Cbc0010I After 3689000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (366.37 seconds)\n", + "Cbc0010I After 3690000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (366.57 seconds)\n", + "Cbc0010I After 3691000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (366.75 seconds)\n", + "Cbc0010I After 3692000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (366.88 seconds)\n", + "Cbc0010I After 3693000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (367.01 seconds)\n", + "Cbc0010I After 3694000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (367.13 seconds)\n", + "Cbc0010I After 3695000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (367.17 seconds)\n", + "Cbc0010I After 3696000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (367.22 seconds)\n", + "Cbc0010I After 3697000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (367.27 seconds)\n", + "Cbc0010I After 3698000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (367.41 seconds)\n", + "Cbc0010I After 3699000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (367.52 seconds)\n", + "Cbc0010I After 3700000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (367.61 seconds)\n", + "Cbc0010I After 3701000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (367.73 seconds)\n", + "Cbc0010I After 3702000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (367.81 seconds)\n", + "Cbc0010I After 3703000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (367.86 seconds)\n", + "Cbc0010I After 3704000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (367.98 seconds)\n", + "Cbc0010I After 3705000 nodes, 77 on tree, 1e+50 best solution, possible 0 (125.42 seconds)\n", + "Cbc0010I After 713000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (125.53 seconds)\n", + "Cbc0010I After 714000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (125.63 seconds)\n", + "Cbc0010I After 715000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (125.73 seconds)\n", + "Cbc0010I After 716000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (125.87 seconds)\n", + "Cbc0010I After 717000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (125.99 seconds)\n", + "Cbc0010I After 718000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (126.13 seconds)\n", + "Cbc0010I After 719000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (126.24 seconds)\n", + "Cbc0010I After 720000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (126.36 seconds)\n", + "Cbc0010I After 721000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (126.45 seconds)\n", + "Cbc0010I After 722000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (126.54 seconds)\n", + "Cbc0010I After 723000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (126.64 seconds)\n", + "Cbc0010I After 724000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (126.72 seconds)\n", + "Cbc0010I After 725000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (126.82 seconds)\n", + "Cbc0010I After 726000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (126.91 seconds)\n", + "Cbc0010I After 727000 nodes, 714 on tree, 1e+50 best solution, best possible 0 (127.02 seconds)\n", + "Cbc0010I After 728000 nodes, 731 on tree, 1e+50 best solution, best possible 0 (127.10 seconds)\n", + "Cbc0010I After 729000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (127.19 seconds)\n", + "Cbc0010I After 730000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (127.28 seconds)\n", + "Cbc0010I After 731000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (127.37 seconds)\n", + "Cbc0010I After 732000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (127.46 seconds)\n", + "Cbc0010I After 733000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (127.55 seconds)\n", + "Cbc0010I After 734000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (127.66 seconds)\n", + "Cbc0010I After 735000 nodes, 760 on tree, 1e+50 best solution, best possible 0 (127.75 seconds)\n", + "Cbc0010I After 736000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (127.82 seconds)\n", + "Cbc0010I After 737000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (127.93 seconds)\n", + "Cbc0010I After 738000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (128.02 seconds)\n", + "Cbc0010I After 739000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (128.12 seconds)\n", + "Cbc0010I After 740000 nodes, 730 on tree, 1e+50 best solution, best possible 0 (128.22 seconds)\n", + "Cbc0010I After 741000 nodes, 720 on tree, 1e+50 best solution, best possible 0 (128.31 seconds)\n", + "Cbc0010I After 742000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (128.41 seconds)\n", + "Cbc0010I After 743000 nodes, 710 on tree, 1e+50 best solution, best possible 0 (128.50 seconds)\n", + "Cbc0010I After 744000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (128.62 seconds)\n", + "Cbc0010I After 745000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (128.78 seconds)\n", + "Cbc0010I After 746000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (128.93 seconds)\n", + "Cbc0010I After 747000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (129.06 seconds)\n", + "Cbc0010I After 748000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (129.21 seconds)\n", + "Cbc0010I After 749000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (129.35 seconds)\n", + "Cbc0010I After 750000 nodes, 694 on tree, 1e+50 best solution, best possible 0 (129.50 seconds)\n", + "Cbc0010I After 751000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (129.63 seconds)\n", + "Cbc0010I After 752000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (129.79 seconds)\n", + "Cbc0010I After 753000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (129.95 seconds)\n", + "Cbc0010I After 754000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (130.09 seconds)\n", + "Cbc0010I After 755000 nodes, 710 onbest possible 0 (368.12 seconds)\n", + "Cbc0010I After 3706000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (368.26 seconds)\n", + "Cbc0010I After 3707000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (368.40 seconds)\n", + "Cbc0010I After 3708000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (368.53 seconds)\n", + "Cbc0010I After 3709000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (368.70 seconds)\n", + "Cbc0010I After 3710000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (368.79 seconds)\n", + "Cbc0010I After 3711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (368.88 seconds)\n", + "Cbc0010I After 3712000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (368.93 seconds)\n", + "Cbc0010I After 3713000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (368.99 seconds)\n", + "Cbc0010I After 3714000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (369.06 seconds)\n", + "Cbc0010I After 3715000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (369.13 seconds)\n", + "Cbc0010I After 3716000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (369.27 seconds)\n", + "Cbc0010I After 3717000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (369.37 seconds)\n", + "Cbc0010I After 3718000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (369.42 seconds)\n", + "Cbc0010I After 3719000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (369.47 seconds)\n", + "Cbc0010I After 3720000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (369.51 seconds)\n", + "Cbc0010I After 3721000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (369.55 seconds)\n", + "Cbc0010I After 3722000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (369.66 seconds)\n", + "Cbc0010I After 3723000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (369.78 seconds)\n", + "Cbc0010I After 3724000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (369.89 seconds)\n", + "Cbc0010I After 3725000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (370.06 seconds)\n", + "Cbc0010I After 3726000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (370.20 seconds)\n", + "Cbc0010I After 3727000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (370.35 seconds)\n", + "Cbc0010I After 3728000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (370.46 seconds)\n", + "Cbc0010I After 3729000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (370.59 seconds)\n", + "Cbc0010I After 3730000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (370.75 seconds)\n", + "Cbc0010I After 3731000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (370.80 seconds)\n", + "Cbc0010I After 3732000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (370.85 seconds)\n", + "Cbc0010I After 3733000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (370.90 seconds)\n", + "Cbc0010I After 3734000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (370.95 seconds)\n", + "Cbc0010I After 3735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (371.05 seconds)\n", + "Cbc0010I After 3736000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (371.14 seconds)\n", + "Cbc0010I After 3737000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (371.23 seconds)\n", + "Cbc0010I After 3738000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (371.32 seconds)\n", + "Cbc0010I After 3739000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (371.45 seconds)\n", + "Cbc0010I After 3740000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (371.50 seconds)\n", + "Cbc0010I After 3741000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (371.55 seconds)\n", + "Cbc0010I After 3742000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (371.62 seconds)\n", + "Cbc0010I After 3743000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (371.78 seconds)\n", + "Cbc0010I After 3744000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (371.90 seconds)\n", + "Cbc0010I After 3745000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (372.03 seconds)\n", + "Cbc0010I After 3746000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (372.12 seconds)\n", + "Cbc0010I After 3747000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (372.16 seconds)\n", + "Cbc0010I After 3748000 node tree, 1e+50 best solution, best possible 0 (130.22 seconds)\n", + "Cbc0010I After 756000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (130.35 seconds)\n", + "Cbc0010I After 757000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (130.49 seconds)\n", + "Cbc0010I After 758000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (130.75 seconds)\n", + "Cbc0010I After 759000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (130.89 seconds)\n", + "Cbc0010I After 760000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (131.05 seconds)\n", + "Cbc0010I After 761000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (131.17 seconds)\n", + "Cbc0010I After 762000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (131.31 seconds)\n", + "Cbc0010I After 763000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (131.44 seconds)\n", + "Cbc0010I After 764000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (131.57 seconds)\n", + "Cbc0010I After 765000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (131.67 seconds)\n", + "Cbc0010I After 766000 nodes, 754 on tree, 1e+50 best solution, best possible 0 (131.83 seconds)\n", + "Cbc0010I After 767000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (131.91 seconds)\n", + "Cbc0010I After 768000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (132.00 seconds)\n", + "Cbc0010I After 769000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (132.16 seconds)\n", + "Cbc0010I After 770000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (132.31 seconds)\n", + "Cbc0010I After 771000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (132.42 seconds)\n", + "Cbc0010I After 772000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (132.56 seconds)\n", + "Cbc0010I After 773000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (132.68 seconds)\n", + "Cbc0010I After 774000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (132.81 seconds)\n", + "Cbc0010I After 775000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (132.93 seconds)\n", + "Cbc0010I After 776000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (133.06 seconds)\n", + "Cbc0010I After 777000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (133.17 seconds)\n", + "Cbc0010I After 778000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (133.31 seconds)\n", + "Cbc0010I After 779000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (133.41 seconds)\n", + "Cbc0010I After 780000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (133.56 seconds)\n", + "Cbc0010I After 781000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (133.69 seconds)\n", + "Cbc0010I After 782000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (133.80 seconds)\n", + "Cbc0010I After 783000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (133.95 seconds)\n", + "Cbc0010I After 784000 nodes, 725 on tree, 1e+50 best solution, best possible 0 (134.06 seconds)\n", + "Cbc0010I After 785000 nodes, 722 on tree, 1e+50 best solution, best possible 0 (134.17 seconds)\n", + "Cbc0010I After 786000 nodes, 713 on tree, 1e+50 best solution, best possible 0 (134.27 seconds)\n", + "Cbc0010I After 787000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (134.42 seconds)\n", + "Cbc0010I After 788000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (134.54 seconds)\n", + "Cbc0010I After 789000 nodes, 693 on tree, 1e+50 best solution, best possible 0 (134.65 seconds)\n", + "Cbc0010I After 790000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (134.73 seconds)\n", + "Cbc0010I After 791000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (134.82 seconds)\n", + "Cbc0010I After 792000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (134.91 seconds)\n", + "Cbc0010I After 793000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (135.00 seconds)\n", + "Cbc0010I After 794000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (135.09 seconds)\n", + "Cbc0010I After 795000 nodes, 751 on tree, 1e+50 best solution, best possible 0 (135.20 seconds)\n", + "Cbc0010I After 796000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (135.30 seconds)\n", + "Cbc0010I After 797000 nodes, 731 on tree, 1e+50 best solution, best possible 0 (135.40 seconds)\n", + "Cbcs, 70 on tree, 1e+50 best solution, best possible 0 (372.28 seconds)\n", + "Cbc0010I After 3749000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (372.40 seconds)\n", + "Cbc0010I After 3750000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (372.54 seconds)\n", + "Cbc0010I After 3751000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (372.69 seconds)\n", + "Cbc0010I After 3752000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (372.85 seconds)\n", + "Cbc0010I After 3753000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (372.98 seconds)\n", + "Cbc0010I After 3754000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (373.11 seconds)\n", + "Cbc0010I After 3755000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (373.23 seconds)\n", + "Cbc0010I After 3756000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (373.38 seconds)\n", + "Cbc0010I After 3757000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (373.50 seconds)\n", + "Cbc0010I After 3758000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (373.64 seconds)\n", + "Cbc0010I After 3759000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (373.77 seconds)\n", + "Cbc0010I After 3760000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (373.92 seconds)\n", + "Cbc0010I After 3761000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (374.08 seconds)\n", + "Cbc0010I After 3762000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (374.22 seconds)\n", + "Cbc0010I After 3763000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (374.40 seconds)\n", + "Cbc0010I After 3764000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (374.53 seconds)\n", + "Cbc0010I After 3765000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (374.67 seconds)\n", + "Cbc0010I After 3766000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (374.81 seconds)\n", + "Cbc0010I After 3767000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (374.96 seconds)\n", + "Cbc0010I After 3768000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (375.10 seconds)\n", + "Cbc0010I After 3769000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (375.23 seconds)\n", + "Cbc0010I After 3770000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (375.36 seconds)\n", + "Cbc0010I After 3771000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (375.49 seconds)\n", + "Cbc0010I After 3772000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (375.64 seconds)\n", + "Cbc0010I After 3773000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (375.78 seconds)\n", + "Cbc0010I After 3774000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (375.91 seconds)\n", + "Cbc0010I After 3775000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (376.02 seconds)\n", + "Cbc0010I After 3776000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (376.15 seconds)\n", + "Cbc0010I After 3777000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (376.31 seconds)\n", + "Cbc0010I After 3778000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (376.47 seconds)\n", + "Cbc0010I After 3779000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (376.60 seconds)\n", + "Cbc0010I After 3780000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (376.75 seconds)\n", + "Cbc0010I After 3781000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (376.90 seconds)\n", + "Cbc0010I After 3782000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (377.05 seconds)\n", + "Cbc0010I After 3783000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (377.19 seconds)\n", + "Cbc0010I After 3784000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (377.35 seconds)\n", + "Cbc0010I After 3785000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (377.46 seconds)\n", + "Cbc0010I After 3786000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (377.50 seconds)\n", + "Cbc0010I After 3787000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (377.54 seconds)\n", + "Cbc0010I After 3788000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (377.58 seconds)\n", + "Cbc0010I After 3789000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (377.64 seconds)\n", + "Cbc0010I After 3790000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (377.79 seco0010I After 798000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (135.48 seconds)\n", + "Cbc0010I After 799000 nodes, 718 on tree, 1e+50 best solution, best possible 0 (135.57 seconds)\n", + "Cbc0010I After 800000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (135.65 seconds)\n", + "Cbc0010I After 801000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (135.75 seconds)\n", + "Cbc0010I After 802000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (135.85 seconds)\n", + "Cbc0010I After 803000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (135.96 seconds)\n", + "Cbc0010I After 804000 nodes, 698 on tree, 1e+50 best solution, best possible 0 (136.04 seconds)\n", + "Cbc0010I After 805000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (136.13 seconds)\n", + "Cbc0010I After 806000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (136.25 seconds)\n", + "Cbc0010I After 807000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (136.35 seconds)\n", + "Cbc0010I After 808000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (136.44 seconds)\n", + "Cbc0010I After 809000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (136.54 seconds)\n", + "Cbc0010I After 810000 nodes, 752 on tree, 1e+50 best solution, best possible 0 (136.62 seconds)\n", + "Cbc0010I After 811000 nodes, 738 on tree, 1e+50 best solution, best possible 0 (136.72 seconds)\n", + "Cbc0010I After 812000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (136.82 seconds)\n", + "Cbc0010I After 813000 nodes, 716 on tree, 1e+50 best solution, best possible 0 (136.93 seconds)\n", + "Cbc0010I After 814000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (137.00 seconds)\n", + "Cbc0010I After 815000 nodes, 722 on tree, 1e+50 best solution, best possible 0 (137.08 seconds)\n", + "Cbc0010I After 816000 nodes, 716 on tree, 1e+50 best solution, best possible 0 (137.15 seconds)\n", + "Cbc0010I After 817000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (137.24 seconds)\n", + "Cbc0010I After 818000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (137.33 seconds)\n", + "Cbc0010I After 819000 nodes, 677 on tree, 1e+50 best solution, best possible 0 (137.42 seconds)\n", + "Cbc0010I After 820000 nodes, 730 on tree, 1e+50 best solution, best possible 0 (137.53 seconds)\n", + "Cbc0010I After 821000 nodes, 689 on tree, 1e+50 best solution, best possible 0 (137.67 seconds)\n", + "Cbc0010I After 822000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (137.84 seconds)\n", + "Cbc0010I After 823000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (137.98 seconds)\n", + "Cbc0010I After 824000 nodes, 697 on tree, 1e+50 best solution, best possible 0 (138.11 seconds)\n", + "Cbc0010I After 825000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (138.26 seconds)\n", + "Cbc0010I After 826000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (138.39 seconds)\n", + "Cbc0010I After 827000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (138.52 seconds)\n", + "Cbc0010I After 828000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (138.65 seconds)\n", + "Cbc0010I After 829000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (138.86 seconds)\n", + "Cbc0010I After 830000 nodes, 785 on tree, 1e+50 best solution, best possible 0 (139.04 seconds)\n", + "Cbc0010I After 831000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (139.30 seconds)\n", + "Cbc0010I After 832000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (139.62 seconds)\n", + "Cbc0010I After 833000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (139.82 seconds)\n", + "Cbc0010I After 834000 nodes, 739 on tree, 1e+50 best solution, best possible 0 (140.06 seconds)\n", + "Cbc0010I After 835000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (140.36 seconds)\n", + "Cbc0010I After 836000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (140.52 seconds)\n", + "Cbc0010I After 837000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (140.76 seconds)\n", + "Cbc0010I After 838000 nodes, 704 on tree, 1e+50 best solution, best possible 0 (141.01 seconds)\n", + "Cbc0010I After 839000 nodes, 672 on tree, 1e+50 best solution, best possible 0 (141.18 seconds)\n", + "Cbc0010I After 840000 nodes, 662 on tree, 1e+50 best solution, bestnds)\n", + "Cbc0010I After 3791000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (377.91 seconds)\n", + "Cbc0010I After 3792000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (378.05 seconds)\n", + "Cbc0010I After 3793000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (378.14 seconds)\n", + "Cbc0010I After 3794000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (378.29 seconds)\n", + "Cbc0010I After 3795000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (378.38 seconds)\n", + "Cbc0010I After 3796000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (378.52 seconds)\n", + "Cbc0010I After 3797000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (378.63 seconds)\n", + "Cbc0010I After 3798000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (378.71 seconds)\n", + "Cbc0010I After 3799000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (378.75 seconds)\n", + "Cbc0010I After 3800000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (378.80 seconds)\n", + "Cbc0010I After 3801000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (378.85 seconds)\n", + "Cbc0010I After 3802000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (378.90 seconds)\n", + "Cbc0010I After 3803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (378.95 seconds)\n", + "Cbc0010I After 3804000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (378.99 seconds)\n", + "Cbc0010I After 3805000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (379.04 seconds)\n", + "Cbc0010I After 3806000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (379.08 seconds)\n", + "Cbc0010I After 3807000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (379.18 seconds)\n", + "Cbc0010I After 3808000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (379.37 seconds)\n", + "Cbc0010I After 3809000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (379.52 seconds)\n", + "Cbc0010I After 3810000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (379.73 seconds)\n", + "Cbc0010I After 3811000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (379.94 seconds)\n", + "Cbc0010I After 3812000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (380.21 seconds)\n", + "Cbc0010I After 3813000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (380.41 seconds)\n", + "Cbc0010I After 3814000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (380.64 seconds)\n", + "Cbc0010I After 3815000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (380.81 seconds)\n", + "Cbc0010I After 3816000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (380.98 seconds)\n", + "Cbc0010I After 3817000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (381.12 seconds)\n", + "Cbc0010I After 3818000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (381.34 seconds)\n", + "Cbc0010I After 3819000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (381.53 seconds)\n", + "Cbc0010I After 3820000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (381.64 seconds)\n", + "Cbc0010I After 3821000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (381.78 seconds)\n", + "Cbc0010I After 3822000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (381.93 seconds)\n", + "Cbc0010I After 3823000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (382.15 seconds)\n", + "Cbc0010I After 3824000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (382.35 seconds)\n", + "Cbc0010I After 3825000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (382.55 seconds)\n", + "Cbc0010I After 3826000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (382.71 seconds)\n", + "Cbc0010I After 3827000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (382.89 seconds)\n", + "Cbc0010I After 3828000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (383.09 seconds)\n", + "Cbc0010I After 3829000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (383.25 seconds)\n", + "Cbc0010I After 3830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (383.35 seconds)\n", + "Cbc0010I After 3831000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (383.45 seconds)\n", + "Cbc0010I After 3832000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (383.56 seconds)\n", + "Cbc0010I After 3833000 nodes, 108 on tree, 1e+50 possible 0 (141.35 seconds)\n", + "Cbc0010I After 841000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (141.49 seconds)\n", + "Cbc0010I After 842000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (141.76 seconds)\n", + "Cbc0010I After 843000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (142.01 seconds)\n", + "Cbc0010I After 844000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (142.20 seconds)\n", + "Cbc0010I After 845000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (142.43 seconds)\n", + "Cbc0010I After 846000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (142.62 seconds)\n", + "Cbc0010I After 847000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (142.81 seconds)\n", + "Cbc0010I After 848000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (142.93 seconds)\n", + "Cbc0010I After 849000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (143.07 seconds)\n", + "Cbc0010I After 850000 nodes, 707 on tree, 1e+50 best solution, best possible 0 (143.19 seconds)\n", + "Cbc0010I After 851000 nodes, 709 on tree, 1e+50 best solution, best possible 0 (143.30 seconds)\n", + "Cbc0010I After 852000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (143.41 seconds)\n", + "Cbc0010I After 853000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (143.53 seconds)\n", + "Cbc0010I After 854000 nodes, 671 on tree, 1e+50 best solution, best possible 0 (143.68 seconds)\n", + "Cbc0010I After 855000 nodes, 667 on tree, 1e+50 best solution, best possible 0 (143.81 seconds)\n", + "Cbc0010I After 856000 nodes, 683 on tree, 1e+50 best solution, best possible 0 (143.93 seconds)\n", + "Cbc0010I After 857000 nodes, 658 on tree, 1e+50 best solution, best possible 0 (144.07 seconds)\n", + "Cbc0010I After 858000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (144.19 seconds)\n", + "Cbc0010I After 859000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (144.33 seconds)\n", + "Cbc0010I After 860000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (144.45 seconds)\n", + "Cbc0010I After 861000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (144.58 seconds)\n", + "Cbc0010I After 862000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (144.67 seconds)\n", + "Cbc0010I After 863000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (144.82 seconds)\n", + "Cbc0010I After 864000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (144.91 seconds)\n", + "Cbc0010I After 865000 nodes, 729 on tree, 1e+50 best solution, best possible 0 (145.10 seconds)\n", + "Cbc0010I After 866000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (145.18 seconds)\n", + "Cbc0010I After 867000 nodes, 717 on tree, 1e+50 best solution, best possible 0 (145.31 seconds)\n", + "Cbc0010I After 868000 nodes, 697 on tree, 1e+50 best solution, best possible 0 (145.41 seconds)\n", + "Cbc0010I After 869000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (145.48 seconds)\n", + "Cbc0010I After 870000 nodes, 698 on tree, 1e+50 best solution, best possible 0 (145.59 seconds)\n", + "Cbc0010I After 871000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (145.71 seconds)\n", + "Cbc0010I After 872000 nodes, 664 on tree, 1e+50 best solution, best possible 0 (145.78 seconds)\n", + "Cbc0010I After 873000 nodes, 676 on tree, 1e+50 best solution, best possible 0 (145.98 seconds)\n", + "Cbc0010I After 874000 nodes, 648 on tree, 1e+50 best solution, best possible 0 (146.21 seconds)\n", + "Cbc0010I After 875000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (146.40 seconds)\n", + "Cbc0010I After 876000 nodes, 710 on tree, 1e+50 best solution, best possible 0 (146.62 seconds)\n", + "Cbc0010I After 877000 nodes, 673 on tree, 1e+50 best solution, best possible 0 (146.83 seconds)\n", + "Cbc0010I After 878000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (147.00 seconds)\n", + "Cbc0010I After 879000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (147.11 seconds)\n", + "Cbc0010I After 880000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (147.20 seconds)\n", + "Cbc0010I After 881000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (147.28 seconds)\n", + "Cbc0010I After 882000 nodes, 694 on tree, 1e+50 best solution, best possible 0 (147.35 seconds)\n", + "Cbc0010I After 883000 nodes, 701 on best solution, best possible 0 (383.66 seconds)\n", + "Cbc0010I After 3834000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (383.75 seconds)\n", + "Cbc0010I After 3835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (383.88 seconds)\n", + "Cbc0010I After 3836000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (383.99 seconds)\n", + "Cbc0010I After 3837000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (384.13 seconds)\n", + "Cbc0010I After 3838000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (384.26 seconds)\n", + "Cbc0010I After 3839000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (384.38 seconds)\n", + "Cbc0010I After 3840000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (384.50 seconds)\n", + "Cbc0010I After 3841000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (384.61 seconds)\n", + "Cbc0010I After 3842000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (384.71 seconds)\n", + "Cbc0010I After 3843000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (384.79 seconds)\n", + "Cbc0010I After 3844000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (384.90 seconds)\n", + "Cbc0010I After 3845000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (385.01 seconds)\n", + "Cbc0010I After 3846000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (385.12 seconds)\n", + "Cbc0010I After 3847000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (385.21 seconds)\n", + "Cbc0010I After 3848000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (385.31 seconds)\n", + "Cbc0010I After 3849000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (385.41 seconds)\n", + "Cbc0010I After 3850000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (385.57 seconds)\n", + "Cbc0010I After 3851000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (385.65 seconds)\n", + "Cbc0010I After 3852000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (385.77 seconds)\n", + "Cbc0010I After 3853000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (385.87 seconds)\n", + "Cbc0010I After 3854000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (385.94 seconds)\n", + "Cbc0010I After 3855000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (386.00 seconds)\n", + "Cbc0010I After 3856000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (386.08 seconds)\n", + "Cbc0010I After 3857000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (386.17 seconds)\n", + "Cbc0010I After 3858000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (386.24 seconds)\n", + "Cbc0010I After 3859000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (386.37 seconds)\n", + "Cbc0010I After 3860000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (386.49 seconds)\n", + "Cbc0010I After 3861000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (386.69 seconds)\n", + "Cbc0010I After 3862000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (386.81 seconds)\n", + "Cbc0010I After 3863000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (386.90 seconds)\n", + "Cbc0010I After 3864000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (387.11 seconds)\n", + "Cbc0010I After 3865000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (387.26 seconds)\n", + "Cbc0010I After 3866000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (387.42 seconds)\n", + "Cbc0010I After 3867000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (387.54 seconds)\n", + "Cbc0010I After 3868000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (387.65 seconds)\n", + "Cbc0010I After 3869000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (387.74 seconds)\n", + "Cbc0010I After 3870000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (387.85 seconds)\n", + "Cbc0010I After 3871000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (387.98 seconds)\n", + "Cbc0010I After 3872000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (388.09 seconds)\n", + "Cbc0010I After 3873000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (388.22 seconds)\n", + "Cbc0010I After 3874000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (388.32 seconds)\n", + "Cbc0010I After 3875000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (388.44 seconds)\n", + "Cbc tree, 1e+50 best solution, best possible 0 (147.47 seconds)\n", + "Cbc0010I After 884000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (147.58 seconds)\n", + "Cbc0010I After 885000 nodes, 692 on tree, 1e+50 best solution, best possible 0 (147.64 seconds)\n", + "Cbc0010I After 886000 nodes, 666 on tree, 1e+50 best solution, best possible 0 (147.72 seconds)\n", + "Cbc0010I After 887000 nodes, 659 on tree, 1e+50 best solution, best possible 0 (147.82 seconds)\n", + "Cbc0010I After 888000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (147.90 seconds)\n", + "Cbc0010I After 889000 nodes, 664 on tree, 1e+50 best solution, best possible 0 (148.03 seconds)\n", + "Cbc0010I After 890000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (148.17 seconds)\n", + "Cbc0010I After 891000 nodes, 649 on tree, 1e+50 best solution, best possible 0 (148.31 seconds)\n", + "Cbc0010I After 892000 nodes, 633 on tree, 1e+50 best solution, best possible 0 (148.44 seconds)\n", + "Cbc0010I After 893000 nodes, 627 on tree, 1e+50 best solution, best possible 0 (148.61 seconds)\n", + "Cbc0010I After 894000 nodes, 721 on tree, 1e+50 best solution, best possible 0 (148.84 seconds)\n", + "Cbc0010I After 895000 nodes, 669 on tree, 1e+50 best solution, best possible 0 (149.12 seconds)\n", + "Cbc0010I After 896000 nodes, 631 on tree, 1e+50 best solution, best possible 0 (149.35 seconds)\n", + "Cbc0010I After 897000 nodes, 607 on tree, 1e+50 best solution, best possible 0 (149.50 seconds)\n", + "Cbc0010I After 898000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (149.62 seconds)\n", + "Cbc0010I After 899000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (149.77 seconds)\n", + "Cbc0010I After 900000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (149.92 seconds)\n", + "Cbc0010I After 901000 nodes, 713 on tree, 1e+50 best solution, best possible 0 (150.04 seconds)\n", + "Cbc0010I After 902000 nodes, 686 on tree, 1e+50 best solution, best possible 0 (150.19 seconds)\n", + "Cbc0010I After 903000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (150.35 seconds)\n", + "Cbc0010I After 904000 nodes, 671 on tree, 1e+50 best solution, best possible 0 (150.47 seconds)\n", + "Cbc0010I After 905000 nodes, 661 on tree, 1e+50 best solution, best possible 0 (150.60 seconds)\n", + "Cbc0010I After 906000 nodes, 647 on tree, 1e+50 best solution, best possible 0 (150.75 seconds)\n", + "Cbc0010I After 907000 nodes, 634 on tree, 1e+50 best solution, best possible 0 (150.86 seconds)\n", + "Cbc0010I After 908000 nodes, 633 on tree, 1e+50 best solution, best possible 0 (150.95 seconds)\n", + "Cbc0010I After 909000 nodes, 623 on tree, 1e+50 best solution, best possible 0 (151.05 seconds)\n", + "Cbc0010I After 910000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (151.18 seconds)\n", + "Cbc0010I After 911000 nodes, 616 on tree, 1e+50 best solution, best possible 0 (151.30 seconds)\n", + "Cbc0010I After 912000 nodes, 593 on tree, 1e+50 best solution, best possible 0 (151.41 seconds)\n", + "Cbc0010I After 913000 nodes, 584 on tree, 1e+50 best solution, best possible 0 (151.49 seconds)\n", + "Cbc0010I After 914000 nodes, 596 on tree, 1e+50 best solution, best possible 0 (151.60 seconds)\n", + "Cbc0010I After 915000 nodes, 626 on tree, 1e+50 best solution, best possible 0 (151.71 seconds)\n", + "Cbc0010I After 916000 nodes, 583 on tree, 1e+50 best solution, best possible 0 (151.82 seconds)\n", + "Cbc0010I After 917000 nodes, 566 on tree, 1e+50 best solution, best possible 0 (151.91 seconds)\n", + "Cbc0010I After 918000 nodes, 743 on tree, 1e+50 best solution, best possible 0 (152.01 seconds)\n", + "Cbc0010I After 919000 nodes, 707 on tree, 1e+50 best solution, best possible 0 (152.15 seconds)\n", + "Cbc0010I After 920000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (152.29 seconds)\n", + "Cbc0010I After 921000 nodes, 660 on tree, 1e+50 best solution, best possible 0 (152.48 seconds)\n", + "Cbc0010I After 922000 nodes, 665 on tree, 1e+50 best solution, best possible 0 (152.64 seconds)\n", + "Cbc0010I After 923000 nodes, 635 on tree, 1e+50 best solution, best possible 0 (152.85 seconds)\n", + "Cbc0010I After 924000 nodes, 625 on tree, 1e+50 best solution, best possible 0 (153.15 seconds)\n", + "Cbc0010I After 925000 nodes, 624 on tree, 1e+50 best solution, best possible 0 (153.35 seconds)\n", + "Cbc0010I After 3876000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (388.63 seconds)\n", + "Cbc0010I After 3877000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (388.77 seconds)\n", + "Cbc0010I After 3878000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (388.95 seconds)\n", + "Cbc0010I After 3879000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (389.17 seconds)\n", + "Cbc0010I After 3880000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (389.36 seconds)\n", + "Cbc0010I After 3881000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (389.62 seconds)\n", + "Cbc0010I After 3882000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (389.82 seconds)\n", + "Cbc0010I After 3883000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (389.97 seconds)\n", + "Cbc0010I After 3884000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (390.05 seconds)\n", + "Cbc0010I After 3885000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (390.16 seconds)\n", + "Cbc0010I After 3886000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (390.25 seconds)\n", + "Cbc0010I After 3887000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (390.37 seconds)\n", + "Cbc0010I After 3888000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (390.48 seconds)\n", + "Cbc0010I After 3889000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (390.58 seconds)\n", + "Cbc0010I After 3890000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (390.72 seconds)\n", + "Cbc0010I After 3891000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (390.84 seconds)\n", + "Cbc0010I After 3892000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (390.96 seconds)\n", + "Cbc0010I After 3893000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (391.07 seconds)\n", + "Cbc0010I After 3894000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (391.19 seconds)\n", + "Cbc0010I After 3895000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (391.28 seconds)\n", + "Cbc0010I After 3896000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (391.38 seconds)\n", + "Cbc0010I After 3897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (391.46 seconds)\n", + "Cbc0010I After 3898000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (391.55 seconds)\n", + "Cbc0010I After 3899000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (391.66 seconds)\n", + "Cbc0010I After 3900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (391.77 seconds)\n", + "Cbc0010I After 3901000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (391.85 seconds)\n", + "Cbc0010I After 3902000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (391.94 seconds)\n", + "Cbc0010I After 3903000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (392.05 seconds)\n", + "Cbc0010I After 3904000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (392.15 seconds)\n", + "Cbc0010I After 3905000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (392.22 seconds)\n", + "Cbc0010I After 3906000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (392.31 seconds)\n", + "Cbc0010I After 3907000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (392.45 seconds)\n", + "Cbc0010I After 3908000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (392.59 seconds)\n", + "Cbc0010I After 3909000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (392.69 seconds)\n", + "Cbc0010I After 3910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (392.82 seconds)\n", + "Cbc0010I After 3911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (393.04 seconds)\n", + "Cbc0010I After 3912000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (393.18 seconds)\n", + "Cbc0010I After 3913000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (393.43 seconds)\n", + "Cbc0010I After 3914000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (393.66 seconds)\n", + "Cbc0010I After 3915000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (393.81 seconds)\n", + "Cbc0010I After 3916000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (393.92 seconds)\n", + "Cbc0010I After 3917000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (394.12 seconds)\n", + "Cbc0010I After 3918000 nodes, 61 on tree, 1e+50 best solution0010I After 926000 nodes, 622 on tree, 1e+50 best solution, best possible 0 (153.55 seconds)\n", + "Cbc0010I After 927000 nodes, 618 on tree, 1e+50 best solution, best possible 0 (153.82 seconds)\n", + "Cbc0010I After 928000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (154.01 seconds)\n", + "Cbc0010I After 929000 nodes, 615 on tree, 1e+50 best solution, best possible 0 (154.27 seconds)\n", + "Cbc0010I After 930000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (154.45 seconds)\n", + "Cbc0010I After 931000 nodes, 590 on tree, 1e+50 best solution, best possible 0 (154.60 seconds)\n", + "Cbc0010I After 932000 nodes, 553 on tree, 1e+50 best solution, best possible 0 (154.71 seconds)\n", + "Cbc0010I After 933000 nodes, 669 on tree, 1e+50 best solution, best possible 0 (154.80 seconds)\n", + "Cbc0010I After 934000 nodes, 637 on tree, 1e+50 best solution, best possible 0 (154.88 seconds)\n", + "Cbc0010I After 935000 nodes, 625 on tree, 1e+50 best solution, best possible 0 (154.99 seconds)\n", + "Cbc0010I After 936000 nodes, 631 on tree, 1e+50 best solution, best possible 0 (155.10 seconds)\n", + "Cbc0010I After 937000 nodes, 601 on tree, 1e+50 best solution, best possible 0 (155.20 seconds)\n", + "Cbc0010I After 938000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (155.31 seconds)\n", + "Cbc0010I After 939000 nodes, 595 on tree, 1e+50 best solution, best possible 0 (155.44 seconds)\n", + "Cbc0010I After 940000 nodes, 604 on tree, 1e+50 best solution, best possible 0 (155.57 seconds)\n", + "Cbc0010I After 941000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (155.70 seconds)\n", + "Cbc0010I After 942000 nodes, 564 on tree, 1e+50 best solution, best possible 0 (155.84 seconds)\n", + "Cbc0010I After 943000 nodes, 560 on tree, 1e+50 best solution, best possible 0 (155.97 seconds)\n", + "Cbc0010I After 944000 nodes, 561 on tree, 1e+50 best solution, best possible 0 (156.11 seconds)\n", + "Cbc0010I After 945000 nodes, 576 on tree, 1e+50 best solution, best possible 0 (156.22 seconds)\n", + "Cbc0010I After 946000 nodes, 560 on tree, 1e+50 best solution, best possible 0 (156.34 seconds)\n", + "Cbc0010I After 947000 nodes, 557 on tree, 1e+50 best solution, best possible 0 (156.45 seconds)\n", + "Cbc0010I After 948000 nodes, 548 on tree, 1e+50 best solution, best possible 0 (156.55 seconds)\n", + "Cbc0010I After 949000 nodes, 641 on tree, 1e+50 best solution, best possible 0 (156.66 seconds)\n", + "Cbc0010I After 950000 nodes, 642 on tree, 1e+50 best solution, best possible 0 (156.76 seconds)\n", + "Cbc0010I After 951000 nodes, 640 on tree, 1e+50 best solution, best possible 0 (156.85 seconds)\n", + "Cbc0010I After 952000 nodes, 615 on tree, 1e+50 best solution, best possible 0 (156.96 seconds)\n", + "Cbc0010I After 953000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (157.07 seconds)\n", + "Cbc0010I After 954000 nodes, 579 on tree, 1e+50 best solution, best possible 0 (157.16 seconds)\n", + "Cbc0010I After 955000 nodes, 577 on tree, 1e+50 best solution, best possible 0 (157.25 seconds)\n", + "Cbc0010I After 956000 nodes, 578 on tree, 1e+50 best solution, best possible 0 (157.36 seconds)\n", + "Cbc0010I After 957000 nodes, 569 on tree, 1e+50 best solution, best possible 0 (157.45 seconds)\n", + "Cbc0010I After 958000 nodes, 569 on tree, 1e+50 best solution, best possible 0 (157.54 seconds)\n", + "Cbc0010I After 959000 nodes, 559 on tree, 1e+50 best solution, best possible 0 (157.61 seconds)\n", + "Cbc0010I After 960000 nodes, 537 on tree, 1e+50 best solution, best possible 0 (157.69 seconds)\n", + "Cbc0010I After 961000 nodes, 543 on tree, 1e+50 best solution, best possible 0 (157.77 seconds)\n", + "Cbc0010I After 962000 nodes, 571 on tree, 1e+50 best solution, best possible 0 (157.85 seconds)\n", + "Cbc0010I After 963000 nodes, 541 on tree, 1e+50 best solution, best possible 0 (157.94 seconds)\n", + "Cbc0010I After 964000 nodes, 534 on tree, 1e+50 best solution, best possible 0 (158.05 seconds)\n", + "Cbc0010I After 965000 nodes, 542 on tree, 1e+50 best solution, best possible 0 (158.15 seconds)\n", + "Cbc0010I After 966000 nodes, 493 on tree, 1e+50 best solution, best possible 0 (158.25 seconds)\n", + "Cbc0010I After 967000 nodes, 592 on tree, 1e+50 best solution, best possible 0 (158.39 seconds)\n", + "Cbc0010I After 968000 nodes, 546 on tree, 1e+50 best solution, best, best possible 0 (394.37 seconds)\n", + "Cbc0010I After 3919000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (394.56 seconds)\n", + "Cbc0010I After 3920000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (394.80 seconds)\n", + "Cbc0010I After 3921000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (394.93 seconds)\n", + "Cbc0010I After 3922000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (395.08 seconds)\n", + "Cbc0010I After 3923000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (395.19 seconds)\n", + "Cbc0010I After 3924000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (395.29 seconds)\n", + "Cbc0010I After 3925000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (395.39 seconds)\n", + "Cbc0010I After 3926000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (395.47 seconds)\n", + "Cbc0010I After 3927000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (395.56 seconds)\n", + "Cbc0010I After 3928000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (395.70 seconds)\n", + "Cbc0010I After 3929000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (395.85 seconds)\n", + "Cbc0010I After 3930000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (395.99 seconds)\n", + "Cbc0010I After 3931000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (396.07 seconds)\n", + "Cbc0010I After 3932000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (396.15 seconds)\n", + "Cbc0010I After 3933000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (396.34 seconds)\n", + "Cbc0010I After 3934000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (396.56 seconds)\n", + "Cbc0010I After 3935000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (396.74 seconds)\n", + "Cbc0010I After 3936000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (396.91 seconds)\n", + "Cbc0010I After 3937000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (397.08 seconds)\n", + "Cbc0010I After 3938000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (397.14 seconds)\n", + "Cbc0010I After 3939000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (397.24 seconds)\n", + "Cbc0010I After 3940000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (397.33 seconds)\n", + "Cbc0010I After 3941000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (397.44 seconds)\n", + "Cbc0010I After 3942000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (397.50 seconds)\n", + "Cbc0010I After 3943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (397.60 seconds)\n", + "Cbc0010I After 3944000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (397.68 seconds)\n", + "Cbc0010I After 3945000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (397.76 seconds)\n", + "Cbc0010I After 3946000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (397.87 seconds)\n", + "Cbc0010I After 3947000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (397.96 seconds)\n", + "Cbc0010I After 3948000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (398.09 seconds)\n", + "Cbc0010I After 3949000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (398.22 seconds)\n", + "Cbc0010I After 3950000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (398.34 seconds)\n", + "Cbc0010I After 3951000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (398.48 seconds)\n", + "Cbc0010I After 3952000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (398.60 seconds)\n", + "Cbc0010I After 3953000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (398.72 seconds)\n", + "Cbc0010I After 3954000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (398.86 seconds)\n", + "Cbc0010I After 3955000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (399.00 seconds)\n", + "Cbc0010I After 3956000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (399.12 seconds)\n", + "Cbc0010I After 3957000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (399.29 seconds)\n", + "Cbc0010I After 3958000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (399.50 seconds)\n", + "Cbc0010I After 3959000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (399.65 seconds)\n", + "Cbc0010I After 3960000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (399.80 seconds)\n", + "Cbc0010I After 3961000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (399.87 seconds)\n", + "Cbc0010I After 3962000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (399.98 seconds)\n", + "Cbc0010I After 3963000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (400.04 seconds)\n", + "Cbc0010I After 3964000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (400.17 seconds)\n", + "Cbc0010I After 3965000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (400.32 seconds)\n", + "Cbc0010I After 3966000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (400.49 seconds)\n", + "Cbc0010I After 3967000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (400.66 seconds)\n", + "Cbc0010I After 3968000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (400.83 seconds)\n", + "Cbc0010I After 3969000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (401.00 seconds)\n", + "Cbc0010I After 3970000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (401.13 seconds)\n", + "Cbc0010I After 3971000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (401.28 seconds)\n", + "Cbc0010I After 3972000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (401.46 seconds)\n", + "Cbc0010I After 3973000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (401.62 seconds)\n", + "Cbc0010I After 3974000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (401.77 seconds)\n", + "Cbc0010I After 3975000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (401.91 seconds)\n", + "Cbc0010I After 3976000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (402.04 seconds)\n", + "Cbc0010I After 3977000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (402.16 seconds)\n", + "Cbc0010I After 3978000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (402.27 seconds)\n", + "Cbc0010I After 3979000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (402.41 seconds)\n", + "Cbc0010I After 3980000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (402.57 seconds)\n", + "Cbc0010I After 3981000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (402.67 seconds)\n", + "Cbc0010I After 3982000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (402.75 seconds)\n", + "Cbc0010I After 3983000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (402.80 seconds)\n", + "Cbc0010I After 3984000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (402.94 seconds)\n", + "Cbc0010I After 3985000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (403.13 seconds)\n", + "Cbc0010I After 3986000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (403.23 seconds)\n", + "Cbc0010I After 3987000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (403.30 seconds)\n", + "Cbc0010I After 3988000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (403.37 seconds)\n", + "Cbc0010I After 3989000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (403.48 seconds)\n", + "Cbc0010I After 3990000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (403.56 seconds)\n", + "Cbc0010I After 3991000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (403.66 seconds)\n", + "Cbc0010I After 3992000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (403.82 seconds)\n", + "Cbc0010I After 3993000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (403.96 seconds)\n", + "Cbc0010I After 3994000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (404.10 seconds)\n", + "Cbc0010I After 3995000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (404.19 seconds)\n", + "Cbc0010I After 3996000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (404.27 seconds)\n", + "Cbc0010I After 3997000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (404.43 seconds)\n", + "Cbc0010I After 3998000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (404.60 seconds)\n", + "Cbc0010I After 3999000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (404.70 seconds)\n", + "Cbc0010I After 4000000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (404.75 seconds)\n", + "Cbc0010I After 4001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (404.81 seconds)\n", + "Cbc0010I After 4002000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (404.86 seconds)\n", + "Cbc0010I After 4003000 nodes, 106 on tree, 1e+50 best solution, best possib possible 0 (158.54 seconds)\n", + "Cbc0010I After 969000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (158.72 seconds)\n", + "Cbc0010I After 970000 nodes, 487 on tree, 1e+50 best solution, best possible 0 (158.91 seconds)\n", + "Cbc0010I After 971000 nodes, 449 on tree, 1e+50 best solution, best possible 0 (159.13 seconds)\n", + "Cbc0010I After 972000 nodes, 653 on tree, 1e+50 best solution, best possible 0 (159.30 seconds)\n", + "Cbc0010I After 973000 nodes, 621 on tree, 1e+50 best solution, best possible 0 (159.46 seconds)\n", + "Cbc0010I After 974000 nodes, 612 on tree, 1e+50 best solution, best possible 0 (159.60 seconds)\n", + "Cbc0010I After 975000 nodes, 584 on tree, 1e+50 best solution, best possible 0 (159.75 seconds)\n", + "Cbc0010I After 976000 nodes, 558 on tree, 1e+50 best solution, best possible 0 (159.91 seconds)\n", + "Cbc0010I After 977000 nodes, 544 on tree, 1e+50 best solution, best possible 0 (160.08 seconds)\n", + "Cbc0010I After 978000 nodes, 535 on tree, 1e+50 best solution, best possible 0 (160.24 seconds)\n", + "Cbc0010I After 979000 nodes, 535 on tree, 1e+50 best solution, best possible 0 (160.40 seconds)\n", + "Cbc0010I After 980000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (160.58 seconds)\n", + "Cbc0010I After 981000 nodes, 512 on tree, 1e+50 best solution, best possible 0 (160.70 seconds)\n", + "Cbc0010I After 982000 nodes, 488 on tree, 1e+50 best solution, best possible 0 (160.90 seconds)\n", + "Cbc0010I After 983000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (161.03 seconds)\n", + "Cbc0010I After 984000 nodes, 484 on tree, 1e+50 best solution, best possible 0 (161.18 seconds)\n", + "Cbc0010I After 985000 nodes, 459 on tree, 1e+50 best solution, best possible 0 (161.34 seconds)\n", + "Cbc0010I After 986000 nodes, 489 on tree, 1e+50 best solution, best possible 0 (161.45 seconds)\n", + "Cbc0010I After 987000 nodes, 469 on tree, 1e+50 best solution, best possible 0 (161.58 seconds)\n", + "Cbc0010I After 988000 nodes, 426 on tree, 1e+50 best solution, best possible 0 (161.71 seconds)\n", + "Cbc0010I After 989000 nodes, 554 on tree, 1e+50 best solution, best possible 0 (161.81 seconds)\n", + "Cbc0010I After 990000 nodes, 500 on tree, 1e+50 best solution, best possible 0 (161.97 seconds)\n", + "Cbc0010I After 991000 nodes, 458 on tree, 1e+50 best solution, best possible 0 (162.12 seconds)\n", + "Cbc0010I After 992000 nodes, 437 on tree, 1e+50 best solution, best possible 0 (162.28 seconds)\n", + "Cbc0010I After 993000 nodes, 401 on tree, 1e+50 best solution, best possible 0 (162.45 seconds)\n", + "Cbc0010I After 994000 nodes, 453 on tree, 1e+50 best solution, best possible 0 (162.61 seconds)\n", + "Cbc0010I After 995000 nodes, 413 on tree, 1e+50 best solution, best possible 0 (162.77 seconds)\n", + "Cbc0010I After 996000 nodes, 407 on tree, 1e+50 best solution, best possible 0 (162.92 seconds)\n", + "Cbc0010I After 997000 nodes, 491 on tree, 1e+50 best solution, best possible 0 (163.13 seconds)\n", + "Cbc0010I After 998000 nodes, 454 on tree, 1e+50 best solution, best possible 0 (163.38 seconds)\n", + "Cbc0010I After 999000 nodes, 414 on tree, 1e+50 best solution, best possible 0 (163.70 seconds)\n", + "Cbc0010I After 1000000 nodes, 387 on tree, 1e+50 best solution, best possible 0 (163.93 seconds)\n", + "Cbc0010I After 1001000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (164.11 seconds)\n", + "Cbc0010I After 1002000 nodes, 456 on tree, 1e+50 best solution, best possible 0 (164.27 seconds)\n", + "Cbc0010I After 1003000 nodes, 423 on tree, 1e+50 best solution, best possible 0 (164.39 seconds)\n", + "Cbc0010I After 1004000 nodes, 391 on tree, 1e+50 best solution, best possible 0 (164.55 seconds)\n", + "Cbc0010I After 1005000 nodes, 360 on tree, 1e+50 best solution, best possible 0 (164.69 seconds)\n", + "Cbc0010I After 1006000 nodes, 483 on tree, 1e+50 best solution, best possible 0 (164.85 seconds)\n", + "Cbc0010I After 1007000 nodes, 428 on tree, 1e+50 best solution, best possible 0 (165.04 seconds)\n", + "Cbc0010I After 1008000 nodes, 393 on tree, 1e+50 best solution, best possible 0 (165.25 seconds)\n", + "Cbc0010I After 1009000 nodes, 368 on tree, 1e+50 best solution, best possible 0 (165.43 seconds)\n", + "Cbc0010I After 1010000 nodes, 421 on tree, 1e+50 best solution, best possible 0 (165.62 seconds)\n", + "Cbc0010I After 1011000 nle 0 (404.94 seconds)\n", + "Cbc0010I After 4004000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (405.01 seconds)\n", + "Cbc0010I After 4005000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (405.07 seconds)\n", + "Cbc0010I After 4006000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (405.16 seconds)\n", + "Cbc0010I After 4007000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (405.23 seconds)\n", + "Cbc0010I After 4008000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (405.30 seconds)\n", + "Cbc0010I After 4009000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (405.35 seconds)\n", + "Cbc0010I After 4010000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (405.43 seconds)\n", + "Cbc0010I After 4011000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (405.51 seconds)\n", + "Cbc0010I After 4012000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (405.63 seconds)\n", + "Cbc0010I After 4013000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (405.78 seconds)\n", + "Cbc0010I After 4014000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (405.87 seconds)\n", + "Cbc0010I After 4015000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (406.01 seconds)\n", + "Cbc0010I After 4016000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (406.17 seconds)\n", + "Cbc0010I After 4017000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (406.27 seconds)\n", + "Cbc0010I After 4018000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (406.42 seconds)\n", + "Cbc0010I After 4019000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (406.56 seconds)\n", + "Cbc0010I After 4020000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (406.67 seconds)\n", + "Cbc0010I After 4021000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (406.78 seconds)\n", + "Cbc0010I After 4022000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (406.93 seconds)\n", + "Cbc0010I After 4023000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (407.02 seconds)\n", + "Cbc0010I After 4024000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (407.16 seconds)\n", + "Cbc0010I After 4025000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (407.25 seconds)\n", + "Cbc0010I After 4026000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (407.36 seconds)\n", + "Cbc0010I After 4027000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (407.43 seconds)\n", + "Cbc0010I After 4028000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (407.51 seconds)\n", + "Cbc0010I After 4029000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (407.58 seconds)\n", + "Cbc0010I After 4030000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (407.71 seconds)\n", + "Cbc0010I After 4031000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (407.83 seconds)\n", + "Cbc0010I After 4032000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (407.95 seconds)\n", + "Cbc0010I After 4033000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (408.07 seconds)\n", + "Cbc0010I After 4034000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (408.20 seconds)\n", + "Cbc0010I After 4035000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (408.30 seconds)\n", + "Cbc0010I After 4036000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (408.39 seconds)\n", + "Cbc0010I After 4037000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (408.50 seconds)\n", + "Cbc0010I After 4038000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (408.66 seconds)\n", + "Cbc0010I After 4039000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (408.78 seconds)\n", + "Cbc0010I After 4040000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (408.88 seconds)\n", + "Cbc0010I After 4041000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (408.98 seconds)\n", + "Cbc0010I After 4042000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (409.07 seconds)\n", + "Cbc0010I After 4043000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (409.16 seconds)\n", + "Cbc0010I After 4044000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (409.24 seconds)\n", + "Cbc0010I After 4045000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (409.33 seconds)\n", + "Cbc0010I After 4046000 nodesodes, 440 on tree, 1e+50 best solution, best possible 0 (165.80 seconds)\n", + "Cbc0010I After 1012000 nodes, 410 on tree, 1e+50 best solution, best possible 0 (166.05 seconds)\n", + "Cbc0010I After 1013000 nodes, 383 on tree, 1e+50 best solution, best possible 0 (166.27 seconds)\n", + "Cbc0010I After 1014000 nodes, 356 on tree, 1e+50 best solution, best possible 0 (166.46 seconds)\n", + "Cbc0010I After 1015000 nodes, 329 on tree, 1e+50 best solution, best possible 0 (166.61 seconds)\n", + "Cbc0010I After 1016000 nodes, 436 on tree, 1e+50 best solution, best possible 0 (166.73 seconds)\n", + "Cbc0010I After 1017000 nodes, 388 on tree, 1e+50 best solution, best possible 0 (166.89 seconds)\n", + "Cbc0010I After 1018000 nodes, 372 on tree, 1e+50 best solution, best possible 0 (167.04 seconds)\n", + "Cbc0010I After 1019000 nodes, 322 on tree, 1e+50 best solution, best possible 0 (167.19 seconds)\n", + "Cbc0010I After 1020000 nodes, 295 on tree, 1e+50 best solution, best possible 0 (167.34 seconds)\n", + "Cbc0010I After 1021000 nodes, 269 on tree, 1e+50 best solution, best possible 0 (167.46 seconds)\n", + "Cbc0010I After 1022000 nodes, 249 on tree, 1e+50 best solution, best possible 0 (167.65 seconds)\n", + "Cbc0010I After 1023000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (167.76 seconds)\n", + "Cbc0010I After 1024000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (167.87 seconds)\n", + "Cbc0010I After 1025000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (167.99 seconds)\n", + "Cbc0010I After 1026000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (168.12 seconds)\n", + "Cbc0010I After 1027000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (168.23 seconds)\n", + "Cbc0010I After 1028000 nodes, 379 on tree, 1e+50 best solution, best possible 0 (168.34 seconds)\n", + "Cbc0010I After 1029000 nodes, 368 on tree, 1e+50 best solution, best possible 0 (168.44 seconds)\n", + "Cbc0010I After 1030000 nodes, 325 on tree, 1e+50 best solution, best possible 0 (168.54 seconds)\n", + "Cbc0010I After 1031000 nodes, 299 on tree, 1e+50 best solution, best possible 0 (168.64 seconds)\n", + "Cbc0010I After 1032000 nodes, 283 on tree, 1e+50 best solution, best possible 0 (168.73 seconds)\n", + "Cbc0010I After 1033000 nodes, 267 on tree, 1e+50 best solution, best possible 0 (168.82 seconds)\n", + "Cbc0010I After 1034000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (168.92 seconds)\n", + "Cbc0010I After 1035000 nodes, 252 on tree, 1e+50 best solution, best possible 0 (169.04 seconds)\n", + "Cbc0010I After 1036000 nodes, 235 on tree, 1e+50 best solution, best possible 0 (169.12 seconds)\n", + "Cbc0010I After 1037000 nodes, 251 on tree, 1e+50 best solution, best possible 0 (169.23 seconds)\n", + "Cbc0010I After 1038000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (169.36 seconds)\n", + "Cbc0010I After 1039000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (169.48 seconds)\n", + "Cbc0010I After 1040000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (169.64 seconds)\n", + "Cbc0010I After 1041000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (169.74 seconds)\n", + "Cbc0010I After 1042000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (169.82 seconds)\n", + "Cbc0010I After 1043000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (169.93 seconds)\n", + "Cbc0010I After 1044000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (170.04 seconds)\n", + "Cbc0010I After 1045000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (170.13 seconds)\n", + "Cbc0010I After 1046000 nodes, 270 on tree, 1e+50 best solution, best possible 0 (170.22 seconds)\n", + "Cbc0010I After 1047000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (170.31 seconds)\n", + "Cbc0010I After 1048000 nodes, 257 on tree, 1e+50 best solution, best possible 0 (170.39 seconds)\n", + "Cbc0010I After 1049000 nodes, 238 on tree, 1e+50 best solution, best possible 0 (170.46 seconds)\n", + "Cbc0010I After 1050000 nodes, 229 on tree, 1e+50 best solution, best possible 0 (170.56 seconds)\n", + "Cbc0010I After 1051000 nodes, 220 on tree, 1e+50 best solution, best possible 0 (170.66 seconds)\n", + "Cbc0010I After 1052000 nodes, 226 on tree, 1e+50 best solution, best possible 0 (170.74 seconds)\n", + "Cbc0010I After 1053000 nodes, 212 on tree, 1e+, 116 on tree, 1e+50 best solution, best possible 0 (409.43 seconds)\n", + "Cbc0010I After 4047000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (409.53 seconds)\n", + "Cbc0010I After 4048000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (409.63 seconds)\n", + "Cbc0010I After 4049000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (409.74 seconds)\n", + "Cbc0010I After 4050000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (409.84 seconds)\n", + "Cbc0010I After 4051000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (409.97 seconds)\n", + "Cbc0010I After 4052000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (410.10 seconds)\n", + "Cbc0010I After 4053000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (410.22 seconds)\n", + "Cbc0010I After 4054000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (410.32 seconds)\n", + "Cbc0010I After 4055000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (410.42 seconds)\n", + "Cbc0010I After 4056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (410.54 seconds)\n", + "Cbc0010I After 4057000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (410.63 seconds)\n", + "Cbc0010I After 4058000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (410.72 seconds)\n", + "Cbc0010I After 4059000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (410.83 seconds)\n", + "Cbc0010I After 4060000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (410.93 seconds)\n", + "Cbc0010I After 4061000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (411.02 seconds)\n", + "Cbc0010I After 4062000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (411.13 seconds)\n", + "Cbc0010I After 4063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (411.24 seconds)\n", + "Cbc0010I After 4064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (411.33 seconds)\n", + "Cbc0010I After 4065000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (411.41 seconds)\n", + "Cbc0010I After 4066000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (411.50 seconds)\n", + "Cbc0010I After 4067000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (411.58 seconds)\n", + "Cbc0010I After 4068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (411.68 seconds)\n", + "Cbc0010I After 4069000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (411.85 seconds)\n", + "Cbc0010I After 4070000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (411.99 seconds)\n", + "Cbc0010I After 4071000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (412.11 seconds)\n", + "Cbc0010I After 4072000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (412.23 seconds)\n", + "Cbc0010I After 4073000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (412.35 seconds)\n", + "Cbc0010I After 4074000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (412.43 seconds)\n", + "Cbc0010I After 4075000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (412.54 seconds)\n", + "Cbc0010I After 4076000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (412.64 seconds)\n", + "Cbc0010I After 4077000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (412.72 seconds)\n", + "Cbc0010I After 4078000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (412.81 seconds)\n", + "Cbc0010I After 4079000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (412.94 seconds)\n", + "Cbc0010I After 4080000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (413.02 seconds)\n", + "Cbc0010I After 4081000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (413.11 seconds)\n", + "Cbc0010I After 4082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (413.18 seconds)\n", + "Cbc0010I After 4083000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (413.27 seconds)\n", + "Cbc0010I After 4084000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (413.36 seconds)\n", + "Cbc0010I After 4085000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (413.43 seconds)\n", + "Cbc0010I After 4086000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (413.47 seconds)\n", + "Cbc0010I After 4087000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (413.53 seconds)\n", + "Cbc0010I After 4088000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (41350 best solution, best possible 0 (170.81 seconds)\n", + "Cbc0010I After 1054000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (170.89 seconds)\n", + "Cbc0010I After 1055000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (170.97 seconds)\n", + "Cbc0010I After 1056000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (171.06 seconds)\n", + "Cbc0010I After 1057000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (171.13 seconds)\n", + "Cbc0010I After 1058000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (171.24 seconds)\n", + "Cbc0010I After 1059000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (171.34 seconds)\n", + "Cbc0010I After 1060000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (171.45 seconds)\n", + "Cbc0010I After 1061000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (171.57 seconds)\n", + "Cbc0010I After 1062000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (171.65 seconds)\n", + "Cbc0010I After 1063000 nodes, 290 on tree, 1e+50 best solution, best possible 0 (171.77 seconds)\n", + "Cbc0010I After 1064000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (171.90 seconds)\n", + "Cbc0010I After 1065000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (172.03 seconds)\n", + "Cbc0010I After 1066000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (172.15 seconds)\n", + "Cbc0010I After 1067000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (172.27 seconds)\n", + "Cbc0010I After 1068000 nodes, 271 on tree, 1e+50 best solution, best possible 0 (172.41 seconds)\n", + "Cbc0010I After 1069000 nodes, 223 on tree, 1e+50 best solution, best possible 0 (172.50 seconds)\n", + "Cbc0010I After 1070000 nodes, 196 on tree, 1e+50 best solution, best possible 0 (172.62 seconds)\n", + "Cbc0010I After 1071000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (172.73 seconds)\n", + "Cbc0010I After 1072000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (172.84 seconds)\n", + "Cbc0010I After 1073000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (172.94 seconds)\n", + "Cbc0010I After 1074000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (173.04 seconds)\n", + "Cbc0010I After 1075000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (173.15 seconds)\n", + "Cbc0010I After 1076000 nodes, 264 on tree, 1e+50 best solution, best possible 0 (173.27 seconds)\n", + "Cbc0010I After 1077000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (173.41 seconds)\n", + "Cbc0010I After 1078000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (173.58 seconds)\n", + "Cbc0010I After 1079000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (173.71 seconds)\n", + "Cbc0010I After 1080000 nodes, 292 on tree, 1e+50 best solution, best possible 0 (173.84 seconds)\n", + "Cbc0010I After 1081000 nodes, 250 on tree, 1e+50 best solution, best possible 0 (173.98 seconds)\n", + "Cbc0010I After 1082000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (174.21 seconds)\n", + "Cbc0010I After 1083000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (174.40 seconds)\n", + "Cbc0010I After 1084000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (174.58 seconds)\n", + "Cbc0010I After 1085000 nodes, 264 on tree, 1e+50 best solution, best possible 0 (174.78 seconds)\n", + "Cbc0010I After 1086000 nodes, 224 on tree, 1e+50 best solution, best possible 0 (174.98 seconds)\n", + "Cbc0010I After 1087000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (175.17 seconds)\n", + "Cbc0010I After 1088000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (175.33 seconds)\n", + "Cbc0010I After 1089000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (175.46 seconds)\n", + "Cbc0010I After 1090000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (175.60 seconds)\n", + "Cbc0010I After 1091000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (175.71 seconds)\n", + "Cbc0010I After 1092000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (175.82 seconds)\n", + "Cbc0010I After 1093000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (175.93 seconds)\n", + "Cbc0010I After 1094000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (176.03 seconds)\n", + "Cbc0010I After 1095000 nodes, 189 on tree, 1e+50 best solution, best.61 seconds)\n", + "Cbc0010I After 4089000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (413.67 seconds)\n", + "Cbc0010I After 4090000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (413.74 seconds)\n", + "Cbc0010I After 4091000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (413.86 seconds)\n", + "Cbc0010I After 4092000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (413.97 seconds)\n", + "Cbc0010I After 4093000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (414.05 seconds)\n", + "Cbc0010I After 4094000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (414.12 seconds)\n", + "Cbc0010I After 4095000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (414.24 seconds)\n", + "Cbc0010I After 4096000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (414.38 seconds)\n", + "Cbc0010I After 4097000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (414.47 seconds)\n", + "Cbc0010I After 4098000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (414.72 seconds)\n", + "Cbc0010I After 4099000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (414.82 seconds)\n", + "Cbc0010I After 4100000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (414.97 seconds)\n", + "Cbc0010I After 4101000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (415.13 seconds)\n", + "Cbc0010I After 4102000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (415.34 seconds)\n", + "Cbc0010I After 4103000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (415.49 seconds)\n", + "Cbc0010I After 4104000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (415.66 seconds)\n", + "Cbc0010I After 4105000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (415.80 seconds)\n", + "Cbc0010I After 4106000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (415.94 seconds)\n", + "Cbc0010I After 4107000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (416.01 seconds)\n", + "Cbc0010I After 4108000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (416.14 seconds)\n", + "Cbc0010I After 4109000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (416.24 seconds)\n", + "Cbc0010I After 4110000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (416.33 seconds)\n", + "Cbc0010I After 4111000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (416.46 seconds)\n", + "Cbc0010I After 4112000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (416.60 seconds)\n", + "Cbc0010I After 4113000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (416.75 seconds)\n", + "Cbc0010I After 4114000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (416.89 seconds)\n", + "Cbc0010I After 4115000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (417.03 seconds)\n", + "Cbc0010I After 4116000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (417.19 seconds)\n", + "Cbc0010I After 4117000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (417.33 seconds)\n", + "Cbc0010I After 4118000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (417.47 seconds)\n", + "Cbc0010I After 4119000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (417.59 seconds)\n", + "Cbc0010I After 4120000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (417.71 seconds)\n", + "Cbc0010I After 4121000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (417.82 seconds)\n", + "Cbc0010I After 4122000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (417.92 seconds)\n", + "Cbc0010I After 4123000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (418.05 seconds)\n", + "Cbc0010I After 4124000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (418.22 seconds)\n", + "Cbc0010I After 4125000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (418.37 seconds)\n", + "Cbc0010I After 4126000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (418.51 seconds)\n", + "Cbc0010I After 4127000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (418.66 seconds)\n", + "Cbc0010I After 4128000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (418.70 seconds)\n", + "Cbc0010I After 4129000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (418.79 seconds)\n", + "Cbc0010I After 4130000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (418.89 seconds)\n", + "Cbc0010I After 4131000 nodes, 82 on tree, possible 0 (176.15 seconds)\n", + "Cbc0010I After 1096000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (176.27 seconds)\n", + "Cbc0010I After 1097000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (176.38 seconds)\n", + "Cbc0010I After 1098000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (176.51 seconds)\n", + "Cbc0010I After 1099000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (176.64 seconds)\n", + "Cbc0010I After 1100000 nodes, 352 on tree, 1e+50 best solution, best possible 0 (176.78 seconds)\n", + "Cbc0010I After 1101000 nodes, 316 on tree, 1e+50 best solution, best possible 0 (176.92 seconds)\n", + "Cbc0010I After 1102000 nodes, 318 on tree, 1e+50 best solution, best possible 0 (177.03 seconds)\n", + "Cbc0010I After 1103000 nodes, 299 on tree, 1e+50 best solution, best possible 0 (177.15 seconds)\n", + "Cbc0010I After 1104000 nodes, 271 on tree, 1e+50 best solution, best possible 0 (177.25 seconds)\n", + "Cbc0010I After 1105000 nodes, 257 on tree, 1e+50 best solution, best possible 0 (177.35 seconds)\n", + "Cbc0010I After 1106000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (177.45 seconds)\n", + "Cbc0010I After 1107000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (177.56 seconds)\n", + "Cbc0010I After 1108000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (177.68 seconds)\n", + "Cbc0010I After 1109000 nodes, 219 on tree, 1e+50 best solution, best possible 0 (177.90 seconds)\n", + "Cbc0010I After 1110000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (178.02 seconds)\n", + "Cbc0010I After 1111000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (178.18 seconds)\n", + "Cbc0010I After 1112000 nodes, 207 on tree, 1e+50 best solution, best possible 0 (178.28 seconds)\n", + "Cbc0010I After 1113000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (178.41 seconds)\n", + "Cbc0010I After 1114000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (178.51 seconds)\n", + "Cbc0010I After 1115000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (178.61 seconds)\n", + "Cbc0010I After 1116000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (178.73 seconds)\n", + "Cbc0010I After 1117000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (178.88 seconds)\n", + "Cbc0010I After 1118000 nodes, 322 on tree, 1e+50 best solution, best possible 0 (179.00 seconds)\n", + "Cbc0010I After 1119000 nodes, 311 on tree, 1e+50 best solution, best possible 0 (179.12 seconds)\n", + "Cbc0010I After 1120000 nodes, 293 on tree, 1e+50 best solution, best possible 0 (179.21 seconds)\n", + "Cbc0010I After 1121000 nodes, 291 on tree, 1e+50 best solution, best possible 0 (179.28 seconds)\n", + "Cbc0010I After 1122000 nodes, 260 on tree, 1e+50 best solution, best possible 0 (179.40 seconds)\n", + "Cbc0010I After 1123000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (179.50 seconds)\n", + "Cbc0010I After 1124000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (179.63 seconds)\n", + "Cbc0010I After 1125000 nodes, 250 on tree, 1e+50 best solution, best possible 0 (179.79 seconds)\n", + "Cbc0010I After 1126000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (179.92 seconds)\n", + "Cbc0010I After 1127000 nodes, 232 on tree, 1e+50 best solution, best possible 0 (180.04 seconds)\n", + "Cbc0010I After 1128000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (180.22 seconds)\n", + "Cbc0010I After 1129000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (180.42 seconds)\n", + "Cbc0010I After 1130000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (180.63 seconds)\n", + "Cbc0010I After 1131000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (180.82 seconds)\n", + "Cbc0010I After 1132000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (181.07 seconds)\n", + "Cbc0010I After 1133000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (181.24 seconds)\n", + "Cbc0010I After 1134000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (181.38 seconds)\n", + "Cbc0010I After 1135000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (181.52 seconds)\n", + "Cbc0010I After 1136000 nodes, 267 on tree, 1e+50 best solution, best possible 0 (181.66 seconds)\n", + "Cbc0010I After 1137000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (181.78 se1e+50 best solution, best possible 0 (418.95 seconds)\n", + "Cbc0010I After 4132000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.09 seconds)\n", + "Cbc0010I After 4133000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.14 seconds)\n", + "Cbc0010I After 4134000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (419.20 seconds)\n", + "Cbc0010I After 4135000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (419.35 seconds)\n", + "Cbc0010I After 4136000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.45 seconds)\n", + "Cbc0010I After 4137000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.52 seconds)\n", + "Cbc0010I After 4138000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (419.57 seconds)\n", + "Cbc0010I After 4139000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (419.63 seconds)\n", + "Cbc0010I After 4140000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.72 seconds)\n", + "Cbc0010I After 4141000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (419.77 seconds)\n", + "Cbc0010I After 4142000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.89 seconds)\n", + "Cbc0010I After 4143000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (419.97 seconds)\n", + "Cbc0010I After 4144000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (420.13 seconds)\n", + "Cbc0010I After 4145000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (420.22 seconds)\n", + "Cbc0010I After 4146000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (420.28 seconds)\n", + "Cbc0010I After 4147000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (420.49 seconds)\n", + "Cbc0010I After 4148000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (420.66 seconds)\n", + "Cbc0010I After 4149000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (420.94 seconds)\n", + "Cbc0010I After 4150000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (421.08 seconds)\n", + "Cbc0010I After 4151000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (421.31 seconds)\n", + "Cbc0010I After 4152000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (421.61 seconds)\n", + "Cbc0010I After 4153000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (421.73 seconds)\n", + "Cbc0010I After 4154000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (421.88 seconds)\n", + "Cbc0010I After 4155000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (422.07 seconds)\n", + "Cbc0010I After 4156000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (422.24 seconds)\n", + "Cbc0010I After 4157000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (422.37 seconds)\n", + "Cbc0010I After 4158000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (422.51 seconds)\n", + "Cbc0010I After 4159000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (422.69 seconds)\n", + "Cbc0010I After 4160000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (422.87 seconds)\n", + "Cbc0010I After 4161000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (423.00 seconds)\n", + "Cbc0010I After 4162000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (423.11 seconds)\n", + "Cbc0010I After 4163000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (423.26 seconds)\n", + "Cbc0010I After 4164000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (423.50 seconds)\n", + "Cbc0010I After 4165000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (423.73 seconds)\n", + "Cbc0010I After 4166000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (423.86 seconds)\n", + "Cbc0010I After 4167000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (423.97 seconds)\n", + "Cbc0010I After 4168000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (424.09 seconds)\n", + "Cbc0010I After 4169000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (424.19 seconds)\n", + "Cbc0010I After 4170000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (424.32 seconds)\n", + "Cbc0010I After 4171000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (424.40 seconds)\n", + "Cbc0010I After 4172000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (424.49 seconds)\n", + "Cbc0010I After 4173000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (424.70 seconds)\n", + "Cbc0010conds)\n", + "Cbc0010I After 1138000 nodes, 248 on tree, 1e+50 best solution, best possible 0 (181.91 seconds)\n", + "Cbc0010I After 1139000 nodes, 247 on tree, 1e+50 best solution, best possible 0 (182.00 seconds)\n", + "Cbc0010I After 1140000 nodes, 233 on tree, 1e+50 best solution, best possible 0 (182.12 seconds)\n", + "Cbc0010I After 1141000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (182.22 seconds)\n", + "Cbc0010I After 1142000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (182.35 seconds)\n", + "Cbc0010I After 1143000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (182.44 seconds)\n", + "Cbc0010I After 1144000 nodes, 209 on tree, 1e+50 best solution, best possible 0 (182.53 seconds)\n", + "Cbc0010I After 1145000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (182.61 seconds)\n", + "Cbc0010I After 1146000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (182.68 seconds)\n", + "Cbc0010I After 1147000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (182.78 seconds)\n", + "Cbc0010I After 1148000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (182.97 seconds)\n", + "Cbc0010I After 1149000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (183.12 seconds)\n", + "Cbc0010I After 1150000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (183.25 seconds)\n", + "Cbc0010I After 1151000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (183.40 seconds)\n", + "Cbc0010I After 1152000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (183.55 seconds)\n", + "Cbc0010I After 1153000 nodes, 291 on tree, 1e+50 best solution, best possible 0 (183.73 seconds)\n", + "Cbc0010I After 1154000 nodes, 246 on tree, 1e+50 best solution, best possible 0 (183.94 seconds)\n", + "Cbc0010I After 1155000 nodes, 217 on tree, 1e+50 best solution, best possible 0 (184.17 seconds)\n", + "Cbc0010I After 1156000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (184.36 seconds)\n", + "Cbc0010I After 1157000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (184.54 seconds)\n", + "Cbc0010I After 1158000 nodes, 222 on tree, 1e+50 best solution, best possible 0 (184.77 seconds)\n", + "Cbc0010I After 1159000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (184.92 seconds)\n", + "Cbc0010I After 1160000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (185.10 seconds)\n", + "Cbc0010I After 1161000 nodes, 364 on tree, 1e+50 best solution, best possible 0 (185.28 seconds)\n", + "Cbc0010I After 1162000 nodes, 301 on tree, 1e+50 best solution, best possible 0 (185.48 seconds)\n", + "Cbc0010I After 1163000 nodes, 277 on tree, 1e+50 best solution, best possible 0 (185.65 seconds)\n", + "Cbc0010I After 1164000 nodes, 274 on tree, 1e+50 best solution, best possible 0 (185.83 seconds)\n", + "Cbc0010I After 1165000 nodes, 272 on tree, 1e+50 best solution, best possible 0 (186.00 seconds)\n", + "Cbc0010I After 1166000 nodes, 236 on tree, 1e+50 best solution, best possible 0 (186.13 seconds)\n", + "Cbc0010I After 1167000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (186.24 seconds)\n", + "Cbc0010I After 1168000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (186.37 seconds)\n", + "Cbc0010I After 1169000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (186.51 seconds)\n", + "Cbc0010I After 1170000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (186.64 seconds)\n", + "Cbc0010I After 1171000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (186.74 seconds)\n", + "Cbc0010I After 1172000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (186.82 seconds)\n", + "Cbc0010I After 1173000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (186.90 seconds)\n", + "Cbc0010I After 1174000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (186.99 seconds)\n", + "Cbc0010I After 1175000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (187.08 seconds)\n", + "Cbc0010I After 1176000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (187.15 seconds)\n", + "Cbc0010I After 1177000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (187.24 seconds)\n", + "Cbc0010I After 1178000 nodes, 239 on tree, 1e+50 best solution, best possible 0 (187.38 seconds)\n", + "Cbc0010I After 1179000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (187.49 seconds)\n", + "Cbc0010I After I After 4174000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (424.90 seconds)\n", + "Cbc0010I After 4175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (425.09 seconds)\n", + "Cbc0010I After 4176000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (425.25 seconds)\n", + "Cbc0010I After 4177000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (425.32 seconds)\n", + "Cbc0010I After 4178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (425.39 seconds)\n", + "Cbc0010I After 4179000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (425.48 seconds)\n", + "Cbc0010I After 4180000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (425.56 seconds)\n", + "Cbc0010I After 4181000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (425.70 seconds)\n", + "Cbc0010I After 4182000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (425.77 seconds)\n", + "Cbc0010I After 4183000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (425.85 seconds)\n", + "Cbc0010I After 4184000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (426.04 seconds)\n", + "Cbc0010I After 4185000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (426.23 seconds)\n", + "Cbc0010I After 4186000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (426.40 seconds)\n", + "Cbc0010I After 4187000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (426.47 seconds)\n", + "Cbc0010I After 4188000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (426.54 seconds)\n", + "Cbc0010I After 4189000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (426.64 seconds)\n", + "Cbc0010I After 4190000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (426.72 seconds)\n", + "Cbc0010I After 4191000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (426.80 seconds)\n", + "Cbc0010I After 4192000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (426.90 seconds)\n", + "Cbc0010I After 4193000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (427.03 seconds)\n", + "Cbc0010I After 4194000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (427.15 seconds)\n", + "Cbc0010I After 4195000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (427.22 seconds)\n", + "Cbc0010I After 4196000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (427.29 seconds)\n", + "Cbc0010I After 4197000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (427.38 seconds)\n", + "Cbc0010I After 4198000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (427.45 seconds)\n", + "Cbc0010I After 4199000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (427.53 seconds)\n", + "Cbc0010I After 4200000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (427.64 seconds)\n", + "Cbc0010I After 4201000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (427.72 seconds)\n", + "Cbc0010I After 4202000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (427.83 seconds)\n", + "Cbc0010I After 4203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (427.92 seconds)\n", + "Cbc0010I After 4204000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (428.00 seconds)\n", + "Cbc0010I After 4205000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (428.10 seconds)\n", + "Cbc0010I After 4206000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (428.22 seconds)\n", + "Cbc0010I After 4207000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (428.29 seconds)\n", + "Cbc0010I After 4208000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (428.36 seconds)\n", + "Cbc0010I After 4209000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (428.46 seconds)\n", + "Cbc0010I After 4210000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (428.59 seconds)\n", + "Cbc0010I After 4211000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (428.71 seconds)\n", + "Cbc0010I After 4212000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (428.84 seconds)\n", + "Cbc0010I After 4213000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (428.93 seconds)\n", + "Cbc0010I After 4214000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (429.01 seconds)\n", + "Cbc0010I After 4215000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (429.12 seconds)\n", + "Cbc0010I After 4216000 nodes, 118 on tree, 1e+50 best solutio1180000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (187.59 seconds)\n", + "Cbc0010I After 1181000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (187.72 seconds)\n", + "Cbc0010I After 1182000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (187.83 seconds)\n", + "Cbc0010I After 1183000 nodes, 235 on tree, 1e+50 best solution, best possible 0 (187.95 seconds)\n", + "Cbc0010I After 1184000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (188.09 seconds)\n", + "Cbc0010I After 1185000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (188.22 seconds)\n", + "Cbc0010I After 1186000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (188.36 seconds)\n", + "Cbc0010I After 1187000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (188.47 seconds)\n", + "Cbc0010I After 1188000 nodes, 241 on tree, 1e+50 best solution, best possible 0 (188.58 seconds)\n", + "Cbc0010I After 1189000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (188.71 seconds)\n", + "Cbc0010I After 1190000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (188.82 seconds)\n", + "Cbc0010I After 1191000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (188.93 seconds)\n", + "Cbc0010I After 1192000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (189.05 seconds)\n", + "Cbc0010I After 1193000 nodes, 233 on tree, 1e+50 best solution, best possible 0 (189.17 seconds)\n", + "Cbc0010I After 1194000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (189.28 seconds)\n", + "Cbc0010I After 1195000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (189.38 seconds)\n", + "Cbc0010I After 1196000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (189.47 seconds)\n", + "Cbc0010I After 1197000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (189.57 seconds)\n", + "Cbc0010I After 1198000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (189.67 seconds)\n", + "Cbc0010I After 1199000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (189.80 seconds)\n", + "Cbc0010I After 1200000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (189.92 seconds)\n", + "Cbc0010I After 1201000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (190.07 seconds)\n", + "Cbc0010I After 1202000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (190.21 seconds)\n", + "Cbc0010I After 1203000 nodes, 219 on tree, 1e+50 best solution, best possible 0 (190.36 seconds)\n", + "Cbc0010I After 1204000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (190.58 seconds)\n", + "Cbc0010I After 1205000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (190.86 seconds)\n", + "Cbc0010I After 1206000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (191.06 seconds)\n", + "Cbc0010I After 1207000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (191.27 seconds)\n", + "Cbc0010I After 1208000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (191.52 seconds)\n", + "Cbc0010I After 1209000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (191.77 seconds)\n", + "Cbc0010I After 1210000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (191.99 seconds)\n", + "Cbc0010I After 1211000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (192.19 seconds)\n", + "Cbc0010I After 1212000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (192.35 seconds)\n", + "Cbc0010I After 1213000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (192.57 seconds)\n", + "Cbc0010I After 1214000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (192.71 seconds)\n", + "Cbc0010I After 1215000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (192.83 seconds)\n", + "Cbc0010I After 1216000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (192.96 seconds)\n", + "Cbc0010I After 1217000 nodes, 249 on tree, 1e+50 best solution, best possible 0 (193.12 seconds)\n", + "Cbc0010I After 1218000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (193.28 seconds)\n", + "Cbc0010I After 1219000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (193.44 seconds)\n", + "Cbc0010I After 1220000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (193.63 seconds)\n", + "Cbc0010I After 1221000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (193.78 seconds)\n", + "Cbc0010I After 1222000 nodes, 235 on n, best possible 0 (429.22 seconds)\n", + "Cbc0010I After 4217000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.33 seconds)\n", + "Cbc0010I After 4218000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (429.42 seconds)\n", + "Cbc0010I After 4219000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (429.52 seconds)\n", + "Cbc0010I After 4220000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (429.61 seconds)\n", + "Cbc0010I After 4221000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (429.72 seconds)\n", + "Cbc0010I After 4222000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (429.79 seconds)\n", + "Cbc0010I After 4223000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.87 seconds)\n", + "Cbc0010I After 4224000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.96 seconds)\n", + "Cbc0010I After 4225000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (430.05 seconds)\n", + "Cbc0010I After 4226000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (430.14 seconds)\n", + "Cbc0010I After 4227000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (430.24 seconds)\n", + "Cbc0010I After 4228000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (430.35 seconds)\n", + "Cbc0010I After 4229000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (430.43 seconds)\n", + "Cbc0010I After 4230000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (430.57 seconds)\n", + "Cbc0010I After 4231000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (430.67 seconds)\n", + "Cbc0010I After 4232000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (430.80 seconds)\n", + "Cbc0010I After 4233000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (430.95 seconds)\n", + "Cbc0010I After 4234000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (431.23 seconds)\n", + "Cbc0010I After 4235000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (431.38 seconds)\n", + "Cbc0010I After 4236000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (431.55 seconds)\n", + "Cbc0010I After 4237000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (431.73 seconds)\n", + "Cbc0010I After 4238000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (431.92 seconds)\n", + "Cbc0010I After 4239000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (432.04 seconds)\n", + "Cbc0010I After 4240000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (432.18 seconds)\n", + "Cbc0010I After 4241000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (432.36 seconds)\n", + "Cbc0010I After 4242000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (432.60 seconds)\n", + "Cbc0010I After 4243000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (432.77 seconds)\n", + "Cbc0010I After 4244000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (432.91 seconds)\n", + "Cbc0010I After 4245000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (433.09 seconds)\n", + "Cbc0010I After 4246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (433.21 seconds)\n", + "Cbc0010I After 4247000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (433.29 seconds)\n", + "Cbc0010I After 4248000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.40 seconds)\n", + "Cbc0010I After 4249000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (433.54 seconds)\n", + "Cbc0010I After 4250000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.69 seconds)\n", + "Cbc0010I After 4251000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.81 seconds)\n", + "Cbc0010I After 4252000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (433.94 seconds)\n", + "Cbc0010I After 4253000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (434.12 seconds)\n", + "Cbc0010I After 4254000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (434.24 seconds)\n", + "Cbc0010I After 4255000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (434.34 seconds)\n", + "Cbc0010I After 4256000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (434.43 seconds)\n", + "Cbc0010I After 4257000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (434.52 seconds)\n", + "Cbc0010I After 4258000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (434.64 seconds)\n", + "Cbc0010I Aftertree, 1e+50 best solution, best possible 0 (193.92 seconds)\n", + "Cbc0010I After 1223000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (194.10 seconds)\n", + "Cbc0010I After 1224000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (194.27 seconds)\n", + "Cbc0010I After 1225000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (194.42 seconds)\n", + "Cbc0010I After 1226000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (194.59 seconds)\n", + "Cbc0010I After 1227000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (194.73 seconds)\n", + "Cbc0010I After 1228000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (195.01 seconds)\n", + "Cbc0010I After 1229000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (195.32 seconds)\n", + "Cbc0010I After 1230000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (195.50 seconds)\n", + "Cbc0010I After 1231000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (195.67 seconds)\n", + "Cbc0010I After 1232000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (195.78 seconds)\n", + "Cbc0010I After 1233000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (195.89 seconds)\n", + "Cbc0010I After 1234000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (196.03 seconds)\n", + "Cbc0010I After 1235000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (196.16 seconds)\n", + "Cbc0010I After 1236000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (196.30 seconds)\n", + "Cbc0010I After 1237000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (196.46 seconds)\n", + "Cbc0010I After 1238000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (196.59 seconds)\n", + "Cbc0010I After 1239000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (196.71 seconds)\n", + "Cbc0010I After 1240000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (196.82 seconds)\n", + "Cbc0010I After 1241000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (196.96 seconds)\n", + "Cbc0010I After 1242000 nodes, 206 on tree, 1e+50 best solution, best possible 0 (197.08 seconds)\n", + "Cbc0010I After 1243000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (197.20 seconds)\n", + "Cbc0010I After 1244000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (197.33 seconds)\n", + "Cbc0010I After 1245000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (197.44 seconds)\n", + "Cbc0010I After 1246000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (197.56 seconds)\n", + "Cbc0010I After 1247000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (197.68 seconds)\n", + "Cbc0010I After 1248000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (197.80 seconds)\n", + "Cbc0010I After 1249000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (197.91 seconds)\n", + "Cbc0010I After 1250000 nodes, 263 on tree, 1e+50 best solution, best possible 0 (198.01 seconds)\n", + "Cbc0010I After 1251000 nodes, 232 on tree, 1e+50 best solution, best possible 0 (198.14 seconds)\n", + "Cbc0010I After 1252000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (198.28 seconds)\n", + "Cbc0010I After 1253000 nodes, 228 on tree, 1e+50 best solution, best possible 0 (198.36 seconds)\n", + "Cbc0010I After 1254000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (198.43 seconds)\n", + "Cbc0010I After 1255000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (198.52 seconds)\n", + "Cbc0010I After 1256000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (198.63 seconds)\n", + "Cbc0010I After 1257000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (198.75 seconds)\n", + "Cbc0010I After 1258000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (198.80 seconds)\n", + "Cbc0010I After 1259000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (198.88 seconds)\n", + "Cbc0010I After 1260000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (199.00 seconds)\n", + "Cbc0010I After 1261000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (199.08 seconds)\n", + "Cbc0010I After 1262000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (199.21 seconds)\n", + "Cbc0010I After 1263000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (199.29 seconds)\n", + "Cbc0010I After 1264000 nodes, 91 on tree, 1e+50 best solution, bes 4259000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (434.79 seconds)\n", + "Cbc0010I After 4260000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (434.91 seconds)\n", + "Cbc0010I After 4261000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (435.07 seconds)\n", + "Cbc0010I After 4262000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (435.20 seconds)\n", + "Cbc0010I After 4263000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (435.41 seconds)\n", + "Cbc0010I After 4264000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (435.74 seconds)\n", + "Cbc0010I After 4265000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (435.93 seconds)\n", + "Cbc0010I After 4266000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (436.06 seconds)\n", + "Cbc0010I After 4267000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (436.15 seconds)\n", + "Cbc0010I After 4268000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (436.26 seconds)\n", + "Cbc0010I After 4269000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (436.36 seconds)\n", + "Cbc0010I After 4270000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (436.47 seconds)\n", + "Cbc0010I After 4271000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (436.57 seconds)\n", + "Cbc0010I After 4272000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (436.68 seconds)\n", + "Cbc0010I After 4273000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (436.78 seconds)\n", + "Cbc0010I After 4274000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (436.93 seconds)\n", + "Cbc0010I After 4275000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (437.08 seconds)\n", + "Cbc0010I After 4276000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (437.20 seconds)\n", + "Cbc0010I After 4277000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (437.28 seconds)\n", + "Cbc0010I After 4278000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (437.41 seconds)\n", + "Cbc0010I After 4279000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (437.54 seconds)\n", + "Cbc0010I After 4280000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (437.68 seconds)\n", + "Cbc0010I After 4281000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (437.82 seconds)\n", + "Cbc0010I After 4282000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (437.95 seconds)\n", + "Cbc0010I After 4283000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (438.03 seconds)\n", + "Cbc0010I After 4284000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (438.15 seconds)\n", + "Cbc0010I After 4285000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (438.29 seconds)\n", + "Cbc0010I After 4286000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (438.43 seconds)\n", + "Cbc0010I After 4287000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (438.58 seconds)\n", + "Cbc0010I After 4288000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (438.76 seconds)\n", + "Cbc0010I After 4289000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (438.87 seconds)\n", + "Cbc0010I After 4290000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (438.97 seconds)\n", + "Cbc0010I After 4291000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (439.10 seconds)\n", + "Cbc0010I After 4292000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (439.24 seconds)\n", + "Cbc0010I After 4293000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (439.36 seconds)\n", + "Cbc0010I After 4294000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (439.48 seconds)\n", + "Cbc0010I After 4295000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (439.61 seconds)\n", + "Cbc0010I After 4296000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (439.73 seconds)\n", + "Cbc0010I After 4297000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (439.83 seconds)\n", + "Cbc0010I After 4298000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (439.97 seconds)\n", + "Cbc0010I After 4299000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (440.13 seconds)\n", + "Cbc0010I After 4300000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (440.27 seconds)\n", + "Cbc0010I After 4301000 nodes, 104 on tree, 1e+50 best sot possible 0 (199.39 seconds)\n", + "Cbc0010I After 1265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (199.47 seconds)\n", + "Cbc0010I After 1266000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (199.62 seconds)\n", + "Cbc0010I After 1267000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (199.75 seconds)\n", + "Cbc0010I After 1268000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (199.85 seconds)\n", + "Cbc0010I After 1269000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (200.13 seconds)\n", + "Cbc0010I After 1270000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (200.30 seconds)\n", + "Cbc0010I After 1271000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (200.44 seconds)\n", + "Cbc0010I After 1272000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (200.61 seconds)\n", + "Cbc0010I After 1273000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (200.74 seconds)\n", + "Cbc0010I After 1274000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (200.86 seconds)\n", + "Cbc0010I After 1275000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (200.96 seconds)\n", + "Cbc0010I After 1276000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (201.04 seconds)\n", + "Cbc0010I After 1277000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (201.12 seconds)\n", + "Cbc0010I After 1278000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (201.20 seconds)\n", + "Cbc0010I After 1279000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (201.27 seconds)\n", + "Cbc0010I After 1280000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (201.34 seconds)\n", + "Cbc0010I After 1281000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (201.46 seconds)\n", + "Cbc0010I After 1282000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (201.54 seconds)\n", + "Cbc0010I After 1283000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (201.62 seconds)\n", + "Cbc0010I After 1284000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (201.72 seconds)\n", + "Cbc0010I After 1285000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (201.79 seconds)\n", + "Cbc0010I After 1286000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (201.86 seconds)\n", + "Cbc0010I After 1287000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (201.93 seconds)\n", + "Cbc0010I After 1288000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (202.00 seconds)\n", + "Cbc0010I After 1289000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (202.10 seconds)\n", + "Cbc0010I After 1290000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (202.22 seconds)\n", + "Cbc0010I After 1291000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (202.31 seconds)\n", + "Cbc0010I After 1292000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (202.43 seconds)\n", + "Cbc0010I After 1293000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (202.55 seconds)\n", + "Cbc0010I After 1294000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (202.66 seconds)\n", + "Cbc0010I After 1295000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (202.77 seconds)\n", + "Cbc0010I After 1296000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (202.91 seconds)\n", + "Cbc0010I After 1297000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (203.02 seconds)\n", + "Cbc0010I After 1298000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (203.14 seconds)\n", + "Cbc0010I After 1299000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (203.23 seconds)\n", + "Cbc0010I After 1300000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (203.33 seconds)\n", + "Cbc0010I After 1301000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (203.44 seconds)\n", + "Cbc0010I After 1302000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (203.60 seconds)\n", + "Cbc0010I After 1303000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (203.79 seconds)\n", + "Cbc0010I After 1304000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (204.01 seconds)\n", + "Cbc0010I After 1305000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (204.19 seconds)\n", + "Cbc0010I After 1306000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (204.37 seconds)\n", + "Cbc0010I After 130lution, best possible 0 (440.65 seconds)\n", + "Cbc0010I After 4302000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (440.89 seconds)\n", + "Cbc0010I After 4303000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (441.12 seconds)\n", + "Cbc0010I After 4304000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (441.25 seconds)\n", + "Cbc0010I After 4305000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (441.36 seconds)\n", + "Cbc0010I After 4306000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (441.48 seconds)\n", + "Cbc0010I After 4307000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (441.60 seconds)\n", + "Cbc0010I After 4308000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (441.68 seconds)\n", + "Cbc0010I After 4309000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (441.79 seconds)\n", + "Cbc0010I After 4310000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (441.95 seconds)\n", + "Cbc0010I After 4311000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (442.06 seconds)\n", + "Cbc0010I After 4312000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.14 seconds)\n", + "Cbc0010I After 4313000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (442.20 seconds)\n", + "Cbc0010I After 4314000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.28 seconds)\n", + "Cbc0010I After 4315000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (442.40 seconds)\n", + "Cbc0010I After 4316000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (442.49 seconds)\n", + "Cbc0010I After 4317000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (442.61 seconds)\n", + "Cbc0010I After 4318000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.73 seconds)\n", + "Cbc0010I After 4319000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (442.82 seconds)\n", + "Cbc0010I After 4320000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (442.97 seconds)\n", + "Cbc0010I After 4321000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (443.09 seconds)\n", + "Cbc0010I After 4322000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (443.21 seconds)\n", + "Cbc0010I After 4323000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (443.36 seconds)\n", + "Cbc0010I After 4324000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (443.48 seconds)\n", + "Cbc0010I After 4325000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (443.60 seconds)\n", + "Cbc0010I After 4326000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (443.70 seconds)\n", + "Cbc0010I After 4327000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (443.81 seconds)\n", + "Cbc0010I After 4328000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (443.87 seconds)\n", + "Cbc0010I After 4329000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (443.96 seconds)\n", + "Cbc0010I After 4330000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (444.15 seconds)\n", + "Cbc0010I After 4331000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (444.35 seconds)\n", + "Cbc0010I After 4332000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (444.55 seconds)\n", + "Cbc0010I After 4333000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (444.73 seconds)\n", + "Cbc0010I After 4334000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (444.92 seconds)\n", + "Cbc0010I After 4335000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (445.12 seconds)\n", + "Cbc0010I After 4336000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (445.26 seconds)\n", + "Cbc0010I After 4337000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (445.38 seconds)\n", + "Cbc0010I After 4338000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (445.68 seconds)\n", + "Cbc0010I After 4339000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (445.88 seconds)\n", + "Cbc0010I After 4340000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (446.05 seconds)\n", + "Cbc0010I After 4341000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (446.19 seconds)\n", + "Cbc0010I After 4342000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (446.34 seconds)\n", + "Cbc0010I After 4343000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (446.53 seconds)\n", + "Cbc0017000 nodes, 218 on tree, 1e+50 best solution, best possible 0 (204.51 seconds)\n", + "Cbc0010I After 1308000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (204.63 seconds)\n", + "Cbc0010I After 1309000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (204.83 seconds)\n", + "Cbc0010I After 1310000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (205.02 seconds)\n", + "Cbc0010I After 1311000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (205.23 seconds)\n", + "Cbc0010I After 1312000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (205.38 seconds)\n", + "Cbc0010I After 1313000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (205.50 seconds)\n", + "Cbc0010I After 1314000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (205.63 seconds)\n", + "Cbc0010I After 1315000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (205.78 seconds)\n", + "Cbc0010I After 1316000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (205.94 seconds)\n", + "Cbc0010I After 1317000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (206.18 seconds)\n", + "Cbc0010I After 1318000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (206.34 seconds)\n", + "Cbc0010I After 1319000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (206.58 seconds)\n", + "Cbc0010I After 1320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (206.77 seconds)\n", + "Cbc0010I After 1321000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (206.94 seconds)\n", + "Cbc0010I After 1322000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (207.15 seconds)\n", + "Cbc0010I After 1323000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (207.37 seconds)\n", + "Cbc0010I After 1324000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (207.67 seconds)\n", + "Cbc0010I After 1325000 nodes, 241 on tree, 1e+50 best solution, best possible 0 (207.85 seconds)\n", + "Cbc0010I After 1326000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (208.08 seconds)\n", + "Cbc0010I After 1327000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (208.43 seconds)\n", + "Cbc0010I After 1328000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (208.66 seconds)\n", + "Cbc0010I After 1329000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (208.79 seconds)\n", + "Cbc0010I After 1330000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (208.91 seconds)\n", + "Cbc0010I After 1331000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (209.08 seconds)\n", + "Cbc0010I After 1332000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (209.20 seconds)\n", + "Cbc0010I After 1333000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (209.37 seconds)\n", + "Cbc0010I After 1334000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (209.50 seconds)\n", + "Cbc0010I After 1335000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (209.63 seconds)\n", + "Cbc0010I After 1336000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (209.72 seconds)\n", + "Cbc0010I After 1337000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (209.86 seconds)\n", + "Cbc0010I After 1338000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (209.98 seconds)\n", + "Cbc0010I After 1339000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (210.08 seconds)\n", + "Cbc0010I After 1340000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (210.17 seconds)\n", + "Cbc0010I After 1341000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (210.27 seconds)\n", + "Cbc0010I After 1342000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (210.34 seconds)\n", + "Cbc0010I After 1343000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (210.43 seconds)\n", + "Cbc0010I After 1344000 nodes, 15 on tree, 1e+50 best solution, best possible 0 (210.52 seconds)\n", + "Cbc0010I After 1345000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (210.63 seconds)\n", + "Cbc0010I After 1346000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (210.75 seconds)\n", + "Cbc0010I After 1347000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (210.86 seconds)\n", + "Cbc0010I After 1348000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (210.96 seconds)\n", + "Cbc0010I After 1349000 nodes, 111 on tree, 1e+50 best so0I After 4344000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (446.78 seconds)\n", + "Cbc0010I After 4345000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (446.92 seconds)\n", + "Cbc0010I After 4346000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (447.03 seconds)\n", + "Cbc0010I After 4347000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (447.17 seconds)\n", + "Cbc0010I After 4348000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (447.30 seconds)\n", + "Cbc0010I After 4349000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (447.53 seconds)\n", + "Cbc0010I After 4350000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (447.73 seconds)\n", + "Cbc0010I After 4351000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (447.95 seconds)\n", + "Cbc0010I After 4352000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (448.12 seconds)\n", + "Cbc0010I After 4353000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (448.33 seconds)\n", + "Cbc0010I After 4354000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (448.61 seconds)\n", + "Cbc0010I After 4355000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (449.08 seconds)\n", + "Cbc0010I After 4356000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (449.25 seconds)\n", + "Cbc0010I After 4357000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (449.44 seconds)\n", + "Cbc0010I After 4358000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.65 seconds)\n", + "Cbc0010I After 4359000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.80 seconds)\n", + "Cbc0010I After 4360000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.96 seconds)\n", + "Cbc0010I After 4361000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (450.15 seconds)\n", + "Cbc0010I After 4362000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (450.25 seconds)\n", + "Cbc0010I After 4363000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (450.38 seconds)\n", + "Cbc0010I After 4364000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (450.52 seconds)\n", + "Cbc0010I After 4365000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (450.64 seconds)\n", + "Cbc0010I After 4366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (450.76 seconds)\n", + "Cbc0010I After 4367000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (450.89 seconds)\n", + "Cbc0010I After 4368000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (451.05 seconds)\n", + "Cbc0010I After 4369000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (451.24 seconds)\n", + "Cbc0010I After 4370000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (451.41 seconds)\n", + "Cbc0010I After 4371000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (451.57 seconds)\n", + "Cbc0010I After 4372000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (451.84 seconds)\n", + "Cbc0010I After 4373000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (452.07 seconds)\n", + "Cbc0010I After 4374000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (452.17 seconds)\n", + "Cbc0010I After 4375000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (452.25 seconds)\n", + "Cbc0010I After 4376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (452.33 seconds)\n", + "Cbc0010I After 4377000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (452.41 seconds)\n", + "Cbc0010I After 4378000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (452.66 seconds)\n", + "Cbc0010I After 4379000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (452.80 seconds)\n", + "Cbc0010I After 4380000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (452.99 seconds)\n", + "Cbc0010I After 4381000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (453.17 seconds)\n", + "Cbc0010I After 4382000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (453.35 seconds)\n", + "Cbc0010I After 4383000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (453.53 seconds)\n", + "Cbc0010I After 4384000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (453.70 seconds)\n", + "Cbc0010I After 4385000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (453.90 seconds)\n", + "Cbc0010I After 4386000 nodes, 82 on tree, 1e+50 best solution, bestlution, best possible 0 (211.06 seconds)\n", + "Cbc0010I After 1350000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (211.23 seconds)\n", + "Cbc0010I After 1351000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (211.35 seconds)\n", + "Cbc0010I After 1352000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (211.50 seconds)\n", + "Cbc0010I After 1353000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (211.63 seconds)\n", + "Cbc0010I After 1354000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (211.75 seconds)\n", + "Cbc0010I After 1355000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (211.88 seconds)\n", + "Cbc0010I After 1356000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (212.02 seconds)\n", + "Cbc0010I After 1357000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (212.16 seconds)\n", + "Cbc0010I After 1358000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (212.30 seconds)\n", + "Cbc0010I After 1359000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (212.42 seconds)\n", + "Cbc0010I After 1360000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (212.55 seconds)\n", + "Cbc0010I After 1361000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (212.66 seconds)\n", + "Cbc0010I After 1362000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (212.77 seconds)\n", + "Cbc0010I After 1363000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (212.88 seconds)\n", + "Cbc0010I After 1364000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (213.00 seconds)\n", + "Cbc0010I After 1365000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (213.17 seconds)\n", + "Cbc0010I After 1366000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (213.35 seconds)\n", + "Cbc0010I After 1367000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (213.52 seconds)\n", + "Cbc0010I After 1368000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (213.70 seconds)\n", + "Cbc0010I After 1369000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (213.89 seconds)\n", + "Cbc0010I After 1370000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (214.08 seconds)\n", + "Cbc0010I After 1371000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (214.28 seconds)\n", + "Cbc0010I After 1372000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (214.42 seconds)\n", + "Cbc0010I After 1373000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (214.59 seconds)\n", + "Cbc0010I After 1374000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (214.85 seconds)\n", + "Cbc0010I After 1375000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (215.05 seconds)\n", + "Cbc0010I After 1376000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (215.24 seconds)\n", + "Cbc0010I After 1377000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (215.41 seconds)\n", + "Cbc0010I After 1378000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (215.58 seconds)\n", + "Cbc0010I After 1379000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (215.74 seconds)\n", + "Cbc0010I After 1380000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (215.90 seconds)\n", + "Cbc0010I After 1381000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (216.05 seconds)\n", + "Cbc0010I After 1382000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (216.23 seconds)\n", + "Cbc0010I After 1383000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (216.42 seconds)\n", + "Cbc0010I After 1384000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (216.62 seconds)\n", + "Cbc0010I After 1385000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (216.80 seconds)\n", + "Cbc0010I After 1386000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (217.01 seconds)\n", + "Cbc0010I After 1387000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (217.15 seconds)\n", + "Cbc0010I After 1388000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (217.31 seconds)\n", + "Cbc0010I After 1389000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (217.45 seconds)\n", + "Cbc0010I After 1390000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (217.58 seconds)\n", + "Cbc0010I After 1391000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (217.72 seconds)\n", + "Cbc0010I After 13 possible 0 (454.08 seconds)\n", + "Cbc0010I After 4387000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (454.17 seconds)\n", + "Cbc0010I After 4388000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (454.25 seconds)\n", + "Cbc0010I After 4389000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (454.50 seconds)\n", + "Cbc0010I After 4390000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (454.72 seconds)\n", + "Cbc0010I After 4391000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (454.89 seconds)\n", + "Cbc0010I After 4392000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (455.09 seconds)\n", + "Cbc0010I After 4393000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (455.33 seconds)\n", + "Cbc0010I After 4394000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (455.58 seconds)\n", + "Cbc0010I After 4395000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (455.79 seconds)\n", + "Cbc0010I After 4396000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (455.88 seconds)\n", + "Cbc0010I After 4397000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (456.13 seconds)\n", + "Cbc0010I After 4398000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (456.22 seconds)\n", + "Cbc0010I After 4399000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (456.35 seconds)\n", + "Cbc0010I After 4400000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (456.53 seconds)\n", + "Cbc0010I After 4401000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (456.82 seconds)\n", + "Cbc0010I After 4402000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (457.12 seconds)\n", + "Cbc0010I After 4403000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (457.44 seconds)\n", + "Cbc0010I After 4404000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (457.72 seconds)\n", + "Cbc0010I After 4405000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (457.97 seconds)\n", + "Cbc0010I After 4406000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (458.22 seconds)\n", + "Cbc0010I After 4407000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (458.37 seconds)\n", + "Cbc0010I After 4408000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (458.53 seconds)\n", + "Cbc0010I After 4409000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (458.69 seconds)\n", + "Cbc0010I After 4410000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (458.84 seconds)\n", + "Cbc0010I After 4411000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (459.03 seconds)\n", + "Cbc0010I After 4412000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (459.12 seconds)\n", + "Cbc0010I After 4413000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (459.18 seconds)\n", + "Cbc0010I After 4414000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (459.25 seconds)\n", + "Cbc0010I After 4415000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (459.33 seconds)\n", + "Cbc0010I After 4416000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (459.42 seconds)\n", + "Cbc0010I After 4417000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (459.50 seconds)\n", + "Cbc0010I After 4418000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (459.59 seconds)\n", + "Cbc0010I After 4419000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (459.67 seconds)\n", + "Cbc0010I After 4420000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (459.85 seconds)\n", + "Cbc0010I After 4421000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (460.00 seconds)\n", + "Cbc0010I After 4422000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (460.06 seconds)\n", + "Cbc0010I After 4423000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (460.12 seconds)\n", + "Cbc0010I After 4424000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (460.16 seconds)\n", + "Cbc0010I After 4425000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (460.27 seconds)\n", + "Cbc0010I After 4426000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (460.41 seconds)\n", + "Cbc0010I After 4427000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (460.56 seconds)\n", + "Cbc0010I After 4428000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (460.70 seconds)\n", + "Cbc0010I After 4429000 nodes,92000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (217.82 seconds)\n", + "Cbc0010I After 1393000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (217.90 seconds)\n", + "Cbc0010I After 1394000 nodes, 13 on tree, 1e+50 best solution, best possible 0 (217.99 seconds)\n", + "Cbc0010I After 1395000 nodes, 21 on tree, 1e+50 best solution, best possible 0 (218.10 seconds)\n", + "Cbc0010I After 1396000 nodes, 253 on tree, 1e+50 best solution, best possible 0 (218.29 seconds)\n", + "Cbc0010I After 1397000 nodes, 214 on tree, 1e+50 best solution, best possible 0 (218.51 seconds)\n", + "Cbc0010I After 1398000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (218.70 seconds)\n", + "Cbc0010I After 1399000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (218.88 seconds)\n", + "Cbc0010I After 1400000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (219.10 seconds)\n", + "Cbc0010I After 1401000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (219.30 seconds)\n", + "Cbc0010I After 1402000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (219.47 seconds)\n", + "Cbc0010I After 1403000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (219.61 seconds)\n", + "Cbc0010I After 1404000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (219.72 seconds)\n", + "Cbc0010I After 1405000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (219.84 seconds)\n", + "Cbc0010I After 1406000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (219.98 seconds)\n", + "Cbc0010I After 1407000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (220.11 seconds)\n", + "Cbc0010I After 1408000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (220.21 seconds)\n", + "Cbc0010I After 1409000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (220.31 seconds)\n", + "Cbc0010I After 1410000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (220.42 seconds)\n", + "Cbc0010I After 1411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (220.51 seconds)\n", + "Cbc0010I After 1412000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (220.65 seconds)\n", + "Cbc0010I After 1413000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (220.76 seconds)\n", + "Cbc0010I After 1414000 nodes, 247 on tree, 1e+50 best solution, best possible 0 (220.86 seconds)\n", + "Cbc0010I After 1415000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (221.00 seconds)\n", + "Cbc0010I After 1416000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (221.26 seconds)\n", + "Cbc0010I After 1417000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (221.43 seconds)\n", + "Cbc0010I After 1418000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (221.65 seconds)\n", + "Cbc0010I After 1419000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (221.87 seconds)\n", + "Cbc0010I After 1420000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (222.00 seconds)\n", + "Cbc0010I After 1421000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (222.15 seconds)\n", + "Cbc0010I After 1422000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (222.33 seconds)\n", + "Cbc0010I After 1423000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (222.44 seconds)\n", + "Cbc0010I After 1424000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (222.56 seconds)\n", + "Cbc0010I After 1425000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (222.66 seconds)\n", + "Cbc0010I After 1426000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (222.79 seconds)\n", + "Cbc0010I After 1427000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (222.89 seconds)\n", + "Cbc0010I After 1428000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (222.99 seconds)\n", + "Cbc0010I After 1429000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (223.11 seconds)\n", + "Cbc0010I After 1430000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (223.21 seconds)\n", + "Cbc0010I After 1431000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (223.32 seconds)\n", + "Cbc0010I After 1432000 nodes, 17 on tree, 1e+50 best solution, best possible 0 (223.47 seconds)\n", + "Cbc0010I After 1433000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (223.55 seconds)\n", + "Cbc0010I After 1434000 nodes, 155 on tree, 1e+50 best solution, 84 on tree, 1e+50 best solution, best possible 0 (460.83 seconds)\n", + "Cbc0010I After 4430000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (460.98 seconds)\n", + "Cbc0010I After 4431000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (461.13 seconds)\n", + "Cbc0010I After 4432000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (461.25 seconds)\n", + "Cbc0010I After 4433000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (461.35 seconds)\n", + "Cbc0010I After 4434000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (461.57 seconds)\n", + "Cbc0010I After 4435000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (461.79 seconds)\n", + "Cbc0010I After 4436000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (462.01 seconds)\n", + "Cbc0010I After 4437000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (462.30 seconds)\n", + "Cbc0010I After 4438000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (462.42 seconds)\n", + "Cbc0010I After 4439000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (462.48 seconds)\n", + "Cbc0010I After 4440000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (462.56 seconds)\n", + "Cbc0010I After 4441000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (462.63 seconds)\n", + "Cbc0010I After 4442000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (462.69 seconds)\n", + "Cbc0010I After 4443000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (462.76 seconds)\n", + "Cbc0010I After 4444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (462.82 seconds)\n", + "Cbc0010I After 4445000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (462.90 seconds)\n", + "Cbc0010I After 4446000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (463.02 seconds)\n", + "Cbc0010I After 4447000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (463.10 seconds)\n", + "Cbc0010I After 4448000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (463.16 seconds)\n", + "Cbc0010I After 4449000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (463.30 seconds)\n", + "Cbc0010I After 4450000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (463.44 seconds)\n", + "Cbc0010I After 4451000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (463.55 seconds)\n", + "Cbc0010I After 4452000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (463.71 seconds)\n", + "Cbc0010I After 4453000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (463.80 seconds)\n", + "Cbc0010I After 4454000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (463.97 seconds)\n", + "Cbc0010I After 4455000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (464.13 seconds)\n", + "Cbc0010I After 4456000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (464.27 seconds)\n", + "Cbc0010I After 4457000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (464.38 seconds)\n", + "Cbc0010I After 4458000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (464.51 seconds)\n", + "Cbc0010I After 4459000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (464.57 seconds)\n", + "Cbc0010I After 4460000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (464.67 seconds)\n", + "Cbc0010I After 4461000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (464.84 seconds)\n", + "Cbc0010I After 4462000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (464.99 seconds)\n", + "Cbc0010I After 4463000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (465.16 seconds)\n", + "Cbc0010I After 4464000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (465.36 seconds)\n", + "Cbc0010I After 4465000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (465.55 seconds)\n", + "Cbc0010I After 4466000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (465.76 seconds)\n", + "Cbc0010I After 4467000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (465.97 seconds)\n", + "Cbc0010I After 4468000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (466.16 seconds)\n", + "Cbc0010I After 4469000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (466.36 seconds)\n", + "Cbc0010I After 4470000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (466.54 seconds)\n", + "Cbc0010I After 4471000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (466.70 seco best possible 0 (223.66 seconds)\n", + "Cbc0010I After 1435000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (223.76 seconds)\n", + "Cbc0010I After 1436000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (223.83 seconds)\n", + "Cbc0010I After 1437000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (223.91 seconds)\n", + "Cbc0010I After 1438000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (223.99 seconds)\n", + "Cbc0010I After 1439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (224.10 seconds)\n", + "Cbc0010I After 1440000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (224.20 seconds)\n", + "Cbc0010I After 1441000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (224.31 seconds)\n", + "Cbc0010I After 1442000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (224.41 seconds)\n", + "Cbc0010I After 1443000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (224.52 seconds)\n", + "Cbc0010I After 1444000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (224.62 seconds)\n", + "Cbc0010I After 1445000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (224.73 seconds)\n", + "Cbc0010I After 1446000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (224.84 seconds)\n", + "Cbc0010I After 1447000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (224.96 seconds)\n", + "Cbc0010I After 1448000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (225.06 seconds)\n", + "Cbc0010I After 1449000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (225.18 seconds)\n", + "Cbc0010I After 1450000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (225.29 seconds)\n", + "Cbc0010I After 1451000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (225.43 seconds)\n", + "Cbc0010I After 1452000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (225.55 seconds)\n", + "Cbc0010I After 1453000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (225.68 seconds)\n", + "Cbc0010I After 1454000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (225.79 seconds)\n", + "Cbc0010I After 1455000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (225.91 seconds)\n", + "Cbc0010I After 1456000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (226.02 seconds)\n", + "Cbc0010I After 1457000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (226.11 seconds)\n", + "Cbc0010I After 1458000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (226.21 seconds)\n", + "Cbc0010I After 1459000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (226.30 seconds)\n", + "Cbc0010I After 1460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (226.40 seconds)\n", + "Cbc0010I After 1461000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (226.51 seconds)\n", + "Cbc0010I After 1462000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (226.62 seconds)\n", + "Cbc0010I After 1463000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (226.71 seconds)\n", + "Cbc0010I After 1464000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (226.79 seconds)\n", + "Cbc0010I After 1465000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (226.88 seconds)\n", + "Cbc0010I After 1466000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (226.96 seconds)\n", + "Cbc0010I After 1467000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (227.03 seconds)\n", + "Cbc0010I After 1468000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (227.11 seconds)\n", + "Cbc0010I After 1469000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (227.26 seconds)\n", + "Cbc0010I After 1470000 nodes, 13 on tree, 1e+50 best solution, best possible 0 (227.45 seconds)\n", + "Cbc0010I After 1471000 nodes, 238 on tree, 1e+50 best solution, best possible 0 (227.64 seconds)\n", + "Cbc0010I After 1472000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (227.84 seconds)\n", + "Cbc0010I After 1473000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (228.02 seconds)\n", + "Cbc0010I After 1474000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (228.21 seconds)\n", + "Cbc0010I After 1475000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (228.38 seconds)\n", + "Cbc0010I After 1476000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (228.51 seconds)\n", + "Cbc0010I Afternds)\n", + "Cbc0010I After 4472000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (466.87 seconds)\n", + "Cbc0010I After 4473000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (467.07 seconds)\n", + "Cbc0010I After 4474000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (467.22 seconds)\n", + "Cbc0010I After 4475000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (467.36 seconds)\n", + "Cbc0010I After 4476000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (467.49 seconds)\n", + "Cbc0010I After 4477000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (467.62 seconds)\n", + "Cbc0010I After 4478000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (467.77 seconds)\n", + "Cbc0010I After 4479000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (467.98 seconds)\n", + "Cbc0010I After 4480000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (468.23 seconds)\n", + "Cbc0010I After 4481000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (468.44 seconds)\n", + "Cbc0010I After 4482000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (468.66 seconds)\n", + "Cbc0010I After 4483000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (468.85 seconds)\n", + "Cbc0010I After 4484000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (469.00 seconds)\n", + "Cbc0010I After 4485000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (469.16 seconds)\n", + "Cbc0010I After 4486000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (469.30 seconds)\n", + "Cbc0010I After 4487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (469.46 seconds)\n", + "Cbc0010I After 4488000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (469.62 seconds)\n", + "Cbc0010I After 4489000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (469.78 seconds)\n", + "Cbc0010I After 4490000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (469.92 seconds)\n", + "Cbc0010I After 4491000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (470.05 seconds)\n", + "Cbc0010I After 4492000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (470.17 seconds)\n", + "Cbc0010I After 4493000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (470.31 seconds)\n", + "Cbc0010I After 4494000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (470.44 seconds)\n", + "Cbc0010I After 4495000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (470.62 seconds)\n", + "Cbc0010I After 4496000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (470.93 seconds)\n", + "Cbc0010I After 4497000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (471.15 seconds)\n", + "Cbc0010I After 4498000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (471.36 seconds)\n", + "Cbc0010I After 4499000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (471.58 seconds)\n", + "Cbc0010I After 4500000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (471.78 seconds)\n", + "Cbc0010I After 4501000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (471.94 seconds)\n", + "Cbc0010I After 4502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (472.13 seconds)\n", + "Cbc0010I After 4503000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (472.31 seconds)\n", + "Cbc0010I After 4504000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (472.47 seconds)\n", + "Cbc0010I After 4505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (472.66 seconds)\n", + "Cbc0010I After 4506000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (472.87 seconds)\n", + "Cbc0010I After 4507000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (473.08 seconds)\n", + "Cbc0010I After 4508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (473.30 seconds)\n", + "Cbc0010I After 4509000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (473.51 seconds)\n", + "Cbc0010I After 4510000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (473.72 seconds)\n", + "Cbc0010I After 4511000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (473.91 seconds)\n", + "Cbc0010I After 4512000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (474.11 seconds)\n", + "Cbc0010I After 4513000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (474.26 seconds)\n", + "Cbc0010I After 4514000 nodes, 80 on tree, 1e+50 best soluti 1477000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (228.67 seconds)\n", + "Cbc0010I After 1478000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (228.78 seconds)\n", + "Cbc0010I After 1479000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (228.94 seconds)\n", + "Cbc0010I After 1480000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (229.06 seconds)\n", + "Cbc0010I After 1481000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (229.21 seconds)\n", + "Cbc0010I After 1482000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (229.32 seconds)\n", + "Cbc0010I After 1483000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (229.45 seconds)\n", + "Cbc0010I After 1484000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (229.58 seconds)\n", + "Cbc0010I After 1485000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (229.68 seconds)\n", + "Cbc0010I After 1486000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (229.80 seconds)\n", + "Cbc0010I After 1487000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (229.89 seconds)\n", + "Cbc0010I After 1488000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (229.97 seconds)\n", + "Cbc0010I After 1489000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (230.11 seconds)\n", + "Cbc0010I After 1490000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (230.38 seconds)\n", + "Cbc0010I After 1491000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (230.55 seconds)\n", + "Cbc0010I After 1492000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (230.70 seconds)\n", + "Cbc0010I After 1493000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (230.90 seconds)\n", + "Cbc0010I After 1494000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (231.06 seconds)\n", + "Cbc0010I After 1495000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (231.24 seconds)\n", + "Cbc0010I After 1496000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (231.42 seconds)\n", + "Cbc0010I After 1497000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (231.55 seconds)\n", + "Cbc0010I After 1498000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (231.69 seconds)\n", + "Cbc0010I After 1499000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (231.86 seconds)\n", + "Cbc0010I After 1500000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (231.98 seconds)\n", + "Cbc0010I After 1501000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (232.11 seconds)\n", + "Cbc0010I After 1502000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (232.27 seconds)\n", + "Cbc0010I After 1503000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (232.47 seconds)\n", + "Cbc0010I After 1504000 nodes, 18 on tree, 1e+50 best solution, best possible 0 (232.62 seconds)\n", + "Cbc0010I After 1505000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (232.76 seconds)\n", + "Cbc0010I After 1506000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (232.89 seconds)\n", + "Cbc0010I After 1507000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (233.02 seconds)\n", + "Cbc0010I After 1508000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (233.15 seconds)\n", + "Cbc0010I After 1509000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (233.28 seconds)\n", + "Cbc0010I After 1510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (233.40 seconds)\n", + "Cbc0010I After 1511000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (233.52 seconds)\n", + "Cbc0010I After 1512000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (233.62 seconds)\n", + "Cbc0010I After 1513000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (233.71 seconds)\n", + "Cbc0010I After 1514000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (233.79 seconds)\n", + "Cbc0010I After 1515000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (233.87 seconds)\n", + "Cbc0010I After 1516000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (233.97 seconds)\n", + "Cbc0010I After 1517000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (234.06 seconds)\n", + "Cbc0010I After 1518000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (234.16 seconds)\n", + "Cbc0010I After 1519000 nodes, 54 on tree, 1e+50 best solutionon, best possible 0 (474.41 seconds)\n", + "Cbc0010I After 4515000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (474.57 seconds)\n", + "Cbc0010I After 4516000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (474.74 seconds)\n", + "Cbc0010I After 4517000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (474.88 seconds)\n", + "Cbc0010I After 4518000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (475.07 seconds)\n", + "Cbc0010I After 4519000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (475.19 seconds)\n", + "Cbc0010I After 4520000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (475.28 seconds)\n", + "Cbc0010I After 4521000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (475.35 seconds)\n", + "Cbc0010I After 4522000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (475.46 seconds)\n", + "Cbc0010I After 4523000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (475.57 seconds)\n", + "Cbc0010I After 4524000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (475.80 seconds)\n", + "Cbc0010I After 4525000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (476.02 seconds)\n", + "Cbc0010I After 4526000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (476.19 seconds)\n", + "Cbc0010I After 4527000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (476.35 seconds)\n", + "Cbc0010I After 4528000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (476.52 seconds)\n", + "Cbc0010I After 4529000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (476.65 seconds)\n", + "Cbc0010I After 4530000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (476.79 seconds)\n", + "Cbc0010I After 4531000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (476.94 seconds)\n", + "Cbc0010I After 4532000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (477.18 seconds)\n", + "Cbc0010I After 4533000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (477.40 seconds)\n", + "Cbc0010I After 4534000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (477.61 seconds)\n", + "Cbc0010I After 4535000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (477.83 seconds)\n", + "Cbc0010I After 4536000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (477.99 seconds)\n", + "Cbc0010I After 4537000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (478.12 seconds)\n", + "Cbc0010I After 4538000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (478.17 seconds)\n", + "Cbc0010I After 4539000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (478.22 seconds)\n", + "Cbc0010I After 4540000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (478.27 seconds)\n", + "Cbc0010I After 4541000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (478.31 seconds)\n", + "Cbc0010I After 4542000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (478.38 seconds)\n", + "Cbc0010I After 4543000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (478.43 seconds)\n", + "Cbc0010I After 4544000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (478.56 seconds)\n", + "Cbc0010I After 4545000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (478.67 seconds)\n", + "Cbc0010I After 4546000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (478.82 seconds)\n", + "Cbc0010I After 4547000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (479.02 seconds)\n", + "Cbc0010I After 4548000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (479.15 seconds)\n", + "Cbc0010I After 4549000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (479.32 seconds)\n", + "Cbc0010I After 4550000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (479.47 seconds)\n", + "Cbc0010I After 4551000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (479.63 seconds)\n", + "Cbc0010I After 4552000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (479.79 seconds)\n", + "Cbc0010I After 4553000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (479.94 seconds)\n", + "Cbc0010I After 4554000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (480.10 seconds)\n", + "Cbc0010I After 4555000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (480.25 seconds)\n", + "Cbc0010I After 4556000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (480.42 seconds)\n", + "Cbc0010I After 4, best possible 0 (234.25 seconds)\n", + "Cbc0010I After 1520000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (234.33 seconds)\n", + "Cbc0010I After 1521000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (234.51 seconds)\n", + "Cbc0010I After 1522000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (234.68 seconds)\n", + "Cbc0010I After 1523000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (234.82 seconds)\n", + "Cbc0010I After 1524000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (234.96 seconds)\n", + "Cbc0010I After 1525000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (235.15 seconds)\n", + "Cbc0010I After 1526000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (235.29 seconds)\n", + "Cbc0010I After 1527000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (235.42 seconds)\n", + "Cbc0010I After 1528000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (235.54 seconds)\n", + "Cbc0010I After 1529000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (235.64 seconds)\n", + "Cbc0010I After 1530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (235.74 seconds)\n", + "Cbc0010I After 1531000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (235.84 seconds)\n", + "Cbc0010I After 1532000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (235.93 seconds)\n", + "Cbc0010I After 1533000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (236.03 seconds)\n", + "Cbc0010I After 1534000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (236.11 seconds)\n", + "Cbc0010I After 1535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (236.18 seconds)\n", + "Cbc0010I After 1536000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (236.26 seconds)\n", + "Cbc0010I After 1537000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (236.35 seconds)\n", + "Cbc0010I After 1538000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (236.44 seconds)\n", + "Cbc0010I After 1539000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (236.58 seconds)\n", + "Cbc0010I After 1540000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (236.82 seconds)\n", + "Cbc0010I After 1541000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (237.04 seconds)\n", + "Cbc0010I After 1542000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (237.26 seconds)\n", + "Cbc0010I After 1543000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (237.43 seconds)\n", + "Cbc0010I After 1544000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (237.60 seconds)\n", + "Cbc0010I After 1545000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (237.69 seconds)\n", + "Cbc0010I After 1546000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (237.77 seconds)\n", + "Cbc0010I After 1547000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (237.92 seconds)\n", + "Cbc0010I After 1548000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (238.03 seconds)\n", + "Cbc0010I After 1549000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (238.16 seconds)\n", + "Cbc0010I After 1550000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (238.34 seconds)\n", + "Cbc0010I After 1551000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (238.47 seconds)\n", + "Cbc0010I After 1552000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (238.60 seconds)\n", + "Cbc0010I After 1553000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (238.75 seconds)\n", + "Cbc0010I After 1554000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (238.95 seconds)\n", + "Cbc0010I After 1555000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (239.09 seconds)\n", + "Cbc0010I After 1556000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (239.22 seconds)\n", + "Cbc0010I After 1557000 nodes, 229 on tree, 1e+50 best solution, best possible 0 (239.36 seconds)\n", + "Cbc0010I After 1558000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (239.51 seconds)\n", + "Cbc0010I After 1559000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (239.66 seconds)\n", + "Cbc0010I After 1560000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (239.81 seconds)\n", + "Cbc0010I After 1561000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (240.00 seconds)\n", + "Cbc0010I After 1562000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (240.20 seconds)\n", + "Cbc0010I After 1563000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (240.35 seconds)\n", + "Cbc0010I After 1564000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (240.53 seconds)\n", + "Cbc0010I After 1565000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (240.73 seconds)\n", + "Cbc0010I After 1566000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (240.88 seconds)\n", + "Cbc0010I After 1567000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (241.12 seconds)\n", + "Cbc0010I After 1568000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (241.29 seconds)\n", + "Cbc0010I After 1569000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (241.44 seconds)\n", + "Cbc0010I After 1570000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (241.72 seconds)\n", + "Cbc0010I After 1571000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (241.90 seconds)\n", + "Cbc0010I After 1572000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (242.16 seconds)\n", + "Cbc0010I After 1573000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (242.34 seconds)\n", + "Cbc0010I After 1574000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (242.51 seconds)\n", + "Cbc0010I After 1575000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (242.66 seconds)\n", + "Cbc0010I After 1576000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (242.81 seconds)\n", + "Cbc0010I After 1577000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (242.97 seconds)\n", + "Cbc0010I After 1578000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (243.15 seconds)\n", + "Cbc0010I After 1579000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (243.29 seconds)\n", + "Cbc0010I After 1580000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (243.39 seconds)\n", + "Cbc0010I After 1581000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (243.49 seconds)\n", + "Cbc0010I After 1582000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (243.58 seconds)\n", + "Cbc0010I After 1583000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (243.66 seconds)\n", + "Cbc0010I After 1584000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (243.75 seconds)\n", + "Cbc0010I After 1585000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (243.84 seconds)\n", + "Cbc0010I After 1586000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (243.95 seconds)\n", + "Cbc0010I After 1587000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (244.18 seconds)\n", + "Cbc0010I After 1588000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (244.33 seconds)\n", + "Cbc0010I After 1589000 nodes, 246 on tree, 1e+50 best solution, best possible 0 (244.57 seconds)\n", + "Cbc0010I After 1590000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (244.74 seconds)\n", + "Cbc0010I After 1591000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (244.92 seconds)\n", + "Cbc0010I After 1592000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (245.07 seconds)\n", + "Cbc0010I After 1593000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (245.23 seconds)\n", + "Cbc0010I After 1594000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (245.39 seconds)\n", + "Cbc0010I After 1595000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (245.55 seconds)\n", + "Cbc0010I After 1596000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (245.68 seconds)\n", + "Cbc0010I After 1597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (245.85 seconds)\n", + "Cbc0010I After 1598000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (245.99 seconds)\n", + "Cbc0010I After 1599000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (246.21 seconds)\n", + "Cbc0010I After 1600000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (246.37 seconds)\n", + "Cbc0010I After 1601000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (246.60 seconds)\n", + "Cbc0010I After 1602000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (246.80 seconds)\n", + "Cbc0010I After 1603000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (246.93 seconds)\n", + "Cbc0010I After 1604000 nodes, 215 on tree, 1e+50 best so557000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (480.61 seconds)\n", + "Cbc0010I After 4558000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (480.77 seconds)\n", + "Cbc0010I After 4559000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (480.99 seconds)\n", + "Cbc0010I After 4560000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (481.21 seconds)\n", + "Cbc0010I After 4561000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (481.45 seconds)\n", + "Cbc0010I After 4562000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (481.69 seconds)\n", + "Cbc0010I After 4563000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (481.93 seconds)\n", + "Cbc0010I After 4564000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (482.18 seconds)\n", + "Cbc0010I After 4565000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (482.43 seconds)\n", + "Cbc0010I After 4566000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (482.74 seconds)\n", + "Cbc0010I After 4567000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (482.97 seconds)\n", + "Cbc0010I After 4568000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (483.17 seconds)\n", + "Cbc0010I After 4569000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (483.38 seconds)\n", + "Cbc0010I After 4570000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (483.59 seconds)\n", + "Cbc0010I After 4571000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (483.78 seconds)\n", + "Cbc0010I After 4572000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (483.94 seconds)\n", + "Cbc0010I After 4573000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (484.05 seconds)\n", + "Cbc0010I After 4574000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (484.17 seconds)\n", + "Cbc0010I After 4575000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (484.32 seconds)\n", + "Cbc0010I After 4576000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (484.45 seconds)\n", + "Cbc0010I After 4577000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (484.77 seconds)\n", + "Cbc0010I After 4578000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (485.03 seconds)\n", + "Cbc0010I After 4579000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (485.17 seconds)\n", + "Cbc0010I After 4580000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (485.34 seconds)\n", + "Cbc0010I After 4581000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (485.47 seconds)\n", + "Cbc0010I After 4582000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (485.62 seconds)\n", + "Cbc0010I After 4583000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (485.73 seconds)\n", + "Cbc0010I After 4584000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (485.87 seconds)\n", + "Cbc0010I After 4585000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (486.02 seconds)\n", + "Cbc0010I After 4586000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (486.12 seconds)\n", + "Cbc0010I After 4587000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (486.24 seconds)\n", + "Cbc0010I After 4588000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (486.40 seconds)\n", + "Cbc0010I After 4589000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (486.60 seconds)\n", + "Cbc0010I After 4590000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (486.78 seconds)\n", + "Cbc0010I After 4591000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (486.91 seconds)\n", + "Cbc0010I After 4592000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (487.16 seconds)\n", + "Cbc0010I After 4593000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (487.34 seconds)\n", + "Cbc0010I After 4594000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (487.46 seconds)\n", + "Cbc0010I After 4595000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (487.58 seconds)\n", + "Cbc0010I After 4596000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (487.68 seconds)\n", + "Cbc0010I After 4597000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (487.79 seconds)\n", + "Cbc0010I After 4598000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (487.90 seconds)\n", + "Cbc0010I After 4599000 nodes, 99 on tree, 1e+50 best solution, best plution, best possible 0 (247.06 seconds)\n", + "Cbc0010I After 1605000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (247.19 seconds)\n", + "Cbc0010I After 1606000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (247.34 seconds)\n", + "Cbc0010I After 1607000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (247.46 seconds)\n", + "Cbc0010I After 1608000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (247.61 seconds)\n", + "Cbc0010I After 1609000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (247.77 seconds)\n", + "Cbc0010I After 1610000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (247.92 seconds)\n", + "Cbc0010I After 1611000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (248.05 seconds)\n", + "Cbc0010I After 1612000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (248.14 seconds)\n", + "Cbc0010I After 1613000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (248.23 seconds)\n", + "Cbc0010I After 1614000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (248.33 seconds)\n", + "Cbc0010I After 1615000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (248.42 seconds)\n", + "Cbc0010I After 1616000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (248.51 seconds)\n", + "Cbc0010I After 1617000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (248.61 seconds)\n", + "Cbc0010I After 1618000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (248.74 seconds)\n", + "Cbc0010I After 1619000 nodes, 254 on tree, 1e+50 best solution, best possible 0 (248.83 seconds)\n", + "Cbc0010I After 1620000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (248.99 seconds)\n", + "Cbc0010I After 1621000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (249.13 seconds)\n", + "Cbc0010I After 1622000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (249.29 seconds)\n", + "Cbc0010I After 1623000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (249.40 seconds)\n", + "Cbc0010I After 1624000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (249.59 seconds)\n", + "Cbc0010I After 1625000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (249.83 seconds)\n", + "Cbc0010I After 1626000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (250.04 seconds)\n", + "Cbc0010I After 1627000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (250.14 seconds)\n", + "Cbc0010I After 1628000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (250.27 seconds)\n", + "Cbc0010I After 1629000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (250.39 seconds)\n", + "Cbc0010I After 1630000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (250.47 seconds)\n", + "Cbc0010I After 1631000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (250.60 seconds)\n", + "Cbc0010I After 1632000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (250.70 seconds)\n", + "Cbc0010I After 1633000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (250.79 seconds)\n", + "Cbc0010I After 1634000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (250.92 seconds)\n", + "Cbc0010I After 1635000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (251.04 seconds)\n", + "Cbc0010I After 1636000 nodes, 220 on tree, 1e+50 best solution, best possible 0 (251.18 seconds)\n", + "Cbc0010I After 1637000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (251.33 seconds)\n", + "Cbc0010I After 1638000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (251.50 seconds)\n", + "Cbc0010I After 1639000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (251.66 seconds)\n", + "Cbc0010I After 1640000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (251.79 seconds)\n", + "Cbc0010I After 1641000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (251.94 seconds)\n", + "Cbc0010I After 1642000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (252.11 seconds)\n", + "Cbc0010I After 1643000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (252.21 seconds)\n", + "Cbc0010I After 1644000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (252.31 seconds)\n", + "Cbc0010I After 1645000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (252.45 seconds)\n", + "Cbc0010I After 1646000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (252.57 secondsossible 0 (488.02 seconds)\n", + "Cbc0010I After 4600000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (488.20 seconds)\n", + "Cbc0010I After 4601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (488.36 seconds)\n", + "Cbc0010I After 4602000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (488.52 seconds)\n", + "Cbc0010I After 4603000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (488.62 seconds)\n", + "Cbc0010I After 4604000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (488.71 seconds)\n", + "Cbc0010I After 4605000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (488.81 seconds)\n", + "Cbc0010I After 4606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (488.90 seconds)\n", + "Cbc0010I After 4607000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (489.00 seconds)\n", + "Cbc0010I After 4608000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (489.08 seconds)\n", + "Cbc0010I After 4609000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (489.19 seconds)\n", + "Cbc0010I After 4610000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (489.31 seconds)\n", + "Cbc0010I After 4611000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (489.45 seconds)\n", + "Cbc0010I After 4612000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (489.59 seconds)\n", + "Cbc0010I After 4613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (489.73 seconds)\n", + "Cbc0010I After 4614000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (489.84 seconds)\n", + "Cbc0010I After 4615000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (489.93 seconds)\n", + "Cbc0010I After 4616000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (490.08 seconds)\n", + "Cbc0010I After 4617000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (490.31 seconds)\n", + "Cbc0010I After 4618000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (490.47 seconds)\n", + "Cbc0010I After 4619000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (490.61 seconds)\n", + "Cbc0010I After 4620000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (490.71 seconds)\n", + "Cbc0010I After 4621000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (490.77 seconds)\n", + "Cbc0010I After 4622000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (490.91 seconds)\n", + "Cbc0010I After 4623000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (491.04 seconds)\n", + "Cbc0010I After 4624000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (491.10 seconds)\n", + "Cbc0010I After 4625000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (491.15 seconds)\n", + "Cbc0010I After 4626000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (491.24 seconds)\n", + "Cbc0010I After 4627000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (491.38 seconds)\n", + "Cbc0010I After 4628000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (491.50 seconds)\n", + "Cbc0010I After 4629000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (491.64 seconds)\n", + "Cbc0010I After 4630000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (491.81 seconds)\n", + "Cbc0010I After 4631000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (491.96 seconds)\n", + "Cbc0010I After 4632000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (492.10 seconds)\n", + "Cbc0010I After 4633000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (492.23 seconds)\n", + "Cbc0010I After 4634000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (492.36 seconds)\n", + "Cbc0010I After 4635000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (492.51 seconds)\n", + "Cbc0010I After 4636000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (492.64 seconds)\n", + "Cbc0010I After 4637000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (492.73 seconds)\n", + "Cbc0010I After 4638000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (492.85 seconds)\n", + "Cbc0010I After 4639000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (492.96 seconds)\n", + "Cbc0010I After 4640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (493.11 seconds)\n", + "Cbc0010I After 4641000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (493.28 seconds)\n", + "Cbc0010I After 4642000 no)\n", + "Cbc0010I After 1647000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (252.68 seconds)\n", + "Cbc0010I After 1648000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (252.87 seconds)\n", + "Cbc0010I After 1649000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (253.03 seconds)\n", + "Cbc0010I After 1650000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (253.28 seconds)\n", + "Cbc0010I After 1651000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (253.44 seconds)\n", + "Cbc0010I After 1652000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (253.67 seconds)\n", + "Cbc0010I After 1653000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (253.84 seconds)\n", + "Cbc0010I After 1654000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (253.98 seconds)\n", + "Cbc0010I After 1655000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (254.17 seconds)\n", + "Cbc0010I After 1656000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (254.33 seconds)\n", + "Cbc0010I After 1657000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (254.48 seconds)\n", + "Cbc0010I After 1658000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (254.63 seconds)\n", + "Cbc0010I After 1659000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (254.84 seconds)\n", + "Cbc0010I After 1660000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (254.99 seconds)\n", + "Cbc0010I After 1661000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (255.20 seconds)\n", + "Cbc0010I After 1662000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (255.47 seconds)\n", + "Cbc0010I After 1663000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (255.66 seconds)\n", + "Cbc0010I After 1664000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (255.87 seconds)\n", + "Cbc0010I After 1665000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (256.05 seconds)\n", + "Cbc0010I After 1666000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (256.19 seconds)\n", + "Cbc0010I After 1667000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (256.33 seconds)\n", + "Cbc0010I After 1668000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (256.43 seconds)\n", + "Cbc0010I After 1669000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (256.55 seconds)\n", + "Cbc0010I After 1670000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (256.63 seconds)\n", + "Cbc0010I After 1671000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (256.75 seconds)\n", + "Cbc0010I After 1672000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (256.84 seconds)\n", + "Cbc0010I After 1673000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (256.96 seconds)\n", + "Cbc0010I After 1674000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (257.06 seconds)\n", + "Cbc0010I After 1675000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (257.16 seconds)\n", + "Cbc0010I After 1676000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (257.27 seconds)\n", + "Cbc0010I After 1677000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (257.42 seconds)\n", + "Cbc0010I After 1678000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (257.56 seconds)\n", + "Cbc0010I After 1679000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (257.72 seconds)\n", + "Cbc0010I After 1680000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (257.86 seconds)\n", + "Cbc0010I After 1681000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (258.02 seconds)\n", + "Cbc0010I After 1682000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (258.24 seconds)\n", + "Cbc0010I After 1683000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (258.40 seconds)\n", + "Cbc0010I After 1684000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (258.65 seconds)\n", + "Cbc0010I After 1685000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (258.91 seconds)\n", + "Cbc0010I After 1686000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (259.09 seconds)\n", + "Cbc0010I After 1687000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (259.29 seconds)\n", + "Cbc0010I After 1688000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (259.48 seconds)\n", + "Cbc0010I After 1689000 nodes, 34 on tree,des, 107 on tree, 1e+50 best solution, best possible 0 (493.45 seconds)\n", + "Cbc0010I After 4643000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (493.70 seconds)\n", + "Cbc0010I After 4644000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (493.89 seconds)\n", + "Cbc0010I After 4645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (494.10 seconds)\n", + "Cbc0010I After 4646000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (494.27 seconds)\n", + "Cbc0010I After 4647000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (494.47 seconds)\n", + "Cbc0010I After 4648000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (494.65 seconds)\n", + "Cbc0010I After 4649000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (494.88 seconds)\n", + "Cbc0010I After 4650000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (495.05 seconds)\n", + "Cbc0010I After 4651000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (495.19 seconds)\n", + "Cbc0010I After 4652000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (495.37 seconds)\n", + "Cbc0010I After 4653000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (495.60 seconds)\n", + "Cbc0010I After 4654000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (495.82 seconds)\n", + "Cbc0010I After 4655000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (496.01 seconds)\n", + "Cbc0010I After 4656000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (496.23 seconds)\n", + "Cbc0010I After 4657000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (496.41 seconds)\n", + "Cbc0010I After 4658000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (496.56 seconds)\n", + "Cbc0010I After 4659000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (496.71 seconds)\n", + "Cbc0010I After 4660000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (496.85 seconds)\n", + "Cbc0010I After 4661000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (496.99 seconds)\n", + "Cbc0010I After 4662000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (497.09 seconds)\n", + "Cbc0010I After 4663000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (497.21 seconds)\n", + "Cbc0010I After 4664000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (497.32 seconds)\n", + "Cbc0010I After 4665000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (497.44 seconds)\n", + "Cbc0010I After 4666000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (497.58 seconds)\n", + "Cbc0010I After 4667000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (497.66 seconds)\n", + "Cbc0010I After 4668000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (497.79 seconds)\n", + "Cbc0010I After 4669000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (497.93 seconds)\n", + "Cbc0010I After 4670000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (498.06 seconds)\n", + "Cbc0010I After 4671000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (498.17 seconds)\n", + "Cbc0010I After 4672000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (498.30 seconds)\n", + "Cbc0010I After 4673000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (498.47 seconds)\n", + "Cbc0010I After 4674000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (498.67 seconds)\n", + "Cbc0010I After 4675000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (498.85 seconds)\n", + "Cbc0010I After 4676000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (498.99 seconds)\n", + "Cbc0010I After 4677000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (499.27 seconds)\n", + "Cbc0010I After 4678000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (499.53 seconds)\n", + "Cbc0010I After 4679000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (499.68 seconds)\n", + "Cbc0010I After 4680000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (499.81 seconds)\n", + "Cbc0010I After 4681000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (500.02 seconds)\n", + "Cbc0010I After 4682000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (500.17 seconds)\n", + "Cbc0010I After 4683000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (500.30 seconds)\n", + "Cbc0010I After 4684000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (500.43 seconds)\n", + "Cbc0010I After 4685000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (500.59 seconds)\n", + "Cbc0010I After 4686000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (500.71 seconds)\n", + "Cbc0010I After 4687000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (500.80 seconds)\n", + "Cbc0010I After 4688000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (500.90 seconds)\n", + "Cbc0010I After 4689000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (501.00 seconds)\n", + "Cbc0010I After 4690000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (501.12 seconds)\n", + "Cbc0010I After 4691000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (501.25 seconds)\n", + "Cbc0010I After 4692000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (501.34 seconds)\n", + "Cbc0010I After 4693000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (501.47 seconds)\n", + "Cbc0010I After 4694000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (501.56 seconds)\n", + "Cbc0010I After 4695000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (501.65 seconds)\n", + "Cbc0010I After 4696000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (501.75 seconds)\n", + "Cbc0010I After 4697000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (501.85 seconds)\n", + "Cbc0010I After 4698000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (501.98 seconds)\n", + "Cbc0010I After 4699000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (502.08 seconds)\n", + "Cbc0010I After 4700000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (502.18 seconds)\n", + "Cbc0010I After 4701000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (502.32 seconds)\n", + "Cbc0010I After 4702000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (502.45 seconds)\n", + "Cbc0010I After 4703000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (502.57 seconds)\n", + "Cbc0010I After 4704000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (502.78 seconds)\n", + "Cbc0010I After 4705000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (502.95 seconds)\n", + "Cbc0010I After 4706000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (503.15 seconds)\n", + "Cbc0010I After 4707000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (503.45 seconds)\n", + "Cbc0010I After 4708000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (503.57 seconds)\n", + "Cbc0010I After 4709000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (503.72 seconds)\n", + "Cbc0010I After 4710000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (503.86 seconds)\n", + "Cbc0010I After 4711000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (503.98 seconds)\n", + "Cbc0010I After 4712000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (504.11 seconds)\n", + "Cbc0010I After 4713000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (504.23 seconds)\n", + "Cbc0010I After 4714000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (504.39 seconds)\n", + "Cbc0010I After 4715000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (504.54 seconds)\n", + "Cbc0010I After 4716000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (504.78 seconds)\n", + "Cbc0010I After 4717000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (504.97 seconds)\n", + "Cbc0010I After 4718000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (505.08 seconds)\n", + "Cbc0010I After 4719000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (505.26 seconds)\n", + "Cbc0010I After 4720000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (505.42 seconds)\n", + "Cbc0010I After 4721000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (506.07 seconds)\n", + "Cbc0010I After 4722000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (506.36 seconds)\n", + "Cbc0010I After 4723000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (506.58 seconds)\n", + "Cbc0010I After 4724000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (506.84 seconds)\n", + "Cbc0010I After 4725000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (507.05 seconds)\n", + "Cbc0010I After 4726000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (507.33 seconds)\n", + "Cbc0010I After 47 1e+50 best solution, best possible 0 (259.61 seconds)\n", + "Cbc0010I After 1690000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (259.71 seconds)\n", + "Cbc0010I After 1691000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (259.84 seconds)\n", + "Cbc0010I After 1692000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (259.94 seconds)\n", + "Cbc0010I After 1693000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (260.08 seconds)\n", + "Cbc0010I After 1694000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (260.20 seconds)\n", + "Cbc0010I After 1695000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (260.32 seconds)\n", + "Cbc0010I After 1696000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (260.42 seconds)\n", + "Cbc0010I After 1697000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (260.52 seconds)\n", + "Cbc0010I After 1698000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (260.65 seconds)\n", + "Cbc0010I After 1699000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (260.79 seconds)\n", + "Cbc0010I After 1700000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (260.90 seconds)\n", + "Cbc0010I After 1701000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (261.01 seconds)\n", + "Cbc0010I After 1702000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (261.17 seconds)\n", + "Cbc0010I After 1703000 nodes, 207 on tree, 1e+50 best solution, best possible 0 (261.29 seconds)\n", + "Cbc0010I After 1704000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (261.46 seconds)\n", + "Cbc0010I After 1705000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (261.62 seconds)\n", + "Cbc0010I After 1706000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (261.78 seconds)\n", + "Cbc0010I After 1707000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (261.97 seconds)\n", + "Cbc0010I After 1708000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (262.11 seconds)\n", + "Cbc0010I After 1709000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (262.34 seconds)\n", + "Cbc0010I After 1710000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (262.45 seconds)\n", + "Cbc0010I After 1711000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (262.64 seconds)\n", + "Cbc0010I After 1712000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (262.83 seconds)\n", + "Cbc0010I After 1713000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (262.97 seconds)\n", + "Cbc0010I After 1714000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (263.10 seconds)\n", + "Cbc0010I After 1715000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (263.25 seconds)\n", + "Cbc0010I After 1716000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (263.44 seconds)\n", + "Cbc0010I After 1717000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (263.62 seconds)\n", + "Cbc0010I After 1718000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (263.76 seconds)\n", + "Cbc0010I After 1719000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (263.94 seconds)\n", + "Cbc0010I After 1720000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (264.10 seconds)\n", + "Cbc0010I After 1721000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (264.40 seconds)\n", + "Cbc0010I After 1722000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (264.63 seconds)\n", + "Cbc0010I After 1723000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (264.81 seconds)\n", + "Cbc0010I After 1724000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (264.96 seconds)\n", + "Cbc0010I After 1725000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (265.30 seconds)\n", + "Cbc0010I After 1726000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (265.71 seconds)\n", + "Cbc0010I After 1727000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (266.08 seconds)\n", + "Cbc0010I After 1728000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (266.33 seconds)\n", + "Cbc0010I After 1729000 nodes, 227 on tree, 1e+50 best solution, best possible 0 (266.69 seconds)\n", + "Cbc0010I After 1730000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (267.06 seconds)\n", + "Cbc0010I After 1731000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (27000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (507.53 seconds)\n", + "Cbc0010I After 4728000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (507.76 seconds)\n", + "Cbc0010I After 4729000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (507.98 seconds)\n", + "Cbc0010I After 4730000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (508.16 seconds)\n", + "Cbc0010I After 4731000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (508.31 seconds)\n", + "Cbc0010I After 4732000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (508.45 seconds)\n", + "Cbc0010I After 4733000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (508.60 seconds)\n", + "Cbc0010I After 4734000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (508.77 seconds)\n", + "Cbc0010I After 4735000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (508.94 seconds)\n", + "Cbc0010I After 4736000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (509.06 seconds)\n", + "Cbc0010I After 4737000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (509.19 seconds)\n", + "Cbc0010I After 4738000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (509.35 seconds)\n", + "Cbc0010I After 4739000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (509.47 seconds)\n", + "Cbc0010I After 4740000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (509.59 seconds)\n", + "Cbc0010I After 4741000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (509.74 seconds)\n", + "Cbc0010I After 4742000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (509.96 seconds)\n", + "Cbc0010I After 4743000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (510.20 seconds)\n", + "Cbc0010I After 4744000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (510.35 seconds)\n", + "Cbc0010I After 4745000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (510.48 seconds)\n", + "Cbc0010I After 4746000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (510.68 seconds)\n", + "Cbc0010I After 4747000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (510.90 seconds)\n", + "Cbc0010I After 4748000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (511.08 seconds)\n", + "Cbc0010I After 4749000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (511.19 seconds)\n", + "Cbc0010I After 4750000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (511.29 seconds)\n", + "Cbc0010I After 4751000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (511.42 seconds)\n", + "Cbc0010I After 4752000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (511.58 seconds)\n", + "Cbc0010I After 4753000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (512.40 seconds)\n", + "Cbc0010I After 4754000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (512.52 seconds)\n", + "Cbc0010I After 4755000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (512.65 seconds)\n", + "Cbc0010I After 4756000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (512.76 seconds)\n", + "Cbc0010I After 4757000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (512.86 seconds)\n", + "Cbc0010I After 4758000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (512.98 seconds)\n", + "Cbc0010I After 4759000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (513.12 seconds)\n", + "Cbc0010I After 4760000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (513.24 seconds)\n", + "Cbc0010I After 4761000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (513.34 seconds)\n", + "Cbc0010I After 4762000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (513.50 seconds)\n", + "Cbc0010I After 4763000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (513.61 seconds)\n", + "Cbc0010I After 4764000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (513.72 seconds)\n", + "Cbc0010I After 4765000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (513.83 seconds)\n", + "Cbc0010I After 4766000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (513.93 seconds)\n", + "Cbc0010I After 4767000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (514.05 seconds)\n", + "Cbc0010I After 4768000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (514.19 seconds)\n", + "Cbc0010I After 4769000 nodes, 158 on tree,267.44 seconds)\n", + "Cbc0010I After 1732000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (267.68 seconds)\n", + "Cbc0010I After 1733000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (267.90 seconds)\n", + "Cbc0010I After 1734000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (268.08 seconds)\n", + "Cbc0010I After 1735000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (268.32 seconds)\n", + "Cbc0010I After 1736000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (268.54 seconds)\n", + "Cbc0010I After 1737000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (268.73 seconds)\n", + "Cbc0010I After 1738000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (268.87 seconds)\n", + "Cbc0010I After 1739000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (269.03 seconds)\n", + "Cbc0010I After 1740000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (269.19 seconds)\n", + "Cbc0010I After 1741000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (269.35 seconds)\n", + "Cbc0010I After 1742000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (269.59 seconds)\n", + "Cbc0010I After 1743000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (269.85 seconds)\n", + "Cbc0010I After 1744000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (270.04 seconds)\n", + "Cbc0010I After 1745000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (270.30 seconds)\n", + "Cbc0010I After 1746000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (270.51 seconds)\n", + "Cbc0010I After 1747000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (270.68 seconds)\n", + "Cbc0010I After 1748000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (270.85 seconds)\n", + "Cbc0010I After 1749000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (271.07 seconds)\n", + "Cbc0010I After 1750000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (271.19 seconds)\n", + "Cbc0010I After 1751000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (271.32 seconds)\n", + "Cbc0010I After 1752000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (271.44 seconds)\n", + "Cbc0010I After 1753000 nodes, 224 on tree, 1e+50 best solution, best possible 0 (271.59 seconds)\n", + "Cbc0010I After 1754000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (271.78 seconds)\n", + "Cbc0010I After 1755000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (272.00 seconds)\n", + "Cbc0010I After 1756000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (272.17 seconds)\n", + "Cbc0010I After 1757000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (272.36 seconds)\n", + "Cbc0010I After 1758000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (272.54 seconds)\n", + "Cbc0010I After 1759000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (272.71 seconds)\n", + "Cbc0010I After 1760000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (272.84 seconds)\n", + "Cbc0010I After 1761000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (273.07 seconds)\n", + "Cbc0010I After 1762000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (273.23 seconds)\n", + "Cbc0010I After 1763000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (273.42 seconds)\n", + "Cbc0010I After 1764000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (273.54 seconds)\n", + "Cbc0010I After 1765000 nodes, 240 on tree, 1e+50 best solution, best possible 0 (273.68 seconds)\n", + "Cbc0010I After 1766000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (273.91 seconds)\n", + "Cbc0010I After 1767000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (274.17 seconds)\n", + "Cbc0010I After 1768000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (274.37 seconds)\n", + "Cbc0010I After 1769000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (274.55 seconds)\n", + "Cbc0010I After 1770000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (274.78 seconds)\n", + "Cbc0010I After 1771000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (274.93 seconds)\n", + "Cbc0010I After 1772000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (275.12 seconds)\n", + "Cbc0010I After 1773000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (275.26 seconds)\n", + "Cbc0010I After 1774000 1e+50 best solution, best possible 0 (514.37 seconds)\n", + "Cbc0010I After 4770000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (514.56 seconds)\n", + "Cbc0010I After 4771000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (514.67 seconds)\n", + "Cbc0010I After 4772000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (514.80 seconds)\n", + "Cbc0010I After 4773000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (514.95 seconds)\n", + "Cbc0010I After 4774000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (515.13 seconds)\n", + "Cbc0010I After 4775000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (515.25 seconds)\n", + "Cbc0010I After 4776000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (515.39 seconds)\n", + "Cbc0010I After 4777000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (515.51 seconds)\n", + "Cbc0010I After 4778000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (515.64 seconds)\n", + "Cbc0010I After 4779000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (515.78 seconds)\n", + "Cbc0010I After 4780000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (515.92 seconds)\n", + "Cbc0010I After 4781000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (516.13 seconds)\n", + "Cbc0010I After 4782000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (516.26 seconds)\n", + "Cbc0010I After 4783000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (516.36 seconds)\n", + "Cbc0010I After 4784000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (516.55 seconds)\n", + "Cbc0010I After 4785000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (516.69 seconds)\n", + "Cbc0010I After 4786000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (516.86 seconds)\n", + "Cbc0010I After 4787000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (517.07 seconds)\n", + "Cbc0010I After 4788000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (517.28 seconds)\n", + "Cbc0010I After 4789000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (517.49 seconds)\n", + "Cbc0010I After 4790000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (517.76 seconds)\n", + "Cbc0010I After 4791000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (517.99 seconds)\n", + "Cbc0010I After 4792000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (518.20 seconds)\n", + "Cbc0010I After 4793000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (518.39 seconds)\n", + "Cbc0010I After 4794000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (518.66 seconds)\n", + "Cbc0010I After 4795000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (518.81 seconds)\n", + "Cbc0010I After 4796000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (519.02 seconds)\n", + "Cbc0010I After 4797000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (519.33 seconds)\n", + "Cbc0010I After 4798000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (519.52 seconds)\n", + "Cbc0010I After 4799000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (519.75 seconds)\n", + "Cbc0010I After 4800000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (519.83 seconds)\n", + "Cbc0010I After 4801000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (519.89 seconds)\n", + "Cbc0010I After 4802000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (520.00 seconds)\n", + "Cbc0010I After 4803000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (520.12 seconds)\n", + "Cbc0010I After 4804000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (520.30 seconds)\n", + "Cbc0010I After 4805000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (520.38 seconds)\n", + "Cbc0010I After 4806000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (520.56 seconds)\n", + "Cbc0010I After 4807000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (520.71 seconds)\n", + "Cbc0010I After 4808000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (520.80 seconds)\n", + "Cbc0010I After 4809000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (520.91 seconds)\n", + "Cbc0010I After 4810000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (520.97 seconds)\n", + "Cbc0010I After 4811000 nodes, 130 on tree, 1e+50 best solution, besnodes, 66 on tree, 1e+50 best solution, best possible 0 (275.43 seconds)\n", + "Cbc0010I After 1775000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (275.67 seconds)\n", + "Cbc0010I After 1776000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (275.85 seconds)\n", + "Cbc0010I After 1777000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (276.07 seconds)\n", + "Cbc0010I After 1778000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (276.32 seconds)\n", + "Cbc0010I After 1779000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (276.60 seconds)\n", + "Cbc0010I After 1780000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (276.88 seconds)\n", + "Cbc0010I After 1781000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (277.20 seconds)\n", + "Cbc0010I After 1782000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (277.56 seconds)\n", + "Cbc0010I After 1783000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (277.92 seconds)\n", + "Cbc0010I After 1784000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (278.25 seconds)\n", + "Cbc0010I After 1785000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (278.57 seconds)\n", + "Cbc0010I After 1786000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (278.84 seconds)\n", + "Cbc0010I After 1787000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (279.01 seconds)\n", + "Cbc0010I After 1788000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (279.14 seconds)\n", + "Cbc0010I After 1789000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (279.32 seconds)\n", + "Cbc0010I After 1790000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (279.45 seconds)\n", + "Cbc0010I After 1791000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (279.58 seconds)\n", + "Cbc0010I After 1792000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (279.76 seconds)\n", + "Cbc0010I After 1793000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (279.91 seconds)\n", + "Cbc0010I After 1794000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (280.07 seconds)\n", + "Cbc0010I After 1795000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (280.23 seconds)\n", + "Cbc0010I After 1796000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (280.39 seconds)\n", + "Cbc0010I After 1797000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (280.49 seconds)\n", + "Cbc0010I After 1798000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (280.56 seconds)\n", + "Cbc0010I After 1799000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (280.65 seconds)\n", + "Cbc0010I After 1800000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (280.72 seconds)\n", + "Cbc0010I After 1801000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (280.80 seconds)\n", + "Cbc0010I After 1802000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (280.88 seconds)\n", + "Cbc0010I After 1803000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (280.97 seconds)\n", + "Cbc0010I After 1804000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (281.07 seconds)\n", + "Cbc0010I After 1805000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (281.18 seconds)\n", + "Cbc0010I After 1806000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (281.33 seconds)\n", + "Cbc0010I After 1807000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (281.45 seconds)\n", + "Cbc0010I After 1808000 nodes, 196 on tree, 1e+50 best solution, best possible 0 (281.65 seconds)\n", + "Cbc0010I After 1809000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (281.85 seconds)\n", + "Cbc0010I After 1810000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (282.00 seconds)\n", + "Cbc0010I After 1811000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (282.20 seconds)\n", + "Cbc0010I After 1812000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (282.39 seconds)\n", + "Cbc0010I After 1813000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (282.56 seconds)\n", + "Cbc0010I After 1814000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (282.72 seconds)\n", + "Cbc0010I After 1815000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (282.89 seconds)\n", + "Cbc0010I After 1816000 nodes, 87 on tree, 1e+50 best solution, best pt possible 0 (521.03 seconds)\n", + "Cbc0010I After 4812000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (521.08 seconds)\n", + "Cbc0010I After 4813000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (521.17 seconds)\n", + "Cbc0010I After 4814000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (521.22 seconds)\n", + "Cbc0010I After 4815000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (521.29 seconds)\n", + "Cbc0010I After 4816000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (521.35 seconds)\n", + "Cbc0010I After 4817000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (521.42 seconds)\n", + "Cbc0010I After 4818000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (521.49 seconds)\n", + "Cbc0010I After 4819000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (521.59 seconds)\n", + "Cbc0010I After 4820000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (521.72 seconds)\n", + "Cbc0010I After 4821000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (521.82 seconds)\n", + "Cbc0010I After 4822000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (521.92 seconds)\n", + "Cbc0010I After 4823000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (522.12 seconds)\n", + "Cbc0010I After 4824000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (522.27 seconds)\n", + "Cbc0010I After 4825000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (522.38 seconds)\n", + "Cbc0010I After 4826000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (522.53 seconds)\n", + "Cbc0010I After 4827000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (522.68 seconds)\n", + "Cbc0010I After 4828000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (522.81 seconds)\n", + "Cbc0010I After 4829000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (522.91 seconds)\n", + "Cbc0010I After 4830000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (523.06 seconds)\n", + "Cbc0010I After 4831000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (523.19 seconds)\n", + "Cbc0010I After 4832000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (523.30 seconds)\n", + "Cbc0010I After 4833000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (523.38 seconds)\n", + "Cbc0010I After 4834000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (523.57 seconds)\n", + "Cbc0010I After 4835000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (523.70 seconds)\n", + "Cbc0010I After 4836000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (523.86 seconds)\n", + "Cbc0010I After 4837000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (524.05 seconds)\n", + "Cbc0010I After 4838000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (524.27 seconds)\n", + "Cbc0010I After 4839000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (524.44 seconds)\n", + "Cbc0010I After 4840000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (524.61 seconds)\n", + "Cbc0010I After 4841000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (524.87 seconds)\n", + "Cbc0010I After 4842000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (525.04 seconds)\n", + "Cbc0010I After 4843000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (525.21 seconds)\n", + "Cbc0010I After 4844000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (525.35 seconds)\n", + "Cbc0010I After 4845000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (525.50 seconds)\n", + "Cbc0010I After 4846000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (525.61 seconds)\n", + "Cbc0010I After 4847000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (525.73 seconds)\n", + "Cbc0010I After 4848000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (525.91 seconds)\n", + "Cbc0010I After 4849000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (526.02 seconds)\n", + "Cbc0010I After 4850000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (526.10 seconds)\n", + "Cbc0010I After 4851000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (526.36 seconds)\n", + "Cbc0010I After 4852000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (526.70 seconds)\n", + "Cbc0010I After 4853000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (526.88 seconds)ossible 0 (283.05 seconds)\n", + "Cbc0010I After 1817000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (283.29 seconds)\n", + "Cbc0010I After 1818000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (283.49 seconds)\n", + "Cbc0010I After 1819000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (283.80 seconds)\n", + "Cbc0010I After 1820000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (284.01 seconds)\n", + "Cbc0010I After 1821000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (284.35 seconds)\n", + "Cbc0010I After 1822000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (284.65 seconds)\n", + "Cbc0010I After 1823000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (284.93 seconds)\n", + "Cbc0010I After 1824000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (285.21 seconds)\n", + "Cbc0010I After 1825000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (285.44 seconds)\n", + "Cbc0010I After 1826000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (285.67 seconds)\n", + "Cbc0010I After 1827000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (286.07 seconds)\n", + "Cbc0010I After 1828000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (286.36 seconds)\n", + "Cbc0010I After 1829000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (286.56 seconds)\n", + "Cbc0010I After 1830000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (286.78 seconds)\n", + "Cbc0010I After 1831000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (287.01 seconds)\n", + "Cbc0010I After 1832000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (287.27 seconds)\n", + "Cbc0010I After 1833000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (287.47 seconds)\n", + "Cbc0010I After 1834000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (287.66 seconds)\n", + "Cbc0010I After 1835000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (287.79 seconds)\n", + "Cbc0010I After 1836000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (287.92 seconds)\n", + "Cbc0010I After 1837000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (288.05 seconds)\n", + "Cbc0010I After 1838000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (288.19 seconds)\n", + "Cbc0010I After 1839000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (288.34 seconds)\n", + "Cbc0010I After 1840000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (288.45 seconds)\n", + "Cbc0010I After 1841000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (288.60 seconds)\n", + "Cbc0010I After 1842000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (288.73 seconds)\n", + "Cbc0010I After 1843000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (288.84 seconds)\n", + "Cbc0010I After 1844000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (288.95 seconds)\n", + "Cbc0010I After 1845000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (289.04 seconds)\n", + "Cbc0010I After 1846000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (289.13 seconds)\n", + "Cbc0010I After 1847000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (289.25 seconds)\n", + "Cbc0010I After 1848000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (289.43 seconds)\n", + "Cbc0010I After 1849000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (289.60 seconds)\n", + "Cbc0010I After 1850000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (289.75 seconds)\n", + "Cbc0010I After 1851000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (289.89 seconds)\n", + "Cbc0010I After 1852000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (290.05 seconds)\n", + "Cbc0010I After 1853000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (290.18 seconds)\n", + "Cbc0010I After 1854000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (290.31 seconds)\n", + "Cbc0010I After 1855000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (290.42 seconds)\n", + "Cbc0010I After 1856000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (290.54 seconds)\n", + "Cbc0010I After 1857000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (290.67 seconds)\n", + "Cbc0010I After 1858000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (290.77 seconds)\n", + "Cbc0010I \n", + "Cbc0010I After 4854000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (527.06 seconds)\n", + "Cbc0010I After 4855000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (527.19 seconds)\n", + "Cbc0010I After 4856000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (527.37 seconds)\n", + "Cbc0010I After 4857000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (527.54 seconds)\n", + "Cbc0010I After 4858000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (527.73 seconds)\n", + "Cbc0010I After 4859000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (527.88 seconds)\n", + "Cbc0010I After 4860000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (527.98 seconds)\n", + "Cbc0010I After 4861000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.09 seconds)\n", + "Cbc0010I After 4862000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.23 seconds)\n", + "Cbc0010I After 4863000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (528.37 seconds)\n", + "Cbc0010I After 4864000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (528.50 seconds)\n", + "Cbc0010I After 4865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (528.67 seconds)\n", + "Cbc0010I After 4866000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (528.78 seconds)\n", + "Cbc0010I After 4867000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (528.86 seconds)\n", + "Cbc0010I After 4868000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.93 seconds)\n", + "Cbc0010I After 4869000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (529.03 seconds)\n", + "Cbc0010I After 4870000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (529.13 seconds)\n", + "Cbc0010I After 4871000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (529.22 seconds)\n", + "Cbc0010I After 4872000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (529.33 seconds)\n", + "Cbc0010I After 4873000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (529.46 seconds)\n", + "Cbc0010I After 4874000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (529.59 seconds)\n", + "Cbc0010I After 4875000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (529.65 seconds)\n", + "Cbc0010I After 4876000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (529.74 seconds)\n", + "Cbc0010I After 4877000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (529.85 seconds)\n", + "Cbc0010I After 4878000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (529.93 seconds)\n", + "Cbc0010I After 4879000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (530.05 seconds)\n", + "Cbc0010I After 4880000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (530.12 seconds)\n", + "Cbc0010I After 4881000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (530.22 seconds)\n", + "Cbc0010I After 4882000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (530.28 seconds)\n", + "Cbc0010I After 4883000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (530.35 seconds)\n", + "Cbc0010I After 4884000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (530.48 seconds)\n", + "Cbc0010I After 4885000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (530.57 seconds)\n", + "Cbc0010I After 4886000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (530.65 seconds)\n", + "Cbc0010I After 4887000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (530.74 seconds)\n", + "Cbc0010I After 4888000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (530.82 seconds)\n", + "Cbc0010I After 4889000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (530.88 seconds)\n", + "Cbc0010I After 4890000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (530.93 seconds)\n", + "Cbc0010I After 4891000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (531.03 seconds)\n", + "Cbc0010I After 4892000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (531.14 seconds)\n", + "Cbc0010I After 4893000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (531.23 seconds)\n", + "Cbc0010I After 4894000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (531.32 seconds)\n", + "Cbc0010I After 4895000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (531.38 seconds)\n", + "Cbc0010I After 4896000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (531.44 seconds)\n", + "Cbc0010I After 4897000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (531.51 seconds)\n", + "Cbc0010I After 4898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (531.63 seconds)\n", + "Cbc0010I After 4899000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (531.74 seconds)\n", + "Cbc0010I After 4900000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (531.83 seconds)\n", + "Cbc0010I After 4901000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (531.93 seconds)\n", + "Cbc0010I After 4902000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (532.00 seconds)\n", + "Cbc0010I After 4903000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (532.07 seconds)\n", + "Cbc0010I After 4904000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (532.17 seconds)\n", + "Cbc0010I After 4905000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (532.27 seconds)\n", + "Cbc0010I After 4906000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (532.37 seconds)\n", + "Cbc0010I After 4907000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (532.44 seconds)\n", + "Cbc0010I After 4908000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (532.51 seconds)\n", + "Cbc0010I After 4909000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (532.59 seconds)\n", + "Cbc0010I After 4910000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (532.67 seconds)\n", + "Cbc0010I After 4911000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (532.76 seconds)\n", + "Cbc0010I After 4912000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (532.86 seconds)\n", + "Cbc0010I After 4913000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (532.93 seconds)\n", + "Cbc0010I After 4914000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (532.99 seconds)\n", + "Cbc0010I After 4915000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (533.04 seconds)\n", + "Cbc0010I After 4916000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (533.11 seconds)\n", + "Cbc0010I After 4917000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (533.20 seconds)\n", + "Cbc0010I After 4918000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (533.30 seconds)\n", + "Cbc0010I After 4919000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (533.40 seconds)\n", + "Cbc0010I After 4920000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (533.53 seconds)\n", + "Cbc0010I After 4921000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (533.60 seconds)\n", + "Cbc0010I After 4922000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (533.66 seconds)\n", + "Cbc0010I After 4923000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (533.77 seconds)\n", + "Cbc0010I After 4924000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (533.84 seconds)\n", + "Cbc0010I After 4925000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (533.95 seconds)\n", + "Cbc0010I After 4926000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (534.05 seconds)\n", + "Cbc0010I After 4927000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (534.18 seconds)\n", + "Cbc0010I After 4928000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (534.30 seconds)\n", + "Cbc0010I After 4929000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (534.51 seconds)\n", + "Cbc0010I After 4930000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (534.64 seconds)\n", + "Cbc0010I After 4931000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (534.72 seconds)\n", + "Cbc0010I After 4932000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (534.81 seconds)\n", + "Cbc0010I After 4933000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (534.93 seconds)\n", + "Cbc0010I After 4934000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (535.04 seconds)\n", + "Cbc0010I After 4935000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (535.16 seconds)\n", + "Cbc0010I After 4936000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (535.27 seconds)\n", + "Cbc0010I After 4937000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (535.36 seconds)\n", + "Cbc0010I After 4938000 nodes, 161 on tree, 1e+50 bestAfter 1859000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (290.86 seconds)\n", + "Cbc0010I After 1860000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (290.96 seconds)\n", + "Cbc0010I After 1861000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (291.09 seconds)\n", + "Cbc0010I After 1862000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (291.21 seconds)\n", + "Cbc0010I After 1863000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (291.31 seconds)\n", + "Cbc0010I After 1864000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (291.41 seconds)\n", + "Cbc0010I After 1865000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (291.51 seconds)\n", + "Cbc0010I After 1866000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (291.61 seconds)\n", + "Cbc0010I After 1867000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (291.72 seconds)\n", + "Cbc0010I After 1868000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (291.81 seconds)\n", + "Cbc0010I After 1869000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (291.92 seconds)\n", + "Cbc0010I After 1870000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (292.00 seconds)\n", + "Cbc0010I After 1871000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (292.14 seconds)\n", + "Cbc0010I After 1872000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (292.24 seconds)\n", + "Cbc0010I After 1873000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (292.36 seconds)\n", + "Cbc0010I After 1874000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (292.47 seconds)\n", + "Cbc0010I After 1875000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (292.57 seconds)\n", + "Cbc0010I After 1876000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (292.69 seconds)\n", + "Cbc0010I After 1877000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (292.83 seconds)\n", + "Cbc0010I After 1878000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (292.95 seconds)\n", + "Cbc0010I After 1879000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (293.08 seconds)\n", + "Cbc0010I After 1880000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (293.18 seconds)\n", + "Cbc0010I After 1881000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (293.33 seconds)\n", + "Cbc0010I After 1882000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (293.48 seconds)\n", + "Cbc0010I After 1883000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.63 seconds)\n", + "Cbc0010I After 1884000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (293.78 seconds)\n", + "Cbc0010I After 1885000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (294.04 seconds)\n", + "Cbc0010I After 1886000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (294.22 seconds)\n", + "Cbc0010I After 1887000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (294.36 seconds)\n", + "Cbc0010I After 1888000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (294.49 seconds)\n", + "Cbc0010I After 1889000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (294.64 seconds)\n", + "Cbc0010I After 1890000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (294.73 seconds)\n", + "Cbc0010I After 1891000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (294.88 seconds)\n", + "Cbc0010I After 1892000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (295.01 seconds)\n", + "Cbc0010I After 1893000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (295.14 seconds)\n", + "Cbc0010I After 1894000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (295.31 seconds)\n", + "Cbc0010I After 1895000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (295.48 seconds)\n", + "Cbc0010I After 1896000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (295.66 seconds)\n", + "Cbc0010I After 1897000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (295.80 seconds)\n", + "Cbc0010I After 1898000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (295.94 seconds)\n", + "Cbc0010I After 1899000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (296.11 seconds)\n", + "Cbc0010I After 1900000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (296.28 seconds)\n", + "Cbc0010I After 1901000 nodes, 77 on tree, 1e solution, best possible 0 (535.48 seconds)\n", + "Cbc0010I After 4939000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (535.59 seconds)\n", + "Cbc0010I After 4940000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (535.71 seconds)\n", + "Cbc0010I After 4941000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (535.85 seconds)\n", + "Cbc0010I After 4942000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (535.98 seconds)\n", + "Cbc0010I After 4943000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (536.17 seconds)\n", + "Cbc0010I After 4944000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (536.31 seconds)\n", + "Cbc0010I After 4945000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (536.40 seconds)\n", + "Cbc0010I After 4946000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (536.53 seconds)\n", + "Cbc0010I After 4947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (536.68 seconds)\n", + "Cbc0010I After 4948000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (536.79 seconds)\n", + "Cbc0010I After 4949000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (536.89 seconds)\n", + "Cbc0010I After 4950000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (536.97 seconds)\n", + "Cbc0010I After 4951000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (537.16 seconds)\n", + "Cbc0010I After 4952000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (537.28 seconds)\n", + "Cbc0010I After 4953000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (537.39 seconds)\n", + "Cbc0010I After 4954000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (537.52 seconds)\n", + "Cbc0010I After 4955000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (537.69 seconds)\n", + "Cbc0010I After 4956000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (537.84 seconds)\n", + "Cbc0010I After 4957000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (537.92 seconds)\n", + "Cbc0010I After 4958000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (538.03 seconds)\n", + "Cbc0010I After 4959000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (538.15 seconds)\n", + "Cbc0010I After 4960000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (538.28 seconds)\n", + "Cbc0010I After 4961000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (538.35 seconds)\n", + "Cbc0010I After 4962000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (538.44 seconds)\n", + "Cbc0010I After 4963000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (538.51 seconds)\n", + "Cbc0010I After 4964000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (538.57 seconds)\n", + "Cbc0010I After 4965000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (538.65 seconds)\n", + "Cbc0010I After 4966000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (538.77 seconds)\n", + "Cbc0010I After 4967000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (538.89 seconds)\n", + "Cbc0010I After 4968000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (539.03 seconds)\n", + "Cbc0010I After 4969000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (539.12 seconds)\n", + "Cbc0010I After 4970000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (539.19 seconds)\n", + "Cbc0010I After 4971000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (539.26 seconds)\n", + "Cbc0010I After 4972000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (539.35 seconds)\n", + "Cbc0010I After 4973000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (539.46 seconds)\n", + "Cbc0010I After 4974000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (539.53 seconds)\n", + "Cbc0010I After 4975000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (539.60 seconds)\n", + "Cbc0010I After 4976000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (539.67 seconds)\n", + "Cbc0010I After 4977000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (539.76 seconds)\n", + "Cbc0010I After 4978000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (539.82 seconds)\n", + "Cbc0010I After 4979000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (539.89 seconds)\n", + "Cbc0010I After 4980000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (+50 best solution, best possible 0 (296.49 seconds)\n", + "Cbc0010I After 1902000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (296.62 seconds)\n", + "Cbc0010I After 1903000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (296.82 seconds)\n", + "Cbc0010I After 1904000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (296.99 seconds)\n", + "Cbc0010I After 1905000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (297.16 seconds)\n", + "Cbc0010I After 1906000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (297.31 seconds)\n", + "Cbc0010I After 1907000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (297.48 seconds)\n", + "Cbc0010I After 1908000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (297.67 seconds)\n", + "Cbc0010I After 1909000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (297.81 seconds)\n", + "Cbc0010I After 1910000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (297.92 seconds)\n", + "Cbc0010I After 1911000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (298.03 seconds)\n", + "Cbc0010I After 1912000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (298.13 seconds)\n", + "Cbc0010I After 1913000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (298.24 seconds)\n", + "Cbc0010I After 1914000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (298.33 seconds)\n", + "Cbc0010I After 1915000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (298.42 seconds)\n", + "Cbc0010I After 1916000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (298.51 seconds)\n", + "Cbc0010I After 1917000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (298.62 seconds)\n", + "Cbc0010I After 1918000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (298.74 seconds)\n", + "Cbc0010I After 1919000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (298.83 seconds)\n", + "Cbc0010I After 1920000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (298.95 seconds)\n", + "Cbc0010I After 1921000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (299.05 seconds)\n", + "Cbc0010I After 1922000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (299.17 seconds)\n", + "Cbc0010I After 1923000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (299.31 seconds)\n", + "Cbc0010I After 1924000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (299.44 seconds)\n", + "Cbc0010I After 1925000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (299.57 seconds)\n", + "Cbc0010I After 1926000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (299.76 seconds)\n", + "Cbc0010I After 1927000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (299.96 seconds)\n", + "Cbc0010I After 1928000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (300.16 seconds)\n", + "Cbc0010I After 1929000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (300.30 seconds)\n", + "Cbc0010I After 1930000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (300.41 seconds)\n", + "Cbc0010I After 1931000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (300.52 seconds)\n", + "Cbc0010I After 1932000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (300.58 seconds)\n", + "Cbc0010I After 1933000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (300.67 seconds)\n", + "Cbc0010I After 1934000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (300.75 seconds)\n", + "Cbc0010I After 1935000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (300.87 seconds)\n", + "Cbc0010I After 1936000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (300.98 seconds)\n", + "Cbc0010I After 1937000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (301.10 seconds)\n", + "Cbc0010I After 1938000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (301.20 seconds)\n", + "Cbc0010I After 1939000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (301.30 seconds)\n", + "Cbc0010I After 1940000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (301.40 seconds)\n", + "Cbc0010I After 1941000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (301.50 seconds)\n", + "Cbc0010I After 1942000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (301.59 seconds)\n", + "Cbc0010I After 1943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 539.99 seconds)\n", + "Cbc0010I After 4981000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (540.09 seconds)\n", + "Cbc0010I After 4982000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (540.20 seconds)\n", + "Cbc0010I After 4983000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (540.32 seconds)\n", + "Cbc0010I After 4984000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (540.42 seconds)\n", + "Cbc0010I After 4985000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (540.58 seconds)\n", + "Cbc0010I After 4986000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (540.70 seconds)\n", + "Cbc0010I After 4987000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (540.79 seconds)\n", + "Cbc0010I After 4988000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (540.83 seconds)\n", + "Cbc0010I After 4989000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (540.92 seconds)\n", + "Cbc0010I After 4990000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (540.99 seconds)\n", + "Cbc0010I After 4991000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (541.08 seconds)\n", + "Cbc0010I After 4992000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (541.15 seconds)\n", + "Cbc0010I After 4993000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (541.20 seconds)\n", + "Cbc0010I After 4994000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (541.27 seconds)\n", + "Cbc0010I After 4995000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (541.34 seconds)\n", + "Cbc0010I After 4996000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (541.49 seconds)\n", + "Cbc0010I After 4997000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (541.57 seconds)\n", + "Cbc0010I After 4998000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (541.66 seconds)\n", + "Cbc0010I After 4999000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (541.74 seconds)\n", + "Cbc0010I After 5000000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (541.80 seconds)\n", + "Cbc0010I After 5001000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (541.89 seconds)\n", + "Cbc0010I After 5002000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (541.95 seconds)\n", + "Cbc0010I After 5003000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (542.03 seconds)\n", + "Cbc0010I After 5004000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (542.09 seconds)\n", + "Cbc0010I After 5005000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (542.17 seconds)\n", + "Cbc0010I After 5006000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (542.25 seconds)\n", + "Cbc0010I After 5007000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (542.34 seconds)\n", + "Cbc0010I After 5008000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (542.42 seconds)\n", + "Cbc0010I After 5009000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.50 seconds)\n", + "Cbc0010I After 5010000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.60 seconds)\n", + "Cbc0010I After 5011000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (542.72 seconds)\n", + "Cbc0010I After 5012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.83 seconds)\n", + "Cbc0010I After 5013000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (542.93 seconds)\n", + "Cbc0010I After 5014000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (543.00 seconds)\n", + "Cbc0010I After 5015000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (543.10 seconds)\n", + "Cbc0010I After 5016000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (543.16 seconds)\n", + "Cbc0010I After 5017000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (543.22 seconds)\n", + "Cbc0010I After 5018000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (543.29 seconds)\n", + "Cbc0010I After 5019000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (543.34 seconds)\n", + "Cbc0010I After 5020000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (543.41 seconds)\n", + "Cbc0010I After 5021000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (543.52 seconds)\n", + "Cbc0010I After 5022000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (543.68 seconds)\n", + "Cbc0010I After(301.70 seconds)\n", + "Cbc0010I After 1944000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (301.81 seconds)\n", + "Cbc0010I After 1945000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (301.94 seconds)\n", + "Cbc0010I After 1946000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (302.05 seconds)\n", + "Cbc0010I After 1947000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (302.17 seconds)\n", + "Cbc0010I After 1948000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (302.30 seconds)\n", + "Cbc0010I After 1949000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (302.41 seconds)\n", + "Cbc0010I After 1950000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (302.52 seconds)\n", + "Cbc0010I After 1951000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (302.63 seconds)\n", + "Cbc0010I After 1952000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (302.72 seconds)\n", + "Cbc0010I After 1953000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (302.80 seconds)\n", + "Cbc0010I After 1954000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (302.89 seconds)\n", + "Cbc0010I After 1955000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (303.03 seconds)\n", + "Cbc0010I After 1956000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (303.19 seconds)\n", + "Cbc0010I After 1957000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (303.35 seconds)\n", + "Cbc0010I After 1958000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (303.50 seconds)\n", + "Cbc0010I After 1959000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (303.69 seconds)\n", + "Cbc0010I After 1960000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (303.82 seconds)\n", + "Cbc0010I After 1961000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (304.04 seconds)\n", + "Cbc0010I After 1962000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (304.31 seconds)\n", + "Cbc0010I After 1963000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (304.59 seconds)\n", + "Cbc0010I After 1964000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (304.94 seconds)\n", + "Cbc0010I After 1965000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (305.19 seconds)\n", + "Cbc0010I After 1966000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (305.41 seconds)\n", + "Cbc0010I After 1967000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (305.68 seconds)\n", + "Cbc0010I After 1968000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (305.94 seconds)\n", + "Cbc0010I After 1969000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (306.32 seconds)\n", + "Cbc0010I After 1970000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (306.62 seconds)\n", + "Cbc0010I After 1971000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (306.90 seconds)\n", + "Cbc0010I After 1972000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (307.21 seconds)\n", + "Cbc0010I After 1973000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (307.57 seconds)\n", + "Cbc0010I After 1974000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (307.87 seconds)\n", + "Cbc0010I After 1975000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (308.23 seconds)\n", + "Cbc0010I After 1976000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (308.48 seconds)\n", + "Cbc0010I After 1977000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (308.74 seconds)\n", + "Cbc0010I After 1978000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (309.08 seconds)\n", + "Cbc0010I After 1979000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (309.39 seconds)\n", + "Cbc0010I After 1980000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (309.72 seconds)\n", + "Cbc0010I After 1981000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (309.98 seconds)\n", + "Cbc0010I After 1982000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (310.29 seconds)\n", + "Cbc0010I After 1983000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (310.54 seconds)\n", + "Cbc0010I After 1984000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (310.82 seconds)\n", + "Cbc0010I After 1985000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (311.15 seconds)\n", + "Cbc0010I Af 5023000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (543.86 seconds)\n", + "Cbc0010I After 5024000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (543.98 seconds)\n", + "Cbc0010I After 5025000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (544.08 seconds)\n", + "Cbc0010I After 5026000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (544.22 seconds)\n", + "Cbc0010I After 5027000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (544.36 seconds)\n", + "Cbc0010I After 5028000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (544.53 seconds)\n", + "Cbc0010I After 5029000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (544.74 seconds)\n", + "Cbc0010I After 5030000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (545.00 seconds)\n", + "Cbc0010I After 5031000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (545.23 seconds)\n", + "Cbc0010I After 5032000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (545.49 seconds)\n", + "Cbc0010I After 5033000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (545.61 seconds)\n", + "Cbc0010I After 5034000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (545.76 seconds)\n", + "Cbc0010I After 5035000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (545.96 seconds)\n", + "Cbc0010I After 5036000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (546.17 seconds)\n", + "Cbc0010I After 5037000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (546.38 seconds)\n", + "Cbc0010I After 5038000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (546.73 seconds)\n", + "Cbc0010I After 5039000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (546.97 seconds)\n", + "Cbc0010I After 5040000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (547.23 seconds)\n", + "Cbc0010I After 5041000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (547.44 seconds)\n", + "Cbc0010I After 5042000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (547.62 seconds)\n", + "Cbc0010I After 5043000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (547.92 seconds)\n", + "Cbc0010I After 5044000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (548.25 seconds)\n", + "Cbc0010I After 5045000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (548.49 seconds)\n", + "Cbc0010I After 5046000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (548.73 seconds)\n", + "Cbc0010I After 5047000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (548.94 seconds)\n", + "Cbc0010I After 5048000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (549.16 seconds)\n", + "Cbc0010I After 5049000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (549.32 seconds)\n", + "Cbc0010I After 5050000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (549.55 seconds)\n", + "Cbc0010I After 5051000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (549.96 seconds)\n", + "Cbc0010I After 5052000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (550.18 seconds)\n", + "Cbc0010I After 5053000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (550.38 seconds)\n", + "Cbc0010I After 5054000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (550.59 seconds)\n", + "Cbc0010I After 5055000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (550.76 seconds)\n", + "Cbc0010I After 5056000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (550.91 seconds)\n", + "Cbc0010I After 5057000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (551.16 seconds)\n", + "Cbc0010I After 5058000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (551.47 seconds)\n", + "Cbc0010I After 5059000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (551.72 seconds)\n", + "Cbc0010I After 5060000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (552.24 seconds)\n", + "Cbc0010I After 5061000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (552.58 seconds)\n", + "Cbc0010I After 5062000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (552.75 seconds)\n", + "Cbc0010I After 5063000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (552.97 seconds)\n", + "Cbc0010I After 5064000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (553.13 seconds)\n", + "Cbc0010I After 5065000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (553.41 seconds)\n", + "Cbc0010I After 5066000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (553.57 seconds)\n", + "Cbc0010I After 5067000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (553.76 seconds)\n", + "Cbc0010I After 5068000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (553.97 seconds)\n", + "Cbc0010I After 5069000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (554.32 seconds)\n", + "Cbc0010I After 5070000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (554.61 seconds)\n", + "Cbc0010I After 5071000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (554.86 seconds)\n", + "Cbc0010I After 5072000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (555.17 seconds)\n", + "Cbc0010I After 5073000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (555.50 seconds)\n", + "Cbc0010I After 5074000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (555.64 seconds)\n", + "Cbc0010I After 5075000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (555.78 seconds)\n", + "Cbc0010I After 5076000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (555.90 seconds)\n", + "Cbc0010I After 5077000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (556.08 seconds)\n", + "Cbc0010I After 5078000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (556.21 seconds)\n", + "Cbc0010I After 5079000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (556.41 seconds)\n", + "Cbc0010I After 5080000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (556.51 seconds)\n", + "Cbc0010I After 5081000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (556.59 seconds)\n", + "Cbc0010I After 5082000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (556.71 seconds)\n", + "Cbc0010I After 5083000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (556.82 seconds)\n", + "Cbc0010I After 5084000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (556.89 seconds)\n", + "Cbc0010I After 5085000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (557.01 seconds)\n", + "Cbc0010I After 5086000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (557.15 seconds)\n", + "Cbc0010I After 5087000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (557.36 seconds)\n", + "Cbc0010I After 5088000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (557.50 seconds)\n", + "Cbc0010I After 5089000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (557.62 seconds)\n", + "Cbc0010I After 5090000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (557.85 seconds)\n", + "Cbc0010I After 5091000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (557.98 seconds)\n", + "Cbc0010I After 5092000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (558.12 seconds)\n", + "Cbc0010I After 5093000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (558.23 seconds)\n", + "Cbc0010I After 5094000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (558.34 seconds)\n", + "Cbc0010I After 5095000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (558.54 seconds)\n", + "Cbc0010I After 5096000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (558.66 seconds)\n", + "Cbc0010I After 5097000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (558.82 seconds)\n", + "Cbc0010I After 5098000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (558.93 seconds)\n", + "Cbc0010I After 5099000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (559.05 seconds)\n", + "Cbc0010I After 5100000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (559.16 seconds)\n", + "Cbc0010I After 5101000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (559.27 seconds)\n", + "Cbc0010I After 5102000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (559.38 seconds)\n", + "Cbc0010I After 5103000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (559.50 seconds)\n", + "Cbc0010I After 5104000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (559.59 seconds)\n", + "Cbc0010I After 5105000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (559.71 seconds)\n", + "Cbc0010I After 5106000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (559.83 seconds)\n", + "Cbc0010I After 5107000 nodes, 123 on tree, 1e+50 best solution, best pter 1986000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (311.48 seconds)\n", + "Cbc0010I After 1987000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (311.83 seconds)\n", + "Cbc0010I After 1988000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (312.16 seconds)\n", + "Cbc0010I After 1989000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (312.51 seconds)\n", + "Cbc0010I After 1990000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (312.75 seconds)\n", + "Cbc0010I After 1991000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (313.06 seconds)\n", + "Cbc0010I After 1992000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (313.28 seconds)\n", + "Cbc0010I After 1993000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (313.50 seconds)\n", + "Cbc0010I After 1994000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (313.75 seconds)\n", + "Cbc0010I After 1995000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (314.00 seconds)\n", + "Cbc0010I After 1996000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (314.21 seconds)\n", + "Cbc0010I After 1997000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (314.39 seconds)\n", + "Cbc0010I After 1998000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (314.68 seconds)\n", + "Cbc0010I After 1999000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (314.94 seconds)\n", + "Cbc0010I After 2000000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (315.14 seconds)\n", + "Cbc0010I After 2001000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (315.42 seconds)\n", + "Cbc0010I After 2002000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (315.64 seconds)\n", + "Cbc0010I After 2003000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (315.82 seconds)\n", + "Cbc0010I After 2004000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (316.02 seconds)\n", + "Cbc0010I After 2005000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (316.14 seconds)\n", + "Cbc0010I After 2006000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (316.27 seconds)\n", + "Cbc0010I After 2007000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (316.45 seconds)\n", + "Cbc0010I After 2008000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (316.62 seconds)\n", + "Cbc0010I After 2009000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (316.78 seconds)\n", + "Cbc0010I After 2010000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (317.01 seconds)\n", + "Cbc0010I After 2011000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (317.22 seconds)\n", + "Cbc0010I After 2012000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (317.50 seconds)\n", + "Cbc0010I After 2013000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.72 seconds)\n", + "Cbc0010I After 2014000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (317.85 seconds)\n", + "Cbc0010I After 2015000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (318.04 seconds)\n", + "Cbc0010I After 2016000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (318.21 seconds)\n", + "Cbc0010I After 2017000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (318.45 seconds)\n", + "Cbc0010I After 2018000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (318.69 seconds)\n", + "Cbc0010I After 2019000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (318.90 seconds)\n", + "Cbc0010I After 2020000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (319.08 seconds)\n", + "Cbc0010I After 2021000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (319.22 seconds)\n", + "Cbc0010I After 2022000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (319.40 seconds)\n", + "Cbc0010I After 2023000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (319.57 seconds)\n", + "Cbc0010I After 2024000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (319.75 seconds)\n", + "Cbc0010I After 2025000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (319.90 seconds)\n", + "Cbc0010I After 2026000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (320.03 seconds)\n", + "Cbc0010I After 2027000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (320.17 seconds)\n", + "Cbc0010I After 2028000 nodes, 78 on tree, 1e+50 best solossible 0 (559.96 seconds)\n", + "Cbc0010I After 5108000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (560.10 seconds)\n", + "Cbc0010I After 5109000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (560.23 seconds)\n", + "Cbc0010I After 5110000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (560.38 seconds)\n", + "Cbc0010I After 5111000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (560.46 seconds)\n", + "Cbc0010I After 5112000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (560.58 seconds)\n", + "Cbc0010I After 5113000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (560.70 seconds)\n", + "Cbc0010I After 5114000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (560.78 seconds)\n", + "Cbc0010I After 5115000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (560.87 seconds)\n", + "Cbc0010I After 5116000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (560.94 seconds)\n", + "Cbc0010I After 5117000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (561.06 seconds)\n", + "Cbc0010I After 5118000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (561.14 seconds)\n", + "Cbc0010I After 5119000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (561.23 seconds)\n", + "Cbc0010I After 5120000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (561.33 seconds)\n", + "Cbc0010I After 5121000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (561.44 seconds)\n", + "Cbc0010I After 5122000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (561.56 seconds)\n", + "Cbc0010I After 5123000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (561.76 seconds)\n", + "Cbc0010I After 5124000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (561.95 seconds)\n", + "Cbc0010I After 5125000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (562.06 seconds)\n", + "Cbc0010I After 5126000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (562.27 seconds)\n", + "Cbc0010I After 5127000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (562.41 seconds)\n", + "Cbc0010I After 5128000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (562.55 seconds)\n", + "Cbc0010I After 5129000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (562.65 seconds)\n", + "Cbc0010I After 5130000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (562.76 seconds)\n", + "Cbc0010I After 5131000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (562.89 seconds)\n", + "Cbc0010I After 5132000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (562.97 seconds)\n", + "Cbc0010I After 5133000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (563.06 seconds)\n", + "Cbc0010I After 5134000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (563.15 seconds)\n", + "Cbc0010I After 5135000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (563.23 seconds)\n", + "Cbc0010I After 5136000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (563.32 seconds)\n", + "Cbc0010I After 5137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (563.40 seconds)\n", + "Cbc0010I After 5138000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (563.46 seconds)\n", + "Cbc0010I After 5139000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (563.52 seconds)\n", + "Cbc0010I After 5140000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (563.59 seconds)\n", + "Cbc0010I After 5141000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (563.68 seconds)\n", + "Cbc0010I After 5142000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (563.80 seconds)\n", + "Cbc0010I After 5143000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (563.93 seconds)\n", + "Cbc0010I After 5144000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (564.01 seconds)\n", + "Cbc0010I After 5145000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (564.08 seconds)\n", + "Cbc0010I After 5146000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (564.15 seconds)\n", + "Cbc0010I After 5147000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (564.21 seconds)\n", + "Cbc0010I After 5148000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (564.31 seconds)\n", + "Cbc0010I After 5149000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (564.40 seconds)\n", + "Cbc0ution, best possible 0 (320.27 seconds)\n", + "Cbc0010I After 2029000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (320.43 seconds)\n", + "Cbc0010I After 2030000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (320.59 seconds)\n", + "Cbc0010I After 2031000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (320.73 seconds)\n", + "Cbc0010I After 2032000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (320.86 seconds)\n", + "Cbc0010I After 2033000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (321.04 seconds)\n", + "Cbc0010I After 2034000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (321.35 seconds)\n", + "Cbc0010I After 2035000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (321.70 seconds)\n", + "Cbc0010I After 2036000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (321.99 seconds)\n", + "Cbc0010I After 2037000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (322.24 seconds)\n", + "Cbc0010I After 2038000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (322.41 seconds)\n", + "Cbc0010I After 2039000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (322.51 seconds)\n", + "Cbc0010I After 2040000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (322.60 seconds)\n", + "Cbc0010I After 2041000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (322.69 seconds)\n", + "Cbc0010I After 2042000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (322.82 seconds)\n", + "Cbc0010I After 2043000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (322.97 seconds)\n", + "Cbc0010I After 2044000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (323.12 seconds)\n", + "Cbc0010I After 2045000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (323.35 seconds)\n", + "Cbc0010I After 2046000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (323.53 seconds)\n", + "Cbc0010I After 2047000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (323.67 seconds)\n", + "Cbc0010I After 2048000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (323.75 seconds)\n", + "Cbc0010I After 2049000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (323.83 seconds)\n", + "Cbc0010I After 2050000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (323.90 seconds)\n", + "Cbc0010I After 2051000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (324.00 seconds)\n", + "Cbc0010I After 2052000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (324.09 seconds)\n", + "Cbc0010I After 2053000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (324.16 seconds)\n", + "Cbc0010I After 2054000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (324.26 seconds)\n", + "Cbc0010I After 2055000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (324.36 seconds)\n", + "Cbc0010I After 2056000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (324.51 seconds)\n", + "Cbc0010I After 2057000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (324.67 seconds)\n", + "Cbc0010I After 2058000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (324.81 seconds)\n", + "Cbc0010I After 2059000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (324.95 seconds)\n", + "Cbc0010I After 2060000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (325.11 seconds)\n", + "Cbc0010I After 2061000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (325.25 seconds)\n", + "Cbc0010I After 2062000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (325.36 seconds)\n", + "Cbc0010I After 2063000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (325.45 seconds)\n", + "Cbc0010I After 2064000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (325.52 seconds)\n", + "Cbc0010I After 2065000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (325.60 seconds)\n", + "Cbc0010I After 2066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (325.69 seconds)\n", + "Cbc0010I After 2067000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (325.81 seconds)\n", + "Cbc0010I After 2068000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (325.93 seconds)\n", + "Cbc0010I After 2069000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (326.07 seconds)\n", + "Cbc0010I After 2070000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (326.25 seconds)\n", + "Cbc0010I After 2071000 n010I After 5150000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (564.48 seconds)\n", + "Cbc0010I After 5151000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (564.55 seconds)\n", + "Cbc0010I After 5152000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (564.62 seconds)\n", + "Cbc0010I After 5153000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (564.70 seconds)\n", + "Cbc0010I After 5154000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (564.79 seconds)\n", + "Cbc0010I After 5155000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (564.85 seconds)\n", + "Cbc0010I After 5156000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (564.90 seconds)\n", + "Cbc0010I After 5157000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (564.97 seconds)\n", + "Cbc0010I After 5158000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (565.06 seconds)\n", + "Cbc0010I After 5159000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (565.15 seconds)\n", + "Cbc0010I After 5160000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (565.22 seconds)\n", + "Cbc0010I After 5161000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (565.28 seconds)\n", + "Cbc0010I After 5162000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (565.35 seconds)\n", + "Cbc0010I After 5163000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (565.41 seconds)\n", + "Cbc0010I After 5164000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (565.48 seconds)\n", + "Cbc0010I After 5165000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (565.57 seconds)\n", + "Cbc0010I After 5166000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (565.66 seconds)\n", + "Cbc0010I After 5167000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (565.74 seconds)\n", + "Cbc0010I After 5168000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (565.82 seconds)\n", + "Cbc0010I After 5169000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (565.89 seconds)\n", + "Cbc0010I After 5170000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (565.99 seconds)\n", + "Cbc0010I After 5171000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (566.05 seconds)\n", + "Cbc0010I After 5172000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (566.14 seconds)\n", + "Cbc0010I After 5173000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (566.22 seconds)\n", + "Cbc0010I After 5174000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (566.31 seconds)\n", + "Cbc0010I After 5175000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (566.39 seconds)\n", + "Cbc0010I After 5176000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (566.46 seconds)\n", + "Cbc0010I After 5177000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (566.52 seconds)\n", + "Cbc0010I After 5178000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (566.59 seconds)\n", + "Cbc0010I After 5179000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (566.67 seconds)\n", + "Cbc0010I After 5180000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (566.78 seconds)\n", + "Cbc0010I After 5181000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (566.90 seconds)\n", + "Cbc0010I After 5182000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (566.97 seconds)\n", + "Cbc0010I After 5183000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (567.03 seconds)\n", + "Cbc0010I After 5184000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (567.11 seconds)\n", + "Cbc0010I After 5185000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (567.21 seconds)\n", + "Cbc0010I After 5186000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (567.28 seconds)\n", + "Cbc0010I After 5187000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (567.33 seconds)\n", + "Cbc0010I After 5188000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (567.38 seconds)\n", + "Cbc0010I After 5189000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (567.46 seconds)\n", + "Cbc0010I After 5190000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (567.51 seconds)\n", + "Cbc0010I After 5191000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (567.56 seconds)\n", + "Cbc0010I After 5192000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (567.62 seconds)\n", + "Cbc0010I After 5193000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (567.68 seconds)\n", + "Cbc0010I After 5194000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (567.74 seconds)\n", + "Cbc0010I After 5195000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (567.80 seconds)\n", + "Cbc0010I After 5196000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (567.89 seconds)\n", + "Cbc0010I After 5197000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (567.99 seconds)\n", + "Cbc0010I After 5198000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (568.06 seconds)\n", + "Cbc0010I After 5199000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (568.13 seconds)\n", + "Cbc0010I After 5200000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (568.20 seconds)\n", + "Cbc0010I After 5201000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (568.26 seconds)\n", + "Cbc0010I After 5202000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (568.33 seconds)\n", + "Cbc0010I After 5203000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (568.40 seconds)\n", + "Cbc0010I After 5204000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (568.52 seconds)\n", + "Cbc0010I After 5205000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (568.70 seconds)\n", + "Cbc0010I After 5206000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (568.82 seconds)\n", + "Cbc0010I After 5207000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (569.08 seconds)\n", + "Cbc0010I After 5208000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (569.38 seconds)\n", + "Cbc0010I After 5209000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (569.52 seconds)\n", + "Cbc0010I After 5210000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (569.65 seconds)\n", + "Cbc0010I After 5211000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (569.87 seconds)\n", + "Cbc0010I After 5212000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (570.01 seconds)\n", + "Cbc0010I After 5213000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (570.10 seconds)\n", + "Cbc0010I After 5214000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (570.18 seconds)\n", + "Cbc0010I After 5215000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (570.32 seconds)\n", + "Cbc0010I After 5216000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (570.46 seconds)\n", + "Cbc0010I After 5217000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (570.60 seconds)\n", + "Cbc0010I After 5218000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (570.77 seconds)\n", + "Cbc0010I After 5219000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (570.89 seconds)\n", + "Cbc0010I After 5220000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (571.03 seconds)\n", + "Cbc0010I After 5221000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (571.10 seconds)\n", + "Cbc0010I After 5222000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (571.16 seconds)\n", + "Cbc0010I After 5223000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (571.21 seconds)\n", + "Cbc0010I After 5224000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (571.28 seconds)\n", + "Cbc0010I After 5225000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (571.38 seconds)\n", + "Cbc0010I After 5226000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (571.46 seconds)\n", + "Cbc0010I After 5227000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (571.54 seconds)\n", + "Cbc0010I After 5228000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (571.60 seconds)\n", + "Cbc0010I After 5229000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (571.67 seconds)\n", + "Cbc0010I After 5230000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (571.75 seconds)\n", + "Cbc0010I After 5231000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (571.84 seconds)\n", + "Cbc0010I After 5232000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (571.92 seconds)\n", + "Cbc0010I After 5233000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (572.00 seconds)\n", + "Cbc0010I After 5234000 nodes, 164 on tree, 1e+50 best solution, odes, 57 on tree, 1e+50 best solution, best possible 0 (326.46 seconds)\n", + "Cbc0010I After 2072000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (326.63 seconds)\n", + "Cbc0010I After 2073000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (326.80 seconds)\n", + "Cbc0010I After 2074000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (326.95 seconds)\n", + "Cbc0010I After 2075000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (327.08 seconds)\n", + "Cbc0010I After 2076000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (327.20 seconds)\n", + "Cbc0010I After 2077000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (327.28 seconds)\n", + "Cbc0010I After 2078000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (327.36 seconds)\n", + "Cbc0010I After 2079000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (327.49 seconds)\n", + "Cbc0010I After 2080000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (327.58 seconds)\n", + "Cbc0010I After 2081000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (327.65 seconds)\n", + "Cbc0010I After 2082000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (327.73 seconds)\n", + "Cbc0010I After 2083000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (327.83 seconds)\n", + "Cbc0010I After 2084000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (328.00 seconds)\n", + "Cbc0010I After 2085000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (328.24 seconds)\n", + "Cbc0010I After 2086000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (328.46 seconds)\n", + "Cbc0010I After 2087000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (328.79 seconds)\n", + "Cbc0010I After 2088000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (329.12 seconds)\n", + "Cbc0010I After 2089000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (329.41 seconds)\n", + "Cbc0010I After 2090000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (329.63 seconds)\n", + "Cbc0010I After 2091000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (329.84 seconds)\n", + "Cbc0010I After 2092000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (329.96 seconds)\n", + "Cbc0010I After 2093000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (330.04 seconds)\n", + "Cbc0010I After 2094000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (330.14 seconds)\n", + "Cbc0010I After 2095000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (330.28 seconds)\n", + "Cbc0010I After 2096000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (330.39 seconds)\n", + "Cbc0010I After 2097000 nodes, 20 on tree, 1e+50 best solution, best possible 0 (330.50 seconds)\n", + "Cbc0010I After 2098000 nodes, 20 on tree, 1e+50 best solution, best possible 0 (330.63 seconds)\n", + "Cbc0010I After 2099000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (330.70 seconds)\n", + "Cbc0010I After 2100000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (330.79 seconds)\n", + "Cbc0010I After 2101000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (330.88 seconds)\n", + "Cbc0010I After 2102000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (330.98 seconds)\n", + "Cbc0010I After 2103000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (331.08 seconds)\n", + "Cbc0010I After 2104000 nodes, 11 on tree, 1e+50 best solution, best possible 0 (331.15 seconds)\n", + "Cbc0010I After 2105000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (331.23 seconds)\n", + "Cbc0010I After 2106000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (331.32 seconds)\n", + "Cbc0010I After 2107000 nodes, 10 on tree, 1e+50 best solution, best possible 0 (331.40 seconds)\n", + "Cbc0010I After 2108000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (331.55 seconds)\n", + "Cbc0010I After 2109000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (331.72 seconds)\n", + "Cbc0010I After 2110000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (332.00 seconds)\n", + "Cbc0010I After 2111000 nodes, 9 on tree, 1e+50 best solution, best possible 0 (332.19 seconds)\n", + "Cbc0010I After 2112000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (332.35 seconds)\n", + "Cbc0010I After 2113000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (332.48 seconds)\n", + "Cbc0010I After 2114000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (332.61 seconds)\n", + "Cbc0010I After 2115000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (332.78 seconds)\n", + "Cbc0010I After 2116000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (332.96 seconds)\n", + "Cbc0010I After 2117000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (333.18 seconds)\n", + "Cbc0010I After 2118000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (333.39 seconds)\n", + "Cbc0010I After 2119000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (333.55 seconds)\n", + "Cbc0010I After 2120000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (333.73 seconds)\n", + "Cbc0010I After 2121000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (333.83 seconds)\n", + "Cbc0010I After 2122000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (333.94 seconds)\n", + "Cbc0010I After 2123000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (334.04 seconds)\n", + "Cbc0010I After 2124000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (334.15 seconds)\n", + "Cbc0010I After 2125000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (334.26 seconds)\n", + "Cbc0010I After 2126000 nodes, 21 on tree, 1e+50 best solution, best possible 0 (334.39 seconds)\n", + "Cbc0010I After 2127000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (334.59 seconds)\n", + "Cbc0010I After 2128000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (334.75 seconds)\n", + "Cbc0010I After 2129000 nodes, 9 on tree, 1e+50 best solution, best possible 0 (334.93 seconds)\n", + "Cbc0010I After 2130000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (335.13 seconds)\n", + "Cbc0001I Search completed - best objective 1e+50, took 9555165 iterations and 3650102 nodes (335.33 seconds)\n", + "Cbc0032I Strong branching done 3028270 times (3779559 iterations), fathomed 496152 nodes and fixed 312940 variables\n", + "Cbc0041I Maximum depth 428, 0 variables fixed on reduced cost (complete fathoming 894 times, 1519270 nodes taking 1947066 iterations)\n", + "Cuts at root node changed objective from 0 to 0\n", + "Probing was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 26 times and created 42 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 26 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "\n", + "Result - Problem proven infeasible\n", + "\n", + "No feasible solution found\n", + "Enumerated nodes: 3650102\n", + "Total iterations: 9555165\n", + "Time (CPU seconds): 335.04\n", + "Time (Wallclock seconds): 335.33\n", + "\n", + "Option for printingOptions changed from normal to all\n", + "Total time (CPU seconds): 335.04 (Wallclock seconds): 335.33\n", + "\n", + "best possible 0 (572.06 seconds)\n", + "Cbc0010I After 5235000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (572.17 seconds)\n", + "Cbc0010I After 5236000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (572.24 seconds)\n", + "Cbc0010I After 5237000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (572.34 seconds)\n", + "Cbc0010I After 5238000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (572.51 seconds)\n", + "Cbc0010I After 5239000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (572.59 seconds)\n", + "Cbc0010I After 5240000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (572.69 seconds)\n", + "Cbc0010I After 5241000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (572.77 seconds)\n", + "Cbc0010I After 5242000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (572.86 seconds)\n", + "Cbc0010I After 5243000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (572.95 seconds)\n", + "Cbc0010I After 5244000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (573.01 seconds)\n", + "Cbc0010I After 5245000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (573.07 seconds)\n", + "Cbc0010I After 5246000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (573.14 seconds)\n", + "Cbc0010I After 5247000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (573.21 seconds)\n", + "Cbc0010I After 5248000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (573.30 seconds)\n", + "Cbc0010I After 5249000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (573.44 seconds)\n", + "Cbc0010I After 5250000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (573.53 seconds)\n", + "Cbc0010I After 5251000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (573.64 seconds)\n", + "Cbc0010I After 5252000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (573.75 seconds)\n", + "Cbc0010I After 5253000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (573.85 seconds)\n", + "Cbc0010I After 5254000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (573.95 seconds)\n", + "Cbc0010I After 5255000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (574.06 seconds)\n", + "Cbc0010I After 5256000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (574.19 seconds)\n", + "Cbc0010I After 5257000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (574.30 seconds)\n", + "Cbc0010I After 5258000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (574.41 seconds)\n", + "Cbc0010I After 5259000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (574.49 seconds)\n", + "Cbc0010I After 5260000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (574.60 seconds)\n", + "Cbc0010I After 5261000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (574.67 seconds)\n", + "Cbc0010I After 5262000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (574.79 seconds)\n", + "Cbc0010I After 5263000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (574.91 seconds)\n", + "Cbc0010I After 5264000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (575.06 seconds)\n", + "Cbc0010I After 5265000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (575.19 seconds)\n", + "Cbc0010I After 5266000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (575.32 seconds)\n", + "Cbc0010I After 5267000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (575.44 seconds)\n", + "Cbc0010I After 5268000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (575.55 seconds)\n", + "Cbc0010I After 5269000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (575.68 seconds)\n", + "Cbc0010I After 5270000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (575.79 seconds)\n", + "Cbc0010I After 5271000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (575.89 seconds)\n", + "Cbc0010I After 5272000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (576.02 seconds)\n", + "Cbc0010I After 5273000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (576.16 seconds)\n", + "Cbc0010I After 5274000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (576.24 seconds)\n", + "Cbc0010I After 5275000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (576.38 seconds)\n", + "Cbc0010I After 5276000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (576.53 seconds)\n", + "Cbc0010I After 5277000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (576.67 seconds)\n", + "Cbc0010I After 5278000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (576.79 seconds)\n", + "Cbc0010I After 5279000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (577.02 seconds)\n", + "Cbc0010I After 5280000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (577.14 seconds)\n", + "Cbc0010I After 5281000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (577.22 seconds)\n", + "Cbc0010I After 5282000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (577.30 seconds)\n", + "Cbc0010I After 5283000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (577.36 seconds)\n", + "Cbc0010I After 5284000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (577.44 seconds)\n", + "Cbc0010I After 5285000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (577.50 seconds)\n", + "Cbc0010I After 5286000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (577.56 seconds)\n", + "Cbc0010I After 5287000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (577.62 seconds)\n", + "Cbc0010I After 5288000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (577.67 seconds)\n", + "Cbc0010I After 5289000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (577.71 seconds)\n", + "Cbc0010I After 5290000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (577.77 seconds)\n", + "Cbc0010I After 5291000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (577.82 seconds)\n", + "Cbc0010I After 5292000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (577.86 seconds)\n", + "Cbc0010I After 5293000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (577.93 seconds)\n", + "Cbc0010I After 5294000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (577.99 seconds)\n", + "Cbc0010I After 5295000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (578.05 seconds)\n", + "Cbc0010I After 5296000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (578.11 seconds)\n", + "Cbc0010I After 5297000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (578.17 seconds)\n", + "Cbc0010I After 5298000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (578.24 seconds)\n", + "Cbc0010I After 5299000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (578.31 seconds)\n", + "Cbc0010I After 5300000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (578.37 seconds)\n", + "Cbc0010I After 5301000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (578.44 seconds)\n", + "Cbc0010I After 5302000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (578.52 seconds)\n", + "Cbc0010I After 5303000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (578.57 seconds)\n", + "Cbc0010I After 5304000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (578.62 seconds)\n", + "Cbc0010I After 5305000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (578.69 seconds)\n", + "Cbc0010I After 5306000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (578.75 seconds)\n", + "Cbc0010I After 5307000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (578.80 seconds)\n", + "Cbc0010I After 5308000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (578.87 seconds)\n", + "Cbc0010I After 5309000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (578.94 seconds)\n", + "Cbc0010I After 5310000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (579.02 seconds)\n", + "Cbc0010I After 5311000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (579.09 seconds)\n", + "Cbc0010I After 5312000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (579.18 seconds)\n", + "Cbc0010I After 5313000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (579.25 seconds)\n", + "Cbc0010I After 5314000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (579.34 seconds)\n", + "Cbc0010I After 5315000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (579.45 seconds)\n", + "Cbc0010I After 5316000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (579.56 seconds)\n", + "Cbc0010I After 5317000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (579.63 seconds)\n", + "Cbc0010I After 5318000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (579.68 seconds)\n", + "Cbc0010I After 5319000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (579.73 seconds)\n", + "Cbc0010I After 5320000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (579.81 seconds)\n", + "Cbc0010I After 5321000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (579.87 seconds)\n", + "Cbc0010I After 5322000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (579.92 seconds)\n", + "Cbc0010I After 5323000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (579.99 seconds)\n", + "Cbc0010I After 5324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (580.06 seconds)\n", + "Cbc0010I After 5325000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (580.14 seconds)\n", + "Cbc0010I After 5326000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (580.24 seconds)\n", + "Cbc0010I After 5327000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (580.31 seconds)\n", + "Cbc0010I After 5328000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (580.40 seconds)\n", + "Cbc0010I After 5329000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (580.54 seconds)\n", + "Cbc0010I After 5330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (580.70 seconds)\n", + "Cbc0010I After 5331000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (580.86 seconds)\n", + "Cbc0010I After 5332000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (581.00 seconds)\n", + "Cbc0010I After 5333000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (581.17 seconds)\n", + "Cbc0010I After 5334000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (581.29 seconds)\n", + "Cbc0010I After 5335000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (581.42 seconds)\n", + "Cbc0010I After 5336000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (581.55 seconds)\n", + "Cbc0010I After 5337000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (581.66 seconds)\n", + "Cbc0010I After 5338000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (581.75 seconds)\n", + "Cbc0010I After 5339000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (581.86 seconds)\n", + "Cbc0010I After 5340000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (581.97 seconds)\n", + "Cbc0010I After 5341000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (582.08 seconds)\n", + "Cbc0010I After 5342000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (582.17 seconds)\n", + "Cbc0010I After 5343000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (582.28 seconds)\n", + "Cbc0010I After 5344000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (582.39 seconds)\n", + "Cbc0010I After 5345000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (582.50 seconds)\n", + "Cbc0010I After 5346000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (582.62 seconds)\n", + "Cbc0010I After 5347000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (582.72 seconds)\n", + "Cbc0010I After 5348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (582.83 seconds)\n", + "Cbc0010I After 5349000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (583.00 seconds)\n", + "Cbc0010I After 5350000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (583.12 seconds)\n", + "Cbc0010I After 5351000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (583.19 seconds)\n", + "Cbc0010I After 5352000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (583.24 seconds)\n", + "Cbc0010I After 5353000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (583.29 seconds)\n", + "Cbc0010I After 5354000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (583.37 seconds)\n", + "Cbc0010I After 5355000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (583.46 seconds)\n", + "Cbc0010I After 5356000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (583.56 seconds)\n", + "Cbc0010I After 5357000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (583.64 seconds)\n", + "Cbc0010I After 5358000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (583.72 seconds)\n", + "Cbc0010I After 5359000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (583.80 seconds)\n", + "Cbc0010I After 5360000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (583.90 seconds)\n", + "Cbc0010I After 5361000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (584.00 seconds)\n", + "Cbc0010I After 5362000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (584.08 seconds)\n", + "Cbc0010I After 5363000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (584.16 seconds)\n", + "Cbc0010I After 5364000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (584.27 seconds)\n", + "Cbc0010I After 5365000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (584.36 seconds)\n", + "Cbc0010I After 5366000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (584.43 seconds)\n", + "Cbc0010I After 5367000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (584.52 seconds)\n", + "Cbc0010I After 5368000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (584.61 seconds)\n", + "Cbc0010I After 5369000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (584.69 seconds)\n", + "Cbc0010I After 5370000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (584.77 seconds)\n", + "Cbc0010I After 5371000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (584.84 seconds)\n", + "Cbc0010I After 5372000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (584.91 seconds)\n", + "Cbc0010I After 5373000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (585.01 seconds)\n", + "Cbc0010I After 5374000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (585.12 seconds)\n", + "Cbc0010I After 5375000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (585.19 seconds)\n", + "Cbc0010I After 5376000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (585.30 seconds)\n", + "Cbc0010I After 5377000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (585.37 seconds)\n", + "Cbc0010I After 5378000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (585.45 seconds)\n", + "Cbc0010I After 5379000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (585.53 seconds)\n", + "Cbc0010I After 5380000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (585.60 seconds)\n", + "Cbc0010I After 5381000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (585.66 seconds)\n", + "Cbc0010I After 5382000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (585.72 seconds)\n", + "Cbc0010I After 5383000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (585.79 seconds)\n", + "Cbc0010I After 5384000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (585.84 seconds)\n", + "Cbc0010I After 5385000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (585.88 seconds)\n", + "Cbc0010I After 5386000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (585.96 seconds)\n", + "Cbc0010I After 5387000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (586.03 seconds)\n", + "Cbc0010I After 5388000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (586.11 seconds)\n", + "Cbc0010I After 5389000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (586.19 seconds)\n", + "Cbc0010I After 5390000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (586.25 seconds)\n", + "Cbc0010I After 5391000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (586.31 seconds)\n", + "Cbc0010I After 5392000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (586.36 seconds)\n", + "Cbc0010I After 5393000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (586.41 seconds)\n", + "Cbc0010I After 5394000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (586.44 seconds)\n", + "Cbc0010I After 5395000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (586.51 seconds)\n", + "Cbc0010I After 5396000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (586.56 seconds)\n", + "Cbc0010I After 5397000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (586.61 seconds)\n", + "Cbc0010I After 5398000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (586.69 seconds)\n", + "Cbc0010I After 5399000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (586.76 seconds)\n", + "Cbc0010I After 5400000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (586.79 seconds)\n", + "Cbc0010I After 5401000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (586.83 seconds)\n", + "Cbc0010I After 5402000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (586.87 seconds)\n", + "Cbc0010I After 5403000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (586.91 seconds)\n", + "Cbc0010I After 5404000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (586.96 seconds)\n", + "Cbc0010I After 5405000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (587.02 seconds)\n", + "Cbc0010I After 5406000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (587.09 seconds)\n", + "Cbc0010I After 5407000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (587.15 seconds)\n", + "Cbc0010I After 5408000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (587.31 seconds)\n", + "Cbc0010I After 5409000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (587.40 seconds)\n", + "Cbc0010I After 5410000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (587.50 seconds)\n", + "Cbc0010I After 5411000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (587.55 seconds)\n", + "Cbc0010I After 5412000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (587.61 seconds)\n", + "Cbc0010I After 5413000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (587.71 seconds)\n", + "Cbc0010I After 5414000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (587.80 seconds)\n", + "Cbc0010I After 5415000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (587.86 seconds)\n", + "Cbc0010I After 5416000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (587.90 seconds)\n", + "Cbc0010I After 5417000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (587.94 seconds)\n", + "Cbc0010I After 5418000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (587.98 seconds)\n", + "Cbc0010I After 5419000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (588.02 seconds)\n", + "Cbc0010I After 5420000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (588.07 seconds)\n", + "Cbc0010I After 5421000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (588.14 seconds)\n", + "Cbc0010I After 5422000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (588.19 seconds)\n", + "Cbc0010I After 5423000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (588.24 seconds)\n", + "Cbc0010I After 5424000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (588.30 seconds)\n", + "Cbc0010I After 5425000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (588.35 seconds)\n", + "Cbc0010I After 5426000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (588.42 seconds)\n", + "Cbc0010I After 5427000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (588.50 seconds)\n", + "Cbc0010I After 5428000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (588.56 seconds)\n", + "Cbc0010I After 5429000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (588.65 seconds)\n", + "Cbc0010I After 5430000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (588.75 seconds)\n", + "Cbc0010I After 5431000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (588.82 seconds)\n", + "Cbc0010I After 5432000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (588.87 seconds)\n", + "Cbc0010I After 5433000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (588.93 seconds)\n", + "Cbc0010I After 5434000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (588.97 seconds)\n", + "Cbc0010I After 5435000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (589.02 seconds)\n", + "Cbc0010I After 5436000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (589.06 seconds)\n", + "Cbc0010I After 5437000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (589.12 seconds)\n", + "Cbc0010I After 5438000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (589.17 seconds)\n", + "Cbc0010I After 5439000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (589.22 seconds)\n", + "Cbc0010I After 5440000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (589.27 seconds)\n", + "Cbc0010I After 5441000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (589.32 seconds)\n", + "Cbc0010I After 5442000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (589.37 seconds)\n", + "Cbc0010I After 5443000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (589.43 seconds)\n", + "Cbc0010I After 5444000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (589.49 seconds)\n", + "Cbc0010I After 5445000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (589.55 seconds)\n", + "Cbc0010I After 5446000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (589.61 seconds)\n", + "Cbc0010I After 5447000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (589.66 seconds)\n", + "Cbc0010I After 5448000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (589.70 seconds)\n", + "Cbc0010I After 5449000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (589.75 seconds)\n", + "Cbc0010I After 5450000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (589.79 seconds)\n", + "Cbc0010I After 5451000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (589.83 seconds)\n", + "Cbc0010I After 5452000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (589.87 seconds)\n", + "Cbc0010I After 5453000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (589.93 seconds)\n", + "Cbc0010I After 5454000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (589.96 seconds)\n", + "Cbc0010I After 5455000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (590.00 seconds)\n", + "Cbc0010I After 5456000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (590.05 seconds)\n", + "Cbc0010I After 5457000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (590.11 seconds)\n", + "Cbc0010I After 5458000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (590.17 seconds)\n", + "Cbc0010I After 5459000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (590.22 seconds)\n", + "Cbc0010I After 5460000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (590.27 seconds)\n", + "Cbc0010I After 5461000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (590.32 seconds)\n", + "Cbc0010I After 5462000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (590.36 seconds)\n", + "Cbc0010I After 5463000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (590.41 seconds)\n", + "Cbc0010I After 5464000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (590.46 seconds)\n", + "Cbc0010I After 5465000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (590.52 seconds)\n", + "Cbc0010I After 5466000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (590.56 seconds)\n", + "Cbc0010I After 5467000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (590.60 seconds)\n", + "Cbc0010I After 5468000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (590.65 seconds)\n", + "Cbc0010I After 5469000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (590.70 seconds)\n", + "Cbc0010I After 5470000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (590.75 seconds)\n", + "Cbc0010I After 5471000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (590.82 seconds)\n", + "Cbc0010I After 5472000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (590.89 seconds)\n", + "Cbc0010I After 5473000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (590.94 seconds)\n", + "Cbc0010I After 5474000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (590.98 seconds)\n", + "Cbc0010I After 5475000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (591.02 seconds)\n", + "Cbc0010I After 5476000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (591.09 seconds)\n", + "Cbc0010I After 5477000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (591.15 seconds)\n", + "Cbc0010I After 5478000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (591.20 seconds)\n", + "Cbc0010I After 5479000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (591.24 seconds)\n", + "Cbc0010I After 5480000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (591.29 seconds)\n", + "Cbc0010I After 5481000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (591.35 seconds)\n", + "Cbc0010I After 5482000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (591.39 seconds)\n", + "Cbc0010I After 5483000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (591.43 seconds)\n", + "Cbc0010I After 5484000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (591.49 seconds)\n", + "Cbc0010I After 5485000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (591.53 seconds)\n", + "Cbc0010I After 5486000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (591.58 seconds)\n", + "Cbc0010I After 5487000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (591.65 seconds)\n", + "Cbc0010I After 5488000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (591.70 seconds)\n", + "Cbc0010I After 5489000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (591.75 seconds)\n", + "Cbc0010I After 5490000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (591.80 seconds)\n", + "Cbc0010I After 5491000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (591.87 seconds)\n", + "Cbc0010I After 5492000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (591.95 seconds)\n", + "Cbc0010I After 5493000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (592.03 seconds)\n", + "Cbc0010I After 5494000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (592.09 seconds)\n", + "Cbc0010I After 5495000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (592.14 seconds)\n", + "Cbc0010I After 5496000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (592.18 seconds)\n", + "Cbc0010I After 5497000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (592.27 seconds)\n", + "Cbc0010I After 5498000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (592.32 seconds)\n", + "Cbc0010I After 5499000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (592.36 seconds)\n", + "Cbc0010I After 5500000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (592.41 seconds)\n", + "Cbc0010I After 5501000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (592.45 seconds)\n", + "Cbc0010I After 5502000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (592.49 seconds)\n", + "Cbc0010I After 5503000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (592.54 seconds)\n", + "Cbc0010I After 5504000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (592.60 seconds)\n", + "Cbc0010I After 5505000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (592.63 seconds)\n", + "Cbc0010I After 5506000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (592.66 seconds)\n", + "Cbc0010I After 5507000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (592.70 seconds)\n", + "Cbc0010I After 5508000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (592.76 seconds)\n", + "Cbc0010I After 5509000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (592.80 seconds)\n", + "Cbc0010I After 5510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (592.84 seconds)\n", + "Cbc0010I After 5511000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (592.89 seconds)\n", + "Cbc0010I After 5512000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (592.94 seconds)\n", + "Cbc0010I After 5513000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (592.99 seconds)\n", + "Cbc0010I After 5514000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (593.04 seconds)\n", + "Cbc0010I After 5515000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (593.12 seconds)\n", + "Cbc0010I After 5516000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (593.17 seconds)\n", + "Cbc0010I After 5517000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (593.25 seconds)\n", + "Cbc0010I After 5518000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (593.31 seconds)\n", + "Cbc0010I After 5519000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (593.40 seconds)\n", + "Cbc0010I After 5520000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (593.51 seconds)\n", + "Cbc0010I After 5521000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (593.60 seconds)\n", + "Cbc0010I After 5522000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (593.70 seconds)\n", + "Cbc0010I After 5523000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (593.77 seconds)\n", + "Cbc0010I After 5524000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (593.82 seconds)\n", + "Cbc0010I After 5525000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (593.91 seconds)\n", + "Cbc0010I After 5526000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (593.99 seconds)\n", + "Cbc0010I After 5527000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (594.07 seconds)\n", + "Cbc0010I After 5528000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (594.12 seconds)\n", + "Cbc0010I After 5529000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (594.20 seconds)\n", + "Cbc0010I After 5530000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (594.27 seconds)\n", + "Cbc0010I After 5531000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (594.32 seconds)\n", + "Cbc0010I After 5532000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (594.40 seconds)\n", + "Cbc0010I After 5533000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (594.47 seconds)\n", + "Cbc0010I After 5534000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (594.53 seconds)\n", + "Cbc0010I After 5535000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (594.59 seconds)\n", + "Cbc0010I After 5536000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (594.65 seconds)\n", + "Cbc0010I After 5537000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (594.70 seconds)\n", + "Cbc0010I After 5538000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (594.77 seconds)\n", + "Cbc0010I After 5539000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (594.86 seconds)\n", + "Cbc0010I After 5540000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (594.95 seconds)\n", + "Cbc0010I After 5541000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (595.02 seconds)\n", + "Cbc0010I After 5542000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (595.12 seconds)\n", + "Cbc0010I After 5543000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (595.19 seconds)\n", + "Cbc0010I After 5544000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (595.28 seconds)\n", + "Cbc0010I After 5545000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (595.36 seconds)\n", + "Cbc0010I After 5546000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (595.42 seconds)\n", + "Cbc0010I After 5547000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (595.51 seconds)\n", + "Cbc0010I After 5548000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (595.66 seconds)\n", + "Cbc0010I After 5549000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (595.89 seconds)\n", + "Cbc0010I After 5550000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (596.04 seconds)\n", + "Cbc0010I After 5551000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (596.14 seconds)\n", + "Cbc0010I After 5552000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (596.24 seconds)\n", + "Cbc0010I After 5553000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (596.31 seconds)\n", + "Cbc0010I After 5554000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (596.39 seconds)\n", + "Cbc0010I After 5555000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (596.55 seconds)\n", + "Cbc0010I After 5556000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (596.84 seconds)\n", + "Cbc0010I After 5557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (596.98 seconds)\n", + "Cbc0010I After 5558000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (597.06 seconds)\n", + "Cbc0010I After 5559000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (597.18 seconds)\n", + "Cbc0010I After 5560000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (597.32 seconds)\n", + "Cbc0010I After 5561000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (597.39 seconds)\n", + "Cbc0010I After 5562000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (597.48 seconds)\n", + "Cbc0010I After 5563000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (597.55 seconds)\n", + "Cbc0010I After 5564000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (597.63 seconds)\n", + "Cbc0010I After 5565000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (597.69 seconds)\n", + "Cbc0010I After 5566000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (597.76 seconds)\n", + "Cbc0010I After 5567000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (597.82 seconds)\n", + "Cbc0010I After 5568000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (597.90 seconds)\n", + "Cbc0010I After 5569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (597.97 seconds)\n", + "Cbc0010I After 5570000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (598.05 seconds)\n", + "Cbc0010I After 5571000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (598.10 seconds)\n", + "Cbc0010I After 5572000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (598.21 seconds)\n", + "Cbc0010I After 5573000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (598.33 seconds)\n", + "Cbc0010I After 5574000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (598.41 seconds)\n", + "Cbc0010I After 5575000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (598.48 seconds)\n", + "Cbc0010I After 5576000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (598.56 seconds)\n", + "Cbc0010I After 5577000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (598.65 seconds)\n", + "Cbc0010I After 5578000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (598.74 seconds)\n", + "Cbc0010I After 5579000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (598.84 seconds)\n", + "Cbc0010I After 5580000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (598.92 seconds)\n", + "Cbc0010I After 5581000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (599.00 seconds)\n", + "Cbc0010I After 5582000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (599.11 seconds)\n", + "Cbc0010I After 5583000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (599.23 seconds)\n", + "Cbc0010I After 5584000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (599.29 seconds)\n", + "Cbc0010I After 5585000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (599.38 seconds)\n", + "Cbc0010I After 5586000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (599.43 seconds)\n", + "Cbc0010I After 5587000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (599.53 seconds)\n", + "Cbc0010I After 5588000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (599.58 seconds)\n", + "Cbc0010I After 5589000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (599.63 seconds)\n", + "Cbc0010I After 5590000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (599.67 seconds)\n", + "Cbc0010I After 5591000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (599.74 seconds)\n", + "Cbc0010I After 5592000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (599.79 seconds)\n", + "Cbc0010I After 5593000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (599.83 seconds)\n", + "Cbc0010I After 5594000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (599.90 seconds)\n", + "Cbc0010I After 5595000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (599.94 seconds)\n", + "Cbc0010I After 5596000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (600.04 seconds)\n", + "Cbc0010I After 5597000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (600.14 seconds)\n", + "Cbc0010I After 5598000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (600.22 seconds)\n", + "Cbc0010I After 5599000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (600.31 seconds)\n", + "Cbc0010I After 5600000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (600.41 seconds)\n", + "Cbc0010I After 5601000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (600.48 seconds)\n", + "Cbc0010I After 5602000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (600.55 seconds)\n", + "Cbc0010I After 5603000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (600.63 seconds)\n", + "Cbc0010I After 5604000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (600.69 seconds)\n", + "Cbc0010I After 5605000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (600.75 seconds)\n", + "Cbc0010I After 5606000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (600.84 seconds)\n", + "Cbc0010I After 5607000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (600.90 seconds)\n", + "Cbc0010I After 5608000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (600.98 seconds)\n", + "Cbc0010I After 5609000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (601.04 seconds)\n", + "Cbc0010I After 5610000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (601.11 seconds)\n", + "Cbc0010I After 5611000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (601.19 seconds)\n", + "Cbc0010I After 5612000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (601.27 seconds)\n", + "Cbc0010I After 5613000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (601.35 seconds)\n", + "Cbc0010I After 5614000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (601.42 seconds)\n", + "Cbc0010I After 5615000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (601.53 seconds)\n", + "Cbc0010I After 5616000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (601.63 seconds)\n", + "Cbc0010I After 5617000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (601.68 seconds)\n", + "Cbc0010I After 5618000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (601.73 seconds)\n", + "Cbc0010I After 5619000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (601.81 seconds)\n", + "Cbc0010I After 5620000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (601.86 seconds)\n", + "Cbc0010I After 5621000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (601.94 seconds)\n", + "Cbc0010I After 5622000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (602.03 seconds)\n", + "Cbc0010I After 5623000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (602.08 seconds)\n", + "Cbc0010I After 5624000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (602.14 seconds)\n", + "Cbc0010I After 5625000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (602.19 seconds)\n", + "Cbc0010I After 5626000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (602.25 seconds)\n", + "Cbc0010I After 5627000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (602.35 seconds)\n", + "Cbc0010I After 5628000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (602.41 seconds)\n", + "Cbc0010I After 5629000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (602.48 seconds)\n", + "Cbc0010I After 5630000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (602.58 seconds)\n", + "Cbc0010I After 5631000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (602.67 seconds)\n", + "Cbc0010I After 5632000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (602.79 seconds)\n", + "Cbc0010I After 5633000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (602.87 seconds)\n", + "Cbc0010I After 5634000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (602.91 seconds)\n", + "Cbc0010I After 5635000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (602.95 seconds)\n", + "Cbc0010I After 5636000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (603.01 seconds)\n", + "Cbc0010I After 5637000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (603.05 seconds)\n", + "Cbc0010I After 5638000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (603.09 seconds)\n", + "Cbc0010I After 5639000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (603.15 seconds)\n", + "Cbc0010I After 5640000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.20 seconds)\n", + "Cbc0010I After 5641000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (603.25 seconds)\n", + "Cbc0010I After 5642000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (603.29 seconds)\n", + "Cbc0010I After 5643000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.36 seconds)\n", + "Cbc0010I After 5644000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (603.40 seconds)\n", + "Cbc0010I After 5645000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (603.44 seconds)\n", + "Cbc0010I After 5646000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (603.48 seconds)\n", + "Cbc0010I After 5647000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.55 seconds)\n", + "Cbc0010I After 5648000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (603.59 seconds)\n", + "Cbc0010I After 5649000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (603.67 seconds)\n", + "Cbc0010I After 5650000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (603.75 seconds)\n", + "Cbc0010I After 5651000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (603.82 seconds)\n", + "Cbc0010I After 5652000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (603.90 seconds)\n", + "Cbc0010I After 5653000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (603.97 seconds)\n", + "Cbc0010I After 5654000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (604.04 seconds)\n", + "Cbc0010I After 5655000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (604.19 seconds)\n", + "Cbc0010I After 5656000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (604.24 seconds)\n", + "Cbc0010I After 5657000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (604.29 seconds)\n", + "Cbc0010I After 5658000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (604.33 seconds)\n", + "Cbc0010I After 5659000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (604.37 seconds)\n", + "Cbc0010I After 5660000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (604.42 seconds)\n", + "Cbc0010I After 5661000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (604.47 seconds)\n", + "Cbc0010I After 5662000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (604.52 seconds)\n", + "Cbc0010I After 5663000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (604.56 seconds)\n", + "Cbc0010I After 5664000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (604.60 seconds)\n", + "Cbc0010I After 5665000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (604.63 seconds)\n", + "Cbc0010I After 5666000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.68 seconds)\n", + "Cbc0010I After 5667000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.72 seconds)\n", + "Cbc0010I After 5668000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (604.77 seconds)\n", + "Cbc0010I After 5669000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (604.81 seconds)\n", + "Cbc0010I After 5670000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (604.85 seconds)\n", + "Cbc0010I After 5671000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.90 seconds)\n", + "Cbc0010I After 5672000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (604.94 seconds)\n", + "Cbc0010I After 5673000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (604.98 seconds)\n", + "Cbc0010I After 5674000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (605.02 seconds)\n", + "Cbc0010I After 5675000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (605.06 seconds)\n", + "Cbc0010I After 5676000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (605.10 seconds)\n", + "Cbc0010I After 5677000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (605.15 seconds)\n", + "Cbc0010I After 5678000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (605.20 seconds)\n", + "Cbc0010I After 5679000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (605.24 seconds)\n", + "Cbc0010I After 5680000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (605.29 seconds)\n", + "Cbc0010I After 5681000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (605.34 seconds)\n", + "Cbc0010I After 5682000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (605.38 seconds)\n", + "Cbc0010I After 5683000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (605.43 seconds)\n", + "Cbc0010I After 5684000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (605.49 seconds)\n", + "Cbc0010I After 5685000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (605.53 seconds)\n", + "Cbc0010I After 5686000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (605.57 seconds)\n", + "Cbc0010I After 5687000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (605.64 seconds)\n", + "Cbc0010I After 5688000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (605.73 seconds)\n", + "Cbc0010I After 5689000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (605.78 seconds)\n", + "Cbc0010I After 5690000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (605.84 seconds)\n", + "Cbc0010I After 5691000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (605.89 seconds)\n", + "Cbc0010I After 5692000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (605.92 seconds)\n", + "Cbc0010I After 5693000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (605.97 seconds)\n", + "Cbc0010I After 5694000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (606.02 seconds)\n", + "Cbc0010I After 5695000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (606.08 seconds)\n", + "Cbc0010I After 5696000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (606.14 seconds)\n", + "Cbc0010I After 5697000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.20 seconds)\n", + "Cbc0010I After 5698000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (606.26 seconds)\n", + "Cbc0010I After 5699000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (606.32 seconds)\n", + "Cbc0010I After 5700000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (606.38 seconds)\n", + "Cbc0010I After 5701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.44 seconds)\n", + "Cbc0010I After 5702000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.51 seconds)\n", + "Cbc0010I After 5703000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (606.56 seconds)\n", + "Cbc0010I After 5704000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (606.60 seconds)\n", + "Cbc0010I After 5705000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (606.65 seconds)\n", + "Cbc0010I After 5706000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (606.68 seconds)\n", + "Cbc0010I After 5707000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (606.74 seconds)\n", + "Cbc0010I After 5708000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (606.78 seconds)\n", + "Cbc0010I After 5709000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (606.85 seconds)\n", + "Cbc0010I After 5710000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (606.90 seconds)\n", + "Cbc0010I After 5711000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (606.95 seconds)\n", + "Cbc0010I After 5712000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (607.01 seconds)\n", + "Cbc0010I After 5713000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (607.06 seconds)\n", + "Cbc0010I After 5714000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (607.13 seconds)\n", + "Cbc0010I After 5715000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (607.20 seconds)\n", + "Cbc0010I After 5716000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (607.26 seconds)\n", + "Cbc0010I After 5717000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (607.32 seconds)\n", + "Cbc0010I After 5718000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (607.37 seconds)\n", + "Cbc0010I After 5719000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (607.42 seconds)\n", + "Cbc0010I After 5720000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (607.47 seconds)\n", + "Cbc0010I After 5721000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (607.53 seconds)\n", + "Cbc0010I After 5722000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (607.58 seconds)\n", + "Cbc0010I After 5723000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (607.63 seconds)\n", + "Cbc0010I After 5724000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (607.71 seconds)\n", + "Cbc0010I After 5725000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (607.79 seconds)\n", + "Cbc0010I After 5726000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (607.88 seconds)\n", + "Cbc0010I After 5727000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (607.98 seconds)\n", + "Cbc0010I After 5728000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (608.08 seconds)\n", + "Cbc0010I After 5729000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (608.18 seconds)\n", + "Cbc0010I After 5730000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (608.23 seconds)\n", + "Cbc0010I After 5731000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (608.30 seconds)\n", + "Cbc0010I After 5732000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (608.41 seconds)\n", + "Cbc0010I After 5733000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (608.54 seconds)\n", + "Cbc0010I After 5734000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (608.66 seconds)\n", + "Cbc0010I After 5735000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (608.73 seconds)\n", + "Cbc0010I After 5736000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (608.78 seconds)\n", + "Cbc0010I After 5737000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (608.83 seconds)\n", + "Cbc0010I After 5738000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (608.88 seconds)\n", + "Cbc0010I After 5739000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (608.96 seconds)\n", + "Cbc0010I After 5740000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (609.02 seconds)\n", + "Cbc0010I After 5741000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (609.08 seconds)\n", + "Cbc0010I After 5742000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (609.14 seconds)\n", + "Cbc0010I After 5743000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (609.20 seconds)\n", + "Cbc0010I After 5744000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (609.26 seconds)\n", + "Cbc0010I After 5745000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (609.34 seconds)\n", + "Cbc0010I After 5746000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (609.43 seconds)\n", + "Cbc0010I After 5747000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (609.49 seconds)\n", + "Cbc0010I After 5748000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (609.58 seconds)\n", + "Cbc0010I After 5749000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (609.64 seconds)\n", + "Cbc0010I After 5750000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (609.68 seconds)\n", + "Cbc0010I After 5751000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (609.74 seconds)\n", + "Cbc0010I After 5752000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (609.79 seconds)\n", + "Cbc0010I After 5753000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (609.87 seconds)\n", + "Cbc0010I After 5754000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (609.91 seconds)\n", + "Cbc0010I After 5755000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (609.97 seconds)\n", + "Cbc0010I After 5756000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (610.01 seconds)\n", + "Cbc0010I After 5757000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (610.05 seconds)\n", + "Cbc0010I After 5758000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (610.11 seconds)\n", + "Cbc0010I After 5759000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (610.16 seconds)\n", + "Cbc0010I After 5760000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (610.22 seconds)\n", + "Cbc0010I After 5761000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (610.27 seconds)\n", + "Cbc0010I After 5762000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (610.34 seconds)\n", + "Cbc0010I After 5763000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (610.41 seconds)\n", + "Cbc0010I After 5764000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (610.49 seconds)\n", + "Cbc0010I After 5765000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (610.59 seconds)\n", + "Cbc0010I After 5766000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (610.69 seconds)\n", + "Cbc0010I After 5767000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (610.77 seconds)\n", + "Cbc0010I After 5768000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (610.86 seconds)\n", + "Cbc0010I After 5769000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (610.92 seconds)\n", + "Cbc0010I After 5770000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (610.99 seconds)\n", + "Cbc0010I After 5771000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (611.04 seconds)\n", + "Cbc0010I After 5772000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (611.10 seconds)\n", + "Cbc0010I After 5773000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (611.18 seconds)\n", + "Cbc0010I After 5774000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (611.23 seconds)\n", + "Cbc0010I After 5775000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (611.28 seconds)\n", + "Cbc0010I After 5776000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (611.33 seconds)\n", + "Cbc0010I After 5777000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (611.39 seconds)\n", + "Cbc0010I After 5778000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (611.45 seconds)\n", + "Cbc0010I After 5779000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (611.49 seconds)\n", + "Cbc0010I After 5780000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (611.59 seconds)\n", + "Cbc0010I After 5781000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (611.64 seconds)\n", + "Cbc0010I After 5782000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (611.71 seconds)\n", + "Cbc0010I After 5783000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (611.77 seconds)\n", + "Cbc0010I After 5784000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (611.86 seconds)\n", + "Cbc0010I After 5785000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (611.97 seconds)\n", + "Cbc0010I After 5786000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (612.07 seconds)\n", + "Cbc0010I After 5787000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (612.15 seconds)\n", + "Cbc0010I After 5788000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (612.21 seconds)\n", + "Cbc0010I After 5789000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (612.28 seconds)\n", + "Cbc0010I After 5790000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (612.39 seconds)\n", + "Cbc0010I After 5791000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (612.55 seconds)\n", + "Cbc0010I After 5792000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (612.71 seconds)\n", + "Cbc0010I After 5793000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (612.87 seconds)\n", + "Cbc0010I After 5794000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (613.06 seconds)\n", + "Cbc0010I After 5795000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (613.23 seconds)\n", + "Cbc0010I After 5796000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (613.33 seconds)\n", + "Cbc0010I After 5797000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (613.45 seconds)\n", + "Cbc0010I After 5798000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (613.56 seconds)\n", + "Cbc0010I After 5799000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (613.62 seconds)\n", + "Cbc0010I After 5800000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (613.70 seconds)\n", + "Cbc0010I After 5801000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (613.77 seconds)\n", + "Cbc0010I After 5802000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (613.84 seconds)\n", + "Cbc0010I After 5803000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (613.89 seconds)\n", + "Cbc0010I After 5804000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (613.94 seconds)\n", + "Cbc0010I After 5805000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (614.00 seconds)\n", + "Cbc0010I After 5806000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (614.09 seconds)\n", + "Cbc0010I After 5807000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (614.23 seconds)\n", + "Cbc0010I After 5808000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (614.37 seconds)\n", + "Cbc0010I After 5809000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (614.51 seconds)\n", + "Cbc0010I After 5810000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (614.81 seconds)\n", + "Cbc0010I After 5811000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (614.93 seconds)\n", + "Cbc0010I After 5812000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (615.05 seconds)\n", + "Cbc0010I After 5813000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (615.16 seconds)\n", + "Cbc0010I After 5814000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (615.26 seconds)\n", + "Cbc0010I After 5815000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (615.35 seconds)\n", + "Cbc0010I After 5816000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (615.44 seconds)\n", + "Cbc0010I After 5817000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (615.56 seconds)\n", + "Cbc0010I After 5818000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (615.65 seconds)\n", + "Cbc0010I After 5819000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (615.75 seconds)\n", + "Cbc0010I After 5820000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (615.83 seconds)\n", + "Cbc0010I After 5821000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (615.90 seconds)\n", + "Cbc0010I After 5822000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (615.98 seconds)\n", + "Cbc0010I After 5823000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (616.10 seconds)\n", + "Cbc0010I After 5824000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (616.29 seconds)\n", + "Cbc0010I After 5825000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (616.42 seconds)\n", + "Cbc0010I After 5826000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (616.49 seconds)\n", + "Cbc0010I After 5827000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (616.55 seconds)\n", + "Cbc0010I After 5828000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (616.62 seconds)\n", + "Cbc0010I After 5829000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (616.69 seconds)\n", + "Cbc0010I After 5830000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (616.75 seconds)\n", + "Cbc0010I After 5831000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (616.80 seconds)\n", + "Cbc0010I After 5832000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (616.85 seconds)\n", + "Cbc0010I After 5833000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (616.90 seconds)\n", + "Cbc0010I After 5834000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (616.95 seconds)\n", + "Cbc0010I After 5835000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (617.05 seconds)\n", + "Cbc0010I After 5836000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (617.10 seconds)\n", + "Cbc0010I After 5837000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (617.16 seconds)\n", + "Cbc0010I After 5838000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (617.21 seconds)\n", + "Cbc0010I After 5839000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (617.27 seconds)\n", + "Cbc0010I After 5840000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (617.31 seconds)\n", + "Cbc0010I After 5841000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (617.36 seconds)\n", + "Cbc0010I After 5842000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (617.42 seconds)\n", + "Cbc0010I After 5843000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (617.47 seconds)\n", + "Cbc0010I After 5844000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (617.51 seconds)\n", + "Cbc0010I After 5845000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (617.56 seconds)\n", + "Cbc0010I After 5846000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (617.60 seconds)\n", + "Cbc0010I After 5847000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (617.67 seconds)\n", + "Cbc0010I After 5848000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (617.71 seconds)\n", + "Cbc0010I After 5849000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (617.77 seconds)\n", + "Cbc0010I After 5850000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (617.81 seconds)\n", + "Cbc0010I After 5851000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (617.85 seconds)\n", + "Cbc0010I After 5852000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (617.90 seconds)\n", + "Cbc0010I After 5853000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (617.95 seconds)\n", + "Cbc0010I After 5854000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (618.03 seconds)\n", + "Cbc0010I After 5855000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (618.07 seconds)\n", + "Cbc0010I After 5856000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (618.10 seconds)\n", + "Cbc0010I After 5857000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (618.13 seconds)\n", + "Cbc0010I After 5858000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (618.18 seconds)\n", + "Cbc0010I After 5859000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (618.25 seconds)\n", + "Cbc0010I After 5860000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (618.33 seconds)\n", + "Cbc0010I After 5861000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (618.44 seconds)\n", + "Cbc0010I After 5862000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (618.53 seconds)\n", + "Cbc0010I After 5863000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (618.64 seconds)\n", + "Cbc0010I After 5864000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (618.71 seconds)\n", + "Cbc0010I After 5865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (618.77 seconds)\n", + "Cbc0010I After 5866000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (618.82 seconds)\n", + "Cbc0010I After 5867000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (618.87 seconds)\n", + "Cbc0010I After 5868000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (618.91 seconds)\n", + "Cbc0010I After 5869000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (618.98 seconds)\n", + "Cbc0010I After 5870000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (619.03 seconds)\n", + "Cbc0010I After 5871000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (619.09 seconds)\n", + "Cbc0010I After 5872000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (619.17 seconds)\n", + "Cbc0010I After 5873000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (619.21 seconds)\n", + "Cbc0010I After 5874000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (619.24 seconds)\n", + "Cbc0010I After 5875000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (619.28 seconds)\n", + "Cbc0010I After 5876000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (619.31 seconds)\n", + "Cbc0010I After 5877000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (619.37 seconds)\n", + "Cbc0010I After 5878000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (619.41 seconds)\n", + "Cbc0010I After 5879000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (619.49 seconds)\n", + "Cbc0010I After 5880000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (619.57 seconds)\n", + "Cbc0010I After 5881000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (619.65 seconds)\n", + "Cbc0010I After 5882000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (619.73 seconds)\n", + "Cbc0010I After 5883000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (619.80 seconds)\n", + "Cbc0010I After 5884000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (619.88 seconds)\n", + "Cbc0010I After 5885000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (619.96 seconds)\n", + "Cbc0010I After 5886000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (620.05 seconds)\n", + "Cbc0010I After 5887000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (620.15 seconds)\n", + "Cbc0010I After 5888000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (620.24 seconds)\n", + "Cbc0010I After 5889000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (620.32 seconds)\n", + "Cbc0010I After 5890000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (620.44 seconds)\n", + "Cbc0010I After 5891000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (620.49 seconds)\n", + "Cbc0010I After 5892000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (620.53 seconds)\n", + "Cbc0010I After 5893000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (620.57 seconds)\n", + "Cbc0010I After 5894000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (620.62 seconds)\n", + "Cbc0010I After 5895000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (620.67 seconds)\n", + "Cbc0010I After 5896000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (620.71 seconds)\n", + "Cbc0010I After 5897000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (620.75 seconds)\n", + "Cbc0010I After 5898000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (620.80 seconds)\n", + "Cbc0010I After 5899000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (620.85 seconds)\n", + "Cbc0010I After 5900000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (620.89 seconds)\n", + "Cbc0010I After 5901000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (620.94 seconds)\n", + "Cbc0010I After 5902000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (620.99 seconds)\n", + "Cbc0010I After 5903000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (621.06 seconds)\n", + "Cbc0010I After 5904000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (621.11 seconds)\n", + "Cbc0010I After 5905000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (621.19 seconds)\n", + "Cbc0010I After 5906000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (621.26 seconds)\n", + "Cbc0010I After 5907000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (621.31 seconds)\n", + "Cbc0010I After 5908000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (621.37 seconds)\n", + "Cbc0010I After 5909000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (621.41 seconds)\n", + "Cbc0010I After 5910000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (621.48 seconds)\n", + "Cbc0010I After 5911000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (621.55 seconds)\n", + "Cbc0010I After 5912000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (621.62 seconds)\n", + "Cbc0010I After 5913000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (621.73 seconds)\n", + "Cbc0010I After 5914000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (621.83 seconds)\n", + "Cbc0010I After 5915000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (621.92 seconds)\n", + "Cbc0010I After 5916000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (622.05 seconds)\n", + "Cbc0010I After 5917000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (622.18 seconds)\n", + "Cbc0010I After 5918000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (622.29 seconds)\n", + "Cbc0010I After 5919000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (622.47 seconds)\n", + "Cbc0010I After 5920000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (622.56 seconds)\n", + "Cbc0010I After 5921000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (622.66 seconds)\n", + "Cbc0010I After 5922000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (622.74 seconds)\n", + "Cbc0010I After 5923000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (622.78 seconds)\n", + "Cbc0010I After 5924000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (622.83 seconds)\n", + "Cbc0010I After 5925000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (622.88 seconds)\n", + "Cbc0010I After 5926000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (622.94 seconds)\n", + "Cbc0010I After 5927000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.00 seconds)\n", + "Cbc0010I After 5928000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (623.06 seconds)\n", + "Cbc0010I After 5929000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (623.11 seconds)\n", + "Cbc0010I After 5930000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.17 seconds)\n", + "Cbc0010I After 5931000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (623.23 seconds)\n", + "Cbc0010I After 5932000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (623.28 seconds)\n", + "Cbc0010I After 5933000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (623.34 seconds)\n", + "Cbc0010I After 5934000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.39 seconds)\n", + "Cbc0010I After 5935000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (623.46 seconds)\n", + "Cbc0010I After 5936000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (623.51 seconds)\n", + "Cbc0010I After 5937000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (623.58 seconds)\n", + "Cbc0010I After 5938000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (623.64 seconds)\n", + "Cbc0010I After 5939000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (623.71 seconds)\n", + "Cbc0010I After 5940000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (623.79 seconds)\n", + "Cbc0010I After 5941000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (623.87 seconds)\n", + "Cbc0010I After 5942000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (623.92 seconds)\n", + "Cbc0010I After 5943000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (623.98 seconds)\n", + "Cbc0010I After 5944000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (624.09 seconds)\n", + "Cbc0010I After 5945000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.15 seconds)\n", + "Cbc0010I After 5946000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (624.20 seconds)\n", + "Cbc0010I After 5947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (624.25 seconds)\n", + "Cbc0010I After 5948000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (624.34 seconds)\n", + "Cbc0010I After 5949000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.41 seconds)\n", + "Cbc0010I After 5950000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.51 seconds)\n", + "Cbc0010I After 5951000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.58 seconds)\n", + "Cbc0010I After 5952000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.65 seconds)\n", + "Cbc0010I After 5953000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.71 seconds)\n", + "Cbc0010I After 5954000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (624.75 seconds)\n", + "Cbc0010I After 5955000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (624.80 seconds)\n", + "Cbc0010I After 5956000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (624.84 seconds)\n", + "Cbc0010I After 5957000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (624.88 seconds)\n", + "Cbc0010I After 5958000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (624.92 seconds)\n", + "Cbc0010I After 5959000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (624.98 seconds)\n", + "Cbc0010I After 5960000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (625.01 seconds)\n", + "Cbc0010I After 5961000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (625.06 seconds)\n", + "Cbc0010I After 5962000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (625.09 seconds)\n", + "Cbc0010I After 5963000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (625.12 seconds)\n", + "Cbc0010I After 5964000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (625.17 seconds)\n", + "Cbc0010I After 5965000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (625.22 seconds)\n", + "Cbc0010I After 5966000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (625.27 seconds)\n", + "Cbc0010I After 5967000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (625.32 seconds)\n", + "Cbc0010I After 5968000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (625.41 seconds)\n", + "Cbc0010I After 5969000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (625.51 seconds)\n", + "Cbc0010I After 5970000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (625.61 seconds)\n", + "Cbc0010I After 5971000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (625.70 seconds)\n", + "Cbc0010I After 5972000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (625.81 seconds)\n", + "Cbc0010I After 5973000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (625.90 seconds)\n", + "Cbc0010I After 5974000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (625.99 seconds)\n", + "Cbc0010I After 5975000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (626.08 seconds)\n", + "Cbc0010I After 5976000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (626.14 seconds)\n", + "Cbc0010I After 5977000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (626.23 seconds)\n", + "Cbc0010I After 5978000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (626.31 seconds)\n", + "Cbc0010I After 5979000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (626.40 seconds)\n", + "Cbc0010I After 5980000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (626.50 seconds)\n", + "Cbc0010I After 5981000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (626.61 seconds)\n", + "Cbc0010I After 5982000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (626.79 seconds)\n", + "Cbc0010I After 5983000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (626.92 seconds)\n", + "Cbc0010I After 5984000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (626.99 seconds)\n", + "Cbc0010I After 5985000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.06 seconds)\n", + "Cbc0010I After 5986000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (627.15 seconds)\n", + "Cbc0010I After 5987000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.22 seconds)\n", + "Cbc0010I After 5988000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.29 seconds)\n", + "Cbc0010I After 5989000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (627.34 seconds)\n", + "Cbc0010I After 5990000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (627.39 seconds)\n", + "Cbc0010I After 5991000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (627.45 seconds)\n", + "Cbc0010I After 5992000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (627.53 seconds)\n", + "Cbc0010I After 5993000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (627.57 seconds)\n", + "Cbc0010I After 5994000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (627.62 seconds)\n", + "Cbc0010I After 5995000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.67 seconds)\n", + "Cbc0010I After 5996000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (627.74 seconds)\n", + "Cbc0010I After 5997000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (627.79 seconds)\n", + "Cbc0010I After 5998000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.82 seconds)\n", + "Cbc0010I After 5999000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.87 seconds)\n", + "Cbc0010I After 6000000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (627.92 seconds)\n", + "Cbc0010I After 6001000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (627.99 seconds)\n", + "Cbc0010I After 6002000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (628.03 seconds)\n", + "Cbc0010I After 6003000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.08 seconds)\n", + "Cbc0010I After 6004000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (628.12 seconds)\n", + "Cbc0010I After 6005000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (628.16 seconds)\n", + "Cbc0010I After 6006000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (628.20 seconds)\n", + "Cbc0010I After 6007000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (628.26 seconds)\n", + "Cbc0010I After 6008000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (628.32 seconds)\n", + "Cbc0010I After 6009000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (628.38 seconds)\n", + "Cbc0010I After 6010000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (628.43 seconds)\n", + "Cbc0010I After 6011000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (628.48 seconds)\n", + "Cbc0010I After 6012000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (628.52 seconds)\n", + "Cbc0010I After 6013000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (628.56 seconds)\n", + "Cbc0010I After 6014000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (628.60 seconds)\n", + "Cbc0010I After 6015000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (628.65 seconds)\n", + "Cbc0010I After 6016000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (628.71 seconds)\n", + "Cbc0010I After 6017000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.76 seconds)\n", + "Cbc0010I After 6018000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.81 seconds)\n", + "Cbc0010I After 6019000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (628.85 seconds)\n", + "Cbc0010I After 6020000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (628.89 seconds)\n", + "Cbc0010I After 6021000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (628.94 seconds)\n", + "Cbc0010I After 6022000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (628.98 seconds)\n", + "Cbc0010I After 6023000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (629.03 seconds)\n", + "Cbc0010I After 6024000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (629.08 seconds)\n", + "Cbc0010I After 6025000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (629.15 seconds)\n", + "Cbc0010I After 6026000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (629.23 seconds)\n", + "Cbc0010I After 6027000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (629.33 seconds)\n", + "Cbc0010I After 6028000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (629.37 seconds)\n", + "Cbc0010I After 6029000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (629.41 seconds)\n", + "Cbc0010I After 6030000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (629.45 seconds)\n", + "Cbc0010I After 6031000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (629.51 seconds)\n", + "Cbc0010I After 6032000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (629.57 seconds)\n", + "Cbc0010I After 6033000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (629.66 seconds)\n", + "Cbc0010I After 6034000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (629.72 seconds)\n", + "Cbc0010I After 6035000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (629.76 seconds)\n", + "Cbc0010I After 6036000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (629.82 seconds)\n", + "Cbc0010I After 6037000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (629.87 seconds)\n", + "Cbc0010I After 6038000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (629.91 seconds)\n", + "Cbc0010I After 6039000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (629.95 seconds)\n", + "Cbc0010I After 6040000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (629.99 seconds)\n", + "Cbc0010I After 6041000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (630.04 seconds)\n", + "Cbc0010I After 6042000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (630.08 seconds)\n", + "Cbc0010I After 6043000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (630.13 seconds)\n", + "Cbc0010I After 6044000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (630.18 seconds)\n", + "Cbc0010I After 6045000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (630.23 seconds)\n", + "Cbc0010I After 6046000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.27 seconds)\n", + "Cbc0010I After 6047000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (630.31 seconds)\n", + "Cbc0010I After 6048000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (630.36 seconds)\n", + "Cbc0010I After 6049000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (630.41 seconds)\n", + "Cbc0010I After 6050000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.47 seconds)\n", + "Cbc0010I After 6051000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (630.52 seconds)\n", + "Cbc0010I After 6052000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (630.57 seconds)\n", + "Cbc0010I After 6053000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (630.62 seconds)\n", + "Cbc0010I After 6054000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (630.66 seconds)\n", + "Cbc0010I After 6055000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (630.70 seconds)\n", + "Cbc0010I After 6056000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (630.74 seconds)\n", + "Cbc0010I After 6057000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (630.79 seconds)\n", + "Cbc0010I After 6058000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (630.85 seconds)\n", + "Cbc0010I After 6059000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.90 seconds)\n", + "Cbc0010I After 6060000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.96 seconds)\n", + "Cbc0010I After 6061000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (631.00 seconds)\n", + "Cbc0010I After 6062000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (631.06 seconds)\n", + "Cbc0010I After 6063000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (631.16 seconds)\n", + "Cbc0010I After 6064000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (631.24 seconds)\n", + "Cbc0010I After 6065000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (631.32 seconds)\n", + "Cbc0010I After 6066000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (631.40 seconds)\n", + "Cbc0010I After 6067000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (631.44 seconds)\n", + "Cbc0010I After 6068000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (631.48 seconds)\n", + "Cbc0010I After 6069000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (631.54 seconds)\n", + "Cbc0010I After 6070000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (631.58 seconds)\n", + "Cbc0010I After 6071000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (631.62 seconds)\n", + "Cbc0010I After 6072000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (631.66 seconds)\n", + "Cbc0010I After 6073000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (631.72 seconds)\n", + "Cbc0010I After 6074000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (631.81 seconds)\n", + "Cbc0010I After 6075000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (631.86 seconds)\n", + "Cbc0010I After 6076000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (631.91 seconds)\n", + "Cbc0010I After 6077000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (631.99 seconds)\n", + "Cbc0010I After 6078000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (632.09 seconds)\n", + "Cbc0010I After 6079000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (632.15 seconds)\n", + "Cbc0010I After 6080000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (632.22 seconds)\n", + "Cbc0010I After 6081000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (632.32 seconds)\n", + "Cbc0010I After 6082000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (632.38 seconds)\n", + "Cbc0010I After 6083000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (632.44 seconds)\n", + "Cbc0010I After 6084000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (632.51 seconds)\n", + "Cbc0010I After 6085000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (632.58 seconds)\n", + "Cbc0010I After 6086000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (632.66 seconds)\n", + "Cbc0010I After 6087000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (632.73 seconds)\n", + "Cbc0010I After 6088000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (632.80 seconds)\n", + "Cbc0010I After 6089000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (632.86 seconds)\n", + "Cbc0010I After 6090000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (632.93 seconds)\n", + "Cbc0010I After 6091000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (632.99 seconds)\n", + "Cbc0010I After 6092000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (633.05 seconds)\n", + "Cbc0010I After 6093000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (633.12 seconds)\n", + "Cbc0010I After 6094000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (633.19 seconds)\n", + "Cbc0010I After 6095000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (633.27 seconds)\n", + "Cbc0010I After 6096000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (633.36 seconds)\n", + "Cbc0010I After 6097000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (633.45 seconds)\n", + "Cbc0010I After 6098000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (633.57 seconds)\n", + "Cbc0010I After 6099000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (633.68 seconds)\n", + "Cbc0010I After 6100000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (633.77 seconds)\n", + "Cbc0010I After 6101000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (633.85 seconds)\n", + "Cbc0010I After 6102000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (633.95 seconds)\n", + "Cbc0010I After 6103000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (634.12 seconds)\n", + "Cbc0010I After 6104000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (634.34 seconds)\n", + "Cbc0010I After 6105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (634.50 seconds)\n", + "Cbc0010I After 6106000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (634.65 seconds)\n", + "Cbc0010I After 6107000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (634.78 seconds)\n", + "Cbc0010I After 6108000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (634.91 seconds)\n", + "Cbc0010I After 6109000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (634.96 seconds)\n", + "Cbc0010I After 6110000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (635.01 seconds)\n", + "Cbc0010I After 6111000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (635.07 seconds)\n", + "Cbc0010I After 6112000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (635.16 seconds)\n", + "Cbc0010I After 6113000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (635.27 seconds)\n", + "Cbc0010I After 6114000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (635.34 seconds)\n", + "Cbc0010I After 6115000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (635.40 seconds)\n", + "Cbc0010I After 6116000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (635.45 seconds)\n", + "Cbc0010I After 6117000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (635.51 seconds)\n", + "Cbc0010I After 6118000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (635.57 seconds)\n", + "Cbc0010I After 6119000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (635.64 seconds)\n", + "Cbc0010I After 6120000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (635.74 seconds)\n", + "Cbc0010I After 6121000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (635.83 seconds)\n", + "Cbc0010I After 6122000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (635.98 seconds)\n", + "Cbc0010I After 6123000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (636.11 seconds)\n", + "Cbc0010I After 6124000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (636.34 seconds)\n", + "Cbc0010I After 6125000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (636.56 seconds)\n", + "Cbc0010I After 6126000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (636.73 seconds)\n", + "Cbc0010I After 6127000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (636.96 seconds)\n", + "Cbc0010I After 6128000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (637.13 seconds)\n", + "Cbc0010I After 6129000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (637.28 seconds)\n", + "Cbc0010I After 6130000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (637.40 seconds)\n", + "Cbc0010I After 6131000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (637.52 seconds)\n", + "Cbc0010I After 6132000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (637.62 seconds)\n", + "Cbc0010I After 6133000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (637.71 seconds)\n", + "Cbc0010I After 6134000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (637.77 seconds)\n", + "Cbc0010I After 6135000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (637.83 seconds)\n", + "Cbc0010I After 6136000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (637.94 seconds)\n", + "Cbc0010I After 6137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (638.02 seconds)\n", + "Cbc0010I After 6138000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (638.11 seconds)\n", + "Cbc0010I After 6139000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (638.18 seconds)\n", + "Cbc0010I After 6140000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.25 seconds)\n", + "Cbc0010I After 6141000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (638.33 seconds)\n", + "Cbc0010I After 6142000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (638.41 seconds)\n", + "Cbc0010I After 6143000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (638.47 seconds)\n", + "Cbc0010I After 6144000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (638.53 seconds)\n", + "Cbc0010I After 6145000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.63 seconds)\n", + "Cbc0010I After 6146000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (638.73 seconds)\n", + "Cbc0010I After 6147000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (638.78 seconds)\n", + "Cbc0010I After 6148000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.83 seconds)\n", + "Cbc0010I After 6149000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.88 seconds)\n", + "Cbc0010I After 6150000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (638.98 seconds)\n", + "Cbc0010I After 6151000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (639.04 seconds)\n", + "Cbc0010I After 6152000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (639.10 seconds)\n", + "Cbc0010I After 6153000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (639.19 seconds)\n", + "Cbc0010I After 6154000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.28 seconds)\n", + "Cbc0010I After 6155000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (639.37 seconds)\n", + "Cbc0010I After 6156000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (639.48 seconds)\n", + "Cbc0010I After 6157000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.58 seconds)\n", + "Cbc0010I After 6158000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (639.68 seconds)\n", + "Cbc0010I After 6159000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.78 seconds)\n", + "Cbc0010I After 6160000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (639.90 seconds)\n", + "Cbc0010I After 6161000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (639.98 seconds)\n", + "Cbc0010I After 6162000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (640.07 seconds)\n", + "Cbc0010I After 6163000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (640.15 seconds)\n", + "Cbc0010I After 6164000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (640.23 seconds)\n", + "Cbc0010I After 6165000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (640.36 seconds)\n", + "Cbc0010I After 6166000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (640.51 seconds)\n", + "Cbc0010I After 6167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (640.64 seconds)\n", + "Cbc0010I After 6168000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (640.79 seconds)\n", + "Cbc0010I After 6169000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (640.90 seconds)\n", + "Cbc0010I After 6170000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (641.00 seconds)\n", + "Cbc0010I After 6171000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (641.13 seconds)\n", + "Cbc0010I After 6172000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (641.30 seconds)\n", + "Cbc0010I After 6173000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (641.40 seconds)\n", + "Cbc0010I After 6174000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (641.54 seconds)\n", + "Cbc0010I After 6175000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (641.74 seconds)\n", + "Cbc0010I After 6176000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (641.88 seconds)\n", + "Cbc0010I After 6177000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (641.95 seconds)\n", + "Cbc0010I After 6178000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (642.04 seconds)\n", + "Cbc0010I After 6179000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (642.11 seconds)\n", + "Cbc0010I After 6180000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (642.18 seconds)\n", + "Cbc0010I After 6181000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (642.29 seconds)\n", + "Cbc0010I After 6182000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (642.39 seconds)\n", + "Cbc0010I After 6183000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (642.48 seconds)\n", + "Cbc0010I After 6184000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (642.58 seconds)\n", + "Cbc0010I After 6185000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (642.66 seconds)\n", + "Cbc0010I After 6186000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (642.75 seconds)\n", + "Cbc0010I After 6187000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (642.81 seconds)\n", + "Cbc0010I After 6188000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (642.88 seconds)\n", + "Cbc0010I After 6189000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (642.99 seconds)\n", + "Cbc0010I After 6190000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (643.10 seconds)\n", + "Cbc0010I After 6191000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (643.15 seconds)\n", + "Cbc0010I After 6192000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (643.21 seconds)\n", + "Cbc0010I After 6193000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (643.28 seconds)\n", + "Cbc0010I After 6194000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (643.33 seconds)\n", + "Cbc0010I After 6195000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (643.38 seconds)\n", + "Cbc0010I After 6196000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (643.45 seconds)\n", + "Cbc0010I After 6197000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (643.52 seconds)\n", + "Cbc0010I After 6198000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (643.58 seconds)\n", + "Cbc0010I After 6199000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (643.64 seconds)\n", + "Cbc0010I After 6200000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (643.70 seconds)\n", + "Cbc0010I After 6201000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (643.77 seconds)\n", + "Cbc0010I After 6202000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (643.83 seconds)\n", + "Cbc0010I After 6203000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (643.89 seconds)\n", + "Cbc0010I After 6204000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (643.95 seconds)\n", + "Cbc0010I After 6205000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (644.02 seconds)\n", + "Cbc0010I After 6206000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (644.08 seconds)\n", + "Cbc0010I After 6207000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (644.13 seconds)\n", + "Cbc0010I After 6208000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (644.19 seconds)\n", + "Cbc0010I After 6209000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (644.25 seconds)\n", + "Cbc0010I After 6210000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (644.31 seconds)\n", + "Cbc0010I After 6211000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (644.39 seconds)\n", + "Cbc0010I After 6212000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (644.46 seconds)\n", + "Cbc0010I After 6213000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (644.51 seconds)\n", + "Cbc0010I After 6214000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (644.57 seconds)\n", + "Cbc0010I After 6215000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (644.63 seconds)\n", + "Cbc0010I After 6216000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (644.71 seconds)\n", + "Cbc0010I After 6217000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (644.78 seconds)\n", + "Cbc0010I After 6218000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (644.85 seconds)\n", + "Cbc0010I After 6219000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (644.93 seconds)\n", + "Cbc0010I After 6220000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (645.00 seconds)\n", + "Cbc0010I After 6221000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (645.09 seconds)\n", + "Cbc0010I After 6222000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (645.17 seconds)\n", + "Cbc0010I After 6223000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (645.26 seconds)\n", + "Cbc0010I After 6224000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (645.34 seconds)\n", + "Cbc0010I After 6225000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (645.44 seconds)\n", + "Cbc0010I After 6226000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (645.58 seconds)\n", + "Cbc0010I After 6227000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (645.67 seconds)\n", + "Cbc0010I After 6228000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (645.76 seconds)\n", + "Cbc0010I After 6229000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (645.84 seconds)\n", + "Cbc0010I After 6230000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (645.95 seconds)\n", + "Cbc0010I After 6231000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (646.02 seconds)\n", + "Cbc0010I After 6232000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (646.10 seconds)\n", + "Cbc0010I After 6233000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (646.20 seconds)\n", + "Cbc0010I After 6234000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (646.30 seconds)\n", + "Cbc0010I After 6235000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (646.41 seconds)\n", + "Cbc0010I After 6236000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (646.52 seconds)\n", + "Cbc0010I After 6237000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (646.64 seconds)\n", + "Cbc0010I After 6238000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (646.71 seconds)\n", + "Cbc0010I After 6239000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (646.77 seconds)\n", + "Cbc0010I After 6240000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (646.83 seconds)\n", + "Cbc0010I After 6241000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (646.90 seconds)\n", + "Cbc0010I After 6242000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (646.96 seconds)\n", + "Cbc0010I After 6243000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (647.01 seconds)\n", + "Cbc0010I After 6244000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (647.07 seconds)\n", + "Cbc0010I After 6245000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (647.15 seconds)\n", + "Cbc0010I After 6246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (647.24 seconds)\n", + "Cbc0010I After 6247000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (647.31 seconds)\n", + "Cbc0010I After 6248000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (647.38 seconds)\n", + "Cbc0010I After 6249000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (647.45 seconds)\n", + "Cbc0010I After 6250000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (647.53 seconds)\n", + "Cbc0010I After 6251000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (647.60 seconds)\n", + "Cbc0010I After 6252000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (647.67 seconds)\n", + "Cbc0010I After 6253000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (647.75 seconds)\n", + "Cbc0010I After 6254000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (647.84 seconds)\n", + "Cbc0010I After 6255000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (647.92 seconds)\n", + "Cbc0010I After 6256000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (648.02 seconds)\n", + "Cbc0010I After 6257000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (648.08 seconds)\n", + "Cbc0010I After 6258000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (648.15 seconds)\n", + "Cbc0010I After 6259000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (648.26 seconds)\n", + "Cbc0010I After 6260000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (648.35 seconds)\n", + "Cbc0010I After 6261000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (648.45 seconds)\n", + "Cbc0010I After 6262000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (648.56 seconds)\n", + "Cbc0010I After 6263000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (648.63 seconds)\n", + "Cbc0010I After 6264000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (648.70 seconds)\n", + "Cbc0010I After 6265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (648.78 seconds)\n", + "Cbc0010I After 6266000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (648.85 seconds)\n", + "Cbc0010I After 6267000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (648.92 seconds)\n", + "Cbc0010I After 6268000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (648.99 seconds)\n", + "Cbc0010I After 6269000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (649.08 seconds)\n", + "Cbc0010I After 6270000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (649.15 seconds)\n", + "Cbc0010I After 6271000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (649.22 seconds)\n", + "Cbc0010I After 6272000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (649.32 seconds)\n", + "Cbc0010I After 6273000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (649.38 seconds)\n", + "Cbc0010I After 6274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (649.44 seconds)\n", + "Cbc0010I After 6275000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (649.51 seconds)\n", + "Cbc0010I After 6276000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (649.56 seconds)\n", + "Cbc0010I After 6277000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (649.64 seconds)\n", + "Cbc0010I After 6278000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (649.72 seconds)\n", + "Cbc0010I After 6279000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (649.80 seconds)\n", + "Cbc0010I After 6280000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (649.86 seconds)\n", + "Cbc0010I After 6281000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (649.92 seconds)\n", + "Cbc0010I After 6282000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (649.99 seconds)\n", + "Cbc0010I After 6283000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (650.04 seconds)\n", + "Cbc0010I After 6284000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (650.09 seconds)\n", + "Cbc0010I After 6285000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (650.14 seconds)\n", + "Cbc0010I After 6286000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (650.20 seconds)\n", + "Cbc0010I After 6287000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (650.27 seconds)\n", + "Cbc0010I After 6288000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (650.35 seconds)\n", + "Cbc0010I After 6289000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (650.44 seconds)\n", + "Cbc0010I After 6290000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (650.54 seconds)\n", + "Cbc0010I After 6291000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (650.64 seconds)\n", + "Cbc0010I After 6292000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (650.72 seconds)\n", + "Cbc0010I After 6293000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (650.80 seconds)\n", + "Cbc0010I After 6294000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (650.90 seconds)\n", + "Cbc0010I After 6295000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (651.01 seconds)\n", + "Cbc0010I After 6296000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (651.10 seconds)\n", + "Cbc0010I After 6297000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (651.18 seconds)\n", + "Cbc0010I After 6298000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (651.25 seconds)\n", + "Cbc0010I After 6299000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (651.33 seconds)\n", + "Cbc0010I After 6300000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (651.46 seconds)\n", + "Cbc0010I After 6301000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (651.58 seconds)\n", + "Cbc0010I After 6302000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (651.68 seconds)\n", + "Cbc0010I After 6303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (651.79 seconds)\n", + "Cbc0010I After 6304000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (651.88 seconds)\n", + "Cbc0010I After 6305000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (651.99 seconds)\n", + "Cbc0010I After 6306000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (652.08 seconds)\n", + "Cbc0010I After 6307000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (652.19 seconds)\n", + "Cbc0010I After 6308000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (652.28 seconds)\n", + "Cbc0010I After 6309000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (652.40 seconds)\n", + "Cbc0010I After 6310000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (652.52 seconds)\n", + "Cbc0010I After 6311000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (652.61 seconds)\n", + "Cbc0010I After 6312000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (652.70 seconds)\n", + "Cbc0010I After 6313000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (652.81 seconds)\n", + "Cbc0010I After 6314000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (652.90 seconds)\n", + "Cbc0010I After 6315000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (653.01 seconds)\n", + "Cbc0010I After 6316000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (653.07 seconds)\n", + "Cbc0010I After 6317000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (653.12 seconds)\n", + "Cbc0010I After 6318000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (653.18 seconds)\n", + "Cbc0010I After 6319000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (653.23 seconds)\n", + "Cbc0010I After 6320000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (653.30 seconds)\n", + "Cbc0010I After 6321000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (653.35 seconds)\n", + "Cbc0010I After 6322000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (653.42 seconds)\n", + "Cbc0010I After 6323000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (653.48 seconds)\n", + "Cbc0010I After 6324000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (653.54 seconds)\n", + "Cbc0010I After 6325000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (653.59 seconds)\n", + "Cbc0010I After 6326000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (653.65 seconds)\n", + "Cbc0010I After 6327000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (653.70 seconds)\n", + "Cbc0010I After 6328000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (653.77 seconds)\n", + "Cbc0010I After 6329000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (653.81 seconds)\n", + "Cbc0010I After 6330000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (653.86 seconds)\n", + "Cbc0010I After 6331000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (653.93 seconds)\n", + "Cbc0010I After 6332000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (653.98 seconds)\n", + "Cbc0010I After 6333000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (654.06 seconds)\n", + "Cbc0010I After 6334000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (654.12 seconds)\n", + "Cbc0010I After 6335000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (654.20 seconds)\n", + "Cbc0010I After 6336000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (654.31 seconds)\n", + "Cbc0010I After 6337000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (654.44 seconds)\n", + "Cbc0010I After 6338000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (654.59 seconds)\n", + "Cbc0010I After 6339000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (654.74 seconds)\n", + "Cbc0010I After 6340000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (654.83 seconds)\n", + "Cbc0010I After 6341000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (654.90 seconds)\n", + "Cbc0010I After 6342000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (654.96 seconds)\n", + "Cbc0010I After 6343000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (655.01 seconds)\n", + "Cbc0010I After 6344000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (655.07 seconds)\n", + "Cbc0010I After 6345000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (655.15 seconds)\n", + "Cbc0010I After 6346000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (655.20 seconds)\n", + "Cbc0010I After 6347000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (655.25 seconds)\n", + "Cbc0010I After 6348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (655.31 seconds)\n", + "Cbc0010I After 6349000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (655.37 seconds)\n", + "Cbc0010I After 6350000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (655.48 seconds)\n", + "Cbc0010I After 6351000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (655.58 seconds)\n", + "Cbc0010I After 6352000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (655.68 seconds)\n", + "Cbc0010I After 6353000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (655.79 seconds)\n", + "Cbc0010I After 6354000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (655.91 seconds)\n", + "Cbc0010I After 6355000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (655.98 seconds)\n", + "Cbc0010I After 6356000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (656.06 seconds)\n", + "Cbc0010I After 6357000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (656.15 seconds)\n", + "Cbc0010I After 6358000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (656.27 seconds)\n", + "Cbc0010I After 6359000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (656.36 seconds)\n", + "Cbc0010I After 6360000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (656.45 seconds)\n", + "Cbc0010I After 6361000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (656.56 seconds)\n", + "Cbc0010I After 6362000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (656.63 seconds)\n", + "Cbc0010I After 6363000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (656.69 seconds)\n", + "Cbc0010I After 6364000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (656.75 seconds)\n", + "Cbc0010I After 6365000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (656.83 seconds)\n", + "Cbc0010I After 6366000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (656.88 seconds)\n", + "Cbc0010I After 6367000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (656.93 seconds)\n", + "Cbc0010I After 6368000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (656.98 seconds)\n", + "Cbc0010I After 6369000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (657.02 seconds)\n", + "Cbc0010I After 6370000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (657.07 seconds)\n", + "Cbc0010I After 6371000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (657.13 seconds)\n", + "Cbc0010I After 6372000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (657.20 seconds)\n", + "Cbc0010I After 6373000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (657.29 seconds)\n", + "Cbc0010I After 6374000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (657.36 seconds)\n", + "Cbc0010I After 6375000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (657.44 seconds)\n", + "Cbc0010I After 6376000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (657.51 seconds)\n", + "Cbc0010I After 6377000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (657.56 seconds)\n", + "Cbc0010I After 6378000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (657.62 seconds)\n", + "Cbc0010I After 6379000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (657.68 seconds)\n", + "Cbc0010I After 6380000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (657.75 seconds)\n", + "Cbc0010I After 6381000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (657.84 seconds)\n", + "Cbc0010I After 6382000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (657.95 seconds)\n", + "Cbc0010I After 6383000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (658.05 seconds)\n", + "Cbc0010I After 6384000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (658.13 seconds)\n", + "Cbc0010I After 6385000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (658.22 seconds)\n", + "Cbc0010I After 6386000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (658.34 seconds)\n", + "Cbc0010I After 6387000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (658.50 seconds)\n", + "Cbc0010I After 6388000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (658.62 seconds)\n", + "Cbc0010I After 6389000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (658.70 seconds)\n", + "Cbc0010I After 6390000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (658.80 seconds)\n", + "Cbc0010I After 6391000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (658.89 seconds)\n", + "Cbc0010I After 6392000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (658.96 seconds)\n", + "Cbc0010I After 6393000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (659.11 seconds)\n", + "Cbc0010I After 6394000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (659.25 seconds)\n", + "Cbc0010I After 6395000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (659.31 seconds)\n", + "Cbc0010I After 6396000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (659.37 seconds)\n", + "Cbc0010I After 6397000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (659.45 seconds)\n", + "Cbc0010I After 6398000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (659.51 seconds)\n", + "Cbc0010I After 6399000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (659.56 seconds)\n", + "Cbc0010I After 6400000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (659.61 seconds)\n", + "Cbc0010I After 6401000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (659.69 seconds)\n", + "Cbc0010I After 6402000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (659.78 seconds)\n", + "Cbc0010I After 6403000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (659.90 seconds)\n", + "Cbc0010I After 6404000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (660.01 seconds)\n", + "Cbc0010I After 6405000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (660.15 seconds)\n", + "Cbc0010I After 6406000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (660.27 seconds)\n", + "Cbc0010I After 6407000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (660.40 seconds)\n", + "Cbc0010I After 6408000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (660.51 seconds)\n", + "Cbc0010I After 6409000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (660.61 seconds)\n", + "Cbc0010I After 6410000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (660.69 seconds)\n", + "Cbc0010I After 6411000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (660.76 seconds)\n", + "Cbc0010I After 6412000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (660.82 seconds)\n", + "Cbc0010I After 6413000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (660.91 seconds)\n", + "Cbc0010I After 6414000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (661.01 seconds)\n", + "Cbc0010I After 6415000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (661.16 seconds)\n", + "Cbc0010I After 6416000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (661.25 seconds)\n", + "Cbc0010I After 6417000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (661.30 seconds)\n", + "Cbc0010I After 6418000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (661.36 seconds)\n", + "Cbc0010I After 6419000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (661.42 seconds)\n", + "Cbc0010I After 6420000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (661.50 seconds)\n", + "Cbc0010I After 6421000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (661.58 seconds)\n", + "Cbc0010I After 6422000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (661.68 seconds)\n", + "Cbc0010I After 6423000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (661.81 seconds)\n", + "Cbc0010I After 6424000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (661.91 seconds)\n", + "Cbc0010I After 6425000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (662.08 seconds)\n", + "Cbc0010I After 6426000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (662.23 seconds)\n", + "Cbc0010I After 6427000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (662.32 seconds)\n", + "Cbc0010I After 6428000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (662.40 seconds)\n", + "Cbc0010I After 6429000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (662.48 seconds)\n", + "Cbc0010I After 6430000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (662.56 seconds)\n", + "Cbc0010I After 6431000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (662.62 seconds)\n", + "Cbc0010I After 6432000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (662.69 seconds)\n", + "Cbc0010I After 6433000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (662.79 seconds)\n", + "Cbc0010I After 6434000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (662.88 seconds)\n", + "Cbc0010I After 6435000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (662.92 seconds)\n", + "Cbc0010I After 6436000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (662.98 seconds)\n", + "Cbc0010I After 6437000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (663.02 seconds)\n", + "Cbc0010I After 6438000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (663.09 seconds)\n", + "Cbc0010I After 6439000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (663.16 seconds)\n", + "Cbc0010I After 6440000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (663.23 seconds)\n", + "Cbc0010I After 6441000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (663.34 seconds)\n", + "Cbc0010I After 6442000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (663.44 seconds)\n", + "Cbc0010I After 6443000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (663.60 seconds)\n", + "Cbc0010I After 6444000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (663.84 seconds)\n", + "Cbc0010I After 6445000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (663.95 seconds)\n", + "Cbc0010I After 6446000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (664.07 seconds)\n", + "Cbc0010I After 6447000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (664.17 seconds)\n", + "Cbc0010I After 6448000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (664.26 seconds)\n", + "Cbc0010I After 6449000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (664.34 seconds)\n", + "Cbc0010I After 6450000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (664.41 seconds)\n", + "Cbc0010I After 6451000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (664.48 seconds)\n", + "Cbc0010I After 6452000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (664.55 seconds)\n", + "Cbc0010I After 6453000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (664.65 seconds)\n", + "Cbc0010I After 6454000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (664.73 seconds)\n", + "Cbc0010I After 6455000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (664.80 seconds)\n", + "Cbc0010I After 6456000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (664.87 seconds)\n", + "Cbc0010I After 6457000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (664.96 seconds)\n", + "Cbc0010I After 6458000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (665.07 seconds)\n", + "Cbc0010I After 6459000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (665.17 seconds)\n", + "Cbc0010I After 6460000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (665.30 seconds)\n", + "Cbc0010I After 6461000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (665.38 seconds)\n", + "Cbc0010I After 6462000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (665.44 seconds)\n", + "Cbc0010I After 6463000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (665.49 seconds)\n", + "Cbc0010I After 6464000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (665.56 seconds)\n", + "Cbc0010I After 6465000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (665.65 seconds)\n", + "Cbc0010I After 6466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (665.72 seconds)\n", + "Cbc0010I After 6467000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (665.80 seconds)\n", + "Cbc0010I After 6468000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (665.85 seconds)\n", + "Cbc0010I After 6469000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (665.94 seconds)\n", + "Cbc0010I After 6470000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (666.01 seconds)\n", + "Cbc0010I After 6471000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (666.11 seconds)\n", + "Cbc0010I After 6472000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (666.25 seconds)\n", + "Cbc0010I After 6473000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (666.34 seconds)\n", + "Cbc0010I After 6474000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (666.40 seconds)\n", + "Cbc0010I After 6475000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (666.47 seconds)\n", + "Cbc0010I After 6476000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (666.56 seconds)\n", + "Cbc0010I After 6477000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (666.63 seconds)\n", + "Cbc0010I After 6478000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (666.70 seconds)\n", + "Cbc0010I After 6479000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (666.77 seconds)\n", + "Cbc0010I After 6480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (666.85 seconds)\n", + "Cbc0010I After 6481000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (666.91 seconds)\n", + "Cbc0010I After 6482000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (666.99 seconds)\n", + "Cbc0010I After 6483000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (667.06 seconds)\n", + "Cbc0010I After 6484000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (667.11 seconds)\n", + "Cbc0010I After 6485000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (667.16 seconds)\n", + "Cbc0010I After 6486000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (667.22 seconds)\n", + "Cbc0010I After 6487000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (667.30 seconds)\n", + "Cbc0010I After 6488000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (667.40 seconds)\n", + "Cbc0010I After 6489000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (667.50 seconds)\n", + "Cbc0010I After 6490000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (667.60 seconds)\n", + "Cbc0010I After 6491000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (667.71 seconds)\n", + "Cbc0010I After 6492000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (667.83 seconds)\n", + "Cbc0010I After 6493000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (667.95 seconds)\n", + "Cbc0010I After 6494000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (668.08 seconds)\n", + "Cbc0010I After 6495000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (668.14 seconds)\n", + "Cbc0010I After 6496000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (668.24 seconds)\n", + "Cbc0010I After 6497000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (668.31 seconds)\n", + "Cbc0010I After 6498000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (668.35 seconds)\n", + "Cbc0010I After 6499000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (668.40 seconds)\n", + "Cbc0010I After 6500000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (668.45 seconds)\n", + "Cbc0010I After 6501000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (668.49 seconds)\n", + "Cbc0010I After 6502000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (668.57 seconds)\n", + "Cbc0010I After 6503000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (668.63 seconds)\n", + "Cbc0010I After 6504000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (668.67 seconds)\n", + "Cbc0010I After 6505000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (668.74 seconds)\n", + "Cbc0010I After 6506000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (668.80 seconds)\n", + "Cbc0010I After 6507000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (668.92 seconds)\n", + "Cbc0010I After 6508000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (669.03 seconds)\n", + "Cbc0010I After 6509000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (669.15 seconds)\n", + "Cbc0010I After 6510000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (669.22 seconds)\n", + "Cbc0010I After 6511000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (669.29 seconds)\n", + "Cbc0010I After 6512000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (669.41 seconds)\n", + "Cbc0010I After 6513000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (669.51 seconds)\n", + "Cbc0010I After 6514000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (669.63 seconds)\n", + "Cbc0010I After 6515000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (669.71 seconds)\n", + "Cbc0010I After 6516000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (669.79 seconds)\n", + "Cbc0010I After 6517000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (669.84 seconds)\n", + "Cbc0010I After 6518000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (669.90 seconds)\n", + "Cbc0010I After 6519000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (669.95 seconds)\n", + "Cbc0010I After 6520000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (670.00 seconds)\n", + "Cbc0010I After 6521000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (670.06 seconds)\n", + "Cbc0010I After 6522000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.11 seconds)\n", + "Cbc0010I After 6523000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (670.18 seconds)\n", + "Cbc0010I After 6524000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (670.25 seconds)\n", + "Cbc0010I After 6525000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (670.36 seconds)\n", + "Cbc0010I After 6526000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (670.43 seconds)\n", + "Cbc0010I After 6527000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (670.56 seconds)\n", + "Cbc0010I After 6528000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.65 seconds)\n", + "Cbc0010I After 6529000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (670.73 seconds)\n", + "Cbc0010I After 6530000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (670.80 seconds)\n", + "Cbc0010I After 6531000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (670.90 seconds)\n", + "Cbc0010I After 6532000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.99 seconds)\n", + "Cbc0010I After 6533000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (671.07 seconds)\n", + "Cbc0010I After 6534000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (671.21 seconds)\n", + "Cbc0010I After 6535000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (671.32 seconds)\n", + "Cbc0010I After 6536000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (671.39 seconds)\n", + "Cbc0010I After 6537000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (671.48 seconds)\n", + "Cbc0010I After 6538000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (671.59 seconds)\n", + "Cbc0010I After 6539000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (671.68 seconds)\n", + "Cbc0010I After 6540000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (671.76 seconds)\n", + "Cbc0010I After 6541000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (671.82 seconds)\n", + "Cbc0010I After 6542000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (671.93 seconds)\n", + "Cbc0010I After 6543000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (672.01 seconds)\n", + "Cbc0010I After 6544000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (672.10 seconds)\n", + "Cbc0010I After 6545000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (672.18 seconds)\n", + "Cbc0010I After 6546000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (672.28 seconds)\n", + "Cbc0010I After 6547000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (672.36 seconds)\n", + "Cbc0010I After 6548000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (672.44 seconds)\n", + "Cbc0010I After 6549000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (672.52 seconds)\n", + "Cbc0010I After 6550000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (672.61 seconds)\n", + "Cbc0010I After 6551000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (672.68 seconds)\n", + "Cbc0010I After 6552000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (672.77 seconds)\n", + "Cbc0010I After 6553000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (672.82 seconds)\n", + "Cbc0010I After 6554000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (672.87 seconds)\n", + "Cbc0010I After 6555000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (672.94 seconds)\n", + "Cbc0010I After 6556000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (672.98 seconds)\n", + "Cbc0010I After 6557000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (673.07 seconds)\n", + "Cbc0010I After 6558000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (673.14 seconds)\n", + "Cbc0010I After 6559000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (673.22 seconds)\n", + "Cbc0010I After 6560000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (673.30 seconds)\n", + "Cbc0010I After 6561000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (673.38 seconds)\n", + "Cbc0010I After 6562000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (673.46 seconds)\n", + "Cbc0010I After 6563000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (673.55 seconds)\n", + "Cbc0010I After 6564000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (673.64 seconds)\n", + "Cbc0010I After 6565000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (673.77 seconds)\n", + "Cbc0010I After 6566000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (673.91 seconds)\n", + "Cbc0010I After 6567000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (674.02 seconds)\n", + "Cbc0010I After 6568000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (674.12 seconds)\n", + "Cbc0010I After 6569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (674.19 seconds)\n", + "Cbc0010I After 6570000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (674.31 seconds)\n", + "Cbc0010I After 6571000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (674.42 seconds)\n", + "Cbc0010I After 6572000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (674.52 seconds)\n", + "Cbc0010I After 6573000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (674.59 seconds)\n", + "Cbc0010I After 6574000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (674.66 seconds)\n", + "Cbc0010I After 6575000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (674.74 seconds)\n", + "Cbc0010I After 6576000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (674.82 seconds)\n", + "Cbc0010I After 6577000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (674.93 seconds)\n", + "Cbc0010I After 6578000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (674.99 seconds)\n", + "Cbc0010I After 6579000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (675.09 seconds)\n", + "Cbc0010I After 6580000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (675.18 seconds)\n", + "Cbc0010I After 6581000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (675.23 seconds)\n", + "Cbc0010I After 6582000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (675.32 seconds)\n", + "Cbc0010I After 6583000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (675.41 seconds)\n", + "Cbc0010I After 6584000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (675.49 seconds)\n", + "Cbc0010I After 6585000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (675.57 seconds)\n", + "Cbc0010I After 6586000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (675.65 seconds)\n", + "Cbc0010I After 6587000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (675.73 seconds)\n", + "Cbc0010I After 6588000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (675.82 seconds)\n", + "Cbc0010I After 6589000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (675.96 seconds)\n", + "Cbc0010I After 6590000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (676.08 seconds)\n", + "Cbc0010I After 6591000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (676.21 seconds)\n", + "Cbc0010I After 6592000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (676.37 seconds)\n", + "Cbc0010I After 6593000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (676.49 seconds)\n", + "Cbc0010I After 6594000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (676.58 seconds)\n", + "Cbc0010I After 6595000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (676.70 seconds)\n", + "Cbc0010I After 6596000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (676.80 seconds)\n", + "Cbc0010I After 6597000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (676.89 seconds)\n", + "Cbc0010I After 6598000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (677.03 seconds)\n", + "Cbc0010I After 6599000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (677.13 seconds)\n", + "Cbc0010I After 6600000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (677.22 seconds)\n", + "Cbc0010I After 6601000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (677.35 seconds)\n", + "Cbc0010I After 6602000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (677.47 seconds)\n", + "Cbc0010I After 6603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (677.54 seconds)\n", + "Cbc0010I After 6604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (677.61 seconds)\n", + "Cbc0010I After 6605000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (677.68 seconds)\n", + "Cbc0010I After 6606000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (677.76 seconds)\n", + "Cbc0010I After 6607000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (677.85 seconds)\n", + "Cbc0010I After 6608000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (677.91 seconds)\n", + "Cbc0010I After 6609000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (677.98 seconds)\n", + "Cbc0010I After 6610000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (678.05 seconds)\n", + "Cbc0010I After 6611000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (678.12 seconds)\n", + "Cbc0010I After 6612000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (678.19 seconds)\n", + "Cbc0010I After 6613000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (678.24 seconds)\n", + "Cbc0010I After 6614000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (678.30 seconds)\n", + "Cbc0010I After 6615000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (678.39 seconds)\n", + "Cbc0010I After 6616000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (678.46 seconds)\n", + "Cbc0010I After 6617000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (678.52 seconds)\n", + "Cbc0010I After 6618000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (678.59 seconds)\n", + "Cbc0010I After 6619000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (678.63 seconds)\n", + "Cbc0010I After 6620000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (678.67 seconds)\n", + "Cbc0010I After 6621000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (678.71 seconds)\n", + "Cbc0010I After 6622000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (678.75 seconds)\n", + "Cbc0010I After 6623000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (678.80 seconds)\n", + "Cbc0010I After 6624000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (678.85 seconds)\n", + "Cbc0010I After 6625000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (678.89 seconds)\n", + "Cbc0010I After 6626000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (678.94 seconds)\n", + "Cbc0010I After 6627000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (678.98 seconds)\n", + "Cbc0010I After 6628000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (679.02 seconds)\n", + "Cbc0010I After 6629000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (679.07 seconds)\n", + "Cbc0010I After 6630000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (679.12 seconds)\n", + "Cbc0010I After 6631000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (679.17 seconds)\n", + "Cbc0010I After 6632000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (679.21 seconds)\n", + "Cbc0010I After 6633000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (679.26 seconds)\n", + "Cbc0010I After 6634000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (679.31 seconds)\n", + "Cbc0010I After 6635000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.35 seconds)\n", + "Cbc0010I After 6636000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (679.39 seconds)\n", + "Cbc0010I After 6637000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (679.43 seconds)\n", + "Cbc0010I After 6638000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (679.47 seconds)\n", + "Cbc0010I After 6639000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (679.52 seconds)\n", + "Cbc0010I After 6640000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.58 seconds)\n", + "Cbc0010I After 6641000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (679.67 seconds)\n", + "Cbc0010I After 6642000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (679.72 seconds)\n", + "Cbc0010I After 6643000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.81 seconds)\n", + "Cbc0010I After 6644000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (679.94 seconds)\n", + "Cbc0010I After 6645000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (680.10 seconds)\n", + "Cbc0010I After 6646000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (680.26 seconds)\n", + "Cbc0010I After 6647000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (680.35 seconds)\n", + "Cbc0010I After 6648000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (680.45 seconds)\n", + "Cbc0010I After 6649000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (680.54 seconds)\n", + "Cbc0010I After 6650000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (680.61 seconds)\n", + "Cbc0010I After 6651000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (680.70 seconds)\n", + "Cbc0010I After 6652000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (680.77 seconds)\n", + "Cbc0010I After 6653000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (680.87 seconds)\n", + "Cbc0010I After 6654000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (681.09 seconds)\n", + "Cbc0010I After 6655000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (681.23 seconds)\n", + "Cbc0010I After 6656000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (681.40 seconds)\n", + "Cbc0010I After 6657000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (681.61 seconds)\n", + "Cbc0010I After 6658000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (681.80 seconds)\n", + "Cbc0010I After 6659000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (681.94 seconds)\n", + "Cbc0010I After 6660000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (682.04 seconds)\n", + "Cbc0010I After 6661000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (682.13 seconds)\n", + "Cbc0010I After 6662000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (682.25 seconds)\n", + "Cbc0010I After 6663000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (682.37 seconds)\n", + "Cbc0010I After 6664000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (682.49 seconds)\n", + "Cbc0010I After 6665000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (682.60 seconds)\n", + "Cbc0010I After 6666000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (682.70 seconds)\n", + "Cbc0010I After 6667000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (682.93 seconds)\n", + "Cbc0010I After 6668000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (683.12 seconds)\n", + "Cbc0010I After 6669000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (683.20 seconds)\n", + "Cbc0010I After 6670000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (683.27 seconds)\n", + "Cbc0010I After 6671000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (683.35 seconds)\n", + "Cbc0010I After 6672000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (683.45 seconds)\n", + "Cbc0010I After 6673000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (683.53 seconds)\n", + "Cbc0010I After 6674000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (683.62 seconds)\n", + "Cbc0010I After 6675000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (683.72 seconds)\n", + "Cbc0010I After 6676000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (683.80 seconds)\n", + "Cbc0010I After 6677000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (683.91 seconds)\n", + "Cbc0010I After 6678000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (684.00 seconds)\n", + "Cbc0010I After 6679000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (684.08 seconds)\n", + "Cbc0010I After 6680000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (684.18 seconds)\n", + "Cbc0010I After 6681000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (684.30 seconds)\n", + "Cbc0010I After 6682000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (684.38 seconds)\n", + "Cbc0010I After 6683000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (684.46 seconds)\n", + "Cbc0010I After 6684000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (684.52 seconds)\n", + "Cbc0010I After 6685000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (684.63 seconds)\n", + "Cbc0010I After 6686000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (684.69 seconds)\n", + "Cbc0010I After 6687000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (684.77 seconds)\n", + "Cbc0010I After 6688000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (684.85 seconds)\n", + "Cbc0010I After 6689000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (684.95 seconds)\n", + "Cbc0010I After 6690000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (685.03 seconds)\n", + "Cbc0010I After 6691000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (685.10 seconds)\n", + "Cbc0010I After 6692000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (685.21 seconds)\n", + "Cbc0010I After 6693000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (685.37 seconds)\n", + "Cbc0010I After 6694000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (685.54 seconds)\n", + "Cbc0010I After 6695000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (685.74 seconds)\n", + "Cbc0010I After 6696000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (685.93 seconds)\n", + "Cbc0010I After 6697000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (686.08 seconds)\n", + "Cbc0010I After 6698000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (686.15 seconds)\n", + "Cbc0010I After 6699000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (686.23 seconds)\n", + "Cbc0010I After 6700000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (686.32 seconds)\n", + "Cbc0010I After 6701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (686.41 seconds)\n", + "Cbc0010I After 6702000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (686.50 seconds)\n", + "Cbc0010I After 6703000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (686.69 seconds)\n", + "Cbc0010I After 6704000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (686.83 seconds)\n", + "Cbc0010I After 6705000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (687.03 seconds)\n", + "Cbc0010I After 6706000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (687.14 seconds)\n", + "Cbc0010I After 6707000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (687.23 seconds)\n", + "Cbc0010I After 6708000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (687.35 seconds)\n", + "Cbc0010I After 6709000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (687.49 seconds)\n", + "Cbc0010I After 6710000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (687.70 seconds)\n", + "Cbc0010I After 6711000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (687.89 seconds)\n", + "Cbc0010I After 6712000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (687.96 seconds)\n", + "Cbc0010I After 6713000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (688.02 seconds)\n", + "Cbc0010I After 6714000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (688.08 seconds)\n", + "Cbc0010I After 6715000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (688.17 seconds)\n", + "Cbc0010I After 6716000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (688.24 seconds)\n", + "Cbc0010I After 6717000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (688.32 seconds)\n", + "Cbc0010I After 6718000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (688.42 seconds)\n", + "Cbc0010I After 6719000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (688.53 seconds)\n", + "Cbc0010I After 6720000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (688.71 seconds)\n", + "Cbc0010I After 6721000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (688.84 seconds)\n", + "Cbc0010I After 6722000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (688.91 seconds)\n", + "Cbc0010I After 6723000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (688.98 seconds)\n", + "Cbc0010I After 6724000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (689.10 seconds)\n", + "Cbc0010I After 6725000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (689.19 seconds)\n", + "Cbc0010I After 6726000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (689.27 seconds)\n", + "Cbc0010I After 6727000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (689.34 seconds)\n", + "Cbc0010I After 6728000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (689.44 seconds)\n", + "Cbc0010I After 6729000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (689.52 seconds)\n", + "Cbc0010I After 6730000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (689.61 seconds)\n", + "Cbc0010I After 6731000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (689.73 seconds)\n", + "Cbc0010I After 6732000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (689.95 seconds)\n", + "Cbc0010I After 6733000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (690.16 seconds)\n", + "Cbc0010I After 6734000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (690.36 seconds)\n", + "Cbc0010I After 6735000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (690.45 seconds)\n", + "Cbc0010I After 6736000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (690.56 seconds)\n", + "Cbc0010I After 6737000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (690.67 seconds)\n", + "Cbc0010I After 6738000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (690.74 seconds)\n", + "Cbc0010I After 6739000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (690.79 seconds)\n", + "Cbc0010I After 6740000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (690.84 seconds)\n", + "Cbc0010I After 6741000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (690.90 seconds)\n", + "Cbc0010I After 6742000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (691.01 seconds)\n", + "Cbc0010I After 6743000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (691.11 seconds)\n", + "Cbc0010I After 6744000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (691.22 seconds)\n", + "Cbc0010I After 6745000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (691.29 seconds)\n", + "Cbc0010I After 6746000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (691.36 seconds)\n", + "Cbc0010I After 6747000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (691.41 seconds)\n", + "Cbc0010I After 6748000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (691.49 seconds)\n", + "Cbc0010I After 6749000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (691.57 seconds)\n", + "Cbc0010I After 6750000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (691.68 seconds)\n", + "Cbc0010I After 6751000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (691.77 seconds)\n", + "Cbc0010I After 6752000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (691.93 seconds)\n", + "Cbc0010I After 6753000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (692.03 seconds)\n", + "Cbc0010I After 6754000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (692.15 seconds)\n", + "Cbc0010I After 6755000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (692.22 seconds)\n", + "Cbc0010I After 6756000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (692.29 seconds)\n", + "Cbc0010I After 6757000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (692.43 seconds)\n", + "Cbc0010I After 6758000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (692.53 seconds)\n", + "Cbc0010I After 6759000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (692.60 seconds)\n", + "Cbc0010I After 6760000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (692.66 seconds)\n", + "Cbc0010I After 6761000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (692.74 seconds)\n", + "Cbc0010I After 6762000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (692.86 seconds)\n", + "Cbc0010I After 6763000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (692.99 seconds)\n", + "Cbc0010I After 6764000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (693.05 seconds)\n", + "Cbc0010I After 6765000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (693.09 seconds)\n", + "Cbc0010I After 6766000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (693.14 seconds)\n", + "Cbc0010I After 6767000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (693.20 seconds)\n", + "Cbc0010I After 6768000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (693.27 seconds)\n", + "Cbc0010I After 6769000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (693.34 seconds)\n", + "Cbc0010I After 6770000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (693.42 seconds)\n", + "Cbc0010I After 6771000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (693.56 seconds)\n", + "Cbc0010I After 6772000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (693.74 seconds)\n", + "Cbc0010I After 6773000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (693.81 seconds)\n", + "Cbc0010I After 6774000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (693.88 seconds)\n", + "Cbc0010I After 6775000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (693.94 seconds)\n", + "Cbc0010I After 6776000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (693.99 seconds)\n", + "Cbc0010I After 6777000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (694.04 seconds)\n", + "Cbc0010I After 6778000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (694.09 seconds)\n", + "Cbc0010I After 6779000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (694.14 seconds)\n", + "Cbc0010I After 6780000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (694.18 seconds)\n", + "Cbc0010I After 6781000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (694.23 seconds)\n", + "Cbc0010I After 6782000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (694.27 seconds)\n", + "Cbc0010I After 6783000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (694.35 seconds)\n", + "Cbc0010I After 6784000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (694.48 seconds)\n", + "Cbc0010I After 6785000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (694.58 seconds)\n", + "Cbc0010I After 6786000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (694.69 seconds)\n", + "Cbc0010I After 6787000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (694.74 seconds)\n", + "Cbc0010I After 6788000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (694.83 seconds)\n", + "Cbc0010I After 6789000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (694.87 seconds)\n", + "Cbc0010I After 6790000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (694.92 seconds)\n", + "Cbc0010I After 6791000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (694.97 seconds)\n", + "Cbc0010I After 6792000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (695.06 seconds)\n", + "Cbc0010I After 6793000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (695.18 seconds)\n", + "Cbc0010I After 6794000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (695.27 seconds)\n", + "Cbc0010I After 6795000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (695.36 seconds)\n", + "Cbc0010I After 6796000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (695.46 seconds)\n", + "Cbc0010I After 6797000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (695.55 seconds)\n", + "Cbc0010I After 6798000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (695.59 seconds)\n", + "Cbc0010I After 6799000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (695.63 seconds)\n", + "Cbc0010I After 6800000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (695.69 seconds)\n", + "Cbc0010I After 6801000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (695.74 seconds)\n", + "Cbc0010I After 6802000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (695.79 seconds)\n", + "Cbc0010I After 6803000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (695.84 seconds)\n", + "Cbc0010I After 6804000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (695.90 seconds)\n", + "Cbc0010I After 6805000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (695.96 seconds)\n", + "Cbc0010I After 6806000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (696.05 seconds)\n", + "Cbc0010I After 6807000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (696.14 seconds)\n", + "Cbc0010I After 6808000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (696.23 seconds)\n", + "Cbc0010I After 6809000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (696.29 seconds)\n", + "Cbc0010I After 6810000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (696.34 seconds)\n", + "Cbc0010I After 6811000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (696.42 seconds)\n", + "Cbc0010I After 6812000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (696.45 seconds)\n", + "Cbc0010I After 6813000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (696.50 seconds)\n", + "Cbc0010I After 6814000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (696.54 seconds)\n", + "Cbc0010I After 6815000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (696.59 seconds)\n", + "Cbc0010I After 6816000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (696.66 seconds)\n", + "Cbc0010I After 6817000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (696.71 seconds)\n", + "Cbc0010I After 6818000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (696.77 seconds)\n", + "Cbc0010I After 6819000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (696.84 seconds)\n", + "Cbc0010I After 6820000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (696.91 seconds)\n", + "Cbc0010I After 6821000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (696.98 seconds)\n", + "Cbc0010I After 6822000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (697.05 seconds)\n", + "Cbc0010I After 6823000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (697.09 seconds)\n", + "Cbc0010I After 6824000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (697.14 seconds)\n", + "Cbc0010I After 6825000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (697.20 seconds)\n", + "Cbc0010I After 6826000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (697.25 seconds)\n", + "Cbc0010I After 6827000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (697.31 seconds)\n", + "Cbc0010I After 6828000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (697.36 seconds)\n", + "Cbc0010I After 6829000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (697.44 seconds)\n", + "Cbc0010I After 6830000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (697.51 seconds)\n", + "Cbc0010I After 6831000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (697.58 seconds)\n", + "Cbc0010I After 6832000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (697.67 seconds)\n", + "Cbc0010I After 6833000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (697.75 seconds)\n", + "Cbc0010I After 6834000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (697.80 seconds)\n", + "Cbc0010I After 6835000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (697.83 seconds)\n", + "Cbc0010I After 6836000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (697.87 seconds)\n", + "Cbc0010I After 6837000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (697.94 seconds)\n", + "Cbc0010I After 6838000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (698.00 seconds)\n", + "Cbc0010I After 6839000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (698.06 seconds)\n", + "Cbc0010I After 6840000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (698.11 seconds)\n", + "Cbc0010I After 6841000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (698.15 seconds)\n", + "Cbc0010I After 6842000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (698.20 seconds)\n", + "Cbc0010I After 6843000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (698.27 seconds)\n", + "Cbc0010I After 6844000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (698.34 seconds)\n", + "Cbc0010I After 6845000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (698.40 seconds)\n", + "Cbc0010I After 6846000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (698.47 seconds)\n", + "Cbc0010I After 6847000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (698.56 seconds)\n", + "Cbc0010I After 6848000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (698.64 seconds)\n", + "Cbc0010I After 6849000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (698.73 seconds)\n", + "Cbc0010I After 6850000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (698.81 seconds)\n", + "Cbc0010I After 6851000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (698.91 seconds)\n", + "Cbc0010I After 6852000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (698.98 seconds)\n", + "Cbc0010I After 6853000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (699.06 seconds)\n", + "Cbc0010I After 6854000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (699.17 seconds)\n", + "Cbc0010I After 6855000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (699.25 seconds)\n", + "Cbc0010I After 6856000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (699.33 seconds)\n", + "Cbc0010I After 6857000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (699.40 seconds)\n", + "Cbc0010I After 6858000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (699.45 seconds)\n", + "Cbc0010I After 6859000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (699.51 seconds)\n", + "Cbc0010I After 6860000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (699.58 seconds)\n", + "Cbc0010I After 6861000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (699.63 seconds)\n", + "Cbc0010I After 6862000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (699.69 seconds)\n", + "Cbc0010I After 6863000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (699.75 seconds)\n", + "Cbc0010I After 6864000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (699.81 seconds)\n", + "Cbc0010I After 6865000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (699.87 seconds)\n", + "Cbc0010I After 6866000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (699.93 seconds)\n", + "Cbc0010I After 6867000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (699.97 seconds)\n", + "Cbc0010I After 6868000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (700.02 seconds)\n", + "Cbc0010I After 6869000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.08 seconds)\n", + "Cbc0010I After 6870000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (700.13 seconds)\n", + "Cbc0010I After 6871000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (700.18 seconds)\n", + "Cbc0010I After 6872000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (700.23 seconds)\n", + "Cbc0010I After 6873000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (700.29 seconds)\n", + "Cbc0010I After 6874000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (700.33 seconds)\n", + "Cbc0010I After 6875000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (700.38 seconds)\n", + "Cbc0010I After 6876000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (700.43 seconds)\n", + "Cbc0010I After 6877000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (700.48 seconds)\n", + "Cbc0010I After 6878000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.51 seconds)\n", + "Cbc0010I After 6879000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (700.55 seconds)\n", + "Cbc0010I After 6880000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.60 seconds)\n", + "Cbc0010I After 6881000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (700.64 seconds)\n", + "Cbc0010I After 6882000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (700.70 seconds)\n", + "Cbc0010I After 6883000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (700.77 seconds)\n", + "Cbc0010I After 6884000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (700.87 seconds)\n", + "Cbc0010I After 6885000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (700.96 seconds)\n", + "Cbc0010I After 6886000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (701.08 seconds)\n", + "Cbc0010I After 6887000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (701.18 seconds)\n", + "Cbc0010I After 6888000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (701.28 seconds)\n", + "Cbc0010I After 6889000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (701.38 seconds)\n", + "Cbc0010I After 6890000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (701.47 seconds)\n", + "Cbc0010I After 6891000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (701.56 seconds)\n", + "Cbc0010I After 6892000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (701.62 seconds)\n", + "Cbc0010I After 6893000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (701.70 seconds)\n", + "Cbc0010I After 6894000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (701.80 seconds)\n", + "Cbc0010I After 6895000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (701.93 seconds)\n", + "Cbc0010I After 6896000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (702.01 seconds)\n", + "Cbc0010I After 6897000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (702.10 seconds)\n", + "Cbc0010I After 6898000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (702.19 seconds)\n", + "Cbc0010I After 6899000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (702.28 seconds)\n", + "Cbc0010I After 6900000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (702.37 seconds)\n", + "Cbc0010I After 6901000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (702.45 seconds)\n", + "Cbc0010I After 6902000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (702.52 seconds)\n", + "Cbc0010I After 6903000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (702.60 seconds)\n", + "Cbc0010I After 6904000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (702.66 seconds)\n", + "Cbc0010I After 6905000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (702.72 seconds)\n", + "Cbc0010I After 6906000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (702.79 seconds)\n", + "Cbc0010I After 6907000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (702.89 seconds)\n", + "Cbc0010I After 6908000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (702.97 seconds)\n", + "Cbc0010I After 6909000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (703.06 seconds)\n", + "Cbc0010I After 6910000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (703.16 seconds)\n", + "Cbc0010I After 6911000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (703.27 seconds)\n", + "Cbc0010I After 6912000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (703.56 seconds)\n", + "Cbc0010I After 6913000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (703.70 seconds)\n", + "Cbc0010I After 6914000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (703.95 seconds)\n", + "Cbc0010I After 6915000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (704.04 seconds)\n", + "Cbc0010I After 6916000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (704.12 seconds)\n", + "Cbc0010I After 6917000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (704.20 seconds)\n", + "Cbc0010I After 6918000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (704.27 seconds)\n", + "Cbc0010I After 6919000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (704.34 seconds)\n", + "Cbc0010I After 6920000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (704.46 seconds)\n", + "Cbc0010I After 6921000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (704.60 seconds)\n", + "Cbc0010I After 6922000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (704.72 seconds)\n", + "Cbc0010I After 6923000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (704.81 seconds)\n", + "Cbc0010I After 6924000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (704.91 seconds)\n", + "Cbc0010I After 6925000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (704.98 seconds)\n", + "Cbc0010I After 6926000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (705.05 seconds)\n", + "Cbc0010I After 6927000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (705.15 seconds)\n", + "Cbc0010I After 6928000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (705.25 seconds)\n", + "Cbc0010I After 6929000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (705.30 seconds)\n", + "Cbc0010I After 6930000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (705.41 seconds)\n", + "Cbc0010I After 6931000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (705.48 seconds)\n", + "Cbc0010I After 6932000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (705.55 seconds)\n", + "Cbc0010I After 6933000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (705.60 seconds)\n", + "Cbc0010I After 6934000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (705.65 seconds)\n", + "Cbc0010I After 6935000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (705.73 seconds)\n", + "Cbc0010I After 6936000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (705.79 seconds)\n", + "Cbc0010I After 6937000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (705.86 seconds)\n", + "Cbc0010I After 6938000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (705.99 seconds)\n", + "Cbc0010I After 6939000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (706.10 seconds)\n", + "Cbc0010I After 6940000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (706.22 seconds)\n", + "Cbc0010I After 6941000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (706.36 seconds)\n", + "Cbc0010I After 6942000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (706.54 seconds)\n", + "Cbc0010I After 6943000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (706.63 seconds)\n", + "Cbc0010I After 6944000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (706.71 seconds)\n", + "Cbc0010I After 6945000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (706.85 seconds)\n", + "Cbc0010I After 6946000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (706.93 seconds)\n", + "Cbc0010I After 6947000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (707.02 seconds)\n", + "Cbc0010I After 6948000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (707.08 seconds)\n", + "Cbc0010I After 6949000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (707.21 seconds)\n", + "Cbc0010I After 6950000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (707.34 seconds)\n", + "Cbc0010I After 6951000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (707.42 seconds)\n", + "Cbc0010I After 6952000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (707.51 seconds)\n", + "Cbc0010I After 6953000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (707.58 seconds)\n", + "Cbc0010I After 6954000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (707.67 seconds)\n", + "Cbc0010I After 6955000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (707.76 seconds)\n", + "Cbc0010I After 6956000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (707.91 seconds)\n", + "Cbc0010I After 6957000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (708.14 seconds)\n", + "Cbc0010I After 6958000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (708.32 seconds)\n", + "Cbc0010I After 6959000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (708.48 seconds)\n", + "Cbc0010I After 6960000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (708.65 seconds)\n", + "Cbc0010I After 6961000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (708.77 seconds)\n", + "Cbc0010I After 6962000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (708.89 seconds)\n", + "Cbc0010I After 6963000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (709.01 seconds)\n", + "Cbc0010I After 6964000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (709.10 seconds)\n", + "Cbc0010I After 6965000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (709.20 seconds)\n", + "Cbc0010I After 6966000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.29 seconds)\n", + "Cbc0010I After 6967000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (709.41 seconds)\n", + "Cbc0010I After 6968000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.55 seconds)\n", + "Cbc0010I After 6969000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.72 seconds)\n", + "Cbc0010I After 6970000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (709.87 seconds)\n", + "Cbc0010I After 6971000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (710.00 seconds)\n", + "Cbc0010I After 6972000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (710.14 seconds)\n", + "Cbc0010I After 6973000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (710.23 seconds)\n", + "Cbc0010I After 6974000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (710.35 seconds)\n", + "Cbc0010I After 6975000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (710.45 seconds)\n", + "Cbc0010I After 6976000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (710.53 seconds)\n", + "Cbc0010I After 6977000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (710.61 seconds)\n", + "Cbc0010I After 6978000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (710.69 seconds)\n", + "Cbc0010I After 6979000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (710.76 seconds)\n", + "Cbc0010I After 6980000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (710.84 seconds)\n", + "Cbc0010I After 6981000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (710.91 seconds)\n", + "Cbc0010I After 6982000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (710.97 seconds)\n", + "Cbc0010I After 6983000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (711.05 seconds)\n", + "Cbc0010I After 6984000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (711.12 seconds)\n", + "Cbc0010I After 6985000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (711.21 seconds)\n", + "Cbc0010I After 6986000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (711.29 seconds)\n", + "Cbc0010I After 6987000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (711.38 seconds)\n", + "Cbc0010I After 6988000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (711.51 seconds)\n", + "Cbc0010I After 6989000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (711.68 seconds)\n", + "Cbc0010I After 6990000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (711.85 seconds)\n", + "Cbc0010I After 6991000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (712.09 seconds)\n", + "Cbc0010I After 6992000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (712.38 seconds)\n", + "Cbc0010I After 6993000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (712.70 seconds)\n", + "Cbc0010I After 6994000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (712.88 seconds)\n", + "Cbc0010I After 6995000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (713.01 seconds)\n", + "Cbc0010I After 6996000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (713.18 seconds)\n", + "Cbc0010I After 6997000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (713.34 seconds)\n", + "Cbc0010I After 6998000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (713.47 seconds)\n", + "Cbc0010I After 6999000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (713.58 seconds)\n", + "Cbc0010I After 7000000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (713.65 seconds)\n", + "Cbc0010I After 7001000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (713.75 seconds)\n", + "Cbc0010I After 7002000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (713.84 seconds)\n", + "Cbc0010I After 7003000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (713.93 seconds)\n", + "Cbc0010I After 7004000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (714.03 seconds)\n", + "Cbc0010I After 7005000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (714.12 seconds)\n", + "Cbc0010I After 7006000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (714.19 seconds)\n", + "Cbc0010I After 7007000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (714.30 seconds)\n", + "Cbc0010I After 7008000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (714.42 seconds)\n", + "Cbc0010I After 7009000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (714.52 seconds)\n", + "Cbc0010I After 7010000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (714.60 seconds)\n", + "Cbc0010I After 7011000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (714.69 seconds)\n", + "Cbc0010I After 7012000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (714.77 seconds)\n", + "Cbc0010I After 7013000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (714.86 seconds)\n", + "Cbc0010I After 7014000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (714.95 seconds)\n", + "Cbc0010I After 7015000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (715.03 seconds)\n", + "Cbc0010I After 7016000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (715.13 seconds)\n", + "Cbc0010I After 7017000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (715.20 seconds)\n", + "Cbc0010I After 7018000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (715.27 seconds)\n", + "Cbc0010I After 7019000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (715.34 seconds)\n", + "Cbc0010I After 7020000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (715.42 seconds)\n", + "Cbc0010I After 7021000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (715.49 seconds)\n", + "Cbc0010I After 7022000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (715.57 seconds)\n", + "Cbc0010I After 7023000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (715.64 seconds)\n", + "Cbc0010I After 7024000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (715.72 seconds)\n", + "Cbc0010I After 7025000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (715.80 seconds)\n", + "Cbc0010I After 7026000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (715.89 seconds)\n", + "Cbc0010I After 7027000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (715.97 seconds)\n", + "Cbc0010I After 7028000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (716.04 seconds)\n", + "Cbc0010I After 7029000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (716.10 seconds)\n", + "Cbc0010I After 7030000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (716.16 seconds)\n", + "Cbc0010I After 7031000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (716.21 seconds)\n", + "Cbc0010I After 7032000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (716.27 seconds)\n", + "Cbc0010I After 7033000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (716.36 seconds)\n", + "Cbc0010I After 7034000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (716.44 seconds)\n", + "Cbc0010I After 7035000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (716.52 seconds)\n", + "Cbc0010I After 7036000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (716.65 seconds)\n", + "Cbc0010I After 7037000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (716.83 seconds)\n", + "Cbc0010I After 7038000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (716.96 seconds)\n", + "Cbc0010I After 7039000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (717.10 seconds)\n", + "Cbc0010I After 7040000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (717.20 seconds)\n", + "Cbc0010I After 7041000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (717.30 seconds)\n", + "Cbc0010I After 7042000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (717.40 seconds)\n", + "Cbc0010I After 7043000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (717.48 seconds)\n", + "Cbc0010I After 7044000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (717.55 seconds)\n", + "Cbc0010I After 7045000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (717.65 seconds)\n", + "Cbc0010I After 7046000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (717.73 seconds)\n", + "Cbc0010I After 7047000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (717.82 seconds)\n", + "Cbc0010I After 7048000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (717.90 seconds)\n", + "Cbc0010I After 7049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (718.06 seconds)\n", + "Cbc0010I After 7050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (718.20 seconds)\n", + "Cbc0010I After 7051000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (718.32 seconds)\n", + "Cbc0010I After 7052000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (718.42 seconds)\n", + "Cbc0010I After 7053000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (718.50 seconds)\n", + "Cbc0010I After 7054000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (718.56 seconds)\n", + "Cbc0010I After 7055000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (718.62 seconds)\n", + "Cbc0010I After 7056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (718.68 seconds)\n", + "Cbc0010I After 7057000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (718.74 seconds)\n", + "Cbc0010I After 7058000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (718.78 seconds)\n", + "Cbc0010I After 7059000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (718.83 seconds)\n", + "Cbc0010I After 7060000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (718.89 seconds)\n", + "Cbc0010I After 7061000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (718.97 seconds)\n", + "Cbc0010I After 7062000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (719.05 seconds)\n", + "Cbc0010I After 7063000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (719.11 seconds)\n", + "Cbc0010I After 7064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (719.18 seconds)\n", + "Cbc0010I After 7065000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (719.26 seconds)\n", + "Cbc0010I After 7066000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (719.35 seconds)\n", + "Cbc0010I After 7067000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (719.43 seconds)\n", + "Cbc0010I After 7068000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (719.50 seconds)\n", + "Cbc0010I After 7069000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (719.55 seconds)\n", + "Cbc0010I After 7070000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (719.58 seconds)\n", + "Cbc0010I After 7071000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (719.62 seconds)\n", + "Cbc0010I After 7072000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (719.66 seconds)\n", + "Cbc0010I After 7073000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (719.72 seconds)\n", + "Cbc0010I After 7074000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (719.76 seconds)\n", + "Cbc0010I After 7075000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (719.81 seconds)\n", + "Cbc0010I After 7076000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (719.86 seconds)\n", + "Cbc0010I After 7077000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (719.92 seconds)\n", + "Cbc0010I After 7078000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (719.97 seconds)\n", + "Cbc0010I After 7079000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (720.02 seconds)\n", + "Cbc0010I After 7080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (720.07 seconds)\n", + "Cbc0010I After 7081000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (720.14 seconds)\n", + "Cbc0010I After 7082000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (720.22 seconds)\n", + "Cbc0010I After 7083000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (720.29 seconds)\n", + "Cbc0010I After 7084000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (720.37 seconds)\n", + "Cbc0010I After 7085000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (720.44 seconds)\n", + "Cbc0010I After 7086000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (720.51 seconds)\n", + "Cbc0010I After 7087000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (720.58 seconds)\n", + "Cbc0010I After 7088000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (720.65 seconds)\n", + "Cbc0010I After 7089000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (720.75 seconds)\n", + "Cbc0010I After 7090000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (720.86 seconds)\n", + "Cbc0010I After 7091000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (720.96 seconds)\n", + "Cbc0010I After 7092000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (721.00 seconds)\n", + "Cbc0010I After 7093000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (721.05 seconds)\n", + "Cbc0010I After 7094000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (721.14 seconds)\n", + "Cbc0010I After 7095000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (721.25 seconds)\n", + "Cbc0010I After 7096000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (721.41 seconds)\n", + "Cbc0010I After 7097000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (721.48 seconds)\n", + "Cbc0010I After 7098000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (721.55 seconds)\n", + "Cbc0010I After 7099000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (721.64 seconds)\n", + "Cbc0010I After 7100000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (721.69 seconds)\n", + "Cbc0010I After 7101000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (721.77 seconds)\n", + "Cbc0010I After 7102000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (721.88 seconds)\n", + "Cbc0010I After 7103000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (721.98 seconds)\n", + "Cbc0010I After 7104000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (722.05 seconds)\n", + "Cbc0010I After 7105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (722.09 seconds)\n", + "Cbc0010I After 7106000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (722.14 seconds)\n", + "Cbc0010I After 7107000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (722.19 seconds)\n", + "Cbc0010I After 7108000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (722.23 seconds)\n", + "Cbc0010I After 7109000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (722.27 seconds)\n", + "Cbc0010I After 7110000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (722.33 seconds)\n", + "Cbc0010I After 7111000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (722.41 seconds)\n", + "Cbc0010I After 7112000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (722.49 seconds)\n", + "Cbc0010I After 7113000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (722.58 seconds)\n", + "Cbc0010I After 7114000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (722.64 seconds)\n", + "Cbc0010I After 7115000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (722.69 seconds)\n", + "Cbc0010I After 7116000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (722.73 seconds)\n", + "Cbc0010I After 7117000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (722.79 seconds)\n", + "Cbc0010I After 7118000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (722.86 seconds)\n", + "Cbc0010I After 7119000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (722.94 seconds)\n", + "Cbc0010I After 7120000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (723.00 seconds)\n", + "Cbc0010I After 7121000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (723.07 seconds)\n", + "Cbc0010I After 7122000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (723.18 seconds)\n", + "Cbc0010I After 7123000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (723.23 seconds)\n", + "Cbc0010I After 7124000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (723.29 seconds)\n", + "Cbc0010I After 7125000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (723.38 seconds)\n", + "Cbc0010I After 7126000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (723.44 seconds)\n", + "Cbc0010I After 7127000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (723.50 seconds)\n", + "Cbc0010I After 7128000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (723.57 seconds)\n", + "Cbc0010I After 7129000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (723.66 seconds)\n", + "Cbc0010I After 7130000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (723.78 seconds)\n", + "Cbc0010I After 7131000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (723.84 seconds)\n", + "Cbc0010I After 7132000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (723.92 seconds)\n", + "Cbc0010I After 7133000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (724.00 seconds)\n", + "Cbc0010I After 7134000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (724.08 seconds)\n", + "Cbc0010I After 7135000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (724.14 seconds)\n", + "Cbc0010I After 7136000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (724.22 seconds)\n", + "Cbc0010I After 7137000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (724.31 seconds)\n", + "Cbc0010I After 7138000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (724.38 seconds)\n", + "Cbc0010I After 7139000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (724.57 seconds)\n", + "Cbc0010I After 7140000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (724.64 seconds)\n", + "Cbc0010I After 7141000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (724.73 seconds)\n", + "Cbc0010I After 7142000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (724.84 seconds)\n", + "Cbc0010I After 7143000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (724.90 seconds)\n", + "Cbc0010I After 7144000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (724.95 seconds)\n", + "Cbc0010I After 7145000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (725.01 seconds)\n", + "Cbc0010I After 7146000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (725.06 seconds)\n", + "Cbc0010I After 7147000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (725.12 seconds)\n", + "Cbc0010I After 7148000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (725.25 seconds)\n", + "Cbc0010I After 7149000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (725.31 seconds)\n", + "Cbc0010I After 7150000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (725.36 seconds)\n", + "Cbc0010I After 7151000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (725.50 seconds)\n", + "Cbc0010I After 7152000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (725.60 seconds)\n", + "Cbc0010I After 7153000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (725.69 seconds)\n", + "Cbc0010I After 7154000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (725.74 seconds)\n", + "Cbc0010I After 7155000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (725.84 seconds)\n", + "Cbc0010I After 7156000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (725.90 seconds)\n", + "Cbc0010I After 7157000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (726.00 seconds)\n", + "Cbc0010I After 7158000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (726.07 seconds)\n", + "Cbc0010I After 7159000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (726.13 seconds)\n", + "Cbc0010I After 7160000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (726.18 seconds)\n", + "Cbc0010I After 7161000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.24 seconds)\n", + "Cbc0010I After 7162000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (726.35 seconds)\n", + "Cbc0010I After 7163000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (726.46 seconds)\n", + "Cbc0010I After 7164000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.55 seconds)\n", + "Cbc0010I After 7165000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.65 seconds)\n", + "Cbc0010I After 7166000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (726.75 seconds)\n", + "Cbc0010I After 7167000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (726.85 seconds)\n", + "Cbc0010I After 7168000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (726.96 seconds)\n", + "Cbc0010I After 7169000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (727.08 seconds)\n", + "Cbc0010I After 7170000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (727.13 seconds)\n", + "Cbc0010I After 7171000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (727.18 seconds)\n", + "Cbc0010I After 7172000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (727.25 seconds)\n", + "Cbc0010I After 7173000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (727.33 seconds)\n", + "Cbc0010I After 7174000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (727.43 seconds)\n", + "Cbc0010I After 7175000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (727.48 seconds)\n", + "Cbc0010I After 7176000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (727.52 seconds)\n", + "Cbc0010I After 7177000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (727.56 seconds)\n", + "Cbc0010I After 7178000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (727.62 seconds)\n", + "Cbc0010I After 7179000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (727.74 seconds)\n", + "Cbc0010I After 7180000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (727.81 seconds)\n", + "Cbc0010I After 7181000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (727.91 seconds)\n", + "Cbc0010I After 7182000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (727.96 seconds)\n", + "Cbc0010I After 7183000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (728.07 seconds)\n", + "Cbc0010I After 7184000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (728.12 seconds)\n", + "Cbc0010I After 7185000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (728.17 seconds)\n", + "Cbc0010I After 7186000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (728.23 seconds)\n", + "Cbc0010I After 7187000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (728.30 seconds)\n", + "Cbc0010I After 7188000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (728.38 seconds)\n", + "Cbc0010I After 7189000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (728.52 seconds)\n", + "Cbc0010I After 7190000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (728.67 seconds)\n", + "Cbc0010I After 7191000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (728.76 seconds)\n", + "Cbc0010I After 7192000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (728.86 seconds)\n", + "Cbc0010I After 7193000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (728.97 seconds)\n", + "Cbc0010I After 7194000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (729.13 seconds)\n", + "Cbc0010I After 7195000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (729.29 seconds)\n", + "Cbc0010I After 7196000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (729.38 seconds)\n", + "Cbc0010I After 7197000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (729.46 seconds)\n", + "Cbc0010I After 7198000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (729.51 seconds)\n", + "Cbc0010I After 7199000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (729.58 seconds)\n", + "Cbc0010I After 7200000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (729.66 seconds)\n", + "Cbc0010I After 7201000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (729.74 seconds)\n", + "Cbc0010I After 7202000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (729.86 seconds)\n", + "Cbc0010I After 7203000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (729.93 seconds)\n", + "Cbc0010I After 7204000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (730.00 seconds)\n", + "Cbc0010I After 7205000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (730.06 seconds)\n", + "Cbc0010I After 7206000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (730.11 seconds)\n", + "Cbc0010I After 7207000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (730.17 seconds)\n", + "Cbc0010I After 7208000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (730.23 seconds)\n", + "Cbc0010I After 7209000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (730.29 seconds)\n", + "Cbc0010I After 7210000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (730.35 seconds)\n", + "Cbc0010I After 7211000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (730.40 seconds)\n", + "Cbc0010I After 7212000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (730.46 seconds)\n", + "Cbc0010I After 7213000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (730.53 seconds)\n", + "Cbc0010I After 7214000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (730.64 seconds)\n", + "Cbc0010I After 7215000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (730.69 seconds)\n", + "Cbc0010I After 7216000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (730.75 seconds)\n", + "Cbc0010I After 7217000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (730.81 seconds)\n", + "Cbc0010I After 7218000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (730.88 seconds)\n", + "Cbc0010I After 7219000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (731.00 seconds)\n", + "Cbc0010I After 7220000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (731.11 seconds)\n", + "Cbc0010I After 7221000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (731.19 seconds)\n", + "Cbc0010I After 7222000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (731.28 seconds)\n", + "Cbc0010I After 7223000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (731.36 seconds)\n", + "Cbc0010I After 7224000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (731.41 seconds)\n", + "Cbc0010I After 7225000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (731.46 seconds)\n", + "Cbc0010I After 7226000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (731.52 seconds)\n", + "Cbc0010I After 7227000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (731.61 seconds)\n", + "Cbc0010I After 7228000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (731.66 seconds)\n", + "Cbc0010I After 7229000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (731.74 seconds)\n", + "Cbc0010I After 7230000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (731.86 seconds)\n", + "Cbc0010I After 7231000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (732.02 seconds)\n", + "Cbc0010I After 7232000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (732.15 seconds)\n", + "Cbc0010I After 7233000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (732.23 seconds)\n", + "Cbc0010I After 7234000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (732.34 seconds)\n", + "Cbc0010I After 7235000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (732.57 seconds)\n", + "Cbc0010I After 7236000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (732.73 seconds)\n", + "Cbc0010I After 7237000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (732.85 seconds)\n", + "Cbc0010I After 7238000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (732.98 seconds)\n", + "Cbc0010I After 7239000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (733.08 seconds)\n", + "Cbc0010I After 7240000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (733.19 seconds)\n", + "Cbc0010I After 7241000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (733.31 seconds)\n", + "Cbc0010I After 7242000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (733.39 seconds)\n", + "Cbc0010I After 7243000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (733.51 seconds)\n", + "Cbc0010I After 7244000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (733.67 seconds)\n", + "Cbc0010I After 7245000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (733.83 seconds)\n", + "Cbc0010I After 7246000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (733.94 seconds)\n", + "Cbc0010I After 7247000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (734.08 seconds)\n", + "Cbc0010I After 7248000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (734.26 seconds)\n", + "Cbc0010I After 7249000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (734.41 seconds)\n", + "Cbc0010I After 7250000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (734.55 seconds)\n", + "Cbc0010I After 7251000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (734.71 seconds)\n", + "Cbc0010I After 7252000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (734.84 seconds)\n", + "Cbc0010I After 7253000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (734.94 seconds)\n", + "Cbc0010I After 7254000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (735.06 seconds)\n", + "Cbc0010I After 7255000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (735.20 seconds)\n", + "Cbc0010I After 7256000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (735.33 seconds)\n", + "Cbc0010I After 7257000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (735.39 seconds)\n", + "Cbc0010I After 7258000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (735.45 seconds)\n", + "Cbc0010I After 7259000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (735.50 seconds)\n", + "Cbc0010I After 7260000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (735.58 seconds)\n", + "Cbc0010I After 7261000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (735.67 seconds)\n", + "Cbc0010I After 7262000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (735.75 seconds)\n", + "Cbc0010I After 7263000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (735.82 seconds)\n", + "Cbc0010I After 7264000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (735.91 seconds)\n", + "Cbc0010I After 7265000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (735.99 seconds)\n", + "Cbc0010I After 7266000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (736.07 seconds)\n", + "Cbc0010I After 7267000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (736.17 seconds)\n", + "Cbc0010I After 7268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (736.24 seconds)\n", + "Cbc0010I After 7269000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (736.30 seconds)\n", + "Cbc0010I After 7270000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (736.39 seconds)\n", + "Cbc0010I After 7271000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (736.55 seconds)\n", + "Cbc0010I After 7272000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (736.66 seconds)\n", + "Cbc0010I After 7273000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (736.80 seconds)\n", + "Cbc0010I After 7274000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (736.95 seconds)\n", + "Cbc0010I After 7275000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (737.07 seconds)\n", + "Cbc0010I After 7276000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (737.23 seconds)\n", + "Cbc0010I After 7277000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (737.38 seconds)\n", + "Cbc0010I After 7278000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (737.65 seconds)\n", + "Cbc0010I After 7279000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (738.03 seconds)\n", + "Cbc0010I After 7280000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (738.36 seconds)\n", + "Cbc0010I After 7281000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (738.71 seconds)\n", + "Cbc0010I After 7282000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (739.03 seconds)\n", + "Cbc0010I After 7283000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (739.37 seconds)\n", + "Cbc0010I After 7284000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (739.82 seconds)\n", + "Cbc0010I After 7285000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (740.11 seconds)\n", + "Cbc0010I After 7286000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (740.43 seconds)\n", + "Cbc0010I After 7287000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (740.76 seconds)\n", + "Cbc0010I After 7288000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (741.03 seconds)\n", + "Cbc0010I After 7289000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (741.23 seconds)\n", + "Cbc0010I After 7290000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (741.41 seconds)\n", + "Cbc0010I After 7291000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (741.57 seconds)\n", + "Cbc0010I After 7292000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (741.70 seconds)\n", + "Cbc0010I After 7293000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (741.84 seconds)\n", + "Cbc0010I After 7294000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (741.93 seconds)\n", + "Cbc0010I After 7295000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (742.03 seconds)\n", + "Cbc0010I After 7296000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (742.12 seconds)\n", + "Cbc0010I After 7297000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (742.20 seconds)\n", + "Cbc0010I After 7298000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (742.31 seconds)\n", + "Cbc0010I After 7299000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (742.43 seconds)\n", + "Cbc0010I After 7300000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (742.55 seconds)\n", + "Cbc0010I After 7301000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (742.65 seconds)\n", + "Cbc0010I After 7302000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (742.78 seconds)\n", + "Cbc0010I After 7303000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (742.88 seconds)\n", + "Cbc0010I After 7304000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (742.99 seconds)\n", + "Cbc0010I After 7305000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (743.14 seconds)\n", + "Cbc0010I After 7306000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (743.22 seconds)\n", + "Cbc0010I After 7307000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (743.33 seconds)\n", + "Cbc0010I After 7308000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (743.42 seconds)\n", + "Cbc0010I After 7309000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (743.53 seconds)\n", + "Cbc0010I After 7310000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (743.62 seconds)\n", + "Cbc0010I After 7311000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (743.72 seconds)\n", + "Cbc0010I After 7312000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (743.83 seconds)\n", + "Cbc0010I After 7313000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (743.96 seconds)\n", + "Cbc0010I After 7314000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (744.08 seconds)\n", + "Cbc0010I After 7315000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (744.20 seconds)\n", + "Cbc0010I After 7316000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (744.30 seconds)\n", + "Cbc0010I After 7317000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (744.36 seconds)\n", + "Cbc0010I After 7318000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (744.43 seconds)\n", + "Cbc0010I After 7319000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (744.53 seconds)\n", + "Cbc0010I After 7320000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (744.59 seconds)\n", + "Cbc0010I After 7321000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (744.69 seconds)\n", + "Cbc0010I After 7322000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (744.81 seconds)\n", + "Cbc0010I After 7323000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (744.93 seconds)\n", + "Cbc0010I After 7324000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (745.04 seconds)\n", + "Cbc0010I After 7325000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (745.12 seconds)\n", + "Cbc0010I After 7326000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (745.21 seconds)\n", + "Cbc0010I After 7327000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (745.29 seconds)\n", + "Cbc0010I After 7328000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (745.33 seconds)\n", + "Cbc0010I After 7329000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (745.40 seconds)\n", + "Cbc0010I After 7330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (745.45 seconds)\n", + "Cbc0010I After 7331000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (745.50 seconds)\n", + "Cbc0010I After 7332000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (745.55 seconds)\n", + "Cbc0010I After 7333000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (745.61 seconds)\n", + "Cbc0010I After 7334000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (745.71 seconds)\n", + "Cbc0010I After 7335000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (745.79 seconds)\n", + "Cbc0010I After 7336000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (745.87 seconds)\n", + "Cbc0010I After 7337000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (745.93 seconds)\n", + "Cbc0010I After 7338000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (746.02 seconds)\n", + "Cbc0010I After 7339000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (746.06 seconds)\n", + "Cbc0010I After 7340000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (746.14 seconds)\n", + "Cbc0010I After 7341000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (746.19 seconds)\n", + "Cbc0010I After 7342000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (746.24 seconds)\n", + "Cbc0010I After 7343000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (746.31 seconds)\n", + "Cbc0010I After 7344000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (746.37 seconds)\n", + "Cbc0010I After 7345000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (746.40 seconds)\n", + "Cbc0010I After 7346000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (746.44 seconds)\n", + "Cbc0010I After 7347000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (746.48 seconds)\n", + "Cbc0010I After 7348000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (746.53 seconds)\n", + "Cbc0010I After 7349000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (746.57 seconds)\n", + "Cbc0010I After 7350000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (746.60 seconds)\n", + "Cbc0010I After 7351000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (746.65 seconds)\n", + "Cbc0010I After 7352000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (746.69 seconds)\n", + "Cbc0010I After 7353000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (746.72 seconds)\n", + "Cbc0010I After 7354000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (746.78 seconds)\n", + "Cbc0010I After 7355000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (746.84 seconds)\n", + "Cbc0010I After 7356000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (746.88 seconds)\n", + "Cbc0010I After 7357000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (746.92 seconds)\n", + "Cbc0010I After 7358000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (746.99 seconds)\n", + "Cbc0010I After 7359000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (747.04 seconds)\n", + "Cbc0010I After 7360000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (747.10 seconds)\n", + "Cbc0010I After 7361000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (747.23 seconds)\n", + "Cbc0010I After 7362000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.30 seconds)\n", + "Cbc0010I After 7363000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (747.39 seconds)\n", + "Cbc0010I After 7364000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (747.47 seconds)\n", + "Cbc0010I After 7365000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (747.54 seconds)\n", + "Cbc0010I After 7366000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.62 seconds)\n", + "Cbc0010I After 7367000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.69 seconds)\n", + "Cbc0010I After 7368000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (747.76 seconds)\n", + "Cbc0010I After 7369000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (747.84 seconds)\n", + "Cbc0010I After 7370000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (747.92 seconds)\n", + "Cbc0010I After 7371000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (748.01 seconds)\n", + "Cbc0010I After 7372000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (748.09 seconds)\n", + "Cbc0010I After 7373000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (748.18 seconds)\n", + "Cbc0010I After 7374000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (748.25 seconds)\n", + "Cbc0010I After 7375000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (748.32 seconds)\n", + "Cbc0010I After 7376000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.37 seconds)\n", + "Cbc0010I After 7377000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (748.43 seconds)\n", + "Cbc0010I After 7378000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (748.48 seconds)\n", + "Cbc0010I After 7379000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.54 seconds)\n", + "Cbc0010I After 7380000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (748.60 seconds)\n", + "Cbc0010I After 7381000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (748.66 seconds)\n", + "Cbc0010I After 7382000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (748.70 seconds)\n", + "Cbc0010I After 7383000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (748.76 seconds)\n", + "Cbc0010I After 7384000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (748.81 seconds)\n", + "Cbc0010I After 7385000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.86 seconds)\n", + "Cbc0010I After 7386000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (748.90 seconds)\n", + "Cbc0010I After 7387000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (748.95 seconds)\n", + "Cbc0010I After 7388000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (749.01 seconds)\n", + "Cbc0010I After 7389000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.05 seconds)\n", + "Cbc0010I After 7390000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.11 seconds)\n", + "Cbc0010I After 7391000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (749.16 seconds)\n", + "Cbc0010I After 7392000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (749.20 seconds)\n", + "Cbc0010I After 7393000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (749.26 seconds)\n", + "Cbc0010I After 7394000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (749.30 seconds)\n", + "Cbc0010I After 7395000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (749.36 seconds)\n", + "Cbc0010I After 7396000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (749.40 seconds)\n", + "Cbc0010I After 7397000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (749.45 seconds)\n", + "Cbc0010I After 7398000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (749.49 seconds)\n", + "Cbc0010I After 7399000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (749.53 seconds)\n", + "Cbc0010I After 7400000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (749.58 seconds)\n", + "Cbc0010I After 7401000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (749.64 seconds)\n", + "Cbc0010I After 7402000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (749.71 seconds)\n", + "Cbc0010I After 7403000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (749.76 seconds)\n", + "Cbc0010I After 7404000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (749.82 seconds)\n", + "Cbc0010I After 7405000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (749.87 seconds)\n", + "Cbc0010I After 7406000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (749.92 seconds)\n", + "Cbc0010I After 7407000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.98 seconds)\n", + "Cbc0010I After 7408000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (750.02 seconds)\n", + "Cbc0010I After 7409000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (750.08 seconds)\n", + "Cbc0010I After 7410000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (750.14 seconds)\n", + "Cbc0010I After 7411000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (750.20 seconds)\n", + "Cbc0010I After 7412000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (750.25 seconds)\n", + "Cbc0010I After 7413000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (750.32 seconds)\n", + "Cbc0010I After 7414000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (750.37 seconds)\n", + "Cbc0010I After 7415000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (750.44 seconds)\n", + "Cbc0010I After 7416000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (750.52 seconds)\n", + "Cbc0010I After 7417000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (750.62 seconds)\n", + "Cbc0010I After 7418000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (750.71 seconds)\n", + "Cbc0010I After 7419000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (750.84 seconds)\n", + "Cbc0010I After 7420000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (750.99 seconds)\n", + "Cbc0010I After 7421000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (751.08 seconds)\n", + "Cbc0010I After 7422000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (751.15 seconds)\n", + "Cbc0010I After 7423000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (751.30 seconds)\n", + "Cbc0010I After 7424000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (751.40 seconds)\n", + "Cbc0010I After 7425000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.50 seconds)\n", + "Cbc0010I After 7426000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.61 seconds)\n", + "Cbc0010I After 7427000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (751.71 seconds)\n", + "Cbc0010I After 7428000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.80 seconds)\n", + "Cbc0010I After 7429000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (751.92 seconds)\n", + "Cbc0010I After 7430000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (752.05 seconds)\n", + "Cbc0010I After 7431000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (752.13 seconds)\n", + "Cbc0010I After 7432000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (752.19 seconds)\n", + "Cbc0010I After 7433000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (752.27 seconds)\n", + "Cbc0010I After 7434000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (752.38 seconds)\n", + "Cbc0010I After 7435000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (752.52 seconds)\n", + "Cbc0010I After 7436000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (752.64 seconds)\n", + "Cbc0010I After 7437000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (752.81 seconds)\n", + "Cbc0010I After 7438000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (752.98 seconds)\n", + "Cbc0010I After 7439000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (753.14 seconds)\n", + "Cbc0010I After 7440000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (753.24 seconds)\n", + "Cbc0010I After 7441000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (753.35 seconds)\n", + "Cbc0010I After 7442000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (753.46 seconds)\n", + "Cbc0010I After 7443000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (753.57 seconds)\n", + "Cbc0010I After 7444000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (753.66 seconds)\n", + "Cbc0010I After 7445000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (753.77 seconds)\n", + "Cbc0010I After 7446000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (753.85 seconds)\n", + "Cbc0010I After 7447000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (753.91 seconds)\n", + "Cbc0010I After 7448000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (753.97 seconds)\n", + "Cbc0010I After 7449000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (754.05 seconds)\n", + "Cbc0010I After 7450000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (754.09 seconds)\n", + "Cbc0010I After 7451000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (754.13 seconds)\n", + "Cbc0010I After 7452000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (754.17 seconds)\n", + "Cbc0010I After 7453000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (754.22 seconds)\n", + "Cbc0010I After 7454000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (754.25 seconds)\n", + "Cbc0010I After 7455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (754.28 seconds)\n", + "Cbc0010I After 7456000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (754.33 seconds)\n", + "Cbc0010I After 7457000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (754.38 seconds)\n", + "Cbc0010I After 7458000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (754.43 seconds)\n", + "Cbc0010I After 7459000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (754.49 seconds)\n", + "Cbc0010I After 7460000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (754.54 seconds)\n", + "Cbc0010I After 7461000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (754.58 seconds)\n", + "Cbc0010I After 7462000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (754.62 seconds)\n", + "Cbc0010I After 7463000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (754.67 seconds)\n", + "Cbc0010I After 7464000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (754.73 seconds)\n", + "Cbc0010I After 7465000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (754.77 seconds)\n", + "Cbc0010I After 7466000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (754.80 seconds)\n", + "Cbc0010I After 7467000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (754.85 seconds)\n", + "Cbc0010I After 7468000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (754.91 seconds)\n", + "Cbc0010I After 7469000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (754.99 seconds)\n", + "Cbc0010I After 7470000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (755.04 seconds)\n", + "Cbc0010I After 7471000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (755.09 seconds)\n", + "Cbc0010I After 7472000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (755.14 seconds)\n", + "Cbc0010I After 7473000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (755.19 seconds)\n", + "Cbc0010I After 7474000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (755.23 seconds)\n", + "Cbc0010I After 7475000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (755.26 seconds)\n", + "Cbc0010I After 7476000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (755.29 seconds)\n", + "Cbc0010I After 7477000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (755.34 seconds)\n", + "Cbc0010I After 7478000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (755.39 seconds)\n", + "Cbc0010I After 7479000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (755.44 seconds)\n", + "Cbc0010I After 7480000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (755.52 seconds)\n", + "Cbc0010I After 7481000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (755.58 seconds)\n", + "Cbc0010I After 7482000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (755.64 seconds)\n", + "Cbc0010I After 7483000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (755.69 seconds)\n", + "Cbc0010I After 7484000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (755.75 seconds)\n", + "Cbc0010I After 7485000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (755.81 seconds)\n", + "Cbc0010I After 7486000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (755.88 seconds)\n", + "Cbc0010I After 7487000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (755.95 seconds)\n", + "Cbc0010I After 7488000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (756.01 seconds)\n", + "Cbc0010I After 7489000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (756.06 seconds)\n", + "Cbc0010I After 7490000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (756.11 seconds)\n", + "Cbc0010I After 7491000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (756.17 seconds)\n", + "Cbc0010I After 7492000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (756.22 seconds)\n", + "Cbc0010I After 7493000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (756.28 seconds)\n", + "Cbc0010I After 7494000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (756.33 seconds)\n", + "Cbc0010I After 7495000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (756.38 seconds)\n", + "Cbc0010I After 7496000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (756.44 seconds)\n", + "Cbc0010I After 7497000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (756.50 seconds)\n", + "Cbc0010I After 7498000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (756.57 seconds)\n", + "Cbc0010I After 7499000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (756.63 seconds)\n", + "Cbc0010I After 7500000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (756.68 seconds)\n", + "Cbc0010I After 7501000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (756.75 seconds)\n", + "Cbc0010I After 7502000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (756.82 seconds)\n", + "Cbc0010I After 7503000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (756.88 seconds)\n", + "Cbc0010I After 7504000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (756.94 seconds)\n", + "Cbc0010I After 7505000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (757.00 seconds)\n", + "Cbc0010I After 7506000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (757.06 seconds)\n", + "Cbc0010I After 7507000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (757.12 seconds)\n", + "Cbc0010I After 7508000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (757.18 seconds)\n", + "Cbc0010I After 7509000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (757.24 seconds)\n", + "Cbc0010I After 7510000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (757.30 seconds)\n", + "Cbc0010I After 7511000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (757.36 seconds)\n", + "Cbc0010I After 7512000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (757.42 seconds)\n", + "Cbc0010I After 7513000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (757.48 seconds)\n", + "Cbc0010I After 7514000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (757.53 seconds)\n", + "Cbc0010I After 7515000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (757.59 seconds)\n", + "Cbc0010I After 7516000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (757.65 seconds)\n", + "Cbc0010I After 7517000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (757.71 seconds)\n", + "Cbc0010I After 7518000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (757.76 seconds)\n", + "Cbc0010I After 7519000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (757.82 seconds)\n", + "Cbc0010I After 7520000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (757.90 seconds)\n", + "Cbc0010I After 7521000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (757.98 seconds)\n", + "Cbc0010I After 7522000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (758.04 seconds)\n", + "Cbc0010I After 7523000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (758.10 seconds)\n", + "Cbc0010I After 7524000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (758.16 seconds)\n", + "Cbc0010I After 7525000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (758.25 seconds)\n", + "Cbc0010I After 7526000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.29 seconds)\n", + "Cbc0010I After 7527000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (758.35 seconds)\n", + "Cbc0010I After 7528000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (758.42 seconds)\n", + "Cbc0010I After 7529000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (758.46 seconds)\n", + "Cbc0010I After 7530000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.49 seconds)\n", + "Cbc0010I After 7531000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.53 seconds)\n", + "Cbc0010I After 7532000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (758.59 seconds)\n", + "Cbc0010I After 7533000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (758.63 seconds)\n", + "Cbc0010I After 7534000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (758.67 seconds)\n", + "Cbc0010I After 7535000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (758.71 seconds)\n", + "Cbc0010I After 7536000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (758.74 seconds)\n", + "Cbc0010I After 7537000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (758.78 seconds)\n", + "Cbc0010I After 7538000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (758.82 seconds)\n", + "Cbc0010I After 7539000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (758.86 seconds)\n", + "Cbc0010I After 7540000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (758.90 seconds)\n", + "Cbc0010I After 7541000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (758.94 seconds)\n", + "Cbc0010I After 7542000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (758.98 seconds)\n", + "Cbc0010I After 7543000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.02 seconds)\n", + "Cbc0010I After 7544000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (759.08 seconds)\n", + "Cbc0010I After 7545000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.14 seconds)\n", + "Cbc0010I After 7546000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (759.21 seconds)\n", + "Cbc0010I After 7547000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (759.24 seconds)\n", + "Cbc0010I After 7548000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (759.28 seconds)\n", + "Cbc0010I After 7549000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (759.32 seconds)\n", + "Cbc0010I After 7550000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (759.35 seconds)\n", + "Cbc0010I After 7551000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (759.39 seconds)\n", + "Cbc0010I After 7552000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (759.43 seconds)\n", + "Cbc0010I After 7553000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (759.47 seconds)\n", + "Cbc0010I After 7554000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (759.50 seconds)\n", + "Cbc0010I After 7555000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (759.54 seconds)\n", + "Cbc0010I After 7556000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.62 seconds)\n", + "Cbc0010I After 7557000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (759.66 seconds)\n", + "Cbc0010I After 7558000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (759.73 seconds)\n", + "Cbc0010I After 7559000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (759.78 seconds)\n", + "Cbc0010I After 7560000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (759.86 seconds)\n", + "Cbc0010I After 7561000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (759.91 seconds)\n", + "Cbc0010I After 7562000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (759.98 seconds)\n", + "Cbc0010I After 7563000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (760.04 seconds)\n", + "Cbc0010I After 7564000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (760.10 seconds)\n", + "Cbc0010I After 7565000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (760.17 seconds)\n", + "Cbc0010I After 7566000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (760.29 seconds)\n", + "Cbc0010I After 7567000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (760.39 seconds)\n", + "Cbc0010I After 7568000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (760.49 seconds)\n", + "Cbc0010I After 7569000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (760.57 seconds)\n", + "Cbc0010I After 7570000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (760.66 seconds)\n", + "Cbc0010I After 7571000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (760.85 seconds)\n", + "Cbc0010I After 7572000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (760.95 seconds)\n", + "Cbc0010I After 7573000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (761.01 seconds)\n", + "Cbc0010I After 7574000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (761.09 seconds)\n", + "Cbc0010I After 7575000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (761.19 seconds)\n", + "Cbc0010I After 7576000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (761.30 seconds)\n", + "Cbc0010I After 7577000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (761.39 seconds)\n", + "Cbc0010I After 7578000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (761.44 seconds)\n", + "Cbc0010I After 7579000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (761.49 seconds)\n", + "Cbc0010I After 7580000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (761.53 seconds)\n", + "Cbc0010I After 7581000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (761.58 seconds)\n", + "Cbc0010I After 7582000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (761.63 seconds)\n", + "Cbc0010I After 7583000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (761.71 seconds)\n", + "Cbc0010I After 7584000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (761.76 seconds)\n", + "Cbc0010I After 7585000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (761.79 seconds)\n", + "Cbc0010I After 7586000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (761.83 seconds)\n", + "Cbc0010I After 7587000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (761.87 seconds)\n", + "Cbc0010I After 7588000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (761.91 seconds)\n", + "Cbc0010I After 7589000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (761.98 seconds)\n", + "Cbc0010I After 7590000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (762.02 seconds)\n", + "Cbc0010I After 7591000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (762.06 seconds)\n", + "Cbc0010I After 7592000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.10 seconds)\n", + "Cbc0010I After 7593000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (762.16 seconds)\n", + "Cbc0010I After 7594000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (762.24 seconds)\n", + "Cbc0010I After 7595000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (762.28 seconds)\n", + "Cbc0010I After 7596000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (762.32 seconds)\n", + "Cbc0010I After 7597000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (762.36 seconds)\n", + "Cbc0010I After 7598000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (762.39 seconds)\n", + "Cbc0010I After 7599000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (762.42 seconds)\n", + "Cbc0010I After 7600000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (762.46 seconds)\n", + "Cbc0010I After 7601000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (762.49 seconds)\n", + "Cbc0010I After 7602000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (762.53 seconds)\n", + "Cbc0010I After 7603000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (762.57 seconds)\n", + "Cbc0010I After 7604000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (762.61 seconds)\n", + "Cbc0010I After 7605000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.65 seconds)\n", + "Cbc0010I After 7606000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (762.69 seconds)\n", + "Cbc0010I After 7607000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (762.73 seconds)\n", + "Cbc0010I After 7608000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (762.76 seconds)\n", + "Cbc0010I After 7609000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.80 seconds)\n", + "Cbc0010I After 7610000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (762.83 seconds)\n", + "Cbc0010I After 7611000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (762.87 seconds)\n", + "Cbc0010I After 7612000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (762.91 seconds)\n", + "Cbc0010I After 7613000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (763.00 seconds)\n", + "Cbc0010I After 7614000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (763.07 seconds)\n", + "Cbc0010I After 7615000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.12 seconds)\n", + "Cbc0010I After 7616000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (763.15 seconds)\n", + "Cbc0010I After 7617000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (763.19 seconds)\n", + "Cbc0010I After 7618000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (763.22 seconds)\n", + "Cbc0010I After 7619000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (763.27 seconds)\n", + "Cbc0010I After 7620000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (763.31 seconds)\n", + "Cbc0010I After 7621000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (763.35 seconds)\n", + "Cbc0010I After 7622000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (763.40 seconds)\n", + "Cbc0010I After 7623000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (763.44 seconds)\n", + "Cbc0010I After 7624000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (763.48 seconds)\n", + "Cbc0010I After 7625000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.52 seconds)\n", + "Cbc0010I After 7626000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (763.55 seconds)\n", + "Cbc0010I After 7627000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (763.59 seconds)\n", + "Cbc0010I After 7628000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (763.63 seconds)\n", + "Cbc0010I After 7629000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (763.67 seconds)\n", + "Cbc0010I After 7630000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.71 seconds)\n", + "Cbc0010I After 7631000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (763.74 seconds)\n", + "Cbc0010I After 7632000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (763.78 seconds)\n", + "Cbc0010I After 7633000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (763.81 seconds)\n", + "Cbc0010I After 7634000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (763.85 seconds)\n", + "Cbc0010I After 7635000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (763.91 seconds)\n", + "Cbc0010I After 7636000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (763.98 seconds)\n", + "Cbc0010I After 7637000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (764.04 seconds)\n", + "Cbc0010I After 7638000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (764.12 seconds)\n", + "Cbc0010I After 7639000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (764.18 seconds)\n", + "Cbc0010I After 7640000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (764.22 seconds)\n", + "Cbc0010I After 7641000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (764.25 seconds)\n", + "Cbc0010I After 7642000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (764.30 seconds)\n", + "Cbc0010I After 7643000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (764.35 seconds)\n", + "Cbc0010I After 7644000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (764.41 seconds)\n", + "Cbc0010I After 7645000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (764.45 seconds)\n", + "Cbc0010I After 7646000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (764.48 seconds)\n", + "Cbc0010I After 7647000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (764.51 seconds)\n", + "Cbc0010I After 7648000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (764.55 seconds)\n", + "Cbc0010I After 7649000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (764.59 seconds)\n", + "Cbc0010I After 7650000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (764.63 seconds)\n", + "Cbc0010I After 7651000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (764.69 seconds)\n", + "Cbc0010I After 7652000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (764.73 seconds)\n", + "Cbc0010I After 7653000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (764.81 seconds)\n", + "Cbc0010I After 7654000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (764.93 seconds)\n", + "Cbc0010I After 7655000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (764.99 seconds)\n", + "Cbc0010I After 7656000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (765.08 seconds)\n", + "Cbc0010I After 7657000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (765.20 seconds)\n", + "Cbc0010I After 7658000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (765.30 seconds)\n", + "Cbc0010I After 7659000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (765.35 seconds)\n", + "Cbc0010I After 7660000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (765.39 seconds)\n", + "Cbc0010I After 7661000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (765.46 seconds)\n", + "Cbc0010I After 7662000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (765.54 seconds)\n", + "Cbc0010I After 7663000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (765.62 seconds)\n", + "Cbc0010I After 7664000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (765.67 seconds)\n", + "Cbc0010I After 7665000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (765.70 seconds)\n", + "Cbc0010I After 7666000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (765.74 seconds)\n", + "Cbc0010I After 7667000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (765.78 seconds)\n", + "Cbc0010I After 7668000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (765.82 seconds)\n", + "Cbc0010I After 7669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (765.86 seconds)\n", + "Cbc0010I After 7670000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (765.90 seconds)\n", + "Cbc0010I After 7671000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (765.95 seconds)\n", + "Cbc0010I After 7672000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (765.98 seconds)\n", + "Cbc0010I After 7673000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (766.02 seconds)\n", + "Cbc0010I After 7674000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (766.06 seconds)\n", + "Cbc0010I After 7675000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (766.11 seconds)\n", + "Cbc0010I After 7676000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (766.15 seconds)\n", + "Cbc0010I After 7677000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (766.18 seconds)\n", + "Cbc0010I After 7678000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (766.22 seconds)\n", + "Cbc0010I After 7679000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (766.26 seconds)\n", + "Cbc0010I After 7680000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (766.33 seconds)\n", + "Cbc0010I After 7681000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (766.37 seconds)\n", + "Cbc0010I After 7682000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (766.41 seconds)\n", + "Cbc0010I After 7683000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (766.44 seconds)\n", + "Cbc0010I After 7684000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (766.52 seconds)\n", + "Cbc0010I After 7685000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (766.58 seconds)\n", + "Cbc0010I After 7686000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (766.62 seconds)\n", + "Cbc0010I After 7687000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (766.66 seconds)\n", + "Cbc0010I After 7688000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (766.70 seconds)\n", + "Cbc0010I After 7689000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (766.75 seconds)\n", + "Cbc0010I After 7690000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (766.84 seconds)\n", + "Cbc0010I After 7691000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (766.92 seconds)\n", + "Cbc0010I After 7692000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (767.00 seconds)\n", + "Cbc0010I After 7693000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (767.08 seconds)\n", + "Cbc0010I After 7694000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (767.16 seconds)\n", + "Cbc0010I After 7695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (767.25 seconds)\n", + "Cbc0010I After 7696000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (767.34 seconds)\n", + "Cbc0010I After 7697000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (767.43 seconds)\n", + "Cbc0010I After 7698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (767.53 seconds)\n", + "Cbc0010I After 7699000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (767.65 seconds)\n", + "Cbc0010I After 7700000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (767.77 seconds)\n", + "Cbc0010I After 7701000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (767.88 seconds)\n", + "Cbc0010I After 7702000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (767.99 seconds)\n", + "Cbc0010I After 7703000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (768.12 seconds)\n", + "Cbc0010I After 7704000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (768.19 seconds)\n", + "Cbc0010I After 7705000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (768.24 seconds)\n", + "Cbc0010I After 7706000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (768.29 seconds)\n", + "Cbc0010I After 7707000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (768.35 seconds)\n", + "Cbc0010I After 7708000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (768.40 seconds)\n", + "Cbc0010I After 7709000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (768.45 seconds)\n", + "Cbc0010I After 7710000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (768.50 seconds)\n", + "Cbc0010I After 7711000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (768.55 seconds)\n", + "Cbc0010I After 7712000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (768.64 seconds)\n", + "Cbc0010I After 7713000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (768.72 seconds)\n", + "Cbc0010I After 7714000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (768.76 seconds)\n", + "Cbc0010I After 7715000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (768.79 seconds)\n", + "Cbc0010I After 7716000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (768.86 seconds)\n", + "Cbc0010I After 7717000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (768.90 seconds)\n", + "Cbc0010I After 7718000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (768.95 seconds)\n", + "Cbc0010I After 7719000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (769.03 seconds)\n", + "Cbc0010I After 7720000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.08 seconds)\n", + "Cbc0010I After 7721000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (769.12 seconds)\n", + "Cbc0010I After 7722000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (769.15 seconds)\n", + "Cbc0010I After 7723000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.19 seconds)\n", + "Cbc0010I After 7724000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.25 seconds)\n", + "Cbc0010I After 7725000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (769.31 seconds)\n", + "Cbc0010I After 7726000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (769.41 seconds)\n", + "Cbc0010I After 7727000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (769.54 seconds)\n", + "Cbc0010I After 7728000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (769.66 seconds)\n", + "Cbc0010I After 7729000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (769.79 seconds)\n", + "Cbc0010I After 7730000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (769.90 seconds)\n", + "Cbc0010I After 7731000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (770.02 seconds)\n", + "Cbc0010I After 7732000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.12 seconds)\n", + "Cbc0010I After 7733000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (770.22 seconds)\n", + "Cbc0010I After 7734000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (770.31 seconds)\n", + "Cbc0010I After 7735000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (770.38 seconds)\n", + "Cbc0010I After 7736000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (770.47 seconds)\n", + "Cbc0010I After 7737000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (770.57 seconds)\n", + "Cbc0010I After 7738000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.69 seconds)\n", + "Cbc0010I After 7739000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (770.78 seconds)\n", + "Cbc0010I After 7740000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (770.88 seconds)\n", + "Cbc0010I After 7741000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.96 seconds)\n", + "Cbc0010I After 7742000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (771.05 seconds)\n", + "Cbc0010I After 7743000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (771.13 seconds)\n", + "Cbc0010I After 7744000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (771.20 seconds)\n", + "Cbc0010I After 7745000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (771.25 seconds)\n", + "Cbc0010I After 7746000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (771.29 seconds)\n", + "Cbc0010I After 7747000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (771.33 seconds)\n", + "Cbc0010I After 7748000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.40 seconds)\n", + "Cbc0010I After 7749000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (771.44 seconds)\n", + "Cbc0010I After 7750000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (771.48 seconds)\n", + "Cbc0010I After 7751000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.52 seconds)\n", + "Cbc0010I After 7752000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.56 seconds)\n", + "Cbc0010I After 7753000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (771.61 seconds)\n", + "Cbc0010I After 7754000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (771.65 seconds)\n", + "Cbc0010I After 7755000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (771.69 seconds)\n", + "Cbc0010I After 7756000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (771.73 seconds)\n", + "Cbc0010I After 7757000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (771.76 seconds)\n", + "Cbc0010I After 7758000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (771.81 seconds)\n", + "Cbc0010I After 7759000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (771.89 seconds)\n", + "Cbc0010I After 7760000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (771.92 seconds)\n", + "Cbc0010I After 7761000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (771.95 seconds)\n", + "Cbc0010I After 7762000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (771.99 seconds)\n", + "Cbc0010I After 7763000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (772.03 seconds)\n", + "Cbc0010I After 7764000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (772.06 seconds)\n", + "Cbc0010I After 7765000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (772.10 seconds)\n", + "Cbc0010I After 7766000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (772.14 seconds)\n", + "Cbc0010I After 7767000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (772.19 seconds)\n", + "Cbc0010I After 7768000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (772.22 seconds)\n", + "Cbc0010I After 7769000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (772.27 seconds)\n", + "Cbc0010I After 7770000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (772.32 seconds)\n", + "Cbc0010I After 7771000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (772.39 seconds)\n", + "Cbc0010I After 7772000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (772.46 seconds)\n", + "Cbc0010I After 7773000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (772.53 seconds)\n", + "Cbc0010I After 7774000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (772.60 seconds)\n", + "Cbc0010I After 7775000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (772.64 seconds)\n", + "Cbc0010I After 7776000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (772.68 seconds)\n", + "Cbc0010I After 7777000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (772.74 seconds)\n", + "Cbc0010I After 7778000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (772.80 seconds)\n", + "Cbc0010I After 7779000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (772.85 seconds)\n", + "Cbc0010I After 7780000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (772.91 seconds)\n", + "Cbc0010I After 7781000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (772.97 seconds)\n", + "Cbc0010I After 7782000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (773.04 seconds)\n", + "Cbc0010I After 7783000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (773.10 seconds)\n", + "Cbc0010I After 7784000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (773.17 seconds)\n", + "Cbc0010I After 7785000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (773.23 seconds)\n", + "Cbc0010I After 7786000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (773.29 seconds)\n", + "Cbc0010I After 7787000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (773.35 seconds)\n", + "Cbc0010I After 7788000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (773.39 seconds)\n", + "Cbc0010I After 7789000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (773.43 seconds)\n", + "Cbc0010I After 7790000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (773.46 seconds)\n", + "Cbc0010I After 7791000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (773.50 seconds)\n", + "Cbc0010I After 7792000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (773.54 seconds)\n", + "Cbc0010I After 7793000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (773.58 seconds)\n", + "Cbc0010I After 7794000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (773.63 seconds)\n", + "Cbc0010I After 7795000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (773.68 seconds)\n", + "Cbc0010I After 7796000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (773.75 seconds)\n", + "Cbc0010I After 7797000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (773.79 seconds)\n", + "Cbc0010I After 7798000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (773.83 seconds)\n", + "Cbc0010I After 7799000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (773.86 seconds)\n", + "Cbc0010I After 7800000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (773.89 seconds)\n", + "Cbc0010I After 7801000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (773.93 seconds)\n", + "Cbc0010I After 7802000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (773.96 seconds)\n", + "Cbc0010I After 7803000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (774.00 seconds)\n", + "Cbc0010I After 7804000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (774.03 seconds)\n", + "Cbc0010I After 7805000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (774.08 seconds)\n", + "Cbc0010I After 7806000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (774.14 seconds)\n", + "Cbc0010I After 7807000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (774.18 seconds)\n", + "Cbc0010I After 7808000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (774.24 seconds)\n", + "Cbc0010I After 7809000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (774.28 seconds)\n", + "Cbc0010I After 7810000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (774.33 seconds)\n", + "Cbc0010I After 7811000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (774.39 seconds)\n", + "Cbc0010I After 7812000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (774.45 seconds)\n", + "Cbc0010I After 7813000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (774.50 seconds)\n", + "Cbc0010I After 7814000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (774.53 seconds)\n", + "Cbc0010I After 7815000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (774.56 seconds)\n", + "Cbc0010I After 7816000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (774.60 seconds)\n", + "Cbc0010I After 7817000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (774.63 seconds)\n", + "Cbc0010I After 7818000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (774.67 seconds)\n", + "Cbc0010I After 7819000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (774.70 seconds)\n", + "Cbc0010I After 7820000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (774.75 seconds)\n", + "Cbc0010I After 7821000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (774.81 seconds)\n", + "Cbc0010I After 7822000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (774.87 seconds)\n", + "Cbc0010I After 7823000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (774.92 seconds)\n", + "Cbc0010I After 7824000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (774.95 seconds)\n", + "Cbc0010I After 7825000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (774.99 seconds)\n", + "Cbc0010I After 7826000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (775.03 seconds)\n", + "Cbc0010I After 7827000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (775.07 seconds)\n", + "Cbc0010I After 7828000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (775.13 seconds)\n", + "Cbc0010I After 7829000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (775.18 seconds)\n", + "Cbc0010I After 7830000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (775.23 seconds)\n", + "Cbc0010I After 7831000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (775.28 seconds)\n", + "Cbc0010I After 7832000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (775.32 seconds)\n", + "Cbc0010I After 7833000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (775.36 seconds)\n", + "Cbc0010I After 7834000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (775.39 seconds)\n", + "Cbc0010I After 7835000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (775.43 seconds)\n", + "Cbc0010I After 7836000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (775.47 seconds)\n", + "Cbc0010I After 7837000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (775.51 seconds)\n", + "Cbc0010I After 7838000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (775.58 seconds)\n", + "Cbc0010I After 7839000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (775.64 seconds)\n", + "Cbc0010I After 7840000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (775.69 seconds)\n", + "Cbc0010I After 7841000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (775.73 seconds)\n", + "Cbc0010I After 7842000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (775.78 seconds)\n", + "Cbc0010I After 7843000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (775.83 seconds)\n", + "Cbc0010I After 7844000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (775.88 seconds)\n", + "Cbc0010I After 7845000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (775.94 seconds)\n", + "Cbc0010I After 7846000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (775.97 seconds)\n", + "Cbc0010I After 7847000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (776.01 seconds)\n", + "Cbc0010I After 7848000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (776.06 seconds)\n", + "Cbc0010I After 7849000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (776.09 seconds)\n", + "Cbc0010I After 7850000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (776.14 seconds)\n", + "Cbc0010I After 7851000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (776.18 seconds)\n", + "Cbc0010I After 7852000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (776.24 seconds)\n", + "Cbc0010I After 7853000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (776.38 seconds)\n", + "Cbc0010I After 7854000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (776.46 seconds)\n", + "Cbc0010I After 7855000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (776.52 seconds)\n", + "Cbc0010I After 7856000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (776.58 seconds)\n", + "Cbc0010I After 7857000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (776.64 seconds)\n", + "Cbc0010I After 7858000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (776.69 seconds)\n", + "Cbc0010I After 7859000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (776.73 seconds)\n", + "Cbc0010I After 7860000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (776.79 seconds)\n", + "Cbc0010I After 7861000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (776.83 seconds)\n", + "Cbc0010I After 7862000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (776.88 seconds)\n", + "Cbc0010I After 7863000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (776.93 seconds)\n", + "Cbc0010I After 7864000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (776.97 seconds)\n", + "Cbc0010I After 7865000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (777.02 seconds)\n", + "Cbc0010I After 7866000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (777.07 seconds)\n", + "Cbc0010I After 7867000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (777.12 seconds)\n", + "Cbc0010I After 7868000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (777.17 seconds)\n", + "Cbc0010I After 7869000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (777.22 seconds)\n", + "Cbc0010I After 7870000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (777.26 seconds)\n", + "Cbc0010I After 7871000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (777.31 seconds)\n", + "Cbc0010I After 7872000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (777.35 seconds)\n", + "Cbc0010I After 7873000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (777.39 seconds)\n", + "Cbc0010I After 7874000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (777.43 seconds)\n", + "Cbc0010I After 7875000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.48 seconds)\n", + "Cbc0010I After 7876000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.54 seconds)\n", + "Cbc0010I After 7877000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.58 seconds)\n", + "Cbc0010I After 7878000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (777.64 seconds)\n", + "Cbc0010I After 7879000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (777.73 seconds)\n", + "Cbc0010I After 7880000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (777.80 seconds)\n", + "Cbc0010I After 7881000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (777.86 seconds)\n", + "Cbc0010I After 7882000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (777.94 seconds)\n", + "Cbc0010I After 7883000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (778.02 seconds)\n", + "Cbc0010I After 7884000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (778.07 seconds)\n", + "Cbc0010I After 7885000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (778.12 seconds)\n", + "Cbc0010I After 7886000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (778.17 seconds)\n", + "Cbc0010I After 7887000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (778.22 seconds)\n", + "Cbc0010I After 7888000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (778.28 seconds)\n", + "Cbc0010I After 7889000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (778.32 seconds)\n", + "Cbc0010I After 7890000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (778.37 seconds)\n", + "Cbc0010I After 7891000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.42 seconds)\n", + "Cbc0010I After 7892000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.47 seconds)\n", + "Cbc0010I After 7893000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.52 seconds)\n", + "Cbc0010I After 7894000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (778.56 seconds)\n", + "Cbc0010I After 7895000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (778.61 seconds)\n", + "Cbc0010I After 7896000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (778.66 seconds)\n", + "Cbc0010I After 7897000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (778.71 seconds)\n", + "Cbc0010I After 7898000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (778.76 seconds)\n", + "Cbc0010I After 7899000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (778.80 seconds)\n", + "Cbc0010I After 7900000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (778.84 seconds)\n", + "Cbc0010I After 7901000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (778.89 seconds)\n", + "Cbc0010I After 7902000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (778.95 seconds)\n", + "Cbc0010I After 7903000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (778.99 seconds)\n", + "Cbc0010I After 7904000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.03 seconds)\n", + "Cbc0010I After 7905000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (779.09 seconds)\n", + "Cbc0010I After 7906000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (779.13 seconds)\n", + "Cbc0010I After 7907000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.18 seconds)\n", + "Cbc0010I After 7908000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (779.23 seconds)\n", + "Cbc0010I After 7909000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (779.28 seconds)\n", + "Cbc0010I After 7910000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.35 seconds)\n", + "Cbc0010I After 7911000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (779.39 seconds)\n", + "Cbc0010I After 7912000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (779.44 seconds)\n", + "Cbc0010I After 7913000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (779.50 seconds)\n", + "Cbc0010I After 7914000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (779.54 seconds)\n", + "Cbc0010I After 7915000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (779.58 seconds)\n", + "Cbc0010I After 7916000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.61 seconds)\n", + "Cbc0010I After 7917000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (779.65 seconds)\n", + "Cbc0010I After 7918000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (779.68 seconds)\n", + "Cbc0010I After 7919000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.73 seconds)\n", + "Cbc0010I After 7920000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (779.77 seconds)\n", + "Cbc0010I After 7921000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (779.82 seconds)\n", + "Cbc0010I After 7922000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (779.88 seconds)\n", + "Cbc0010I After 7923000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (779.93 seconds)\n", + "Cbc0010I After 7924000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.98 seconds)\n", + "Cbc0010I After 7925000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (780.04 seconds)\n", + "Cbc0010I After 7926000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (780.09 seconds)\n", + "Cbc0010I After 7927000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (780.13 seconds)\n", + "Cbc0010I After 7928000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (780.18 seconds)\n", + "Cbc0010I After 7929000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (780.23 seconds)\n", + "Cbc0010I After 7930000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (780.27 seconds)\n", + "Cbc0010I After 7931000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.31 seconds)\n", + "Cbc0010I After 7932000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.38 seconds)\n", + "Cbc0010I After 7933000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (780.44 seconds)\n", + "Cbc0010I After 7934000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (780.48 seconds)\n", + "Cbc0010I After 7935000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.52 seconds)\n", + "Cbc0010I After 7936000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.56 seconds)\n", + "Cbc0010I After 7937000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.60 seconds)\n", + "Cbc0010I After 7938000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (780.64 seconds)\n", + "Cbc0010I After 7939000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (780.68 seconds)\n", + "Cbc0010I After 7940000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.72 seconds)\n", + "Cbc0010I After 7941000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (780.77 seconds)\n", + "Cbc0010I After 7942000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (780.82 seconds)\n", + "Cbc0010I After 7943000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (780.86 seconds)\n", + "Cbc0010I After 7944000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (780.90 seconds)\n", + "Cbc0010I After 7945000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (780.96 seconds)\n", + "Cbc0010I After 7946000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (781.01 seconds)\n", + "Cbc0010I After 7947000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (781.05 seconds)\n", + "Cbc0010I After 7948000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (781.10 seconds)\n", + "Cbc0010I After 7949000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (781.15 seconds)\n", + "Cbc0010I After 7950000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (781.21 seconds)\n", + "Cbc0010I After 7951000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (781.26 seconds)\n", + "Cbc0010I After 7952000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (781.30 seconds)\n", + "Cbc0010I After 7953000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (781.35 seconds)\n", + "Cbc0010I After 7954000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (781.42 seconds)\n", + "Cbc0010I After 7955000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (781.46 seconds)\n", + "Cbc0010I After 7956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (781.51 seconds)\n", + "Cbc0010I After 7957000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (781.55 seconds)\n", + "Cbc0010I After 7958000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (781.61 seconds)\n", + "Cbc0010I After 7959000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (781.68 seconds)\n", + "Cbc0010I After 7960000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (781.73 seconds)\n", + "Cbc0010I After 7961000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (781.77 seconds)\n", + "Cbc0010I After 7962000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (781.81 seconds)\n", + "Cbc0010I After 7963000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (781.85 seconds)\n", + "Cbc0010I After 7964000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (781.88 seconds)\n", + "Cbc0010I After 7965000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (781.96 seconds)\n", + "Cbc0010I After 7966000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (782.01 seconds)\n", + "Cbc0010I After 7967000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (782.05 seconds)\n", + "Cbc0010I After 7968000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (782.09 seconds)\n", + "Cbc0010I After 7969000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (782.14 seconds)\n", + "Cbc0010I After 7970000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (782.20 seconds)\n", + "Cbc0010I After 7971000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (782.24 seconds)\n", + "Cbc0010I After 7972000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (782.28 seconds)\n", + "Cbc0010I After 7973000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (782.32 seconds)\n", + "Cbc0010I After 7974000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (782.38 seconds)\n", + "Cbc0010I After 7975000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (782.43 seconds)\n", + "Cbc0010I After 7976000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (782.48 seconds)\n", + "Cbc0010I After 7977000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (782.51 seconds)\n", + "Cbc0010I After 7978000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (782.56 seconds)\n", + "Cbc0010I After 7979000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (782.62 seconds)\n", + "Cbc0010I After 7980000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (782.67 seconds)\n", + "Cbc0010I After 7981000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (782.73 seconds)\n", + "Cbc0010I After 7982000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (782.78 seconds)\n", + "Cbc0010I After 7983000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (782.83 seconds)\n", + "Cbc0010I After 7984000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (782.87 seconds)\n", + "Cbc0010I After 7985000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (782.91 seconds)\n", + "Cbc0010I After 7986000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (782.94 seconds)\n", + "Cbc0010I After 7987000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (782.97 seconds)\n", + "Cbc0010I After 7988000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (783.01 seconds)\n", + "Cbc0010I After 7989000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (783.05 seconds)\n", + "Cbc0010I After 7990000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (783.09 seconds)\n", + "Cbc0010I After 7991000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (783.14 seconds)\n", + "Cbc0010I After 7992000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (783.18 seconds)\n", + "Cbc0010I After 7993000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (783.21 seconds)\n", + "Cbc0010I After 7994000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (783.26 seconds)\n", + "Cbc0010I After 7995000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (783.31 seconds)\n", + "Cbc0010I After 7996000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (783.35 seconds)\n", + "Cbc0010I After 7997000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (783.38 seconds)\n", + "Cbc0010I After 7998000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (783.41 seconds)\n", + "Cbc0010I After 7999000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (783.44 seconds)\n", + "Cbc0010I After 8000000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (783.49 seconds)\n", + "Cbc0010I After 8001000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (783.54 seconds)\n", + "Cbc0010I After 8002000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (783.58 seconds)\n", + "Cbc0010I After 8003000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (783.63 seconds)\n", + "Cbc0010I After 8004000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (783.69 seconds)\n", + "Cbc0010I After 8005000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (783.74 seconds)\n", + "Cbc0010I After 8006000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (783.82 seconds)\n", + "Cbc0010I After 8007000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (783.90 seconds)\n", + "Cbc0010I After 8008000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (784.00 seconds)\n", + "Cbc0010I After 8009000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (784.04 seconds)\n", + "Cbc0010I After 8010000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (784.10 seconds)\n", + "Cbc0010I After 8011000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (784.15 seconds)\n", + "Cbc0010I After 8012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (784.18 seconds)\n", + "Cbc0010I After 8013000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (784.24 seconds)\n", + "Cbc0010I After 8014000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (784.30 seconds)\n", + "Cbc0010I After 8015000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (784.37 seconds)\n", + "Cbc0010I After 8016000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (784.43 seconds)\n", + "Cbc0010I After 8017000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (784.47 seconds)\n", + "Cbc0010I After 8018000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (784.50 seconds)\n", + "Cbc0010I After 8019000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (784.54 seconds)\n", + "Cbc0010I After 8020000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (784.60 seconds)\n", + "Cbc0010I After 8021000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (784.65 seconds)\n", + "Cbc0010I After 8022000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (784.70 seconds)\n", + "Cbc0010I After 8023000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (784.73 seconds)\n", + "Cbc0010I After 8024000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (784.80 seconds)\n", + "Cbc0010I After 8025000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (784.86 seconds)\n", + "Cbc0010I After 8026000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (784.92 seconds)\n", + "Cbc0010I After 8027000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (784.96 seconds)\n", + "Cbc0010I After 8028000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (785.00 seconds)\n", + "Cbc0010I After 8029000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (785.04 seconds)\n", + "Cbc0010I After 8030000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (785.07 seconds)\n", + "Cbc0010I After 8031000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.11 seconds)\n", + "Cbc0010I After 8032000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.15 seconds)\n", + "Cbc0010I After 8033000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (785.21 seconds)\n", + "Cbc0010I After 8034000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (785.25 seconds)\n", + "Cbc0010I After 8035000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (785.36 seconds)\n", + "Cbc0010I After 8036000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.42 seconds)\n", + "Cbc0010I After 8037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (785.46 seconds)\n", + "Cbc0010I After 8038000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (785.57 seconds)\n", + "Cbc0010I After 8039000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (785.66 seconds)\n", + "Cbc0010I After 8040000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (785.75 seconds)\n", + "Cbc0010I After 8041000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (785.85 seconds)\n", + "Cbc0010I After 8042000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (785.88 seconds)\n", + "Cbc0010I After 8043000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (785.96 seconds)\n", + "Cbc0010I After 8044000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (786.00 seconds)\n", + "Cbc0010I After 8045000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (786.03 seconds)\n", + "Cbc0010I After 8046000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (786.08 seconds)\n", + "Cbc0010I After 8047000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (786.11 seconds)\n", + "Cbc0010I After 8048000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (786.16 seconds)\n", + "Cbc0010I After 8049000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (786.20 seconds)\n", + "Cbc0010I After 8050000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (786.24 seconds)\n", + "Cbc0010I After 8051000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (786.28 seconds)\n", + "Cbc0010I After 8052000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (786.31 seconds)\n", + "Cbc0010I After 8053000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (786.38 seconds)\n", + "Cbc0010I After 8054000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (786.42 seconds)\n", + "Cbc0010I After 8055000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (786.45 seconds)\n", + "Cbc0010I After 8056000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (786.52 seconds)\n", + "Cbc0010I After 8057000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (786.57 seconds)\n", + "Cbc0010I After 8058000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (786.60 seconds)\n", + "Cbc0010I After 8059000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (786.63 seconds)\n", + "Cbc0010I After 8060000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (786.67 seconds)\n", + "Cbc0010I After 8061000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (786.71 seconds)\n", + "Cbc0010I After 8062000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (786.75 seconds)\n", + "Cbc0010I After 8063000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (786.81 seconds)\n", + "Cbc0010I After 8064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (786.85 seconds)\n", + "Cbc0010I After 8065000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (786.89 seconds)\n", + "Cbc0010I After 8066000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (786.96 seconds)\n", + "Cbc0010I After 8067000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (787.00 seconds)\n", + "Cbc0010I After 8068000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (787.03 seconds)\n", + "Cbc0010I After 8069000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (787.07 seconds)\n", + "Cbc0010I After 8070000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (787.11 seconds)\n", + "Cbc0010I After 8071000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (787.15 seconds)\n", + "Cbc0010I After 8072000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (787.22 seconds)\n", + "Cbc0010I After 8073000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (787.27 seconds)\n", + "Cbc0010I After 8074000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (787.32 seconds)\n", + "Cbc0010I After 8075000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (787.40 seconds)\n", + "Cbc0010I After 8076000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (787.45 seconds)\n", + "Cbc0010I After 8077000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (787.52 seconds)\n", + "Cbc0010I After 8078000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (787.63 seconds)\n", + "Cbc0010I After 8079000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (787.72 seconds)\n", + "Cbc0010I After 8080000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (787.80 seconds)\n", + "Cbc0010I After 8081000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (787.88 seconds)\n", + "Cbc0010I After 8082000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (787.93 seconds)\n", + "Cbc0010I After 8083000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (787.97 seconds)\n", + "Cbc0010I After 8084000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (788.06 seconds)\n", + "Cbc0010I After 8085000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (788.14 seconds)\n", + "Cbc0010I After 8086000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (788.24 seconds)\n", + "Cbc0010I After 8087000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (788.29 seconds)\n", + "Cbc0010I After 8088000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (788.33 seconds)\n", + "Cbc0010I After 8089000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (788.38 seconds)\n", + "Cbc0010I After 8090000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (788.44 seconds)\n", + "Cbc0010I After 8091000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (788.49 seconds)\n", + "Cbc0010I After 8092000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (788.53 seconds)\n", + "Cbc0010I After 8093000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (788.59 seconds)\n", + "Cbc0010I After 8094000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (788.65 seconds)\n", + "Cbc0010I After 8095000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (788.72 seconds)\n", + "Cbc0010I After 8096000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (788.78 seconds)\n", + "Cbc0010I After 8097000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (788.83 seconds)\n", + "Cbc0010I After 8098000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (788.88 seconds)\n", + "Cbc0010I After 8099000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (788.92 seconds)\n", + "Cbc0010I After 8100000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (788.97 seconds)\n", + "Cbc0010I After 8101000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (789.05 seconds)\n", + "Cbc0010I After 8102000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (789.08 seconds)\n", + "Cbc0010I After 8103000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (789.12 seconds)\n", + "Cbc0010I After 8104000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (789.15 seconds)\n", + "Cbc0010I After 8105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (789.20 seconds)\n", + "Cbc0010I After 8106000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (789.23 seconds)\n", + "Cbc0010I After 8107000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (789.27 seconds)\n", + "Cbc0010I After 8108000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (789.30 seconds)\n", + "Cbc0010I After 8109000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (789.36 seconds)\n", + "Cbc0010I After 8110000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (789.41 seconds)\n", + "Cbc0010I After 8111000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (789.44 seconds)\n", + "Cbc0010I After 8112000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (789.48 seconds)\n", + "Cbc0010I After 8113000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (789.51 seconds)\n", + "Cbc0010I After 8114000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (789.55 seconds)\n", + "Cbc0010I After 8115000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (789.58 seconds)\n", + "Cbc0010I After 8116000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (789.62 seconds)\n", + "Cbc0010I After 8117000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (789.67 seconds)\n", + "Cbc0010I After 8118000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (789.71 seconds)\n", + "Cbc0010I After 8119000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (789.74 seconds)\n", + "Cbc0010I After 8120000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (789.78 seconds)\n", + "Cbc0010I After 8121000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (789.83 seconds)\n", + "Cbc0010I After 8122000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (789.88 seconds)\n", + "Cbc0010I After 8123000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (789.92 seconds)\n", + "Cbc0010I After 8124000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (789.98 seconds)\n", + "Cbc0010I After 8125000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (790.03 seconds)\n", + "Cbc0010I After 8126000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (790.08 seconds)\n", + "Cbc0010I After 8127000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (790.13 seconds)\n", + "Cbc0010I After 8128000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (790.18 seconds)\n", + "Cbc0010I After 8129000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (790.22 seconds)\n", + "Cbc0010I After 8130000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (790.29 seconds)\n", + "Cbc0010I After 8131000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (790.35 seconds)\n", + "Cbc0010I After 8132000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (790.42 seconds)\n", + "Cbc0010I After 8133000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (790.47 seconds)\n", + "Cbc0010I After 8134000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (790.54 seconds)\n", + "Cbc0010I After 8135000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (790.58 seconds)\n", + "Cbc0010I After 8136000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (790.63 seconds)\n", + "Cbc0010I After 8137000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (790.66 seconds)\n", + "Cbc0010I After 8138000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (790.69 seconds)\n", + "Cbc0010I After 8139000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (790.73 seconds)\n", + "Cbc0010I After 8140000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (790.80 seconds)\n", + "Cbc0010I After 8141000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (790.85 seconds)\n", + "Cbc0010I After 8142000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (790.89 seconds)\n", + "Cbc0010I After 8143000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (790.93 seconds)\n", + "Cbc0010I After 8144000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (790.98 seconds)\n", + "Cbc0010I After 8145000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (791.01 seconds)\n", + "Cbc0010I After 8146000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (791.05 seconds)\n", + "Cbc0010I After 8147000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (791.08 seconds)\n", + "Cbc0010I After 8148000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (791.11 seconds)\n", + "Cbc0010I After 8149000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (791.15 seconds)\n", + "Cbc0010I After 8150000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (791.19 seconds)\n", + "Cbc0010I After 8151000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (791.22 seconds)\n", + "Cbc0010I After 8152000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (791.28 seconds)\n", + "Cbc0010I After 8153000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (791.37 seconds)\n", + "Cbc0010I After 8154000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (791.42 seconds)\n", + "Cbc0010I After 8155000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (791.48 seconds)\n", + "Cbc0010I After 8156000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (791.56 seconds)\n", + "Cbc0010I After 8157000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (791.64 seconds)\n", + "Cbc0010I After 8158000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (791.71 seconds)\n", + "Cbc0010I After 8159000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (791.77 seconds)\n", + "Cbc0010I After 8160000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (791.81 seconds)\n", + "Cbc0010I After 8161000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (791.85 seconds)\n", + "Cbc0010I After 8162000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (791.89 seconds)\n", + "Cbc0010I After 8163000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (791.92 seconds)\n", + "Cbc0010I After 8164000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (791.96 seconds)\n", + "Cbc0010I After 8165000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (792.00 seconds)\n", + "Cbc0010I After 8166000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (792.05 seconds)\n", + "Cbc0010I After 8167000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (792.09 seconds)\n", + "Cbc0010I After 8168000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (792.14 seconds)\n", + "Cbc0010I After 8169000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (792.18 seconds)\n", + "Cbc0010I After 8170000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (792.23 seconds)\n", + "Cbc0010I After 8171000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (792.31 seconds)\n", + "Cbc0010I After 8172000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (792.37 seconds)\n", + "Cbc0010I After 8173000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (792.41 seconds)\n", + "Cbc0010I After 8174000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (792.45 seconds)\n", + "Cbc0010I After 8175000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (792.51 seconds)\n", + "Cbc0010I After 8176000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (792.55 seconds)\n", + "Cbc0010I After 8177000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (792.59 seconds)\n", + "Cbc0010I After 8178000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (792.62 seconds)\n", + "Cbc0010I After 8179000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (792.69 seconds)\n", + "Cbc0010I After 8180000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (792.76 seconds)\n", + "Cbc0010I After 8181000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (792.80 seconds)\n", + "Cbc0010I After 8182000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (792.84 seconds)\n", + "Cbc0010I After 8183000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (792.89 seconds)\n", + "Cbc0010I After 8184000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (792.97 seconds)\n", + "Cbc0010I After 8185000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (793.04 seconds)\n", + "Cbc0010I After 8186000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (793.11 seconds)\n", + "Cbc0010I After 8187000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (793.18 seconds)\n", + "Cbc0010I After 8188000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (793.25 seconds)\n", + "Cbc0010I After 8189000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (793.28 seconds)\n", + "Cbc0010I After 8190000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (793.31 seconds)\n", + "Cbc0010I After 8191000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (793.35 seconds)\n", + "Cbc0010I After 8192000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (793.38 seconds)\n", + "Cbc0010I After 8193000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (793.42 seconds)\n", + "Cbc0010I After 8194000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (793.46 seconds)\n", + "Cbc0010I After 8195000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (793.55 seconds)\n", + "Cbc0010I After 8196000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (793.61 seconds)\n", + "Cbc0010I After 8197000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (793.66 seconds)\n", + "Cbc0010I After 8198000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (793.69 seconds)\n", + "Cbc0010I After 8199000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (793.75 seconds)\n", + "Cbc0010I After 8200000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (793.79 seconds)\n", + "Cbc0010I After 8201000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (793.82 seconds)\n", + "Cbc0010I After 8202000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (793.86 seconds)\n", + "Cbc0010I After 8203000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (793.90 seconds)\n", + "Cbc0010I After 8204000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (793.93 seconds)\n", + "Cbc0010I After 8205000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (793.97 seconds)\n", + "Cbc0010I After 8206000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (794.00 seconds)\n", + "Cbc0010I After 8207000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (794.04 seconds)\n", + "Cbc0010I After 8208000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (794.09 seconds)\n", + "Cbc0010I After 8209000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (794.14 seconds)\n", + "Cbc0010I After 8210000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (794.21 seconds)\n", + "Cbc0010I After 8211000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (794.26 seconds)\n", + "Cbc0010I After 8212000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (794.31 seconds)\n", + "Cbc0010I After 8213000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (794.34 seconds)\n", + "Cbc0010I After 8214000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (794.38 seconds)\n", + "Cbc0010I After 8215000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (794.41 seconds)\n", + "Cbc0010I After 8216000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (794.45 seconds)\n", + "Cbc0010I After 8217000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (794.49 seconds)\n", + "Cbc0010I After 8218000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (794.52 seconds)\n", + "Cbc0010I After 8219000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (794.56 seconds)\n", + "Cbc0010I After 8220000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (794.60 seconds)\n", + "Cbc0010I After 8221000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (794.63 seconds)\n", + "Cbc0010I After 8222000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (794.67 seconds)\n", + "Cbc0010I After 8223000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (794.71 seconds)\n", + "Cbc0010I After 8224000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (794.76 seconds)\n", + "Cbc0010I After 8225000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (794.84 seconds)\n", + "Cbc0010I After 8226000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (794.89 seconds)\n", + "Cbc0010I After 8227000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (794.93 seconds)\n", + "Cbc0010I After 8228000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (794.97 seconds)\n", + "Cbc0010I After 8229000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (795.01 seconds)\n", + "Cbc0010I After 8230000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (795.06 seconds)\n", + "Cbc0010I After 8231000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (795.09 seconds)\n", + "Cbc0010I After 8232000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (795.13 seconds)\n", + "Cbc0010I After 8233000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (795.17 seconds)\n", + "Cbc0010I After 8234000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (795.21 seconds)\n", + "Cbc0010I After 8235000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (795.25 seconds)\n", + "Cbc0010I After 8236000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.29 seconds)\n", + "Cbc0010I After 8237000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (795.33 seconds)\n", + "Cbc0010I After 8238000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (795.36 seconds)\n", + "Cbc0010I After 8239000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.42 seconds)\n", + "Cbc0010I After 8240000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (795.50 seconds)\n", + "Cbc0010I After 8241000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (795.57 seconds)\n", + "Cbc0010I After 8242000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (795.64 seconds)\n", + "Cbc0010I After 8243000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (795.72 seconds)\n", + "Cbc0010I After 8244000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.79 seconds)\n", + "Cbc0010I After 8245000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (795.87 seconds)\n", + "Cbc0010I After 8246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (795.95 seconds)\n", + "Cbc0010I After 8247000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (796.03 seconds)\n", + "Cbc0010I After 8248000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (796.12 seconds)\n", + "Cbc0010I After 8249000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (796.19 seconds)\n", + "Cbc0010I After 8250000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (796.23 seconds)\n", + "Cbc0010I After 8251000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (796.27 seconds)\n", + "Cbc0010I After 8252000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (796.30 seconds)\n", + "Cbc0010I After 8253000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (796.33 seconds)\n", + "Cbc0010I After 8254000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (796.39 seconds)\n", + "Cbc0010I After 8255000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (796.43 seconds)\n", + "Cbc0010I After 8256000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (796.47 seconds)\n", + "Cbc0010I After 8257000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (796.50 seconds)\n", + "Cbc0010I After 8258000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (796.55 seconds)\n", + "Cbc0010I After 8259000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (796.58 seconds)\n", + "Cbc0010I After 8260000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (796.62 seconds)\n", + "Cbc0010I After 8261000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (796.66 seconds)\n", + "Cbc0010I After 8262000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (796.70 seconds)\n", + "Cbc0010I After 8263000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (796.75 seconds)\n", + "Cbc0010I After 8264000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (796.86 seconds)\n", + "Cbc0010I After 8265000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (796.93 seconds)\n", + "Cbc0010I After 8266000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (796.99 seconds)\n", + "Cbc0010I After 8267000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (797.05 seconds)\n", + "Cbc0010I After 8268000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (797.12 seconds)\n", + "Cbc0010I After 8269000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (797.17 seconds)\n", + "Cbc0010I After 8270000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (797.23 seconds)\n", + "Cbc0010I After 8271000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (797.30 seconds)\n", + "Cbc0010I After 8272000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (797.36 seconds)\n", + "Cbc0010I After 8273000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (797.44 seconds)\n", + "Cbc0010I After 8274000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (797.50 seconds)\n", + "Cbc0010I After 8275000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (797.56 seconds)\n", + "Cbc0010I After 8276000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (797.62 seconds)\n", + "Cbc0010I After 8277000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (797.67 seconds)\n", + "Cbc0010I After 8278000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (797.70 seconds)\n", + "Cbc0010I After 8279000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (797.75 seconds)\n", + "Cbc0010I After 8280000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (797.79 seconds)\n", + "Cbc0010I After 8281000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (797.84 seconds)\n", + "Cbc0010I After 8282000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (797.87 seconds)\n", + "Cbc0010I After 8283000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (797.92 seconds)\n", + "Cbc0010I After 8284000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (797.98 seconds)\n", + "Cbc0010I After 8285000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (798.05 seconds)\n", + "Cbc0010I After 8286000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (798.11 seconds)\n", + "Cbc0010I After 8287000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (798.17 seconds)\n", + "Cbc0010I After 8288000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (798.21 seconds)\n", + "Cbc0010I After 8289000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (798.27 seconds)\n", + "Cbc0010I After 8290000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (798.33 seconds)\n", + "Cbc0010I After 8291000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (798.41 seconds)\n", + "Cbc0010I After 8292000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (798.47 seconds)\n", + "Cbc0010I After 8293000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (798.53 seconds)\n", + "Cbc0010I After 8294000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (798.59 seconds)\n", + "Cbc0010I After 8295000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (798.62 seconds)\n", + "Cbc0010I After 8296000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (798.66 seconds)\n", + "Cbc0010I After 8297000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (798.70 seconds)\n", + "Cbc0010I After 8298000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (798.73 seconds)\n", + "Cbc0010I After 8299000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (798.77 seconds)\n", + "Cbc0010I After 8300000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (798.80 seconds)\n", + "Cbc0010I After 8301000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (798.86 seconds)\n", + "Cbc0010I After 8302000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (798.91 seconds)\n", + "Cbc0010I After 8303000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (798.96 seconds)\n", + "Cbc0010I After 8304000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (799.02 seconds)\n", + "Cbc0010I After 8305000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (799.08 seconds)\n", + "Cbc0010I After 8306000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (799.12 seconds)\n", + "Cbc0010I After 8307000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (799.15 seconds)\n", + "Cbc0010I After 8308000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (799.19 seconds)\n", + "Cbc0010I After 8309000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (799.23 seconds)\n", + "Cbc0010I After 8310000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (799.27 seconds)\n", + "Cbc0010I After 8311000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (799.32 seconds)\n", + "Cbc0010I After 8312000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (799.35 seconds)\n", + "Cbc0010I After 8313000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (799.40 seconds)\n", + "Cbc0010I After 8314000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (799.46 seconds)\n", + "Cbc0010I After 8315000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (799.51 seconds)\n", + "Cbc0010I After 8316000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (799.56 seconds)\n", + "Cbc0010I After 8317000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (799.60 seconds)\n", + "Cbc0010I After 8318000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (799.63 seconds)\n", + "Cbc0010I After 8319000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (799.66 seconds)\n", + "Cbc0010I After 8320000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (799.70 seconds)\n", + "Cbc0010I After 8321000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (799.74 seconds)\n", + "Cbc0010I After 8322000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (799.78 seconds)\n", + "Cbc0010I After 8323000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (799.83 seconds)\n", + "Cbc0010I After 8324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (799.86 seconds)\n", + "Cbc0010I After 8325000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (799.90 seconds)\n", + "Cbc0010I After 8326000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (799.94 seconds)\n", + "Cbc0010I After 8327000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.00 seconds)\n", + "Cbc0010I After 8328000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (800.04 seconds)\n", + "Cbc0010I After 8329000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.07 seconds)\n", + "Cbc0010I After 8330000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.11 seconds)\n", + "Cbc0010I After 8331000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (800.16 seconds)\n", + "Cbc0010I After 8332000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (800.22 seconds)\n", + "Cbc0010I After 8333000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.29 seconds)\n", + "Cbc0010I After 8334000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (800.34 seconds)\n", + "Cbc0010I After 8335000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (800.38 seconds)\n", + "Cbc0010I After 8336000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (800.43 seconds)\n", + "Cbc0010I After 8337000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (800.46 seconds)\n", + "Cbc0010I After 8338000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (800.52 seconds)\n", + "Cbc0010I After 8339000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (800.57 seconds)\n", + "Cbc0010I After 8340000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (800.64 seconds)\n", + "Cbc0010I After 8341000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (800.67 seconds)\n", + "Cbc0010I After 8342000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (800.72 seconds)\n", + "Cbc0010I After 8343000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (800.76 seconds)\n", + "Cbc0010I After 8344000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.80 seconds)\n", + "Cbc0010I After 8345000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.84 seconds)\n", + "Cbc0010I After 8346000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (800.91 seconds)\n", + "Cbc0010I After 8347000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (800.97 seconds)\n", + "Cbc0010I After 8348000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (801.04 seconds)\n", + "Cbc0010I After 8349000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (801.08 seconds)\n", + "Cbc0010I After 8350000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (801.13 seconds)\n", + "Cbc0010I After 8351000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (801.17 seconds)\n", + "Cbc0010I After 8352000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (801.22 seconds)\n", + "Cbc0010I After 8353000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (801.26 seconds)\n", + "Cbc0010I After 8354000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (801.30 seconds)\n", + "Cbc0010I After 8355000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (801.34 seconds)\n", + "Cbc0010I After 8356000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (801.39 seconds)\n", + "Cbc0010I After 8357000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (801.43 seconds)\n", + "Cbc0010I After 8358000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (801.47 seconds)\n", + "Cbc0010I After 8359000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (801.51 seconds)\n", + "Cbc0010I After 8360000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (801.55 seconds)\n", + "Cbc0010I After 8361000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (801.60 seconds)\n", + "Cbc0010I After 8362000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (801.64 seconds)\n", + "Cbc0010I After 8363000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (801.69 seconds)\n", + "Cbc0010I After 8364000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (801.74 seconds)\n", + "Cbc0010I After 8365000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (801.79 seconds)\n", + "Cbc0010I After 8366000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (801.83 seconds)\n", + "Cbc0010I After 8367000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (801.88 seconds)\n", + "Cbc0010I After 8368000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (801.92 seconds)\n", + "Cbc0010I After 8369000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (801.96 seconds)\n", + "Cbc0010I After 8370000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (802.01 seconds)\n", + "Cbc0010I After 8371000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.05 seconds)\n", + "Cbc0010I After 8372000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (802.10 seconds)\n", + "Cbc0010I After 8373000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (802.15 seconds)\n", + "Cbc0010I After 8374000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (802.19 seconds)\n", + "Cbc0010I After 8375000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (802.23 seconds)\n", + "Cbc0010I After 8376000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (802.28 seconds)\n", + "Cbc0010I After 8377000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (802.33 seconds)\n", + "Cbc0010I After 8378000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (802.37 seconds)\n", + "Cbc0010I After 8379000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (802.43 seconds)\n", + "Cbc0010I After 8380000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.48 seconds)\n", + "Cbc0010I After 8381000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (802.53 seconds)\n", + "Cbc0010I After 8382000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (802.57 seconds)\n", + "Cbc0010I After 8383000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.62 seconds)\n", + "Cbc0010I After 8384000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (802.67 seconds)\n", + "Cbc0010I After 8385000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (802.73 seconds)\n", + "Cbc0010I After 8386000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (802.78 seconds)\n", + "Cbc0010I After 8387000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.82 seconds)\n", + "Cbc0010I After 8388000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (802.86 seconds)\n", + "Cbc0010I After 8389000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (802.91 seconds)\n", + "Cbc0010I After 8390000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (802.95 seconds)\n", + "Cbc0010I After 8391000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (803.01 seconds)\n", + "Cbc0010I After 8392000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (803.05 seconds)\n", + "Cbc0010I After 8393000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (803.10 seconds)\n", + "Cbc0010I After 8394000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (803.14 seconds)\n", + "Cbc0010I After 8395000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (803.20 seconds)\n", + "Cbc0010I After 8396000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (803.24 seconds)\n", + "Cbc0010I After 8397000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (803.29 seconds)\n", + "Cbc0010I After 8398000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (803.34 seconds)\n", + "Cbc0010I After 8399000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (803.38 seconds)\n", + "Cbc0010I After 8400000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (803.42 seconds)\n", + "Cbc0010I After 8401000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (803.46 seconds)\n", + "Cbc0010I After 8402000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.51 seconds)\n", + "Cbc0010I After 8403000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (803.54 seconds)\n", + "Cbc0010I After 8404000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (803.59 seconds)\n", + "Cbc0010I After 8405000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.65 seconds)\n", + "Cbc0010I After 8406000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (803.69 seconds)\n", + "Cbc0010I After 8407000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (803.73 seconds)\n", + "Cbc0010I After 8408000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (803.79 seconds)\n", + "Cbc0010I After 8409000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (803.84 seconds)\n", + "Cbc0010I After 8410000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (803.88 seconds)\n", + "Cbc0010I After 8411000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (803.93 seconds)\n", + "Cbc0010I After 8412000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.98 seconds)\n", + "Cbc0010I After 8413000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (804.03 seconds)\n", + "Cbc0010I After 8414000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (804.08 seconds)\n", + "Cbc0010I After 8415000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.12 seconds)\n", + "Cbc0010I After 8416000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (804.17 seconds)\n", + "Cbc0010I After 8417000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (804.21 seconds)\n", + "Cbc0010I After 8418000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (804.25 seconds)\n", + "Cbc0010I After 8419000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.30 seconds)\n", + "Cbc0010I After 8420000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (804.34 seconds)\n", + "Cbc0010I After 8421000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (804.38 seconds)\n", + "Cbc0010I After 8422000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (804.43 seconds)\n", + "Cbc0010I After 8423000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (804.47 seconds)\n", + "Cbc0010I After 8424000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (804.52 seconds)\n", + "Cbc0010I After 8425000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.59 seconds)\n", + "Cbc0010I After 8426000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (804.64 seconds)\n", + "Cbc0010I After 8427000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (804.68 seconds)\n", + "Cbc0010I After 8428000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (804.73 seconds)\n", + "Cbc0010I After 8429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (804.79 seconds)\n", + "Cbc0010I After 8430000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (804.83 seconds)\n", + "Cbc0010I After 8431000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (804.87 seconds)\n", + "Cbc0010I After 8432000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (804.93 seconds)\n", + "Cbc0010I After 8433000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (804.98 seconds)\n", + "Cbc0010I After 8434000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (805.02 seconds)\n", + "Cbc0010I After 8435000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.06 seconds)\n", + "Cbc0010I After 8436000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (805.13 seconds)\n", + "Cbc0010I After 8437000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (805.19 seconds)\n", + "Cbc0010I After 8438000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (805.24 seconds)\n", + "Cbc0010I After 8439000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (805.31 seconds)\n", + "Cbc0010I After 8440000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (805.34 seconds)\n", + "Cbc0010I After 8441000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (805.39 seconds)\n", + "Cbc0010I After 8442000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (805.45 seconds)\n", + "Cbc0010I After 8443000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (805.50 seconds)\n", + "Cbc0010I After 8444000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (805.54 seconds)\n", + "Cbc0010I After 8445000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.58 seconds)\n", + "Cbc0010I After 8446000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (805.64 seconds)\n", + "Cbc0010I After 8447000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (805.68 seconds)\n", + "Cbc0010I After 8448000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (805.72 seconds)\n", + "Cbc0010I After 8449000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.76 seconds)\n", + "Cbc0010I After 8450000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (805.82 seconds)\n", + "Cbc0010I After 8451000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (805.88 seconds)\n", + "Cbc0010I After 8452000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (805.94 seconds)\n", + "Cbc0010I After 8453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (805.98 seconds)\n", + "Cbc0010I After 8454000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (806.02 seconds)\n", + "Cbc0010I After 8455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (806.07 seconds)\n", + "Cbc0010I After 8456000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (806.09 seconds)\n", + "Cbc0010I After 8457000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (806.13 seconds)\n", + "Cbc0010I After 8458000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (806.16 seconds)\n", + "Cbc0010I After 8459000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (806.22 seconds)\n", + "Cbc0010I After 8460000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (806.26 seconds)\n", + "Cbc0010I After 8461000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (806.30 seconds)\n", + "Cbc0010I After 8462000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (806.35 seconds)\n", + "Cbc0010I After 8463000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (806.43 seconds)\n", + "Cbc0010I After 8464000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (806.48 seconds)\n", + "Cbc0010I After 8465000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (806.52 seconds)\n", + "Cbc0010I After 8466000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (806.57 seconds)\n", + "Cbc0010I After 8467000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (806.61 seconds)\n", + "Cbc0010I After 8468000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (806.69 seconds)\n", + "Cbc0010I After 8469000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (806.74 seconds)\n", + "Cbc0010I After 8470000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (806.79 seconds)\n", + "Cbc0010I After 8471000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (806.84 seconds)\n", + "Cbc0010I After 8472000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (806.92 seconds)\n", + "Cbc0010I After 8473000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (806.99 seconds)\n", + "Cbc0010I After 8474000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (807.07 seconds)\n", + "Cbc0010I After 8475000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (807.12 seconds)\n", + "Cbc0010I After 8476000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (807.16 seconds)\n", + "Cbc0010I After 8477000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (807.21 seconds)\n", + "Cbc0010I After 8478000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (807.25 seconds)\n", + "Cbc0010I After 8479000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (807.30 seconds)\n", + "Cbc0010I After 8480000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (807.33 seconds)\n", + "Cbc0010I After 8481000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (807.38 seconds)\n", + "Cbc0010I After 8482000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (807.41 seconds)\n", + "Cbc0010I After 8483000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (807.44 seconds)\n", + "Cbc0010I After 8484000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (807.48 seconds)\n", + "Cbc0010I After 8485000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (807.52 seconds)\n", + "Cbc0010I After 8486000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (807.59 seconds)\n", + "Cbc0010I After 8487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (807.67 seconds)\n", + "Cbc0010I After 8488000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (807.75 seconds)\n", + "Cbc0010I After 8489000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (807.82 seconds)\n", + "Cbc0010I After 8490000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (807.90 seconds)\n", + "Cbc0010I After 8491000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (807.97 seconds)\n", + "Cbc0010I After 8492000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (808.04 seconds)\n", + "Cbc0010I After 8493000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (808.12 seconds)\n", + "Cbc0010I After 8494000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.20 seconds)\n", + "Cbc0010I After 8495000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (808.27 seconds)\n", + "Cbc0010I After 8496000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.35 seconds)\n", + "Cbc0010I After 8497000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (808.42 seconds)\n", + "Cbc0010I After 8498000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (808.51 seconds)\n", + "Cbc0010I After 8499000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (808.60 seconds)\n", + "Cbc0010I After 8500000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (808.68 seconds)\n", + "Cbc0010I After 8501000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (808.75 seconds)\n", + "Cbc0010I After 8502000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.82 seconds)\n", + "Cbc0010I After 8503000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (808.86 seconds)\n", + "Cbc0010I After 8504000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (808.92 seconds)\n", + "Cbc0010I After 8505000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (809.00 seconds)\n", + "Cbc0010I After 8506000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (809.06 seconds)\n", + "Cbc0010I After 8507000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (809.12 seconds)\n", + "Cbc0010I After 8508000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (809.18 seconds)\n", + "Cbc0010I After 8509000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.23 seconds)\n", + "Cbc0010I After 8510000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (809.28 seconds)\n", + "Cbc0010I After 8511000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.36 seconds)\n", + "Cbc0010I After 8512000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (809.43 seconds)\n", + "Cbc0010I After 8513000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (809.50 seconds)\n", + "Cbc0010I After 8514000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (809.55 seconds)\n", + "Cbc0010I After 8515000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (809.60 seconds)\n", + "Cbc0010I After 8516000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (809.66 seconds)\n", + "Cbc0010I After 8517000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (809.71 seconds)\n", + "Cbc0010I After 8518000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (809.76 seconds)\n", + "Cbc0010I After 8519000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.82 seconds)\n", + "Cbc0010I After 8520000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (809.89 seconds)\n", + "Cbc0010I After 8521000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (809.95 seconds)\n", + "Cbc0010I After 8522000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (810.02 seconds)\n", + "Cbc0010I After 8523000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (810.08 seconds)\n", + "Cbc0010I After 8524000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (810.13 seconds)\n", + "Cbc0010I After 8525000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.18 seconds)\n", + "Cbc0010I After 8526000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (810.24 seconds)\n", + "Cbc0010I After 8527000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (810.30 seconds)\n", + "Cbc0010I After 8528000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (810.36 seconds)\n", + "Cbc0010I After 8529000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (810.42 seconds)\n", + "Cbc0010I After 8530000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.48 seconds)\n", + "Cbc0010I After 8531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (810.54 seconds)\n", + "Cbc0010I After 8532000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (810.60 seconds)\n", + "Cbc0010I After 8533000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.65 seconds)\n", + "Cbc0010I After 8534000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (810.71 seconds)\n", + "Cbc0010I After 8535000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (810.77 seconds)\n", + "Cbc0010I After 8536000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (810.83 seconds)\n", + "Cbc0010I After 8537000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (810.88 seconds)\n", + "Cbc0010I After 8538000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (810.94 seconds)\n", + "Cbc0010I After 8539000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (811.00 seconds)\n", + "Cbc0010I After 8540000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (811.06 seconds)\n", + "Cbc0010I After 8541000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (811.11 seconds)\n", + "Cbc0010I After 8542000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (811.17 seconds)\n", + "Cbc0010I After 8543000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (811.22 seconds)\n", + "Cbc0010I After 8544000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (811.28 seconds)\n", + "Cbc0010I After 8545000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (811.33 seconds)\n", + "Cbc0010I After 8546000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (811.40 seconds)\n", + "Cbc0010I After 8547000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (811.46 seconds)\n", + "Cbc0010I After 8548000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (811.53 seconds)\n", + "Cbc0010I After 8549000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (811.58 seconds)\n", + "Cbc0010I After 8550000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (811.65 seconds)\n", + "Cbc0010I After 8551000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (811.71 seconds)\n", + "Cbc0010I After 8552000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (811.79 seconds)\n", + "Cbc0010I After 8553000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (811.88 seconds)\n", + "Cbc0010I After 8554000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (811.96 seconds)\n", + "Cbc0010I After 8555000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (812.04 seconds)\n", + "Cbc0010I After 8556000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.12 seconds)\n", + "Cbc0010I After 8557000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.21 seconds)\n", + "Cbc0010I After 8558000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (812.28 seconds)\n", + "Cbc0010I After 8559000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (812.36 seconds)\n", + "Cbc0010I After 8560000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (812.44 seconds)\n", + "Cbc0010I After 8561000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (812.52 seconds)\n", + "Cbc0010I After 8562000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (812.60 seconds)\n", + "Cbc0010I After 8563000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (812.67 seconds)\n", + "Cbc0010I After 8564000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.74 seconds)\n", + "Cbc0010I After 8565000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (812.81 seconds)\n", + "Cbc0010I After 8566000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (812.88 seconds)\n", + "Cbc0010I After 8567000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (812.96 seconds)\n", + "Cbc0010I After 8568000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (813.02 seconds)\n", + "Cbc0010I After 8569000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (813.09 seconds)\n", + "Cbc0010I After 8570000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (813.15 seconds)\n", + "Cbc0010I After 8571000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (813.22 seconds)\n", + "Cbc0010I After 8572000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (813.29 seconds)\n", + "Cbc0010I After 8573000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (813.36 seconds)\n", + "Cbc0010I After 8574000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (813.41 seconds)\n", + "Cbc0010I After 8575000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (813.48 seconds)\n", + "Cbc0010I After 8576000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (813.54 seconds)\n", + "Cbc0010I After 8577000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (813.59 seconds)\n", + "Cbc0010I After 8578000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (813.64 seconds)\n", + "Cbc0010I After 8579000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (813.69 seconds)\n", + "Cbc0010I After 8580000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (813.75 seconds)\n", + "Cbc0010I After 8581000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (813.82 seconds)\n", + "Cbc0010I After 8582000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (813.88 seconds)\n", + "Cbc0010I After 8583000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (813.94 seconds)\n", + "Cbc0010I After 8584000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (814.01 seconds)\n", + "Cbc0010I After 8585000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (814.08 seconds)\n", + "Cbc0010I After 8586000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (814.14 seconds)\n", + "Cbc0010I After 8587000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (814.21 seconds)\n", + "Cbc0010I After 8588000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (814.28 seconds)\n", + "Cbc0010I After 8589000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (814.34 seconds)\n", + "Cbc0010I After 8590000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (814.40 seconds)\n", + "Cbc0010I After 8591000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (814.45 seconds)\n", + "Cbc0010I After 8592000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (814.51 seconds)\n", + "Cbc0010I After 8593000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (814.57 seconds)\n", + "Cbc0010I After 8594000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (814.62 seconds)\n", + "Cbc0010I After 8595000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (814.67 seconds)\n", + "Cbc0010I After 8596000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (814.73 seconds)\n", + "Cbc0010I After 8597000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (814.78 seconds)\n", + "Cbc0010I After 8598000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (814.84 seconds)\n", + "Cbc0010I After 8599000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (814.90 seconds)\n", + "Cbc0010I After 8600000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (814.95 seconds)\n", + "Cbc0010I After 8601000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (815.02 seconds)\n", + "Cbc0010I After 8602000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (815.07 seconds)\n", + "Cbc0010I After 8603000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.13 seconds)\n", + "Cbc0010I After 8604000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (815.20 seconds)\n", + "Cbc0010I After 8605000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (815.25 seconds)\n", + "Cbc0010I After 8606000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.30 seconds)\n", + "Cbc0010I After 8607000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (815.37 seconds)\n", + "Cbc0010I After 8608000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (815.43 seconds)\n", + "Cbc0010I After 8609000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (815.48 seconds)\n", + "Cbc0010I After 8610000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (815.55 seconds)\n", + "Cbc0010I After 8611000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (815.61 seconds)\n", + "Cbc0010I After 8612000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (815.67 seconds)\n", + "Cbc0010I After 8613000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.73 seconds)\n", + "Cbc0010I After 8614000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (815.78 seconds)\n", + "Cbc0010I After 8615000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (815.84 seconds)\n", + "Cbc0010I After 8616000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (815.91 seconds)\n", + "Cbc0010I After 8617000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (815.99 seconds)\n", + "Cbc0010I After 8618000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (816.04 seconds)\n", + "Cbc0010I After 8619000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (816.09 seconds)\n", + "Cbc0010I After 8620000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (816.15 seconds)\n", + "Cbc0010I After 8621000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (816.19 seconds)\n", + "Cbc0010I After 8622000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (816.23 seconds)\n", + "Cbc0010I After 8623000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (816.27 seconds)\n", + "Cbc0010I After 8624000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (816.30 seconds)\n", + "Cbc0010I After 8625000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (816.33 seconds)\n", + "Cbc0010I After 8626000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (816.38 seconds)\n", + "Cbc0010I After 8627000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (816.43 seconds)\n", + "Cbc0010I After 8628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (816.48 seconds)\n", + "Cbc0010I After 8629000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (816.53 seconds)\n", + "Cbc0010I After 8630000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (816.56 seconds)\n", + "Cbc0010I After 8631000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (816.61 seconds)\n", + "Cbc0010I After 8632000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (816.71 seconds)\n", + "Cbc0010I After 8633000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.76 seconds)\n", + "Cbc0010I After 8634000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (816.81 seconds)\n", + "Cbc0010I After 8635000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.87 seconds)\n", + "Cbc0010I After 8636000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.92 seconds)\n", + "Cbc0010I After 8637000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (816.97 seconds)\n", + "Cbc0010I After 8638000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (817.03 seconds)\n", + "Cbc0010I After 8639000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (817.08 seconds)\n", + "Cbc0010I After 8640000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (817.13 seconds)\n", + "Cbc0010I After 8641000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (817.21 seconds)\n", + "Cbc0010I After 8642000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (817.25 seconds)\n", + "Cbc0010I After 8643000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (817.27 seconds)\n", + "Cbc0010I After 8644000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (817.30 seconds)\n", + "Cbc0010I After 8645000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (817.33 seconds)\n", + "Cbc0010I After 8646000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.36 seconds)\n", + "Cbc0010I After 8647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (817.40 seconds)\n", + "Cbc0010I After 8648000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (817.43 seconds)\n", + "Cbc0010I After 8649000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (817.48 seconds)\n", + "Cbc0010I After 8650000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (817.54 seconds)\n", + "Cbc0010I After 8651000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (817.57 seconds)\n", + "Cbc0010I After 8652000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (817.60 seconds)\n", + "Cbc0010I After 8653000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (817.63 seconds)\n", + "Cbc0010I After 8654000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (817.67 seconds)\n", + "Cbc0010I After 8655000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.71 seconds)\n", + "Cbc0010I After 8656000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (817.75 seconds)\n", + "Cbc0010I After 8657000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.79 seconds)\n", + "Cbc0010I After 8658000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (817.83 seconds)\n", + "Cbc0010I After 8659000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (817.89 seconds)\n", + "Cbc0010I After 8660000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (817.94 seconds)\n", + "Cbc0010I After 8661000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (817.99 seconds)\n", + "Cbc0010I After 8662000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (818.04 seconds)\n", + "Cbc0010I After 8663000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (818.09 seconds)\n", + "Cbc0010I After 8664000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (818.14 seconds)\n", + "Cbc0010I After 8665000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (818.19 seconds)\n", + "Cbc0010I After 8666000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (818.24 seconds)\n", + "Cbc0010I After 8667000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (818.28 seconds)\n", + "Cbc0010I After 8668000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (818.33 seconds)\n", + "Cbc0010I After 8669000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (818.37 seconds)\n", + "Cbc0010I After 8670000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (818.41 seconds)\n", + "Cbc0010I After 8671000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (818.45 seconds)\n", + "Cbc0010I After 8672000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (818.50 seconds)\n", + "Cbc0010I After 8673000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (818.54 seconds)\n", + "Cbc0010I After 8674000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (818.58 seconds)\n", + "Cbc0010I After 8675000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (818.63 seconds)\n", + "Cbc0010I After 8676000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (818.67 seconds)\n", + "Cbc0010I After 8677000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (818.72 seconds)\n", + "Cbc0010I After 8678000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (818.76 seconds)\n", + "Cbc0010I After 8679000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (818.80 seconds)\n", + "Cbc0010I After 8680000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (818.87 seconds)\n", + "Cbc0010I After 8681000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (818.95 seconds)\n", + "Cbc0010I After 8682000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (819.02 seconds)\n", + "Cbc0010I After 8683000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (819.10 seconds)\n", + "Cbc0010I After 8684000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (819.13 seconds)\n", + "Cbc0010I After 8685000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (819.17 seconds)\n", + "Cbc0010I After 8686000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (819.22 seconds)\n", + "Cbc0010I After 8687000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (819.27 seconds)\n", + "Cbc0010I After 8688000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (819.31 seconds)\n", + "Cbc0010I After 8689000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (819.34 seconds)\n", + "Cbc0010I After 8690000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (819.40 seconds)\n", + "Cbc0010I After 8691000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (819.46 seconds)\n", + "Cbc0010I After 8692000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (819.52 seconds)\n", + "Cbc0010I After 8693000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (819.58 seconds)\n", + "Cbc0010I After 8694000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (819.62 seconds)\n", + "Cbc0010I After 8695000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (819.65 seconds)\n", + "Cbc0010I After 8696000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (819.70 seconds)\n", + "Cbc0010I After 8697000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (819.74 seconds)\n", + "Cbc0010I After 8698000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (819.77 seconds)\n", + "Cbc0010I After 8699000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (819.84 seconds)\n", + "Cbc0010I After 8700000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (819.89 seconds)\n", + "Cbc0010I After 8701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (819.92 seconds)\n", + "Cbc0010I After 8702000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (819.96 seconds)\n", + "Cbc0010I After 8703000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (820.00 seconds)\n", + "Cbc0010I After 8704000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (820.03 seconds)\n", + "Cbc0010I After 8705000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (820.07 seconds)\n", + "Cbc0010I After 8706000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (820.11 seconds)\n", + "Cbc0010I After 8707000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (820.14 seconds)\n", + "Cbc0010I After 8708000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (820.18 seconds)\n", + "Cbc0010I After 8709000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (820.21 seconds)\n", + "Cbc0010I After 8710000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (820.25 seconds)\n", + "Cbc0010I After 8711000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (820.30 seconds)\n", + "Cbc0010I After 8712000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (820.39 seconds)\n", + "Cbc0010I After 8713000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (820.43 seconds)\n", + "Cbc0010I After 8714000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (820.47 seconds)\n", + "Cbc0010I After 8715000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (820.50 seconds)\n", + "Cbc0010I After 8716000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (820.56 seconds)\n", + "Cbc0010I After 8717000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (820.64 seconds)\n", + "Cbc0010I After 8718000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (820.70 seconds)\n", + "Cbc0010I After 8719000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (820.77 seconds)\n", + "Cbc0010I After 8720000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (820.84 seconds)\n", + "Cbc0010I After 8721000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (820.93 seconds)\n", + "Cbc0010I After 8722000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (820.96 seconds)\n", + "Cbc0010I After 8723000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (821.00 seconds)\n", + "Cbc0010I After 8724000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (821.04 seconds)\n", + "Cbc0010I After 8725000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (821.07 seconds)\n", + "Cbc0010I After 8726000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.11 seconds)\n", + "Cbc0010I After 8727000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (821.15 seconds)\n", + "Cbc0010I After 8728000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (821.20 seconds)\n", + "Cbc0010I After 8729000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (821.26 seconds)\n", + "Cbc0010I After 8730000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (821.30 seconds)\n", + "Cbc0010I After 8731000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.34 seconds)\n", + "Cbc0010I After 8732000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (821.40 seconds)\n", + "Cbc0010I After 8733000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.48 seconds)\n", + "Cbc0010I After 8734000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (821.51 seconds)\n", + "Cbc0010I After 8735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (821.55 seconds)\n", + "Cbc0010I After 8736000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (821.62 seconds)\n", + "Cbc0010I After 8737000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (821.66 seconds)\n", + "Cbc0010I After 8738000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (821.69 seconds)\n", + "Cbc0010I After 8739000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.72 seconds)\n", + "Cbc0010I After 8740000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (821.76 seconds)\n", + "Cbc0010I After 8741000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (821.81 seconds)\n", + "Cbc0010I After 8742000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (821.85 seconds)\n", + "Cbc0010I After 8743000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.91 seconds)\n", + "Cbc0010I After 8744000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (821.94 seconds)\n", + "Cbc0010I After 8745000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.98 seconds)\n", + "Cbc0010I After 8746000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (822.02 seconds)\n", + "Cbc0010I After 8747000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (822.05 seconds)\n", + "Cbc0010I After 8748000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (822.10 seconds)\n", + "Cbc0010I After 8749000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (822.14 seconds)\n", + "Cbc0010I After 8750000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (822.18 seconds)\n", + "Cbc0010I After 8751000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (822.21 seconds)\n", + "Cbc0010I After 8752000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (822.25 seconds)\n", + "Cbc0010I After 8753000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (822.30 seconds)\n", + "Cbc0010I After 8754000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (822.35 seconds)\n", + "Cbc0010I After 8755000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (822.39 seconds)\n", + "Cbc0010I After 8756000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (822.46 seconds)\n", + "Cbc0010I After 8757000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (822.54 seconds)\n", + "Cbc0010I After 8758000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (822.60 seconds)\n", + "Cbc0010I After 8759000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (822.64 seconds)\n", + "Cbc0010I After 8760000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (822.68 seconds)\n", + "Cbc0010I After 8761000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (822.73 seconds)\n", + "Cbc0010I After 8762000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (822.78 seconds)\n", + "Cbc0010I After 8763000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (822.83 seconds)\n", + "Cbc0010I After 8764000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (822.88 seconds)\n", + "Cbc0010I After 8765000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (822.95 seconds)\n", + "Cbc0010I After 8766000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (823.02 seconds)\n", + "Cbc0010I After 8767000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (823.06 seconds)\n", + "Cbc0010I After 8768000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (823.10 seconds)\n", + "Cbc0010I After 8769000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (823.13 seconds)\n", + "Cbc0010I After 8770000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (823.17 seconds)\n", + "Cbc0010I After 8771000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (823.21 seconds)\n", + "Cbc0010I After 8772000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (823.27 seconds)\n", + "Cbc0010I After 8773000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (823.35 seconds)\n", + "Cbc0010I After 8774000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (823.40 seconds)\n", + "Cbc0010I After 8775000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (823.43 seconds)\n", + "Cbc0010I After 8776000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (823.48 seconds)\n", + "Cbc0010I After 8777000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (823.51 seconds)\n", + "Cbc0010I After 8778000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (823.58 seconds)\n", + "Cbc0010I After 8779000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (823.66 seconds)\n", + "Cbc0010I After 8780000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (823.74 seconds)\n", + "Cbc0010I After 8781000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (823.82 seconds)\n", + "Cbc0010I After 8782000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (823.89 seconds)\n", + "Cbc0010I After 8783000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (823.97 seconds)\n", + "Cbc0010I After 8784000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (824.05 seconds)\n", + "Cbc0010I After 8785000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (824.13 seconds)\n", + "Cbc0010I After 8786000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (824.20 seconds)\n", + "Cbc0010I After 8787000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (824.28 seconds)\n", + "Cbc0010I After 8788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (824.34 seconds)\n", + "Cbc0010I After 8789000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.37 seconds)\n", + "Cbc0010I After 8790000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (824.41 seconds)\n", + "Cbc0010I After 8791000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (824.45 seconds)\n", + "Cbc0010I After 8792000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (824.51 seconds)\n", + "Cbc0010I After 8793000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (824.54 seconds)\n", + "Cbc0010I After 8794000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (824.58 seconds)\n", + "Cbc0010I After 8795000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.61 seconds)\n", + "Cbc0010I After 8796000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (824.67 seconds)\n", + "Cbc0010I After 8797000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (824.70 seconds)\n", + "Cbc0010I After 8798000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.74 seconds)\n", + "Cbc0010I After 8799000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (824.77 seconds)\n", + "Cbc0010I After 8800000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (824.80 seconds)\n", + "Cbc0010I After 8801000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (824.87 seconds)\n", + "Cbc0010I After 8802000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (824.95 seconds)\n", + "Cbc0010I After 8803000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (824.99 seconds)\n", + "Cbc0010I After 8804000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (825.02 seconds)\n", + "Cbc0010I After 8805000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (825.07 seconds)\n", + "Cbc0010I After 8806000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (825.22 seconds)\n", + "Cbc0010I After 8807000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (825.36 seconds)\n", + "Cbc0010I After 8808000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (825.54 seconds)\n", + "Cbc0010I After 8809000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (825.70 seconds)\n", + "Cbc0010I After 8810000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (825.78 seconds)\n", + "Cbc0010I After 8811000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (825.86 seconds)\n", + "Cbc0010I After 8812000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (826.01 seconds)\n", + "Cbc0010I After 8813000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (826.09 seconds)\n", + "Cbc0010I After 8814000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (826.17 seconds)\n", + "Cbc0010I After 8815000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (826.24 seconds)\n", + "Cbc0010I After 8816000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.32 seconds)\n", + "Cbc0010I After 8817000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (826.36 seconds)\n", + "Cbc0010I After 8818000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (826.41 seconds)\n", + "Cbc0010I After 8819000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.45 seconds)\n", + "Cbc0010I After 8820000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (826.52 seconds)\n", + "Cbc0010I After 8821000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (826.59 seconds)\n", + "Cbc0010I After 8822000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (826.62 seconds)\n", + "Cbc0010I After 8823000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.66 seconds)\n", + "Cbc0010I After 8824000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (826.71 seconds)\n", + "Cbc0010I After 8825000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (826.78 seconds)\n", + "Cbc0010I After 8826000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (826.83 seconds)\n", + "Cbc0010I After 8827000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (826.86 seconds)\n", + "Cbc0010I After 8828000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (826.91 seconds)\n", + "Cbc0010I After 8829000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (826.98 seconds)\n", + "Cbc0010I After 8830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (827.06 seconds)\n", + "Cbc0010I After 8831000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (827.13 seconds)\n", + "Cbc0010I After 8832000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (827.20 seconds)\n", + "Cbc0010I After 8833000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (827.28 seconds)\n", + "Cbc0010I After 8834000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (827.33 seconds)\n", + "Cbc0010I After 8835000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (827.37 seconds)\n", + "Cbc0010I After 8836000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (827.40 seconds)\n", + "Cbc0010I After 8837000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (827.43 seconds)\n", + "Cbc0010I After 8838000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (827.47 seconds)\n", + "Cbc0010I After 8839000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.50 seconds)\n", + "Cbc0010I After 8840000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (827.53 seconds)\n", + "Cbc0010I After 8841000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (827.57 seconds)\n", + "Cbc0010I After 8842000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (827.61 seconds)\n", + "Cbc0010I After 8843000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (827.64 seconds)\n", + "Cbc0010I After 8844000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (827.68 seconds)\n", + "Cbc0010I After 8845000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.74 seconds)\n", + "Cbc0010I After 8846000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (827.81 seconds)\n", + "Cbc0010I After 8847000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (827.87 seconds)\n", + "Cbc0010I After 8848000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (827.92 seconds)\n", + "Cbc0010I After 8849000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.98 seconds)\n", + "Cbc0010I After 8850000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (828.03 seconds)\n", + "Cbc0010I After 8851000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (828.08 seconds)\n", + "Cbc0010I After 8852000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (828.13 seconds)\n", + "Cbc0010I After 8853000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (828.18 seconds)\n", + "Cbc0010I After 8854000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (828.26 seconds)\n", + "Cbc0010I After 8855000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (828.31 seconds)\n", + "Cbc0010I After 8856000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (828.39 seconds)\n", + "Cbc0010I After 8857000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (828.50 seconds)\n", + "Cbc0010I After 8858000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (828.55 seconds)\n", + "Cbc0010I After 8859000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (828.60 seconds)\n", + "Cbc0010I After 8860000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (828.69 seconds)\n", + "Cbc0010I After 8861000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (828.77 seconds)\n", + "Cbc0010I After 8862000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (828.85 seconds)\n", + "Cbc0010I After 8863000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (828.92 seconds)\n", + "Cbc0010I After 8864000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (828.99 seconds)\n", + "Cbc0010I After 8865000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (829.07 seconds)\n", + "Cbc0010I After 8866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (829.12 seconds)\n", + "Cbc0010I After 8867000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (829.15 seconds)\n", + "Cbc0010I After 8868000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (829.19 seconds)\n", + "Cbc0010I After 8869000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (829.22 seconds)\n", + "Cbc0010I After 8870000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (829.25 seconds)\n", + "Cbc0010I After 8871000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (829.28 seconds)\n", + "Cbc0010I After 8872000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (829.33 seconds)\n", + "Cbc0010I After 8873000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (829.36 seconds)\n", + "Cbc0010I After 8874000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (829.41 seconds)\n", + "Cbc0010I After 8875000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (829.44 seconds)\n", + "Cbc0010I After 8876000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (829.47 seconds)\n", + "Cbc0010I After 8877000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (829.51 seconds)\n", + "Cbc0010I After 8878000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (829.57 seconds)\n", + "Cbc0010I After 8879000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (829.62 seconds)\n", + "Cbc0010I After 8880000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (829.66 seconds)\n", + "Cbc0010I After 8881000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (829.70 seconds)\n", + "Cbc0010I After 8882000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (829.73 seconds)\n", + "Cbc0010I After 8883000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (829.77 seconds)\n", + "Cbc0010I After 8884000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (829.82 seconds)\n", + "Cbc0010I After 8885000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (829.87 seconds)\n", + "Cbc0010I After 8886000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (829.91 seconds)\n", + "Cbc0010I After 8887000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (829.96 seconds)\n", + "Cbc0010I After 8888000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (830.04 seconds)\n", + "Cbc0010I After 8889000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (830.11 seconds)\n", + "Cbc0010I After 8890000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (830.14 seconds)\n", + "Cbc0010I After 8891000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (830.18 seconds)\n", + "Cbc0010I After 8892000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (830.22 seconds)\n", + "Cbc0010I After 8893000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (830.29 seconds)\n", + "Cbc0010I After 8894000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (830.34 seconds)\n", + "Cbc0010I After 8895000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (830.37 seconds)\n", + "Cbc0010I After 8896000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (830.43 seconds)\n", + "Cbc0010I After 8897000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (830.51 seconds)\n", + "Cbc0010I After 8898000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.58 seconds)\n", + "Cbc0010I After 8899000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (830.66 seconds)\n", + "Cbc0010I After 8900000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (830.71 seconds)\n", + "Cbc0010I After 8901000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (830.75 seconds)\n", + "Cbc0010I After 8902000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (830.78 seconds)\n", + "Cbc0010I After 8903000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (830.82 seconds)\n", + "Cbc0010I After 8904000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.85 seconds)\n", + "Cbc0010I After 8905000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (830.88 seconds)\n", + "Cbc0010I After 8906000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.92 seconds)\n", + "Cbc0010I After 8907000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (831.00 seconds)\n", + "Cbc0010I After 8908000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (831.06 seconds)\n", + "Cbc0010I After 8909000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (831.09 seconds)\n", + "Cbc0010I After 8910000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.13 seconds)\n", + "Cbc0010I After 8911000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (831.19 seconds)\n", + "Cbc0010I After 8912000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.26 seconds)\n", + "Cbc0010I After 8913000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (831.30 seconds)\n", + "Cbc0010I After 8914000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (831.34 seconds)\n", + "Cbc0010I After 8915000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (831.40 seconds)\n", + "Cbc0010I After 8916000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (831.43 seconds)\n", + "Cbc0010I After 8917000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (831.49 seconds)\n", + "Cbc0010I After 8918000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (831.57 seconds)\n", + "Cbc0010I After 8919000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (831.60 seconds)\n", + "Cbc0010I After 8920000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.63 seconds)\n", + "Cbc0010I After 8921000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (831.67 seconds)\n", + "Cbc0010I After 8922000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (831.70 seconds)\n", + "Cbc0010I After 8923000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (831.75 seconds)\n", + "Cbc0010I After 8924000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (831.78 seconds)\n", + "Cbc0010I After 8925000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (831.84 seconds)\n", + "Cbc0010I After 8926000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (831.87 seconds)\n", + "Cbc0010I After 8927000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (831.90 seconds)\n", + "Cbc0010I After 8928000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (831.94 seconds)\n", + "Cbc0010I After 8929000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (831.98 seconds)\n", + "Cbc0010I After 8930000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (832.05 seconds)\n", + "Cbc0010I After 8931000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (832.12 seconds)\n", + "Cbc0010I After 8932000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (832.15 seconds)\n", + "Cbc0010I After 8933000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (832.20 seconds)\n", + "Cbc0010I After 8934000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (832.27 seconds)\n", + "Cbc0010I After 8935000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (832.35 seconds)\n", + "Cbc0010I After 8936000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (832.42 seconds)\n", + "Cbc0010I After 8937000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (832.50 seconds)\n", + "Cbc0010I After 8938000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (832.56 seconds)\n", + "Cbc0010I After 8939000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (832.59 seconds)\n", + "Cbc0010I After 8940000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (832.62 seconds)\n", + "Cbc0010I After 8941000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (832.66 seconds)\n", + "Cbc0010I After 8942000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (832.69 seconds)\n", + "Cbc0010I After 8943000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (832.73 seconds)\n", + "Cbc0010I After 8944000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (832.78 seconds)\n", + "Cbc0010I After 8945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (832.81 seconds)\n", + "Cbc0010I After 8946000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (832.87 seconds)\n", + "Cbc0010I After 8947000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (832.92 seconds)\n", + "Cbc0010I After 8948000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (832.95 seconds)\n", + "Cbc0010I After 8949000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (833.00 seconds)\n", + "Cbc0010I After 8950000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (833.05 seconds)\n", + "Cbc0010I After 8951000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (833.08 seconds)\n", + "Cbc0010I After 8952000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (833.16 seconds)\n", + "Cbc0010I After 8953000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (833.21 seconds)\n", + "Cbc0010I After 8954000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (833.25 seconds)\n", + "Cbc0010I After 8955000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (833.28 seconds)\n", + "Cbc0010I After 8956000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (833.32 seconds)\n", + "Cbc0010I After 8957000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (833.39 seconds)\n", + "Cbc0010I After 8958000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (833.44 seconds)\n", + "Cbc0010I After 8959000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (833.52 seconds)\n", + "Cbc0010I After 8960000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (833.58 seconds)\n", + "Cbc0010I After 8961000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (833.62 seconds)\n", + "Cbc0010I After 8962000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (833.65 seconds)\n", + "Cbc0010I After 8963000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (833.68 seconds)\n", + "Cbc0010I After 8964000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (833.73 seconds)\n", + "Cbc0010I After 8965000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (833.81 seconds)\n", + "Cbc0010I After 8966000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (833.86 seconds)\n", + "Cbc0010I After 8967000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (833.90 seconds)\n", + "Cbc0010I After 8968000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (833.95 seconds)\n", + "Cbc0010I After 8969000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (833.99 seconds)\n", + "Cbc0010I After 8970000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (834.02 seconds)\n", + "Cbc0010I After 8971000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (834.06 seconds)\n", + "Cbc0010I After 8972000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (834.09 seconds)\n", + "Cbc0010I After 8973000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (834.14 seconds)\n", + "Cbc0010I After 8974000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (834.22 seconds)\n", + "Cbc0010I After 8975000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (834.30 seconds)\n", + "Cbc0010I After 8976000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (834.38 seconds)\n", + "Cbc0010I After 8977000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (834.46 seconds)\n", + "Cbc0010I After 8978000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (834.54 seconds)\n", + "Cbc0010I After 8979000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (834.67 seconds)\n", + "Cbc0010I After 8980000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (834.76 seconds)\n", + "Cbc0010I After 8981000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (834.83 seconds)\n", + "Cbc0010I After 8982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (834.91 seconds)\n", + "Cbc0010I After 8983000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (834.99 seconds)\n", + "Cbc0010I After 8984000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (835.06 seconds)\n", + "Cbc0010I After 8985000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (835.14 seconds)\n", + "Cbc0010I After 8986000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (835.22 seconds)\n", + "Cbc0010I After 8987000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (835.29 seconds)\n", + "Cbc0010I After 8988000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (835.36 seconds)\n", + "Cbc0010I After 8989000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (835.43 seconds)\n", + "Cbc0010I After 8990000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (835.50 seconds)\n", + "Cbc0010I After 8991000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (835.59 seconds)\n", + "Cbc0010I After 8992000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (835.64 seconds)\n", + "Cbc0010I After 8993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (835.69 seconds)\n", + "Cbc0010I After 8994000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (835.75 seconds)\n", + "Cbc0010I After 8995000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (835.80 seconds)\n", + "Cbc0010I After 8996000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (835.86 seconds)\n", + "Cbc0010I After 8997000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (835.93 seconds)\n", + "Cbc0010I After 8998000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (835.98 seconds)\n", + "Cbc0010I After 8999000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (836.04 seconds)\n", + "Cbc0010I After 9000000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (836.09 seconds)\n", + "Cbc0010I After 9001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (836.15 seconds)\n", + "Cbc0010I After 9002000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (836.20 seconds)\n", + "Cbc0010I After 9003000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (836.25 seconds)\n", + "Cbc0010I After 9004000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (836.30 seconds)\n", + "Cbc0010I After 9005000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (836.36 seconds)\n", + "Cbc0010I After 9006000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.42 seconds)\n", + "Cbc0010I After 9007000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (836.47 seconds)\n", + "Cbc0010I After 9008000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (836.52 seconds)\n", + "Cbc0010I After 9009000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (836.56 seconds)\n", + "Cbc0010I After 9010000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (836.59 seconds)\n", + "Cbc0010I After 9011000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (836.62 seconds)\n", + "Cbc0010I After 9012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (836.65 seconds)\n", + "Cbc0010I After 9013000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (836.68 seconds)\n", + "Cbc0010I After 9014000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (836.71 seconds)\n", + "Cbc0010I After 9015000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (836.75 seconds)\n", + "Cbc0010I After 9016000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (836.83 seconds)\n", + "Cbc0010I After 9017000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.86 seconds)\n", + "Cbc0010I After 9018000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.90 seconds)\n", + "Cbc0010I After 9019000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (836.94 seconds)\n", + "Cbc0010I After 9020000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (836.97 seconds)\n", + "Cbc0010I After 9021000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (837.03 seconds)\n", + "Cbc0010I After 9022000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (837.06 seconds)\n", + "Cbc0010I After 9023000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (837.09 seconds)\n", + "Cbc0010I After 9024000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (837.12 seconds)\n", + "Cbc0010I After 9025000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (837.15 seconds)\n", + "Cbc0010I After 9026000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (837.19 seconds)\n", + "Cbc0010I After 9027000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (837.22 seconds)\n", + "Cbc0010I After 9028000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (837.28 seconds)\n", + "Cbc0010I After 9029000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (837.34 seconds)\n", + "Cbc0010I After 9030000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (837.40 seconds)\n", + "Cbc0010I After 9031000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (837.46 seconds)\n", + "Cbc0010I After 9032000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (837.52 seconds)\n", + "Cbc0010I After 9033000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (837.57 seconds)\n", + "Cbc0010I After 9034000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (837.62 seconds)\n", + "Cbc0010I After 9035000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (837.66 seconds)\n", + "Cbc0010I After 9036000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (837.71 seconds)\n", + "Cbc0010I After 9037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (837.74 seconds)\n", + "Cbc0010I After 9038000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (837.80 seconds)\n", + "Cbc0010I After 9039000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (837.84 seconds)\n", + "Cbc0010I After 9040000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (837.87 seconds)\n", + "Cbc0010I After 9041000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (837.93 seconds)\n", + "Cbc0010I After 9042000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (837.97 seconds)\n", + "Cbc0010I After 9043000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (838.03 seconds)\n", + "Cbc0010I After 9044000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (838.08 seconds)\n", + "Cbc0010I After 9045000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (838.14 seconds)\n", + "Cbc0010I After 9046000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (838.20 seconds)\n", + "Cbc0010I After 9047000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (838.25 seconds)\n", + "Cbc0010I After 9048000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (838.28 seconds)\n", + "Cbc0010I After 9049000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (838.33 seconds)\n", + "Cbc0010I After 9050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (838.36 seconds)\n", + "Cbc0010I After 9051000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (838.39 seconds)\n", + "Cbc0010I After 9052000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (838.42 seconds)\n", + "Cbc0010I After 9053000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (838.45 seconds)\n", + "Cbc0010I After 9054000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (838.51 seconds)\n", + "Cbc0010I After 9055000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (838.55 seconds)\n", + "Cbc0010I After 9056000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (838.59 seconds)\n", + "Cbc0010I After 9057000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (838.63 seconds)\n", + "Cbc0010I After 9058000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (838.69 seconds)\n", + "Cbc0010I After 9059000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (838.73 seconds)\n", + "Cbc0010I After 9060000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (838.76 seconds)\n", + "Cbc0010I After 9061000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (838.83 seconds)\n", + "Cbc0010I After 9062000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (838.89 seconds)\n", + "Cbc0010I After 9063000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (838.93 seconds)\n", + "Cbc0010I After 9064000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (838.97 seconds)\n", + "Cbc0010I After 9065000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (839.00 seconds)\n", + "Cbc0010I After 9066000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.05 seconds)\n", + "Cbc0010I After 9067000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (839.08 seconds)\n", + "Cbc0010I After 9068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (839.14 seconds)\n", + "Cbc0010I After 9069000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (839.20 seconds)\n", + "Cbc0010I After 9070000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (839.25 seconds)\n", + "Cbc0010I After 9071000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (839.32 seconds)\n", + "Cbc0010I After 9072000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (839.35 seconds)\n", + "Cbc0010I After 9073000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (839.39 seconds)\n", + "Cbc0010I After 9074000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (839.44 seconds)\n", + "Cbc0010I After 9075000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (839.48 seconds)\n", + "Cbc0010I After 9076000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (839.52 seconds)\n", + "Cbc0010I After 9077000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (839.56 seconds)\n", + "Cbc0010I After 9078000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (839.61 seconds)\n", + "Cbc0010I After 9079000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (839.66 seconds)\n", + "Cbc0010I After 9080000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.71 seconds)\n", + "Cbc0010I After 9081000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (839.75 seconds)\n", + "Cbc0010I After 9082000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (839.78 seconds)\n", + "Cbc0010I After 9083000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (839.81 seconds)\n", + "Cbc0010I After 9084000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (839.85 seconds)\n", + "Cbc0010I After 9085000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (839.89 seconds)\n", + "Cbc0010I After 9086000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (839.93 seconds)\n", + "Cbc0010I After 9087000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.97 seconds)\n", + "Cbc0010I After 9088000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (840.01 seconds)\n", + "Cbc0010I After 9089000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (840.06 seconds)\n", + "Cbc0010I After 9090000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (840.10 seconds)\n", + "Cbc0010I After 9091000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (840.15 seconds)\n", + "Cbc0010I After 9092000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (840.21 seconds)\n", + "Cbc0010I After 9093000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (840.27 seconds)\n", + "Cbc0010I After 9094000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (840.31 seconds)\n", + "Cbc0010I After 9095000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (840.35 seconds)\n", + "Cbc0010I After 9096000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (840.40 seconds)\n", + "Cbc0010I After 9097000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (840.45 seconds)\n", + "Cbc0010I After 9098000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (840.51 seconds)\n", + "Cbc0010I After 9099000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (840.58 seconds)\n", + "Cbc0010I After 9100000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (840.64 seconds)\n", + "Cbc0010I After 9101000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (840.70 seconds)\n", + "Cbc0010I After 9102000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (840.81 seconds)\n", + "Cbc0010I After 9103000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (840.87 seconds)\n", + "Cbc0010I After 9104000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (840.92 seconds)\n", + "Cbc0010I After 9105000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (840.97 seconds)\n", + "Cbc0010I After 9106000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (841.02 seconds)\n", + "Cbc0010I After 9107000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (841.07 seconds)\n", + "Cbc0010I After 9108000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (841.11 seconds)\n", + "Cbc0010I After 9109000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (841.16 seconds)\n", + "Cbc0010I After 9110000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (841.20 seconds)\n", + "Cbc0010I After 9111000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (841.25 seconds)\n", + "Cbc0010I After 9112000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (841.32 seconds)\n", + "Cbc0010I After 9113000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (841.36 seconds)\n", + "Cbc0010I After 9114000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (841.41 seconds)\n", + "Cbc0010I After 9115000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (841.46 seconds)\n", + "Cbc0010I After 9116000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (841.50 seconds)\n", + "Cbc0010I After 9117000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (841.55 seconds)\n", + "Cbc0010I After 9118000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (841.59 seconds)\n", + "Cbc0010I After 9119000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (841.65 seconds)\n", + "Cbc0010I After 9120000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (841.70 seconds)\n", + "Cbc0010I After 9121000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (841.75 seconds)\n", + "Cbc0010I After 9122000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (841.79 seconds)\n", + "Cbc0010I After 9123000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (841.84 seconds)\n", + "Cbc0010I After 9124000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (841.88 seconds)\n", + "Cbc0010I After 9125000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (841.93 seconds)\n", + "Cbc0010I After 9126000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (841.98 seconds)\n", + "Cbc0010I After 9127000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (842.02 seconds)\n", + "Cbc0010I After 9128000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (842.07 seconds)\n", + "Cbc0010I After 9129000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (842.13 seconds)\n", + "Cbc0010I After 9130000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (842.17 seconds)\n", + "Cbc0010I After 9131000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (842.21 seconds)\n", + "Cbc0010I After 9132000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (842.24 seconds)\n", + "Cbc0010I After 9133000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (842.29 seconds)\n", + "Cbc0010I After 9134000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (842.33 seconds)\n", + "Cbc0010I After 9135000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.37 seconds)\n", + "Cbc0010I After 9136000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (842.42 seconds)\n", + "Cbc0010I After 9137000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.46 seconds)\n", + "Cbc0010I After 9138000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (842.53 seconds)\n", + "Cbc0010I After 9139000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.58 seconds)\n", + "Cbc0010I After 9140000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (842.64 seconds)\n", + "Cbc0010I After 9141000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (842.68 seconds)\n", + "Cbc0010I After 9142000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.74 seconds)\n", + "Cbc0010I After 9143000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (842.78 seconds)\n", + "Cbc0010I After 9144000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (842.83 seconds)\n", + "Cbc0010I After 9145000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (842.87 seconds)\n", + "Cbc0010I After 9146000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (842.91 seconds)\n", + "Cbc0010I After 9147000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (842.95 seconds)\n", + "Cbc0010I After 9148000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (842.98 seconds)\n", + "Cbc0010I After 9149000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (843.03 seconds)\n", + "Cbc0010I After 9150000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (843.07 seconds)\n", + "Cbc0010I After 9151000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (843.12 seconds)\n", + "Cbc0010I After 9152000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.20 seconds)\n", + "Cbc0010I After 9153000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (843.24 seconds)\n", + "Cbc0010I After 9154000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.28 seconds)\n", + "Cbc0010I After 9155000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (843.34 seconds)\n", + "Cbc0010I After 9156000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (843.38 seconds)\n", + "Cbc0010I After 9157000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (843.42 seconds)\n", + "Cbc0010I After 9158000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (843.48 seconds)\n", + "Cbc0010I After 9159000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (843.52 seconds)\n", + "Cbc0010I After 9160000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (843.57 seconds)\n", + "Cbc0010I After 9161000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (843.62 seconds)\n", + "Cbc0010I After 9162000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.68 seconds)\n", + "Cbc0010I After 9163000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (843.72 seconds)\n", + "Cbc0010I After 9164000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (843.75 seconds)\n", + "Cbc0010I After 9165000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.79 seconds)\n", + "Cbc0010I After 9166000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.84 seconds)\n", + "Cbc0010I After 9167000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (843.88 seconds)\n", + "Cbc0010I After 9168000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.92 seconds)\n", + "Cbc0010I After 9169000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (843.96 seconds)\n", + "Cbc0010I After 9170000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (844.02 seconds)\n", + "Cbc0010I After 9171000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (844.05 seconds)\n", + "Cbc0010I After 9172000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (844.09 seconds)\n", + "Cbc0010I After 9173000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (844.15 seconds)\n", + "Cbc0010I After 9174000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (844.19 seconds)\n", + "Cbc0010I After 9175000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.23 seconds)\n", + "Cbc0010I After 9176000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (844.28 seconds)\n", + "Cbc0010I After 9177000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (844.33 seconds)\n", + "Cbc0010I After 9178000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.36 seconds)\n", + "Cbc0010I After 9179000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.41 seconds)\n", + "Cbc0010I After 9180000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (844.46 seconds)\n", + "Cbc0010I After 9181000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (844.49 seconds)\n", + "Cbc0010I After 9182000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (844.54 seconds)\n", + "Cbc0010I After 9183000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (844.58 seconds)\n", + "Cbc0010I After 9184000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (844.63 seconds)\n", + "Cbc0010I After 9185000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (844.68 seconds)\n", + "Cbc0010I After 9186000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (844.71 seconds)\n", + "Cbc0010I After 9187000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (844.75 seconds)\n", + "Cbc0010I After 9188000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.79 seconds)\n", + "Cbc0010I After 9189000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (844.85 seconds)\n", + "Cbc0010I After 9190000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (844.90 seconds)\n", + "Cbc0010I After 9191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (844.94 seconds)\n", + "Cbc0010I After 9192000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (844.98 seconds)\n", + "Cbc0010I After 9193000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (845.04 seconds)\n", + "Cbc0010I After 9194000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (845.09 seconds)\n", + "Cbc0010I After 9195000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (845.13 seconds)\n", + "Cbc0010I After 9196000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (845.17 seconds)\n", + "Cbc0010I After 9197000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.22 seconds)\n", + "Cbc0010I After 9198000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (845.28 seconds)\n", + "Cbc0010I After 9199000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (845.32 seconds)\n", + "Cbc0010I After 9200000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (845.36 seconds)\n", + "Cbc0010I After 9201000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (845.41 seconds)\n", + "Cbc0010I After 9202000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.47 seconds)\n", + "Cbc0010I After 9203000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (845.51 seconds)\n", + "Cbc0010I After 9204000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.55 seconds)\n", + "Cbc0010I After 9205000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (845.60 seconds)\n", + "Cbc0010I After 9206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (845.66 seconds)\n", + "Cbc0010I After 9207000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (845.69 seconds)\n", + "Cbc0010I After 9208000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (845.73 seconds)\n", + "Cbc0010I After 9209000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (845.76 seconds)\n", + "Cbc0010I After 9210000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (845.80 seconds)\n", + "Cbc0010I After 9211000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (845.84 seconds)\n", + "Cbc0010I After 9212000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (845.87 seconds)\n", + "Cbc0010I After 9213000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (845.91 seconds)\n", + "Cbc0010I After 9214000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (845.95 seconds)\n", + "Cbc0010I After 9215000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (845.99 seconds)\n", + "Cbc0010I After 9216000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.05 seconds)\n", + "Cbc0010I After 9217000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (846.10 seconds)\n", + "Cbc0010I After 9218000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (846.14 seconds)\n", + "Cbc0010I After 9219000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (846.18 seconds)\n", + "Cbc0010I After 9220000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (846.22 seconds)\n", + "Cbc0010I After 9221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (846.29 seconds)\n", + "Cbc0010I After 9222000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (846.33 seconds)\n", + "Cbc0010I After 9223000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (846.37 seconds)\n", + "Cbc0010I After 9224000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (846.41 seconds)\n", + "Cbc0010I After 9225000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (846.46 seconds)\n", + "Cbc0010I After 9226000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (846.53 seconds)\n", + "Cbc0010I After 9227000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (846.59 seconds)\n", + "Cbc0010I After 9228000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (846.65 seconds)\n", + "Cbc0010I After 9229000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (846.71 seconds)\n", + "Cbc0010I After 9230000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (846.77 seconds)\n", + "Cbc0010I After 9231000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.80 seconds)\n", + "Cbc0010I After 9232000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (846.83 seconds)\n", + "Cbc0010I After 9233000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (846.87 seconds)\n", + "Cbc0010I After 9234000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (846.90 seconds)\n", + "Cbc0010I After 9235000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.94 seconds)\n", + "Cbc0010I After 9236000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (846.97 seconds)\n", + "Cbc0010I After 9237000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (847.01 seconds)\n", + "Cbc0010I After 9238000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (847.05 seconds)\n", + "Cbc0010I After 9239000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (847.12 seconds)\n", + "Cbc0010I After 9240000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (847.17 seconds)\n", + "Cbc0010I After 9241000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.24 seconds)\n", + "Cbc0010I After 9242000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (847.29 seconds)\n", + "Cbc0010I After 9243000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.35 seconds)\n", + "Cbc0010I After 9244000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (847.40 seconds)\n", + "Cbc0010I After 9245000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (847.43 seconds)\n", + "Cbc0010I After 9246000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (847.47 seconds)\n", + "Cbc0010I After 9247000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (847.51 seconds)\n", + "Cbc0010I After 9248000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.54 seconds)\n", + "Cbc0010I After 9249000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.56 seconds)\n", + "Cbc0010I After 9250000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (847.59 seconds)\n", + "Cbc0010I After 9251000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (847.62 seconds)\n", + "Cbc0010I After 9252000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.65 seconds)\n", + "Cbc0010I After 9253000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.69 seconds)\n", + "Cbc0010I After 9254000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (847.73 seconds)\n", + "Cbc0010I After 9255000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (847.76 seconds)\n", + "Cbc0010I After 9256000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (847.79 seconds)\n", + "Cbc0010I After 9257000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.83 seconds)\n", + "Cbc0010I After 9258000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (847.86 seconds)\n", + "Cbc0010I After 9259000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (847.89 seconds)\n", + "Cbc0010I After 9260000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (847.93 seconds)\n", + "Cbc0010I After 9261000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (847.96 seconds)\n", + "Cbc0010I After 9262000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (847.99 seconds)\n", + "Cbc0010I After 9263000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (848.02 seconds)\n", + "Cbc0010I After 9264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (848.05 seconds)\n", + "Cbc0010I After 9265000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (848.10 seconds)\n", + "Cbc0010I After 9266000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (848.14 seconds)\n", + "Cbc0010I After 9267000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (848.18 seconds)\n", + "Cbc0010I After 9268000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (848.23 seconds)\n", + "Cbc0010I After 9269000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (848.27 seconds)\n", + "Cbc0010I After 9270000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (848.32 seconds)\n", + "Cbc0010I After 9271000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (848.36 seconds)\n", + "Cbc0010I After 9272000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (848.41 seconds)\n", + "Cbc0010I After 9273000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (848.46 seconds)\n", + "Cbc0010I After 9274000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (848.51 seconds)\n", + "Cbc0010I After 9275000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (848.56 seconds)\n", + "Cbc0010I After 9276000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (848.60 seconds)\n", + "Cbc0010I After 9277000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (848.65 seconds)\n", + "Cbc0010I After 9278000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (848.69 seconds)\n", + "Cbc0010I After 9279000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (848.74 seconds)\n", + "Cbc0010I After 9280000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (848.79 seconds)\n", + "Cbc0010I After 9281000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (848.85 seconds)\n", + "Cbc0010I After 9282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (848.91 seconds)\n", + "Cbc0010I After 9283000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (848.96 seconds)\n", + "Cbc0010I After 9284000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (849.02 seconds)\n", + "Cbc0010I After 9285000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (849.07 seconds)\n", + "Cbc0010I After 9286000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (849.13 seconds)\n", + "Cbc0010I After 9287000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (849.18 seconds)\n", + "Cbc0010I After 9288000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (849.23 seconds)\n", + "Cbc0010I After 9289000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (849.29 seconds)\n", + "Cbc0010I After 9290000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.34 seconds)\n", + "Cbc0010I After 9291000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (849.40 seconds)\n", + "Cbc0010I After 9292000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (849.45 seconds)\n", + "Cbc0010I After 9293000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.52 seconds)\n", + "Cbc0010I After 9294000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (849.57 seconds)\n", + "Cbc0010I After 9295000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (849.62 seconds)\n", + "Cbc0010I After 9296000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.67 seconds)\n", + "Cbc0010I After 9297000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (849.73 seconds)\n", + "Cbc0010I After 9298000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.78 seconds)\n", + "Cbc0010I After 9299000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (849.83 seconds)\n", + "Cbc0010I After 9300000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (849.89 seconds)\n", + "Cbc0010I After 9301000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (849.95 seconds)\n", + "Cbc0010I After 9302000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (850.01 seconds)\n", + "Cbc0010I After 9303000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (850.07 seconds)\n", + "Cbc0010I After 9304000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (850.12 seconds)\n", + "Cbc0010I After 9305000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (850.18 seconds)\n", + "Cbc0010I After 9306000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (850.23 seconds)\n", + "Cbc0010I After 9307000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (850.30 seconds)\n", + "Cbc0010I After 9308000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (850.35 seconds)\n", + "Cbc0010I After 9309000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (850.40 seconds)\n", + "Cbc0010I After 9310000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (850.46 seconds)\n", + "Cbc0010I After 9311000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (850.52 seconds)\n", + "Cbc0010I After 9312000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (850.57 seconds)\n", + "Cbc0010I After 9313000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (850.64 seconds)\n", + "Cbc0010I After 9314000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (850.70 seconds)\n", + "Cbc0010I After 9315000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (850.76 seconds)\n", + "Cbc0010I After 9316000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (850.83 seconds)\n", + "Cbc0010I After 9317000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (850.91 seconds)\n", + "Cbc0010I After 9318000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (850.97 seconds)\n", + "Cbc0010I After 9319000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (851.03 seconds)\n", + "Cbc0010I After 9320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (851.09 seconds)\n", + "Cbc0010I After 9321000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (851.16 seconds)\n", + "Cbc0010I After 9322000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (851.23 seconds)\n", + "Cbc0010I After 9323000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.30 seconds)\n", + "Cbc0010I After 9324000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (851.37 seconds)\n", + "Cbc0010I After 9325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (851.44 seconds)\n", + "Cbc0010I After 9326000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.50 seconds)\n", + "Cbc0010I After 9327000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (851.58 seconds)\n", + "Cbc0010I After 9328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (851.65 seconds)\n", + "Cbc0010I After 9329000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.72 seconds)\n", + "Cbc0010I After 9330000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (851.77 seconds)\n", + "Cbc0010I After 9331000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (851.81 seconds)\n", + "Cbc0010I After 9332000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (851.84 seconds)\n", + "Cbc0010I After 9333000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (851.90 seconds)\n", + "Cbc0010I After 9334000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (851.94 seconds)\n", + "Cbc0010I After 9335000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (852.01 seconds)\n", + "Cbc0010I After 9336000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (852.04 seconds)\n", + "Cbc0010I After 9337000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (852.08 seconds)\n", + "Cbc0010I After 9338000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (852.11 seconds)\n", + "Cbc0010I After 9339000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (852.15 seconds)\n", + "Cbc0010I After 9340000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (852.20 seconds)\n", + "Cbc0010I After 9341000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (852.27 seconds)\n", + "Cbc0010I After 9342000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (852.34 seconds)\n", + "Cbc0010I After 9343000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (852.41 seconds)\n", + "Cbc0010I After 9344000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (852.47 seconds)\n", + "Cbc0010I After 9345000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (852.51 seconds)\n", + "Cbc0010I After 9346000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (852.57 seconds)\n", + "Cbc0010I After 9347000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (852.62 seconds)\n", + "Cbc0010I After 9348000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (852.66 seconds)\n", + "Cbc0010I After 9349000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (852.70 seconds)\n", + "Cbc0010I After 9350000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (852.74 seconds)\n", + "Cbc0010I After 9351000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (852.79 seconds)\n", + "Cbc0010I After 9352000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (852.82 seconds)\n", + "Cbc0010I After 9353000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (852.88 seconds)\n", + "Cbc0010I After 9354000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (852.93 seconds)\n", + "Cbc0010I After 9355000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (852.96 seconds)\n", + "Cbc0010I After 9356000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (852.99 seconds)\n", + "Cbc0010I After 9357000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (853.04 seconds)\n", + "Cbc0010I After 9358000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (853.12 seconds)\n", + "Cbc0010I After 9359000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (853.20 seconds)\n", + "Cbc0010I After 9360000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (853.28 seconds)\n", + "Cbc0010I After 9361000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (853.36 seconds)\n", + "Cbc0010I After 9362000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (853.44 seconds)\n", + "Cbc0010I After 9363000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (853.52 seconds)\n", + "Cbc0010I After 9364000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (853.59 seconds)\n", + "Cbc0010I After 9365000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (853.67 seconds)\n", + "Cbc0010I After 9366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (853.75 seconds)\n", + "Cbc0010I After 9367000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (853.83 seconds)\n", + "Cbc0010I After 9368000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (853.89 seconds)\n", + "Cbc0010I After 9369000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (853.93 seconds)\n", + "Cbc0010I After 9370000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (853.99 seconds)\n", + "Cbc0010I After 9371000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (854.05 seconds)\n", + "Cbc0010I After 9372000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (854.10 seconds)\n", + "Cbc0010I After 9373000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (854.15 seconds)\n", + "Cbc0010I After 9374000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (854.18 seconds)\n", + "Cbc0010I After 9375000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (854.21 seconds)\n", + "Cbc0010I After 9376000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (854.24 seconds)\n", + "Cbc0010I After 9377000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (854.28 seconds)\n", + "Cbc0010I After 9378000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (854.32 seconds)\n", + "Cbc0010I After 9379000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (854.35 seconds)\n", + "Cbc0010I After 9380000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (854.39 seconds)\n", + "Cbc0010I After 9381000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (854.45 seconds)\n", + "Cbc0010I After 9382000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (854.50 seconds)\n", + "Cbc0010I After 9383000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (854.54 seconds)\n", + "Cbc0010I After 9384000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (854.60 seconds)\n", + "Cbc0010I After 9385000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (854.64 seconds)\n", + "Cbc0010I After 9386000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (854.68 seconds)\n", + "Cbc0010I After 9387000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (854.71 seconds)\n", + "Cbc0010I After 9388000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (854.75 seconds)\n", + "Cbc0010I After 9389000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (854.79 seconds)\n", + "Cbc0010I After 9390000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (854.83 seconds)\n", + "Cbc0010I After 9391000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (854.86 seconds)\n", + "Cbc0010I After 9392000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (854.90 seconds)\n", + "Cbc0010I After 9393000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (854.96 seconds)\n", + "Cbc0010I After 9394000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (855.00 seconds)\n", + "Cbc0010I After 9395000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (855.07 seconds)\n", + "Cbc0010I After 9396000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (855.16 seconds)\n", + "Cbc0010I After 9397000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (855.21 seconds)\n", + "Cbc0010I After 9398000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (855.25 seconds)\n", + "Cbc0010I After 9399000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (855.31 seconds)\n", + "Cbc0010I After 9400000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (855.40 seconds)\n", + "Cbc0010I After 9401000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (855.48 seconds)\n", + "Cbc0010I After 9402000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (855.53 seconds)\n", + "Cbc0010I After 9403000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (855.59 seconds)\n", + "Cbc0010I After 9404000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (855.63 seconds)\n", + "Cbc0010I After 9405000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (855.71 seconds)\n", + "Cbc0010I After 9406000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (855.76 seconds)\n", + "Cbc0010I After 9407000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (855.80 seconds)\n", + "Cbc0010I After 9408000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (855.87 seconds)\n", + "Cbc0010I After 9409000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (855.91 seconds)\n", + "Cbc0010I After 9410000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (855.96 seconds)\n", + "Cbc0010I After 9411000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (856.03 seconds)\n", + "Cbc0010I After 9412000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (856.11 seconds)\n", + "Cbc0010I After 9413000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (856.18 seconds)\n", + "Cbc0010I After 9414000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (856.25 seconds)\n", + "Cbc0010I After 9415000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (856.33 seconds)\n", + "Cbc0010I After 9416000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (856.39 seconds)\n", + "Cbc0010I After 9417000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (856.43 seconds)\n", + "Cbc0010I After 9418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (856.46 seconds)\n", + "Cbc0010I After 9419000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (856.50 seconds)\n", + "Cbc0010I After 9420000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (856.55 seconds)\n", + "Cbc0010I After 9421000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (856.59 seconds)\n", + "Cbc0010I After 9422000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (856.64 seconds)\n", + "Cbc0010I After 9423000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (856.70 seconds)\n", + "Cbc0010I After 9424000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (856.78 seconds)\n", + "Cbc0010I After 9425000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (856.84 seconds)\n", + "Cbc0010I After 9426000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (856.91 seconds)\n", + "Cbc0010I After 9427000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (856.96 seconds)\n", + "Cbc0010I After 9428000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (856.99 seconds)\n", + "Cbc0010I After 9429000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (857.03 seconds)\n", + "Cbc0010I After 9430000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.08 seconds)\n", + "Cbc0010I After 9431000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (857.13 seconds)\n", + "Cbc0010I After 9432000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (857.20 seconds)\n", + "Cbc0010I After 9433000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (857.31 seconds)\n", + "Cbc0010I After 9434000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (857.39 seconds)\n", + "Cbc0010I After 9435000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.43 seconds)\n", + "Cbc0010I After 9436000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (857.47 seconds)\n", + "Cbc0010I After 9437000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (857.51 seconds)\n", + "Cbc0010I After 9438000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (857.55 seconds)\n", + "Cbc0010I After 9439000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.60 seconds)\n", + "Cbc0010I After 9440000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (857.68 seconds)\n", + "Cbc0010I After 9441000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (857.75 seconds)\n", + "Cbc0010I After 9442000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (857.81 seconds)\n", + "Cbc0010I After 9443000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (857.88 seconds)\n", + "Cbc0010I After 9444000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (857.93 seconds)\n", + "Cbc0010I After 9445000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (857.96 seconds)\n", + "Cbc0010I After 9446000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (858.01 seconds)\n", + "Cbc0010I After 9447000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (858.08 seconds)\n", + "Cbc0010I After 9448000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (858.14 seconds)\n", + "Cbc0010I After 9449000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (858.21 seconds)\n", + "Cbc0010I After 9450000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (858.29 seconds)\n", + "Cbc0010I After 9451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (858.33 seconds)\n", + "Cbc0010I After 9452000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (858.38 seconds)\n", + "Cbc0010I After 9453000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (858.44 seconds)\n", + "Cbc0010I After 9454000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (858.50 seconds)\n", + "Cbc0010I After 9455000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (858.58 seconds)\n", + "Cbc0010I After 9456000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (858.65 seconds)\n", + "Cbc0010I After 9457000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (858.73 seconds)\n", + "Cbc0010I After 9458000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (858.81 seconds)\n", + "Cbc0010I After 9459000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (858.89 seconds)\n", + "Cbc0010I After 9460000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (858.96 seconds)\n", + "Cbc0010I After 9461000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (859.04 seconds)\n", + "Cbc0010I After 9462000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (859.12 seconds)\n", + "Cbc0010I After 9463000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (859.20 seconds)\n", + "Cbc0010I After 9464000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (859.27 seconds)\n", + "Cbc0010I After 9465000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (859.32 seconds)\n", + "Cbc0010I After 9466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (859.39 seconds)\n", + "Cbc0010I After 9467000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (859.47 seconds)\n", + "Cbc0010I After 9468000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (859.53 seconds)\n", + "Cbc0010I After 9469000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (859.60 seconds)\n", + "Cbc0010I After 9470000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (859.67 seconds)\n", + "Cbc0010I After 9471000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (859.73 seconds)\n", + "Cbc0010I After 9472000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (859.80 seconds)\n", + "Cbc0010I After 9473000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (859.86 seconds)\n", + "Cbc0010I After 9474000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (859.93 seconds)\n", + "Cbc0010I After 9475000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (860.00 seconds)\n", + "Cbc0010I After 9476000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (860.05 seconds)\n", + "Cbc0010I After 9477000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (860.11 seconds)\n", + "Cbc0010I After 9478000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (860.16 seconds)\n", + "Cbc0010I After 9479000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (860.23 seconds)\n", + "Cbc0010I After 9480000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.29 seconds)\n", + "Cbc0010I After 9481000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (860.36 seconds)\n", + "Cbc0010I After 9482000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.44 seconds)\n", + "Cbc0010I After 9483000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.53 seconds)\n", + "Cbc0010I After 9484000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.62 seconds)\n", + "Cbc0010I After 9485000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (860.68 seconds)\n", + "Cbc0010I After 9486000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.74 seconds)\n", + "Cbc0010I After 9487000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (860.82 seconds)\n", + "Cbc0010I After 9488000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (860.89 seconds)\n", + "Cbc0010I After 9489000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.97 seconds)\n", + "Cbc0010I After 9490000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (861.04 seconds)\n", + "Cbc0010I After 9491000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (861.11 seconds)\n", + "Cbc0010I After 9492000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (861.18 seconds)\n", + "Cbc0010I After 9493000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (861.22 seconds)\n", + "Cbc0010I After 9494000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (861.25 seconds)\n", + "Cbc0010I After 9495000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (861.28 seconds)\n", + "Cbc0010I After 9496000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (861.31 seconds)\n", + "Cbc0010I After 9497000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (861.34 seconds)\n", + "Cbc0010I After 9498000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (861.37 seconds)\n", + "Cbc0010I After 9499000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (861.42 seconds)\n", + "Cbc0010I After 9500000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (861.48 seconds)\n", + "Cbc0010I After 9501000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (861.53 seconds)\n", + "Cbc0010I After 9502000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (861.58 seconds)\n", + "Cbc0010I After 9503000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (861.64 seconds)\n", + "Cbc0010I After 9504000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (861.69 seconds)\n", + "Cbc0010I After 9505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (861.74 seconds)\n", + "Cbc0010I After 9506000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (861.79 seconds)\n", + "Cbc0010I After 9507000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (861.82 seconds)\n", + "Cbc0010I After 9508000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (861.85 seconds)\n", + "Cbc0010I After 9509000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (861.89 seconds)\n", + "Cbc0010I After 9510000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (861.93 seconds)\n", + "Cbc0010I After 9511000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (861.99 seconds)\n", + "Cbc0010I After 9512000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.06 seconds)\n", + "Cbc0010I After 9513000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (862.10 seconds)\n", + "Cbc0010I After 9514000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (862.13 seconds)\n", + "Cbc0010I After 9515000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (862.19 seconds)\n", + "Cbc0010I After 9516000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (862.27 seconds)\n", + "Cbc0010I After 9517000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (862.35 seconds)\n", + "Cbc0010I After 9518000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (862.43 seconds)\n", + "Cbc0010I After 9519000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (862.51 seconds)\n", + "Cbc0010I After 9520000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.58 seconds)\n", + "Cbc0010I After 9521000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (862.65 seconds)\n", + "Cbc0010I After 9522000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (862.68 seconds)\n", + "Cbc0010I After 9523000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (862.72 seconds)\n", + "Cbc0010I After 9524000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (862.78 seconds)\n", + "Cbc0010I After 9525000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (862.81 seconds)\n", + "Cbc0010I After 9526000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (862.84 seconds)\n", + "Cbc0010I After 9527000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (862.89 seconds)\n", + "Cbc0010I After 9528000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.94 seconds)\n", + "Cbc0010I After 9529000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (862.99 seconds)\n", + "Cbc0010I After 9530000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (863.05 seconds)\n", + "Cbc0010I After 9531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (863.11 seconds)\n", + "Cbc0010I After 9532000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (863.15 seconds)\n", + "Cbc0010I After 9533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (863.19 seconds)\n", + "Cbc0010I After 9534000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (863.23 seconds)\n", + "Cbc0010I After 9535000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (863.27 seconds)\n", + "Cbc0010I After 9536000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (863.32 seconds)\n", + "Cbc0010I After 9537000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (863.38 seconds)\n", + "Cbc0010I After 9538000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (863.44 seconds)\n", + "Cbc0010I After 9539000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (863.48 seconds)\n", + "Cbc0010I After 9540000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (863.54 seconds)\n", + "Cbc0010I After 9541000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (863.58 seconds)\n", + "Cbc0010I After 9542000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (863.62 seconds)\n", + "Cbc0010I After 9543000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (863.66 seconds)\n", + "Cbc0010I After 9544000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (863.71 seconds)\n", + "Cbc0010I After 9545000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (863.75 seconds)\n", + "Cbc0010I After 9546000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (863.80 seconds)\n", + "Cbc0010I After 9547000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (863.83 seconds)\n", + "Cbc0010I After 9548000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (863.87 seconds)\n", + "Cbc0010I After 9549000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (863.91 seconds)\n", + "Cbc0010I After 9550000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (863.94 seconds)\n", + "Cbc0010I After 9551000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (863.97 seconds)\n", + "Cbc0010I After 9552000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (864.01 seconds)\n", + "Cbc0010I After 9553000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (864.06 seconds)\n", + "Cbc0010I After 9554000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (864.11 seconds)\n", + "Cbc0010I After 9555000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (864.15 seconds)\n", + "Cbc0010I After 9556000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (864.19 seconds)\n", + "Cbc0010I After 9557000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (864.24 seconds)\n", + "Cbc0010I After 9558000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (864.27 seconds)\n", + "Cbc0010I After 9559000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (864.33 seconds)\n", + "Cbc0010I After 9560000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (864.36 seconds)\n", + "Cbc0010I After 9561000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (864.41 seconds)\n", + "Cbc0010I After 9562000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (864.45 seconds)\n", + "Cbc0010I After 9563000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (864.48 seconds)\n", + "Cbc0010I After 9564000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (864.52 seconds)\n", + "Cbc0010I After 9565000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (864.57 seconds)\n", + "Cbc0010I After 9566000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (864.64 seconds)\n", + "Cbc0010I After 9567000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (864.69 seconds)\n", + "Cbc0010I After 9568000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (864.72 seconds)\n", + "Cbc0010I After 9569000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (864.76 seconds)\n", + "Cbc0010I After 9570000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (864.80 seconds)\n", + "Cbc0010I After 9571000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (864.84 seconds)\n", + "Cbc0010I After 9572000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (864.87 seconds)\n", + "Cbc0010I After 9573000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (864.91 seconds)\n", + "Cbc0010I After 9574000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (864.95 seconds)\n", + "Cbc0010I After 9575000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (865.01 seconds)\n", + "Cbc0010I After 9576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (865.05 seconds)\n", + "Cbc0010I After 9577000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (865.10 seconds)\n", + "Cbc0010I After 9578000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (865.13 seconds)\n", + "Cbc0010I After 9579000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (865.17 seconds)\n", + "Cbc0010I After 9580000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (865.21 seconds)\n", + "Cbc0010I After 9581000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (865.25 seconds)\n", + "Cbc0010I After 9582000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (865.30 seconds)\n", + "Cbc0010I After 9583000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (865.36 seconds)\n", + "Cbc0010I After 9584000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (865.44 seconds)\n", + "Cbc0010I After 9585000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (865.50 seconds)\n", + "Cbc0010I After 9586000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (865.57 seconds)\n", + "Cbc0010I After 9587000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (865.61 seconds)\n", + "Cbc0010I After 9588000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (865.64 seconds)\n", + "Cbc0010I After 9589000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (865.70 seconds)\n", + "Cbc0010I After 9590000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (865.73 seconds)\n", + "Cbc0010I After 9591000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (865.78 seconds)\n", + "Cbc0010I After 9592000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (865.83 seconds)\n", + "Cbc0010I After 9593000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (865.86 seconds)\n", + "Cbc0010I After 9594000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (865.90 seconds)\n", + "Cbc0010I After 9595000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (865.93 seconds)\n", + "Cbc0010I After 9596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (865.96 seconds)\n", + "Cbc0010I After 9597000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (866.00 seconds)\n", + "Cbc0010I After 9598000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (866.04 seconds)\n", + "Cbc0010I After 9599000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (866.08 seconds)\n", + "Cbc0010I After 9600000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.13 seconds)\n", + "Cbc0010I After 9601000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (866.19 seconds)\n", + "Cbc0010I After 9602000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.23 seconds)\n", + "Cbc0010I After 9603000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (866.26 seconds)\n", + "Cbc0010I After 9604000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (866.31 seconds)\n", + "Cbc0010I After 9605000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.34 seconds)\n", + "Cbc0010I After 9606000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (866.38 seconds)\n", + "Cbc0010I After 9607000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (866.44 seconds)\n", + "Cbc0010I After 9608000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (866.47 seconds)\n", + "Cbc0010I After 9609000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (866.52 seconds)\n", + "Cbc0010I After 9610000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (866.57 seconds)\n", + "Cbc0010I After 9611000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.62 seconds)\n", + "Cbc0010I After 9612000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (866.67 seconds)\n", + "Cbc0010I After 9613000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.72 seconds)\n", + "Cbc0010I After 9614000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (866.79 seconds)\n", + "Cbc0010I After 9615000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.83 seconds)\n", + "Cbc0010I After 9616000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (866.86 seconds)\n", + "Cbc0010I After 9617000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (866.89 seconds)\n", + "Cbc0010I After 9618000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (866.93 seconds)\n", + "Cbc0010I After 9619000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (866.97 seconds)\n", + "Cbc0010I After 9620000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (867.00 seconds)\n", + "Cbc0010I After 9621000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (867.04 seconds)\n", + "Cbc0010I After 9622000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (867.08 seconds)\n", + "Cbc0010I After 9623000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (867.12 seconds)\n", + "Cbc0010I After 9624000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (867.16 seconds)\n", + "Cbc0010I After 9625000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (867.20 seconds)\n", + "Cbc0010I After 9626000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (867.25 seconds)\n", + "Cbc0010I After 9627000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (867.30 seconds)\n", + "Cbc0010I After 9628000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (867.34 seconds)\n", + "Cbc0010I After 9629000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (867.38 seconds)\n", + "Cbc0010I After 9630000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (867.45 seconds)\n", + "Cbc0010I After 9631000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (867.49 seconds)\n", + "Cbc0010I After 9632000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (867.55 seconds)\n", + "Cbc0010I After 9633000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (867.59 seconds)\n", + "Cbc0010I After 9634000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (867.64 seconds)\n", + "Cbc0010I After 9635000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (867.69 seconds)\n", + "Cbc0010I After 9636000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (867.74 seconds)\n", + "Cbc0010I After 9637000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (867.80 seconds)\n", + "Cbc0010I After 9638000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (867.85 seconds)\n", + "Cbc0010I After 9639000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (867.90 seconds)\n", + "Cbc0010I After 9640000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (867.95 seconds)\n", + "Cbc0010I After 9641000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (867.99 seconds)\n", + "Cbc0010I After 9642000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (868.04 seconds)\n", + "Cbc0010I After 9643000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (868.09 seconds)\n", + "Cbc0010I After 9644000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (868.14 seconds)\n", + "Cbc0010I After 9645000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (868.19 seconds)\n", + "Cbc0010I After 9646000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (868.22 seconds)\n", + "Cbc0010I After 9647000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (868.27 seconds)\n", + "Cbc0010I After 9648000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (868.31 seconds)\n", + "Cbc0010I After 9649000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (868.37 seconds)\n", + "Cbc0010I After 9650000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (868.42 seconds)\n", + "Cbc0010I After 9651000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (868.47 seconds)\n", + "Cbc0010I After 9652000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (868.53 seconds)\n", + "Cbc0010I After 9653000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (868.58 seconds)\n", + "Cbc0010I After 9654000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (868.64 seconds)\n", + "Cbc0010I After 9655000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (868.70 seconds)\n", + "Cbc0010I After 9656000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (868.76 seconds)\n", + "Cbc0010I After 9657000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (868.81 seconds)\n", + "Cbc0010I After 9658000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (868.87 seconds)\n", + "Cbc0010I After 9659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (868.92 seconds)\n", + "Cbc0010I After 9660000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (868.98 seconds)\n", + "Cbc0010I After 9661000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (869.03 seconds)\n", + "Cbc0010I After 9662000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (869.09 seconds)\n", + "Cbc0010I After 9663000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (869.15 seconds)\n", + "Cbc0010I After 9664000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (869.21 seconds)\n", + "Cbc0010I After 9665000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (869.26 seconds)\n", + "Cbc0010I After 9666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (869.32 seconds)\n", + "Cbc0010I After 9667000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (869.37 seconds)\n", + "Cbc0010I After 9668000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (869.43 seconds)\n", + "Cbc0010I After 9669000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (869.48 seconds)\n", + "Cbc0010I After 9670000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (869.55 seconds)\n", + "Cbc0010I After 9671000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (869.61 seconds)\n", + "Cbc0010I After 9672000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (869.67 seconds)\n", + "Cbc0010I After 9673000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (869.74 seconds)\n", + "Cbc0010I After 9674000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (869.79 seconds)\n", + "Cbc0010I After 9675000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (869.85 seconds)\n", + "Cbc0010I After 9676000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (869.91 seconds)\n", + "Cbc0010I After 9677000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (869.97 seconds)\n", + "Cbc0010I After 9678000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (870.02 seconds)\n", + "Cbc0010I After 9679000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (870.06 seconds)\n", + "Cbc0010I After 9680000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.12 seconds)\n", + "Cbc0010I After 9681000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (870.17 seconds)\n", + "Cbc0010I After 9682000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (870.21 seconds)\n", + "Cbc0010I After 9683000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (870.26 seconds)\n", + "Cbc0010I After 9684000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.31 seconds)\n", + "Cbc0010I After 9685000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (870.37 seconds)\n", + "Cbc0010I After 9686000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.42 seconds)\n", + "Cbc0010I After 9687000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (870.47 seconds)\n", + "Cbc0010I After 9688000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (870.52 seconds)\n", + "Cbc0010I After 9689000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (870.58 seconds)\n", + "Cbc0010I After 9690000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (870.63 seconds)\n", + "Cbc0010I After 9691000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.66 seconds)\n", + "Cbc0010I After 9692000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.71 seconds)\n", + "Cbc0010I After 9693000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.76 seconds)\n", + "Cbc0010I After 9694000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (870.81 seconds)\n", + "Cbc0010I After 9695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (870.88 seconds)\n", + "Cbc0010I After 9696000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (870.94 seconds)\n", + "Cbc0010I After 9697000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.99 seconds)\n", + "Cbc0010I After 9698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (871.04 seconds)\n", + "Cbc0010I After 9699000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (871.10 seconds)\n", + "Cbc0010I After 9700000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (871.15 seconds)\n", + "Cbc0010I After 9701000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (871.20 seconds)\n", + "Cbc0010I After 9702000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (871.26 seconds)\n", + "Cbc0010I After 9703000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (871.31 seconds)\n", + "Cbc0010I After 9704000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (871.37 seconds)\n", + "Cbc0010I After 9705000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (871.43 seconds)\n", + "Cbc0010I After 9706000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.48 seconds)\n", + "Cbc0010I After 9707000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (871.53 seconds)\n", + "Cbc0010I After 9708000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (871.58 seconds)\n", + "Cbc0010I After 9709000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.63 seconds)\n", + "Cbc0010I After 9710000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (871.69 seconds)\n", + "Cbc0010I After 9711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (871.74 seconds)\n", + "Cbc0010I After 9712000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.80 seconds)\n", + "Cbc0010I After 9713000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (871.85 seconds)\n", + "Cbc0010I After 9714000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (871.91 seconds)\n", + "Cbc0010I After 9715000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (871.97 seconds)\n", + "Cbc0010I After 9716000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (872.02 seconds)\n", + "Cbc0010I After 9717000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (872.08 seconds)\n", + "Cbc0010I After 9718000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (872.13 seconds)\n", + "Cbc0010I After 9719000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (872.18 seconds)\n", + "Cbc0010I After 9720000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (872.23 seconds)\n", + "Cbc0010I After 9721000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (872.30 seconds)\n", + "Cbc0010I After 9722000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (872.35 seconds)\n", + "Cbc0010I After 9723000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (872.41 seconds)\n", + "Cbc0010I After 9724000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (872.45 seconds)\n", + "Cbc0010I After 9725000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (872.50 seconds)\n", + "Cbc0010I After 9726000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (872.55 seconds)\n", + "Cbc0010I After 9727000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (872.60 seconds)\n", + "Cbc0010I After 9728000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (872.66 seconds)\n", + "Cbc0010I After 9729000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (872.71 seconds)\n", + "Cbc0010I After 9730000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (872.78 seconds)\n", + "Cbc0010I After 9731000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (872.84 seconds)\n", + "Cbc0010I After 9732000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (872.91 seconds)\n", + "Cbc0010I After 9733000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (872.96 seconds)\n", + "Cbc0010I After 9734000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (873.02 seconds)\n", + "Cbc0010I After 9735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (873.08 seconds)\n", + "Cbc0010I After 9736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.15 seconds)\n", + "Cbc0010I After 9737000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (873.25 seconds)\n", + "Cbc0010I After 9738000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.32 seconds)\n", + "Cbc0010I After 9739000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (873.38 seconds)\n", + "Cbc0010I After 9740000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (873.44 seconds)\n", + "Cbc0010I After 9741000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (873.50 seconds)\n", + "Cbc0010I After 9742000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.56 seconds)\n", + "Cbc0010I After 9743000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (873.62 seconds)\n", + "Cbc0010I After 9744000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (873.70 seconds)\n", + "Cbc0010I After 9745000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (873.77 seconds)\n", + "Cbc0010I After 9746000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (873.84 seconds)\n", + "Cbc0010I After 9747000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (873.92 seconds)\n", + "Cbc0010I After 9748000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (874.00 seconds)\n", + "Cbc0010I After 9749000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (874.07 seconds)\n", + "Cbc0010I After 9750000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.14 seconds)\n", + "Cbc0010I After 9751000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (874.22 seconds)\n", + "Cbc0010I After 9752000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.29 seconds)\n", + "Cbc0010I After 9753000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.36 seconds)\n", + "Cbc0010I After 9754000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.41 seconds)\n", + "Cbc0010I After 9755000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (874.47 seconds)\n", + "Cbc0010I After 9756000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (874.53 seconds)\n", + "Cbc0010I After 9757000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (874.60 seconds)\n", + "Cbc0010I After 9758000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.65 seconds)\n", + "Cbc0010I After 9759000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (874.70 seconds)\n", + "Cbc0010I After 9760000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (874.75 seconds)\n", + "Cbc0010I After 9761000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.80 seconds)\n", + "Cbc0010I After 9762000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (874.86 seconds)\n", + "Cbc0010I After 9763000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (874.93 seconds)\n", + "Cbc0010I After 9764000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.00 seconds)\n", + "Cbc0010I After 9765000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (875.08 seconds)\n", + "Cbc0010I After 9766000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (875.15 seconds)\n", + "Cbc0010I After 9767000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (875.22 seconds)\n", + "Cbc0010I After 9768000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (875.30 seconds)\n", + "Cbc0010I After 9769000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.38 seconds)\n", + "Cbc0010I After 9770000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (875.45 seconds)\n", + "Cbc0010I After 9771000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (875.52 seconds)\n", + "Cbc0010I After 9772000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (875.58 seconds)\n", + "Cbc0010I After 9773000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.63 seconds)\n", + "Cbc0010I After 9774000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.68 seconds)\n", + "Cbc0010I After 9775000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (875.72 seconds)\n", + "Cbc0010I After 9776000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.77 seconds)\n", + "Cbc0010I After 9777000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.83 seconds)\n", + "Cbc0010I After 9778000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (875.88 seconds)\n", + "Cbc0010I After 9779000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (875.93 seconds)\n", + "Cbc0010I After 9780000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (875.99 seconds)\n", + "Cbc0010I After 9781000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (876.05 seconds)\n", + "Cbc0010I After 9782000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (876.11 seconds)\n", + "Cbc0010I After 9783000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (876.17 seconds)\n", + "Cbc0010I After 9784000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (876.24 seconds)\n", + "Cbc0010I After 9785000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (876.30 seconds)\n", + "Cbc0010I After 9786000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (876.36 seconds)\n", + "Cbc0010I After 9787000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (876.43 seconds)\n", + "Cbc0010I After 9788000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (876.49 seconds)\n", + "Cbc0010I After 9789000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (876.56 seconds)\n", + "Cbc0010I After 9790000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (876.61 seconds)\n", + "Cbc0010I After 9791000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (876.67 seconds)\n", + "Cbc0010I After 9792000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (876.73 seconds)\n", + "Cbc0010I After 9793000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (876.79 seconds)\n", + "Cbc0010I After 9794000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (876.85 seconds)\n", + "Cbc0010I After 9795000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (876.91 seconds)\n", + "Cbc0010I After 9796000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (876.97 seconds)\n", + "Cbc0010I After 9797000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (877.02 seconds)\n", + "Cbc0010I After 9798000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (877.07 seconds)\n", + "Cbc0010I After 9799000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.13 seconds)\n", + "Cbc0010I After 9800000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (877.19 seconds)\n", + "Cbc0010I After 9801000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (877.26 seconds)\n", + "Cbc0010I After 9802000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.31 seconds)\n", + "Cbc0010I After 9803000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (877.37 seconds)\n", + "Cbc0010I After 9804000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (877.43 seconds)\n", + "Cbc0010I After 9805000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (877.49 seconds)\n", + "Cbc0010I After 9806000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (877.56 seconds)\n", + "Cbc0010I After 9807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (877.60 seconds)\n", + "Cbc0010I After 9808000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.67 seconds)\n", + "Cbc0010I After 9809000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (877.73 seconds)\n", + "Cbc0010I After 9810000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (877.78 seconds)\n", + "Cbc0010I After 9811000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (877.83 seconds)\n", + "Cbc0010I After 9812000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (877.86 seconds)\n", + "Cbc0010I After 9813000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (877.90 seconds)\n", + "Cbc0010I After 9814000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (877.94 seconds)\n", + "Cbc0010I After 9815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (878.02 seconds)\n", + "Cbc0010I After 9816000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (878.08 seconds)\n", + "Cbc0010I After 9817000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (878.15 seconds)\n", + "Cbc0010I After 9818000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (878.21 seconds)\n", + "Cbc0010I After 9819000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (878.28 seconds)\n", + "Cbc0010I After 9820000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (878.33 seconds)\n", + "Cbc0010I After 9821000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (878.39 seconds)\n", + "Cbc0010I After 9822000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (878.45 seconds)\n", + "Cbc0010I After 9823000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (878.52 seconds)\n", + "Cbc0010I After 9824000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (878.58 seconds)\n", + "Cbc0010I After 9825000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (878.63 seconds)\n", + "Cbc0010I After 9826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (878.70 seconds)\n", + "Cbc0010I After 9827000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (878.75 seconds)\n", + "Cbc0010I After 9828000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (878.82 seconds)\n", + "Cbc0010I After 9829000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (878.88 seconds)\n", + "Cbc0010I After 9830000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (878.93 seconds)\n", + "Cbc0010I After 9831000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (879.00 seconds)\n", + "Cbc0010I After 9832000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (879.05 seconds)\n", + "Cbc0010I After 9833000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (879.10 seconds)\n", + "Cbc0010I After 9834000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (879.15 seconds)\n", + "Cbc0010I After 9835000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (879.21 seconds)\n", + "Cbc0010I After 9836000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (879.25 seconds)\n", + "Cbc0010I After 9837000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (879.31 seconds)\n", + "Cbc0010I After 9838000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (879.36 seconds)\n", + "Cbc0010I After 9839000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (879.40 seconds)\n", + "Cbc0010I After 9840000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (879.46 seconds)\n", + "Cbc0010I After 9841000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (879.51 seconds)\n", + "Cbc0010I After 9842000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (879.55 seconds)\n", + "Cbc0010I After 9843000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (879.60 seconds)\n", + "Cbc0010I After 9844000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (879.66 seconds)\n", + "Cbc0010I After 9845000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (879.70 seconds)\n", + "Cbc0010I After 9846000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (879.76 seconds)\n", + "Cbc0010I After 9847000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (879.82 seconds)\n", + "Cbc0010I After 9848000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (879.87 seconds)\n", + "Cbc0010I After 9849000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (879.92 seconds)\n", + "Cbc0010I After 9850000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (879.98 seconds)\n", + "Cbc0010I After 9851000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (880.05 seconds)\n", + "Cbc0010I After 9852000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (880.11 seconds)\n", + "Cbc0010I After 9853000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (880.17 seconds)\n", + "Cbc0010I After 9854000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (880.23 seconds)\n", + "Cbc0010I After 9855000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (880.29 seconds)\n", + "Cbc0010I After 9856000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (880.35 seconds)\n", + "Cbc0010I After 9857000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (880.41 seconds)\n", + "Cbc0010I After 9858000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (880.47 seconds)\n", + "Cbc0010I After 9859000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (880.53 seconds)\n", + "Cbc0010I After 9860000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (880.59 seconds)\n", + "Cbc0010I After 9861000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (880.66 seconds)\n", + "Cbc0010I After 9862000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (880.72 seconds)\n", + "Cbc0010I After 9863000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (880.77 seconds)\n", + "Cbc0010I After 9864000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (880.84 seconds)\n", + "Cbc0010I After 9865000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (880.89 seconds)\n", + "Cbc0010I After 9866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (880.96 seconds)\n", + "Cbc0010I After 9867000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (881.04 seconds)\n", + "Cbc0010I After 9868000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (881.10 seconds)\n", + "Cbc0010I After 9869000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (881.16 seconds)\n", + "Cbc0010I After 9870000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (881.21 seconds)\n", + "Cbc0010I After 9871000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (881.26 seconds)\n", + "Cbc0010I After 9872000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (881.33 seconds)\n", + "Cbc0010I After 9873000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (881.40 seconds)\n", + "Cbc0010I After 9874000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (881.45 seconds)\n", + "Cbc0010I After 9875000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (881.52 seconds)\n", + "Cbc0010I After 9876000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (881.59 seconds)\n", + "Cbc0010I After 9877000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (881.67 seconds)\n", + "Cbc0010I After 9878000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (881.74 seconds)\n", + "Cbc0010I After 9879000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (881.82 seconds)\n", + "Cbc0010I After 9880000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (881.88 seconds)\n", + "Cbc0010I After 9881000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (881.96 seconds)\n", + "Cbc0010I After 9882000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (882.02 seconds)\n", + "Cbc0010I After 9883000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (882.09 seconds)\n", + "Cbc0010I After 9884000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.16 seconds)\n", + "Cbc0010I After 9885000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (882.24 seconds)\n", + "Cbc0010I After 9886000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.30 seconds)\n", + "Cbc0010I After 9887000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (882.37 seconds)\n", + "Cbc0010I After 9888000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (882.44 seconds)\n", + "Cbc0010I After 9889000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (882.51 seconds)\n", + "Cbc0010I After 9890000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (882.58 seconds)\n", + "Cbc0010I After 9891000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (882.66 seconds)\n", + "Cbc0010I After 9892000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (882.72 seconds)\n", + "Cbc0010I After 9893000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (882.78 seconds)\n", + "Cbc0010I After 9894000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.86 seconds)\n", + "Cbc0010I After 9895000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (882.93 seconds)\n", + "Cbc0010I After 9896000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (882.98 seconds)\n", + "Cbc0010I After 9897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (883.04 seconds)\n", + "Cbc0010I After 9898000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (883.09 seconds)\n", + "Cbc0010I After 9899000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (883.15 seconds)\n", + "Cbc0010I After 9900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (883.21 seconds)\n", + "Cbc0010I After 9901000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (883.27 seconds)\n", + "Cbc0010I After 9902000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (883.33 seconds)\n", + "Cbc0010I After 9903000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (883.40 seconds)\n", + "Cbc0010I After 9904000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (883.45 seconds)\n", + "Cbc0010I After 9905000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (883.51 seconds)\n", + "Cbc0010I After 9906000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (883.57 seconds)\n", + "Cbc0010I After 9907000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (883.63 seconds)\n", + "Cbc0010I After 9908000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (883.69 seconds)\n", + "Cbc0010I After 9909000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (883.76 seconds)\n", + "Cbc0010I After 9910000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (883.84 seconds)\n", + "Cbc0010I After 9911000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (883.92 seconds)\n", + "Cbc0010I After 9912000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (884.00 seconds)\n", + "Cbc0010I After 9913000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (884.08 seconds)\n", + "Cbc0010I After 9914000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (884.15 seconds)\n", + "Cbc0010I After 9915000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (884.22 seconds)\n", + "Cbc0010I After 9916000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (884.30 seconds)\n", + "Cbc0010I After 9917000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (884.37 seconds)\n", + "Cbc0010I After 9918000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (884.45 seconds)\n", + "Cbc0010I After 9919000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (884.52 seconds)\n", + "Cbc0010I After 9920000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (884.58 seconds)\n", + "Cbc0010I After 9921000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (884.65 seconds)\n", + "Cbc0010I After 9922000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (884.72 seconds)\n", + "Cbc0010I After 9923000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (884.80 seconds)\n", + "Cbc0010I After 9924000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (884.86 seconds)\n", + "Cbc0010I After 9925000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (884.93 seconds)\n", + "Cbc0010I After 9926000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (884.99 seconds)\n", + "Cbc0010I After 9927000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (885.06 seconds)\n", + "Cbc0010I After 9928000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (885.12 seconds)\n", + "Cbc0010I After 9929000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (885.19 seconds)\n", + "Cbc0010I After 9930000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (885.25 seconds)\n", + "Cbc0010I After 9931000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (885.30 seconds)\n", + "Cbc0010I After 9932000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (885.36 seconds)\n", + "Cbc0010I After 9933000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (885.42 seconds)\n", + "Cbc0010I After 9934000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (885.47 seconds)\n", + "Cbc0010I After 9935000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (885.53 seconds)\n", + "Cbc0010I After 9936000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (885.60 seconds)\n", + "Cbc0010I After 9937000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (885.65 seconds)\n", + "Cbc0010I After 9938000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (885.72 seconds)\n", + "Cbc0010I After 9939000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (885.79 seconds)\n", + "Cbc0010I After 9940000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (885.84 seconds)\n", + "Cbc0010I After 9941000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (885.92 seconds)\n", + "Cbc0010I After 9942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (885.97 seconds)\n", + "Cbc0010I After 9943000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (886.05 seconds)\n", + "Cbc0010I After 9944000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (886.12 seconds)\n", + "Cbc0010I After 9945000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (886.19 seconds)\n", + "Cbc0010I After 9946000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (886.25 seconds)\n", + "Cbc0010I After 9947000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (886.33 seconds)\n", + "Cbc0010I After 9948000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (886.40 seconds)\n", + "Cbc0010I After 9949000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (886.48 seconds)\n", + "Cbc0010I After 9950000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (886.58 seconds)\n", + "Cbc0010I After 9951000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (886.67 seconds)\n", + "Cbc0010I After 9952000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (886.76 seconds)\n", + "Cbc0010I After 9953000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (886.84 seconds)\n", + "Cbc0010I After 9954000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (886.91 seconds)\n", + "Cbc0010I After 9955000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (886.98 seconds)\n", + "Cbc0010I After 9956000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (887.05 seconds)\n", + "Cbc0010I After 9957000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (887.13 seconds)\n", + "Cbc0010I After 9958000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (887.21 seconds)\n", + "Cbc0010I After 9959000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (887.28 seconds)\n", + "Cbc0010I After 9960000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (887.36 seconds)\n", + "Cbc0010I After 9961000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (887.43 seconds)\n", + "Cbc0010I After 9962000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (887.49 seconds)\n", + "Cbc0010I After 9963000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (887.55 seconds)\n", + "Cbc0010I After 9964000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (887.60 seconds)\n", + "Cbc0010I After 9965000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (887.66 seconds)\n", + "Cbc0010I After 9966000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (887.72 seconds)\n", + "Cbc0010I After 9967000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (887.79 seconds)\n", + "Cbc0010I After 9968000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (887.85 seconds)\n", + "Cbc0010I After 9969000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (887.91 seconds)\n", + "Cbc0010I After 9970000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (887.97 seconds)\n", + "Cbc0010I After 9971000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (888.02 seconds)\n", + "Cbc0010I After 9972000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (888.06 seconds)\n", + "Cbc0010I After 9973000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (888.11 seconds)\n", + "Cbc0010I After 9974000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (888.16 seconds)\n", + "Cbc0010I After 9975000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (888.22 seconds)\n", + "Cbc0010I After 9976000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (888.29 seconds)\n", + "Cbc0010I After 9977000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (888.34 seconds)\n", + "Cbc0010I After 9978000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (888.40 seconds)\n", + "Cbc0010I After 9979000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (888.48 seconds)\n", + "Cbc0010I After 9980000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (888.56 seconds)\n", + "Cbc0010I After 9981000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (888.63 seconds)\n", + "Cbc0010I After 9982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (888.71 seconds)\n", + "Cbc0010I After 9983000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (888.77 seconds)\n", + "Cbc0010I After 9984000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (888.84 seconds)\n", + "Cbc0010I After 9985000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (888.92 seconds)\n", + "Cbc0010I After 9986000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (889.00 seconds)\n", + "Cbc0010I After 9987000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.07 seconds)\n", + "Cbc0010I After 9988000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (889.15 seconds)\n", + "Cbc0010I After 9989000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.23 seconds)\n", + "Cbc0010I After 9990000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (889.31 seconds)\n", + "Cbc0010I After 9991000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.39 seconds)\n", + "Cbc0010I After 9992000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (889.46 seconds)\n", + "Cbc0010I After 9993000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (889.53 seconds)\n", + "Cbc0010I After 9994000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (889.60 seconds)\n", + "Cbc0010I After 9995000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (889.65 seconds)\n", + "Cbc0010I After 9996000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (889.71 seconds)\n", + "Cbc0010I After 9997000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (889.77 seconds)\n", + "Cbc0010I After 9998000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (889.82 seconds)\n", + "Cbc0010I After 9999000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (889.88 seconds)\n", + "Cbc0010I After 10000000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (889.92 seconds)\n", + "Cbc0010I After 10001000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (889.97 seconds)\n", + "Cbc0010I After 10002000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (890.01 seconds)\n", + "Cbc0010I After 10003000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (890.06 seconds)\n", + "Cbc0010I After 10004000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (890.11 seconds)\n", + "Cbc0010I After 10005000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (890.17 seconds)\n", + "Cbc0010I After 10006000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (890.22 seconds)\n", + "Cbc0010I After 10007000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (890.29 seconds)\n", + "Cbc0010I After 10008000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (890.35 seconds)\n", + "Cbc0010I After 10009000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (890.41 seconds)\n", + "Cbc0010I After 10010000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (890.48 seconds)\n", + "Cbc0010I After 10011000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (890.54 seconds)\n", + "Cbc0010I After 10012000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (890.60 seconds)\n", + "Cbc0010I After 10013000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (890.65 seconds)\n", + "Cbc0010I After 10014000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (890.71 seconds)\n", + "Cbc0010I After 10015000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (890.77 seconds)\n", + "Cbc0010I After 10016000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (890.83 seconds)\n", + "Cbc0010I After 10017000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (890.89 seconds)\n", + "Cbc0010I After 10018000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (890.94 seconds)\n", + "Cbc0010I After 10019000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (890.99 seconds)\n", + "Cbc0010I After 10020000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (891.03 seconds)\n", + "Cbc0010I After 10021000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (891.09 seconds)\n", + "Cbc0010I After 10022000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (891.14 seconds)\n", + "Cbc0010I After 10023000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (891.18 seconds)\n", + "Cbc0010I After 10024000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (891.23 seconds)\n", + "Cbc0010I After 10025000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (891.31 seconds)\n", + "Cbc0010I After 10026000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (891.36 seconds)\n", + "Cbc0010I After 10027000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (891.40 seconds)\n", + "Cbc0010I After 10028000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (891.45 seconds)\n", + "Cbc0010I After 10029000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (891.48 seconds)\n", + "Cbc0010I After 10030000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (891.51 seconds)\n", + "Cbc0010I After 10031000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (891.54 seconds)\n", + "Cbc0010I After 10032000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (891.60 seconds)\n", + "Cbc0010I After 10033000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (891.68 seconds)\n", + "Cbc0010I After 10034000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (891.72 seconds)\n", + "Cbc0010I After 10035000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (891.76 seconds)\n", + "Cbc0010I After 10036000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (891.82 seconds)\n", + "Cbc0010I After 10037000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (891.88 seconds)\n", + "Cbc0010I After 10038000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (891.93 seconds)\n", + "Cbc0010I After 10039000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (891.97 seconds)\n", + "Cbc0010I After 10040000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (892.01 seconds)\n", + "Cbc0010I After 10041000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (892.06 seconds)\n", + "Cbc0010I After 10042000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (892.11 seconds)\n", + "Cbc0010I After 10043000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (892.18 seconds)\n", + "Cbc0010I After 10044000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (892.26 seconds)\n", + "Cbc0010I After 10045000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (892.34 seconds)\n", + "Cbc0010I After 10046000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (892.41 seconds)\n", + "Cbc0010I After 10047000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (892.45 seconds)\n", + "Cbc0010I After 10048000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (892.49 seconds)\n", + "Cbc0010I After 10049000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (892.52 seconds)\n", + "Cbc0010I After 10050000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (892.56 seconds)\n", + "Cbc0010I After 10051000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (892.59 seconds)\n", + "Cbc0010I After 10052000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (892.63 seconds)\n", + "Cbc0010I After 10053000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (892.66 seconds)\n", + "Cbc0010I After 10054000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (892.70 seconds)\n", + "Cbc0010I After 10055000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (892.73 seconds)\n", + "Cbc0010I After 10056000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (892.77 seconds)\n", + "Cbc0010I After 10057000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (892.81 seconds)\n", + "Cbc0010I After 10058000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (892.86 seconds)\n", + "Cbc0010I After 10059000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (892.93 seconds)\n", + "Cbc0010I After 10060000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (892.98 seconds)\n", + "Cbc0010I After 10061000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (893.05 seconds)\n", + "Cbc0010I After 10062000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (893.11 seconds)\n", + "Cbc0010I After 10063000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (893.14 seconds)\n", + "Cbc0010I After 10064000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (893.18 seconds)\n", + "Cbc0010I After 10065000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (893.22 seconds)\n", + "Cbc0010I After 10066000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (893.25 seconds)\n", + "Cbc0010I After 10067000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (893.30 seconds)\n", + "Cbc0010I After 10068000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (893.34 seconds)\n", + "Cbc0010I After 10069000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (893.37 seconds)\n", + "Cbc0010I After 10070000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (893.41 seconds)\n", + "Cbc0010I After 10071000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.46 seconds)\n", + "Cbc0010I After 10072000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (893.52 seconds)\n", + "Cbc0010I After 10073000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (893.56 seconds)\n", + "Cbc0010I After 10074000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (893.61 seconds)\n", + "Cbc0010I After 10075000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (893.66 seconds)\n", + "Cbc0010I After 10076000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (893.72 seconds)\n", + "Cbc0010I After 10077000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (893.75 seconds)\n", + "Cbc0010I After 10078000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.80 seconds)\n", + "Cbc0010I After 10079000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.87 seconds)\n", + "Cbc0010I After 10080000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (893.93 seconds)\n", + "Cbc0010I After 10081000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (893.97 seconds)\n", + "Cbc0010I After 10082000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (894.01 seconds)\n", + "Cbc0010I After 10083000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (894.06 seconds)\n", + "Cbc0010I After 10084000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (894.09 seconds)\n", + "Cbc0010I After 10085000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (894.14 seconds)\n", + "Cbc0010I After 10086000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (894.20 seconds)\n", + "Cbc0010I After 10087000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (894.28 seconds)\n", + "Cbc0010I After 10088000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (894.35 seconds)\n", + "Cbc0010I After 10089000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (894.42 seconds)\n", + "Cbc0010I After 10090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (894.49 seconds)\n", + "Cbc0010I After 10091000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (894.55 seconds)\n", + "Cbc0010I After 10092000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (894.62 seconds)\n", + "Cbc0010I After 10093000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (894.68 seconds)\n", + "Cbc0010I After 10094000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (894.72 seconds)\n", + "Cbc0010I After 10095000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (894.75 seconds)\n", + "Cbc0010I After 10096000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (894.80 seconds)\n", + "Cbc0010I After 10097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (894.86 seconds)\n", + "Cbc0010I After 10098000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (894.90 seconds)\n", + "Cbc0010I After 10099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (894.97 seconds)\n", + "Cbc0010I After 10100000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (895.03 seconds)\n", + "Cbc0010I After 10101000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (895.07 seconds)\n", + "Cbc0010I After 10102000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (895.11 seconds)\n", + "Cbc0010I After 10103000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (895.14 seconds)\n", + "Cbc0010I After 10104000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (895.19 seconds)\n", + "Cbc0010I After 10105000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (895.22 seconds)\n", + "Cbc0010I After 10106000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (895.26 seconds)\n", + "Cbc0010I After 10107000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (895.32 seconds)\n", + "Cbc0010I After 10108000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (895.38 seconds)\n", + "Cbc0010I After 10109000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (895.44 seconds)\n", + "Cbc0010I After 10110000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (895.50 seconds)\n", + "Cbc0010I After 10111000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (895.56 seconds)\n", + "Cbc0010I After 10112000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (895.61 seconds)\n", + "Cbc0010I After 10113000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (895.66 seconds)\n", + "Cbc0010I After 10114000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (895.73 seconds)\n", + "Cbc0010I After 10115000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (895.77 seconds)\n", + "Cbc0010I After 10116000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (895.81 seconds)\n", + "Cbc0010I After 10117000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (895.84 seconds)\n", + "Cbc0010I After 10118000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (895.87 seconds)\n", + "Cbc0010I After 10119000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (895.90 seconds)\n", + "Cbc0010I After 10120000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (895.93 seconds)\n", + "Cbc0010I After 10121000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (895.99 seconds)\n", + "Cbc0010I After 10122000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.05 seconds)\n", + "Cbc0010I After 10123000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (896.10 seconds)\n", + "Cbc0010I After 10124000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (896.17 seconds)\n", + "Cbc0010I After 10125000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (896.24 seconds)\n", + "Cbc0010I After 10126000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (896.28 seconds)\n", + "Cbc0010I After 10127000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (896.32 seconds)\n", + "Cbc0010I After 10128000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.36 seconds)\n", + "Cbc0010I After 10129000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (896.40 seconds)\n", + "Cbc0010I After 10130000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (896.43 seconds)\n", + "Cbc0010I After 10131000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (896.49 seconds)\n", + "Cbc0010I After 10132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (896.52 seconds)\n", + "Cbc0010I After 10133000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (896.56 seconds)\n", + "Cbc0010I After 10134000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (896.60 seconds)\n", + "Cbc0010I After 10135000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.64 seconds)\n", + "Cbc0010I After 10136000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (896.69 seconds)\n", + "Cbc0010I After 10137000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (896.77 seconds)\n", + "Cbc0010I After 10138000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (896.84 seconds)\n", + "Cbc0010I After 10139000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (896.92 seconds)\n", + "Cbc0010I After 10140000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (897.00 seconds)\n", + "Cbc0010I After 10141000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (897.07 seconds)\n", + "Cbc0010I After 10142000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (897.15 seconds)\n", + "Cbc0010I After 10143000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (897.21 seconds)\n", + "Cbc0010I After 10144000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (897.28 seconds)\n", + "Cbc0010I After 10145000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (897.35 seconds)\n", + "Cbc0010I After 10146000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (897.43 seconds)\n", + "Cbc0010I After 10147000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (897.49 seconds)\n", + "Cbc0010I After 10148000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (897.58 seconds)\n", + "Cbc0010I After 10149000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (897.66 seconds)\n", + "Cbc0010I After 10150000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (897.75 seconds)\n", + "Cbc0010I After 10151000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (897.83 seconds)\n", + "Cbc0010I After 10152000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (897.89 seconds)\n", + "Cbc0010I After 10153000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (897.95 seconds)\n", + "Cbc0010I After 10154000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (898.02 seconds)\n", + "Cbc0010I After 10155000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (898.07 seconds)\n", + "Cbc0010I After 10156000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (898.12 seconds)\n", + "Cbc0010I After 10157000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (898.17 seconds)\n", + "Cbc0010I After 10158000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (898.21 seconds)\n", + "Cbc0010I After 10159000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (898.25 seconds)\n", + "Cbc0010I After 10160000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (898.30 seconds)\n", + "Cbc0010I After 10161000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (898.37 seconds)\n", + "Cbc0010I After 10162000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (898.41 seconds)\n", + "Cbc0010I After 10163000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (898.44 seconds)\n", + "Cbc0010I After 10164000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (898.49 seconds)\n", + "Cbc0010I After 10165000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (898.55 seconds)\n", + "Cbc0010I After 10166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (898.60 seconds)\n", + "Cbc0010I After 10167000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (898.64 seconds)\n", + "Cbc0010I After 10168000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (898.68 seconds)\n", + "Cbc0010I After 10169000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (898.71 seconds)\n", + "Cbc0010I After 10170000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (898.75 seconds)\n", + "Cbc0010I After 10171000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (898.79 seconds)\n", + "Cbc0010I After 10172000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (898.82 seconds)\n", + "Cbc0010I After 10173000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (898.85 seconds)\n", + "Cbc0010I After 10174000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (898.89 seconds)\n", + "Cbc0010I After 10175000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (898.94 seconds)\n", + "Cbc0010I After 10176000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (898.98 seconds)\n", + "Cbc0010I After 10177000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (899.01 seconds)\n", + "Cbc0010I After 10178000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (899.04 seconds)\n", + "Cbc0010I After 10179000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (899.09 seconds)\n", + "Cbc0010I After 10180000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (899.14 seconds)\n", + "Cbc0010I After 10181000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (899.17 seconds)\n", + "Cbc0010I After 10182000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (899.23 seconds)\n", + "Cbc0010I After 10183000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (899.27 seconds)\n", + "Cbc0010I After 10184000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (899.30 seconds)\n", + "Cbc0010I After 10185000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (899.36 seconds)\n", + "Cbc0010I After 10186000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (899.40 seconds)\n", + "Cbc0010I After 10187000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (899.46 seconds)\n", + "Cbc0010I After 10188000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (899.51 seconds)\n", + "Cbc0010I After 10189000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (899.55 seconds)\n", + "Cbc0010I After 10190000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (899.60 seconds)\n", + "Cbc0010I After 10191000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (899.67 seconds)\n", + "Cbc0010I After 10192000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (899.75 seconds)\n", + "Cbc0010I After 10193000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (899.83 seconds)\n", + "Cbc0010I After 10194000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (899.91 seconds)\n", + "Cbc0010I After 10195000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (899.97 seconds)\n", + "Cbc0010I After 10196000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.01 seconds)\n", + "Cbc0010I After 10197000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.05 seconds)\n", + "Cbc0010I After 10198000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (900.08 seconds)\n", + "Cbc0010I After 10199000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (900.12 seconds)\n", + "Cbc0010I After 10200000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (900.15 seconds)\n", + "Cbc0010I After 10201000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (900.19 seconds)\n", + "Cbc0010I After 10202000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (900.23 seconds)\n", + "Cbc0010I After 10203000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.31 seconds)\n", + "Cbc0010I After 10204000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (900.40 seconds)\n", + "Cbc0010I After 10205000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (900.47 seconds)\n", + "Cbc0010I After 10206000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (900.51 seconds)\n", + "Cbc0010I After 10207000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.56 seconds)\n", + "Cbc0010I After 10208000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.59 seconds)\n", + "Cbc0010I After 10209000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.66 seconds)\n", + "Cbc0010I After 10210000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (900.73 seconds)\n", + "Cbc0010I After 10211000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (900.76 seconds)\n", + "Cbc0010I After 10212000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (900.80 seconds)\n", + "Cbc0010I After 10213000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.85 seconds)\n", + "Cbc0010I After 10214000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (900.88 seconds)\n", + "Cbc0010I After 10215000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.91 seconds)\n", + "Cbc0010I After 10216000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (900.94 seconds)\n", + "Cbc0010I After 10217000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.97 seconds)\n", + "Cbc0010I After 10218000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (901.02 seconds)\n", + "Cbc0010I After 10219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (901.07 seconds)\n", + "Cbc0010I After 10220000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (901.12 seconds)\n", + "Cbc0010I After 10221000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (901.16 seconds)\n", + "Cbc0010I After 10222000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (901.21 seconds)\n", + "Cbc0010I After 10223000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (901.25 seconds)\n", + "Cbc0010I After 10224000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (901.30 seconds)\n", + "Cbc0010I After 10225000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (901.35 seconds)\n", + "Cbc0010I After 10226000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (901.42 seconds)\n", + "Cbc0010I After 10227000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (901.50 seconds)\n", + "Cbc0010I After 10228000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (901.57 seconds)\n", + "Cbc0010I After 10229000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (901.64 seconds)\n", + "Cbc0010I After 10230000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (901.67 seconds)\n", + "Cbc0010I After 10231000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (901.74 seconds)\n", + "Cbc0010I After 10232000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (901.77 seconds)\n", + "Cbc0010I After 10233000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (901.80 seconds)\n", + "Cbc0010I After 10234000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (901.83 seconds)\n", + "Cbc0010I After 10235000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (901.86 seconds)\n", + "Cbc0010I After 10236000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (901.90 seconds)\n", + "Cbc0010I After 10237000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (901.94 seconds)\n", + "Cbc0010I After 10238000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (901.97 seconds)\n", + "Cbc0010I After 10239000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.01 seconds)\n", + "Cbc0010I After 10240000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.06 seconds)\n", + "Cbc0010I After 10241000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (902.10 seconds)\n", + "Cbc0010I After 10242000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (902.13 seconds)\n", + "Cbc0010I After 10243000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (902.18 seconds)\n", + "Cbc0010I After 10244000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (902.23 seconds)\n", + "Cbc0010I After 10245000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.27 seconds)\n", + "Cbc0010I After 10246000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (902.33 seconds)\n", + "Cbc0010I After 10247000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.37 seconds)\n", + "Cbc0010I After 10248000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (902.40 seconds)\n", + "Cbc0010I After 10249000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.46 seconds)\n", + "Cbc0010I After 10250000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.49 seconds)\n", + "Cbc0010I After 10251000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.53 seconds)\n", + "Cbc0010I After 10252000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (902.57 seconds)\n", + "Cbc0010I After 10253000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (902.63 seconds)\n", + "Cbc0010I After 10254000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (902.67 seconds)\n", + "Cbc0010I After 10255000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (902.70 seconds)\n", + "Cbc0010I After 10256000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (902.75 seconds)\n", + "Cbc0010I After 10257000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (902.79 seconds)\n", + "Cbc0010I After 10258000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (902.82 seconds)\n", + "Cbc0010I After 10259000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.86 seconds)\n", + "Cbc0010I After 10260000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.89 seconds)\n", + "Cbc0010I After 10261000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (902.93 seconds)\n", + "Cbc0010I After 10262000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (902.97 seconds)\n", + "Cbc0010I After 10263000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (903.04 seconds)\n", + "Cbc0010I After 10264000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (903.07 seconds)\n", + "Cbc0010I After 10265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (903.10 seconds)\n", + "Cbc0010I After 10266000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (903.16 seconds)\n", + "Cbc0010I After 10267000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (903.20 seconds)\n", + "Cbc0010I After 10268000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (903.24 seconds)\n", + "Cbc0010I After 10269000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (903.29 seconds)\n", + "Cbc0010I After 10270000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (903.33 seconds)\n", + "Cbc0010I After 10271000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.36 seconds)\n", + "Cbc0010I After 10272000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (903.42 seconds)\n", + "Cbc0010I After 10273000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.47 seconds)\n", + "Cbc0010I After 10274000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (903.52 seconds)\n", + "Cbc0010I After 10275000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.57 seconds)\n", + "Cbc0010I After 10276000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (903.61 seconds)\n", + "Cbc0010I After 10277000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (903.67 seconds)\n", + "Cbc0010I After 10278000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (903.72 seconds)\n", + "Cbc0010I After 10279000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (903.77 seconds)\n", + "Cbc0010I After 10280000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (903.81 seconds)\n", + "Cbc0010I After 10281000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (903.86 seconds)\n", + "Cbc0010I After 10282000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (903.91 seconds)\n", + "Cbc0010I After 10283000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.96 seconds)\n", + "Cbc0010I After 10284000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (904.02 seconds)\n", + "Cbc0010I After 10285000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (904.06 seconds)\n", + "Cbc0010I After 10286000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (904.12 seconds)\n", + "Cbc0010I After 10287000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (904.17 seconds)\n", + "Cbc0010I After 10288000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (904.23 seconds)\n", + "Cbc0010I After 10289000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (904.29 seconds)\n", + "Cbc0010I After 10290000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (904.35 seconds)\n", + "Cbc0010I After 10291000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (904.40 seconds)\n", + "Cbc0010I After 10292000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (904.46 seconds)\n", + "Cbc0010I After 10293000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (904.50 seconds)\n", + "Cbc0010I After 10294000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (904.55 seconds)\n", + "Cbc0010I After 10295000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (904.61 seconds)\n", + "Cbc0010I After 10296000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (904.67 seconds)\n", + "Cbc0010I After 10297000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (904.73 seconds)\n", + "Cbc0010I After 10298000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (904.79 seconds)\n", + "Cbc0010I After 10299000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (904.84 seconds)\n", + "Cbc0010I After 10300000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (904.90 seconds)\n", + "Cbc0010I After 10301000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (904.95 seconds)\n", + "Cbc0010I After 10302000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.01 seconds)\n", + "Cbc0010I After 10303000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (905.08 seconds)\n", + "Cbc0010I After 10304000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.13 seconds)\n", + "Cbc0010I After 10305000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (905.20 seconds)\n", + "Cbc0010I After 10306000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (905.26 seconds)\n", + "Cbc0010I After 10307000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (905.31 seconds)\n", + "Cbc0010I After 10308000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (905.37 seconds)\n", + "Cbc0010I After 10309000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.42 seconds)\n", + "Cbc0010I After 10310000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (905.48 seconds)\n", + "Cbc0010I After 10311000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.53 seconds)\n", + "Cbc0010I After 10312000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.58 seconds)\n", + "Cbc0010I After 10313000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (905.63 seconds)\n", + "Cbc0010I After 10314000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (905.68 seconds)\n", + "Cbc0010I After 10315000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.72 seconds)\n", + "Cbc0010I After 10316000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (905.78 seconds)\n", + "Cbc0010I After 10317000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (905.83 seconds)\n", + "Cbc0010I After 10318000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (905.89 seconds)\n", + "Cbc0010I After 10319000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (905.94 seconds)\n", + "Cbc0010I After 10320000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (905.99 seconds)\n", + "Cbc0010I After 10321000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (906.05 seconds)\n", + "Cbc0010I After 10322000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.10 seconds)\n", + "Cbc0010I After 10323000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (906.15 seconds)\n", + "Cbc0010I After 10324000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (906.23 seconds)\n", + "Cbc0010I After 10325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (906.30 seconds)\n", + "Cbc0010I After 10326000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (906.36 seconds)\n", + "Cbc0010I After 10327000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.42 seconds)\n", + "Cbc0010I After 10328000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (906.47 seconds)\n", + "Cbc0010I After 10329000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (906.53 seconds)\n", + "Cbc0010I After 10330000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (906.59 seconds)\n", + "Cbc0010I After 10331000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.67 seconds)\n", + "Cbc0010I After 10332000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (906.74 seconds)\n", + "Cbc0010I After 10333000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (906.79 seconds)\n", + "Cbc0010I After 10334000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (906.84 seconds)\n", + "Cbc0010I After 10335000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (906.89 seconds)\n", + "Cbc0010I After 10336000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (906.95 seconds)\n", + "Cbc0010I After 10337000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (907.00 seconds)\n", + "Cbc0010I After 10338000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (907.04 seconds)\n", + "Cbc0010I After 10339000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (907.09 seconds)\n", + "Cbc0010I After 10340000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (907.14 seconds)\n", + "Cbc0010I After 10341000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (907.18 seconds)\n", + "Cbc0010I After 10342000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (907.23 seconds)\n", + "Cbc0010I After 10343000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (907.29 seconds)\n", + "Cbc0010I After 10344000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (907.34 seconds)\n", + "Cbc0010I After 10345000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (907.40 seconds)\n", + "Cbc0010I After 10346000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (907.45 seconds)\n", + "Cbc0010I After 10347000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (907.50 seconds)\n", + "Cbc0010I After 10348000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (907.55 seconds)\n", + "Cbc0010I After 10349000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (907.59 seconds)\n", + "Cbc0010I After 10350000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (907.65 seconds)\n", + "Cbc0010I After 10351000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (907.70 seconds)\n", + "Cbc0010I After 10352000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (907.75 seconds)\n", + "Cbc0010I After 10353000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (907.80 seconds)\n", + "Cbc0010I After 10354000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (907.85 seconds)\n", + "Cbc0010I After 10355000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (907.90 seconds)\n", + "Cbc0010I After 10356000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (907.96 seconds)\n", + "Cbc0010I After 10357000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (908.01 seconds)\n", + "Cbc0010I After 10358000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (908.07 seconds)\n", + "Cbc0010I After 10359000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.12 seconds)\n", + "Cbc0010I After 10360000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.17 seconds)\n", + "Cbc0010I After 10361000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (908.23 seconds)\n", + "Cbc0010I After 10362000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (908.28 seconds)\n", + "Cbc0010I After 10363000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.33 seconds)\n", + "Cbc0010I After 10364000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (908.38 seconds)\n", + "Cbc0010I After 10365000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (908.44 seconds)\n", + "Cbc0010I After 10366000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (908.50 seconds)\n", + "Cbc0010I After 10367000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.59 seconds)\n", + "Cbc0010I After 10368000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.73 seconds)\n", + "Cbc0010I After 10369000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (908.80 seconds)\n", + "Cbc0010I After 10370000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (908.85 seconds)\n", + "Cbc0010I After 10371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.91 seconds)\n", + "Cbc0010I After 10372000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (908.97 seconds)\n", + "Cbc0010I After 10373000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (909.01 seconds)\n", + "Cbc0010I After 10374000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.06 seconds)\n", + "Cbc0010I After 10375000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (909.12 seconds)\n", + "Cbc0010I After 10376000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (909.17 seconds)\n", + "Cbc0010I After 10377000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (909.23 seconds)\n", + "Cbc0010I After 10378000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.30 seconds)\n", + "Cbc0010I After 10379000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.37 seconds)\n", + "Cbc0010I After 10380000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (909.45 seconds)\n", + "Cbc0010I After 10381000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.50 seconds)\n", + "Cbc0010I After 10382000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (909.56 seconds)\n", + "Cbc0010I After 10383000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (909.62 seconds)\n", + "Cbc0010I After 10384000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (909.67 seconds)\n", + "Cbc0010I After 10385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (909.73 seconds)\n", + "Cbc0010I After 10386000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (909.78 seconds)\n", + "Cbc0010I After 10387000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (909.83 seconds)\n", + "Cbc0010I After 10388000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (909.88 seconds)\n", + "Cbc0010I After 10389000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (909.95 seconds)\n", + "Cbc0010I After 10390000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (910.02 seconds)\n", + "Cbc0010I After 10391000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (910.09 seconds)\n", + "Cbc0010I After 10392000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (910.16 seconds)\n", + "Cbc0010I After 10393000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (910.23 seconds)\n", + "Cbc0010I After 10394000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (910.27 seconds)\n", + "Cbc0010I After 10395000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (910.32 seconds)\n", + "Cbc0010I After 10396000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (910.36 seconds)\n", + "Cbc0010I After 10397000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (910.41 seconds)\n", + "Cbc0010I After 10398000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.46 seconds)\n", + "Cbc0010I After 10399000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.51 seconds)\n", + "Cbc0010I After 10400000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.56 seconds)\n", + "Cbc0010I After 10401000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (910.61 seconds)\n", + "Cbc0010I After 10402000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (910.67 seconds)\n", + "Cbc0010I After 10403000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (910.72 seconds)\n", + "Cbc0010I After 10404000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (910.78 seconds)\n", + "Cbc0010I After 10405000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (910.84 seconds)\n", + "Cbc0010I After 10406000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (910.92 seconds)\n", + "Cbc0010I After 10407000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (910.99 seconds)\n", + "Cbc0010I After 10408000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (911.06 seconds)\n", + "Cbc0010I After 10409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (911.12 seconds)\n", + "Cbc0010I After 10410000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (911.19 seconds)\n", + "Cbc0010I After 10411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (911.25 seconds)\n", + "Cbc0010I After 10412000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (911.31 seconds)\n", + "Cbc0010I After 10413000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (911.36 seconds)\n", + "Cbc0010I After 10414000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (911.42 seconds)\n", + "Cbc0010I After 10415000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (911.48 seconds)\n", + "Cbc0010I After 10416000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (911.54 seconds)\n", + "Cbc0010I After 10417000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (911.61 seconds)\n", + "Cbc0010I After 10418000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (911.68 seconds)\n", + "Cbc0010I After 10419000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (911.75 seconds)\n", + "Cbc0010I After 10420000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (911.83 seconds)\n", + "Cbc0010I After 10421000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (911.90 seconds)\n", + "Cbc0010I After 10422000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (911.97 seconds)\n", + "Cbc0010I After 10423000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (912.03 seconds)\n", + "Cbc0010I After 10424000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (912.10 seconds)\n", + "Cbc0010I After 10425000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (912.17 seconds)\n", + "Cbc0010I After 10426000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (912.24 seconds)\n", + "Cbc0010I After 10427000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (912.30 seconds)\n", + "Cbc0010I After 10428000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (912.36 seconds)\n", + "Cbc0010I After 10429000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (912.42 seconds)\n", + "Cbc0010I After 10430000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (912.48 seconds)\n", + "Cbc0010I After 10431000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (912.53 seconds)\n", + "Cbc0010I After 10432000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (912.58 seconds)\n", + "Cbc0010I After 10433000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (912.62 seconds)\n", + "Cbc0010I After 10434000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (912.66 seconds)\n", + "Cbc0010I After 10435000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (912.72 seconds)\n", + "Cbc0010I After 10436000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (912.76 seconds)\n", + "Cbc0010I After 10437000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (912.81 seconds)\n", + "Cbc0010I After 10438000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (912.87 seconds)\n", + "Cbc0010I After 10439000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (912.91 seconds)\n", + "Cbc0010I After 10440000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (912.97 seconds)\n", + "Cbc0010I After 10441000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (913.02 seconds)\n", + "Cbc0010I After 10442000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (913.09 seconds)\n", + "Cbc0010I After 10443000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (913.15 seconds)\n", + "Cbc0010I After 10444000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (913.21 seconds)\n", + "Cbc0010I After 10445000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (913.27 seconds)\n", + "Cbc0010I After 10446000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (913.33 seconds)\n", + "Cbc0010I After 10447000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (913.38 seconds)\n", + "Cbc0010I After 10448000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.43 seconds)\n", + "Cbc0010I After 10449000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (913.50 seconds)\n", + "Cbc0010I After 10450000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (913.55 seconds)\n", + "Cbc0010I After 10451000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (913.61 seconds)\n", + "Cbc0010I After 10452000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.66 seconds)\n", + "Cbc0010I After 10453000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.72 seconds)\n", + "Cbc0010I After 10454000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (913.77 seconds)\n", + "Cbc0010I After 10455000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (913.83 seconds)\n", + "Cbc0010I After 10456000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (913.89 seconds)\n", + "Cbc0010I After 10457000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (913.95 seconds)\n", + "Cbc0010I After 10458000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (914.00 seconds)\n", + "Cbc0010I After 10459000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (914.05 seconds)\n", + "Cbc0010I After 10460000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (914.11 seconds)\n", + "Cbc0010I After 10461000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (914.17 seconds)\n", + "Cbc0010I After 10462000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (914.22 seconds)\n", + "Cbc0010I After 10463000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (914.27 seconds)\n", + "Cbc0010I After 10464000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (914.33 seconds)\n", + "Cbc0010I After 10465000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (914.39 seconds)\n", + "Cbc0010I After 10466000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (914.45 seconds)\n", + "Cbc0010I After 10467000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (914.51 seconds)\n", + "Cbc0010I After 10468000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.57 seconds)\n", + "Cbc0010I After 10469000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (914.63 seconds)\n", + "Cbc0010I After 10470000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.69 seconds)\n", + "Cbc0010I After 10471000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.75 seconds)\n", + "Cbc0010I After 10472000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (914.81 seconds)\n", + "Cbc0010I After 10473000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (914.87 seconds)\n", + "Cbc0010I After 10474000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (914.93 seconds)\n", + "Cbc0010I After 10475000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (914.99 seconds)\n", + "Cbc0010I After 10476000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (915.04 seconds)\n", + "Cbc0010I After 10477000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (915.10 seconds)\n", + "Cbc0010I After 10478000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (915.17 seconds)\n", + "Cbc0010I After 10479000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (915.22 seconds)\n", + "Cbc0010I After 10480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (915.27 seconds)\n", + "Cbc0010I After 10481000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (915.34 seconds)\n", + "Cbc0010I After 10482000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (915.39 seconds)\n", + "Cbc0010I After 10483000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (915.45 seconds)\n", + "Cbc0010I After 10484000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.51 seconds)\n", + "Cbc0010I After 10485000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.55 seconds)\n", + "Cbc0010I After 10486000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (915.62 seconds)\n", + "Cbc0010I After 10487000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.66 seconds)\n", + "Cbc0010I After 10488000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (915.73 seconds)\n", + "Cbc0010I After 10489000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (915.77 seconds)\n", + "Cbc0010I After 10490000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (915.84 seconds)\n", + "Cbc0010I After 10491000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (915.92 seconds)\n", + "Cbc0010I After 10492000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (915.98 seconds)\n", + "Cbc0010I After 10493000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (916.04 seconds)\n", + "Cbc0010I After 10494000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (916.10 seconds)\n", + "Cbc0010I After 10495000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (916.16 seconds)\n", + "Cbc0010I After 10496000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (916.22 seconds)\n", + "Cbc0010I After 10497000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (916.28 seconds)\n", + "Cbc0010I After 10498000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (916.35 seconds)\n", + "Cbc0010I After 10499000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (916.41 seconds)\n", + "Cbc0010I After 10500000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (916.46 seconds)\n", + "Cbc0010I After 10501000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (916.50 seconds)\n", + "Cbc0010I After 10502000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (916.56 seconds)\n", + "Cbc0010I After 10503000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (916.62 seconds)\n", + "Cbc0010I After 10504000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (916.67 seconds)\n", + "Cbc0010I After 10505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (916.72 seconds)\n", + "Cbc0010I After 10506000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (916.78 seconds)\n", + "Cbc0010I After 10507000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (916.83 seconds)\n", + "Cbc0010I After 10508000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (916.89 seconds)\n", + "Cbc0010I After 10509000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (916.94 seconds)\n", + "Cbc0010I After 10510000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (917.00 seconds)\n", + "Cbc0010I After 10511000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (917.05 seconds)\n", + "Cbc0010I After 10512000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (917.11 seconds)\n", + "Cbc0010I After 10513000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (917.17 seconds)\n", + "Cbc0010I After 10514000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.22 seconds)\n", + "Cbc0010I After 10515000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (917.27 seconds)\n", + "Cbc0010I After 10516000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (917.32 seconds)\n", + "Cbc0010I After 10517000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (917.38 seconds)\n", + "Cbc0010I After 10518000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (917.45 seconds)\n", + "Cbc0010I After 10519000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (917.49 seconds)\n", + "Cbc0010I After 10520000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (917.55 seconds)\n", + "Cbc0010I After 10521000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (917.60 seconds)\n", + "Cbc0010I After 10522000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (917.65 seconds)\n", + "Cbc0010I After 10523000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (917.71 seconds)\n", + "Cbc0010I After 10524000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (917.76 seconds)\n", + "Cbc0010I After 10525000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (917.83 seconds)\n", + "Cbc0010I After 10526000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (917.87 seconds)\n", + "Cbc0010I After 10527000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.93 seconds)\n", + "Cbc0010I After 10528000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.99 seconds)\n", + "Cbc0010I After 10529000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (918.05 seconds)\n", + "Cbc0010I After 10530000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (918.11 seconds)\n", + "Cbc0010I After 10531000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (918.15 seconds)\n", + "Cbc0010I After 10532000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (918.19 seconds)\n", + "Cbc0010I After 10533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (918.24 seconds)\n", + "Cbc0010I After 10534000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (918.29 seconds)\n", + "Cbc0010I After 10535000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (918.34 seconds)\n", + "Cbc0010I After 10536000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (918.40 seconds)\n", + "Cbc0010I After 10537000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (918.43 seconds)\n", + "Cbc0010I After 10538000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.49 seconds)\n", + "Cbc0010I After 10539000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (918.54 seconds)\n", + "Cbc0010I After 10540000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (918.59 seconds)\n", + "Cbc0010I After 10541000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (918.64 seconds)\n", + "Cbc0010I After 10542000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.74 seconds)\n", + "Cbc0010I After 10543000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (918.82 seconds)\n", + "Cbc0010I After 10544000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.89 seconds)\n", + "Cbc0010I After 10545000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (918.95 seconds)\n", + "Cbc0010I After 10546000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (918.99 seconds)\n", + "Cbc0010I After 10547000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (919.04 seconds)\n", + "Cbc0010I After 10548000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (919.09 seconds)\n", + "Cbc0010I After 10549000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (919.12 seconds)\n", + "Cbc0010I After 10550000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (919.16 seconds)\n", + "Cbc0010I After 10551000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (919.19 seconds)\n", + "Cbc0010I After 10552000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (919.24 seconds)\n", + "Cbc0010I After 10553000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (919.29 seconds)\n", + "Cbc0010I After 10554000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (919.36 seconds)\n", + "Cbc0010I After 10555000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (919.45 seconds)\n", + "Cbc0010I After 10556000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (919.52 seconds)\n", + "Cbc0010I After 10557000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (919.60 seconds)\n", + "Cbc0010I After 10558000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (919.68 seconds)\n", + "Cbc0010I After 10559000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (919.76 seconds)\n", + "Cbc0010I After 10560000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (919.83 seconds)\n", + "Cbc0010I After 10561000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (919.91 seconds)\n", + "Cbc0010I After 10562000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (919.98 seconds)\n", + "Cbc0010I After 10563000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (920.08 seconds)\n", + "Cbc0010I After 10564000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (920.15 seconds)\n", + "Cbc0010I After 10565000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (920.18 seconds)\n", + "Cbc0010I After 10566000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (920.21 seconds)\n", + "Cbc0010I After 10567000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.24 seconds)\n", + "Cbc0010I After 10568000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (920.27 seconds)\n", + "Cbc0010I After 10569000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (920.30 seconds)\n", + "Cbc0010I After 10570000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (920.35 seconds)\n", + "Cbc0010I After 10571000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (920.41 seconds)\n", + "Cbc0010I After 10572000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (920.47 seconds)\n", + "Cbc0010I After 10573000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.54 seconds)\n", + "Cbc0010I After 10574000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.57 seconds)\n", + "Cbc0010I After 10575000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.60 seconds)\n", + "Cbc0010I After 10576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (920.65 seconds)\n", + "Cbc0010I After 10577000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.68 seconds)\n", + "Cbc0010I After 10578000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (920.74 seconds)\n", + "Cbc0010I After 10579000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (920.78 seconds)\n", + "Cbc0010I After 10580000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (920.83 seconds)\n", + "Cbc0010I After 10581000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.87 seconds)\n", + "Cbc0010I After 10582000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (920.90 seconds)\n", + "Cbc0010I After 10583000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.95 seconds)\n", + "Cbc0010I After 10584000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (921.00 seconds)\n", + "Cbc0010I After 10585000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (921.08 seconds)\n", + "Cbc0010I After 10586000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (921.13 seconds)\n", + "Cbc0010I After 10587000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (921.19 seconds)\n", + "Cbc0010I After 10588000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (921.24 seconds)\n", + "Cbc0010I After 10589000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (921.28 seconds)\n", + "Cbc0010I After 10590000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (921.32 seconds)\n", + "Cbc0010I After 10591000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (921.37 seconds)\n", + "Cbc0010I After 10592000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (921.40 seconds)\n", + "Cbc0010I After 10593000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (921.44 seconds)\n", + "Cbc0010I After 10594000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (921.50 seconds)\n", + "Cbc0010I After 10595000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (921.54 seconds)\n", + "Cbc0010I After 10596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (921.61 seconds)\n", + "Cbc0010I After 10597000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (921.69 seconds)\n", + "Cbc0010I After 10598000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (921.76 seconds)\n", + "Cbc0010I After 10599000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (921.84 seconds)\n", + "Cbc0010I After 10600000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (921.91 seconds)\n", + "Cbc0010I After 10601000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (921.99 seconds)\n", + "Cbc0010I After 10602000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (922.07 seconds)\n", + "Cbc0010I After 10603000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (922.14 seconds)\n", + "Cbc0010I After 10604000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (922.19 seconds)\n", + "Cbc0010I After 10605000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (922.25 seconds)\n", + "Cbc0010I After 10606000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (922.31 seconds)\n", + "Cbc0010I After 10607000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (922.38 seconds)\n", + "Cbc0010I After 10608000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (922.43 seconds)\n", + "Cbc0010I After 10609000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (922.49 seconds)\n", + "Cbc0010I After 10610000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (922.54 seconds)\n", + "Cbc0010I After 10611000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (922.57 seconds)\n", + "Cbc0010I After 10612000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (922.63 seconds)\n", + "Cbc0010I After 10613000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (922.69 seconds)\n", + "Cbc0010I After 10614000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (922.74 seconds)\n", + "Cbc0010I After 10615000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (922.79 seconds)\n", + "Cbc0010I After 10616000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (922.83 seconds)\n", + "Cbc0010I After 10617000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (922.86 seconds)\n", + "Cbc0010I After 10618000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (922.89 seconds)\n", + "Cbc0010I After 10619000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (922.92 seconds)\n", + "Cbc0010I After 10620000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (922.95 seconds)\n", + "Cbc0010I After 10621000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (923.00 seconds)\n", + "Cbc0010I After 10622000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (923.05 seconds)\n", + "Cbc0010I After 10623000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (923.12 seconds)\n", + "Cbc0010I After 10624000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (923.16 seconds)\n", + "Cbc0010I After 10625000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.21 seconds)\n", + "Cbc0010I After 10626000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (923.28 seconds)\n", + "Cbc0010I After 10627000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (923.40 seconds)\n", + "Cbc0010I After 10628000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (923.50 seconds)\n", + "Cbc0010I After 10629000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (923.60 seconds)\n", + "Cbc0010I After 10630000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (923.69 seconds)\n", + "Cbc0010I After 10631000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (923.76 seconds)\n", + "Cbc0010I After 10632000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (923.79 seconds)\n", + "Cbc0010I After 10633000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (923.82 seconds)\n", + "Cbc0010I After 10634000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (923.87 seconds)\n", + "Cbc0010I After 10635000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.91 seconds)\n", + "Cbc0010I After 10636000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.94 seconds)\n", + "Cbc0010I After 10637000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (923.98 seconds)\n", + "Cbc0010I After 10638000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (924.01 seconds)\n", + "Cbc0010I After 10639000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (924.05 seconds)\n", + "Cbc0010I After 10640000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (924.09 seconds)\n", + "Cbc0010I After 10641000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (924.14 seconds)\n", + "Cbc0010I After 10642000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (924.19 seconds)\n", + "Cbc0010I After 10643000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (924.25 seconds)\n", + "Cbc0010I After 10644000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (924.31 seconds)\n", + "Cbc0010I After 10645000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (924.35 seconds)\n", + "Cbc0010I After 10646000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (924.39 seconds)\n", + "Cbc0010I After 10647000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (924.44 seconds)\n", + "Cbc0010I After 10648000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (924.51 seconds)\n", + "Cbc0010I After 10649000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (924.59 seconds)\n", + "Cbc0010I After 10650000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (924.64 seconds)\n", + "Cbc0010I After 10651000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (924.67 seconds)\n", + "Cbc0010I After 10652000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (924.70 seconds)\n", + "Cbc0010I After 10653000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (924.75 seconds)\n", + "Cbc0010I After 10654000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (924.81 seconds)\n", + "Cbc0010I After 10655000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (924.88 seconds)\n", + "Cbc0010I After 10656000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (924.92 seconds)\n", + "Cbc0010I After 10657000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (924.95 seconds)\n", + "Cbc0010I After 10658000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (925.02 seconds)\n", + "Cbc0010I After 10659000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (925.07 seconds)\n", + "Cbc0010I After 10660000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (925.13 seconds)\n", + "Cbc0010I After 10661000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (925.18 seconds)\n", + "Cbc0010I After 10662000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.22 seconds)\n", + "Cbc0010I After 10663000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (925.27 seconds)\n", + "Cbc0010I After 10664000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (925.34 seconds)\n", + "Cbc0010I After 10665000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.38 seconds)\n", + "Cbc0010I After 10666000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (925.43 seconds)\n", + "Cbc0010I After 10667000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (925.48 seconds)\n", + "Cbc0010I After 10668000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (925.55 seconds)\n", + "Cbc0010I After 10669000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (925.63 seconds)\n", + "Cbc0010I After 10670000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (925.71 seconds)\n", + "Cbc0010I After 10671000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (925.79 seconds)\n", + "Cbc0010I After 10672000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.85 seconds)\n", + "Cbc0010I After 10673000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (925.92 seconds)\n", + "Cbc0010I After 10674000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (925.98 seconds)\n", + "Cbc0010I After 10675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (926.04 seconds)\n", + "Cbc0010I After 10676000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (926.10 seconds)\n", + "Cbc0010I After 10677000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (926.16 seconds)\n", + "Cbc0010I After 10678000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (926.20 seconds)\n", + "Cbc0010I After 10679000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (926.27 seconds)\n", + "Cbc0010I After 10680000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (926.30 seconds)\n", + "Cbc0010I After 10681000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (926.33 seconds)\n", + "Cbc0010I After 10682000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (926.36 seconds)\n", + "Cbc0010I After 10683000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (926.39 seconds)\n", + "Cbc0010I After 10684000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (926.43 seconds)\n", + "Cbc0010I After 10685000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (926.48 seconds)\n", + "Cbc0010I After 10686000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.52 seconds)\n", + "Cbc0010I After 10687000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (926.56 seconds)\n", + "Cbc0010I After 10688000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (926.60 seconds)\n", + "Cbc0010I After 10689000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (926.66 seconds)\n", + "Cbc0010I After 10690000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (926.71 seconds)\n", + "Cbc0010I After 10691000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (926.74 seconds)\n", + "Cbc0010I After 10692000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (926.78 seconds)\n", + "Cbc0010I After 10693000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.81 seconds)\n", + "Cbc0010I After 10694000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (926.86 seconds)\n", + "Cbc0010I After 10695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (926.89 seconds)\n", + "Cbc0010I After 10696000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.94 seconds)\n", + "Cbc0010I After 10697000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (926.97 seconds)\n", + "Cbc0010I After 10698000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (927.00 seconds)\n", + "Cbc0010I After 10699000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (927.04 seconds)\n", + "Cbc0010I After 10700000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (927.07 seconds)\n", + "Cbc0010I After 10701000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (927.10 seconds)\n", + "Cbc0010I After 10702000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (927.13 seconds)\n", + "Cbc0010I After 10703000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (927.17 seconds)\n", + "Cbc0010I After 10704000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (927.20 seconds)\n", + "Cbc0010I After 10705000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (927.24 seconds)\n", + "Cbc0010I After 10706000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (927.27 seconds)\n", + "Cbc0010I After 10707000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (927.33 seconds)\n", + "Cbc0010I After 10708000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (927.38 seconds)\n", + "Cbc0010I After 10709000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (927.43 seconds)\n", + "Cbc0010I After 10710000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (927.48 seconds)\n", + "Cbc0010I After 10711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (927.54 seconds)\n", + "Cbc0010I After 10712000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (927.59 seconds)\n", + "Cbc0010I After 10713000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (927.64 seconds)\n", + "Cbc0010I After 10714000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (927.69 seconds)\n", + "Cbc0010I After 10715000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (927.74 seconds)\n", + "Cbc0010I After 10716000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (927.80 seconds)\n", + "Cbc0010I After 10717000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (927.85 seconds)\n", + "Cbc0010I After 10718000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (927.89 seconds)\n", + "Cbc0010I After 10719000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (927.94 seconds)\n", + "Cbc0010I After 10720000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (927.98 seconds)\n", + "Cbc0010I After 10721000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (928.03 seconds)\n", + "Cbc0010I After 10722000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (928.08 seconds)\n", + "Cbc0010I After 10723000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (928.13 seconds)\n", + "Cbc0010I After 10724000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (928.18 seconds)\n", + "Cbc0010I After 10725000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (928.22 seconds)\n", + "Cbc0010I After 10726000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (928.27 seconds)\n", + "Cbc0010I After 10727000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (928.34 seconds)\n", + "Cbc0010I After 10728000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (928.41 seconds)\n", + "Cbc0010I After 10729000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (928.47 seconds)\n", + "Cbc0010I After 10730000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (928.53 seconds)\n", + "Cbc0010I After 10731000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (928.58 seconds)\n", + "Cbc0010I After 10732000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (928.63 seconds)\n", + "Cbc0010I After 10733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (928.69 seconds)\n", + "Cbc0010I After 10734000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (928.74 seconds)\n", + "Cbc0010I After 10735000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (928.79 seconds)\n", + "Cbc0010I After 10736000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (928.85 seconds)\n", + "Cbc0010I After 10737000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (928.90 seconds)\n", + "Cbc0010I After 10738000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (928.96 seconds)\n", + "Cbc0010I After 10739000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (929.02 seconds)\n", + "Cbc0010I After 10740000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (929.07 seconds)\n", + "Cbc0010I After 10741000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (929.12 seconds)\n", + "Cbc0010I After 10742000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (929.17 seconds)\n", + "Cbc0010I After 10743000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (929.23 seconds)\n", + "Cbc0010I After 10744000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (929.28 seconds)\n", + "Cbc0010I After 10745000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (929.33 seconds)\n", + "Cbc0010I After 10746000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (929.38 seconds)\n", + "Cbc0010I After 10747000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (929.43 seconds)\n", + "Cbc0010I After 10748000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (929.49 seconds)\n", + "Cbc0010I After 10749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (929.55 seconds)\n", + "Cbc0010I After 10750000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (929.60 seconds)\n", + "Cbc0010I After 10751000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (929.66 seconds)\n", + "Cbc0010I After 10752000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (929.73 seconds)\n", + "Cbc0010I After 10753000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (929.79 seconds)\n", + "Cbc0010I After 10754000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (929.86 seconds)\n", + "Cbc0010I After 10755000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (929.92 seconds)\n", + "Cbc0010I After 10756000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (929.98 seconds)\n", + "Cbc0010I After 10757000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (930.04 seconds)\n", + "Cbc0010I After 10758000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (930.08 seconds)\n", + "Cbc0010I After 10759000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (930.14 seconds)\n", + "Cbc0010I After 10760000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (930.20 seconds)\n", + "Cbc0010I After 10761000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (930.28 seconds)\n", + "Cbc0010I After 10762000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (930.35 seconds)\n", + "Cbc0010I After 10763000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (930.40 seconds)\n", + "Cbc0010I After 10764000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (930.46 seconds)\n", + "Cbc0010I After 10765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (930.52 seconds)\n", + "Cbc0010I After 10766000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (930.58 seconds)\n", + "Cbc0010I After 10767000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (930.64 seconds)\n", + "Cbc0010I After 10768000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (930.70 seconds)\n", + "Cbc0010I After 10769000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (930.76 seconds)\n", + "Cbc0010I After 10770000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (930.83 seconds)\n", + "Cbc0010I After 10771000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (930.90 seconds)\n", + "Cbc0010I After 10772000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (930.96 seconds)\n", + "Cbc0010I After 10773000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (931.02 seconds)\n", + "Cbc0010I After 10774000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (931.08 seconds)\n", + "Cbc0010I After 10775000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (931.14 seconds)\n", + "Cbc0010I After 10776000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (931.20 seconds)\n", + "Cbc0010I After 10777000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (931.25 seconds)\n", + "Cbc0010I After 10778000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (931.31 seconds)\n", + "Cbc0010I After 10779000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (931.34 seconds)\n", + "Cbc0010I After 10780000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (931.38 seconds)\n", + "Cbc0010I After 10781000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.44 seconds)\n", + "Cbc0010I After 10782000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (931.49 seconds)\n", + "Cbc0010I After 10783000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (931.55 seconds)\n", + "Cbc0010I After 10784000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (931.60 seconds)\n", + "Cbc0010I After 10785000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (931.65 seconds)\n", + "Cbc0010I After 10786000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.70 seconds)\n", + "Cbc0010I After 10787000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.75 seconds)\n", + "Cbc0010I After 10788000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (931.81 seconds)\n", + "Cbc0010I After 10789000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (931.87 seconds)\n", + "Cbc0010I After 10790000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (931.92 seconds)\n", + "Cbc0010I After 10791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (931.99 seconds)\n", + "Cbc0010I After 10792000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (932.06 seconds)\n", + "Cbc0010I After 10793000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (932.11 seconds)\n", + "Cbc0010I After 10794000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (932.17 seconds)\n", + "Cbc0010I After 10795000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (932.21 seconds)\n", + "Cbc0010I After 10796000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (932.27 seconds)\n", + "Cbc0010I After 10797000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (932.31 seconds)\n", + "Cbc0010I After 10798000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (932.36 seconds)\n", + "Cbc0010I After 10799000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (932.42 seconds)\n", + "Cbc0010I After 10800000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (932.48 seconds)\n", + "Cbc0010I After 10801000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (932.53 seconds)\n", + "Cbc0010I After 10802000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (932.60 seconds)\n", + "Cbc0010I After 10803000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (932.65 seconds)\n", + "Cbc0010I After 10804000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (932.70 seconds)\n", + "Cbc0010I After 10805000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (932.76 seconds)\n", + "Cbc0010I After 10806000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (932.82 seconds)\n", + "Cbc0010I After 10807000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (932.88 seconds)\n", + "Cbc0010I After 10808000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (932.93 seconds)\n", + "Cbc0010I After 10809000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (932.99 seconds)\n", + "Cbc0010I After 10810000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (933.04 seconds)\n", + "Cbc0010I After 10811000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (933.09 seconds)\n", + "Cbc0010I After 10812000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (933.16 seconds)\n", + "Cbc0010I After 10813000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (933.21 seconds)\n", + "Cbc0010I After 10814000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (933.27 seconds)\n", + "Cbc0010I After 10815000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.35 seconds)\n", + "Cbc0010I After 10816000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.42 seconds)\n", + "Cbc0010I After 10817000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (933.50 seconds)\n", + "Cbc0010I After 10818000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (933.57 seconds)\n", + "Cbc0010I After 10819000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (933.63 seconds)\n", + "Cbc0010I After 10820000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (933.70 seconds)\n", + "Cbc0010I After 10821000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (933.75 seconds)\n", + "Cbc0010I After 10822000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (933.81 seconds)\n", + "Cbc0010I After 10823000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (933.87 seconds)\n", + "Cbc0010I After 10824000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (933.92 seconds)\n", + "Cbc0010I After 10825000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.98 seconds)\n", + "Cbc0010I After 10826000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (934.04 seconds)\n", + "Cbc0010I After 10827000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (934.10 seconds)\n", + "Cbc0010I After 10828000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (934.18 seconds)\n", + "Cbc0010I After 10829000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (934.25 seconds)\n", + "Cbc0010I After 10830000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (934.31 seconds)\n", + "Cbc0010I After 10831000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (934.39 seconds)\n", + "Cbc0010I After 10832000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (934.45 seconds)\n", + "Cbc0010I After 10833000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (934.52 seconds)\n", + "Cbc0010I After 10834000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (934.58 seconds)\n", + "Cbc0010I After 10835000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (934.64 seconds)\n", + "Cbc0010I After 10836000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (934.69 seconds)\n", + "Cbc0010I After 10837000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (934.76 seconds)\n", + "Cbc0010I After 10838000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (934.83 seconds)\n", + "Cbc0010I After 10839000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (934.90 seconds)\n", + "Cbc0010I After 10840000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (934.95 seconds)\n", + "Cbc0010I After 10841000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (935.01 seconds)\n", + "Cbc0010I After 10842000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (935.07 seconds)\n", + "Cbc0010I After 10843000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (935.12 seconds)\n", + "Cbc0010I After 10844000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.18 seconds)\n", + "Cbc0010I After 10845000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (935.24 seconds)\n", + "Cbc0010I After 10846000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (935.29 seconds)\n", + "Cbc0010I After 10847000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (935.36 seconds)\n", + "Cbc0010I After 10848000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (935.42 seconds)\n", + "Cbc0010I After 10849000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.47 seconds)\n", + "Cbc0010I After 10850000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.53 seconds)\n", + "Cbc0010I After 10851000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (935.59 seconds)\n", + "Cbc0010I After 10852000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (935.65 seconds)\n", + "Cbc0010I After 10853000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (935.70 seconds)\n", + "Cbc0010I After 10854000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (935.76 seconds)\n", + "Cbc0010I After 10855000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (935.82 seconds)\n", + "Cbc0010I After 10856000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (935.88 seconds)\n", + "Cbc0010I After 10857000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (935.94 seconds)\n", + "Cbc0010I After 10858000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (935.99 seconds)\n", + "Cbc0010I After 10859000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (936.06 seconds)\n", + "Cbc0010I After 10860000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (936.12 seconds)\n", + "Cbc0010I After 10861000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (936.19 seconds)\n", + "Cbc0010I After 10862000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (936.23 seconds)\n", + "Cbc0010I After 10863000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (936.29 seconds)\n", + "Cbc0010I After 10864000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (936.35 seconds)\n", + "Cbc0010I After 10865000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (936.40 seconds)\n", + "Cbc0010I After 10866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (936.45 seconds)\n", + "Cbc0010I After 10867000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (936.52 seconds)\n", + "Cbc0010I After 10868000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (936.57 seconds)\n", + "Cbc0010I After 10869000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (936.64 seconds)\n", + "Cbc0010I After 10870000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (936.70 seconds)\n", + "Cbc0010I After 10871000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (936.77 seconds)\n", + "Cbc0010I After 10872000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (936.82 seconds)\n", + "Cbc0010I After 10873000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (936.88 seconds)\n", + "Cbc0010I After 10874000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (936.94 seconds)\n", + "Cbc0010I After 10875000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (937.00 seconds)\n", + "Cbc0010I After 10876000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (937.06 seconds)\n", + "Cbc0010I After 10877000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (937.13 seconds)\n", + "Cbc0010I After 10878000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (937.18 seconds)\n", + "Cbc0010I After 10879000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (937.25 seconds)\n", + "Cbc0010I After 10880000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.31 seconds)\n", + "Cbc0010I After 10881000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.38 seconds)\n", + "Cbc0010I After 10882000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (937.43 seconds)\n", + "Cbc0010I After 10883000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.50 seconds)\n", + "Cbc0010I After 10884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (937.56 seconds)\n", + "Cbc0010I After 10885000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (937.62 seconds)\n", + "Cbc0010I After 10886000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (937.67 seconds)\n", + "Cbc0010I After 10887000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (937.73 seconds)\n", + "Cbc0010I After 10888000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (937.80 seconds)\n", + "Cbc0010I After 10889000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (937.85 seconds)\n", + "Cbc0010I After 10890000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (937.90 seconds)\n", + "Cbc0010I After 10891000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (937.96 seconds)\n", + "Cbc0010I After 10892000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (938.03 seconds)\n", + "Cbc0010I After 10893000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (938.09 seconds)\n", + "Cbc0010I After 10894000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (938.12 seconds)\n", + "Cbc0010I After 10895000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (938.16 seconds)\n", + "Cbc0010I After 10896000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (938.20 seconds)\n", + "Cbc0010I After 10897000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (938.24 seconds)\n", + "Cbc0010I After 10898000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (938.29 seconds)\n", + "Cbc0010I After 10899000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (938.33 seconds)\n", + "Cbc0010I After 10900000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (938.38 seconds)\n", + "Cbc0010I After 10901000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (938.43 seconds)\n", + "Cbc0010I After 10902000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (938.49 seconds)\n", + "Cbc0010I After 10903000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (938.52 seconds)\n", + "Cbc0010I After 10904000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (938.56 seconds)\n", + "Cbc0010I After 10905000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (938.59 seconds)\n", + "Cbc0010I After 10906000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (938.64 seconds)\n", + "Cbc0010I After 10907000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (938.67 seconds)\n", + "Cbc0010I After 10908000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (938.72 seconds)\n", + "Cbc0010I After 10909000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (938.76 seconds)\n", + "Cbc0010I After 10910000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (938.80 seconds)\n", + "Cbc0010I After 10911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (938.85 seconds)\n", + "Cbc0010I After 10912000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (938.93 seconds)\n", + "Cbc0010I After 10913000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (939.00 seconds)\n", + "Cbc0010I After 10914000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (939.08 seconds)\n", + "Cbc0010I After 10915000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (939.15 seconds)\n", + "Cbc0010I After 10916000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (939.22 seconds)\n", + "Cbc0010I After 10917000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (939.28 seconds)\n", + "Cbc0010I After 10918000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (939.31 seconds)\n", + "Cbc0010I After 10919000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (939.37 seconds)\n", + "Cbc0010I After 10920000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (939.41 seconds)\n", + "Cbc0010I After 10921000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (939.47 seconds)\n", + "Cbc0010I After 10922000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (939.55 seconds)\n", + "Cbc0010I After 10923000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (939.64 seconds)\n", + "Cbc0010I After 10924000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (939.69 seconds)\n", + "Cbc0010I After 10925000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (939.74 seconds)\n", + "Cbc0010I After 10926000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (939.80 seconds)\n", + "Cbc0010I After 10927000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (939.86 seconds)\n", + "Cbc0010I After 10928000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (939.92 seconds)\n", + "Cbc0010I After 10929000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (939.97 seconds)\n", + "Cbc0010I After 10930000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (940.04 seconds)\n", + "Cbc0010I After 10931000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (940.10 seconds)\n", + "Cbc0010I After 10932000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (940.16 seconds)\n", + "Cbc0010I After 10933000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (940.23 seconds)\n", + "Cbc0010I After 10934000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (940.28 seconds)\n", + "Cbc0010I After 10935000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.34 seconds)\n", + "Cbc0010I After 10936000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (940.40 seconds)\n", + "Cbc0010I After 10937000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (940.43 seconds)\n", + "Cbc0010I After 10938000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (940.46 seconds)\n", + "Cbc0010I After 10939000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (940.50 seconds)\n", + "Cbc0010I After 10940000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.53 seconds)\n", + "Cbc0010I After 10941000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (940.57 seconds)\n", + "Cbc0010I After 10942000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (940.60 seconds)\n", + "Cbc0010I After 10943000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (940.65 seconds)\n", + "Cbc0010I After 10944000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (940.68 seconds)\n", + "Cbc0010I After 10945000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.73 seconds)\n", + "Cbc0010I After 10946000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (940.76 seconds)\n", + "Cbc0010I After 10947000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (940.83 seconds)\n", + "Cbc0010I After 10948000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (940.88 seconds)\n", + "Cbc0010I After 10949000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (940.91 seconds)\n", + "Cbc0010I After 10950000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (940.96 seconds)\n", + "Cbc0010I After 10951000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (941.00 seconds)\n", + "Cbc0010I After 10952000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (941.04 seconds)\n", + "Cbc0010I After 10953000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (941.08 seconds)\n", + "Cbc0010I After 10954000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (941.12 seconds)\n", + "Cbc0010I After 10955000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (941.16 seconds)\n", + "Cbc0010I After 10956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (941.21 seconds)\n", + "Cbc0010I After 10957000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (941.26 seconds)\n", + "Cbc0010I After 10958000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (941.30 seconds)\n", + "Cbc0010I After 10959000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (941.34 seconds)\n", + "Cbc0010I After 10960000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (941.38 seconds)\n", + "Cbc0010I After 10961000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (941.41 seconds)\n", + "Cbc0010I After 10962000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (941.47 seconds)\n", + "Cbc0010I After 10963000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (941.51 seconds)\n", + "Cbc0010I After 10964000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (941.54 seconds)\n", + "Cbc0010I After 10965000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (941.59 seconds)\n", + "Cbc0010I After 10966000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (941.63 seconds)\n", + "Cbc0010I After 10967000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (941.67 seconds)\n", + "Cbc0010I After 10968000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (941.72 seconds)\n", + "Cbc0010I After 10969000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (941.77 seconds)\n", + "Cbc0010I After 10970000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (941.81 seconds)\n", + "Cbc0010I After 10971000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (941.85 seconds)\n", + "Cbc0010I After 10972000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (941.88 seconds)\n", + "Cbc0010I After 10973000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (941.94 seconds)\n", + "Cbc0010I After 10974000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (941.97 seconds)\n", + "Cbc0010I After 10975000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (942.03 seconds)\n", + "Cbc0010I After 10976000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (942.09 seconds)\n", + "Cbc0010I After 10977000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (942.13 seconds)\n", + "Cbc0010I After 10978000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (942.19 seconds)\n", + "Cbc0010I After 10979000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.23 seconds)\n", + "Cbc0010I After 10980000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (942.27 seconds)\n", + "Cbc0010I After 10981000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (942.30 seconds)\n", + "Cbc0010I After 10982000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.33 seconds)\n", + "Cbc0010I After 10983000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (942.37 seconds)\n", + "Cbc0010I After 10984000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (942.41 seconds)\n", + "Cbc0010I After 10985000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (942.46 seconds)\n", + "Cbc0010I After 10986000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (942.51 seconds)\n", + "Cbc0010I After 10987000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (942.54 seconds)\n", + "Cbc0010I After 10988000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (942.57 seconds)\n", + "Cbc0010I After 10989000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (942.61 seconds)\n", + "Cbc0010I After 10990000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (942.66 seconds)\n", + "Cbc0010I After 10991000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (942.73 seconds)\n", + "Cbc0010I After 10992000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (942.80 seconds)\n", + "Cbc0010I After 10993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (942.87 seconds)\n", + "Cbc0010I After 10994000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (942.92 seconds)\n", + "Cbc0010I After 10995000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.95 seconds)\n", + "Cbc0010I After 10996000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (943.00 seconds)\n", + "Cbc0010I After 10997000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (943.04 seconds)\n", + "Cbc0010I After 10998000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (943.07 seconds)\n", + "Cbc0010I After 10999000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (943.12 seconds)\n", + "Cbc0010I After 11000000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (943.15 seconds)\n", + "Cbc0010I After 11001000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (943.19 seconds)\n", + "Cbc0010I After 11002000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (943.25 seconds)\n", + "Cbc0010I After 11003000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (943.29 seconds)\n", + "Cbc0010I After 11004000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.33 seconds)\n", + "Cbc0010I After 11005000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (943.39 seconds)\n", + "Cbc0010I After 11006000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (943.43 seconds)\n", + "Cbc0010I After 11007000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (943.47 seconds)\n", + "Cbc0010I After 11008000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (943.51 seconds)\n", + "Cbc0010I After 11009000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (943.55 seconds)\n", + "Cbc0010I After 11010000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (943.58 seconds)\n", + "Cbc0010I After 11011000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.63 seconds)\n", + "Cbc0010I After 11012000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (943.68 seconds)\n", + "Cbc0010I After 11013000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (943.72 seconds)\n", + "Cbc0010I After 11014000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (943.76 seconds)\n", + "Cbc0010I After 11015000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (943.80 seconds)\n", + "Cbc0010I After 11016000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (943.84 seconds)\n", + "Cbc0010I After 11017000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (943.88 seconds)\n", + "Cbc0010I After 11018000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.92 seconds)\n", + "Cbc0010I After 11019000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (943.96 seconds)\n", + "Cbc0010I After 11020000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (943.99 seconds)\n", + "Cbc0010I After 11021000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (944.03 seconds)\n", + "Cbc0010I After 11022000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (944.08 seconds)\n", + "Cbc0010I After 11023000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (944.13 seconds)\n", + "Cbc0010I After 11024000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (944.17 seconds)\n", + "Cbc0010I After 11025000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (944.22 seconds)\n", + "Cbc0010I After 11026000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (944.27 seconds)\n", + "Cbc0010I After 11027000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (944.35 seconds)\n", + "Cbc0010I After 11028000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (944.41 seconds)\n", + "Cbc0010I After 11029000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (944.48 seconds)\n", + "Cbc0010I After 11030000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (944.54 seconds)\n", + "Cbc0010I After 11031000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (944.59 seconds)\n", + "Cbc0010I After 11032000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (944.65 seconds)\n", + "Cbc0010I After 11033000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (944.70 seconds)\n", + "Cbc0010I After 11034000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (944.76 seconds)\n", + "Cbc0010I After 11035000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (944.80 seconds)\n", + "Cbc0010I After 11036000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (944.85 seconds)\n", + "Cbc0010I After 11037000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (944.89 seconds)\n", + "Cbc0010I After 11038000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (944.95 seconds)\n", + "Cbc0010I After 11039000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (945.00 seconds)\n", + "Cbc0010I After 11040000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (945.06 seconds)\n", + "Cbc0010I After 11041000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (945.10 seconds)\n", + "Cbc0010I After 11042000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (945.16 seconds)\n", + "Cbc0010I After 11043000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (945.21 seconds)\n", + "Cbc0010I After 11044000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (945.26 seconds)\n", + "Cbc0010I After 11045000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (945.31 seconds)\n", + "Cbc0010I After 11046000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (945.36 seconds)\n", + "Cbc0010I After 11047000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (945.42 seconds)\n", + "Cbc0010I After 11048000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (945.49 seconds)\n", + "Cbc0010I After 11049000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (945.55 seconds)\n", + "Cbc0010I After 11050000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (945.61 seconds)\n", + "Cbc0010I After 11051000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (945.67 seconds)\n", + "Cbc0010I After 11052000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (945.73 seconds)\n", + "Cbc0010I After 11053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (945.79 seconds)\n", + "Cbc0010I After 11054000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (945.84 seconds)\n", + "Cbc0010I After 11055000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (945.90 seconds)\n", + "Cbc0010I After 11056000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (945.94 seconds)\n", + "Cbc0010I After 11057000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (946.00 seconds)\n", + "Cbc0010I After 11058000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (946.05 seconds)\n", + "Cbc0010I After 11059000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (946.11 seconds)\n", + "Cbc0010I After 11060000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.17 seconds)\n", + "Cbc0010I After 11061000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.23 seconds)\n", + "Cbc0010I After 11062000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (946.28 seconds)\n", + "Cbc0010I After 11063000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (946.34 seconds)\n", + "Cbc0010I After 11064000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.40 seconds)\n", + "Cbc0010I After 11065000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.46 seconds)\n", + "Cbc0010I After 11066000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (946.53 seconds)\n", + "Cbc0010I After 11067000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (946.59 seconds)\n", + "Cbc0010I After 11068000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.65 seconds)\n", + "Cbc0010I After 11069000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (946.71 seconds)\n", + "Cbc0010I After 11070000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (946.77 seconds)\n", + "Cbc0010I After 11071000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.81 seconds)\n", + "Cbc0010I After 11072000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (946.87 seconds)\n", + "Cbc0010I After 11073000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (946.91 seconds)\n", + "Cbc0010I After 11074000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (946.96 seconds)\n", + "Cbc0010I After 11075000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (947.01 seconds)\n", + "Cbc0010I After 11076000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (947.06 seconds)\n", + "Cbc0010I After 11077000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (947.12 seconds)\n", + "Cbc0010I After 11078000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (947.17 seconds)\n", + "Cbc0010I After 11079000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (947.22 seconds)\n", + "Cbc0010I After 11080000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.28 seconds)\n", + "Cbc0010I After 11081000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (947.33 seconds)\n", + "Cbc0010I After 11082000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.38 seconds)\n", + "Cbc0010I After 11083000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (947.43 seconds)\n", + "Cbc0010I After 11084000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (947.48 seconds)\n", + "Cbc0010I After 11085000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (947.54 seconds)\n", + "Cbc0010I After 11086000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (947.60 seconds)\n", + "Cbc0010I After 11087000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (947.66 seconds)\n", + "Cbc0010I After 11088000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (947.72 seconds)\n", + "Cbc0010I After 11089000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (947.78 seconds)\n", + "Cbc0010I After 11090000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (947.86 seconds)\n", + "Cbc0010I After 11091000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.93 seconds)\n", + "Cbc0010I After 11092000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (947.99 seconds)\n", + "Cbc0010I After 11093000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (948.04 seconds)\n", + "Cbc0010I After 11094000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (948.09 seconds)\n", + "Cbc0010I After 11095000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (948.16 seconds)\n", + "Cbc0010I After 11096000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (948.22 seconds)\n", + "Cbc0010I After 11097000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (948.27 seconds)\n", + "Cbc0010I After 11098000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (948.33 seconds)\n", + "Cbc0010I After 11099000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (948.39 seconds)\n", + "Cbc0010I After 11100000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.45 seconds)\n", + "Cbc0010I After 11101000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.51 seconds)\n", + "Cbc0010I After 11102000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (948.58 seconds)\n", + "Cbc0010I After 11103000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.64 seconds)\n", + "Cbc0010I After 11104000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (948.70 seconds)\n", + "Cbc0010I After 11105000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.75 seconds)\n", + "Cbc0010I After 11106000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (948.81 seconds)\n", + "Cbc0010I After 11107000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (948.86 seconds)\n", + "Cbc0010I After 11108000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (948.90 seconds)\n", + "Cbc0010I After 11109000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (948.94 seconds)\n", + "Cbc0010I After 11110000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (948.98 seconds)\n", + "Cbc0010I After 11111000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.03 seconds)\n", + "Cbc0010I After 11112000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (949.09 seconds)\n", + "Cbc0010I After 11113000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (949.15 seconds)\n", + "Cbc0010I After 11114000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (949.20 seconds)\n", + "Cbc0010I After 11115000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (949.26 seconds)\n", + "Cbc0010I After 11116000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (949.32 seconds)\n", + "Cbc0010I After 11117000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.38 seconds)\n", + "Cbc0010I After 11118000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (949.43 seconds)\n", + "Cbc0010I After 11119000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.49 seconds)\n", + "Cbc0010I After 11120000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (949.55 seconds)\n", + "Cbc0010I After 11121000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (949.61 seconds)\n", + "Cbc0010I After 11122000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (949.67 seconds)\n", + "Cbc0010I After 11123000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.73 seconds)\n", + "Cbc0010I After 11124000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (949.78 seconds)\n", + "Cbc0010I After 11125000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (949.83 seconds)\n", + "Cbc0010I After 11126000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (949.89 seconds)\n", + "Cbc0010I After 11127000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (949.94 seconds)\n", + "Cbc0010I After 11128000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (950.00 seconds)\n", + "Cbc0010I After 11129000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (950.07 seconds)\n", + "Cbc0010I After 11130000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (950.13 seconds)\n", + "Cbc0010I After 11131000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (950.21 seconds)\n", + "Cbc0010I After 11132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (950.30 seconds)\n", + "Cbc0010I After 11133000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (950.38 seconds)\n", + "Cbc0010I After 11134000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (950.43 seconds)\n", + "Cbc0010I After 11135000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (950.49 seconds)\n", + "Cbc0010I After 11136000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (950.55 seconds)\n", + "Cbc0010I After 11137000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (950.61 seconds)\n", + "Cbc0010I After 11138000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (950.67 seconds)\n", + "Cbc0010I After 11139000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (950.73 seconds)\n", + "Cbc0010I After 11140000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (950.79 seconds)\n", + "Cbc0010I After 11141000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (950.86 seconds)\n", + "Cbc0010I After 11142000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (950.93 seconds)\n", + "Cbc0010I After 11143000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (950.99 seconds)\n", + "Cbc0010I After 11144000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (951.05 seconds)\n", + "Cbc0010I After 11145000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (951.11 seconds)\n", + "Cbc0010I After 11146000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (951.15 seconds)\n", + "Cbc0010I After 11147000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (951.20 seconds)\n", + "Cbc0010I After 11148000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.25 seconds)\n", + "Cbc0010I After 11149000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (951.29 seconds)\n", + "Cbc0010I After 11150000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.35 seconds)\n", + "Cbc0010I After 11151000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (951.42 seconds)\n", + "Cbc0010I After 11152000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (951.48 seconds)\n", + "Cbc0010I After 11153000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.56 seconds)\n", + "Cbc0010I After 11154000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (951.63 seconds)\n", + "Cbc0010I After 11155000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (951.70 seconds)\n", + "Cbc0010I After 11156000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (951.76 seconds)\n", + "Cbc0010I After 11157000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (951.82 seconds)\n", + "Cbc0010I After 11158000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (951.89 seconds)\n", + "Cbc0010I After 11159000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (951.95 seconds)\n", + "Cbc0010I After 11160000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (952.00 seconds)\n", + "Cbc0010I After 11161000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (952.06 seconds)\n", + "Cbc0010I After 11162000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (952.11 seconds)\n", + "Cbc0010I After 11163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (952.16 seconds)\n", + "Cbc0010I After 11164000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (952.22 seconds)\n", + "Cbc0010I After 11165000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (952.26 seconds)\n", + "Cbc0010I After 11166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (952.29 seconds)\n", + "Cbc0010I After 11167000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (952.33 seconds)\n", + "Cbc0010I After 11168000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (952.36 seconds)\n", + "Cbc0010I After 11169000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (952.40 seconds)\n", + "Cbc0010I After 11170000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (952.45 seconds)\n", + "Cbc0010I After 11171000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (952.50 seconds)\n", + "Cbc0010I After 11172000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (952.55 seconds)\n", + "Cbc0010I After 11173000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (952.60 seconds)\n", + "Cbc0010I After 11174000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (952.66 seconds)\n", + "Cbc0010I After 11175000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (952.71 seconds)\n", + "Cbc0010I After 11176000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (952.77 seconds)\n", + "Cbc0010I After 11177000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (952.83 seconds)\n", + "Cbc0010I After 11178000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (952.88 seconds)\n", + "Cbc0010I After 11179000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (952.93 seconds)\n", + "Cbc0010I After 11180000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (952.99 seconds)\n", + "Cbc0010I After 11181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (953.05 seconds)\n", + "Cbc0010I After 11182000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (953.11 seconds)\n", + "Cbc0010I After 11183000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (953.16 seconds)\n", + "Cbc0010I After 11184000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (953.22 seconds)\n", + "Cbc0010I After 11185000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (953.28 seconds)\n", + "Cbc0010I After 11186000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (953.33 seconds)\n", + "Cbc0010I After 11187000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (953.39 seconds)\n", + "Cbc0010I After 11188000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (953.44 seconds)\n", + "Cbc0010I After 11189000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (953.50 seconds)\n", + "Cbc0010I After 11190000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (953.55 seconds)\n", + "Cbc0010I After 11191000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (953.61 seconds)\n", + "Cbc0010I After 11192000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (953.65 seconds)\n", + "Cbc0010I After 11193000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (953.71 seconds)\n", + "Cbc0010I After 11194000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (953.77 seconds)\n", + "Cbc0010I After 11195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (953.85 seconds)\n", + "Cbc0010I After 11196000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (953.93 seconds)\n", + "Cbc0010I After 11197000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.00 seconds)\n", + "Cbc0010I After 11198000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (954.07 seconds)\n", + "Cbc0010I After 11199000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (954.12 seconds)\n", + "Cbc0010I After 11200000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (954.18 seconds)\n", + "Cbc0010I After 11201000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.23 seconds)\n", + "Cbc0010I After 11202000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (954.29 seconds)\n", + "Cbc0010I After 11203000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (954.32 seconds)\n", + "Cbc0010I After 11204000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (954.37 seconds)\n", + "Cbc0010I After 11205000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.41 seconds)\n", + "Cbc0010I After 11206000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (954.46 seconds)\n", + "Cbc0010I After 11207000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (954.49 seconds)\n", + "Cbc0010I After 11208000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (954.53 seconds)\n", + "Cbc0010I After 11209000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.56 seconds)\n", + "Cbc0010I After 11210000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (954.60 seconds)\n", + "Cbc0010I After 11211000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.63 seconds)\n", + "Cbc0010I After 11212000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.66 seconds)\n", + "Cbc0010I After 11213000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.69 seconds)\n", + "Cbc0010I After 11214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (954.74 seconds)\n", + "Cbc0010I After 11215000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.78 seconds)\n", + "Cbc0010I After 11216000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.81 seconds)\n", + "Cbc0010I After 11217000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (954.84 seconds)\n", + "Cbc0010I After 11218000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (954.87 seconds)\n", + "Cbc0010I After 11219000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (954.93 seconds)\n", + "Cbc0010I After 11220000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (954.96 seconds)\n", + "Cbc0010I After 11221000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (955.02 seconds)\n", + "Cbc0010I After 11222000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (955.07 seconds)\n", + "Cbc0010I After 11223000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (955.12 seconds)\n", + "Cbc0010I After 11224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.17 seconds)\n", + "Cbc0010I After 11225000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.25 seconds)\n", + "Cbc0010I After 11226000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (955.32 seconds)\n", + "Cbc0010I After 11227000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (955.39 seconds)\n", + "Cbc0010I After 11228000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (955.43 seconds)\n", + "Cbc0010I After 11229000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (955.47 seconds)\n", + "Cbc0010I After 11230000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (955.51 seconds)\n", + "Cbc0010I After 11231000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (955.55 seconds)\n", + "Cbc0010I After 11232000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.60 seconds)\n", + "Cbc0010I After 11233000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (955.64 seconds)\n", + "Cbc0010I After 11234000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (955.70 seconds)\n", + "Cbc0010I After 11235000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (955.77 seconds)\n", + "Cbc0010I After 11236000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (955.83 seconds)\n", + "Cbc0010I After 11237000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (955.88 seconds)\n", + "Cbc0010I After 11238000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.92 seconds)\n", + "Cbc0010I After 11239000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (955.96 seconds)\n", + "Cbc0010I After 11240000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (956.00 seconds)\n", + "Cbc0010I After 11241000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (956.03 seconds)\n", + "Cbc0010I After 11242000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (956.06 seconds)\n", + "Cbc0010I After 11243000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (956.11 seconds)\n", + "Cbc0010I After 11244000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (956.17 seconds)\n", + "Cbc0010I After 11245000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (956.22 seconds)\n", + "Cbc0010I After 11246000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.26 seconds)\n", + "Cbc0010I After 11247000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (956.31 seconds)\n", + "Cbc0010I After 11248000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (956.35 seconds)\n", + "Cbc0010I After 11249000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (956.40 seconds)\n", + "Cbc0010I After 11250000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (956.46 seconds)\n", + "Cbc0010I After 11251000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (956.52 seconds)\n", + "Cbc0010I After 11252000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (956.56 seconds)\n", + "Cbc0010I After 11253000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (956.59 seconds)\n", + "Cbc0010I After 11254000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (956.63 seconds)\n", + "Cbc0010I After 11255000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (956.67 seconds)\n", + "Cbc0010I After 11256000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (956.70 seconds)\n", + "Cbc0010I After 11257000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (956.74 seconds)\n", + "Cbc0010I After 11258000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (956.79 seconds)\n", + "Cbc0010I After 11259000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (956.83 seconds)\n", + "Cbc0010I After 11260000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.86 seconds)\n", + "Cbc0010I After 11261000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.91 seconds)\n", + "Cbc0010I After 11262000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (956.95 seconds)\n", + "Cbc0010I After 11263000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (956.99 seconds)\n", + "Cbc0010I After 11264000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (957.04 seconds)\n", + "Cbc0010I After 11265000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (957.08 seconds)\n", + "Cbc0010I After 11266000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (957.12 seconds)\n", + "Cbc0010I After 11267000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (957.15 seconds)\n", + "Cbc0010I After 11268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (957.18 seconds)\n", + "Cbc0010I After 11269000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.23 seconds)\n", + "Cbc0010I After 11270000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (957.27 seconds)\n", + "Cbc0010I After 11271000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (957.31 seconds)\n", + "Cbc0010I After 11272000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (957.36 seconds)\n", + "Cbc0010I After 11273000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (957.40 seconds)\n", + "Cbc0010I After 11274000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (957.46 seconds)\n", + "Cbc0010I After 11275000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (957.50 seconds)\n", + "Cbc0010I After 11276000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (957.56 seconds)\n", + "Cbc0010I After 11277000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (957.62 seconds)\n", + "Cbc0010I After 11278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (957.67 seconds)\n", + "Cbc0010I After 11279000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (957.73 seconds)\n", + "Cbc0010I After 11280000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.77 seconds)\n", + "Cbc0010I After 11281000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (957.83 seconds)\n", + "Cbc0010I After 11282000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.90 seconds)\n", + "Cbc0010I After 11283000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (957.96 seconds)\n", + "Cbc0010I After 11284000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (958.02 seconds)\n", + "Cbc0010I After 11285000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (958.07 seconds)\n", + "Cbc0010I After 11286000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.13 seconds)\n", + "Cbc0010I After 11287000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (958.18 seconds)\n", + "Cbc0010I After 11288000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (958.24 seconds)\n", + "Cbc0010I After 11289000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (958.30 seconds)\n", + "Cbc0010I After 11290000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (958.36 seconds)\n", + "Cbc0010I After 11291000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (958.41 seconds)\n", + "Cbc0010I After 11292000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (958.47 seconds)\n", + "Cbc0010I After 11293000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (958.52 seconds)\n", + "Cbc0010I After 11294000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.58 seconds)\n", + "Cbc0010I After 11295000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (958.63 seconds)\n", + "Cbc0010I After 11296000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (958.68 seconds)\n", + "Cbc0010I After 11297000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.73 seconds)\n", + "Cbc0010I After 11298000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (958.78 seconds)\n", + "Cbc0010I After 11299000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (958.84 seconds)\n", + "Cbc0010I After 11300000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (958.89 seconds)\n", + "Cbc0010I After 11301000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (958.95 seconds)\n", + "Cbc0010I After 11302000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (959.01 seconds)\n", + "Cbc0010I After 11303000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (959.07 seconds)\n", + "Cbc0010I After 11304000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (959.13 seconds)\n", + "Cbc0010I After 11305000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (959.19 seconds)\n", + "Cbc0010I After 11306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (959.26 seconds)\n", + "Cbc0010I After 11307000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (959.33 seconds)\n", + "Cbc0010I After 11308000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (959.38 seconds)\n", + "Cbc0010I After 11309000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (959.45 seconds)\n", + "Cbc0010I After 11310000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (959.51 seconds)\n", + "Cbc0010I After 11311000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (959.57 seconds)\n", + "Cbc0010I After 11312000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (959.62 seconds)\n", + "Cbc0010I After 11313000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (959.68 seconds)\n", + "Cbc0010I After 11314000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (959.73 seconds)\n", + "Cbc0010I After 11315000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (959.77 seconds)\n", + "Cbc0010I After 11316000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (959.86 seconds)\n", + "Cbc0010I After 11317000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (959.91 seconds)\n", + "Cbc0010I After 11318000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (959.97 seconds)\n", + "Cbc0010I After 11319000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (960.03 seconds)\n", + "Cbc0010I After 11320000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (960.08 seconds)\n", + "Cbc0010I After 11321000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.14 seconds)\n", + "Cbc0010I After 11322000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (960.20 seconds)\n", + "Cbc0010I After 11323000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (960.25 seconds)\n", + "Cbc0010I After 11324000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (960.30 seconds)\n", + "Cbc0010I After 11325000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (960.36 seconds)\n", + "Cbc0010I After 11326000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (960.42 seconds)\n", + "Cbc0010I After 11327000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.47 seconds)\n", + "Cbc0010I After 11328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (960.52 seconds)\n", + "Cbc0010I After 11329000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (960.58 seconds)\n", + "Cbc0010I After 11330000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (960.64 seconds)\n", + "Cbc0010I After 11331000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (960.69 seconds)\n", + "Cbc0010I After 11332000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (960.75 seconds)\n", + "Cbc0010I After 11333000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (960.81 seconds)\n", + "Cbc0010I After 11334000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.87 seconds)\n", + "Cbc0010I After 11335000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (960.93 seconds)\n", + "Cbc0010I After 11336000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (960.98 seconds)\n", + "Cbc0010I After 11337000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (961.04 seconds)\n", + "Cbc0010I After 11338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (961.10 seconds)\n", + "Cbc0010I After 11339000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (961.15 seconds)\n", + "Cbc0010I After 11340000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (961.21 seconds)\n", + "Cbc0010I After 11341000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (961.27 seconds)\n", + "Cbc0010I After 11342000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (961.32 seconds)\n", + "Cbc0010I After 11343000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (961.37 seconds)\n", + "Cbc0010I After 11344000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (961.45 seconds)\n", + "Cbc0010I After 11345000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (961.51 seconds)\n", + "Cbc0010I After 11346000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (961.57 seconds)\n", + "Cbc0010I After 11347000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (961.64 seconds)\n", + "Cbc0010I After 11348000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (961.70 seconds)\n", + "Cbc0010I After 11349000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (961.75 seconds)\n", + "Cbc0010I After 11350000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (961.82 seconds)\n", + "Cbc0010I After 11351000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (961.87 seconds)\n", + "Cbc0010I After 11352000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (961.93 seconds)\n", + "Cbc0010I After 11353000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (961.99 seconds)\n", + "Cbc0010I After 11354000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (962.05 seconds)\n", + "Cbc0010I After 11355000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (962.11 seconds)\n", + "Cbc0010I After 11356000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (962.16 seconds)\n", + "Cbc0010I After 11357000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (962.21 seconds)\n", + "Cbc0010I After 11358000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (962.27 seconds)\n", + "Cbc0010I After 11359000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (962.35 seconds)\n", + "Cbc0010I After 11360000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (962.43 seconds)\n", + "Cbc0010I After 11361000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (962.51 seconds)\n", + "Cbc0010I After 11362000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (962.58 seconds)\n", + "Cbc0010I After 11363000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (962.63 seconds)\n", + "Cbc0010I After 11364000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (962.68 seconds)\n", + "Cbc0010I After 11365000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (962.74 seconds)\n", + "Cbc0010I After 11366000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (962.79 seconds)\n", + "Cbc0010I After 11367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (962.84 seconds)\n", + "Cbc0010I After 11368000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (962.90 seconds)\n", + "Cbc0010I After 11369000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (962.95 seconds)\n", + "Cbc0010I After 11370000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (963.01 seconds)\n", + "Cbc0010I After 11371000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (963.07 seconds)\n", + "Cbc0010I After 11372000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (963.15 seconds)\n", + "Cbc0010I After 11373000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (963.22 seconds)\n", + "Cbc0010I After 11374000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.29 seconds)\n", + "Cbc0010I After 11375000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.35 seconds)\n", + "Cbc0010I After 11376000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (963.41 seconds)\n", + "Cbc0010I After 11377000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (963.48 seconds)\n", + "Cbc0010I After 11378000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.53 seconds)\n", + "Cbc0010I After 11379000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (963.60 seconds)\n", + "Cbc0010I After 11380000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (963.66 seconds)\n", + "Cbc0010I After 11381000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (963.73 seconds)\n", + "Cbc0010I After 11382000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (963.80 seconds)\n", + "Cbc0010I After 11383000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.87 seconds)\n", + "Cbc0010I After 11384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (963.93 seconds)\n", + "Cbc0010I After 11385000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.00 seconds)\n", + "Cbc0010I After 11386000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (964.07 seconds)\n", + "Cbc0010I After 11387000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (964.13 seconds)\n", + "Cbc0010I After 11388000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.19 seconds)\n", + "Cbc0010I After 11389000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (964.25 seconds)\n", + "Cbc0010I After 11390000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (964.30 seconds)\n", + "Cbc0010I After 11391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (964.36 seconds)\n", + "Cbc0010I After 11392000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.43 seconds)\n", + "Cbc0010I After 11393000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (964.49 seconds)\n", + "Cbc0010I After 11394000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (964.56 seconds)\n", + "Cbc0010I After 11395000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (964.63 seconds)\n", + "Cbc0010I After 11396000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (964.69 seconds)\n", + "Cbc0010I After 11397000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (964.74 seconds)\n", + "Cbc0010I After 11398000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (964.80 seconds)\n", + "Cbc0010I After 11399000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (964.86 seconds)\n", + "Cbc0010I After 11400000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (964.91 seconds)\n", + "Cbc0010I After 11401000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (964.98 seconds)\n", + "Cbc0010I After 11402000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.04 seconds)\n", + "Cbc0010I After 11403000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.12 seconds)\n", + "Cbc0010I After 11404000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (965.19 seconds)\n", + "Cbc0010I After 11405000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (965.25 seconds)\n", + "Cbc0010I After 11406000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (965.31 seconds)\n", + "Cbc0010I After 11407000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.36 seconds)\n", + "Cbc0010I After 11408000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.41 seconds)\n", + "Cbc0010I After 11409000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (965.46 seconds)\n", + "Cbc0010I After 11410000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (965.52 seconds)\n", + "Cbc0010I After 11411000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (965.57 seconds)\n", + "Cbc0010I After 11412000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (965.63 seconds)\n", + "Cbc0010I After 11413000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.69 seconds)\n", + "Cbc0010I After 11414000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.75 seconds)\n", + "Cbc0010I After 11415000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (965.80 seconds)\n", + "Cbc0010I After 11416000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (965.84 seconds)\n", + "Cbc0010I After 11417000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (965.89 seconds)\n", + "Cbc0010I After 11418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (965.94 seconds)\n", + "Cbc0010I After 11419000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (966.00 seconds)\n", + "Cbc0010I After 11420000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (966.07 seconds)\n", + "Cbc0010I After 11421000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (966.13 seconds)\n", + "Cbc0010I After 11422000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (966.16 seconds)\n", + "Cbc0010I After 11423000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (966.19 seconds)\n", + "Cbc0010I After 11424000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (966.25 seconds)\n", + "Cbc0010I After 11425000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (966.33 seconds)\n", + "Cbc0010I After 11426000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (966.40 seconds)\n", + "Cbc0010I After 11427000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (966.48 seconds)\n", + "Cbc0010I After 11428000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (966.54 seconds)\n", + "Cbc0010I After 11429000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (966.57 seconds)\n", + "Cbc0010I After 11430000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (966.60 seconds)\n", + "Cbc0010I After 11431000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (966.64 seconds)\n", + "Cbc0010I After 11432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (966.67 seconds)\n", + "Cbc0010I After 11433000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (966.74 seconds)\n", + "Cbc0010I After 11434000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (966.79 seconds)\n", + "Cbc0010I After 11435000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (966.84 seconds)\n", + "Cbc0010I After 11436000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (966.89 seconds)\n", + "Cbc0010I After 11437000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (966.93 seconds)\n", + "Cbc0010I After 11438000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (966.98 seconds)\n", + "Cbc0010I After 11439000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (967.07 seconds)\n", + "Cbc0010I After 11440000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (967.16 seconds)\n", + "Cbc0010I After 11441000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (967.20 seconds)\n", + "Cbc0010I After 11442000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (967.25 seconds)\n", + "Cbc0010I After 11443000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (967.31 seconds)\n", + "Cbc0010I After 11444000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (967.37 seconds)\n", + "Cbc0010I After 11445000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (967.45 seconds)\n", + "Cbc0010I After 11446000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (967.51 seconds)\n", + "Cbc0010I After 11447000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (967.57 seconds)\n", + "Cbc0010I After 11448000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (967.63 seconds)\n", + "Cbc0010I After 11449000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (967.68 seconds)\n", + "Cbc0010I After 11450000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (967.73 seconds)\n", + "Cbc0010I After 11451000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (967.76 seconds)\n", + "Cbc0010I After 11452000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (967.81 seconds)\n", + "Cbc0010I After 11453000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (967.85 seconds)\n", + "Cbc0010I After 11454000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (967.89 seconds)\n", + "Cbc0010I After 11455000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (967.96 seconds)\n", + "Cbc0010I After 11456000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.01 seconds)\n", + "Cbc0010I After 11457000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.05 seconds)\n", + "Cbc0010I After 11458000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (968.09 seconds)\n", + "Cbc0010I After 11459000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (968.12 seconds)\n", + "Cbc0010I After 11460000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.16 seconds)\n", + "Cbc0010I After 11461000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.20 seconds)\n", + "Cbc0010I After 11462000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.24 seconds)\n", + "Cbc0010I After 11463000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.28 seconds)\n", + "Cbc0010I After 11464000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.32 seconds)\n", + "Cbc0010I After 11465000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.35 seconds)\n", + "Cbc0010I After 11466000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.40 seconds)\n", + "Cbc0010I After 11467000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.44 seconds)\n", + "Cbc0010I After 11468000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (968.48 seconds)\n", + "Cbc0010I After 11469000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (968.52 seconds)\n", + "Cbc0010I After 11470000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.56 seconds)\n", + "Cbc0010I After 11471000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.61 seconds)\n", + "Cbc0010I After 11472000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.67 seconds)\n", + "Cbc0010I After 11473000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.72 seconds)\n", + "Cbc0010I After 11474000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.77 seconds)\n", + "Cbc0010I After 11475000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (968.83 seconds)\n", + "Cbc0010I After 11476000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.88 seconds)\n", + "Cbc0010I After 11477000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.93 seconds)\n", + "Cbc0010I After 11478000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (968.99 seconds)\n", + "Cbc0010I After 11479000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (969.04 seconds)\n", + "Cbc0010I After 11480000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (969.10 seconds)\n", + "Cbc0010I After 11481000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (969.15 seconds)\n", + "Cbc0010I After 11482000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (969.19 seconds)\n", + "Cbc0010I After 11483000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (969.23 seconds)\n", + "Cbc0010I After 11484000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (969.29 seconds)\n", + "Cbc0010I After 11485000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (969.34 seconds)\n", + "Cbc0010I After 11486000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (969.40 seconds)\n", + "Cbc0010I After 11487000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (969.45 seconds)\n", + "Cbc0010I After 11488000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (969.51 seconds)\n", + "Cbc0010I After 11489000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (969.57 seconds)\n", + "Cbc0010I After 11490000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (969.62 seconds)\n", + "Cbc0010I After 11491000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (969.67 seconds)\n", + "Cbc0010I After 11492000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (969.72 seconds)\n", + "Cbc0010I After 11493000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (969.77 seconds)\n", + "Cbc0010I After 11494000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (969.83 seconds)\n", + "Cbc0010I After 11495000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (969.88 seconds)\n", + "Cbc0010I After 11496000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (969.93 seconds)\n", + "Cbc0010I After 11497000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (969.99 seconds)\n", + "Cbc0010I After 11498000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (970.04 seconds)\n", + "Cbc0010I After 11499000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (970.10 seconds)\n", + "Cbc0010I After 11500000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (970.15 seconds)\n", + "Cbc0010I After 11501000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (970.21 seconds)\n", + "Cbc0010I After 11502000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.26 seconds)\n", + "Cbc0010I After 11503000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (970.32 seconds)\n", + "Cbc0010I After 11504000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (970.38 seconds)\n", + "Cbc0010I After 11505000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (970.44 seconds)\n", + "Cbc0010I After 11506000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (970.50 seconds)\n", + "Cbc0010I After 11507000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (970.57 seconds)\n", + "Cbc0010I After 11508000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.62 seconds)\n", + "Cbc0010I After 11509000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (970.67 seconds)\n", + "Cbc0010I After 11510000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.73 seconds)\n", + "Cbc0010I After 11511000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (970.78 seconds)\n", + "Cbc0010I After 11512000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (970.83 seconds)\n", + "Cbc0010I After 11513000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (970.89 seconds)\n", + "Cbc0010I After 11514000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (970.95 seconds)\n", + "Cbc0010I After 11515000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (971.00 seconds)\n", + "Cbc0010I After 11516000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (971.06 seconds)\n", + "Cbc0010I After 11517000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (971.11 seconds)\n", + "Cbc0010I After 11518000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (971.16 seconds)\n", + "Cbc0010I After 11519000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (971.22 seconds)\n", + "Cbc0010I After 11520000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (971.27 seconds)\n", + "Cbc0010I After 11521000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (971.34 seconds)\n", + "Cbc0010I After 11522000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (971.40 seconds)\n", + "Cbc0010I After 11523000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (971.46 seconds)\n", + "Cbc0010I After 11524000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (971.51 seconds)\n", + "Cbc0010I After 11525000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (971.55 seconds)\n", + "Cbc0010I After 11526000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (971.60 seconds)\n", + "Cbc0010I After 11527000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (971.65 seconds)\n", + "Cbc0010I After 11528000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (971.69 seconds)\n", + "Cbc0010I After 11529000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (971.75 seconds)\n", + "Cbc0010I After 11530000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (971.80 seconds)\n", + "Cbc0010I After 11531000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (971.85 seconds)\n", + "Cbc0010I After 11532000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (971.90 seconds)\n", + "Cbc0010I After 11533000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (971.95 seconds)\n", + "Cbc0010I After 11534000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (972.00 seconds)\n", + "Cbc0010I After 11535000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (972.05 seconds)\n", + "Cbc0010I After 11536000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.10 seconds)\n", + "Cbc0010I After 11537000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (972.15 seconds)\n", + "Cbc0010I After 11538000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.20 seconds)\n", + "Cbc0010I After 11539000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (972.25 seconds)\n", + "Cbc0010I After 11540000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (972.30 seconds)\n", + "Cbc0010I After 11541000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (972.35 seconds)\n", + "Cbc0010I After 11542000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (972.41 seconds)\n", + "Cbc0010I After 11543000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (972.46 seconds)\n", + "Cbc0010I After 11544000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (972.51 seconds)\n", + "Cbc0010I After 11545000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (972.57 seconds)\n", + "Cbc0010I After 11546000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.62 seconds)\n", + "Cbc0010I After 11547000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (972.67 seconds)\n", + "Cbc0010I After 11548000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (972.72 seconds)\n", + "Cbc0010I After 11549000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (972.77 seconds)\n", + "Cbc0010I After 11550000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (972.81 seconds)\n", + "Cbc0010I After 11551000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (972.85 seconds)\n", + "Cbc0010I After 11552000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (972.88 seconds)\n", + "Cbc0010I After 11553000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (972.92 seconds)\n", + "Cbc0010I After 11554000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (972.95 seconds)\n", + "Cbc0010I After 11555000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (972.99 seconds)\n", + "Cbc0010I After 11556000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.02 seconds)\n", + "Cbc0010I After 11557000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (973.10 seconds)\n", + "Cbc0010I After 11558000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (973.17 seconds)\n", + "Cbc0010I After 11559000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.22 seconds)\n", + "Cbc0010I After 11560000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.27 seconds)\n", + "Cbc0010I After 11561000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (973.31 seconds)\n", + "Cbc0010I After 11562000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (973.36 seconds)\n", + "Cbc0010I After 11563000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.40 seconds)\n", + "Cbc0010I After 11564000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (973.44 seconds)\n", + "Cbc0010I After 11565000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (973.49 seconds)\n", + "Cbc0010I After 11566000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.54 seconds)\n", + "Cbc0010I After 11567000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (973.58 seconds)\n", + "Cbc0010I After 11568000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.62 seconds)\n", + "Cbc0010I After 11569000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (973.66 seconds)\n", + "Cbc0010I After 11570000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (973.70 seconds)\n", + "Cbc0010I After 11571000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (973.74 seconds)\n", + "Cbc0010I After 11572000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (973.78 seconds)\n", + "Cbc0010I After 11573000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (973.81 seconds)\n", + "Cbc0010I After 11574000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (973.85 seconds)\n", + "Cbc0010I After 11575000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (973.89 seconds)\n", + "Cbc0010I After 11576000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (973.92 seconds)\n", + "Cbc0010I After 11577000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (973.95 seconds)\n", + "Cbc0010I After 11578000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (973.99 seconds)\n", + "Cbc0010I After 11579000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (974.03 seconds)\n", + "Cbc0010I After 11580000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (974.07 seconds)\n", + "Cbc0010I After 11581000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.11 seconds)\n", + "Cbc0010I After 11582000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (974.15 seconds)\n", + "Cbc0010I After 11583000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (974.19 seconds)\n", + "Cbc0010I After 11584000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (974.23 seconds)\n", + "Cbc0010I After 11585000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (974.27 seconds)\n", + "Cbc0010I After 11586000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (974.30 seconds)\n", + "Cbc0010I After 11587000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (974.34 seconds)\n", + "Cbc0010I After 11588000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (974.37 seconds)\n", + "Cbc0010I After 11589000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.41 seconds)\n", + "Cbc0010I After 11590000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (974.45 seconds)\n", + "Cbc0010I After 11591000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (974.50 seconds)\n", + "Cbc0010I After 11592000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (974.56 seconds)\n", + "Cbc0010I After 11593000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (974.60 seconds)\n", + "Cbc0010I After 11594000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (974.65 seconds)\n", + "Cbc0010I After 11595000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (974.69 seconds)\n", + "Cbc0010I After 11596000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (974.74 seconds)\n", + "Cbc0010I After 11597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (974.79 seconds)\n", + "Cbc0010I After 11598000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (974.85 seconds)\n", + "Cbc0010I After 11599000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.94 seconds)\n", + "Cbc0010I After 11600000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (974.99 seconds)\n", + "Cbc0010I After 11601000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (975.04 seconds)\n", + "Cbc0010I After 11602000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (975.08 seconds)\n", + "Cbc0010I After 11603000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (975.13 seconds)\n", + "Cbc0010I After 11604000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (975.18 seconds)\n", + "Cbc0010I After 11605000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (975.23 seconds)\n", + "Cbc0010I After 11606000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.26 seconds)\n", + "Cbc0010I After 11607000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (975.30 seconds)\n", + "Cbc0010I After 11608000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.33 seconds)\n", + "Cbc0010I After 11609000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (975.36 seconds)\n", + "Cbc0010I After 11610000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.42 seconds)\n", + "Cbc0010I After 11611000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (975.46 seconds)\n", + "Cbc0010I After 11612000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (975.50 seconds)\n", + "Cbc0010I After 11613000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (975.54 seconds)\n", + "Cbc0010I After 11614000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (975.57 seconds)\n", + "Cbc0010I After 11615000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (975.62 seconds)\n", + "Cbc0010I After 11616000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.65 seconds)\n", + "Cbc0010I After 11617000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (975.70 seconds)\n", + "Cbc0010I After 11618000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (975.74 seconds)\n", + "Cbc0010I After 11619000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (975.77 seconds)\n", + "Cbc0010I After 11620000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.82 seconds)\n", + "Cbc0010I After 11621000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (975.87 seconds)\n", + "Cbc0010I After 11622000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.92 seconds)\n", + "Cbc0010I After 11623000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (975.97 seconds)\n", + "Cbc0010I After 11624000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (976.01 seconds)\n", + "Cbc0010I After 11625000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (976.06 seconds)\n", + "Cbc0010I After 11626000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (976.10 seconds)\n", + "Cbc0010I After 11627000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (976.15 seconds)\n", + "Cbc0010I After 11628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.19 seconds)\n", + "Cbc0010I After 11629000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (976.24 seconds)\n", + "Cbc0010I After 11630000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.28 seconds)\n", + "Cbc0010I After 11631000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (976.34 seconds)\n", + "Cbc0010I After 11632000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (976.40 seconds)\n", + "Cbc0010I After 11633000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (976.45 seconds)\n", + "Cbc0010I After 11634000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (976.50 seconds)\n", + "Cbc0010I After 11635000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (976.54 seconds)\n", + "Cbc0010I After 11636000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (976.59 seconds)\n", + "Cbc0010I After 11637000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (976.64 seconds)\n", + "Cbc0010I After 11638000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (976.69 seconds)\n", + "Cbc0010I After 11639000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.74 seconds)\n", + "Cbc0010I After 11640000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (976.78 seconds)\n", + "Cbc0010I After 11641000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.82 seconds)\n", + "Cbc0010I After 11642000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (976.86 seconds)\n", + "Cbc0010I After 11643000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (976.90 seconds)\n", + "Cbc0010I After 11644000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (976.95 seconds)\n", + "Cbc0010I After 11645000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (976.99 seconds)\n", + "Cbc0010I After 11646000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (977.03 seconds)\n", + "Cbc0010I After 11647000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (977.07 seconds)\n", + "Cbc0010I After 11648000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (977.13 seconds)\n", + "Cbc0010I After 11649000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (977.19 seconds)\n", + "Cbc0010I After 11650000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (977.25 seconds)\n", + "Cbc0010I After 11651000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (977.30 seconds)\n", + "Cbc0010I After 11652000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (977.35 seconds)\n", + "Cbc0010I After 11653000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (977.40 seconds)\n", + "Cbc0010I After 11654000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (977.45 seconds)\n", + "Cbc0010I After 11655000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.50 seconds)\n", + "Cbc0010I After 11656000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (977.55 seconds)\n", + "Cbc0010I After 11657000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.61 seconds)\n", + "Cbc0010I After 11658000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (977.67 seconds)\n", + "Cbc0010I After 11659000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (977.73 seconds)\n", + "Cbc0010I After 11660000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (977.78 seconds)\n", + "Cbc0010I After 11661000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (977.84 seconds)\n", + "Cbc0010I After 11662000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (977.89 seconds)\n", + "Cbc0010I After 11663000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.94 seconds)\n", + "Cbc0010I After 11664000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (978.00 seconds)\n", + "Cbc0010I After 11665000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (978.05 seconds)\n", + "Cbc0010I After 11666000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (978.09 seconds)\n", + "Cbc0010I After 11667000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (978.13 seconds)\n", + "Cbc0010I After 11668000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (978.18 seconds)\n", + "Cbc0010I After 11669000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (978.22 seconds)\n", + "Cbc0010I After 11670000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (978.27 seconds)\n", + "Cbc0010I After 11671000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (978.31 seconds)\n", + "Cbc0010I After 11672000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (978.36 seconds)\n", + "Cbc0010I After 11673000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (978.42 seconds)\n", + "Cbc0010I After 11674000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (978.46 seconds)\n", + "Cbc0010I After 11675000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (978.52 seconds)\n", + "Cbc0010I After 11676000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (978.57 seconds)\n", + "Cbc0010I After 11677000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (978.62 seconds)\n", + "Cbc0010I After 11678000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (978.67 seconds)\n", + "Cbc0010I After 11679000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (978.73 seconds)\n", + "Cbc0010I After 11680000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (978.78 seconds)\n", + "Cbc0010I After 11681000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (978.84 seconds)\n", + "Cbc0010I After 11682000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (978.90 seconds)\n", + "Cbc0010I After 11683000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (978.96 seconds)\n", + "Cbc0010I After 11684000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (979.01 seconds)\n", + "Cbc0010I After 11685000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (979.07 seconds)\n", + "Cbc0010I After 11686000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.13 seconds)\n", + "Cbc0010I After 11687000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (979.19 seconds)\n", + "Cbc0010I After 11688000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (979.24 seconds)\n", + "Cbc0010I After 11689000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (979.30 seconds)\n", + "Cbc0010I After 11690000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (979.35 seconds)\n", + "Cbc0010I After 11691000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (979.41 seconds)\n", + "Cbc0010I After 11692000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (979.47 seconds)\n", + "Cbc0010I After 11693000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (979.53 seconds)\n", + "Cbc0010I After 11694000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (979.58 seconds)\n", + "Cbc0010I After 11695000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (979.63 seconds)\n", + "Cbc0010I After 11696000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (979.69 seconds)\n", + "Cbc0010I After 11697000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (979.74 seconds)\n", + "Cbc0010I After 11698000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (979.79 seconds)\n", + "Cbc0010I After 11699000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.84 seconds)\n", + "Cbc0010I After 11700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (979.89 seconds)\n", + "Cbc0010I After 11701000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.93 seconds)\n", + "Cbc0010I After 11702000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (979.99 seconds)\n", + "Cbc0010I After 11703000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (980.05 seconds)\n", + "Cbc0010I After 11704000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (980.11 seconds)\n", + "Cbc0010I After 11705000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (980.17 seconds)\n", + "Cbc0010I After 11706000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.23 seconds)\n", + "Cbc0010I After 11707000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.29 seconds)\n", + "Cbc0010I After 11708000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (980.37 seconds)\n", + "Cbc0010I After 11709000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (980.42 seconds)\n", + "Cbc0010I After 11710000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (980.49 seconds)\n", + "Cbc0010I After 11711000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.55 seconds)\n", + "Cbc0010I After 11712000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (980.60 seconds)\n", + "Cbc0010I After 11713000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (980.66 seconds)\n", + "Cbc0010I After 11714000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (980.72 seconds)\n", + "Cbc0010I After 11715000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.78 seconds)\n", + "Cbc0010I After 11716000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (980.83 seconds)\n", + "Cbc0010I After 11717000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.88 seconds)\n", + "Cbc0010I After 11718000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.94 seconds)\n", + "Cbc0010I After 11719000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (980.99 seconds)\n", + "Cbc0010I After 11720000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.04 seconds)\n", + "Cbc0010I After 11721000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.09 seconds)\n", + "Cbc0010I After 11722000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (981.14 seconds)\n", + "Cbc0010I After 11723000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (981.19 seconds)\n", + "Cbc0010I After 11724000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (981.26 seconds)\n", + "Cbc0010I After 11725000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.32 seconds)\n", + "Cbc0010I After 11726000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.38 seconds)\n", + "Cbc0010I After 11727000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (981.43 seconds)\n", + "Cbc0010I After 11728000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.49 seconds)\n", + "Cbc0010I After 11729000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (981.55 seconds)\n", + "Cbc0010I After 11730000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.60 seconds)\n", + "Cbc0010I After 11731000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (981.64 seconds)\n", + "Cbc0010I After 11732000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (981.70 seconds)\n", + "Cbc0010I After 11733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.76 seconds)\n", + "Cbc0010I After 11734000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.82 seconds)\n", + "Cbc0010I After 11735000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.87 seconds)\n", + "Cbc0010I After 11736000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.93 seconds)\n", + "Cbc0010I After 11737000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.99 seconds)\n", + "Cbc0010I After 11738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (982.05 seconds)\n", + "Cbc0010I After 11739000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (982.12 seconds)\n", + "Cbc0010I After 11740000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (982.18 seconds)\n", + "Cbc0010I After 11741000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (982.23 seconds)\n", + "Cbc0010I After 11742000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (982.31 seconds)\n", + "Cbc0010I After 11743000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (982.36 seconds)\n", + "Cbc0010I After 11744000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.42 seconds)\n", + "Cbc0010I After 11745000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (982.48 seconds)\n", + "Cbc0010I After 11746000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (982.54 seconds)\n", + "Cbc0010I After 11747000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (982.60 seconds)\n", + "Cbc0010I After 11748000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.66 seconds)\n", + "Cbc0010I After 11749000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (982.73 seconds)\n", + "Cbc0010I After 11750000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (982.79 seconds)\n", + "Cbc0010I After 11751000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.85 seconds)\n", + "Cbc0010I After 11752000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (982.91 seconds)\n", + "Cbc0010I After 11753000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (982.98 seconds)\n", + "Cbc0010I After 11754000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (983.03 seconds)\n", + "Cbc0010I After 11755000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.09 seconds)\n", + "Cbc0010I After 11756000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (983.15 seconds)\n", + "Cbc0010I After 11757000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (983.21 seconds)\n", + "Cbc0010I After 11758000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (983.26 seconds)\n", + "Cbc0010I After 11759000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (983.32 seconds)\n", + "Cbc0010I After 11760000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (983.37 seconds)\n", + "Cbc0010I After 11761000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (983.42 seconds)\n", + "Cbc0010I After 11762000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.47 seconds)\n", + "Cbc0010I After 11763000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (983.52 seconds)\n", + "Cbc0010I After 11764000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (983.57 seconds)\n", + "Cbc0010I After 11765000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (983.62 seconds)\n", + "Cbc0010I After 11766000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (983.66 seconds)\n", + "Cbc0010I After 11767000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (983.71 seconds)\n", + "Cbc0010I After 11768000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (983.77 seconds)\n", + "Cbc0010I After 11769000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.83 seconds)\n", + "Cbc0010I After 11770000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (983.89 seconds)\n", + "Cbc0010I After 11771000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (983.94 seconds)\n", + "Cbc0010I After 11772000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (984.01 seconds)\n", + "Cbc0010I After 11773000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (984.10 seconds)\n", + "Cbc0010I After 11774000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (984.18 seconds)\n", + "Cbc0010I After 11775000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (984.25 seconds)\n", + "Cbc0010I After 11776000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (984.31 seconds)\n", + "Cbc0010I After 11777000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (984.37 seconds)\n", + "Cbc0010I After 11778000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (984.44 seconds)\n", + "Cbc0010I After 11779000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (984.49 seconds)\n", + "Cbc0010I After 11780000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (984.55 seconds)\n", + "Cbc0010I After 11781000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (984.60 seconds)\n", + "Cbc0010I After 11782000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (984.66 seconds)\n", + "Cbc0010I After 11783000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (984.72 seconds)\n", + "Cbc0010I After 11784000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (984.77 seconds)\n", + "Cbc0010I After 11785000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (984.83 seconds)\n", + "Cbc0010I After 11786000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (984.89 seconds)\n", + "Cbc0010I After 11787000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (984.94 seconds)\n", + "Cbc0010I After 11788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (985.00 seconds)\n", + "Cbc0010I After 11789000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.05 seconds)\n", + "Cbc0010I After 11790000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (985.11 seconds)\n", + "Cbc0010I After 11791000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.17 seconds)\n", + "Cbc0010I After 11792000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (985.22 seconds)\n", + "Cbc0010I After 11793000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (985.28 seconds)\n", + "Cbc0010I After 11794000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (985.34 seconds)\n", + "Cbc0010I After 11795000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (985.40 seconds)\n", + "Cbc0010I After 11796000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (985.46 seconds)\n", + "Cbc0010I After 11797000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (985.51 seconds)\n", + "Cbc0010I After 11798000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (985.57 seconds)\n", + "Cbc0010I After 11799000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (985.64 seconds)\n", + "Cbc0010I After 11800000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (985.70 seconds)\n", + "Cbc0010I After 11801000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (985.76 seconds)\n", + "Cbc0010I After 11802000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (985.81 seconds)\n", + "Cbc0010I After 11803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.88 seconds)\n", + "Cbc0010I After 11804000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (985.93 seconds)\n", + "Cbc0010I After 11805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (985.99 seconds)\n", + "Cbc0010I After 11806000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (986.05 seconds)\n", + "Cbc0010I After 11807000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.11 seconds)\n", + "Cbc0010I After 11808000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.17 seconds)\n", + "Cbc0010I After 11809000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.23 seconds)\n", + "Cbc0010I After 11810000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (986.28 seconds)\n", + "Cbc0010I After 11811000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.33 seconds)\n", + "Cbc0010I After 11812000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (986.38 seconds)\n", + "Cbc0010I After 11813000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.43 seconds)\n", + "Cbc0010I After 11814000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (986.50 seconds)\n", + "Cbc0010I After 11815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (986.55 seconds)\n", + "Cbc0010I After 11816000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.60 seconds)\n", + "Cbc0010I After 11817000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (986.67 seconds)\n", + "Cbc0010I After 11818000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (986.73 seconds)\n", + "Cbc0010I After 11819000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (986.78 seconds)\n", + "Cbc0010I After 11820000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (986.85 seconds)\n", + "Cbc0010I After 11821000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (986.91 seconds)\n", + "Cbc0010I After 11822000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (986.96 seconds)\n", + "Cbc0010I After 11823000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (987.02 seconds)\n", + "Cbc0010I After 11824000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (987.07 seconds)\n", + "Cbc0010I After 11825000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (987.13 seconds)\n", + "Cbc0010I After 11826000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (987.19 seconds)\n", + "Cbc0010I After 11827000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (987.26 seconds)\n", + "Cbc0010I After 11828000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (987.32 seconds)\n", + "Cbc0010I After 11829000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.38 seconds)\n", + "Cbc0010I After 11830000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (987.44 seconds)\n", + "Cbc0010I After 11831000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (987.51 seconds)\n", + "Cbc0010I After 11832000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (987.56 seconds)\n", + "Cbc0010I After 11833000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (987.62 seconds)\n", + "Cbc0010I After 11834000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.68 seconds)\n", + "Cbc0010I After 11835000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.74 seconds)\n", + "Cbc0010I After 11836000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (987.80 seconds)\n", + "Cbc0010I After 11837000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (987.88 seconds)\n", + "Cbc0010I After 11838000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (987.93 seconds)\n", + "Cbc0010I After 11839000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (987.99 seconds)\n", + "Cbc0010I After 11840000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (988.06 seconds)\n", + "Cbc0010I After 11841000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (988.13 seconds)\n", + "Cbc0010I After 11842000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.19 seconds)\n", + "Cbc0010I After 11843000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (988.26 seconds)\n", + "Cbc0010I After 11844000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (988.32 seconds)\n", + "Cbc0010I After 11845000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (988.38 seconds)\n", + "Cbc0010I After 11846000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.44 seconds)\n", + "Cbc0010I After 11847000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (988.50 seconds)\n", + "Cbc0010I After 11848000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (988.56 seconds)\n", + "Cbc0010I After 11849000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (988.62 seconds)\n", + "Cbc0010I After 11850000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (988.70 seconds)\n", + "Cbc0010I After 11851000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (988.79 seconds)\n", + "Cbc0010I After 11852000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (988.88 seconds)\n", + "Cbc0010I After 11853000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.97 seconds)\n", + "Cbc0010I After 11854000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (989.04 seconds)\n", + "Cbc0010I After 11855000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (989.11 seconds)\n", + "Cbc0010I After 11856000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (989.18 seconds)\n", + "Cbc0010I After 11857000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (989.24 seconds)\n", + "Cbc0010I After 11858000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (989.31 seconds)\n", + "Cbc0010I After 11859000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (989.37 seconds)\n", + "Cbc0010I After 11860000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (989.43 seconds)\n", + "Cbc0010I After 11861000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (989.49 seconds)\n", + "Cbc0010I After 11862000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (989.55 seconds)\n", + "Cbc0010I After 11863000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.61 seconds)\n", + "Cbc0010I After 11864000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (989.66 seconds)\n", + "Cbc0010I After 11865000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (989.72 seconds)\n", + "Cbc0010I After 11866000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (989.77 seconds)\n", + "Cbc0010I After 11867000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.83 seconds)\n", + "Cbc0010I After 11868000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (989.88 seconds)\n", + "Cbc0010I After 11869000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.94 seconds)\n", + "Cbc0010I After 11870000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (990.00 seconds)\n", + "Cbc0010I After 11871000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (990.07 seconds)\n", + "Cbc0010I After 11872000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (990.13 seconds)\n", + "Cbc0010I After 11873000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (990.20 seconds)\n", + "Cbc0010I After 11874000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (990.26 seconds)\n", + "Cbc0010I After 11875000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (990.33 seconds)\n", + "Cbc0010I After 11876000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (990.39 seconds)\n", + "Cbc0010I After 11877000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (990.45 seconds)\n", + "Cbc0010I After 11878000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (990.51 seconds)\n", + "Cbc0010I After 11879000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (990.56 seconds)\n", + "Cbc0010I After 11880000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (990.62 seconds)\n", + "Cbc0010I After 11881000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (990.68 seconds)\n", + "Cbc0010I After 11882000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (990.74 seconds)\n", + "Cbc0010I After 11883000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (990.80 seconds)\n", + "Cbc0010I After 11884000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (990.86 seconds)\n", + "Cbc0010I After 11885000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (990.92 seconds)\n", + "Cbc0010I After 11886000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (990.97 seconds)\n", + "Cbc0010I After 11887000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (991.05 seconds)\n", + "Cbc0010I After 11888000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (991.11 seconds)\n", + "Cbc0010I After 11889000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (991.16 seconds)\n", + "Cbc0010I After 11890000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (991.23 seconds)\n", + "Cbc0010I After 11891000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (991.29 seconds)\n", + "Cbc0010I After 11892000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (991.34 seconds)\n", + "Cbc0010I After 11893000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (991.48 seconds)\n", + "Cbc0010I After 11894000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (991.55 seconds)\n", + "Cbc0010I After 11895000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (991.61 seconds)\n", + "Cbc0010I After 11896000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (991.67 seconds)\n", + "Cbc0010I After 11897000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (991.73 seconds)\n", + "Cbc0010I After 11898000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (991.79 seconds)\n", + "Cbc0010I After 11899000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (991.86 seconds)\n", + "Cbc0010I After 11900000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (991.92 seconds)\n", + "Cbc0010I After 11901000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (991.98 seconds)\n", + "Cbc0010I After 11902000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.04 seconds)\n", + "Cbc0010I After 11903000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (992.10 seconds)\n", + "Cbc0010I After 11904000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (992.16 seconds)\n", + "Cbc0010I After 11905000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.22 seconds)\n", + "Cbc0010I After 11906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (992.28 seconds)\n", + "Cbc0010I After 11907000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (992.34 seconds)\n", + "Cbc0010I After 11908000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (992.40 seconds)\n", + "Cbc0010I After 11909000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.46 seconds)\n", + "Cbc0010I After 11910000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (992.51 seconds)\n", + "Cbc0010I After 11911000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (992.57 seconds)\n", + "Cbc0010I After 11912000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (992.63 seconds)\n", + "Cbc0010I After 11913000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (992.69 seconds)\n", + "Cbc0010I After 11914000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (992.75 seconds)\n", + "Cbc0010I After 11915000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (992.80 seconds)\n", + "Cbc0010I After 11916000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.87 seconds)\n", + "Cbc0010I After 11917000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (992.92 seconds)\n", + "Cbc0010I After 11918000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (992.98 seconds)\n", + "Cbc0010I After 11919000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.03 seconds)\n", + "Cbc0010I After 11920000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (993.09 seconds)\n", + "Cbc0010I After 11921000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (993.15 seconds)\n", + "Cbc0010I After 11922000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (993.20 seconds)\n", + "Cbc0010I After 11923000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (993.25 seconds)\n", + "Cbc0010I After 11924000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (993.31 seconds)\n", + "Cbc0010I After 11925000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.37 seconds)\n", + "Cbc0010I After 11926000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (993.43 seconds)\n", + "Cbc0010I After 11927000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (993.49 seconds)\n", + "Cbc0010I After 11928000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (993.54 seconds)\n", + "Cbc0010I After 11929000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (993.59 seconds)\n", + "Cbc0010I After 11930000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (993.64 seconds)\n", + "Cbc0010I After 11931000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (993.69 seconds)\n", + "Cbc0010I After 11932000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (993.74 seconds)\n", + "Cbc0010I After 11933000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (993.79 seconds)\n", + "Cbc0010I After 11934000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (993.84 seconds)\n", + "Cbc0010I After 11935000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (993.88 seconds)\n", + "Cbc0010I After 11936000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.92 seconds)\n", + "Cbc0010I After 11937000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (993.96 seconds)\n", + "Cbc0010I After 11938000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (994.03 seconds)\n", + "Cbc0010I After 11939000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (994.08 seconds)\n", + "Cbc0010I After 11940000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (994.15 seconds)\n", + "Cbc0010I After 11941000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (994.21 seconds)\n", + "Cbc0010I After 11942000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (994.28 seconds)\n", + "Cbc0010I After 11943000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (994.33 seconds)\n", + "Cbc0010I After 11944000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (994.40 seconds)\n", + "Cbc0010I After 11945000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (994.46 seconds)\n", + "Cbc0010I After 11946000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (994.53 seconds)\n", + "Cbc0010I After 11947000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (994.59 seconds)\n", + "Cbc0010I After 11948000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (994.65 seconds)\n", + "Cbc0010I After 11949000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (994.71 seconds)\n", + "Cbc0010I After 11950000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (994.76 seconds)\n", + "Cbc0010I After 11951000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (994.82 seconds)\n", + "Cbc0010I After 11952000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (994.89 seconds)\n", + "Cbc0010I After 11953000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (994.94 seconds)\n", + "Cbc0010I After 11954000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (995.01 seconds)\n", + "Cbc0010I After 11955000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (995.06 seconds)\n", + "Cbc0010I After 11956000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (995.12 seconds)\n", + "Cbc0010I After 11957000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (995.18 seconds)\n", + "Cbc0010I After 11958000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (995.23 seconds)\n", + "Cbc0010I After 11959000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (995.29 seconds)\n", + "Cbc0010I After 11960000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.34 seconds)\n", + "Cbc0010I After 11961000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (995.40 seconds)\n", + "Cbc0010I After 11962000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (995.46 seconds)\n", + "Cbc0010I After 11963000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (995.52 seconds)\n", + "Cbc0010I After 11964000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (995.57 seconds)\n", + "Cbc0010I After 11965000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (995.64 seconds)\n", + "Cbc0010I After 11966000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (995.71 seconds)\n", + "Cbc0010I After 11967000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (995.77 seconds)\n", + "Cbc0010I After 11968000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.83 seconds)\n", + "Cbc0010I After 11969000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.90 seconds)\n", + "Cbc0010I After 11970000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (995.96 seconds)\n", + "Cbc0010I After 11971000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (996.01 seconds)\n", + "Cbc0010I After 11972000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (996.07 seconds)\n", + "Cbc0010I After 11973000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (996.13 seconds)\n", + "Cbc0010I After 11974000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (996.18 seconds)\n", + "Cbc0010I After 11975000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (996.24 seconds)\n", + "Cbc0010I After 11976000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (996.29 seconds)\n", + "Cbc0010I After 11977000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (996.36 seconds)\n", + "Cbc0010I After 11978000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (996.42 seconds)\n", + "Cbc0010I After 11979000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (996.48 seconds)\n", + "Cbc0010I After 11980000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (996.54 seconds)\n", + "Cbc0010I After 11981000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (996.60 seconds)\n", + "Cbc0010I After 11982000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (996.66 seconds)\n", + "Cbc0010I After 11983000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (996.72 seconds)\n", + "Cbc0010I After 11984000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (996.78 seconds)\n", + "Cbc0010I After 11985000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (996.82 seconds)\n", + "Cbc0010I After 11986000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (996.88 seconds)\n", + "Cbc0010I After 11987000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (996.94 seconds)\n", + "Cbc0010I After 11988000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (997.00 seconds)\n", + "Cbc0010I After 11989000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (997.06 seconds)\n", + "Cbc0010I After 11990000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (997.13 seconds)\n", + "Cbc0010I After 11991000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.19 seconds)\n", + "Cbc0010I After 11992000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (997.25 seconds)\n", + "Cbc0010I After 11993000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (997.31 seconds)\n", + "Cbc0010I After 11994000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (997.37 seconds)\n", + "Cbc0010I After 11995000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.43 seconds)\n", + "Cbc0010I After 11996000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (997.48 seconds)\n", + "Cbc0010I After 11997000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (997.55 seconds)\n", + "Cbc0010I After 11998000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.60 seconds)\n", + "Cbc0010I After 11999000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (997.65 seconds)\n", + "Cbc0010I After 12000000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (997.71 seconds)\n", + "Cbc0010I After 12001000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (997.77 seconds)\n", + "Cbc0010I After 12002000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.83 seconds)\n", + "Cbc0010I After 12003000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (997.91 seconds)\n", + "Cbc0010I After 12004000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (997.98 seconds)\n", + "Cbc0010I After 12005000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (998.05 seconds)\n", + "Cbc0010I After 12006000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (998.13 seconds)\n", + "Cbc0010I After 12007000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (998.19 seconds)\n", + "Cbc0010I After 12008000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (998.26 seconds)\n", + "Cbc0010I After 12009000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.32 seconds)\n", + "Cbc0010I After 12010000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.37 seconds)\n", + "Cbc0010I After 12011000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (998.43 seconds)\n", + "Cbc0010I After 12012000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (998.49 seconds)\n", + "Cbc0010I After 12013000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (998.54 seconds)\n", + "Cbc0010I After 12014000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (998.59 seconds)\n", + "Cbc0010I After 12015000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.64 seconds)\n", + "Cbc0010I After 12016000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (998.70 seconds)\n", + "Cbc0010I After 12017000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.75 seconds)\n", + "Cbc0010I After 12018000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (998.79 seconds)\n", + "Cbc0010I After 12019000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (998.86 seconds)\n", + "Cbc0010I After 12020000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (998.92 seconds)\n", + "Cbc0010I After 12021000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (998.98 seconds)\n", + "Cbc0010I After 12022000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (999.06 seconds)\n", + "Cbc0010I After 12023000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (999.11 seconds)\n", + "Cbc0010I After 12024000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (999.18 seconds)\n", + "Cbc0010I After 12025000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (999.24 seconds)\n", + "Cbc0010I After 12026000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (999.30 seconds)\n", + "Cbc0010I After 12027000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (999.36 seconds)\n", + "Cbc0010I After 12028000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (999.43 seconds)\n", + "Cbc0010I After 12029000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (999.49 seconds)\n", + "Cbc0010I After 12030000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (999.56 seconds)\n", + "Cbc0010I After 12031000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (999.61 seconds)\n", + "Cbc0010I After 12032000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (999.69 seconds)\n", + "Cbc0010I After 12033000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (999.73 seconds)\n", + "Cbc0010I After 12034000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (999.81 seconds)\n", + "Cbc0010I After 12035000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (999.86 seconds)\n", + "Cbc0010I After 12036000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (999.93 seconds)\n", + "Cbc0010I After 12037000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (999.98 seconds)\n", + "Cbc0010I After 12038000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1000.05 seconds)\n", + "Cbc0010I After 12039000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1000.11 seconds)\n", + "Cbc0010I After 12040000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1000.17 seconds)\n", + "Cbc0010I After 12041000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1000.24 seconds)\n", + "Cbc0010I After 12042000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1000.30 seconds)\n", + "Cbc0010I After 12043000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1000.36 seconds)\n", + "Cbc0010I After 12044000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1000.41 seconds)\n", + "Cbc0010I After 12045000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1000.48 seconds)\n", + "Cbc0010I After 12046000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1000.53 seconds)\n", + "Cbc0010I After 12047000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1000.59 seconds)\n", + "Cbc0010I After 12048000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1000.65 seconds)\n", + "Cbc0010I After 12049000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1000.70 seconds)\n", + "Cbc0010I After 12050000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1000.77 seconds)\n", + "Cbc0010I After 12051000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1000.81 seconds)\n", + "Cbc0010I After 12052000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1000.88 seconds)\n", + "Cbc0010I After 12053000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1000.93 seconds)\n", + "Cbc0010I After 12054000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1001.00 seconds)\n", + "Cbc0010I After 12055000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1001.06 seconds)\n", + "Cbc0010I After 12056000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1001.13 seconds)\n", + "Cbc0010I After 12057000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1001.20 seconds)\n", + "Cbc0010I After 12058000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1001.25 seconds)\n", + "Cbc0010I After 12059000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1001.31 seconds)\n", + "Cbc0010I After 12060000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1001.37 seconds)\n", + "Cbc0010I After 12061000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1001.44 seconds)\n", + "Cbc0010I After 12062000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1001.50 seconds)\n", + "Cbc0010I After 12063000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1001.55 seconds)\n", + "Cbc0010I After 12064000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1001.62 seconds)\n", + "Cbc0010I After 12065000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1001.68 seconds)\n", + "Cbc0010I After 12066000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.76 seconds)\n", + "Cbc0010I After 12067000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.81 seconds)\n", + "Cbc0010I After 12068000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1001.88 seconds)\n", + "Cbc0010I After 12069000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.94 seconds)\n", + "Cbc0010I After 12070000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1002.01 seconds)\n", + "Cbc0010I After 12071000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1002.08 seconds)\n", + "Cbc0010I After 12072000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1002.16 seconds)\n", + "Cbc0010I After 12073000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1002.22 seconds)\n", + "Cbc0010I After 12074000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1002.29 seconds)\n", + "Cbc0010I After 12075000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1002.34 seconds)\n", + "Cbc0010I After 12076000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1002.40 seconds)\n", + "Cbc0010I After 12077000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1002.45 seconds)\n", + "Cbc0010I After 12078000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1002.51 seconds)\n", + "Cbc0010I After 12079000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1002.57 seconds)\n", + "Cbc0010I After 12080000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1002.64 seconds)\n", + "Cbc0010I After 12081000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1002.69 seconds)\n", + "Cbc0010I After 12082000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1002.76 seconds)\n", + "Cbc0010I After 12083000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1002.81 seconds)\n", + "Cbc0010I After 12084000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1002.88 seconds)\n", + "Cbc0010I After 12085000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1002.94 seconds)\n", + "Cbc0010I After 12086000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1003.00 seconds)\n", + "Cbc0010I After 12087000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1003.06 seconds)\n", + "Cbc0010I After 12088000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.11 seconds)\n", + "Cbc0010I After 12089000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1003.18 seconds)\n", + "Cbc0010I After 12090000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1003.23 seconds)\n", + "Cbc0010I After 12091000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1003.30 seconds)\n", + "Cbc0010I After 12092000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.35 seconds)\n", + "Cbc0010I After 12093000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.41 seconds)\n", + "Cbc0010I After 12094000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1003.47 seconds)\n", + "Cbc0010I After 12095000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1003.53 seconds)\n", + "Cbc0010I After 12096000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.58 seconds)\n", + "Cbc0010I After 12097000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.64 seconds)\n", + "Cbc0010I After 12098000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1003.70 seconds)\n", + "Cbc0010I After 12099000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1003.75 seconds)\n", + "Cbc0010I After 12100000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1003.81 seconds)\n", + "Cbc0010I After 12101000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.87 seconds)\n", + "Cbc0010I After 12102000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1003.92 seconds)\n", + "Cbc0010I After 12103000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1003.99 seconds)\n", + "Cbc0010I After 12104000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1004.05 seconds)\n", + "Cbc0010I After 12105000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1004.11 seconds)\n", + "Cbc0010I After 12106000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1004.16 seconds)\n", + "Cbc0010I After 12107000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1004.21 seconds)\n", + "Cbc0010I After 12108000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1004.27 seconds)\n", + "Cbc0010I After 12109000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1004.33 seconds)\n", + "Cbc0010I After 12110000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1004.39 seconds)\n", + "Cbc0010I After 12111000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1004.44 seconds)\n", + "Cbc0010I After 12112000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1004.50 seconds)\n", + "Cbc0010I After 12113000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1004.55 seconds)\n", + "Cbc0010I After 12114000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1004.60 seconds)\n", + "Cbc0010I After 12115000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1004.65 seconds)\n", + "Cbc0010I After 12116000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1004.71 seconds)\n", + "Cbc0010I After 12117000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1004.76 seconds)\n", + "Cbc0010I After 12118000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1004.82 seconds)\n", + "Cbc0010I After 12119000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1004.87 seconds)\n", + "Cbc0010I After 12120000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1004.93 seconds)\n", + "Cbc0010I After 12121000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1004.97 seconds)\n", + "Cbc0010I After 12122000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1005.00 seconds)\n", + "Cbc0010I After 12123000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1005.04 seconds)\n", + "Cbc0010I After 12124000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1005.08 seconds)\n", + "Cbc0010I After 12125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1005.11 seconds)\n", + "Cbc0010I After 12126000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1005.15 seconds)\n", + "Cbc0010I After 12127000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1005.20 seconds)\n", + "Cbc0010I After 12128000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1005.23 seconds)\n", + "Cbc0010I After 12129000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1005.26 seconds)\n", + "Cbc0010I After 12130000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1005.32 seconds)\n", + "Cbc0010I After 12131000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1005.38 seconds)\n", + "Cbc0010I After 12132000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1005.45 seconds)\n", + "Cbc0010I After 12133000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1005.50 seconds)\n", + "Cbc0010I After 12134000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1005.57 seconds)\n", + "Cbc0010I After 12135000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1005.62 seconds)\n", + "Cbc0010I After 12136000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1005.68 seconds)\n", + "Cbc0010I After 12137000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1005.71 seconds)\n", + "Cbc0010I After 12138000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1005.74 seconds)\n", + "Cbc0010I After 12139000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1005.78 seconds)\n", + "Cbc0010I After 12140000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1005.82 seconds)\n", + "Cbc0010I After 12141000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1005.85 seconds)\n", + "Cbc0010I After 12142000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1005.88 seconds)\n", + "Cbc0010I After 12143000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1005.91 seconds)\n", + "Cbc0010I After 12144000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1005.95 seconds)\n", + "Cbc0010I After 12145000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1005.98 seconds)\n", + "Cbc0010I After 12146000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1006.01 seconds)\n", + "Cbc0010I After 12147000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1006.09 seconds)\n", + "Cbc0010I After 12148000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1006.15 seconds)\n", + "Cbc0010I After 12149000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1006.20 seconds)\n", + "Cbc0010I After 12150000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1006.25 seconds)\n", + "Cbc0010I After 12151000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1006.30 seconds)\n", + "Cbc0010I After 12152000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1006.34 seconds)\n", + "Cbc0010I After 12153000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1006.38 seconds)\n", + "Cbc0010I After 12154000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1006.41 seconds)\n", + "Cbc0010I After 12155000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1006.44 seconds)\n", + "Cbc0010I After 12156000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1006.48 seconds)\n", + "Cbc0010I After 12157000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1006.51 seconds)\n", + "Cbc0010I After 12158000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1006.56 seconds)\n", + "Cbc0010I After 12159000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1006.61 seconds)\n", + "Cbc0010I After 12160000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1006.66 seconds)\n", + "Cbc0010I After 12161000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1006.71 seconds)\n", + "Cbc0010I After 12162000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1006.77 seconds)\n", + "Cbc0010I After 12163000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1006.82 seconds)\n", + "Cbc0010I After 12164000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1006.88 seconds)\n", + "Cbc0010I After 12165000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1006.92 seconds)\n", + "Cbc0010I After 12166000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1006.96 seconds)\n", + "Cbc0010I After 12167000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1007.00 seconds)\n", + "Cbc0010I After 12168000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1007.03 seconds)\n", + "Cbc0010I After 12169000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1007.08 seconds)\n", + "Cbc0010I After 12170000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1007.13 seconds)\n", + "Cbc0010I After 12171000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1007.19 seconds)\n", + "Cbc0010I After 12172000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1007.24 seconds)\n", + "Cbc0010I After 12173000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1007.30 seconds)\n", + "Cbc0010I After 12174000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1007.36 seconds)\n", + "Cbc0010I After 12175000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1007.42 seconds)\n", + "Cbc0010I After 12176000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1007.48 seconds)\n", + "Cbc0010I After 12177000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1007.53 seconds)\n", + "Cbc0010I After 12178000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1007.59 seconds)\n", + "Cbc0010I After 12179000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1007.62 seconds)\n", + "Cbc0010I After 12180000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1007.65 seconds)\n", + "Cbc0010I After 12181000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1007.68 seconds)\n", + "Cbc0010I After 12182000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1007.72 seconds)\n", + "Cbc0010I After 12183000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1007.77 seconds)\n", + "Cbc0010I After 12184000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1007.81 seconds)\n", + "Cbc0010I After 12185000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1007.86 seconds)\n", + "Cbc0010I After 12186000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1007.91 seconds)\n", + "Cbc0010I After 12187000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1008.00 seconds)\n", + "Cbc0010I After 12188000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1008.08 seconds)\n", + "Cbc0010I After 12189000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1008.16 seconds)\n", + "Cbc0010I After 12190000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1008.20 seconds)\n", + "Cbc0010I After 12191000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1008.24 seconds)\n", + "Cbc0010I After 12192000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1008.28 seconds)\n", + "Cbc0010I After 12193000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1008.32 seconds)\n", + "Cbc0010I After 12194000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1008.36 seconds)\n", + "Cbc0010I After 12195000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1008.42 seconds)\n", + "Cbc0010I After 12196000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1008.50 seconds)\n", + "Cbc0010I After 12197000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1008.57 seconds)\n", + "Cbc0010I After 12198000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1008.64 seconds)\n", + "Cbc0010I After 12199000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1008.70 seconds)\n", + "Cbc0010I After 12200000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1008.78 seconds)\n", + "Cbc0010I After 12201000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1008.89 seconds)\n", + "Cbc0010I After 12202000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.01 seconds)\n", + "Cbc0010I After 12203000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1009.13 seconds)\n", + "Cbc0010I After 12204000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1009.22 seconds)\n", + "Cbc0010I After 12205000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.28 seconds)\n", + "Cbc0010I After 12206000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1009.34 seconds)\n", + "Cbc0010I After 12207000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1009.42 seconds)\n", + "Cbc0010I After 12208000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1009.50 seconds)\n", + "Cbc0010I After 12209000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.58 seconds)\n", + "Cbc0010I After 12210000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1009.63 seconds)\n", + "Cbc0010I After 12211000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.67 seconds)\n", + "Cbc0010I After 12212000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.71 seconds)\n", + "Cbc0010I After 12213000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.77 seconds)\n", + "Cbc0010I After 12214000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1009.82 seconds)\n", + "Cbc0010I After 12215000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1009.86 seconds)\n", + "Cbc0010I After 12216000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1009.92 seconds)\n", + "Cbc0010I After 12217000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1009.99 seconds)\n", + "Cbc0010I After 12218000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1010.29 seconds)\n", + "Cbc0010I After 12219000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1010.36 seconds)\n", + "Cbc0010I After 12220000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1010.42 seconds)\n", + "Cbc0010I After 12221000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1010.46 seconds)\n", + "Cbc0010I After 12222000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1010.52 seconds)\n", + "Cbc0010I After 12223000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1010.57 seconds)\n", + "Cbc0010I After 12224000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1010.62 seconds)\n", + "Cbc0010I After 12225000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1010.65 seconds)\n", + "Cbc0010I After 12226000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1010.70 seconds)\n", + "Cbc0010I After 12227000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1010.75 seconds)\n", + "Cbc0010I After 12228000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1010.80 seconds)\n", + "Cbc0010I After 12229000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1010.85 seconds)\n", + "Cbc0010I After 12230000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1010.90 seconds)\n", + "Cbc0010I After 12231000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1010.94 seconds)\n", + "Cbc0010I After 12232000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1010.98 seconds)\n", + "Cbc0010I After 12233000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1011.03 seconds)\n", + "Cbc0010I After 12234000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1011.08 seconds)\n", + "Cbc0010I After 12235000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1011.13 seconds)\n", + "Cbc0010I After 12236000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1011.18 seconds)\n", + "Cbc0010I After 12237000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1011.24 seconds)\n", + "Cbc0010I After 12238000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1011.28 seconds)\n", + "Cbc0010I After 12239000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1011.32 seconds)\n", + "Cbc0010I After 12240000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1011.36 seconds)\n", + "Cbc0010I After 12241000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1011.41 seconds)\n", + "Cbc0010I After 12242000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1011.44 seconds)\n", + "Cbc0010I After 12243000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1011.49 seconds)\n", + "Cbc0010I After 12244000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1011.53 seconds)\n", + "Cbc0010I After 12245000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1011.58 seconds)\n", + "Cbc0010I After 12246000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1011.62 seconds)\n", + "Cbc0010I After 12247000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1011.66 seconds)\n", + "Cbc0010I After 12248000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1011.71 seconds)\n", + "Cbc0010I After 12249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1011.75 seconds)\n", + "Cbc0010I After 12250000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1011.81 seconds)\n", + "Cbc0010I After 12251000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1011.85 seconds)\n", + "Cbc0010I After 12252000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1011.89 seconds)\n", + "Cbc0010I After 12253000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1011.95 seconds)\n", + "Cbc0010I After 12254000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1011.99 seconds)\n", + "Cbc0010I After 12255000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1012.04 seconds)\n", + "Cbc0010I After 12256000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1012.08 seconds)\n", + "Cbc0010I After 12257000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1012.12 seconds)\n", + "Cbc0010I After 12258000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1012.18 seconds)\n", + "Cbc0010I After 12259000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1012.22 seconds)\n", + "Cbc0010I After 12260000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1012.27 seconds)\n", + "Cbc0010I After 12261000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1012.30 seconds)\n", + "Cbc0010I After 12262000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1012.34 seconds)\n", + "Cbc0010I After 12263000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1012.38 seconds)\n", + "Cbc0010I After 12264000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1012.42 seconds)\n", + "Cbc0010I After 12265000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1012.47 seconds)\n", + "Cbc0010I After 12266000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.52 seconds)\n", + "Cbc0010I After 12267000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1012.56 seconds)\n", + "Cbc0010I After 12268000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1012.61 seconds)\n", + "Cbc0010I After 12269000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1012.66 seconds)\n", + "Cbc0010I After 12270000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1012.70 seconds)\n", + "Cbc0010I After 12271000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1012.75 seconds)\n", + "Cbc0010I After 12272000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.81 seconds)\n", + "Cbc0010I After 12273000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1012.85 seconds)\n", + "Cbc0010I After 12274000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1012.90 seconds)\n", + "Cbc0010I After 12275000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.96 seconds)\n", + "Cbc0010I After 12276000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1013.02 seconds)\n", + "Cbc0010I After 12277000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1013.06 seconds)\n", + "Cbc0010I After 12278000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1013.10 seconds)\n", + "Cbc0010I After 12279000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1013.14 seconds)\n", + "Cbc0010I After 12280000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1013.19 seconds)\n", + "Cbc0010I After 12281000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1013.25 seconds)\n", + "Cbc0010I After 12282000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1013.29 seconds)\n", + "Cbc0010I After 12283000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1013.33 seconds)\n", + "Cbc0010I After 12284000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1013.39 seconds)\n", + "Cbc0010I After 12285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1013.45 seconds)\n", + "Cbc0010I After 12286000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1013.51 seconds)\n", + "Cbc0010I After 12287000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1013.57 seconds)\n", + "Cbc0010I After 12288000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1013.62 seconds)\n", + "Cbc0010I After 12289000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1013.68 seconds)\n", + "Cbc0010I After 12290000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1013.71 seconds)\n", + "Cbc0010I After 12291000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1013.74 seconds)\n", + "Cbc0010I After 12292000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1013.79 seconds)\n", + "Cbc0010I After 12293000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1013.83 seconds)\n", + "Cbc0010I After 12294000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1013.89 seconds)\n", + "Cbc0010I After 12295000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1013.94 seconds)\n", + "Cbc0010I After 12296000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1013.98 seconds)\n", + "Cbc0010I After 12297000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1014.02 seconds)\n", + "Cbc0010I After 12298000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.07 seconds)\n", + "Cbc0010I After 12299000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1014.14 seconds)\n", + "Cbc0010I After 12300000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1014.19 seconds)\n", + "Cbc0010I After 12301000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1014.23 seconds)\n", + "Cbc0010I After 12302000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1014.27 seconds)\n", + "Cbc0010I After 12303000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1014.34 seconds)\n", + "Cbc0010I After 12304000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1014.39 seconds)\n", + "Cbc0010I After 12305000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1014.43 seconds)\n", + "Cbc0010I After 12306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1014.47 seconds)\n", + "Cbc0010I After 12307000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.52 seconds)\n", + "Cbc0010I After 12308000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1014.59 seconds)\n", + "Cbc0010I After 12309000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1014.64 seconds)\n", + "Cbc0010I After 12310000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1014.68 seconds)\n", + "Cbc0010I After 12311000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1014.71 seconds)\n", + "Cbc0010I After 12312000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1014.76 seconds)\n", + "Cbc0010I After 12313000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.83 seconds)\n", + "Cbc0010I After 12314000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1014.89 seconds)\n", + "Cbc0010I After 12315000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1014.93 seconds)\n", + "Cbc0010I After 12316000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1014.97 seconds)\n", + "Cbc0010I After 12317000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1015.01 seconds)\n", + "Cbc0010I After 12318000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1015.08 seconds)\n", + "Cbc0010I After 12319000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1015.13 seconds)\n", + "Cbc0010I After 12320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1015.17 seconds)\n", + "Cbc0010I After 12321000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1015.21 seconds)\n", + "Cbc0010I After 12322000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1015.25 seconds)\n", + "Cbc0010I After 12323000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1015.33 seconds)\n", + "Cbc0010I After 12324000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1015.40 seconds)\n", + "Cbc0010I After 12325000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1015.44 seconds)\n", + "Cbc0010I After 12326000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1015.48 seconds)\n", + "Cbc0010I After 12327000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1015.52 seconds)\n", + "Cbc0010I After 12328000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1015.59 seconds)\n", + "Cbc0010I After 12329000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1015.65 seconds)\n", + "Cbc0010I After 12330000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1015.69 seconds)\n", + "Cbc0010I After 12331000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1015.73 seconds)\n", + "Cbc0010I After 12332000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1015.77 seconds)\n", + "Cbc0010I After 12333000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1015.83 seconds)\n", + "Cbc0010I After 12334000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1015.88 seconds)\n", + "Cbc0010I After 12335000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1015.91 seconds)\n", + "Cbc0010I After 12336000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1015.94 seconds)\n", + "Cbc0010I After 12337000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1015.99 seconds)\n", + "Cbc0010I After 12338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1016.02 seconds)\n", + "Cbc0010I After 12339000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1016.06 seconds)\n", + "Cbc0010I After 12340000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.09 seconds)\n", + "Cbc0010I After 12341000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1016.13 seconds)\n", + "Cbc0010I After 12342000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1016.21 seconds)\n", + "Cbc0010I After 12343000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1016.26 seconds)\n", + "Cbc0010I After 12344000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1016.30 seconds)\n", + "Cbc0010I After 12345000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.33 seconds)\n", + "Cbc0010I After 12346000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1016.37 seconds)\n", + "Cbc0010I After 12347000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1016.43 seconds)\n", + "Cbc0010I After 12348000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1016.50 seconds)\n", + "Cbc0010I After 12349000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1016.54 seconds)\n", + "Cbc0010I After 12350000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1016.58 seconds)\n", + "Cbc0010I After 12351000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1016.62 seconds)\n", + "Cbc0010I After 12352000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1016.65 seconds)\n", + "Cbc0010I After 12353000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1016.72 seconds)\n", + "Cbc0010I After 12354000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.77 seconds)\n", + "Cbc0010I After 12355000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1016.83 seconds)\n", + "Cbc0010I After 12356000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1016.89 seconds)\n", + "Cbc0010I After 12357000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1016.94 seconds)\n", + "Cbc0010I After 12358000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1016.99 seconds)\n", + "Cbc0010I After 12359000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1017.03 seconds)\n", + "Cbc0010I After 12360000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1017.07 seconds)\n", + "Cbc0010I After 12361000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1017.11 seconds)\n", + "Cbc0010I After 12362000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1017.15 seconds)\n", + "Cbc0010I After 12363000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1017.18 seconds)\n", + "Cbc0010I After 12364000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1017.22 seconds)\n", + "Cbc0010I After 12365000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1017.25 seconds)\n", + "Cbc0010I After 12366000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1017.28 seconds)\n", + "Cbc0010I After 12367000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1017.31 seconds)\n", + "Cbc0010I After 12368000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1017.34 seconds)\n", + "Cbc0010I After 12369000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1017.38 seconds)\n", + "Cbc0010I After 12370000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1017.42 seconds)\n", + "Cbc0010I After 12371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1017.46 seconds)\n", + "Cbc0010I After 12372000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1017.50 seconds)\n", + "Cbc0010I After 12373000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1017.55 seconds)\n", + "Cbc0010I After 12374000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1017.60 seconds)\n", + "Cbc0010I After 12375000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1017.65 seconds)\n", + "Cbc0010I After 12376000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1017.69 seconds)\n", + "Cbc0010I After 12377000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1017.74 seconds)\n", + "Cbc0010I After 12378000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1017.79 seconds)\n", + "Cbc0010I After 12379000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1017.86 seconds)\n", + "Cbc0010I After 12380000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1017.91 seconds)\n", + "Cbc0010I After 12381000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1017.98 seconds)\n", + "Cbc0010I After 12382000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1018.04 seconds)\n", + "Cbc0010I After 12383000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1018.11 seconds)\n", + "Cbc0010I After 12384000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1018.17 seconds)\n", + "Cbc0010I After 12385000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1018.23 seconds)\n", + "Cbc0010I After 12386000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1018.30 seconds)\n", + "Cbc0010I After 12387000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1018.36 seconds)\n", + "Cbc0010I After 12388000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1018.42 seconds)\n", + "Cbc0010I After 12389000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1018.48 seconds)\n", + "Cbc0010I After 12390000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.54 seconds)\n", + "Cbc0010I After 12391000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.59 seconds)\n", + "Cbc0010I After 12392000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1018.66 seconds)\n", + "Cbc0010I After 12393000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1018.72 seconds)\n", + "Cbc0010I After 12394000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.80 seconds)\n", + "Cbc0010I After 12395000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1018.86 seconds)\n", + "Cbc0010I After 12396000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1018.92 seconds)\n", + "Cbc0010I After 12397000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1018.99 seconds)\n", + "Cbc0010I After 12398000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1019.05 seconds)\n", + "Cbc0010I After 12399000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1019.11 seconds)\n", + "Cbc0010I After 12400000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1019.18 seconds)\n", + "Cbc0010I After 12401000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1019.24 seconds)\n", + "Cbc0010I After 12402000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1019.31 seconds)\n", + "Cbc0010I After 12403000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1019.37 seconds)\n", + "Cbc0010I After 12404000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1019.43 seconds)\n", + "Cbc0010I After 12405000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1019.49 seconds)\n", + "Cbc0010I After 12406000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1019.56 seconds)\n", + "Cbc0010I After 12407000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1019.62 seconds)\n", + "Cbc0010I After 12408000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1019.68 seconds)\n", + "Cbc0010I After 12409000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1019.75 seconds)\n", + "Cbc0010I After 12410000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1019.81 seconds)\n", + "Cbc0010I After 12411000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1019.87 seconds)\n", + "Cbc0010I After 12412000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1019.93 seconds)\n", + "Cbc0010I After 12413000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1019.99 seconds)\n", + "Cbc0010I After 12414000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1020.06 seconds)\n", + "Cbc0010I After 12415000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1020.12 seconds)\n", + "Cbc0010I After 12416000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1020.18 seconds)\n", + "Cbc0010I After 12417000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1020.25 seconds)\n", + "Cbc0010I After 12418000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1020.30 seconds)\n", + "Cbc0010I After 12419000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.37 seconds)\n", + "Cbc0010I After 12420000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1020.42 seconds)\n", + "Cbc0010I After 12421000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1020.49 seconds)\n", + "Cbc0010I After 12422000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1020.56 seconds)\n", + "Cbc0010I After 12423000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.63 seconds)\n", + "Cbc0010I After 12424000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.69 seconds)\n", + "Cbc0010I After 12425000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1020.75 seconds)\n", + "Cbc0010I After 12426000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1020.81 seconds)\n", + "Cbc0010I After 12427000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1020.87 seconds)\n", + "Cbc0010I After 12428000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1020.94 seconds)\n", + "Cbc0010I After 12429000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1021.01 seconds)\n", + "Cbc0010I After 12430000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1021.07 seconds)\n", + "Cbc0010I After 12431000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1021.13 seconds)\n", + "Cbc0010I After 12432000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.19 seconds)\n", + "Cbc0010I After 12433000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1021.25 seconds)\n", + "Cbc0010I After 12434000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1021.31 seconds)\n", + "Cbc0010I After 12435000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.37 seconds)\n", + "Cbc0010I After 12436000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1021.43 seconds)\n", + "Cbc0010I After 12437000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1021.49 seconds)\n", + "Cbc0010I After 12438000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1021.56 seconds)\n", + "Cbc0010I After 12439000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1021.62 seconds)\n", + "Cbc0010I After 12440000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1021.67 seconds)\n", + "Cbc0010I After 12441000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1021.73 seconds)\n", + "Cbc0010I After 12442000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1021.80 seconds)\n", + "Cbc0010I After 12443000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1021.85 seconds)\n", + "Cbc0010I After 12444000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.92 seconds)\n", + "Cbc0010I After 12445000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1021.97 seconds)\n", + "Cbc0010I After 12446000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1022.04 seconds)\n", + "Cbc0010I After 12447000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1022.10 seconds)\n", + "Cbc0010I After 12448000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1022.15 seconds)\n", + "Cbc0010I After 12449000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1022.22 seconds)\n", + "Cbc0010I After 12450000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1022.28 seconds)\n", + "Cbc0010I After 12451000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1022.33 seconds)\n", + "Cbc0010I After 12452000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1022.38 seconds)\n", + "Cbc0010I After 12453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1022.44 seconds)\n", + "Cbc0010I After 12454000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1022.49 seconds)\n", + "Cbc0010I After 12455000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1022.55 seconds)\n", + "Cbc0010I After 12456000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1022.61 seconds)\n", + "Cbc0010I After 12457000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1022.67 seconds)\n", + "Cbc0010I After 12458000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1022.73 seconds)\n", + "Cbc0010I After 12459000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1022.79 seconds)\n", + "Cbc0010I After 12460000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1022.85 seconds)\n", + "Cbc0010I After 12461000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1022.91 seconds)\n", + "Cbc0010I After 12462000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1022.97 seconds)\n", + "Cbc0010I After 12463000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1023.04 seconds)\n", + "Cbc0010I After 12464000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.10 seconds)\n", + "Cbc0010I After 12465000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1023.16 seconds)\n", + "Cbc0010I After 12466000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.21 seconds)\n", + "Cbc0010I After 12467000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.28 seconds)\n", + "Cbc0010I After 12468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1023.34 seconds)\n", + "Cbc0010I After 12469000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1023.41 seconds)\n", + "Cbc0010I After 12470000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1023.46 seconds)\n", + "Cbc0010I After 12471000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1023.51 seconds)\n", + "Cbc0010I After 12472000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.57 seconds)\n", + "Cbc0010I After 12473000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.63 seconds)\n", + "Cbc0010I After 12474000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.69 seconds)\n", + "Cbc0010I After 12475000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.75 seconds)\n", + "Cbc0010I After 12476000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1023.81 seconds)\n", + "Cbc0010I After 12477000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1023.87 seconds)\n", + "Cbc0010I After 12478000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.94 seconds)\n", + "Cbc0010I After 12479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1024.00 seconds)\n", + "Cbc0010I After 12480000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1024.06 seconds)\n", + "Cbc0010I After 12481000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1024.12 seconds)\n", + "Cbc0010I After 12482000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.18 seconds)\n", + "Cbc0010I After 12483000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1024.23 seconds)\n", + "Cbc0010I After 12484000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1024.30 seconds)\n", + "Cbc0010I After 12485000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1024.36 seconds)\n", + "Cbc0010I After 12486000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1024.43 seconds)\n", + "Cbc0010I After 12487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1024.49 seconds)\n", + "Cbc0010I After 12488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1024.54 seconds)\n", + "Cbc0010I After 12489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.60 seconds)\n", + "Cbc0010I After 12490000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1024.66 seconds)\n", + "Cbc0010I After 12491000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1024.71 seconds)\n", + "Cbc0010I After 12492000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.76 seconds)\n", + "Cbc0010I After 12493000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1024.81 seconds)\n", + "Cbc0010I After 12494000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1024.86 seconds)\n", + "Cbc0010I After 12495000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.91 seconds)\n", + "Cbc0010I After 12496000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1024.96 seconds)\n", + "Cbc0010I After 12497000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1025.02 seconds)\n", + "Cbc0010I After 12498000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1025.07 seconds)\n", + "Cbc0010I After 12499000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1025.13 seconds)\n", + "Cbc0010I After 12500000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1025.19 seconds)\n", + "Cbc0010I After 12501000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1025.25 seconds)\n", + "Cbc0010I After 12502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1025.30 seconds)\n", + "Cbc0010I After 12503000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1025.34 seconds)\n", + "Cbc0010I After 12504000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1025.39 seconds)\n", + "Cbc0010I After 12505000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1025.42 seconds)\n", + "Cbc0010I After 12506000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1025.46 seconds)\n", + "Cbc0010I After 12507000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1025.50 seconds)\n", + "Cbc0010I After 12508000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1025.53 seconds)\n", + "Cbc0010I After 12509000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1025.58 seconds)\n", + "Cbc0010I After 12510000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1025.64 seconds)\n", + "Cbc0010I After 12511000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1025.70 seconds)\n", + "Cbc0010I After 12512000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1025.73 seconds)\n", + "Cbc0010I After 12513000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1025.76 seconds)\n", + "Cbc0010I After 12514000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1025.79 seconds)\n", + "Cbc0010I After 12515000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1025.82 seconds)\n", + "Cbc0010I After 12516000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1025.85 seconds)\n", + "Cbc0010I After 12517000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1025.88 seconds)\n", + "Cbc0010I After 12518000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1025.93 seconds)\n", + "Cbc0010I After 12519000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1025.96 seconds)\n", + "Cbc0010I After 12520000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1026.00 seconds)\n", + "Cbc0010I After 12521000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1026.03 seconds)\n", + "Cbc0010I After 12522000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1026.10 seconds)\n", + "Cbc0010I After 12523000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1026.18 seconds)\n", + "Cbc0010I After 12524000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1026.24 seconds)\n", + "Cbc0010I After 12525000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1026.30 seconds)\n", + "Cbc0010I After 12526000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1026.36 seconds)\n", + "Cbc0010I After 12527000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1026.41 seconds)\n", + "Cbc0010I After 12528000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1026.46 seconds)\n", + "Cbc0010I After 12529000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1026.49 seconds)\n", + "Cbc0010I After 12530000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1026.53 seconds)\n", + "Cbc0010I After 12531000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1026.56 seconds)\n", + "Cbc0010I After 12532000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1026.59 seconds)\n", + "Cbc0010I After 12533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1026.62 seconds)\n", + "Cbc0010I After 12534000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1026.65 seconds)\n", + "Cbc0010I After 12535000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1026.69 seconds)\n", + "Cbc0010I After 12536000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1026.75 seconds)\n", + "Cbc0010I After 12537000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1026.80 seconds)\n", + "Cbc0010I After 12538000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1026.85 seconds)\n", + "Cbc0010I After 12539000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1026.88 seconds)\n", + "Cbc0010I After 12540000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1026.91 seconds)\n", + "Cbc0010I After 12541000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1026.95 seconds)\n", + "Cbc0010I After 12542000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1026.98 seconds)\n", + "Cbc0010I After 12543000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1027.03 seconds)\n", + "Cbc0010I After 12544000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1027.08 seconds)\n", + "Cbc0010I After 12545000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1027.13 seconds)\n", + "Cbc0010I After 12546000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.18 seconds)\n", + "Cbc0010I After 12547000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1027.24 seconds)\n", + "Cbc0010I After 12548000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1027.28 seconds)\n", + "Cbc0010I After 12549000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1027.32 seconds)\n", + "Cbc0010I After 12550000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1027.36 seconds)\n", + "Cbc0010I After 12551000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1027.40 seconds)\n", + "Cbc0010I After 12552000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1027.46 seconds)\n", + "Cbc0010I After 12553000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1027.51 seconds)\n", + "Cbc0010I After 12554000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.57 seconds)\n", + "Cbc0010I After 12555000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1027.62 seconds)\n", + "Cbc0010I After 12556000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1027.65 seconds)\n", + "Cbc0010I After 12557000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1027.69 seconds)\n", + "Cbc0010I After 12558000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1027.74 seconds)\n", + "Cbc0010I After 12559000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1027.78 seconds)\n", + "Cbc0010I After 12560000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1027.84 seconds)\n", + "Cbc0010I After 12561000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1027.89 seconds)\n", + "Cbc0010I After 12562000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.94 seconds)\n", + "Cbc0010I After 12563000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1028.00 seconds)\n", + "Cbc0010I After 12564000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1028.06 seconds)\n", + "Cbc0010I After 12565000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1028.11 seconds)\n", + "Cbc0010I After 12566000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1028.15 seconds)\n", + "Cbc0010I After 12567000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1028.20 seconds)\n", + "Cbc0010I After 12568000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1028.26 seconds)\n", + "Cbc0010I After 12569000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1028.31 seconds)\n", + "Cbc0010I After 12570000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1028.36 seconds)\n", + "Cbc0010I After 12571000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1028.42 seconds)\n", + "Cbc0010I After 12572000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1028.47 seconds)\n", + "Cbc0010I After 12573000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1028.52 seconds)\n", + "Cbc0010I After 12574000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1028.57 seconds)\n", + "Cbc0010I After 12575000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1028.62 seconds)\n", + "Cbc0010I After 12576000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1028.67 seconds)\n", + "Cbc0010I After 12577000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1028.93 seconds)\n", + "Cbc0010I After 12578000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1028.98 seconds)\n", + "Cbc0010I After 12579000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1029.03 seconds)\n", + "Cbc0010I After 12580000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1029.09 seconds)\n", + "Cbc0010I After 12581000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1029.14 seconds)\n", + "Cbc0010I After 12582000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1029.18 seconds)\n", + "Cbc0010I After 12583000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1029.23 seconds)\n", + "Cbc0010I After 12584000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1029.28 seconds)\n", + "Cbc0010I After 12585000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1029.33 seconds)\n", + "Cbc0010I After 12586000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1029.38 seconds)\n", + "Cbc0010I After 12587000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1029.43 seconds)\n", + "Cbc0010I After 12588000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1029.49 seconds)\n", + "Cbc0010I After 12589000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1029.54 seconds)\n", + "Cbc0010I After 12590000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1029.58 seconds)\n", + "Cbc0010I After 12591000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1029.63 seconds)\n", + "Cbc0010I After 12592000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1029.69 seconds)\n", + "Cbc0010I After 12593000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1029.74 seconds)\n", + "Cbc0010I After 12594000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1029.79 seconds)\n", + "Cbc0010I After 12595000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1029.84 seconds)\n", + "Cbc0010I After 12596000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1029.89 seconds)\n", + "Cbc0010I After 12597000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1029.94 seconds)\n", + "Cbc0010I After 12598000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1030.00 seconds)\n", + "Cbc0010I After 12599000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1030.04 seconds)\n", + "Cbc0010I After 12600000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1030.10 seconds)\n", + "Cbc0010I After 12601000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1030.14 seconds)\n", + "Cbc0010I After 12602000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1030.17 seconds)\n", + "Cbc0010I After 12603000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1030.24 seconds)\n", + "Cbc0010I After 12604000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1030.29 seconds)\n", + "Cbc0010I After 12605000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1030.36 seconds)\n", + "Cbc0010I After 12606000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.40 seconds)\n", + "Cbc0010I After 12607000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.46 seconds)\n", + "Cbc0010I After 12608000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1030.50 seconds)\n", + "Cbc0010I After 12609000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1030.57 seconds)\n", + "Cbc0010I After 12610000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.61 seconds)\n", + "Cbc0010I After 12611000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1030.66 seconds)\n", + "Cbc0010I After 12612000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1030.71 seconds)\n", + "Cbc0010I After 12613000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1030.75 seconds)\n", + "Cbc0010I After 12614000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1030.79 seconds)\n", + "Cbc0010I After 12615000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1030.86 seconds)\n", + "Cbc0010I After 12616000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1030.90 seconds)\n", + "Cbc0010I After 12617000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1030.95 seconds)\n", + "Cbc0010I After 12618000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1031.01 seconds)\n", + "Cbc0010I After 12619000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1031.05 seconds)\n", + "Cbc0010I After 12620000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1031.11 seconds)\n", + "Cbc0010I After 12621000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1031.18 seconds)\n", + "Cbc0010I After 12622000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1031.22 seconds)\n", + "Cbc0010I After 12623000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1031.26 seconds)\n", + "Cbc0010I After 12624000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1031.30 seconds)\n", + "Cbc0010I After 12625000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1031.37 seconds)\n", + "Cbc0010I After 12626000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1031.41 seconds)\n", + "Cbc0010I After 12627000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1031.46 seconds)\n", + "Cbc0010I After 12628000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1031.52 seconds)\n", + "Cbc0010I After 12629000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1031.57 seconds)\n", + "Cbc0010I After 12630000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1031.62 seconds)\n", + "Cbc0010I After 12631000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1031.68 seconds)\n", + "Cbc0010I After 12632000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1031.73 seconds)\n", + "Cbc0010I After 12633000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1031.78 seconds)\n", + "Cbc0010I After 12634000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1031.82 seconds)\n", + "Cbc0010I After 12635000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1031.89 seconds)\n", + "Cbc0010I After 12636000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1031.94 seconds)\n", + "Cbc0010I After 12637000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1031.97 seconds)\n", + "Cbc0010I After 12638000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1032.05 seconds)\n", + "Cbc0010I After 12639000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1032.10 seconds)\n", + "Cbc0010I After 12640000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1032.14 seconds)\n", + "Cbc0010I After 12641000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1032.19 seconds)\n", + "Cbc0010I After 12642000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.25 seconds)\n", + "Cbc0010I After 12643000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1032.30 seconds)\n", + "Cbc0010I After 12644000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1032.34 seconds)\n", + "Cbc0010I After 12645000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.41 seconds)\n", + "Cbc0010I After 12646000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.47 seconds)\n", + "Cbc0010I After 12647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1032.51 seconds)\n", + "Cbc0010I After 12648000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.56 seconds)\n", + "Cbc0010I After 12649000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1032.62 seconds)\n", + "Cbc0010I After 12650000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1032.68 seconds)\n", + "Cbc0010I After 12651000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1032.73 seconds)\n", + "Cbc0010I After 12652000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1032.77 seconds)\n", + "Cbc0010I After 12653000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1032.83 seconds)\n", + "Cbc0010I After 12654000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.89 seconds)\n", + "Cbc0010I After 12655000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.92 seconds)\n", + "Cbc0010I After 12656000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1032.96 seconds)\n", + "Cbc0010I After 12657000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1033.00 seconds)\n", + "Cbc0010I After 12658000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.05 seconds)\n", + "Cbc0010I After 12659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1033.12 seconds)\n", + "Cbc0010I After 12660000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1033.16 seconds)\n", + "Cbc0010I After 12661000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1033.21 seconds)\n", + "Cbc0010I After 12662000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.25 seconds)\n", + "Cbc0010I After 12663000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1033.31 seconds)\n", + "Cbc0010I After 12664000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.38 seconds)\n", + "Cbc0010I After 12665000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1033.42 seconds)\n", + "Cbc0010I After 12666000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1033.46 seconds)\n", + "Cbc0010I After 12667000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1033.52 seconds)\n", + "Cbc0010I After 12668000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1033.58 seconds)\n", + "Cbc0010I After 12669000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1033.63 seconds)\n", + "Cbc0010I After 12670000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1033.67 seconds)\n", + "Cbc0010I After 12671000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1033.72 seconds)\n", + "Cbc0010I After 12672000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1033.78 seconds)\n", + "Cbc0010I After 12673000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1033.84 seconds)\n", + "Cbc0010I After 12674000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.88 seconds)\n", + "Cbc0010I After 12675000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1033.91 seconds)\n", + "Cbc0010I After 12676000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1033.95 seconds)\n", + "Cbc0010I After 12677000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1033.99 seconds)\n", + "Cbc0010I After 12678000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1034.04 seconds)\n", + "Cbc0010I After 12679000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1034.11 seconds)\n", + "Cbc0010I After 12680000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1034.15 seconds)\n", + "Cbc0010I After 12681000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1034.19 seconds)\n", + "Cbc0010I After 12682000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1034.23 seconds)\n", + "Cbc0010I After 12683000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1034.28 seconds)\n", + "Cbc0010I After 12684000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.36 seconds)\n", + "Cbc0010I After 12685000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1034.42 seconds)\n", + "Cbc0010I After 12686000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1034.46 seconds)\n", + "Cbc0010I After 12687000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1034.50 seconds)\n", + "Cbc0010I After 12688000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1034.55 seconds)\n", + "Cbc0010I After 12689000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1034.62 seconds)\n", + "Cbc0010I After 12690000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1034.68 seconds)\n", + "Cbc0010I After 12691000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1034.72 seconds)\n", + "Cbc0010I After 12692000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.76 seconds)\n", + "Cbc0010I After 12693000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1034.80 seconds)\n", + "Cbc0010I After 12694000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.88 seconds)\n", + "Cbc0010I After 12695000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1034.94 seconds)\n", + "Cbc0010I After 12696000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1034.98 seconds)\n", + "Cbc0010I After 12697000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1035.02 seconds)\n", + "Cbc0010I After 12698000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1035.06 seconds)\n", + "Cbc0010I After 12699000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1035.12 seconds)\n", + "Cbc0010I After 12700000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1035.19 seconds)\n", + "Cbc0010I After 12701000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1035.25 seconds)\n", + "Cbc0010I After 12702000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1035.28 seconds)\n", + "Cbc0010I After 12703000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1035.32 seconds)\n", + "Cbc0010I After 12704000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1035.36 seconds)\n", + "Cbc0010I After 12705000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1035.44 seconds)\n", + "Cbc0010I After 12706000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1035.50 seconds)\n", + "Cbc0010I After 12707000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1035.54 seconds)\n", + "Cbc0010I After 12708000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1035.58 seconds)\n", + "Cbc0010I After 12709000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1035.63 seconds)\n", + "Cbc0010I After 12710000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1035.69 seconds)\n", + "Cbc0010I After 12711000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1035.77 seconds)\n", + "Cbc0010I After 12712000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1035.84 seconds)\n", + "Cbc0010I After 12713000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1035.90 seconds)\n", + "Cbc0010I After 12714000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1035.95 seconds)\n", + "Cbc0010I After 12715000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1036.00 seconds)\n", + "Cbc0010I After 12716000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1036.07 seconds)\n", + "Cbc0010I After 12717000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1036.14 seconds)\n", + "Cbc0010I After 12718000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1036.19 seconds)\n", + "Cbc0010I After 12719000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1036.26 seconds)\n", + "Cbc0010I After 12720000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1036.32 seconds)\n", + "Cbc0010I After 12721000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1036.36 seconds)\n", + "Cbc0010I After 12722000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1036.41 seconds)\n", + "Cbc0010I After 12723000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1036.45 seconds)\n", + "Cbc0010I After 12724000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1036.48 seconds)\n", + "Cbc0010I After 12725000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1036.51 seconds)\n", + "Cbc0010I After 12726000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1036.55 seconds)\n", + "Cbc0010I After 12727000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1036.58 seconds)\n", + "Cbc0010I After 12728000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1036.63 seconds)\n", + "Cbc0010I After 12729000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1036.68 seconds)\n", + "Cbc0010I After 12730000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1036.76 seconds)\n", + "Cbc0010I After 12731000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1036.84 seconds)\n", + "Cbc0010I After 12732000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1036.92 seconds)\n", + "Cbc0010I After 12733000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1036.99 seconds)\n", + "Cbc0010I After 12734000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1037.12 seconds)\n", + "Cbc0010I After 12735000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1037.30 seconds)\n", + "Cbc0010I After 12736000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1037.41 seconds)\n", + "Cbc0010I After 12737000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1037.51 seconds)\n", + "Cbc0010I After 12738000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1037.59 seconds)\n", + "Cbc0010I After 12739000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1037.68 seconds)\n", + "Cbc0010I After 12740000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1037.77 seconds)\n", + "Cbc0010I After 12741000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1037.87 seconds)\n", + "Cbc0010I After 12742000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1037.95 seconds)\n", + "Cbc0010I After 12743000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1038.03 seconds)\n", + "Cbc0010I After 12744000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1038.09 seconds)\n", + "Cbc0010I After 12745000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1038.16 seconds)\n", + "Cbc0010I After 12746000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1038.21 seconds)\n", + "Cbc0010I After 12747000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1038.30 seconds)\n", + "Cbc0010I After 12748000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1038.35 seconds)\n", + "Cbc0010I After 12749000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1038.43 seconds)\n", + "Cbc0010I After 12750000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1038.49 seconds)\n", + "Cbc0010I After 12751000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1038.56 seconds)\n", + "Cbc0010I After 12752000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1038.62 seconds)\n", + "Cbc0010I After 12753000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1038.68 seconds)\n", + "Cbc0010I After 12754000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1038.75 seconds)\n", + "Cbc0010I After 12755000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1038.81 seconds)\n", + "Cbc0010I After 12756000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1038.88 seconds)\n", + "Cbc0010I After 12757000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1038.93 seconds)\n", + "Cbc0010I After 12758000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1039.00 seconds)\n", + "Cbc0010I After 12759000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1039.08 seconds)\n", + "Cbc0010I After 12760000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1039.14 seconds)\n", + "Cbc0010I After 12761000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1039.20 seconds)\n", + "Cbc0010I After 12762000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1039.26 seconds)\n", + "Cbc0010I After 12763000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1039.33 seconds)\n", + "Cbc0010I After 12764000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1039.39 seconds)\n", + "Cbc0010I After 12765000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1039.47 seconds)\n", + "Cbc0010I After 12766000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1039.53 seconds)\n", + "Cbc0010I After 12767000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1039.60 seconds)\n", + "Cbc0010I After 12768000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1039.66 seconds)\n", + "Cbc0010I After 12769000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1039.73 seconds)\n", + "Cbc0010I After 12770000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1039.80 seconds)\n", + "Cbc0010I After 12771000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1039.87 seconds)\n", + "Cbc0010I After 12772000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1039.92 seconds)\n", + "Cbc0010I After 12773000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.00 seconds)\n", + "Cbc0010I After 12774000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1040.05 seconds)\n", + "Cbc0010I After 12775000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.12 seconds)\n", + "Cbc0010I After 12776000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1040.19 seconds)\n", + "Cbc0010I After 12777000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.26 seconds)\n", + "Cbc0010I After 12778000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1040.31 seconds)\n", + "Cbc0010I After 12779000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1040.38 seconds)\n", + "Cbc0010I After 12780000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.43 seconds)\n", + "Cbc0010I After 12781000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1040.49 seconds)\n", + "Cbc0010I After 12782000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1040.54 seconds)\n", + "Cbc0010I After 12783000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1040.59 seconds)\n", + "Cbc0010I After 12784000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1040.65 seconds)\n", + "Cbc0010I After 12785000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1040.72 seconds)\n", + "Cbc0010I After 12786000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.76 seconds)\n", + "Cbc0010I After 12787000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1040.83 seconds)\n", + "Cbc0010I After 12788000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.89 seconds)\n", + "Cbc0010I After 12789000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1040.96 seconds)\n", + "Cbc0010I After 12790000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1041.02 seconds)\n", + "Cbc0010I After 12791000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1041.07 seconds)\n", + "Cbc0010I After 12792000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1041.13 seconds)\n", + "Cbc0010I After 12793000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.19 seconds)\n", + "Cbc0010I After 12794000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1041.26 seconds)\n", + "Cbc0010I After 12795000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1041.32 seconds)\n", + "Cbc0010I After 12796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.39 seconds)\n", + "Cbc0010I After 12797000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.45 seconds)\n", + "Cbc0010I After 12798000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1041.50 seconds)\n", + "Cbc0010I After 12799000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1041.55 seconds)\n", + "Cbc0010I After 12800000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.62 seconds)\n", + "Cbc0010I After 12801000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.68 seconds)\n", + "Cbc0010I After 12802000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1041.74 seconds)\n", + "Cbc0010I After 12803000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.82 seconds)\n", + "Cbc0010I After 12804000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1041.88 seconds)\n", + "Cbc0010I After 12805000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.96 seconds)\n", + "Cbc0010I After 12806000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.02 seconds)\n", + "Cbc0010I After 12807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.08 seconds)\n", + "Cbc0010I After 12808000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1042.14 seconds)\n", + "Cbc0010I After 12809000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1042.21 seconds)\n", + "Cbc0010I After 12810000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1042.26 seconds)\n", + "Cbc0010I After 12811000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1042.37 seconds)\n", + "Cbc0010I After 12812000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1042.45 seconds)\n", + "Cbc0010I After 12813000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1042.51 seconds)\n", + "Cbc0010I After 12814000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1042.57 seconds)\n", + "Cbc0010I After 12815000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1042.63 seconds)\n", + "Cbc0010I After 12816000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.68 seconds)\n", + "Cbc0010I After 12817000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1042.74 seconds)\n", + "Cbc0010I After 12818000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1042.80 seconds)\n", + "Cbc0010I After 12819000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1042.86 seconds)\n", + "Cbc0010I After 12820000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1042.93 seconds)\n", + "Cbc0010I After 12821000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1043.00 seconds)\n", + "Cbc0010I After 12822000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1043.05 seconds)\n", + "Cbc0010I After 12823000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1043.12 seconds)\n", + "Cbc0010I After 12824000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1043.18 seconds)\n", + "Cbc0010I After 12825000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1043.24 seconds)\n", + "Cbc0010I After 12826000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1043.29 seconds)\n", + "Cbc0010I After 12827000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1043.35 seconds)\n", + "Cbc0010I After 12828000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1043.41 seconds)\n", + "Cbc0010I After 12829000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1043.48 seconds)\n", + "Cbc0010I After 12830000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1043.54 seconds)\n", + "Cbc0010I After 12831000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1043.61 seconds)\n", + "Cbc0010I After 12832000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1043.68 seconds)\n", + "Cbc0010I After 12833000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1043.75 seconds)\n", + "Cbc0010I After 12834000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1043.81 seconds)\n", + "Cbc0010I After 12835000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1043.86 seconds)\n", + "Cbc0010I After 12836000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1043.93 seconds)\n", + "Cbc0010I After 12837000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1043.99 seconds)\n", + "Cbc0010I After 12838000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1044.06 seconds)\n", + "Cbc0010I After 12839000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.12 seconds)\n", + "Cbc0010I After 12840000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.19 seconds)\n", + "Cbc0010I After 12841000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.26 seconds)\n", + "Cbc0010I After 12842000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1044.32 seconds)\n", + "Cbc0010I After 12843000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.38 seconds)\n", + "Cbc0010I After 12844000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.44 seconds)\n", + "Cbc0010I After 12845000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.50 seconds)\n", + "Cbc0010I After 12846000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1044.56 seconds)\n", + "Cbc0010I After 12847000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1044.62 seconds)\n", + "Cbc0010I After 12848000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.68 seconds)\n", + "Cbc0010I After 12849000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.74 seconds)\n", + "Cbc0010I After 12850000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1044.80 seconds)\n", + "Cbc0010I After 12851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.86 seconds)\n", + "Cbc0010I After 12852000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1044.92 seconds)\n", + "Cbc0010I After 12853000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1044.98 seconds)\n", + "Cbc0010I After 12854000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.06 seconds)\n", + "Cbc0010I After 12855000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.12 seconds)\n", + "Cbc0010I After 12856000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1045.18 seconds)\n", + "Cbc0010I After 12857000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1045.24 seconds)\n", + "Cbc0010I After 12858000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1045.29 seconds)\n", + "Cbc0010I After 12859000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.36 seconds)\n", + "Cbc0010I After 12860000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1045.43 seconds)\n", + "Cbc0010I After 12861000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1045.48 seconds)\n", + "Cbc0010I After 12862000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1045.53 seconds)\n", + "Cbc0010I After 12863000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1045.59 seconds)\n", + "Cbc0010I After 12864000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1045.64 seconds)\n", + "Cbc0010I After 12865000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.68 seconds)\n", + "Cbc0010I After 12866000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1045.73 seconds)\n", + "Cbc0010I After 12867000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1045.77 seconds)\n", + "Cbc0010I After 12868000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1045.81 seconds)\n", + "Cbc0010I After 12869000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1045.84 seconds)\n", + "Cbc0010I After 12870000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1045.89 seconds)\n", + "Cbc0010I After 12871000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1045.92 seconds)\n", + "Cbc0010I After 12872000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1045.98 seconds)\n", + "Cbc0010I After 12873000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1046.02 seconds)\n", + "Cbc0010I After 12874000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1046.05 seconds)\n", + "Cbc0010I After 12875000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1046.09 seconds)\n", + "Cbc0010I After 12876000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1046.13 seconds)\n", + "Cbc0010I After 12877000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1046.19 seconds)\n", + "Cbc0010I After 12878000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1046.25 seconds)\n", + "Cbc0010I After 12879000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1046.30 seconds)\n", + "Cbc0010I After 12880000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1046.36 seconds)\n", + "Cbc0010I After 12881000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1046.40 seconds)\n", + "Cbc0010I After 12882000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1046.43 seconds)\n", + "Cbc0010I After 12883000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1046.46 seconds)\n", + "Cbc0010I After 12884000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1046.49 seconds)\n", + "Cbc0010I After 12885000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1046.53 seconds)\n", + "Cbc0010I After 12886000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1046.56 seconds)\n", + "Cbc0010I After 12887000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1046.60 seconds)\n", + "Cbc0010I After 12888000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1046.66 seconds)\n", + "Cbc0010I After 12889000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1046.72 seconds)\n", + "Cbc0010I After 12890000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1046.76 seconds)\n", + "Cbc0010I After 12891000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1046.80 seconds)\n", + "Cbc0010I After 12892000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1046.84 seconds)\n", + "Cbc0010I After 12893000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1046.88 seconds)\n", + "Cbc0010I After 12894000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1046.93 seconds)\n", + "Cbc0010I After 12895000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1046.99 seconds)\n", + "Cbc0010I After 12896000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1047.05 seconds)\n", + "Cbc0010I After 12897000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1047.12 seconds)\n", + "Cbc0010I After 12898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1047.16 seconds)\n", + "Cbc0010I After 12899000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1047.19 seconds)\n", + "Cbc0010I After 12900000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1047.24 seconds)\n", + "Cbc0010I After 12901000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1047.30 seconds)\n", + "Cbc0010I After 12902000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1047.33 seconds)\n", + "Cbc0010I After 12903000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1047.39 seconds)\n", + "Cbc0010I After 12904000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1047.45 seconds)\n", + "Cbc0010I After 12905000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1047.48 seconds)\n", + "Cbc0010I After 12906000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1047.52 seconds)\n", + "Cbc0010I After 12907000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1047.56 seconds)\n", + "Cbc0010I After 12908000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1047.60 seconds)\n", + "Cbc0010I After 12909000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1047.65 seconds)\n", + "Cbc0010I After 12910000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1047.68 seconds)\n", + "Cbc0010I After 12911000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1047.73 seconds)\n", + "Cbc0010I After 12912000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1047.77 seconds)\n", + "Cbc0010I After 12913000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1047.82 seconds)\n", + "Cbc0010I After 12914000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1047.87 seconds)\n", + "Cbc0010I After 12915000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1047.93 seconds)\n", + "Cbc0010I After 12916000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1047.97 seconds)\n", + "Cbc0010I After 12917000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1048.01 seconds)\n", + "Cbc0010I After 12918000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1048.05 seconds)\n", + "Cbc0010I After 12919000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1048.11 seconds)\n", + "Cbc0010I After 12920000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1048.16 seconds)\n", + "Cbc0010I After 12921000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1048.20 seconds)\n", + "Cbc0010I After 12922000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1048.24 seconds)\n", + "Cbc0010I After 12923000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1048.28 seconds)\n", + "Cbc0010I After 12924000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1048.35 seconds)\n", + "Cbc0010I After 12925000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1048.40 seconds)\n", + "Cbc0010I After 12926000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1048.44 seconds)\n", + "Cbc0010I After 12927000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1048.50 seconds)\n", + "Cbc0010I After 12928000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1048.55 seconds)\n", + "Cbc0010I After 12929000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1048.60 seconds)\n", + "Cbc0010I After 12930000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1048.66 seconds)\n", + "Cbc0010I After 12931000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1048.71 seconds)\n", + "Cbc0010I After 12932000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1048.76 seconds)\n", + "Cbc0010I After 12933000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1048.82 seconds)\n", + "Cbc0010I After 12934000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1048.87 seconds)\n", + "Cbc0010I After 12935000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1048.92 seconds)\n", + "Cbc0010I After 12936000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1048.97 seconds)\n", + "Cbc0010I After 12937000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1049.03 seconds)\n", + "Cbc0010I After 12938000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1049.09 seconds)\n", + "Cbc0010I After 12939000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1049.15 seconds)\n", + "Cbc0010I After 12940000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1049.20 seconds)\n", + "Cbc0010I After 12941000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1049.25 seconds)\n", + "Cbc0010I After 12942000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1049.30 seconds)\n", + "Cbc0010I After 12943000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1049.34 seconds)\n", + "Cbc0010I After 12944000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1049.39 seconds)\n", + "Cbc0010I After 12945000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1049.45 seconds)\n", + "Cbc0010I After 12946000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1049.51 seconds)\n", + "Cbc0010I After 12947000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1049.56 seconds)\n", + "Cbc0010I After 12948000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1049.61 seconds)\n", + "Cbc0010I After 12949000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1049.66 seconds)\n", + "Cbc0010I After 12950000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1049.72 seconds)\n", + "Cbc0010I After 12951000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1049.78 seconds)\n", + "Cbc0010I After 12952000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1049.82 seconds)\n", + "Cbc0010I After 12953000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1049.88 seconds)\n", + "Cbc0010I After 12954000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1049.92 seconds)\n", + "Cbc0010I After 12955000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1049.98 seconds)\n", + "Cbc0010I After 12956000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1050.03 seconds)\n", + "Cbc0010I After 12957000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.08 seconds)\n", + "Cbc0010I After 12958000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1050.13 seconds)\n", + "Cbc0010I After 12959000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.18 seconds)\n", + "Cbc0010I After 12960000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.24 seconds)\n", + "Cbc0010I After 12961000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.29 seconds)\n", + "Cbc0010I After 12962000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1050.35 seconds)\n", + "Cbc0010I After 12963000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1050.40 seconds)\n", + "Cbc0010I After 12964000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1050.45 seconds)\n", + "Cbc0010I After 12965000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.50 seconds)\n", + "Cbc0010I After 12966000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1050.55 seconds)\n", + "Cbc0010I After 12967000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1050.60 seconds)\n", + "Cbc0010I After 12968000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1050.65 seconds)\n", + "Cbc0010I After 12969000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.69 seconds)\n", + "Cbc0010I After 12970000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1050.75 seconds)\n", + "Cbc0010I After 12971000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1050.80 seconds)\n", + "Cbc0010I After 12972000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1050.84 seconds)\n", + "Cbc0010I After 12973000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.91 seconds)\n", + "Cbc0010I After 12974000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1050.97 seconds)\n", + "Cbc0010I After 12975000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1051.02 seconds)\n", + "Cbc0010I After 12976000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1051.10 seconds)\n", + "Cbc0010I After 12977000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1051.14 seconds)\n", + "Cbc0010I After 12978000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1051.19 seconds)\n", + "Cbc0010I After 12979000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1051.26 seconds)\n", + "Cbc0010I After 12980000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1051.31 seconds)\n", + "Cbc0010I After 12981000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1051.35 seconds)\n", + "Cbc0010I After 12982000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1051.40 seconds)\n", + "Cbc0010I After 12983000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1051.46 seconds)\n", + "Cbc0010I After 12984000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1051.50 seconds)\n", + "Cbc0010I After 12985000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1051.55 seconds)\n", + "Cbc0010I After 12986000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1051.62 seconds)\n", + "Cbc0010I After 12987000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1051.66 seconds)\n", + "Cbc0010I After 12988000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1051.70 seconds)\n", + "Cbc0010I After 12989000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1051.78 seconds)\n", + "Cbc0010I After 12990000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1051.83 seconds)\n", + "Cbc0010I After 12991000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1051.87 seconds)\n", + "Cbc0010I After 12992000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1051.93 seconds)\n", + "Cbc0010I After 12993000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1052.00 seconds)\n", + "Cbc0010I After 12994000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1052.05 seconds)\n", + "Cbc0010I After 12995000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1052.10 seconds)\n", + "Cbc0010I After 12996000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1052.15 seconds)\n", + "Cbc0010I After 12997000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1052.22 seconds)\n", + "Cbc0010I After 12998000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1052.26 seconds)\n", + "Cbc0010I After 12999000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1052.31 seconds)\n", + "Cbc0010I After 13000000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1052.35 seconds)\n", + "Cbc0010I After 13001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1052.42 seconds)\n", + "Cbc0010I After 13002000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1052.47 seconds)\n", + "Cbc0010I After 13003000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1052.51 seconds)\n", + "Cbc0010I After 13004000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1052.58 seconds)\n", + "Cbc0010I After 13005000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1052.63 seconds)\n", + "Cbc0010I After 13006000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1052.68 seconds)\n", + "Cbc0010I After 13007000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1052.72 seconds)\n", + "Cbc0010I After 13008000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1052.79 seconds)\n", + "Cbc0010I After 13009000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1052.85 seconds)\n", + "Cbc0010I After 13010000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1052.89 seconds)\n", + "Cbc0010I After 13011000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1052.93 seconds)\n", + "Cbc0010I After 13012000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1052.99 seconds)\n", + "Cbc0010I After 13013000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1053.06 seconds)\n", + "Cbc0010I After 13014000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1053.11 seconds)\n", + "Cbc0010I After 13015000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1053.15 seconds)\n", + "Cbc0010I After 13016000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1053.21 seconds)\n", + "Cbc0010I After 13017000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1053.28 seconds)\n", + "Cbc0010I After 13018000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1053.33 seconds)\n", + "Cbc0010I After 13019000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1053.38 seconds)\n", + "Cbc0010I After 13020000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1053.42 seconds)\n", + "Cbc0010I After 13021000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1053.49 seconds)\n", + "Cbc0010I After 13022000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.55 seconds)\n", + "Cbc0010I After 13023000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1053.58 seconds)\n", + "Cbc0010I After 13024000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1053.61 seconds)\n", + "Cbc0010I After 13025000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.68 seconds)\n", + "Cbc0010I After 13026000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.74 seconds)\n", + "Cbc0010I After 13027000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1053.78 seconds)\n", + "Cbc0010I After 13028000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1053.82 seconds)\n", + "Cbc0010I After 13029000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1053.86 seconds)\n", + "Cbc0010I After 13030000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1053.93 seconds)\n", + "Cbc0010I After 13031000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1053.99 seconds)\n", + "Cbc0010I After 13032000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1054.03 seconds)\n", + "Cbc0010I After 13033000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1054.08 seconds)\n", + "Cbc0010I After 13034000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1054.12 seconds)\n", + "Cbc0010I After 13035000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1054.18 seconds)\n", + "Cbc0010I After 13036000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1054.24 seconds)\n", + "Cbc0010I After 13037000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1054.28 seconds)\n", + "Cbc0010I After 13038000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1054.32 seconds)\n", + "Cbc0010I After 13039000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1054.36 seconds)\n", + "Cbc0010I After 13040000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1054.42 seconds)\n", + "Cbc0010I After 13041000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1054.49 seconds)\n", + "Cbc0010I After 13042000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1054.54 seconds)\n", + "Cbc0010I After 13043000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1054.59 seconds)\n", + "Cbc0010I After 13044000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1054.63 seconds)\n", + "Cbc0010I After 13045000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1054.68 seconds)\n", + "Cbc0010I After 13046000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1054.75 seconds)\n", + "Cbc0010I After 13047000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1054.80 seconds)\n", + "Cbc0010I After 13048000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1054.84 seconds)\n", + "Cbc0010I After 13049000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1054.87 seconds)\n", + "Cbc0010I After 13050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1054.91 seconds)\n", + "Cbc0010I After 13051000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1054.97 seconds)\n", + "Cbc0010I After 13052000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1055.04 seconds)\n", + "Cbc0010I After 13053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1055.08 seconds)\n", + "Cbc0010I After 13054000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1055.15 seconds)\n", + "Cbc0010I After 13055000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1055.20 seconds)\n", + "Cbc0010I After 13056000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1055.28 seconds)\n", + "Cbc0010I After 13057000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1055.34 seconds)\n", + "Cbc0010I After 13058000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1055.40 seconds)\n", + "Cbc0010I After 13059000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1055.47 seconds)\n", + "Cbc0010I After 13060000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1055.52 seconds)\n", + "Cbc0010I After 13061000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1055.59 seconds)\n", + "Cbc0010I After 13062000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1055.66 seconds)\n", + "Cbc0010I After 13063000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1055.71 seconds)\n", + "Cbc0010I After 13064000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1055.78 seconds)\n", + "Cbc0010I After 13065000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1055.84 seconds)\n", + "Cbc0010I After 13066000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1055.89 seconds)\n", + "Cbc0010I After 13067000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1055.97 seconds)\n", + "Cbc0010I After 13068000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1056.03 seconds)\n", + "Cbc0010I After 13069000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1056.09 seconds)\n", + "Cbc0010I After 13070000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1056.16 seconds)\n", + "Cbc0010I After 13071000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1056.21 seconds)\n", + "Cbc0010I After 13072000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1056.28 seconds)\n", + "Cbc0010I After 13073000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1056.35 seconds)\n", + "Cbc0010I After 13074000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1056.40 seconds)\n", + "Cbc0010I After 13075000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1056.47 seconds)\n", + "Cbc0010I After 13076000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1056.53 seconds)\n", + "Cbc0010I After 13077000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1056.59 seconds)\n", + "Cbc0010I After 13078000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1056.67 seconds)\n", + "Cbc0010I After 13079000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1056.72 seconds)\n", + "Cbc0010I After 13080000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1056.79 seconds)\n", + "Cbc0010I After 13081000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1056.86 seconds)\n", + "Cbc0010I After 13082000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1056.92 seconds)\n", + "Cbc0010I After 13083000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1056.98 seconds)\n", + "Cbc0010I After 13084000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1057.05 seconds)\n", + "Cbc0010I After 13085000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.12 seconds)\n", + "Cbc0010I After 13086000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1057.18 seconds)\n", + "Cbc0010I After 13087000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1057.24 seconds)\n", + "Cbc0010I After 13088000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1057.31 seconds)\n", + "Cbc0010I After 13089000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1057.38 seconds)\n", + "Cbc0010I After 13090000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.44 seconds)\n", + "Cbc0010I After 13091000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1057.50 seconds)\n", + "Cbc0010I After 13092000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1057.55 seconds)\n", + "Cbc0010I After 13093000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.60 seconds)\n", + "Cbc0010I After 13094000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1057.66 seconds)\n", + "Cbc0010I After 13095000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1057.73 seconds)\n", + "Cbc0010I After 13096000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1057.79 seconds)\n", + "Cbc0010I After 13097000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1057.87 seconds)\n", + "Cbc0010I After 13098000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1057.93 seconds)\n", + "Cbc0010I After 13099000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1057.99 seconds)\n", + "Cbc0010I After 13100000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1058.06 seconds)\n", + "Cbc0010I After 13101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1058.13 seconds)\n", + "Cbc0010I After 13102000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1058.18 seconds)\n", + "Cbc0010I After 13103000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1058.31 seconds)\n", + "Cbc0010I After 13104000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1058.37 seconds)\n", + "Cbc0010I After 13105000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1058.47 seconds)\n", + "Cbc0010I After 13106000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1058.54 seconds)\n", + "Cbc0010I After 13107000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1058.60 seconds)\n", + "Cbc0010I After 13108000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1058.67 seconds)\n", + "Cbc0010I After 13109000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1058.73 seconds)\n", + "Cbc0010I After 13110000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1058.78 seconds)\n", + "Cbc0010I After 13111000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1058.85 seconds)\n", + "Cbc0010I After 13112000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1058.91 seconds)\n", + "Cbc0010I After 13113000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1058.97 seconds)\n", + "Cbc0010I After 13114000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1059.03 seconds)\n", + "Cbc0010I After 13115000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1059.09 seconds)\n", + "Cbc0010I After 13116000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1059.15 seconds)\n", + "Cbc0010I After 13117000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.21 seconds)\n", + "Cbc0010I After 13118000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1059.27 seconds)\n", + "Cbc0010I After 13119000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1059.33 seconds)\n", + "Cbc0010I After 13120000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1059.40 seconds)\n", + "Cbc0010I After 13121000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1059.47 seconds)\n", + "Cbc0010I After 13122000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1059.53 seconds)\n", + "Cbc0010I After 13123000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1059.59 seconds)\n", + "Cbc0010I After 13124000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1059.64 seconds)\n", + "Cbc0010I After 13125000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1059.71 seconds)\n", + "Cbc0010I After 13126000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1059.76 seconds)\n", + "Cbc0010I After 13127000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1059.82 seconds)\n", + "Cbc0010I After 13128000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.88 seconds)\n", + "Cbc0010I After 13129000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.93 seconds)\n", + "Cbc0010I After 13130000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1060.00 seconds)\n", + "Cbc0010I After 13131000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.06 seconds)\n", + "Cbc0010I After 13132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1060.12 seconds)\n", + "Cbc0010I After 13133000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1060.19 seconds)\n", + "Cbc0010I After 13134000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1060.24 seconds)\n", + "Cbc0010I After 13135000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1060.30 seconds)\n", + "Cbc0010I After 13136000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1060.34 seconds)\n", + "Cbc0010I After 13137000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1060.40 seconds)\n", + "Cbc0010I After 13138000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1060.45 seconds)\n", + "Cbc0010I After 13139000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1060.51 seconds)\n", + "Cbc0010I After 13140000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1060.56 seconds)\n", + "Cbc0010I After 13141000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1060.62 seconds)\n", + "Cbc0010I After 13142000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.67 seconds)\n", + "Cbc0010I After 13143000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1060.72 seconds)\n", + "Cbc0010I After 13144000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1060.78 seconds)\n", + "Cbc0010I After 13145000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1060.84 seconds)\n", + "Cbc0010I After 13146000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1060.93 seconds)\n", + "Cbc0010I After 13147000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.99 seconds)\n", + "Cbc0010I After 13148000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1061.06 seconds)\n", + "Cbc0010I After 13149000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1061.12 seconds)\n", + "Cbc0010I After 13150000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1061.17 seconds)\n", + "Cbc0010I After 13151000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1061.24 seconds)\n", + "Cbc0010I After 13152000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1061.31 seconds)\n", + "Cbc0010I After 13153000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1061.37 seconds)\n", + "Cbc0010I After 13154000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1061.42 seconds)\n", + "Cbc0010I After 13155000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1061.49 seconds)\n", + "Cbc0010I After 13156000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1061.55 seconds)\n", + "Cbc0010I After 13157000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.61 seconds)\n", + "Cbc0010I After 13158000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1061.67 seconds)\n", + "Cbc0010I After 13159000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1061.72 seconds)\n", + "Cbc0010I After 13160000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.79 seconds)\n", + "Cbc0010I After 13161000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.85 seconds)\n", + "Cbc0010I After 13162000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1061.91 seconds)\n", + "Cbc0010I After 13163000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1061.97 seconds)\n", + "Cbc0010I After 13164000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1062.02 seconds)\n", + "Cbc0010I After 13165000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.07 seconds)\n", + "Cbc0010I After 13166000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1062.13 seconds)\n", + "Cbc0010I After 13167000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1062.19 seconds)\n", + "Cbc0010I After 13168000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1062.25 seconds)\n", + "Cbc0010I After 13169000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1062.31 seconds)\n", + "Cbc0010I After 13170000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1062.37 seconds)\n", + "Cbc0010I After 13171000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1062.43 seconds)\n", + "Cbc0010I After 13172000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.49 seconds)\n", + "Cbc0010I After 13173000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1062.54 seconds)\n", + "Cbc0010I After 13174000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.59 seconds)\n", + "Cbc0010I After 13175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1062.64 seconds)\n", + "Cbc0010I After 13176000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1062.70 seconds)\n", + "Cbc0010I After 13177000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1062.76 seconds)\n", + "Cbc0010I After 13178000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1062.82 seconds)\n", + "Cbc0010I After 13179000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1062.87 seconds)\n", + "Cbc0010I After 13180000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1062.92 seconds)\n", + "Cbc0010I After 13181000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1062.97 seconds)\n", + "Cbc0010I After 13182000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1063.02 seconds)\n", + "Cbc0010I After 13183000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1063.08 seconds)\n", + "Cbc0010I After 13184000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1063.13 seconds)\n", + "Cbc0010I After 13185000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1063.18 seconds)\n", + "Cbc0010I After 13186000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1063.24 seconds)\n", + "Cbc0010I After 13187000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1063.29 seconds)\n", + "Cbc0010I After 13188000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1063.36 seconds)\n", + "Cbc0010I After 13189000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1063.42 seconds)\n", + "Cbc0010I After 13190000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1063.47 seconds)\n", + "Cbc0010I After 13191000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.55 seconds)\n", + "Cbc0010I After 13192000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.62 seconds)\n", + "Cbc0010I After 13193000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.69 seconds)\n", + "Cbc0010I After 13194000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.74 seconds)\n", + "Cbc0010I After 13195000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1063.80 seconds)\n", + "Cbc0010I After 13196000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1063.85 seconds)\n", + "Cbc0010I After 13197000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1063.90 seconds)\n", + "Cbc0010I After 13198000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1063.95 seconds)\n", + "Cbc0010I After 13199000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.99 seconds)\n", + "Cbc0010I After 13200000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1064.03 seconds)\n", + "Cbc0010I After 13201000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1064.06 seconds)\n", + "Cbc0010I After 13202000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1064.09 seconds)\n", + "Cbc0010I After 13203000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1064.14 seconds)\n", + "Cbc0010I After 13204000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1064.17 seconds)\n", + "Cbc0010I After 13205000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1064.21 seconds)\n", + "Cbc0010I After 13206000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1064.25 seconds)\n", + "Cbc0010I After 13207000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1064.28 seconds)\n", + "Cbc0010I After 13208000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1064.33 seconds)\n", + "Cbc0010I After 13209000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1064.40 seconds)\n", + "Cbc0010I After 13210000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1064.45 seconds)\n", + "Cbc0010I After 13211000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1064.51 seconds)\n", + "Cbc0010I After 13212000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1064.57 seconds)\n", + "Cbc0010I After 13213000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1064.62 seconds)\n", + "Cbc0010I After 13214000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1064.69 seconds)\n", + "Cbc0010I After 13215000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1064.73 seconds)\n", + "Cbc0010I After 13216000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1064.77 seconds)\n", + "Cbc0010I After 13217000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1064.81 seconds)\n", + "Cbc0010I After 13218000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1064.85 seconds)\n", + "Cbc0010I After 13219000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1064.92 seconds)\n", + "Cbc0010I After 13220000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1064.95 seconds)\n", + "Cbc0010I After 13221000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1065.01 seconds)\n", + "Cbc0010I After 13222000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1065.07 seconds)\n", + "Cbc0010I After 13223000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1065.10 seconds)\n", + "Cbc0010I After 13224000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1065.14 seconds)\n", + "Cbc0010I After 13225000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1065.16 seconds)\n", + "Cbc0010I After 13226000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1065.20 seconds)\n", + "Cbc0010I After 13227000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1065.23 seconds)\n", + "Cbc0010I After 13228000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1065.28 seconds)\n", + "Cbc0010I After 13229000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1065.32 seconds)\n", + "Cbc0010I After 13230000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1065.38 seconds)\n", + "Cbc0010I After 13231000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1065.44 seconds)\n", + "Cbc0010I After 13232000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1065.48 seconds)\n", + "Cbc0010I After 13233000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1065.53 seconds)\n", + "Cbc0010I After 13234000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1065.58 seconds)\n", + "Cbc0010I After 13235000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1065.64 seconds)\n", + "Cbc0010I After 13236000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1065.69 seconds)\n", + "Cbc0010I After 13237000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1065.74 seconds)\n", + "Cbc0010I After 13238000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1065.80 seconds)\n", + "Cbc0010I After 13239000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1065.84 seconds)\n", + "Cbc0010I After 13240000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1065.88 seconds)\n", + "Cbc0010I After 13241000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1065.94 seconds)\n", + "Cbc0010I After 13242000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1066.00 seconds)\n", + "Cbc0010I After 13243000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1066.07 seconds)\n", + "Cbc0010I After 13244000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1066.12 seconds)\n", + "Cbc0010I After 13245000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1066.23 seconds)\n", + "Cbc0010I After 13246000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1066.38 seconds)\n", + "Cbc0010I After 13247000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1066.49 seconds)\n", + "Cbc0010I After 13248000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1066.56 seconds)\n", + "Cbc0010I After 13249000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1066.68 seconds)\n", + "Cbc0010I After 13250000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1066.84 seconds)\n", + "Cbc0010I After 13251000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1067.06 seconds)\n", + "Cbc0010I After 13252000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1067.29 seconds)\n", + "Cbc0010I After 13253000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1067.50 seconds)\n", + "Cbc0010I After 13254000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1067.69 seconds)\n", + "Cbc0010I After 13255000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1067.87 seconds)\n", + "Cbc0010I After 13256000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1068.03 seconds)\n", + "Cbc0010I After 13257000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1068.24 seconds)\n", + "Cbc0010I After 13258000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1068.53 seconds)\n", + "Cbc0010I After 13259000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1068.76 seconds)\n", + "Cbc0010I After 13260000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1068.99 seconds)\n", + "Cbc0010I After 13261000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1069.18 seconds)\n", + "Cbc0010I After 13262000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1069.36 seconds)\n", + "Cbc0010I After 13263000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1069.48 seconds)\n", + "Cbc0010I After 13264000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1069.64 seconds)\n", + "Cbc0010I After 13265000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1069.80 seconds)\n", + "Cbc0010I After 13266000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1069.95 seconds)\n", + "Cbc0010I After 13267000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1070.09 seconds)\n", + "Cbc0010I After 13268000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1070.20 seconds)\n", + "Cbc0010I After 13269000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1070.35 seconds)\n", + "Cbc0010I After 13270000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1070.48 seconds)\n", + "Cbc0010I After 13271000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1070.59 seconds)\n", + "Cbc0010I After 13272000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1070.73 seconds)\n", + "Cbc0010I After 13273000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1070.83 seconds)\n", + "Cbc0010I After 13274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1070.94 seconds)\n", + "Cbc0010I After 13275000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1071.04 seconds)\n", + "Cbc0010I After 13276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1071.14 seconds)\n", + "Cbc0010I After 13277000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1071.26 seconds)\n", + "Cbc0010I After 13278000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1071.36 seconds)\n", + "Cbc0010I After 13279000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1071.45 seconds)\n", + "Cbc0010I After 13280000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1071.53 seconds)\n", + "Cbc0010I After 13281000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1071.62 seconds)\n", + "Cbc0010I After 13282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1071.68 seconds)\n", + "Cbc0010I After 13283000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1071.75 seconds)\n", + "Cbc0010I After 13284000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1071.81 seconds)\n", + "Cbc0010I After 13285000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1071.90 seconds)\n", + "Cbc0010I After 13286000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1072.01 seconds)\n", + "Cbc0010I After 13287000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1072.08 seconds)\n", + "Cbc0010I After 13288000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1072.18 seconds)\n", + "Cbc0010I After 13289000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1072.27 seconds)\n", + "Cbc0010I After 13290000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1072.33 seconds)\n", + "Cbc0010I After 13291000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1072.40 seconds)\n", + "Cbc0010I After 13292000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1072.48 seconds)\n", + "Cbc0010I After 13293000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1072.53 seconds)\n", + "Cbc0010I After 13294000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1072.58 seconds)\n", + "Cbc0010I After 13295000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1072.67 seconds)\n", + "Cbc0010I After 13296000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1072.74 seconds)\n", + "Cbc0010I After 13297000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1072.79 seconds)\n", + "Cbc0010I After 13298000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1072.85 seconds)\n", + "Cbc0010I After 13299000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1072.93 seconds)\n", + "Cbc0010I After 13300000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1072.99 seconds)\n", + "Cbc0010I After 13301000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1073.05 seconds)\n", + "Cbc0010I After 13302000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1073.10 seconds)\n", + "Cbc0010I After 13303000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1073.18 seconds)\n", + "Cbc0010I After 13304000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1073.24 seconds)\n", + "Cbc0010I After 13305000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1073.28 seconds)\n", + "Cbc0010I After 13306000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1073.32 seconds)\n", + "Cbc0010I After 13307000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1073.40 seconds)\n", + "Cbc0010I After 13308000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1073.45 seconds)\n", + "Cbc0010I After 13309000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1073.50 seconds)\n", + "Cbc0010I After 13310000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1073.55 seconds)\n", + "Cbc0010I After 13311000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1073.61 seconds)\n", + "Cbc0010I After 13312000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1073.67 seconds)\n", + "Cbc0010I After 13313000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1073.74 seconds)\n", + "Cbc0010I After 13314000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1073.82 seconds)\n", + "Cbc0010I After 13315000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1073.88 seconds)\n", + "Cbc0010I After 13316000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1073.98 seconds)\n", + "Cbc0010I After 13317000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1074.06 seconds)\n", + "Cbc0010I After 13318000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1074.12 seconds)\n", + "Cbc0010I After 13319000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1074.21 seconds)\n", + "Cbc0010I After 13320000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1074.31 seconds)\n", + "Cbc0010I After 13321000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1074.37 seconds)\n", + "Cbc0010I After 13322000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1074.42 seconds)\n", + "Cbc0010I After 13323000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1074.47 seconds)\n", + "Cbc0010I After 13324000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1074.55 seconds)\n", + "Cbc0010I After 13325000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1074.63 seconds)\n", + "Cbc0010I After 13326000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1074.70 seconds)\n", + "Cbc0010I After 13327000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1074.79 seconds)\n", + "Cbc0010I After 13328000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1074.85 seconds)\n", + "Cbc0010I After 13329000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1074.90 seconds)\n", + "Cbc0010I After 13330000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1074.97 seconds)\n", + "Cbc0010I After 13331000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1075.04 seconds)\n", + "Cbc0010I After 13332000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1075.09 seconds)\n", + "Cbc0010I After 13333000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1075.14 seconds)\n", + "Cbc0010I After 13334000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1075.20 seconds)\n", + "Cbc0010I After 13335000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1075.27 seconds)\n", + "Cbc0010I After 13336000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1075.34 seconds)\n", + "Cbc0010I After 13337000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1075.40 seconds)\n", + "Cbc0010I After 13338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1075.51 seconds)\n", + "Cbc0010I After 13339000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1075.59 seconds)\n", + "Cbc0010I After 13340000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1075.65 seconds)\n", + "Cbc0010I After 13341000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1075.74 seconds)\n", + "Cbc0010I After 13342000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1075.83 seconds)\n", + "Cbc0010I After 13343000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1075.89 seconds)\n", + "Cbc0010I After 13344000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1075.98 seconds)\n", + "Cbc0010I After 13345000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1076.07 seconds)\n", + "Cbc0010I After 13346000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1076.13 seconds)\n", + "Cbc0010I After 13347000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1076.23 seconds)\n", + "Cbc0010I After 13348000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1076.33 seconds)\n", + "Cbc0010I After 13349000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1076.44 seconds)\n", + "Cbc0010I After 13350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1076.56 seconds)\n", + "Cbc0010I After 13351000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1076.70 seconds)\n", + "Cbc0010I After 13352000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1076.78 seconds)\n", + "Cbc0010I After 13353000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1076.89 seconds)\n", + "Cbc0010I After 13354000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.00 seconds)\n", + "Cbc0010I After 13355000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1077.09 seconds)\n", + "Cbc0010I After 13356000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1077.19 seconds)\n", + "Cbc0010I After 13357000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1077.28 seconds)\n", + "Cbc0010I After 13358000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1077.34 seconds)\n", + "Cbc0010I After 13359000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1077.41 seconds)\n", + "Cbc0010I After 13360000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1077.49 seconds)\n", + "Cbc0010I After 13361000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1077.57 seconds)\n", + "Cbc0010I After 13362000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1077.64 seconds)\n", + "Cbc0010I After 13363000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.71 seconds)\n", + "Cbc0010I After 13364000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1077.78 seconds)\n", + "Cbc0010I After 13365000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.85 seconds)\n", + "Cbc0010I After 13366000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.91 seconds)\n", + "Cbc0010I After 13367000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1077.97 seconds)\n", + "Cbc0010I After 13368000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1078.04 seconds)\n", + "Cbc0010I After 13369000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1078.10 seconds)\n", + "Cbc0010I After 13370000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1078.16 seconds)\n", + "Cbc0010I After 13371000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1078.22 seconds)\n", + "Cbc0010I After 13372000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1078.29 seconds)\n", + "Cbc0010I After 13373000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1078.36 seconds)\n", + "Cbc0010I After 13374000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1078.42 seconds)\n", + "Cbc0010I After 13375000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1078.47 seconds)\n", + "Cbc0010I After 13376000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1078.56 seconds)\n", + "Cbc0010I After 13377000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1078.63 seconds)\n", + "Cbc0010I After 13378000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1078.70 seconds)\n", + "Cbc0010I After 13379000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1078.77 seconds)\n", + "Cbc0010I After 13380000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1078.83 seconds)\n", + "Cbc0010I After 13381000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1078.89 seconds)\n", + "Cbc0010I After 13382000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1078.95 seconds)\n", + "Cbc0010I After 13383000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.02 seconds)\n", + "Cbc0010I After 13384000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1079.10 seconds)\n", + "Cbc0010I After 13385000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1079.17 seconds)\n", + "Cbc0010I After 13386000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1079.25 seconds)\n", + "Cbc0010I After 13387000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.32 seconds)\n", + "Cbc0010I After 13388000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.40 seconds)\n", + "Cbc0010I After 13389000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1079.49 seconds)\n", + "Cbc0010I After 13390000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1079.57 seconds)\n", + "Cbc0010I After 13391000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1079.64 seconds)\n", + "Cbc0010I After 13392000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1079.72 seconds)\n", + "Cbc0010I After 13393000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1079.81 seconds)\n", + "Cbc0010I After 13394000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1079.88 seconds)\n", + "Cbc0010I After 13395000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1080.08 seconds)\n", + "Cbc0010I After 13396000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1080.20 seconds)\n", + "Cbc0010I After 13397000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1080.32 seconds)\n", + "Cbc0010I After 13398000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1080.42 seconds)\n", + "Cbc0010I After 13399000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1080.51 seconds)\n", + "Cbc0010I After 13400000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1080.60 seconds)\n", + "Cbc0010I After 13401000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1080.68 seconds)\n", + "Cbc0010I After 13402000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1080.79 seconds)\n", + "Cbc0010I After 13403000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1080.87 seconds)\n", + "Cbc0010I After 13404000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1080.96 seconds)\n", + "Cbc0010I After 13405000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1081.04 seconds)\n", + "Cbc0010I After 13406000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1081.13 seconds)\n", + "Cbc0010I After 13407000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1081.23 seconds)\n", + "Cbc0010I After 13408000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1081.33 seconds)\n", + "Cbc0010I After 13409000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1081.42 seconds)\n", + "Cbc0010I After 13410000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1081.52 seconds)\n", + "Cbc0010I After 13411000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1081.58 seconds)\n", + "Cbc0010I After 13412000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1081.65 seconds)\n", + "Cbc0010I After 13413000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1081.72 seconds)\n", + "Cbc0010I After 13414000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1081.79 seconds)\n", + "Cbc0010I After 13415000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1081.85 seconds)\n", + "Cbc0010I After 13416000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1081.92 seconds)\n", + "Cbc0010I After 13417000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.00 seconds)\n", + "Cbc0010I After 13418000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1082.06 seconds)\n", + "Cbc0010I After 13419000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.15 seconds)\n", + "Cbc0010I After 13420000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1082.23 seconds)\n", + "Cbc0010I After 13421000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1082.31 seconds)\n", + "Cbc0010I After 13422000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1082.37 seconds)\n", + "Cbc0010I After 13423000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1082.44 seconds)\n", + "Cbc0010I After 13424000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1082.50 seconds)\n", + "Cbc0010I After 13425000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1082.56 seconds)\n", + "Cbc0010I After 13426000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1082.62 seconds)\n", + "Cbc0010I After 13427000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1082.69 seconds)\n", + "Cbc0010I After 13428000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.76 seconds)\n", + "Cbc0010I After 13429000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1082.83 seconds)\n", + "Cbc0010I After 13430000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1082.90 seconds)\n", + "Cbc0010I After 13431000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1082.96 seconds)\n", + "Cbc0010I After 13432000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1083.02 seconds)\n", + "Cbc0010I After 13433000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1083.09 seconds)\n", + "Cbc0010I After 13434000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1083.14 seconds)\n", + "Cbc0010I After 13435000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1083.21 seconds)\n", + "Cbc0010I After 13436000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1083.28 seconds)\n", + "Cbc0010I After 13437000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1083.37 seconds)\n", + "Cbc0010I After 13438000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1083.46 seconds)\n", + "Cbc0010I After 13439000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1083.53 seconds)\n", + "Cbc0010I After 13440000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1083.61 seconds)\n", + "Cbc0010I After 13441000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1083.67 seconds)\n", + "Cbc0010I After 13442000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1083.74 seconds)\n", + "Cbc0010I After 13443000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1083.81 seconds)\n", + "Cbc0010I After 13444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1083.87 seconds)\n", + "Cbc0010I After 13445000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1083.94 seconds)\n", + "Cbc0010I After 13446000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1084.00 seconds)\n", + "Cbc0010I After 13447000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1084.06 seconds)\n", + "Cbc0010I After 13448000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1084.14 seconds)\n", + "Cbc0010I After 13449000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1084.20 seconds)\n", + "Cbc0010I After 13450000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.26 seconds)\n", + "Cbc0010I After 13451000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1084.33 seconds)\n", + "Cbc0010I After 13452000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1084.39 seconds)\n", + "Cbc0010I After 13453000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.46 seconds)\n", + "Cbc0010I After 13454000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1084.52 seconds)\n", + "Cbc0010I After 13455000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1084.58 seconds)\n", + "Cbc0010I After 13456000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1084.64 seconds)\n", + "Cbc0010I After 13457000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.70 seconds)\n", + "Cbc0010I After 13458000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1084.76 seconds)\n", + "Cbc0010I After 13459000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1084.81 seconds)\n", + "Cbc0010I After 13460000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1084.87 seconds)\n", + "Cbc0010I After 13461000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1084.93 seconds)\n", + "Cbc0010I After 13462000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1084.99 seconds)\n", + "Cbc0010I After 13463000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1085.06 seconds)\n", + "Cbc0010I After 13464000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1085.12 seconds)\n", + "Cbc0010I After 13465000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1085.18 seconds)\n", + "Cbc0010I After 13466000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1085.24 seconds)\n", + "Cbc0010I After 13467000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1085.30 seconds)\n", + "Cbc0010I After 13468000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1085.37 seconds)\n", + "Cbc0010I After 13469000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1085.43 seconds)\n", + "Cbc0010I After 13470000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1085.49 seconds)\n", + "Cbc0010I After 13471000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1085.56 seconds)\n", + "Cbc0010I After 13472000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1085.62 seconds)\n", + "Cbc0010I After 13473000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1085.68 seconds)\n", + "Cbc0010I After 13474000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1085.74 seconds)\n", + "Cbc0010I After 13475000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1085.80 seconds)\n", + "Cbc0010I After 13476000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1085.88 seconds)\n", + "Cbc0010I After 13477000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1085.94 seconds)\n", + "Cbc0010I After 13478000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.01 seconds)\n", + "Cbc0010I After 13479000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1086.07 seconds)\n", + "Cbc0010I After 13480000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1086.13 seconds)\n", + "Cbc0010I After 13481000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.20 seconds)\n", + "Cbc0010I After 13482000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.26 seconds)\n", + "Cbc0010I After 13483000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1086.32 seconds)\n", + "Cbc0010I After 13484000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.38 seconds)\n", + "Cbc0010I After 13485000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1086.44 seconds)\n", + "Cbc0010I After 13486000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.51 seconds)\n", + "Cbc0010I After 13487000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1086.56 seconds)\n", + "Cbc0010I After 13488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1086.62 seconds)\n", + "Cbc0010I After 13489000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1086.68 seconds)\n", + "Cbc0010I After 13490000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.75 seconds)\n", + "Cbc0010I After 13491000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1086.81 seconds)\n", + "Cbc0010I After 13492000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1086.87 seconds)\n", + "Cbc0010I After 13493000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.92 seconds)\n", + "Cbc0010I After 13494000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1086.98 seconds)\n", + "Cbc0010I After 13495000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1087.04 seconds)\n", + "Cbc0010I After 13496000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1087.10 seconds)\n", + "Cbc0010I After 13497000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1087.15 seconds)\n", + "Cbc0010I After 13498000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1087.21 seconds)\n", + "Cbc0010I After 13499000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1087.27 seconds)\n", + "Cbc0010I After 13500000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1087.33 seconds)\n", + "Cbc0010I After 13501000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1087.39 seconds)\n", + "Cbc0010I After 13502000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1087.45 seconds)\n", + "Cbc0010I After 13503000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1087.51 seconds)\n", + "Cbc0010I After 13504000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1087.56 seconds)\n", + "Cbc0010I After 13505000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1087.63 seconds)\n", + "Cbc0010I After 13506000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1087.68 seconds)\n", + "Cbc0010I After 13507000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1087.73 seconds)\n", + "Cbc0010I After 13508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1087.79 seconds)\n", + "Cbc0010I After 13509000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1087.86 seconds)\n", + "Cbc0010I After 13510000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1087.92 seconds)\n", + "Cbc0010I After 13511000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1087.97 seconds)\n", + "Cbc0010I After 13512000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1088.04 seconds)\n", + "Cbc0010I After 13513000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1088.10 seconds)\n", + "Cbc0010I After 13514000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1088.16 seconds)\n", + "Cbc0010I After 13515000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1088.22 seconds)\n", + "Cbc0010I After 13516000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1088.29 seconds)\n", + "Cbc0010I After 13517000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1088.35 seconds)\n", + "Cbc0010I After 13518000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1088.41 seconds)\n", + "Cbc0010I After 13519000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1088.47 seconds)\n", + "Cbc0010I After 13520000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1088.54 seconds)\n", + "Cbc0010I After 13521000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1088.63 seconds)\n", + "Cbc0010I After 13522000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1088.70 seconds)\n", + "Cbc0010I After 13523000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1088.77 seconds)\n", + "Cbc0010I After 13524000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1088.84 seconds)\n", + "Cbc0010I After 13525000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1088.90 seconds)\n", + "Cbc0010I After 13526000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1088.95 seconds)\n", + "Cbc0010I After 13527000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1089.02 seconds)\n", + "Cbc0010I After 13528000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1089.10 seconds)\n", + "Cbc0010I After 13529000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1089.16 seconds)\n", + "Cbc0010I After 13530000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1089.22 seconds)\n", + "Cbc0010I After 13531000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1089.29 seconds)\n", + "Cbc0010I After 13532000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1089.35 seconds)\n", + "Cbc0010I After 13533000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1089.40 seconds)\n", + "Cbc0010I After 13534000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1089.48 seconds)\n", + "Cbc0010I After 13535000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1089.54 seconds)\n", + "Cbc0010I After 13536000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1089.61 seconds)\n", + "Cbc0010I After 13537000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1089.68 seconds)\n", + "Cbc0010I After 13538000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1089.73 seconds)\n", + "Cbc0010I After 13539000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1089.79 seconds)\n", + "Cbc0010I After 13540000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1089.86 seconds)\n", + "Cbc0010I After 13541000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1089.90 seconds)\n", + "Cbc0010I After 13542000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1089.97 seconds)\n", + "Cbc0010I After 13543000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1090.02 seconds)\n", + "Cbc0010I After 13544000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1090.08 seconds)\n", + "Cbc0010I After 13545000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1090.15 seconds)\n", + "Cbc0010I After 13546000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1090.20 seconds)\n", + "Cbc0010I After 13547000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1090.25 seconds)\n", + "Cbc0010I After 13548000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1090.32 seconds)\n", + "Cbc0010I After 13549000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1090.37 seconds)\n", + "Cbc0010I After 13550000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1090.42 seconds)\n", + "Cbc0010I After 13551000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1090.48 seconds)\n", + "Cbc0010I After 13552000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1090.55 seconds)\n", + "Cbc0010I After 13553000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1090.60 seconds)\n", + "Cbc0010I After 13554000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1090.66 seconds)\n", + "Cbc0010I After 13555000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1090.73 seconds)\n", + "Cbc0010I After 13556000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1090.79 seconds)\n", + "Cbc0010I After 13557000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1090.86 seconds)\n", + "Cbc0010I After 13558000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1090.92 seconds)\n", + "Cbc0010I After 13559000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1090.97 seconds)\n", + "Cbc0010I After 13560000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1091.03 seconds)\n", + "Cbc0010I After 13561000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1091.10 seconds)\n", + "Cbc0010I After 13562000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1091.18 seconds)\n", + "Cbc0010I After 13563000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1091.23 seconds)\n", + "Cbc0010I After 13564000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1091.29 seconds)\n", + "Cbc0010I After 13565000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1091.37 seconds)\n", + "Cbc0010I After 13566000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1091.42 seconds)\n", + "Cbc0010I After 13567000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1091.48 seconds)\n", + "Cbc0010I After 13568000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1091.55 seconds)\n", + "Cbc0010I After 13569000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1091.61 seconds)\n", + "Cbc0010I After 13570000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1091.66 seconds)\n", + "Cbc0010I After 13571000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1091.74 seconds)\n", + "Cbc0010I After 13572000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1091.81 seconds)\n", + "Cbc0010I After 13573000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1091.86 seconds)\n", + "Cbc0010I After 13574000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1091.90 seconds)\n", + "Cbc0010I After 13575000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1091.97 seconds)\n", + "Cbc0010I After 13576000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1092.04 seconds)\n", + "Cbc0010I After 13577000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1092.09 seconds)\n", + "Cbc0010I After 13578000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1092.15 seconds)\n", + "Cbc0010I After 13579000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1092.24 seconds)\n", + "Cbc0010I After 13580000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1092.30 seconds)\n", + "Cbc0010I After 13581000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1092.35 seconds)\n", + "Cbc0010I After 13582000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1092.42 seconds)\n", + "Cbc0010I After 13583000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1092.50 seconds)\n", + "Cbc0010I After 13584000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1092.55 seconds)\n", + "Cbc0010I After 13585000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1092.60 seconds)\n", + "Cbc0010I After 13586000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1092.67 seconds)\n", + "Cbc0010I After 13587000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1092.74 seconds)\n", + "Cbc0010I After 13588000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1092.79 seconds)\n", + "Cbc0010I After 13589000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1092.85 seconds)\n", + "Cbc0010I After 13590000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1092.92 seconds)\n", + "Cbc0010I After 13591000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1092.98 seconds)\n", + "Cbc0010I After 13592000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1093.02 seconds)\n", + "Cbc0010I After 13593000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1093.09 seconds)\n", + "Cbc0010I After 13594000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1093.15 seconds)\n", + "Cbc0010I After 13595000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1093.20 seconds)\n", + "Cbc0010I After 13596000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1093.27 seconds)\n", + "Cbc0010I After 13597000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1093.34 seconds)\n", + "Cbc0010I After 13598000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1093.41 seconds)\n", + "Cbc0010I After 13599000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1093.46 seconds)\n", + "Cbc0010I After 13600000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1093.52 seconds)\n", + "Cbc0010I After 13601000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1093.59 seconds)\n", + "Cbc0010I After 13602000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1093.64 seconds)\n", + "Cbc0010I After 13603000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1093.70 seconds)\n", + "Cbc0010I After 13604000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1093.78 seconds)\n", + "Cbc0010I After 13605000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1093.83 seconds)\n", + "Cbc0010I After 13606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1093.90 seconds)\n", + "Cbc0010I After 13607000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1093.97 seconds)\n", + "Cbc0010I After 13608000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1094.01 seconds)\n", + "Cbc0010I After 13609000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1094.09 seconds)\n", + "Cbc0010I After 13610000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1094.16 seconds)\n", + "Cbc0010I After 13611000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1094.21 seconds)\n", + "Cbc0010I After 13612000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1094.28 seconds)\n", + "Cbc0010I After 13613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1094.34 seconds)\n", + "Cbc0010I After 13614000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1094.40 seconds)\n", + "Cbc0010I After 13615000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1094.46 seconds)\n", + "Cbc0010I After 13616000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1094.54 seconds)\n", + "Cbc0010I After 13617000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1094.59 seconds)\n", + "Cbc0010I After 13618000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1094.64 seconds)\n", + "Cbc0010I After 13619000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1094.71 seconds)\n", + "Cbc0010I After 13620000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1094.78 seconds)\n", + "Cbc0010I After 13621000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1094.86 seconds)\n", + "Cbc0010I After 13622000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1094.94 seconds)\n", + "Cbc0010I After 13623000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1095.00 seconds)\n", + "Cbc0010I After 13624000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1095.06 seconds)\n", + "Cbc0010I After 13625000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1095.13 seconds)\n", + "Cbc0010I After 13626000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1095.18 seconds)\n", + "Cbc0010I After 13627000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1095.23 seconds)\n", + "Cbc0010I After 13628000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1095.31 seconds)\n", + "Cbc0010I After 13629000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1095.37 seconds)\n", + "Cbc0010I After 13630000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1095.42 seconds)\n", + "Cbc0010I After 13631000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1095.50 seconds)\n", + "Cbc0010I After 13632000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1095.56 seconds)\n", + "Cbc0010I After 13633000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1095.62 seconds)\n", + "Cbc0010I After 13634000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1095.70 seconds)\n", + "Cbc0010I After 13635000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1095.76 seconds)\n", + "Cbc0010I After 13636000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1095.81 seconds)\n", + "Cbc0010I After 13637000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1095.89 seconds)\n", + "Cbc0010I After 13638000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1095.95 seconds)\n", + "Cbc0010I After 13639000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1096.01 seconds)\n", + "Cbc0010I After 13640000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1096.08 seconds)\n", + "Cbc0010I After 13641000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1096.14 seconds)\n", + "Cbc0010I After 13642000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.21 seconds)\n", + "Cbc0010I After 13643000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.28 seconds)\n", + "Cbc0010I After 13644000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1096.32 seconds)\n", + "Cbc0010I After 13645000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1096.40 seconds)\n", + "Cbc0010I After 13646000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1096.47 seconds)\n", + "Cbc0010I After 13647000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1096.54 seconds)\n", + "Cbc0010I After 13648000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1096.61 seconds)\n", + "Cbc0010I After 13649000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1096.67 seconds)\n", + "Cbc0010I After 13650000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1096.74 seconds)\n", + "Cbc0010I After 13651000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1096.81 seconds)\n", + "Cbc0010I After 13652000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1096.87 seconds)\n", + "Cbc0010I After 13653000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.94 seconds)\n", + "Cbc0010I After 13654000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1097.02 seconds)\n", + "Cbc0010I After 13655000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1097.07 seconds)\n", + "Cbc0010I After 13656000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1097.13 seconds)\n", + "Cbc0010I After 13657000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.19 seconds)\n", + "Cbc0010I After 13658000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1097.26 seconds)\n", + "Cbc0010I After 13659000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.32 seconds)\n", + "Cbc0010I After 13660000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1097.38 seconds)\n", + "Cbc0010I After 13661000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1097.45 seconds)\n", + "Cbc0010I After 13662000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1097.51 seconds)\n", + "Cbc0010I After 13663000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1097.59 seconds)\n", + "Cbc0010I After 13664000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.64 seconds)\n", + "Cbc0010I After 13665000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1097.72 seconds)\n", + "Cbc0010I After 13666000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1097.79 seconds)\n", + "Cbc0010I After 13667000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1097.85 seconds)\n", + "Cbc0010I After 13668000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1097.92 seconds)\n", + "Cbc0010I After 13669000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1097.97 seconds)\n", + "Cbc0010I After 13670000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1098.05 seconds)\n", + "Cbc0010I After 13671000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1098.11 seconds)\n", + "Cbc0010I After 13672000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1098.19 seconds)\n", + "Cbc0010I After 13673000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1098.25 seconds)\n", + "Cbc0010I After 13674000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1098.32 seconds)\n", + "Cbc0010I After 13675000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1098.37 seconds)\n", + "Cbc0010I After 13676000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1098.43 seconds)\n", + "Cbc0010I After 13677000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1098.50 seconds)\n", + "Cbc0010I After 13678000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.56 seconds)\n", + "Cbc0010I After 13679000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.64 seconds)\n", + "Cbc0010I After 13680000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1098.70 seconds)\n", + "Cbc0010I After 13681000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1098.78 seconds)\n", + "Cbc0010I After 13682000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1098.85 seconds)\n", + "Cbc0010I After 13683000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.91 seconds)\n", + "Cbc0010I After 13684000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1098.98 seconds)\n", + "Cbc0010I After 13685000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1099.04 seconds)\n", + "Cbc0010I After 13686000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.10 seconds)\n", + "Cbc0010I After 13687000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1099.15 seconds)\n", + "Cbc0010I After 13688000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1099.25 seconds)\n", + "Cbc0010I After 13689000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1099.34 seconds)\n", + "Cbc0010I After 13690000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1099.42 seconds)\n", + "Cbc0010I After 13691000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1099.48 seconds)\n", + "Cbc0010I After 13692000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1099.57 seconds)\n", + "Cbc0010I After 13693000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.64 seconds)\n", + "Cbc0010I After 13694000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1099.72 seconds)\n", + "Cbc0010I After 13695000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1099.79 seconds)\n", + "Cbc0010I After 13696000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1099.86 seconds)\n", + "Cbc0010I After 13697000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1099.91 seconds)\n", + "Cbc0010I After 13698000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.98 seconds)\n", + "Cbc0010I After 13699000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1100.03 seconds)\n", + "Cbc0010I After 13700000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1100.09 seconds)\n", + "Cbc0010I After 13701000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1100.14 seconds)\n", + "Cbc0010I After 13702000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1100.21 seconds)\n", + "Cbc0010I After 13703000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1100.26 seconds)\n", + "Cbc0010I After 13704000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1100.33 seconds)\n", + "Cbc0010I After 13705000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1100.38 seconds)\n", + "Cbc0010I After 13706000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1100.44 seconds)\n", + "Cbc0010I After 13707000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1100.49 seconds)\n", + "Cbc0010I After 13708000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1100.55 seconds)\n", + "Cbc0010I After 13709000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1100.60 seconds)\n", + "Cbc0010I After 13710000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1100.67 seconds)\n", + "Cbc0010I After 13711000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1100.73 seconds)\n", + "Cbc0010I After 13712000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1100.79 seconds)\n", + "Cbc0010I After 13713000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1100.85 seconds)\n", + "Cbc0010I After 13714000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1100.92 seconds)\n", + "Cbc0010I After 13715000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1100.99 seconds)\n", + "Cbc0010I After 13716000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1101.04 seconds)\n", + "Cbc0010I After 13717000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1101.11 seconds)\n", + "Cbc0010I After 13718000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1101.17 seconds)\n", + "Cbc0010I After 13719000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1101.24 seconds)\n", + "Cbc0010I After 13720000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1101.30 seconds)\n", + "Cbc0010I After 13721000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1101.35 seconds)\n", + "Cbc0010I After 13722000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1101.42 seconds)\n", + "Cbc0010I After 13723000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1101.48 seconds)\n", + "Cbc0010I After 13724000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1101.55 seconds)\n", + "Cbc0010I After 13725000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1101.60 seconds)\n", + "Cbc0010I After 13726000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1101.66 seconds)\n", + "Cbc0010I After 13727000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1101.72 seconds)\n", + "Cbc0010I After 13728000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1101.79 seconds)\n", + "Cbc0010I After 13729000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1101.84 seconds)\n", + "Cbc0010I After 13730000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1101.91 seconds)\n", + "Cbc0010I After 13731000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1101.97 seconds)\n", + "Cbc0010I After 13732000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1102.03 seconds)\n", + "Cbc0010I After 13733000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.09 seconds)\n", + "Cbc0010I After 13734000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1102.15 seconds)\n", + "Cbc0010I After 13735000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1102.20 seconds)\n", + "Cbc0010I After 13736000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.27 seconds)\n", + "Cbc0010I After 13737000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1102.32 seconds)\n", + "Cbc0010I After 13738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1102.38 seconds)\n", + "Cbc0010I After 13739000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1102.45 seconds)\n", + "Cbc0010I After 13740000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1102.52 seconds)\n", + "Cbc0010I After 13741000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1102.57 seconds)\n", + "Cbc0010I After 13742000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1102.63 seconds)\n", + "Cbc0010I After 13743000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1102.70 seconds)\n", + "Cbc0010I After 13744000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1102.76 seconds)\n", + "Cbc0010I After 13745000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1102.81 seconds)\n", + "Cbc0010I After 13746000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.88 seconds)\n", + "Cbc0010I After 13747000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1102.94 seconds)\n", + "Cbc0010I After 13748000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.00 seconds)\n", + "Cbc0010I After 13749000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1103.07 seconds)\n", + "Cbc0010I After 13750000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1103.12 seconds)\n", + "Cbc0010I After 13751000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.19 seconds)\n", + "Cbc0010I After 13752000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1103.25 seconds)\n", + "Cbc0010I After 13753000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1103.31 seconds)\n", + "Cbc0010I After 13754000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.37 seconds)\n", + "Cbc0010I After 13755000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1103.43 seconds)\n", + "Cbc0010I After 13756000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1103.50 seconds)\n", + "Cbc0010I After 13757000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1103.56 seconds)\n", + "Cbc0010I After 13758000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1103.62 seconds)\n", + "Cbc0010I After 13759000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1103.68 seconds)\n", + "Cbc0010I After 13760000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.74 seconds)\n", + "Cbc0010I After 13761000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1103.80 seconds)\n", + "Cbc0010I After 13762000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1103.87 seconds)\n", + "Cbc0010I After 13763000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1103.94 seconds)\n", + "Cbc0010I After 13764000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1104.01 seconds)\n", + "Cbc0010I After 13765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1104.07 seconds)\n", + "Cbc0010I After 13766000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.14 seconds)\n", + "Cbc0010I After 13767000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1104.19 seconds)\n", + "Cbc0010I After 13768000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1104.26 seconds)\n", + "Cbc0010I After 13769000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1104.32 seconds)\n", + "Cbc0010I After 13770000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1104.37 seconds)\n", + "Cbc0010I After 13771000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1104.43 seconds)\n", + "Cbc0010I After 13772000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1104.49 seconds)\n", + "Cbc0010I After 13773000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1104.55 seconds)\n", + "Cbc0010I After 13774000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1104.60 seconds)\n", + "Cbc0010I After 13775000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1104.67 seconds)\n", + "Cbc0010I After 13776000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.73 seconds)\n", + "Cbc0010I After 13777000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1104.79 seconds)\n", + "Cbc0010I After 13778000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1104.86 seconds)\n", + "Cbc0010I After 13779000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.92 seconds)\n", + "Cbc0010I After 13780000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1104.97 seconds)\n", + "Cbc0010I After 13781000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1105.03 seconds)\n", + "Cbc0010I After 13782000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1105.08 seconds)\n", + "Cbc0010I After 13783000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1105.13 seconds)\n", + "Cbc0010I After 13784000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1105.18 seconds)\n", + "Cbc0010I After 13785000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1105.23 seconds)\n", + "Cbc0010I After 13786000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1105.28 seconds)\n", + "Cbc0010I After 13787000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1105.33 seconds)\n", + "Cbc0010I After 13788000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1105.41 seconds)\n", + "Cbc0010I After 13789000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1105.48 seconds)\n", + "Cbc0010I After 13790000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1105.53 seconds)\n", + "Cbc0010I After 13791000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1105.59 seconds)\n", + "Cbc0010I After 13792000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1105.67 seconds)\n", + "Cbc0010I After 13793000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1105.72 seconds)\n", + "Cbc0010I After 13794000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1105.81 seconds)\n", + "Cbc0010I After 13795000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1105.88 seconds)\n", + "Cbc0010I After 13796000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1105.93 seconds)\n", + "Cbc0010I After 13797000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1106.01 seconds)\n", + "Cbc0010I After 13798000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1106.08 seconds)\n", + "Cbc0010I After 13799000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1106.16 seconds)\n", + "Cbc0010I After 13800000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1106.21 seconds)\n", + "Cbc0010I After 13801000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1106.29 seconds)\n", + "Cbc0010I After 13802000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1106.34 seconds)\n", + "Cbc0010I After 13803000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1106.40 seconds)\n", + "Cbc0010I After 13804000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1106.47 seconds)\n", + "Cbc0010I After 13805000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1106.53 seconds)\n", + "Cbc0010I After 13806000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1106.59 seconds)\n", + "Cbc0010I After 13807000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1106.66 seconds)\n", + "Cbc0010I After 13808000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1106.72 seconds)\n", + "Cbc0010I After 13809000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1106.77 seconds)\n", + "Cbc0010I After 13810000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1106.85 seconds)\n", + "Cbc0010I After 13811000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1106.90 seconds)\n", + "Cbc0010I After 13812000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1106.96 seconds)\n", + "Cbc0010I After 13813000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1107.07 seconds)\n", + "Cbc0010I After 13814000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.14 seconds)\n", + "Cbc0010I After 13815000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1107.21 seconds)\n", + "Cbc0010I After 13816000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1107.28 seconds)\n", + "Cbc0010I After 13817000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1107.34 seconds)\n", + "Cbc0010I After 13818000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1107.41 seconds)\n", + "Cbc0010I After 13819000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1107.47 seconds)\n", + "Cbc0010I After 13820000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1107.54 seconds)\n", + "Cbc0010I After 13821000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.60 seconds)\n", + "Cbc0010I After 13822000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1107.66 seconds)\n", + "Cbc0010I After 13823000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1107.72 seconds)\n", + "Cbc0010I After 13824000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.80 seconds)\n", + "Cbc0010I After 13825000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1107.88 seconds)\n", + "Cbc0010I After 13826000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1107.94 seconds)\n", + "Cbc0010I After 13827000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1108.01 seconds)\n", + "Cbc0010I After 13828000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.09 seconds)\n", + "Cbc0010I After 13829000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1108.17 seconds)\n", + "Cbc0010I After 13830000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.24 seconds)\n", + "Cbc0010I After 13831000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1108.30 seconds)\n", + "Cbc0010I After 13832000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1108.36 seconds)\n", + "Cbc0010I After 13833000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1108.43 seconds)\n", + "Cbc0010I After 13834000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.49 seconds)\n", + "Cbc0010I After 13835000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.55 seconds)\n", + "Cbc0010I After 13836000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.61 seconds)\n", + "Cbc0010I After 13837000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1108.69 seconds)\n", + "Cbc0010I After 13838000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1108.77 seconds)\n", + "Cbc0010I After 13839000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.83 seconds)\n", + "Cbc0010I After 13840000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1108.90 seconds)\n", + "Cbc0010I After 13841000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1108.97 seconds)\n", + "Cbc0010I After 13842000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1109.04 seconds)\n", + "Cbc0010I After 13843000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1109.10 seconds)\n", + "Cbc0010I After 13844000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1109.17 seconds)\n", + "Cbc0010I After 13845000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1109.23 seconds)\n", + "Cbc0010I After 13846000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1109.29 seconds)\n", + "Cbc0010I After 13847000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1109.36 seconds)\n", + "Cbc0010I After 13848000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1109.42 seconds)\n", + "Cbc0010I After 13849000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1109.49 seconds)\n", + "Cbc0010I After 13850000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1109.55 seconds)\n", + "Cbc0010I After 13851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1109.61 seconds)\n", + "Cbc0010I After 13852000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1109.68 seconds)\n", + "Cbc0010I After 13853000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1109.75 seconds)\n", + "Cbc0010I After 13854000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1109.81 seconds)\n", + "Cbc0010I After 13855000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1109.88 seconds)\n", + "Cbc0010I After 13856000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1109.94 seconds)\n", + "Cbc0010I After 13857000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1110.01 seconds)\n", + "Cbc0010I After 13858000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1110.08 seconds)\n", + "Cbc0010I After 13859000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1110.14 seconds)\n", + "Cbc0010I After 13860000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1110.20 seconds)\n", + "Cbc0010I After 13861000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1110.25 seconds)\n", + "Cbc0010I After 13862000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1110.32 seconds)\n", + "Cbc0010I After 13863000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1110.39 seconds)\n", + "Cbc0010I After 13864000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1110.46 seconds)\n", + "Cbc0010I After 13865000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1110.52 seconds)\n", + "Cbc0010I After 13866000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1110.58 seconds)\n", + "Cbc0010I After 13867000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1110.65 seconds)\n", + "Cbc0010I After 13868000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1110.71 seconds)\n", + "Cbc0010I After 13869000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1110.78 seconds)\n", + "Cbc0010I After 13870000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1110.85 seconds)\n", + "Cbc0010I After 13871000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1110.90 seconds)\n", + "Cbc0010I After 13872000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1110.98 seconds)\n", + "Cbc0010I After 13873000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1111.04 seconds)\n", + "Cbc0010I After 13874000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1111.11 seconds)\n", + "Cbc0010I After 13875000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1111.18 seconds)\n", + "Cbc0010I After 13876000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1111.25 seconds)\n", + "Cbc0010I After 13877000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1111.32 seconds)\n", + "Cbc0010I After 13878000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1111.39 seconds)\n", + "Cbc0010I After 13879000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1111.46 seconds)\n", + "Cbc0010I After 13880000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1111.52 seconds)\n", + "Cbc0010I After 13881000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1111.59 seconds)\n", + "Cbc0010I After 13882000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1111.65 seconds)\n", + "Cbc0010I After 13883000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1111.72 seconds)\n", + "Cbc0010I After 13884000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1111.79 seconds)\n", + "Cbc0010I After 13885000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1111.85 seconds)\n", + "Cbc0010I After 13886000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1111.91 seconds)\n", + "Cbc0010I After 13887000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1111.99 seconds)\n", + "Cbc0010I After 13888000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1112.05 seconds)\n", + "Cbc0010I After 13889000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1112.11 seconds)\n", + "Cbc0010I After 13890000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1112.18 seconds)\n", + "Cbc0010I After 13891000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1112.24 seconds)\n", + "Cbc0010I After 13892000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1112.31 seconds)\n", + "Cbc0010I After 13893000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1112.40 seconds)\n", + "Cbc0010I After 13894000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1112.47 seconds)\n", + "Cbc0010I After 13895000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1112.54 seconds)\n", + "Cbc0010I After 13896000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1112.61 seconds)\n", + "Cbc0010I After 13897000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1112.69 seconds)\n", + "Cbc0010I After 13898000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1112.76 seconds)\n", + "Cbc0010I After 13899000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1112.82 seconds)\n", + "Cbc0010I After 13900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1112.90 seconds)\n", + "Cbc0010I After 13901000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1112.96 seconds)\n", + "Cbc0010I After 13902000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1113.02 seconds)\n", + "Cbc0010I After 13903000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1113.08 seconds)\n", + "Cbc0010I After 13904000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1113.15 seconds)\n", + "Cbc0010I After 13905000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1113.21 seconds)\n", + "Cbc0010I After 13906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.26 seconds)\n", + "Cbc0010I After 13907000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1113.32 seconds)\n", + "Cbc0010I After 13908000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1113.39 seconds)\n", + "Cbc0010I After 13909000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1113.44 seconds)\n", + "Cbc0010I After 13910000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1113.50 seconds)\n", + "Cbc0010I After 13911000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1113.56 seconds)\n", + "Cbc0010I After 13912000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1113.63 seconds)\n", + "Cbc0010I After 13913000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.69 seconds)\n", + "Cbc0010I After 13914000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1113.76 seconds)\n", + "Cbc0010I After 13915000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1113.82 seconds)\n", + "Cbc0010I After 13916000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1113.87 seconds)\n", + "Cbc0010I After 13917000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.93 seconds)\n", + "Cbc0010I After 13918000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1113.99 seconds)\n", + "Cbc0010I After 13919000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1114.06 seconds)\n", + "Cbc0010I After 13920000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1114.12 seconds)\n", + "Cbc0010I After 13921000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1114.18 seconds)\n", + "Cbc0010I After 13922000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1114.24 seconds)\n", + "Cbc0010I After 13923000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1114.30 seconds)\n", + "Cbc0010I After 13924000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1114.36 seconds)\n", + "Cbc0010I After 13925000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1114.42 seconds)\n", + "Cbc0010I After 13926000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1114.48 seconds)\n", + "Cbc0010I After 13927000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1114.55 seconds)\n", + "Cbc0010I After 13928000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1114.61 seconds)\n", + "Cbc0010I After 13929000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1114.67 seconds)\n", + "Cbc0010I After 13930000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1114.73 seconds)\n", + "Cbc0010I After 13931000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1114.79 seconds)\n", + "Cbc0010I After 13932000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1114.86 seconds)\n", + "Cbc0010I After 13933000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1114.92 seconds)\n", + "Cbc0010I After 13934000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1114.99 seconds)\n", + "Cbc0010I After 13935000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1115.05 seconds)\n", + "Cbc0010I After 13936000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1115.12 seconds)\n", + "Cbc0010I After 13937000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1115.17 seconds)\n", + "Cbc0010I After 13938000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1115.24 seconds)\n", + "Cbc0010I After 13939000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1115.30 seconds)\n", + "Cbc0010I After 13940000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1115.37 seconds)\n", + "Cbc0010I After 13941000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1115.44 seconds)\n", + "Cbc0010I After 13942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1115.51 seconds)\n", + "Cbc0010I After 13943000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1115.58 seconds)\n", + "Cbc0010I After 13944000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1115.64 seconds)\n", + "Cbc0010I After 13945000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1115.69 seconds)\n", + "Cbc0010I After 13946000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1115.76 seconds)\n", + "Cbc0010I After 13947000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1115.82 seconds)\n", + "Cbc0010I After 13948000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1115.88 seconds)\n", + "Cbc0010I After 13949000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1115.94 seconds)\n", + "Cbc0010I After 13950000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1116.00 seconds)\n", + "Cbc0010I After 13951000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1116.06 seconds)\n", + "Cbc0010I After 13952000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1116.11 seconds)\n", + "Cbc0010I After 13953000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1116.21 seconds)\n", + "Cbc0010I After 13954000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1116.28 seconds)\n", + "Cbc0010I After 13955000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1116.35 seconds)\n", + "Cbc0010I After 13956000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1116.41 seconds)\n", + "Cbc0010I After 13957000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1116.47 seconds)\n", + "Cbc0010I After 13958000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1116.54 seconds)\n", + "Cbc0010I After 13959000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1116.61 seconds)\n", + "Cbc0010I After 13960000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1116.68 seconds)\n", + "Cbc0010I After 13961000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1116.74 seconds)\n", + "Cbc0010I After 13962000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1116.79 seconds)\n", + "Cbc0010I After 13963000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1116.84 seconds)\n", + "Cbc0010I After 13964000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1116.89 seconds)\n", + "Cbc0010I After 13965000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1116.94 seconds)\n", + "Cbc0010I After 13966000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1116.98 seconds)\n", + "Cbc0010I After 13967000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.01 seconds)\n", + "Cbc0010I After 13968000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1117.04 seconds)\n", + "Cbc0010I After 13969000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1117.07 seconds)\n", + "Cbc0010I After 13970000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1117.10 seconds)\n", + "Cbc0010I After 13971000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1117.13 seconds)\n", + "Cbc0010I After 13972000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.16 seconds)\n", + "Cbc0010I After 13973000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1117.19 seconds)\n", + "Cbc0010I After 13974000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1117.22 seconds)\n", + "Cbc0010I After 13975000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.25 seconds)\n", + "Cbc0010I After 13976000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1117.28 seconds)\n", + "Cbc0010I After 13977000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1117.31 seconds)\n", + "Cbc0010I After 13978000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1117.34 seconds)\n", + "Cbc0010I After 13979000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1117.38 seconds)\n", + "Cbc0010I After 13980000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1117.41 seconds)\n", + "Cbc0010I After 13981000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1117.44 seconds)\n", + "Cbc0010I After 13982000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1117.47 seconds)\n", + "Cbc0010I After 13983000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1117.52 seconds)\n", + "Cbc0010I After 13984000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1117.54 seconds)\n", + "Cbc0010I After 13985000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1117.58 seconds)\n", + "Cbc0010I After 13986000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1117.60 seconds)\n", + "Cbc0010I After 13987000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1117.63 seconds)\n", + "Cbc0010I After 13988000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1117.66 seconds)\n", + "Cbc0010I After 13989000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.69 seconds)\n", + "Cbc0010I After 13990000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.72 seconds)\n", + "Cbc0010I After 13991000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1117.75 seconds)\n", + "Cbc0010I After 13992000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.78 seconds)\n", + "Cbc0010I After 13993000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1117.81 seconds)\n", + "Cbc0010I After 13994000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1117.84 seconds)\n", + "Cbc0010I After 13995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1117.87 seconds)\n", + "Cbc0010I After 13996000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1117.90 seconds)\n", + "Cbc0010I After 13997000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1117.93 seconds)\n", + "Cbc0010I After 13998000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1117.96 seconds)\n", + "Cbc0010I After 13999000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1117.99 seconds)\n", + "Cbc0010I After 14000000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.02 seconds)\n", + "Cbc0010I After 14001000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1118.05 seconds)\n", + "Cbc0010I After 14002000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.08 seconds)\n", + "Cbc0010I After 14003000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1118.11 seconds)\n", + "Cbc0010I After 14004000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1118.14 seconds)\n", + "Cbc0010I After 14005000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1118.17 seconds)\n", + "Cbc0010I After 14006000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1118.20 seconds)\n", + "Cbc0010I After 14007000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1118.23 seconds)\n", + "Cbc0010I After 14008000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1118.26 seconds)\n", + "Cbc0010I After 14009000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1118.30 seconds)\n", + "Cbc0010I After 14010000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1118.33 seconds)\n", + "Cbc0010I After 14011000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1118.36 seconds)\n", + "Cbc0010I After 14012000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1118.39 seconds)\n", + "Cbc0010I After 14013000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1118.42 seconds)\n", + "Cbc0010I After 14014000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1118.44 seconds)\n", + "Cbc0010I After 14015000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.47 seconds)\n", + "Cbc0010I After 14016000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1118.50 seconds)\n", + "Cbc0010I After 14017000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1118.53 seconds)\n", + "Cbc0010I After 14018000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1118.56 seconds)\n", + "Cbc0010I After 14019000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1118.59 seconds)\n", + "Cbc0010I After 14020000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1118.62 seconds)\n", + "Cbc0010I After 14021000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1118.65 seconds)\n", + "Cbc0010I After 14022000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1118.68 seconds)\n", + "Cbc0010I After 14023000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1118.71 seconds)\n", + "Cbc0010I After 14024000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1118.74 seconds)\n", + "Cbc0010I After 14025000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.77 seconds)\n", + "Cbc0010I After 14026000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.80 seconds)\n", + "Cbc0010I After 14027000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1118.83 seconds)\n", + "Cbc0010I After 14028000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1118.87 seconds)\n", + "Cbc0010I After 14029000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.91 seconds)\n", + "Cbc0010I After 14030000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1118.94 seconds)\n", + "Cbc0010I After 14031000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1118.98 seconds)\n", + "Cbc0010I After 14032000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.01 seconds)\n", + "Cbc0010I After 14033000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1119.04 seconds)\n", + "Cbc0010I After 14034000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.07 seconds)\n", + "Cbc0010I After 14035000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1119.10 seconds)\n", + "Cbc0010I After 14036000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1119.13 seconds)\n", + "Cbc0010I After 14037000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1119.16 seconds)\n", + "Cbc0010I After 14038000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1119.19 seconds)\n", + "Cbc0010I After 14039000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1119.22 seconds)\n", + "Cbc0010I After 14040000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1119.25 seconds)\n", + "Cbc0010I After 14041000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1119.29 seconds)\n", + "Cbc0010I After 14042000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1119.32 seconds)\n", + "Cbc0010I After 14043000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1119.35 seconds)\n", + "Cbc0010I After 14044000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1119.39 seconds)\n", + "Cbc0010I After 14045000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1119.42 seconds)\n", + "Cbc0010I After 14046000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1119.45 seconds)\n", + "Cbc0010I After 14047000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1119.48 seconds)\n", + "Cbc0010I After 14048000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.51 seconds)\n", + "Cbc0010I After 14049000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1119.55 seconds)\n", + "Cbc0010I After 14050000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1119.58 seconds)\n", + "Cbc0010I After 14051000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1119.61 seconds)\n", + "Cbc0010I After 14052000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1119.64 seconds)\n", + "Cbc0010I After 14053000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1119.68 seconds)\n", + "Cbc0010I After 14054000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1119.71 seconds)\n", + "Cbc0010I After 14055000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1119.75 seconds)\n", + "Cbc0010I After 14056000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1119.78 seconds)\n", + "Cbc0010I After 14057000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1119.81 seconds)\n", + "Cbc0010I After 14058000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1119.84 seconds)\n", + "Cbc0010I After 14059000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1119.87 seconds)\n", + "Cbc0010I After 14060000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1119.91 seconds)\n", + "Cbc0010I After 14061000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1119.95 seconds)\n", + "Cbc0010I After 14062000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1119.97 seconds)\n", + "Cbc0010I After 14063000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1120.01 seconds)\n", + "Cbc0010I After 14064000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1120.04 seconds)\n", + "Cbc0010I After 14065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1120.07 seconds)\n", + "Cbc0010I After 14066000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1120.11 seconds)\n", + "Cbc0010I After 14067000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1120.15 seconds)\n", + "Cbc0010I After 14068000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1120.18 seconds)\n", + "Cbc0010I After 14069000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1120.22 seconds)\n", + "Cbc0010I After 14070000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1120.25 seconds)\n", + "Cbc0010I After 14071000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1120.28 seconds)\n", + "Cbc0010I After 14072000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1120.31 seconds)\n", + "Cbc0010I After 14073000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1120.35 seconds)\n", + "Cbc0010I After 14074000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1120.38 seconds)\n", + "Cbc0010I After 14075000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1120.42 seconds)\n", + "Cbc0010I After 14076000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1120.45 seconds)\n", + "Cbc0010I After 14077000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1120.48 seconds)\n", + "Cbc0010I After 14078000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1120.52 seconds)\n", + "Cbc0010I After 14079000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1120.55 seconds)\n", + "Cbc0010I After 14080000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1120.59 seconds)\n", + "Cbc0010I After 14081000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1120.62 seconds)\n", + "Cbc0010I After 14082000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1120.65 seconds)\n", + "Cbc0010I After 14083000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1120.69 seconds)\n", + "Cbc0010I After 14084000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1120.72 seconds)\n", + "Cbc0010I After 14085000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1120.76 seconds)\n", + "Cbc0010I After 14086000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1120.80 seconds)\n", + "Cbc0010I After 14087000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1120.83 seconds)\n", + "Cbc0010I After 14088000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1120.87 seconds)\n", + "Cbc0010I After 14089000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1120.91 seconds)\n", + "Cbc0010I After 14090000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1120.94 seconds)\n", + "Cbc0010I After 14091000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1120.98 seconds)\n", + "Cbc0010I After 14092000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1121.02 seconds)\n", + "Cbc0010I After 14093000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1121.05 seconds)\n", + "Cbc0010I After 14094000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1121.08 seconds)\n", + "Cbc0010I After 14095000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1121.10 seconds)\n", + "Cbc0010I After 14096000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1121.13 seconds)\n", + "Cbc0010I After 14097000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.16 seconds)\n", + "Cbc0010I After 14098000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1121.19 seconds)\n", + "Cbc0010I After 14099000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.22 seconds)\n", + "Cbc0010I After 14100000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1121.25 seconds)\n", + "Cbc0010I After 14101000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1121.28 seconds)\n", + "Cbc0010I After 14102000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.31 seconds)\n", + "Cbc0010I After 14103000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1121.34 seconds)\n", + "Cbc0010I After 14104000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1121.37 seconds)\n", + "Cbc0010I After 14105000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1121.40 seconds)\n", + "Cbc0010I After 14106000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1121.43 seconds)\n", + "Cbc0010I After 14107000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1121.46 seconds)\n", + "Cbc0010I After 14108000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1121.49 seconds)\n", + "Cbc0010I After 14109000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1121.52 seconds)\n", + "Cbc0010I After 14110000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1121.56 seconds)\n", + "Cbc0010I After 14111000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1121.59 seconds)\n", + "Cbc0010I After 14112000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1121.63 seconds)\n", + "Cbc0010I After 14113000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1121.68 seconds)\n", + "Cbc0010I After 14114000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1121.73 seconds)\n", + "Cbc0010I After 14115000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1121.77 seconds)\n", + "Cbc0010I After 14116000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1121.81 seconds)\n", + "Cbc0010I After 14117000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1121.84 seconds)\n", + "Cbc0010I After 14118000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1121.88 seconds)\n", + "Cbc0010I After 14119000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1121.91 seconds)\n", + "Cbc0010I After 14120000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1121.95 seconds)\n", + "Cbc0010I After 14121000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1121.98 seconds)\n", + "Cbc0010I After 14122000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1122.01 seconds)\n", + "Cbc0010I After 14123000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1122.04 seconds)\n", + "Cbc0010I After 14124000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1122.07 seconds)\n", + "Cbc0010I After 14125000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1122.11 seconds)\n", + "Cbc0010I After 14126000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1122.14 seconds)\n", + "Cbc0010I After 14127000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1122.17 seconds)\n", + "Cbc0010I After 14128000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1122.20 seconds)\n", + "Cbc0010I After 14129000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.23 seconds)\n", + "Cbc0010I After 14130000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1122.25 seconds)\n", + "Cbc0010I After 14131000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.28 seconds)\n", + "Cbc0010I After 14132000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1122.32 seconds)\n", + "Cbc0010I After 14133000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.34 seconds)\n", + "Cbc0010I After 14134000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1122.38 seconds)\n", + "Cbc0010I After 14135000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1122.41 seconds)\n", + "Cbc0010I After 14136000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1122.45 seconds)\n", + "Cbc0010I After 14137000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1122.48 seconds)\n", + "Cbc0010I After 14138000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1122.51 seconds)\n", + "Cbc0010I After 14139000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1122.54 seconds)\n", + "Cbc0010I After 14140000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.57 seconds)\n", + "Cbc0010I After 14141000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1122.61 seconds)\n", + "Cbc0010I After 14142000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1122.65 seconds)\n", + "Cbc0010I After 14143000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1122.68 seconds)\n", + "Cbc0010I After 14144000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1122.72 seconds)\n", + "Cbc0010I After 14145000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1122.75 seconds)\n", + "Cbc0010I After 14146000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1122.78 seconds)\n", + "Cbc0010I After 14147000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.81 seconds)\n", + "Cbc0010I After 14148000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1122.84 seconds)\n", + "Cbc0010I After 14149000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1122.87 seconds)\n", + "Cbc0010I After 14150000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.90 seconds)\n", + "Cbc0010I After 14151000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1122.93 seconds)\n", + "Cbc0010I After 14152000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.97 seconds)\n", + "Cbc0010I After 14153000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1123.00 seconds)\n", + "Cbc0010I After 14154000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1123.04 seconds)\n", + "Cbc0010I After 14155000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1123.07 seconds)\n", + "Cbc0010I After 14156000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1123.10 seconds)\n", + "Cbc0010I After 14157000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1123.14 seconds)\n", + "Cbc0010I After 14158000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1123.17 seconds)\n", + "Cbc0010I After 14159000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1123.21 seconds)\n", + "Cbc0010I After 14160000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1123.24 seconds)\n", + "Cbc0010I After 14161000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1123.27 seconds)\n", + "Cbc0010I After 14162000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1123.30 seconds)\n", + "Cbc0010I After 14163000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1123.33 seconds)\n", + "Cbc0010I After 14164000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1123.37 seconds)\n", + "Cbc0010I After 14165000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1123.41 seconds)\n", + "Cbc0010I After 14166000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1123.44 seconds)\n", + "Cbc0010I After 14167000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1123.48 seconds)\n", + "Cbc0010I After 14168000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1123.52 seconds)\n", + "Cbc0010I After 14169000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1123.55 seconds)\n", + "Cbc0010I After 14170000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1123.58 seconds)\n", + "Cbc0010I After 14171000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1123.62 seconds)\n", + "Cbc0010I After 14172000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1123.65 seconds)\n", + "Cbc0010I After 14173000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1123.69 seconds)\n", + "Cbc0010I After 14174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1123.72 seconds)\n", + "Cbc0010I After 14175000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1123.76 seconds)\n", + "Cbc0010I After 14176000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1123.79 seconds)\n", + "Cbc0010I After 14177000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1123.82 seconds)\n", + "Cbc0010I After 14178000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1123.86 seconds)\n", + "Cbc0010I After 14179000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1123.90 seconds)\n", + "Cbc0010I After 14180000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1123.94 seconds)\n", + "Cbc0010I After 14181000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1123.97 seconds)\n", + "Cbc0010I After 14182000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1124.01 seconds)\n", + "Cbc0010I After 14183000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1124.04 seconds)\n", + "Cbc0010I After 14184000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1124.08 seconds)\n", + "Cbc0010I After 14185000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1124.12 seconds)\n", + "Cbc0010I After 14186000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1124.16 seconds)\n", + "Cbc0010I After 14187000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1124.20 seconds)\n", + "Cbc0010I After 14188000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1124.23 seconds)\n", + "Cbc0010I After 14189000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1124.26 seconds)\n", + "Cbc0010I After 14190000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1124.31 seconds)\n", + "Cbc0010I After 14191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1124.34 seconds)\n", + "Cbc0010I After 14192000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1124.40 seconds)\n", + "Cbc0010I After 14193000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1124.46 seconds)\n", + "Cbc0010I After 14194000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1124.52 seconds)\n", + "Cbc0010I After 14195000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.56 seconds)\n", + "Cbc0010I After 14196000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1124.61 seconds)\n", + "Cbc0010I After 14197000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1124.66 seconds)\n", + "Cbc0010I After 14198000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1124.70 seconds)\n", + "Cbc0010I After 14199000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1124.73 seconds)\n", + "Cbc0010I After 14200000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1124.76 seconds)\n", + "Cbc0010I After 14201000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.79 seconds)\n", + "Cbc0010I After 14202000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1124.83 seconds)\n", + "Cbc0010I After 14203000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1124.86 seconds)\n", + "Cbc0010I After 14204000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1124.89 seconds)\n", + "Cbc0010I After 14205000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1124.93 seconds)\n", + "Cbc0010I After 14206000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.96 seconds)\n", + "Cbc0010I After 14207000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1125.00 seconds)\n", + "Cbc0010I After 14208000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1125.03 seconds)\n", + "Cbc0010I After 14209000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1125.06 seconds)\n", + "Cbc0010I After 14210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1125.09 seconds)\n", + "Cbc0010I After 14211000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1125.13 seconds)\n", + "Cbc0010I After 14212000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1125.16 seconds)\n", + "Cbc0010I After 14213000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1125.19 seconds)\n", + "Cbc0010I After 14214000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1125.22 seconds)\n", + "Cbc0010I After 14215000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1125.25 seconds)\n", + "Cbc0010I After 14216000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1125.29 seconds)\n", + "Cbc0010I After 14217000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1125.33 seconds)\n", + "Cbc0010I After 14218000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1125.36 seconds)\n", + "Cbc0010I After 14219000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1125.39 seconds)\n", + "Cbc0010I After 14220000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1125.43 seconds)\n", + "Cbc0010I After 14221000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1125.47 seconds)\n", + "Cbc0010I After 14222000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1125.50 seconds)\n", + "Cbc0010I After 14223000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1125.53 seconds)\n", + "Cbc0010I After 14224000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1125.57 seconds)\n", + "Cbc0010I After 14225000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1125.61 seconds)\n", + "Cbc0010I After 14226000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1125.64 seconds)\n", + "Cbc0010I After 14227000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1125.67 seconds)\n", + "Cbc0010I After 14228000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1125.71 seconds)\n", + "Cbc0010I After 14229000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1125.74 seconds)\n", + "Cbc0010I After 14230000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1125.77 seconds)\n", + "Cbc0010I After 14231000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1125.81 seconds)\n", + "Cbc0010I After 14232000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1125.84 seconds)\n", + "Cbc0010I After 14233000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1125.87 seconds)\n", + "Cbc0010I After 14234000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1125.90 seconds)\n", + "Cbc0010I After 14235000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1125.94 seconds)\n", + "Cbc0010I After 14236000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1125.98 seconds)\n", + "Cbc0010I After 14237000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1126.01 seconds)\n", + "Cbc0010I After 14238000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1126.05 seconds)\n", + "Cbc0010I After 14239000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1126.08 seconds)\n", + "Cbc0010I After 14240000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1126.12 seconds)\n", + "Cbc0010I After 14241000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1126.16 seconds)\n", + "Cbc0010I After 14242000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1126.20 seconds)\n", + "Cbc0010I After 14243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1126.24 seconds)\n", + "Cbc0010I After 14244000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1126.27 seconds)\n", + "Cbc0010I After 14245000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1126.31 seconds)\n", + "Cbc0010I After 14246000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1126.34 seconds)\n", + "Cbc0010I After 14247000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.38 seconds)\n", + "Cbc0010I After 14248000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1126.41 seconds)\n", + "Cbc0010I After 14249000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1126.45 seconds)\n", + "Cbc0010I After 14250000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1126.48 seconds)\n", + "Cbc0010I After 14251000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1126.51 seconds)\n", + "Cbc0010I After 14252000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1126.54 seconds)\n", + "Cbc0010I After 14253000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1126.58 seconds)\n", + "Cbc0010I After 14254000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1126.62 seconds)\n", + "Cbc0010I After 14255000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1126.65 seconds)\n", + "Cbc0010I After 14256000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1126.70 seconds)\n", + "Cbc0010I After 14257000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1126.73 seconds)\n", + "Cbc0010I After 14258000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1126.77 seconds)\n", + "Cbc0010I After 14259000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1126.81 seconds)\n", + "Cbc0010I After 14260000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1126.83 seconds)\n", + "Cbc0010I After 14261000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1126.86 seconds)\n", + "Cbc0010I After 14262000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.89 seconds)\n", + "Cbc0010I After 14263000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1126.92 seconds)\n", + "Cbc0010I After 14264000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1126.95 seconds)\n", + "Cbc0010I After 14265000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.98 seconds)\n", + "Cbc0010I After 14266000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1127.01 seconds)\n", + "Cbc0010I After 14267000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1127.04 seconds)\n", + "Cbc0010I After 14268000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1127.07 seconds)\n", + "Cbc0010I After 14269000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1127.09 seconds)\n", + "Cbc0010I After 14270000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1127.12 seconds)\n", + "Cbc0010I After 14271000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1127.15 seconds)\n", + "Cbc0010I After 14272000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1127.18 seconds)\n", + "Cbc0010I After 14273000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1127.21 seconds)\n", + "Cbc0010I After 14274000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1127.24 seconds)\n", + "Cbc0010I After 14275000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1127.27 seconds)\n", + "Cbc0010I After 14276000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1127.30 seconds)\n", + "Cbc0010I After 14277000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.34 seconds)\n", + "Cbc0010I After 14278000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1127.37 seconds)\n", + "Cbc0010I After 14279000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1127.40 seconds)\n", + "Cbc0010I After 14280000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1127.43 seconds)\n", + "Cbc0010I After 14281000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1127.46 seconds)\n", + "Cbc0010I After 14282000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1127.49 seconds)\n", + "Cbc0010I After 14283000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1127.52 seconds)\n", + "Cbc0010I After 14284000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1127.55 seconds)\n", + "Cbc0010I After 14285000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1127.58 seconds)\n", + "Cbc0010I After 14286000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1127.62 seconds)\n", + "Cbc0010I After 14287000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1127.65 seconds)\n", + "Cbc0010I After 14288000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1127.68 seconds)\n", + "Cbc0010I After 14289000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.72 seconds)\n", + "Cbc0010I After 14290000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1127.75 seconds)\n", + "Cbc0010I After 14291000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1127.79 seconds)\n", + "Cbc0010I After 14292000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.82 seconds)\n", + "Cbc0010I After 14293000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.85 seconds)\n", + "Cbc0010I After 14294000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1127.89 seconds)\n", + "Cbc0010I After 14295000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.92 seconds)\n", + "Cbc0010I After 14296000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.95 seconds)\n", + "Cbc0010I After 14297000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1127.98 seconds)\n", + "Cbc0010I After 14298000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1128.02 seconds)\n", + "Cbc0010I After 14299000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1128.06 seconds)\n", + "Cbc0010I After 14300000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1128.09 seconds)\n", + "Cbc0010I After 14301000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1128.12 seconds)\n", + "Cbc0010I After 14302000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1128.16 seconds)\n", + "Cbc0010I After 14303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1128.20 seconds)\n", + "Cbc0010I After 14304000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1128.23 seconds)\n", + "Cbc0010I After 14305000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1128.26 seconds)\n", + "Cbc0010I After 14306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1128.29 seconds)\n", + "Cbc0010I After 14307000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1128.33 seconds)\n", + "Cbc0010I After 14308000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1128.37 seconds)\n", + "Cbc0010I After 14309000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1128.40 seconds)\n", + "Cbc0010I After 14310000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1128.44 seconds)\n", + "Cbc0010I After 14311000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1128.47 seconds)\n", + "Cbc0010I After 14312000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1128.50 seconds)\n", + "Cbc0010I After 14313000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1128.55 seconds)\n", + "Cbc0010I After 14314000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1128.58 seconds)\n", + "Cbc0010I After 14315000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1128.62 seconds)\n", + "Cbc0010I After 14316000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1128.65 seconds)\n", + "Cbc0010I After 14317000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1128.70 seconds)\n", + "Cbc0010I After 14318000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1128.74 seconds)\n", + "Cbc0010I After 14319000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1128.79 seconds)\n", + "Cbc0010I After 14320000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1128.83 seconds)\n", + "Cbc0010I After 14321000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1128.86 seconds)\n", + "Cbc0010I After 14322000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1128.90 seconds)\n", + "Cbc0010I After 14323000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1128.93 seconds)\n", + "Cbc0010I After 14324000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1128.97 seconds)\n", + "Cbc0010I After 14325000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1129.00 seconds)\n", + "Cbc0010I After 14326000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1129.04 seconds)\n", + "Cbc0010I After 14327000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1129.08 seconds)\n", + "Cbc0010I After 14328000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1129.12 seconds)\n", + "Cbc0010I After 14329000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1129.16 seconds)\n", + "Cbc0010I After 14330000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1129.20 seconds)\n", + "Cbc0010I After 14331000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1129.23 seconds)\n", + "Cbc0010I After 14332000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1129.26 seconds)\n", + "Cbc0010I After 14333000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1129.28 seconds)\n", + "Cbc0010I After 14334000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1129.32 seconds)\n", + "Cbc0010I After 14335000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1129.34 seconds)\n", + "Cbc0010I After 14336000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1129.37 seconds)\n", + "Cbc0010I After 14337000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1129.41 seconds)\n", + "Cbc0010I After 14338000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1129.44 seconds)\n", + "Cbc0010I After 14339000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1129.48 seconds)\n", + "Cbc0010I After 14340000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1129.50 seconds)\n", + "Cbc0010I After 14341000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1129.54 seconds)\n", + "Cbc0010I After 14342000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1129.57 seconds)\n", + "Cbc0010I After 14343000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1129.61 seconds)\n", + "Cbc0010I After 14344000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1129.65 seconds)\n", + "Cbc0010I After 14345000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1129.68 seconds)\n", + "Cbc0010I After 14346000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1129.71 seconds)\n", + "Cbc0010I After 14347000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1129.75 seconds)\n", + "Cbc0010I After 14348000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1129.78 seconds)\n", + "Cbc0010I After 14349000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1129.81 seconds)\n", + "Cbc0010I After 14350000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (1129.85 seconds)\n", + "Cbc0010I After 14351000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1129.88 seconds)\n", + "Cbc0010I After 14352000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1129.91 seconds)\n", + "Cbc0010I After 14353000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1129.95 seconds)\n", + "Cbc0010I After 14354000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1130.00 seconds)\n", + "Cbc0010I After 14355000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1130.03 seconds)\n", + "Cbc0010I After 14356000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1130.06 seconds)\n", + "Cbc0010I After 14357000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1130.10 seconds)\n", + "Cbc0010I After 14358000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1130.15 seconds)\n", + "Cbc0010I After 14359000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1130.18 seconds)\n", + "Cbc0010I After 14360000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1130.21 seconds)\n", + "Cbc0010I After 14361000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1130.25 seconds)\n", + "Cbc0010I After 14362000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1130.29 seconds)\n", + "Cbc0010I After 14363000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1130.33 seconds)\n", + "Cbc0010I After 14364000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1130.38 seconds)\n", + "Cbc0010I After 14365000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1130.42 seconds)\n", + "Cbc0010I After 14366000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1130.46 seconds)\n", + "Cbc0010I After 14367000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1130.51 seconds)\n", + "Cbc0010I After 14368000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1130.55 seconds)\n", + "Cbc0010I After 14369000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1130.60 seconds)\n", + "Cbc0010I After 14370000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1130.64 seconds)\n", + "Cbc0010I After 14371000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1130.68 seconds)\n", + "Cbc0010I After 14372000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1130.73 seconds)\n", + "Cbc0010I After 14373000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1130.77 seconds)\n", + "Cbc0010I After 14374000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1130.82 seconds)\n", + "Cbc0010I After 14375000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1130.86 seconds)\n", + "Cbc0010I After 14376000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1130.91 seconds)\n", + "Cbc0010I After 14377000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1130.95 seconds)\n", + "Cbc0010I After 14378000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1130.99 seconds)\n", + "Cbc0010I After 14379000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1131.04 seconds)\n", + "Cbc0010I After 14380000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1131.08 seconds)\n", + "Cbc0010I After 14381000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1131.11 seconds)\n", + "Cbc0010I After 14382000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1131.15 seconds)\n", + "Cbc0010I After 14383000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1131.18 seconds)\n", + "Cbc0010I After 14384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1131.21 seconds)\n", + "Cbc0010I After 14385000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1131.25 seconds)\n", + "Cbc0010I After 14386000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1131.28 seconds)\n", + "Cbc0010I After 14387000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1131.32 seconds)\n", + "Cbc0010I After 14388000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1131.37 seconds)\n", + "Cbc0010I After 14389000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1131.41 seconds)\n", + "Cbc0010I After 14390000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1131.44 seconds)\n", + "Cbc0010I After 14391000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1131.47 seconds)\n", + "Cbc0010I After 14392000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1131.51 seconds)\n", + "Cbc0010I After 14393000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1131.55 seconds)\n", + "Cbc0010I After 14394000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1131.59 seconds)\n", + "Cbc0010I After 14395000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1131.67 seconds)\n", + "Cbc0010I After 14396000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1131.74 seconds)\n", + "Cbc0010I After 14397000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1131.81 seconds)\n", + "Cbc0010I After 14398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1131.90 seconds)\n", + "Cbc0010I After 14399000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1131.98 seconds)\n", + "Cbc0010I After 14400000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1132.04 seconds)\n", + "Cbc0010I After 14401000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1132.10 seconds)\n", + "Cbc0010I After 14402000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1132.17 seconds)\n", + "Cbc0010I After 14403000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1132.25 seconds)\n", + "Cbc0010I After 14404000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1132.31 seconds)\n", + "Cbc0010I After 14405000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1132.36 seconds)\n", + "Cbc0010I After 14406000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1132.43 seconds)\n", + "Cbc0010I After 14407000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1132.50 seconds)\n", + "Cbc0010I After 14408000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1132.56 seconds)\n", + "Cbc0010I After 14409000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1132.61 seconds)\n", + "Cbc0010I After 14410000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1132.69 seconds)\n", + "Cbc0010I After 14411000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1132.75 seconds)\n", + "Cbc0010I After 14412000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1132.80 seconds)\n", + "Cbc0010I After 14413000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1132.87 seconds)\n", + "Cbc0010I After 14414000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1132.95 seconds)\n", + "Cbc0010I After 14415000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1133.00 seconds)\n", + "Cbc0010I After 14416000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1133.07 seconds)\n", + "Cbc0010I After 14417000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1133.14 seconds)\n", + "Cbc0010I After 14418000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1133.19 seconds)\n", + "Cbc0010I After 14419000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.24 seconds)\n", + "Cbc0010I After 14420000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1133.32 seconds)\n", + "Cbc0010I After 14421000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1133.38 seconds)\n", + "Cbc0010I After 14422000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1133.43 seconds)\n", + "Cbc0010I After 14423000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1133.49 seconds)\n", + "Cbc0010I After 14424000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.57 seconds)\n", + "Cbc0010I After 14425000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1133.63 seconds)\n", + "Cbc0010I After 14426000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1133.68 seconds)\n", + "Cbc0010I After 14427000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1133.76 seconds)\n", + "Cbc0010I After 14428000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1133.83 seconds)\n", + "Cbc0010I After 14429000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.88 seconds)\n", + "Cbc0010I After 14430000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1133.94 seconds)\n", + "Cbc0010I After 14431000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1134.02 seconds)\n", + "Cbc0010I After 14432000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1134.08 seconds)\n", + "Cbc0010I After 14433000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1134.14 seconds)\n", + "Cbc0010I After 14434000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.22 seconds)\n", + "Cbc0010I After 14435000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.29 seconds)\n", + "Cbc0010I After 14436000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1134.34 seconds)\n", + "Cbc0010I After 14437000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1134.41 seconds)\n", + "Cbc0010I After 14438000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1134.48 seconds)\n", + "Cbc0010I After 14439000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1134.54 seconds)\n", + "Cbc0010I After 14440000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1134.60 seconds)\n", + "Cbc0010I After 14441000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.67 seconds)\n", + "Cbc0010I After 14442000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1134.73 seconds)\n", + "Cbc0010I After 14443000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1134.79 seconds)\n", + "Cbc0010I After 14444000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1134.87 seconds)\n", + "Cbc0010I After 14445000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.92 seconds)\n", + "Cbc0010I After 14446000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1134.97 seconds)\n", + "Cbc0010I After 14447000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1135.05 seconds)\n", + "Cbc0010I After 14448000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1135.11 seconds)\n", + "Cbc0010I After 14449000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1135.17 seconds)\n", + "Cbc0010I After 14450000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.24 seconds)\n", + "Cbc0010I After 14451000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1135.31 seconds)\n", + "Cbc0010I After 14452000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1135.38 seconds)\n", + "Cbc0010I After 14453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.46 seconds)\n", + "Cbc0010I After 14454000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1135.54 seconds)\n", + "Cbc0010I After 14455000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1135.60 seconds)\n", + "Cbc0010I After 14456000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1135.67 seconds)\n", + "Cbc0010I After 14457000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1135.72 seconds)\n", + "Cbc0010I After 14458000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.78 seconds)\n", + "Cbc0010I After 14459000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1135.85 seconds)\n", + "Cbc0010I After 14460000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1135.89 seconds)\n", + "Cbc0010I After 14461000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1135.95 seconds)\n", + "Cbc0010I After 14462000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.02 seconds)\n", + "Cbc0010I After 14463000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1136.07 seconds)\n", + "Cbc0010I After 14464000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1136.13 seconds)\n", + "Cbc0010I After 14465000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1136.19 seconds)\n", + "Cbc0010I After 14466000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1136.25 seconds)\n", + "Cbc0010I After 14467000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1136.31 seconds)\n", + "Cbc0010I After 14468000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.38 seconds)\n", + "Cbc0010I After 14469000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1136.43 seconds)\n", + "Cbc0010I After 14470000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1136.49 seconds)\n", + "Cbc0010I After 14471000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1136.56 seconds)\n", + "Cbc0010I After 14472000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1136.61 seconds)\n", + "Cbc0010I After 14473000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1136.66 seconds)\n", + "Cbc0010I After 14474000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.74 seconds)\n", + "Cbc0010I After 14475000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1136.79 seconds)\n", + "Cbc0010I After 14476000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1136.85 seconds)\n", + "Cbc0010I After 14477000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1136.92 seconds)\n", + "Cbc0010I After 14478000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1136.97 seconds)\n", + "Cbc0010I After 14479000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1137.03 seconds)\n", + "Cbc0010I After 14480000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1137.09 seconds)\n", + "Cbc0010I After 14481000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1137.14 seconds)\n", + "Cbc0010I After 14482000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1137.23 seconds)\n", + "Cbc0010I After 14483000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1137.30 seconds)\n", + "Cbc0010I After 14484000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1137.36 seconds)\n", + "Cbc0010I After 14485000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1137.44 seconds)\n", + "Cbc0010I After 14486000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1137.49 seconds)\n", + "Cbc0010I After 14487000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1137.56 seconds)\n", + "Cbc0010I After 14488000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1137.64 seconds)\n", + "Cbc0010I After 14489000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1137.70 seconds)\n", + "Cbc0010I After 14490000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1137.76 seconds)\n", + "Cbc0010I After 14491000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1137.82 seconds)\n", + "Cbc0010I After 14492000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1137.88 seconds)\n", + "Cbc0010I After 14493000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1137.95 seconds)\n", + "Cbc0010I After 14494000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1138.00 seconds)\n", + "Cbc0010I After 14495000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1138.06 seconds)\n", + "Cbc0010I After 14496000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1138.11 seconds)\n", + "Cbc0010I After 14497000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1138.18 seconds)\n", + "Cbc0010I After 14498000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1138.23 seconds)\n", + "Cbc0010I After 14499000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.30 seconds)\n", + "Cbc0010I After 14500000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1138.38 seconds)\n", + "Cbc0010I After 14501000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.46 seconds)\n", + "Cbc0010I After 14502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1138.52 seconds)\n", + "Cbc0010I After 14503000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1138.58 seconds)\n", + "Cbc0010I After 14504000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1138.63 seconds)\n", + "Cbc0010I After 14505000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1138.70 seconds)\n", + "Cbc0010I After 14506000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1138.75 seconds)\n", + "Cbc0010I After 14507000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.81 seconds)\n", + "Cbc0010I After 14508000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1138.89 seconds)\n", + "Cbc0010I After 14509000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1138.96 seconds)\n", + "Cbc0010I After 14510000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1139.08 seconds)\n", + "Cbc0010I After 14511000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1139.19 seconds)\n", + "Cbc0010I After 14512000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1139.30 seconds)\n", + "Cbc0010I After 14513000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1139.39 seconds)\n", + "Cbc0010I After 14514000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1139.46 seconds)\n", + "Cbc0010I After 14515000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1139.55 seconds)\n", + "Cbc0010I After 14516000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1139.60 seconds)\n", + "Cbc0010I After 14517000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1139.68 seconds)\n", + "Cbc0010I After 14518000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1139.74 seconds)\n", + "Cbc0010I After 14519000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1139.82 seconds)\n", + "Cbc0010I After 14520000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1139.96 seconds)\n", + "Cbc0010I After 14521000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1140.08 seconds)\n", + "Cbc0010I After 14522000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1140.16 seconds)\n", + "Cbc0010I After 14523000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1140.23 seconds)\n", + "Cbc0010I After 14524000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1140.31 seconds)\n", + "Cbc0010I After 14525000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1140.39 seconds)\n", + "Cbc0010I After 14526000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1140.46 seconds)\n", + "Cbc0010I After 14527000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.52 seconds)\n", + "Cbc0010I After 14528000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1140.60 seconds)\n", + "Cbc0010I After 14529000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.65 seconds)\n", + "Cbc0010I After 14530000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.72 seconds)\n", + "Cbc0010I After 14531000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1140.79 seconds)\n", + "Cbc0010I After 14532000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1140.84 seconds)\n", + "Cbc0010I After 14533000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1140.90 seconds)\n", + "Cbc0010I After 14534000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1140.97 seconds)\n", + "Cbc0010I After 14535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1141.03 seconds)\n", + "Cbc0010I After 14536000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1141.10 seconds)\n", + "Cbc0010I After 14537000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1141.16 seconds)\n", + "Cbc0010I After 14538000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1141.23 seconds)\n", + "Cbc0010I After 14539000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1141.29 seconds)\n", + "Cbc0010I After 14540000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1141.36 seconds)\n", + "Cbc0010I After 14541000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1141.43 seconds)\n", + "Cbc0010I After 14542000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1141.50 seconds)\n", + "Cbc0010I After 14543000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1141.56 seconds)\n", + "Cbc0010I After 14544000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1141.63 seconds)\n", + "Cbc0010I After 14545000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1141.69 seconds)\n", + "Cbc0010I After 14546000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1141.75 seconds)\n", + "Cbc0010I After 14547000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1141.81 seconds)\n", + "Cbc0010I After 14548000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1141.88 seconds)\n", + "Cbc0010I After 14549000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1141.94 seconds)\n", + "Cbc0010I After 14550000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1141.99 seconds)\n", + "Cbc0010I After 14551000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1142.06 seconds)\n", + "Cbc0010I After 14552000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1142.12 seconds)\n", + "Cbc0010I After 14553000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1142.19 seconds)\n", + "Cbc0010I After 14554000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1142.26 seconds)\n", + "Cbc0010I After 14555000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1142.32 seconds)\n", + "Cbc0010I After 14556000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1142.39 seconds)\n", + "Cbc0010I After 14557000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1142.45 seconds)\n", + "Cbc0010I After 14558000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1142.52 seconds)\n", + "Cbc0010I After 14559000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1142.58 seconds)\n", + "Cbc0010I After 14560000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1142.64 seconds)\n", + "Cbc0010I After 14561000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1142.71 seconds)\n", + "Cbc0010I After 14562000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1142.78 seconds)\n", + "Cbc0010I After 14563000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1142.84 seconds)\n", + "Cbc0010I After 14564000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1142.92 seconds)\n", + "Cbc0010I After 14565000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.01 seconds)\n", + "Cbc0010I After 14566000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1143.07 seconds)\n", + "Cbc0010I After 14567000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.14 seconds)\n", + "Cbc0010I After 14568000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1143.21 seconds)\n", + "Cbc0010I After 14569000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1143.27 seconds)\n", + "Cbc0010I After 14570000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1143.33 seconds)\n", + "Cbc0010I After 14571000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1143.38 seconds)\n", + "Cbc0010I After 14572000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1143.44 seconds)\n", + "Cbc0010I After 14573000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1143.50 seconds)\n", + "Cbc0010I After 14574000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1143.56 seconds)\n", + "Cbc0010I After 14575000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.62 seconds)\n", + "Cbc0010I After 14576000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.68 seconds)\n", + "Cbc0010I After 14577000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1143.73 seconds)\n", + "Cbc0010I After 14578000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1143.79 seconds)\n", + "Cbc0010I After 14579000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1143.86 seconds)\n", + "Cbc0010I After 14580000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1143.92 seconds)\n", + "Cbc0010I After 14581000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1143.99 seconds)\n", + "Cbc0010I After 14582000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1144.05 seconds)\n", + "Cbc0010I After 14583000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1144.11 seconds)\n", + "Cbc0010I After 14584000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.17 seconds)\n", + "Cbc0010I After 14585000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1144.22 seconds)\n", + "Cbc0010I After 14586000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1144.28 seconds)\n", + "Cbc0010I After 14587000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1144.36 seconds)\n", + "Cbc0010I After 14588000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1144.42 seconds)\n", + "Cbc0010I After 14589000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1144.48 seconds)\n", + "Cbc0010I After 14590000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1144.54 seconds)\n", + "Cbc0010I After 14591000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.60 seconds)\n", + "Cbc0010I After 14592000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1144.66 seconds)\n", + "Cbc0010I After 14593000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1144.72 seconds)\n", + "Cbc0010I After 14594000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.78 seconds)\n", + "Cbc0010I After 14595000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1144.85 seconds)\n", + "Cbc0010I After 14596000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1144.91 seconds)\n", + "Cbc0010I After 14597000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1144.97 seconds)\n", + "Cbc0010I After 14598000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1145.03 seconds)\n", + "Cbc0010I After 14599000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.08 seconds)\n", + "Cbc0010I After 14600000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1145.14 seconds)\n", + "Cbc0010I After 14601000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.20 seconds)\n", + "Cbc0010I After 14602000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1145.26 seconds)\n", + "Cbc0010I After 14603000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1145.32 seconds)\n", + "Cbc0010I After 14604000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1145.38 seconds)\n", + "Cbc0010I After 14605000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.44 seconds)\n", + "Cbc0010I After 14606000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1145.50 seconds)\n", + "Cbc0010I After 14607000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1145.56 seconds)\n", + "Cbc0010I After 14608000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1145.67 seconds)\n", + "Cbc0010I After 14609000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1145.74 seconds)\n", + "Cbc0010I After 14610000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1145.80 seconds)\n", + "Cbc0010I After 14611000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.87 seconds)\n", + "Cbc0010I After 14612000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1145.93 seconds)\n", + "Cbc0010I After 14613000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1145.99 seconds)\n", + "Cbc0010I After 14614000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1146.06 seconds)\n", + "Cbc0010I After 14615000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1146.11 seconds)\n", + "Cbc0010I After 14616000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1146.18 seconds)\n", + "Cbc0010I After 14617000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1146.23 seconds)\n", + "Cbc0010I After 14618000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1146.29 seconds)\n", + "Cbc0010I After 14619000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1146.35 seconds)\n", + "Cbc0010I After 14620000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1146.40 seconds)\n", + "Cbc0010I After 14621000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1146.46 seconds)\n", + "Cbc0010I After 14622000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1146.51 seconds)\n", + "Cbc0010I After 14623000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1146.56 seconds)\n", + "Cbc0010I After 14624000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1146.64 seconds)\n", + "Cbc0010I After 14625000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1146.71 seconds)\n", + "Cbc0010I After 14626000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1146.78 seconds)\n", + "Cbc0010I After 14627000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1146.86 seconds)\n", + "Cbc0010I After 14628000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1146.93 seconds)\n", + "Cbc0010I After 14629000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1147.00 seconds)\n", + "Cbc0010I After 14630000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1147.08 seconds)\n", + "Cbc0010I After 14631000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1147.15 seconds)\n", + "Cbc0010I After 14632000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1147.22 seconds)\n", + "Cbc0010I After 14633000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1147.29 seconds)\n", + "Cbc0010I After 14634000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1147.36 seconds)\n", + "Cbc0010I After 14635000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1147.43 seconds)\n", + "Cbc0010I After 14636000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1147.51 seconds)\n", + "Cbc0010I After 14637000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1147.58 seconds)\n", + "Cbc0010I After 14638000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1147.65 seconds)\n", + "Cbc0010I After 14639000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1147.72 seconds)\n", + "Cbc0010I After 14640000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1147.80 seconds)\n", + "Cbc0010I After 14641000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1147.87 seconds)\n", + "Cbc0010I After 14642000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1147.94 seconds)\n", + "Cbc0010I After 14643000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1148.00 seconds)\n", + "Cbc0010I After 14644000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1148.07 seconds)\n", + "Cbc0010I After 14645000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1148.14 seconds)\n", + "Cbc0010I After 14646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1148.22 seconds)\n", + "Cbc0010I After 14647000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1148.30 seconds)\n", + "Cbc0010I After 14648000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1148.38 seconds)\n", + "Cbc0010I After 14649000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1148.46 seconds)\n", + "Cbc0010I After 14650000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1148.54 seconds)\n", + "Cbc0010I After 14651000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1148.60 seconds)\n", + "Cbc0010I After 14652000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1148.68 seconds)\n", + "Cbc0010I After 14653000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1148.76 seconds)\n", + "Cbc0010I After 14654000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1148.85 seconds)\n", + "Cbc0010I After 14655000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1148.94 seconds)\n", + "Cbc0010I After 14656000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1149.03 seconds)\n", + "Cbc0010I After 14657000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1149.11 seconds)\n", + "Cbc0010I After 14658000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1149.19 seconds)\n", + "Cbc0010I After 14659000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1149.27 seconds)\n", + "Cbc0010I After 14660000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1149.34 seconds)\n", + "Cbc0010I After 14661000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1149.42 seconds)\n", + "Cbc0010I After 14662000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1149.49 seconds)\n", + "Cbc0010I After 14663000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1149.57 seconds)\n", + "Cbc0010I After 14664000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1149.64 seconds)\n", + "Cbc0010I After 14665000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1149.72 seconds)\n", + "Cbc0010I After 14666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1149.80 seconds)\n", + "Cbc0010I After 14667000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1149.87 seconds)\n", + "Cbc0010I After 14668000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1149.97 seconds)\n", + "Cbc0010I After 14669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1150.05 seconds)\n", + "Cbc0010I After 14670000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1150.12 seconds)\n", + "Cbc0010I After 14671000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1150.20 seconds)\n", + "Cbc0010I After 14672000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1150.27 seconds)\n", + "Cbc0010I After 14673000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1150.35 seconds)\n", + "Cbc0010I After 14674000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1150.43 seconds)\n", + "Cbc0010I After 14675000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1150.50 seconds)\n", + "Cbc0010I After 14676000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1150.57 seconds)\n", + "Cbc0010I After 14677000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1150.64 seconds)\n", + "Cbc0010I After 14678000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1150.69 seconds)\n", + "Cbc0010I After 14679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1150.73 seconds)\n", + "Cbc0010I After 14680000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1150.78 seconds)\n", + "Cbc0010I After 14681000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1150.84 seconds)\n", + "Cbc0010I After 14682000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1150.89 seconds)\n", + "Cbc0010I After 14683000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1150.93 seconds)\n", + "Cbc0010I After 14684000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1150.97 seconds)\n", + "Cbc0010I After 14685000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1151.02 seconds)\n", + "Cbc0010I After 14686000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1151.06 seconds)\n", + "Cbc0010I After 14687000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1151.11 seconds)\n", + "Cbc0010I After 14688000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1151.17 seconds)\n", + "Cbc0010I After 14689000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1151.22 seconds)\n", + "Cbc0010I After 14690000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1151.27 seconds)\n", + "Cbc0010I After 14691000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1151.32 seconds)\n", + "Cbc0010I After 14692000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1151.36 seconds)\n", + "Cbc0010I After 14693000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.41 seconds)\n", + "Cbc0010I After 14694000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1151.45 seconds)\n", + "Cbc0010I After 14695000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1151.50 seconds)\n", + "Cbc0010I After 14696000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1151.56 seconds)\n", + "Cbc0010I After 14697000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1151.61 seconds)\n", + "Cbc0010I After 14698000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1151.67 seconds)\n", + "Cbc0010I After 14699000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1151.73 seconds)\n", + "Cbc0010I After 14700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1151.79 seconds)\n", + "Cbc0010I After 14701000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1151.84 seconds)\n", + "Cbc0010I After 14702000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1151.90 seconds)\n", + "Cbc0010I After 14703000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.94 seconds)\n", + "Cbc0010I After 14704000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.99 seconds)\n", + "Cbc0010I After 14705000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1152.03 seconds)\n", + "Cbc0010I After 14706000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1152.08 seconds)\n", + "Cbc0010I After 14707000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1152.12 seconds)\n", + "Cbc0010I After 14708000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1152.17 seconds)\n", + "Cbc0010I After 14709000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1152.22 seconds)\n", + "Cbc0010I After 14710000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.27 seconds)\n", + "Cbc0010I After 14711000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1152.32 seconds)\n", + "Cbc0010I After 14712000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1152.38 seconds)\n", + "Cbc0010I After 14713000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1152.43 seconds)\n", + "Cbc0010I After 14714000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1152.50 seconds)\n", + "Cbc0010I After 14715000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1152.56 seconds)\n", + "Cbc0010I After 14716000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.63 seconds)\n", + "Cbc0010I After 14717000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.70 seconds)\n", + "Cbc0010I After 14718000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1152.76 seconds)\n", + "Cbc0010I After 14719000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1152.83 seconds)\n", + "Cbc0010I After 14720000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1152.90 seconds)\n", + "Cbc0010I After 14721000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1152.98 seconds)\n", + "Cbc0010I After 14722000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1153.04 seconds)\n", + "Cbc0010I After 14723000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1153.09 seconds)\n", + "Cbc0010I After 14724000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1153.16 seconds)\n", + "Cbc0010I After 14725000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1153.21 seconds)\n", + "Cbc0010I After 14726000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.26 seconds)\n", + "Cbc0010I After 14727000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.33 seconds)\n", + "Cbc0010I After 14728000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1153.38 seconds)\n", + "Cbc0010I After 14729000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1153.42 seconds)\n", + "Cbc0010I After 14730000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.46 seconds)\n", + "Cbc0010I After 14731000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1153.54 seconds)\n", + "Cbc0010I After 14732000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.60 seconds)\n", + "Cbc0010I After 14733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.65 seconds)\n", + "Cbc0010I After 14734000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1153.71 seconds)\n", + "Cbc0010I After 14735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1153.75 seconds)\n", + "Cbc0010I After 14736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1153.81 seconds)\n", + "Cbc0010I After 14737000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.86 seconds)\n", + "Cbc0010I After 14738000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.91 seconds)\n", + "Cbc0010I After 14739000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.96 seconds)\n", + "Cbc0010I After 14740000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1154.00 seconds)\n", + "Cbc0010I After 14741000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.05 seconds)\n", + "Cbc0010I After 14742000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1154.10 seconds)\n", + "Cbc0010I After 14743000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1154.15 seconds)\n", + "Cbc0010I After 14744000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1154.19 seconds)\n", + "Cbc0010I After 14745000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1154.24 seconds)\n", + "Cbc0010I After 14746000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1154.29 seconds)\n", + "Cbc0010I After 14747000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.35 seconds)\n", + "Cbc0010I After 14748000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.43 seconds)\n", + "Cbc0010I After 14749000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.49 seconds)\n", + "Cbc0010I After 14750000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1154.54 seconds)\n", + "Cbc0010I After 14751000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1154.58 seconds)\n", + "Cbc0010I After 14752000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1154.63 seconds)\n", + "Cbc0010I After 14753000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1154.68 seconds)\n", + "Cbc0010I After 14754000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1154.72 seconds)\n", + "Cbc0010I After 14755000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.77 seconds)\n", + "Cbc0010I After 14756000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1154.82 seconds)\n", + "Cbc0010I After 14757000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.87 seconds)\n", + "Cbc0010I After 14758000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.92 seconds)\n", + "Cbc0010I After 14759000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1154.97 seconds)\n", + "Cbc0010I After 14760000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.02 seconds)\n", + "Cbc0010I After 14761000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1155.07 seconds)\n", + "Cbc0010I After 14762000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1155.13 seconds)\n", + "Cbc0010I After 14763000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1155.21 seconds)\n", + "Cbc0010I After 14764000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1155.26 seconds)\n", + "Cbc0010I After 14765000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1155.32 seconds)\n", + "Cbc0010I After 14766000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1155.39 seconds)\n", + "Cbc0010I After 14767000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1155.47 seconds)\n", + "Cbc0010I After 14768000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.54 seconds)\n", + "Cbc0010I After 14769000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.59 seconds)\n", + "Cbc0010I After 14770000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1155.64 seconds)\n", + "Cbc0010I After 14771000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1155.68 seconds)\n", + "Cbc0010I After 14772000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1155.73 seconds)\n", + "Cbc0010I After 14773000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1155.78 seconds)\n", + "Cbc0010I After 14774000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1155.84 seconds)\n", + "Cbc0010I After 14775000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1155.90 seconds)\n", + "Cbc0010I After 14776000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1155.96 seconds)\n", + "Cbc0010I After 14777000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1156.01 seconds)\n", + "Cbc0010I After 14778000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1156.08 seconds)\n", + "Cbc0010I After 14779000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1156.17 seconds)\n", + "Cbc0010I After 14780000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1156.24 seconds)\n", + "Cbc0010I After 14781000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1156.29 seconds)\n", + "Cbc0010I After 14782000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1156.34 seconds)\n", + "Cbc0010I After 14783000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1156.41 seconds)\n", + "Cbc0010I After 14784000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1156.47 seconds)\n", + "Cbc0010I After 14785000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1156.54 seconds)\n", + "Cbc0010I After 14786000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1156.61 seconds)\n", + "Cbc0010I After 14787000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1156.68 seconds)\n", + "Cbc0010I After 14788000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1156.73 seconds)\n", + "Cbc0010I After 14789000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1156.80 seconds)\n", + "Cbc0010I After 14790000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1156.87 seconds)\n", + "Cbc0010I After 14791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1156.95 seconds)\n", + "Cbc0010I After 14792000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1157.02 seconds)\n", + "Cbc0010I After 14793000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1157.08 seconds)\n", + "Cbc0010I After 14794000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1157.15 seconds)\n", + "Cbc0010I After 14795000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1157.21 seconds)\n", + "Cbc0010I After 14796000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1157.27 seconds)\n", + "Cbc0010I After 14797000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1157.35 seconds)\n", + "Cbc0010I After 14798000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1157.43 seconds)\n", + "Cbc0010I After 14799000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1157.49 seconds)\n", + "Cbc0010I After 14800000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1157.56 seconds)\n", + "Cbc0010I After 14801000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1157.63 seconds)\n", + "Cbc0010I After 14802000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1157.70 seconds)\n", + "Cbc0010I After 14803000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1157.77 seconds)\n", + "Cbc0010I After 14804000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1157.84 seconds)\n", + "Cbc0010I After 14805000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1157.90 seconds)\n", + "Cbc0010I After 14806000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1157.96 seconds)\n", + "Cbc0010I After 14807000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1158.03 seconds)\n", + "Cbc0010I After 14808000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1158.10 seconds)\n", + "Cbc0010I After 14809000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1158.16 seconds)\n", + "Cbc0010I After 14810000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1158.24 seconds)\n", + "Cbc0010I After 14811000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1158.29 seconds)\n", + "Cbc0010I After 14812000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1158.35 seconds)\n", + "Cbc0010I After 14813000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1158.40 seconds)\n", + "Cbc0010I After 14814000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1158.45 seconds)\n", + "Cbc0010I After 14815000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1158.52 seconds)\n", + "Cbc0010I After 14816000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1158.59 seconds)\n", + "Cbc0010I After 14817000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1158.64 seconds)\n", + "Cbc0010I After 14818000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1158.70 seconds)\n", + "Cbc0010I After 14819000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1158.75 seconds)\n", + "Cbc0010I After 14820000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1158.82 seconds)\n", + "Cbc0010I After 14821000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1158.88 seconds)\n", + "Cbc0010I After 14822000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1158.96 seconds)\n", + "Cbc0010I After 14823000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1159.02 seconds)\n", + "Cbc0010I After 14824000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1159.08 seconds)\n", + "Cbc0010I After 14825000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1159.13 seconds)\n", + "Cbc0010I After 14826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1159.19 seconds)\n", + "Cbc0010I After 14827000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1159.26 seconds)\n", + "Cbc0010I After 14828000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1159.33 seconds)\n", + "Cbc0010I After 14829000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1159.40 seconds)\n", + "Cbc0010I After 14830000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1159.45 seconds)\n", + "Cbc0010I After 14831000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1159.51 seconds)\n", + "Cbc0010I After 14832000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1159.58 seconds)\n", + "Cbc0010I After 14833000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1159.64 seconds)\n", + "Cbc0010I After 14834000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1159.70 seconds)\n", + "Cbc0010I After 14835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1159.78 seconds)\n", + "Cbc0010I After 14836000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1159.84 seconds)\n", + "Cbc0010I After 14837000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1159.91 seconds)\n", + "Cbc0010I After 14838000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1159.97 seconds)\n", + "Cbc0010I After 14839000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1160.04 seconds)\n", + "Cbc0010I After 14840000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1160.11 seconds)\n", + "Cbc0010I After 14841000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1160.17 seconds)\n", + "Cbc0010I After 14842000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1160.24 seconds)\n", + "Cbc0010I After 14843000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1160.29 seconds)\n", + "Cbc0010I After 14844000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1160.35 seconds)\n", + "Cbc0010I After 14845000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1160.41 seconds)\n", + "Cbc0010I After 14846000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1160.46 seconds)\n", + "Cbc0010I After 14847000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1160.53 seconds)\n", + "Cbc0010I After 14848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1160.61 seconds)\n", + "Cbc0010I After 14849000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1160.67 seconds)\n", + "Cbc0010I After 14850000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1160.73 seconds)\n", + "Cbc0010I After 14851000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1160.78 seconds)\n", + "Cbc0010I After 14852000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1160.84 seconds)\n", + "Cbc0010I After 14853000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1160.89 seconds)\n", + "Cbc0010I After 14854000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1160.95 seconds)\n", + "Cbc0010I After 14855000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1161.01 seconds)\n", + "Cbc0010I After 14856000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1161.07 seconds)\n", + "Cbc0010I After 14857000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1161.14 seconds)\n", + "Cbc0010I After 14858000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1161.24 seconds)\n", + "Cbc0010I After 14859000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1161.30 seconds)\n", + "Cbc0010I After 14860000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1161.38 seconds)\n", + "Cbc0010I After 14861000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1161.45 seconds)\n", + "Cbc0010I After 14862000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1161.52 seconds)\n", + "Cbc0010I After 14863000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1161.58 seconds)\n", + "Cbc0010I After 14864000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1161.65 seconds)\n", + "Cbc0010I After 14865000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1161.72 seconds)\n", + "Cbc0010I After 14866000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1161.78 seconds)\n", + "Cbc0010I After 14867000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1161.84 seconds)\n", + "Cbc0010I After 14868000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1161.91 seconds)\n", + "Cbc0010I After 14869000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1161.98 seconds)\n", + "Cbc0010I After 14870000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1162.04 seconds)\n", + "Cbc0010I After 14871000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1162.09 seconds)\n", + "Cbc0010I After 14872000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1162.15 seconds)\n", + "Cbc0010I After 14873000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1162.21 seconds)\n", + "Cbc0010I After 14874000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.26 seconds)\n", + "Cbc0010I After 14875000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1162.32 seconds)\n", + "Cbc0010I After 14876000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.37 seconds)\n", + "Cbc0010I After 14877000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1162.43 seconds)\n", + "Cbc0010I After 14878000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1162.48 seconds)\n", + "Cbc0010I After 14879000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1162.54 seconds)\n", + "Cbc0010I After 14880000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1162.61 seconds)\n", + "Cbc0010I After 14881000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1162.67 seconds)\n", + "Cbc0010I After 14882000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1162.72 seconds)\n", + "Cbc0010I After 14883000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1162.78 seconds)\n", + "Cbc0010I After 14884000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.84 seconds)\n", + "Cbc0010I After 14885000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1162.90 seconds)\n", + "Cbc0010I After 14886000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1162.95 seconds)\n", + "Cbc0010I After 14887000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1163.00 seconds)\n", + "Cbc0010I After 14888000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1163.06 seconds)\n", + "Cbc0010I After 14889000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1163.12 seconds)\n", + "Cbc0010I After 14890000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1163.18 seconds)\n", + "Cbc0010I After 14891000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1163.23 seconds)\n", + "Cbc0010I After 14892000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1163.30 seconds)\n", + "Cbc0010I After 14893000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1163.36 seconds)\n", + "Cbc0010I After 14894000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1163.42 seconds)\n", + "Cbc0010I After 14895000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1163.48 seconds)\n", + "Cbc0010I After 14896000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1163.55 seconds)\n", + "Cbc0010I After 14897000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1163.61 seconds)\n", + "Cbc0010I After 14898000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1163.68 seconds)\n", + "Cbc0010I After 14899000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1163.75 seconds)\n", + "Cbc0010I After 14900000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1163.81 seconds)\n", + "Cbc0010I After 14901000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1163.87 seconds)\n", + "Cbc0010I After 14902000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1163.94 seconds)\n", + "Cbc0010I After 14903000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1164.00 seconds)\n", + "Cbc0010I After 14904000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.05 seconds)\n", + "Cbc0010I After 14905000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1164.12 seconds)\n", + "Cbc0010I After 14906000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1164.19 seconds)\n", + "Cbc0010I After 14907000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1164.25 seconds)\n", + "Cbc0010I After 14908000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1164.31 seconds)\n", + "Cbc0010I After 14909000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1164.37 seconds)\n", + "Cbc0010I After 14910000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1164.45 seconds)\n", + "Cbc0010I After 14911000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1164.51 seconds)\n", + "Cbc0010I After 14912000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1164.57 seconds)\n", + "Cbc0010I After 14913000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1164.65 seconds)\n", + "Cbc0010I After 14914000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1164.72 seconds)\n", + "Cbc0010I After 14915000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1164.79 seconds)\n", + "Cbc0010I After 14916000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1164.84 seconds)\n", + "Cbc0010I After 14917000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.90 seconds)\n", + "Cbc0010I After 14918000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.97 seconds)\n", + "Cbc0010I After 14919000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1165.04 seconds)\n", + "Cbc0010I After 14920000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1165.10 seconds)\n", + "Cbc0010I After 14921000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1165.16 seconds)\n", + "Cbc0010I After 14922000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1165.21 seconds)\n", + "Cbc0010I After 14923000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1165.28 seconds)\n", + "Cbc0010I After 14924000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1165.35 seconds)\n", + "Cbc0010I After 14925000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1165.41 seconds)\n", + "Cbc0010I After 14926000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1165.48 seconds)\n", + "Cbc0010I After 14927000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1165.54 seconds)\n", + "Cbc0010I After 14928000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1165.60 seconds)\n", + "Cbc0010I After 14929000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1165.68 seconds)\n", + "Cbc0010I After 14930000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1165.74 seconds)\n", + "Cbc0010I After 14931000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1165.81 seconds)\n", + "Cbc0010I After 14932000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1165.90 seconds)\n", + "Cbc0010I After 14933000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1165.96 seconds)\n", + "Cbc0010I After 14934000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1166.03 seconds)\n", + "Cbc0010I After 14935000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1166.09 seconds)\n", + "Cbc0010I After 14936000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1166.16 seconds)\n", + "Cbc0010I After 14937000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1166.23 seconds)\n", + "Cbc0010I After 14938000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1166.29 seconds)\n", + "Cbc0010I After 14939000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1166.36 seconds)\n", + "Cbc0010I After 14940000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1166.42 seconds)\n", + "Cbc0010I After 14941000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1166.50 seconds)\n", + "Cbc0010I After 14942000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1166.56 seconds)\n", + "Cbc0010I After 14943000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1166.62 seconds)\n", + "Cbc0010I After 14944000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1166.69 seconds)\n", + "Cbc0010I After 14945000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1166.76 seconds)\n", + "Cbc0010I After 14946000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1166.83 seconds)\n", + "Cbc0010I After 14947000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1166.90 seconds)\n", + "Cbc0010I After 14948000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1166.98 seconds)\n", + "Cbc0010I After 14949000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1167.04 seconds)\n", + "Cbc0010I After 14950000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1167.10 seconds)\n", + "Cbc0010I After 14951000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1167.17 seconds)\n", + "Cbc0010I After 14952000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1167.24 seconds)\n", + "Cbc0010I After 14953000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1167.32 seconds)\n", + "Cbc0010I After 14954000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1167.39 seconds)\n", + "Cbc0010I After 14955000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1167.46 seconds)\n", + "Cbc0010I After 14956000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1167.53 seconds)\n", + "Cbc0010I After 14957000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1167.60 seconds)\n", + "Cbc0010I After 14958000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1167.68 seconds)\n", + "Cbc0010I After 14959000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1167.75 seconds)\n", + "Cbc0010I After 14960000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1167.82 seconds)\n", + "Cbc0010I After 14961000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1167.89 seconds)\n", + "Cbc0010I After 14962000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1167.96 seconds)\n", + "Cbc0010I After 14963000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1168.03 seconds)\n", + "Cbc0010I After 14964000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1168.11 seconds)\n", + "Cbc0010I After 14965000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1168.16 seconds)\n", + "Cbc0010I After 14966000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1168.23 seconds)\n", + "Cbc0010I After 14967000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1168.30 seconds)\n", + "Cbc0010I After 14968000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1168.35 seconds)\n", + "Cbc0010I After 14969000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1168.41 seconds)\n", + "Cbc0010I After 14970000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1168.47 seconds)\n", + "Cbc0010I After 14971000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1168.54 seconds)\n", + "Cbc0010I After 14972000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1168.60 seconds)\n", + "Cbc0010I After 14973000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1168.68 seconds)\n", + "Cbc0010I After 14974000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1168.75 seconds)\n", + "Cbc0010I After 14975000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1168.82 seconds)\n", + "Cbc0010I After 14976000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1168.89 seconds)\n", + "Cbc0010I After 14977000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1168.94 seconds)\n", + "Cbc0010I After 14978000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1169.05 seconds)\n", + "Cbc0010I After 14979000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1169.15 seconds)\n", + "Cbc0010I After 14980000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1169.24 seconds)\n", + "Cbc0010I After 14981000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.33 seconds)\n", + "Cbc0010I After 14982000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1169.40 seconds)\n", + "Cbc0010I After 14983000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1169.48 seconds)\n", + "Cbc0010I After 14984000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1169.55 seconds)\n", + "Cbc0010I After 14985000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1169.62 seconds)\n", + "Cbc0010I After 14986000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.69 seconds)\n", + "Cbc0010I After 14987000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1169.77 seconds)\n", + "Cbc0010I After 14988000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1169.81 seconds)\n", + "Cbc0010I After 14989000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.85 seconds)\n", + "Cbc0010I After 14990000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1169.90 seconds)\n", + "Cbc0010I After 14991000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1169.98 seconds)\n", + "Cbc0010I After 14992000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1170.05 seconds)\n", + "Cbc0010I After 14993000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1170.13 seconds)\n", + "Cbc0010I After 14994000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1170.20 seconds)\n", + "Cbc0010I After 14995000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.29 seconds)\n", + "Cbc0010I After 14996000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1170.36 seconds)\n", + "Cbc0010I After 14997000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1170.44 seconds)\n", + "Cbc0010I After 14998000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1170.49 seconds)\n", + "Cbc0010I After 14999000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.56 seconds)\n", + "Cbc0010I After 15000000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1170.63 seconds)\n", + "Cbc0010I After 15001000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1170.67 seconds)\n", + "Cbc0010I After 15002000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1170.72 seconds)\n", + "Cbc0010I After 15003000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1170.80 seconds)\n", + "Cbc0010I After 15004000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.87 seconds)\n", + "Cbc0010I After 15005000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1170.95 seconds)\n", + "Cbc0010I After 15006000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1171.02 seconds)\n", + "Cbc0010I After 15007000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1171.10 seconds)\n", + "Cbc0010I After 15008000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1171.18 seconds)\n", + "Cbc0010I After 15009000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1171.23 seconds)\n", + "Cbc0010I After 15010000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1171.29 seconds)\n", + "Cbc0010I After 15011000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1171.36 seconds)\n", + "Cbc0010I After 15012000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1171.42 seconds)\n", + "Cbc0010I After 15013000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1171.50 seconds)\n", + "Cbc0010I After 15014000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1171.57 seconds)\n", + "Cbc0010I After 15015000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1171.64 seconds)\n", + "Cbc0010I After 15016000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1171.72 seconds)\n", + "Cbc0010I After 15017000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1171.79 seconds)\n", + "Cbc0010I After 15018000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1171.86 seconds)\n", + "Cbc0010I After 15019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1171.94 seconds)\n", + "Cbc0010I After 15020000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1171.98 seconds)\n", + "Cbc0010I After 15021000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1172.03 seconds)\n", + "Cbc0010I After 15022000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1172.10 seconds)\n", + "Cbc0010I After 15023000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1172.16 seconds)\n", + "Cbc0010I After 15024000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1172.23 seconds)\n", + "Cbc0010I After 15025000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1172.31 seconds)\n", + "Cbc0010I After 15026000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1172.38 seconds)\n", + "Cbc0010I After 15027000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1172.46 seconds)\n", + "Cbc0010I After 15028000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1172.54 seconds)\n", + "Cbc0010I After 15029000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1172.62 seconds)\n", + "Cbc0010I After 15030000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1172.69 seconds)\n", + "Cbc0010I After 15031000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1172.77 seconds)\n", + "Cbc0010I After 15032000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1172.83 seconds)\n", + "Cbc0010I After 15033000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1172.85 seconds)\n", + "Cbc0010I After 15034000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1172.93 seconds)\n", + "Cbc0010I After 15035000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1172.99 seconds)\n", + "Cbc0010I After 15036000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1173.07 seconds)\n", + "Cbc0010I After 15037000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1173.14 seconds)\n", + "Cbc0010I After 15038000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1173.20 seconds)\n", + "Cbc0010I After 15039000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1173.28 seconds)\n", + "Cbc0010I After 15040000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1173.36 seconds)\n", + "Cbc0010I After 15041000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1173.43 seconds)\n", + "Cbc0010I After 15042000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1173.51 seconds)\n", + "Cbc0010I After 15043000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1173.59 seconds)\n", + "Cbc0010I After 15044000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1173.66 seconds)\n", + "Cbc0010I After 15045000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1173.73 seconds)\n", + "Cbc0010I After 15046000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1173.81 seconds)\n", + "Cbc0010I After 15047000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1173.88 seconds)\n", + "Cbc0010I After 15048000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1173.95 seconds)\n", + "Cbc0010I After 15049000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1174.02 seconds)\n", + "Cbc0010I After 15050000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1174.10 seconds)\n", + "Cbc0010I After 15051000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1174.17 seconds)\n", + "Cbc0010I After 15052000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1174.24 seconds)\n", + "Cbc0010I After 15053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1174.32 seconds)\n", + "Cbc0010I After 15054000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1174.41 seconds)\n", + "Cbc0010I After 15055000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1174.50 seconds)\n", + "Cbc0010I After 15056000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1174.58 seconds)\n", + "Cbc0010I After 15057000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1174.65 seconds)\n", + "Cbc0010I After 15058000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1174.73 seconds)\n", + "Cbc0010I After 15059000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1174.81 seconds)\n", + "Cbc0010I After 15060000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1174.88 seconds)\n", + "Cbc0010I After 15061000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1174.96 seconds)\n", + "Cbc0010I After 15062000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1175.03 seconds)\n", + "Cbc0010I After 15063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1175.11 seconds)\n", + "Cbc0010I After 15064000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1175.18 seconds)\n", + "Cbc0010I After 15065000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1175.26 seconds)\n", + "Cbc0010I After 15066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1175.35 seconds)\n", + "Cbc0010I After 15067000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1175.42 seconds)\n", + "Cbc0010I After 15068000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1175.50 seconds)\n", + "Cbc0010I After 15069000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1175.57 seconds)\n", + "Cbc0010I After 15070000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1175.64 seconds)\n", + "Cbc0010I After 15071000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1175.72 seconds)\n", + "Cbc0010I After 15072000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1175.80 seconds)\n", + "Cbc0010I After 15073000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1175.85 seconds)\n", + "Cbc0010I After 15074000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1175.88 seconds)\n", + "Cbc0010I After 15075000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1175.95 seconds)\n", + "Cbc0010I After 15076000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1176.02 seconds)\n", + "Cbc0010I After 15077000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1176.09 seconds)\n", + "Cbc0010I After 15078000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1176.15 seconds)\n", + "Cbc0010I After 15079000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1176.23 seconds)\n", + "Cbc0010I After 15080000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1176.30 seconds)\n", + "Cbc0010I After 15081000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1176.36 seconds)\n", + "Cbc0010I After 15082000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1176.42 seconds)\n", + "Cbc0010I After 15083000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1176.50 seconds)\n", + "Cbc0010I After 15084000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1176.57 seconds)\n", + "Cbc0010I After 15085000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1176.65 seconds)\n", + "Cbc0010I After 15086000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1176.72 seconds)\n", + "Cbc0010I After 15087000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1176.80 seconds)\n", + "Cbc0010I After 15088000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1176.88 seconds)\n", + "Cbc0010I After 15089000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1176.96 seconds)\n", + "Cbc0010I After 15090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1177.03 seconds)\n", + "Cbc0010I After 15091000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1177.11 seconds)\n", + "Cbc0010I After 15092000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1177.19 seconds)\n", + "Cbc0010I After 15093000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1177.27 seconds)\n", + "Cbc0010I After 15094000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1177.34 seconds)\n", + "Cbc0010I After 15095000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1177.42 seconds)\n", + "Cbc0010I After 15096000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1177.50 seconds)\n", + "Cbc0010I After 15097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1177.57 seconds)\n", + "Cbc0010I After 15098000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1177.65 seconds)\n", + "Cbc0010I After 15099000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1177.72 seconds)\n", + "Cbc0010I After 15100000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1177.80 seconds)\n", + "Cbc0010I After 15101000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1177.87 seconds)\n", + "Cbc0010I After 15102000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1177.95 seconds)\n", + "Cbc0010I After 15103000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1178.03 seconds)\n", + "Cbc0010I After 15104000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1178.11 seconds)\n", + "Cbc0010I After 15105000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1178.19 seconds)\n", + "Cbc0010I After 15106000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1178.26 seconds)\n", + "Cbc0010I After 15107000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1178.35 seconds)\n", + "Cbc0010I After 15108000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1178.47 seconds)\n", + "Cbc0010I After 15109000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1178.56 seconds)\n", + "Cbc0010I After 15110000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1178.66 seconds)\n", + "Cbc0010I After 15111000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1178.76 seconds)\n", + "Cbc0010I After 15112000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1178.84 seconds)\n", + "Cbc0010I After 15113000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1178.91 seconds)\n", + "Cbc0010I After 15114000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1178.98 seconds)\n", + "Cbc0010I After 15115000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1179.07 seconds)\n", + "Cbc0010I After 15116000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1179.15 seconds)\n", + "Cbc0010I After 15117000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1179.22 seconds)\n", + "Cbc0010I After 15118000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1179.29 seconds)\n", + "Cbc0010I After 15119000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.36 seconds)\n", + "Cbc0010I After 15120000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1179.43 seconds)\n", + "Cbc0010I After 15121000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1179.50 seconds)\n", + "Cbc0010I After 15122000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1179.57 seconds)\n", + "Cbc0010I After 15123000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.65 seconds)\n", + "Cbc0010I After 15124000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.72 seconds)\n", + "Cbc0010I After 15125000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1179.79 seconds)\n", + "Cbc0010I After 15126000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1179.87 seconds)\n", + "Cbc0010I After 15127000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1179.94 seconds)\n", + "Cbc0010I After 15128000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1180.01 seconds)\n", + "Cbc0010I After 15129000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.08 seconds)\n", + "Cbc0010I After 15130000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1180.15 seconds)\n", + "Cbc0010I After 15131000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.23 seconds)\n", + "Cbc0010I After 15132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.30 seconds)\n", + "Cbc0010I After 15133000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1180.38 seconds)\n", + "Cbc0010I After 15134000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1180.45 seconds)\n", + "Cbc0010I After 15135000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1180.53 seconds)\n", + "Cbc0010I After 15136000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1180.60 seconds)\n", + "Cbc0010I After 15137000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1180.67 seconds)\n", + "Cbc0010I After 15138000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1180.74 seconds)\n", + "Cbc0010I After 15139000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1180.81 seconds)\n", + "Cbc0010I After 15140000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1180.88 seconds)\n", + "Cbc0010I After 15141000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1180.96 seconds)\n", + "Cbc0010I After 15142000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1181.03 seconds)\n", + "Cbc0010I After 15143000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1181.10 seconds)\n", + "Cbc0010I After 15144000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1181.18 seconds)\n", + "Cbc0010I After 15145000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1181.25 seconds)\n", + "Cbc0010I After 15146000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1181.32 seconds)\n", + "Cbc0010I After 15147000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1181.39 seconds)\n", + "Cbc0010I After 15148000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1181.47 seconds)\n", + "Cbc0010I After 15149000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1181.55 seconds)\n", + "Cbc0010I After 15150000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1181.64 seconds)\n", + "Cbc0010I After 15151000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1181.70 seconds)\n", + "Cbc0010I After 15152000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1181.77 seconds)\n", + "Cbc0010I After 15153000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1181.86 seconds)\n", + "Cbc0010I After 15154000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1181.93 seconds)\n", + "Cbc0010I After 15155000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1182.01 seconds)\n", + "Cbc0010I After 15156000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1182.08 seconds)\n", + "Cbc0010I After 15157000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1182.16 seconds)\n", + "Cbc0010I After 15158000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1182.23 seconds)\n", + "Cbc0010I After 15159000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.31 seconds)\n", + "Cbc0010I After 15160000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.39 seconds)\n", + "Cbc0010I After 15161000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1182.47 seconds)\n", + "Cbc0010I After 15162000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.54 seconds)\n", + "Cbc0010I After 15163000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1182.62 seconds)\n", + "Cbc0010I After 15164000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1182.69 seconds)\n", + "Cbc0010I After 15165000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1182.77 seconds)\n", + "Cbc0010I After 15166000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1182.84 seconds)\n", + "Cbc0010I After 15167000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1182.91 seconds)\n", + "Cbc0010I After 15168000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1182.99 seconds)\n", + "Cbc0010I After 15169000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1183.06 seconds)\n", + "Cbc0010I After 15170000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1183.13 seconds)\n", + "Cbc0010I After 15171000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1183.21 seconds)\n", + "Cbc0010I After 15172000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1183.28 seconds)\n", + "Cbc0010I After 15173000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1183.36 seconds)\n", + "Cbc0010I After 15174000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1183.44 seconds)\n", + "Cbc0010I After 15175000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1183.52 seconds)\n", + "Cbc0010I After 15176000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1183.59 seconds)\n", + "Cbc0010I After 15177000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1183.66 seconds)\n", + "Cbc0010I After 15178000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1183.74 seconds)\n", + "Cbc0010I After 15179000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1183.81 seconds)\n", + "Cbc0010I After 15180000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1183.88 seconds)\n", + "Cbc0010I After 15181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1183.95 seconds)\n", + "Cbc0010I After 15182000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1184.02 seconds)\n", + "Cbc0010I After 15183000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1184.10 seconds)\n", + "Cbc0010I After 15184000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1184.17 seconds)\n", + "Cbc0010I After 15185000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1184.24 seconds)\n", + "Cbc0010I After 15186000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1184.31 seconds)\n", + "Cbc0010I After 15187000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.38 seconds)\n", + "Cbc0010I After 15188000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1184.46 seconds)\n", + "Cbc0010I After 15189000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1184.53 seconds)\n", + "Cbc0010I After 15190000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1184.60 seconds)\n", + "Cbc0010I After 15191000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1184.68 seconds)\n", + "Cbc0010I After 15192000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.76 seconds)\n", + "Cbc0010I After 15193000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.84 seconds)\n", + "Cbc0010I After 15194000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1184.92 seconds)\n", + "Cbc0010I After 15195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1185.00 seconds)\n", + "Cbc0010I After 15196000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1185.08 seconds)\n", + "Cbc0010I After 15197000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1185.15 seconds)\n", + "Cbc0010I After 15198000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1185.23 seconds)\n", + "Cbc0010I After 15199000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1185.31 seconds)\n", + "Cbc0010I After 15200000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1185.38 seconds)\n", + "Cbc0010I After 15201000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1185.46 seconds)\n", + "Cbc0010I After 15202000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1185.54 seconds)\n", + "Cbc0010I After 15203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1185.61 seconds)\n", + "Cbc0010I After 15204000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1185.69 seconds)\n", + "Cbc0010I After 15205000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1185.77 seconds)\n", + "Cbc0010I After 15206000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1185.85 seconds)\n", + "Cbc0010I After 15207000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1185.92 seconds)\n", + "Cbc0010I After 15208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1186.00 seconds)\n", + "Cbc0010I After 15209000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1186.08 seconds)\n", + "Cbc0010I After 15210000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1186.15 seconds)\n", + "Cbc0010I After 15211000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1186.23 seconds)\n", + "Cbc0010I After 15212000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1186.30 seconds)\n", + "Cbc0010I After 15213000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1186.38 seconds)\n", + "Cbc0010I After 15214000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1186.46 seconds)\n", + "Cbc0010I After 15215000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1186.53 seconds)\n", + "Cbc0010I After 15216000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1186.61 seconds)\n", + "Cbc0010I After 15217000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1186.69 seconds)\n", + "Cbc0010I After 15218000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1186.78 seconds)\n", + "Cbc0010I After 15219000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1186.87 seconds)\n", + "Cbc0010I After 15220000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1186.97 seconds)\n", + "Cbc0010I After 15221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1187.08 seconds)\n", + "Cbc0010I After 15222000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1187.18 seconds)\n", + "Cbc0010I After 15223000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.26 seconds)\n", + "Cbc0010I After 15224000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1187.34 seconds)\n", + "Cbc0010I After 15225000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1187.42 seconds)\n", + "Cbc0010I After 15226000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1187.50 seconds)\n", + "Cbc0010I After 15227000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.58 seconds)\n", + "Cbc0010I After 15228000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1187.65 seconds)\n", + "Cbc0010I After 15229000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1187.73 seconds)\n", + "Cbc0010I After 15230000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.81 seconds)\n", + "Cbc0010I After 15231000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1187.88 seconds)\n", + "Cbc0010I After 15232000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1187.96 seconds)\n", + "Cbc0010I After 15233000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1188.04 seconds)\n", + "Cbc0010I After 15234000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1188.11 seconds)\n", + "Cbc0010I After 15235000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1188.20 seconds)\n", + "Cbc0010I After 15236000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1188.28 seconds)\n", + "Cbc0010I After 15237000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1188.36 seconds)\n", + "Cbc0010I After 15238000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1188.44 seconds)\n", + "Cbc0010I After 15239000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1188.52 seconds)\n", + "Cbc0010I After 15240000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1188.59 seconds)\n", + "Cbc0010I After 15241000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1188.66 seconds)\n", + "Cbc0010I After 15242000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1188.74 seconds)\n", + "Cbc0010I After 15243000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1188.82 seconds)\n", + "Cbc0010I After 15244000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1188.89 seconds)\n", + "Cbc0010I After 15245000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1188.95 seconds)\n", + "Cbc0010I After 15246000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1189.02 seconds)\n", + "Cbc0010I After 15247000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1189.10 seconds)\n", + "Cbc0010I After 15248000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.17 seconds)\n", + "Cbc0010I After 15249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.24 seconds)\n", + "Cbc0010I After 15250000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1189.31 seconds)\n", + "Cbc0010I After 15251000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1189.38 seconds)\n", + "Cbc0010I After 15252000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1189.45 seconds)\n", + "Cbc0010I After 15253000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1189.51 seconds)\n", + "Cbc0010I After 15254000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1189.57 seconds)\n", + "Cbc0010I After 15255000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1189.64 seconds)\n", + "Cbc0010I After 15256000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1189.72 seconds)\n", + "Cbc0010I After 15257000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1189.79 seconds)\n", + "Cbc0010I After 15258000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.85 seconds)\n", + "Cbc0010I After 15259000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1189.91 seconds)\n", + "Cbc0010I After 15260000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1189.97 seconds)\n", + "Cbc0010I After 15261000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1190.04 seconds)\n", + "Cbc0010I After 15262000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1190.10 seconds)\n", + "Cbc0010I After 15263000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1190.16 seconds)\n", + "Cbc0010I After 15264000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1190.22 seconds)\n", + "Cbc0010I After 15265000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1190.29 seconds)\n", + "Cbc0010I After 15266000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1190.35 seconds)\n", + "Cbc0010I After 15267000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1190.42 seconds)\n", + "Cbc0010I After 15268000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1190.50 seconds)\n", + "Cbc0010I After 15269000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1190.57 seconds)\n", + "Cbc0010I After 15270000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1190.64 seconds)\n", + "Cbc0010I After 15271000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1190.70 seconds)\n", + "Cbc0010I After 15272000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1190.77 seconds)\n", + "Cbc0010I After 15273000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1190.84 seconds)\n", + "Cbc0010I After 15274000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1190.89 seconds)\n", + "Cbc0010I After 15275000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1190.96 seconds)\n", + "Cbc0010I After 15276000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1191.04 seconds)\n", + "Cbc0010I After 15277000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1191.10 seconds)\n", + "Cbc0010I After 15278000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1191.17 seconds)\n", + "Cbc0010I After 15279000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1191.24 seconds)\n", + "Cbc0010I After 15280000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1191.29 seconds)\n", + "Cbc0010I After 15281000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1191.36 seconds)\n", + "Cbc0010I After 15282000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1191.42 seconds)\n", + "Cbc0010I After 15283000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1191.49 seconds)\n", + "Cbc0010I After 15284000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1191.56 seconds)\n", + "Cbc0010I After 15285000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1191.62 seconds)\n", + "Cbc0010I After 15286000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1191.68 seconds)\n", + "Cbc0010I After 15287000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1191.74 seconds)\n", + "Cbc0010I After 15288000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1191.79 seconds)\n", + "Cbc0010I After 15289000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1191.84 seconds)\n", + "Cbc0010I After 15290000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1191.91 seconds)\n", + "Cbc0010I After 15291000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1191.96 seconds)\n", + "Cbc0010I After 15292000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1192.02 seconds)\n", + "Cbc0010I After 15293000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1192.08 seconds)\n", + "Cbc0010I After 15294000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1192.13 seconds)\n", + "Cbc0010I After 15295000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1192.20 seconds)\n", + "Cbc0010I After 15296000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1192.26 seconds)\n", + "Cbc0010I After 15297000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1192.32 seconds)\n", + "Cbc0010I After 15298000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1192.39 seconds)\n", + "Cbc0010I After 15299000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1192.46 seconds)\n", + "Cbc0010I After 15300000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1192.53 seconds)\n", + "Cbc0010I After 15301000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1192.59 seconds)\n", + "Cbc0010I After 15302000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1192.65 seconds)\n", + "Cbc0010I After 15303000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1192.72 seconds)\n", + "Cbc0010I After 15304000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1192.79 seconds)\n", + "Cbc0010I After 15305000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1192.85 seconds)\n", + "Cbc0010I After 15306000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1192.91 seconds)\n", + "Cbc0010I After 15307000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1192.97 seconds)\n", + "Cbc0010I After 15308000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1193.03 seconds)\n", + "Cbc0010I After 15309000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1193.08 seconds)\n", + "Cbc0010I After 15310000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1193.14 seconds)\n", + "Cbc0010I After 15311000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1193.21 seconds)\n", + "Cbc0010I After 15312000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1193.26 seconds)\n", + "Cbc0010I After 15313000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1193.33 seconds)\n", + "Cbc0010I After 15314000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1193.40 seconds)\n", + "Cbc0010I After 15315000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1193.46 seconds)\n", + "Cbc0010I After 15316000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1193.51 seconds)\n", + "Cbc0010I After 15317000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1193.57 seconds)\n", + "Cbc0010I After 15318000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1193.66 seconds)\n", + "Cbc0010I After 15319000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1193.72 seconds)\n", + "Cbc0010I After 15320000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1193.79 seconds)\n", + "Cbc0010I After 15321000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1193.86 seconds)\n", + "Cbc0010I After 15322000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1193.92 seconds)\n", + "Cbc0010I After 15323000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1193.98 seconds)\n", + "Cbc0010I After 15324000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1194.03 seconds)\n", + "Cbc0010I After 15325000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.09 seconds)\n", + "Cbc0010I After 15326000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1194.16 seconds)\n", + "Cbc0010I After 15327000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1194.22 seconds)\n", + "Cbc0010I After 15328000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1194.28 seconds)\n", + "Cbc0010I After 15329000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.34 seconds)\n", + "Cbc0010I After 15330000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1194.41 seconds)\n", + "Cbc0010I After 15331000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1194.48 seconds)\n", + "Cbc0010I After 15332000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.55 seconds)\n", + "Cbc0010I After 15333000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1194.62 seconds)\n", + "Cbc0010I After 15334000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1194.68 seconds)\n", + "Cbc0010I After 15335000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.74 seconds)\n", + "Cbc0010I After 15336000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1194.80 seconds)\n", + "Cbc0010I After 15337000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1194.88 seconds)\n", + "Cbc0010I After 15338000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1194.95 seconds)\n", + "Cbc0010I After 15339000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1195.01 seconds)\n", + "Cbc0010I After 15340000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1195.07 seconds)\n", + "Cbc0010I After 15341000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1195.15 seconds)\n", + "Cbc0010I After 15342000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1195.21 seconds)\n", + "Cbc0010I After 15343000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1195.26 seconds)\n", + "Cbc0010I After 15344000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1195.31 seconds)\n", + "Cbc0010I After 15345000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1195.37 seconds)\n", + "Cbc0010I After 15346000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1195.44 seconds)\n", + "Cbc0010I After 15347000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1195.50 seconds)\n", + "Cbc0010I After 15348000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1195.56 seconds)\n", + "Cbc0010I After 15349000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1195.63 seconds)\n", + "Cbc0010I After 15350000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1195.70 seconds)\n", + "Cbc0010I After 15351000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1195.76 seconds)\n", + "Cbc0010I After 15352000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1195.83 seconds)\n", + "Cbc0010I After 15353000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1195.89 seconds)\n", + "Cbc0010I After 15354000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1195.97 seconds)\n", + "Cbc0010I After 15355000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1196.04 seconds)\n", + "Cbc0010I After 15356000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1196.13 seconds)\n", + "Cbc0010I After 15357000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1196.20 seconds)\n", + "Cbc0010I After 15358000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1196.26 seconds)\n", + "Cbc0010I After 15359000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1196.35 seconds)\n", + "Cbc0010I After 15360000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1196.40 seconds)\n", + "Cbc0010I After 15361000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1196.48 seconds)\n", + "Cbc0010I After 15362000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1196.56 seconds)\n", + "Cbc0010I After 15363000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1196.62 seconds)\n", + "Cbc0010I After 15364000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1196.68 seconds)\n", + "Cbc0010I After 15365000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1196.75 seconds)\n", + "Cbc0010I After 15366000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1196.80 seconds)\n", + "Cbc0010I After 15367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1196.86 seconds)\n", + "Cbc0010I After 15368000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1196.91 seconds)\n", + "Cbc0010I After 15369000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1196.98 seconds)\n", + "Cbc0010I After 15370000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1197.05 seconds)\n", + "Cbc0010I After 15371000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1197.12 seconds)\n", + "Cbc0010I After 15372000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1197.18 seconds)\n", + "Cbc0010I After 15373000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1197.24 seconds)\n", + "Cbc0010I After 15374000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1197.32 seconds)\n", + "Cbc0010I After 15375000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1197.38 seconds)\n", + "Cbc0010I After 15376000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1197.45 seconds)\n", + "Cbc0010I After 15377000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1197.52 seconds)\n", + "Cbc0010I After 15378000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1197.59 seconds)\n", + "Cbc0010I After 15379000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1197.65 seconds)\n", + "Cbc0010I After 15380000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1197.73 seconds)\n", + "Cbc0010I After 15381000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1197.79 seconds)\n", + "Cbc0010I After 15382000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1197.87 seconds)\n", + "Cbc0010I After 15383000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1197.94 seconds)\n", + "Cbc0010I After 15384000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1198.00 seconds)\n", + "Cbc0010I After 15385000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1198.06 seconds)\n", + "Cbc0010I After 15386000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1198.14 seconds)\n", + "Cbc0010I After 15387000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1198.22 seconds)\n", + "Cbc0010I After 15388000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1198.28 seconds)\n", + "Cbc0010I After 15389000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1198.36 seconds)\n", + "Cbc0010I After 15390000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1198.43 seconds)\n", + "Cbc0010I After 15391000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1198.50 seconds)\n", + "Cbc0010I After 15392000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1198.56 seconds)\n", + "Cbc0010I After 15393000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1198.63 seconds)\n", + "Cbc0010I After 15394000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1198.68 seconds)\n", + "Cbc0010I After 15395000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1198.74 seconds)\n", + "Cbc0010I After 15396000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1198.81 seconds)\n", + "Cbc0010I After 15397000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1198.86 seconds)\n", + "Cbc0010I After 15398000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1198.92 seconds)\n", + "Cbc0010I After 15399000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1198.99 seconds)\n", + "Cbc0010I After 15400000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1199.07 seconds)\n", + "Cbc0010I After 15401000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1199.15 seconds)\n", + "Cbc0010I After 15402000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1199.22 seconds)\n", + "Cbc0010I After 15403000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1199.28 seconds)\n", + "Cbc0010I After 15404000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1199.35 seconds)\n", + "Cbc0010I After 15405000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1199.42 seconds)\n", + "Cbc0010I After 15406000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1199.48 seconds)\n", + "Cbc0010I After 15407000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1199.56 seconds)\n", + "Cbc0010I After 15408000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1199.64 seconds)\n", + "Cbc0010I After 15409000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1199.71 seconds)\n", + "Cbc0010I After 15410000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1199.76 seconds)\n", + "Cbc0010I After 15411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1199.83 seconds)\n", + "Cbc0010I After 15412000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1199.91 seconds)\n", + "Cbc0010I After 15413000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1199.99 seconds)\n", + "Cbc0010I After 15414000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1200.07 seconds)\n", + "Cbc0010I After 15415000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1200.14 seconds)\n", + "Cbc0010I After 15416000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1200.20 seconds)\n", + "Cbc0010I After 15417000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1200.26 seconds)\n", + "Cbc0010I After 15418000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1200.33 seconds)\n", + "Cbc0010I After 15419000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1200.40 seconds)\n", + "Cbc0010I After 15420000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1200.48 seconds)\n", + "Cbc0010I After 15421000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1200.55 seconds)\n", + "Cbc0010I After 15422000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1200.62 seconds)\n", + "Cbc0010I After 15423000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1200.68 seconds)\n", + "Cbc0010I After 15424000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1200.74 seconds)\n", + "Cbc0010I After 15425000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1200.81 seconds)\n", + "Cbc0010I After 15426000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1200.88 seconds)\n", + "Cbc0010I After 15427000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1200.94 seconds)\n", + "Cbc0010I After 15428000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1201.00 seconds)\n", + "Cbc0010I After 15429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1201.07 seconds)\n", + "Cbc0010I After 15430000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1201.13 seconds)\n", + "Cbc0010I After 15431000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1201.20 seconds)\n", + "Cbc0010I After 15432000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1201.26 seconds)\n", + "Cbc0010I After 15433000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1201.33 seconds)\n", + "Cbc0010I After 15434000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1201.38 seconds)\n", + "Cbc0010I After 15435000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1201.44 seconds)\n", + "Cbc0010I After 15436000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1201.50 seconds)\n", + "Cbc0010I After 15437000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1201.55 seconds)\n", + "Cbc0010I After 15438000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1201.61 seconds)\n", + "Cbc0010I After 15439000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1201.67 seconds)\n", + "Cbc0010I After 15440000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1201.73 seconds)\n", + "Cbc0010I After 15441000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1201.79 seconds)\n", + "Cbc0010I After 15442000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1201.86 seconds)\n", + "Cbc0010I After 15443000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1201.95 seconds)\n", + "Cbc0010I After 15444000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1202.05 seconds)\n", + "Cbc0010I After 15445000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1202.11 seconds)\n", + "Cbc0010I After 15446000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1202.18 seconds)\n", + "Cbc0010I After 15447000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1202.24 seconds)\n", + "Cbc0010I After 15448000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1202.31 seconds)\n", + "Cbc0010I After 15449000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1202.37 seconds)\n", + "Cbc0010I After 15450000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1202.44 seconds)\n", + "Cbc0010I After 15451000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1202.50 seconds)\n", + "Cbc0010I After 15452000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1202.57 seconds)\n", + "Cbc0010I After 15453000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1202.64 seconds)\n", + "Cbc0010I After 15454000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1202.70 seconds)\n", + "Cbc0010I After 15455000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1202.76 seconds)\n", + "Cbc0010I After 15456000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1202.82 seconds)\n", + "Cbc0010I After 15457000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1202.88 seconds)\n", + "Cbc0010I After 15458000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1202.93 seconds)\n", + "Cbc0010I After 15459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1202.99 seconds)\n", + "Cbc0010I After 15460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1203.05 seconds)\n", + "Cbc0010I After 15461000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1203.11 seconds)\n", + "Cbc0010I After 15462000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1203.18 seconds)\n", + "Cbc0010I After 15463000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1203.24 seconds)\n", + "Cbc0010I After 15464000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1203.30 seconds)\n", + "Cbc0010I After 15465000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1203.36 seconds)\n", + "Cbc0010I After 15466000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1203.43 seconds)\n", + "Cbc0010I After 15467000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1203.49 seconds)\n", + "Cbc0010I After 15468000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1203.55 seconds)\n", + "Cbc0010I After 15469000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1203.60 seconds)\n", + "Cbc0010I After 15470000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1203.66 seconds)\n", + "Cbc0010I After 15471000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1203.73 seconds)\n", + "Cbc0010I After 15472000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1203.79 seconds)\n", + "Cbc0010I After 15473000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1203.85 seconds)\n", + "Cbc0010I After 15474000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1203.91 seconds)\n", + "Cbc0010I After 15475000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1203.97 seconds)\n", + "Cbc0010I After 15476000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1204.03 seconds)\n", + "Cbc0010I After 15477000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1204.10 seconds)\n", + "Cbc0010I After 15478000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1204.17 seconds)\n", + "Cbc0010I After 15479000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1204.24 seconds)\n", + "Cbc0010I After 15480000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1204.31 seconds)\n", + "Cbc0010I After 15481000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1204.37 seconds)\n", + "Cbc0010I After 15482000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1204.44 seconds)\n", + "Cbc0010I After 15483000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1204.51 seconds)\n", + "Cbc0010I After 15484000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1204.61 seconds)\n", + "Cbc0010I After 15485000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1204.68 seconds)\n", + "Cbc0010I After 15486000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1204.75 seconds)\n", + "Cbc0010I After 15487000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1204.82 seconds)\n", + "Cbc0010I After 15488000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1204.89 seconds)\n", + "Cbc0010I After 15489000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1204.96 seconds)\n", + "Cbc0010I After 15490000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1205.03 seconds)\n", + "Cbc0010I After 15491000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1205.09 seconds)\n", + "Cbc0010I After 15492000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1205.15 seconds)\n", + "Cbc0010I After 15493000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1205.23 seconds)\n", + "Cbc0010I After 15494000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1205.30 seconds)\n", + "Cbc0010I After 15495000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1205.38 seconds)\n", + "Cbc0010I After 15496000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1205.45 seconds)\n", + "Cbc0010I After 15497000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1205.52 seconds)\n", + "Cbc0010I After 15498000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1205.58 seconds)\n", + "Cbc0010I After 15499000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1205.64 seconds)\n", + "Cbc0010I After 15500000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1205.71 seconds)\n", + "Cbc0010I After 15501000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1205.75 seconds)\n", + "Cbc0010I After 15502000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1205.81 seconds)\n", + "Cbc0010I After 15503000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1205.88 seconds)\n", + "Cbc0010I After 15504000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1205.94 seconds)\n", + "Cbc0010I After 15505000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1206.01 seconds)\n", + "Cbc0010I After 15506000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1206.06 seconds)\n", + "Cbc0010I After 15507000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1206.12 seconds)\n", + "Cbc0010I After 15508000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1206.19 seconds)\n", + "Cbc0010I After 15509000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1206.26 seconds)\n", + "Cbc0010I After 15510000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1206.33 seconds)\n", + "Cbc0010I After 15511000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1206.39 seconds)\n", + "Cbc0010I After 15512000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1206.45 seconds)\n", + "Cbc0010I After 15513000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1206.52 seconds)\n", + "Cbc0010I After 15514000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1206.59 seconds)\n", + "Cbc0010I After 15515000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1206.66 seconds)\n", + "Cbc0010I After 15516000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1206.73 seconds)\n", + "Cbc0010I After 15517000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1206.79 seconds)\n", + "Cbc0010I After 15518000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1206.86 seconds)\n", + "Cbc0010I After 15519000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1206.93 seconds)\n", + "Cbc0010I After 15520000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1207.01 seconds)\n", + "Cbc0010I After 15521000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1207.08 seconds)\n", + "Cbc0010I After 15522000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1207.15 seconds)\n", + "Cbc0010I After 15523000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1207.21 seconds)\n", + "Cbc0010I After 15524000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1207.28 seconds)\n", + "Cbc0010I After 15525000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1207.35 seconds)\n", + "Cbc0010I After 15526000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1207.43 seconds)\n", + "Cbc0010I After 15527000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1207.50 seconds)\n", + "Cbc0010I After 15528000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1207.58 seconds)\n", + "Cbc0010I After 15529000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1207.64 seconds)\n", + "Cbc0010I After 15530000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1207.72 seconds)\n", + "Cbc0010I After 15531000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1207.78 seconds)\n", + "Cbc0010I After 15532000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1207.84 seconds)\n", + "Cbc0010I After 15533000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1207.91 seconds)\n", + "Cbc0010I After 15534000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1207.98 seconds)\n", + "Cbc0010I After 15535000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1208.06 seconds)\n", + "Cbc0010I After 15536000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1208.12 seconds)\n", + "Cbc0010I After 15537000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1208.18 seconds)\n", + "Cbc0010I After 15538000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1208.25 seconds)\n", + "Cbc0010I After 15539000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1208.32 seconds)\n", + "Cbc0010I After 15540000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1208.38 seconds)\n", + "Cbc0010I After 15541000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1208.45 seconds)\n", + "Cbc0010I After 15542000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1208.51 seconds)\n", + "Cbc0010I After 15543000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1208.59 seconds)\n", + "Cbc0010I After 15544000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1208.64 seconds)\n", + "Cbc0010I After 15545000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1208.69 seconds)\n", + "Cbc0010I After 15546000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1208.75 seconds)\n", + "Cbc0010I After 15547000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1208.86 seconds)\n", + "Cbc0010I After 15548000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1209.00 seconds)\n", + "Cbc0010I After 15549000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1209.08 seconds)\n", + "Cbc0010I After 15550000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1209.15 seconds)\n", + "Cbc0010I After 15551000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1209.28 seconds)\n", + "Cbc0010I After 15552000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1209.37 seconds)\n", + "Cbc0010I After 15553000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1209.45 seconds)\n", + "Cbc0010I After 15554000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1209.51 seconds)\n", + "Cbc0010I After 15555000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1209.58 seconds)\n", + "Cbc0010I After 15556000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1209.66 seconds)\n", + "Cbc0010I After 15557000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1209.74 seconds)\n", + "Cbc0010I After 15558000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1209.81 seconds)\n", + "Cbc0010I After 15559000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1209.89 seconds)\n", + "Cbc0010I After 15560000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1209.95 seconds)\n", + "Cbc0010I After 15561000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1210.01 seconds)\n", + "Cbc0010I After 15562000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1210.07 seconds)\n", + "Cbc0010I After 15563000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1210.13 seconds)\n", + "Cbc0010I After 15564000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1210.18 seconds)\n", + "Cbc0010I After 15565000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1210.25 seconds)\n", + "Cbc0010I After 15566000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1210.32 seconds)\n", + "Cbc0010I After 15567000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1210.40 seconds)\n", + "Cbc0010I After 15568000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1210.47 seconds)\n", + "Cbc0010I After 15569000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1210.52 seconds)\n", + "Cbc0010I After 15570000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1210.59 seconds)\n", + "Cbc0010I After 15571000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1210.65 seconds)\n", + "Cbc0010I After 15572000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1210.72 seconds)\n", + "Cbc0010I After 15573000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1210.78 seconds)\n", + "Cbc0010I After 15574000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1210.84 seconds)\n", + "Cbc0010I After 15575000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1210.90 seconds)\n", + "Cbc0010I After 15576000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1210.95 seconds)\n", + "Cbc0010I After 15577000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1211.03 seconds)\n", + "Cbc0010I After 15578000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1211.08 seconds)\n", + "Cbc0010I After 15579000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1211.13 seconds)\n", + "Cbc0010I After 15580000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1211.19 seconds)\n", + "Cbc0010I After 15581000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.24 seconds)\n", + "Cbc0010I After 15582000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1211.30 seconds)\n", + "Cbc0010I After 15583000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1211.35 seconds)\n", + "Cbc0010I After 15584000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1211.41 seconds)\n", + "Cbc0010I After 15585000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1211.47 seconds)\n", + "Cbc0010I After 15586000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1211.53 seconds)\n", + "Cbc0010I After 15587000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1211.59 seconds)\n", + "Cbc0010I After 15588000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.65 seconds)\n", + "Cbc0010I After 15589000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1211.71 seconds)\n", + "Cbc0010I After 15590000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1211.77 seconds)\n", + "Cbc0010I After 15591000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.83 seconds)\n", + "Cbc0010I After 15592000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1211.90 seconds)\n", + "Cbc0010I After 15593000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1211.96 seconds)\n", + "Cbc0010I After 15594000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1212.02 seconds)\n", + "Cbc0010I After 15595000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1212.08 seconds)\n", + "Cbc0010I After 15596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1212.15 seconds)\n", + "Cbc0010I After 15597000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1212.21 seconds)\n", + "Cbc0010I After 15598000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1212.28 seconds)\n", + "Cbc0010I After 15599000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1212.34 seconds)\n", + "Cbc0010I After 15600000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1212.41 seconds)\n", + "Cbc0010I After 15601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1212.48 seconds)\n", + "Cbc0010I After 15602000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1212.54 seconds)\n", + "Cbc0010I After 15603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1212.59 seconds)\n", + "Cbc0010I After 15604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1212.65 seconds)\n", + "Cbc0010I After 15605000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1212.70 seconds)\n", + "Cbc0010I After 15606000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1212.78 seconds)\n", + "Cbc0010I After 15607000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1212.85 seconds)\n", + "Cbc0010I After 15608000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1212.91 seconds)\n", + "Cbc0010I After 15609000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1212.99 seconds)\n", + "Cbc0010I After 15610000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1213.07 seconds)\n", + "Cbc0010I After 15611000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1213.15 seconds)\n", + "Cbc0010I After 15612000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1213.22 seconds)\n", + "Cbc0010I After 15613000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1213.28 seconds)\n", + "Cbc0010I After 15614000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1213.35 seconds)\n", + "Cbc0010I After 15615000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1213.42 seconds)\n", + "Cbc0010I After 15616000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1213.48 seconds)\n", + "Cbc0010I After 15617000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1213.56 seconds)\n", + "Cbc0010I After 15618000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1213.65 seconds)\n", + "Cbc0010I After 15619000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1213.71 seconds)\n", + "Cbc0010I After 15620000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1213.77 seconds)\n", + "Cbc0010I After 15621000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1213.82 seconds)\n", + "Cbc0010I After 15622000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1213.87 seconds)\n", + "Cbc0010I After 15623000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1213.92 seconds)\n", + "Cbc0010I After 15624000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1213.98 seconds)\n", + "Cbc0010I After 15625000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1214.04 seconds)\n", + "Cbc0010I After 15626000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1214.09 seconds)\n", + "Cbc0010I After 15627000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1214.16 seconds)\n", + "Cbc0010I After 15628000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1214.22 seconds)\n", + "Cbc0010I After 15629000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1214.29 seconds)\n", + "Cbc0010I After 15630000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1214.35 seconds)\n", + "Cbc0010I After 15631000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1214.42 seconds)\n", + "Cbc0010I After 15632000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1214.49 seconds)\n", + "Cbc0010I After 15633000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1214.56 seconds)\n", + "Cbc0010I After 15634000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1214.62 seconds)\n", + "Cbc0010I After 15635000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1214.69 seconds)\n", + "Cbc0010I After 15636000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1214.77 seconds)\n", + "Cbc0010I After 15637000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1214.86 seconds)\n", + "Cbc0010I After 15638000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1214.95 seconds)\n", + "Cbc0010I After 15639000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1215.03 seconds)\n", + "Cbc0010I After 15640000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1215.10 seconds)\n", + "Cbc0010I After 15641000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1215.16 seconds)\n", + "Cbc0010I After 15642000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1215.22 seconds)\n", + "Cbc0010I After 15643000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1215.28 seconds)\n", + "Cbc0010I After 15644000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1215.35 seconds)\n", + "Cbc0010I After 15645000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1215.41 seconds)\n", + "Cbc0010I After 15646000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1215.49 seconds)\n", + "Cbc0010I After 15647000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1215.55 seconds)\n", + "Cbc0010I After 15648000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1215.62 seconds)\n", + "Cbc0010I After 15649000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1215.68 seconds)\n", + "Cbc0010I After 15650000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1215.74 seconds)\n", + "Cbc0010I After 15651000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1215.82 seconds)\n", + "Cbc0010I After 15652000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1215.90 seconds)\n", + "Cbc0010I After 15653000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1215.98 seconds)\n", + "Cbc0010I After 15654000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1216.07 seconds)\n", + "Cbc0010I After 15655000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1216.13 seconds)\n", + "Cbc0010I After 15656000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1216.21 seconds)\n", + "Cbc0010I After 15657000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1216.30 seconds)\n", + "Cbc0010I After 15658000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1216.37 seconds)\n", + "Cbc0010I After 15659000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1216.44 seconds)\n", + "Cbc0010I After 15660000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1216.51 seconds)\n", + "Cbc0010I After 15661000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1216.58 seconds)\n", + "Cbc0010I After 15662000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1216.65 seconds)\n", + "Cbc0010I After 15663000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1216.72 seconds)\n", + "Cbc0010I After 15664000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1216.79 seconds)\n", + "Cbc0010I After 15665000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1216.86 seconds)\n", + "Cbc0010I After 15666000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1216.92 seconds)\n", + "Cbc0010I After 15667000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1216.98 seconds)\n", + "Cbc0010I After 15668000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1217.05 seconds)\n", + "Cbc0010I After 15669000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1217.12 seconds)\n", + "Cbc0010I After 15670000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1217.18 seconds)\n", + "Cbc0010I After 15671000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1217.26 seconds)\n", + "Cbc0010I After 15672000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1217.33 seconds)\n", + "Cbc0010I After 15673000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1217.39 seconds)\n", + "Cbc0010I After 15674000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1217.46 seconds)\n", + "Cbc0010I After 15675000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1217.54 seconds)\n", + "Cbc0010I After 15676000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1217.59 seconds)\n", + "Cbc0010I After 15677000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1217.66 seconds)\n", + "Cbc0010I After 15678000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1217.74 seconds)\n", + "Cbc0010I After 15679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1217.80 seconds)\n", + "Cbc0010I After 15680000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1217.86 seconds)\n", + "Cbc0010I After 15681000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1217.92 seconds)\n", + "Cbc0010I After 15682000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1217.97 seconds)\n", + "Cbc0010I After 15683000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1218.03 seconds)\n", + "Cbc0010I After 15684000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1218.08 seconds)\n", + "Cbc0010I After 15685000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1218.14 seconds)\n", + "Cbc0010I After 15686000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1218.22 seconds)\n", + "Cbc0010I After 15687000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1218.28 seconds)\n", + "Cbc0010I After 15688000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1218.33 seconds)\n", + "Cbc0010I After 15689000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1218.40 seconds)\n", + "Cbc0010I After 15690000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1218.46 seconds)\n", + "Cbc0010I After 15691000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1218.52 seconds)\n", + "Cbc0010I After 15692000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1218.57 seconds)\n", + "Cbc0010I After 15693000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1218.64 seconds)\n", + "Cbc0010I After 15694000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1218.71 seconds)\n", + "Cbc0010I After 15695000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1218.77 seconds)\n", + "Cbc0010I After 15696000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1218.85 seconds)\n", + "Cbc0010I After 15697000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1218.92 seconds)\n", + "Cbc0010I After 15698000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1218.99 seconds)\n", + "Cbc0010I After 15699000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1219.05 seconds)\n", + "Cbc0010I After 15700000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1219.11 seconds)\n", + "Cbc0010I After 15701000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1219.17 seconds)\n", + "Cbc0010I After 15702000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1219.26 seconds)\n", + "Cbc0010I After 15703000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1219.32 seconds)\n", + "Cbc0010I After 15704000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1219.39 seconds)\n", + "Cbc0010I After 15705000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1219.45 seconds)\n", + "Cbc0010I After 15706000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1219.51 seconds)\n", + "Cbc0010I After 15707000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1219.58 seconds)\n", + "Cbc0010I After 15708000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1219.64 seconds)\n", + "Cbc0010I After 15709000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1219.70 seconds)\n", + "Cbc0010I After 15710000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1219.76 seconds)\n", + "Cbc0010I After 15711000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1219.82 seconds)\n", + "Cbc0010I After 15712000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1219.88 seconds)\n", + "Cbc0010I After 15713000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1219.94 seconds)\n", + "Cbc0010I After 15714000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1220.00 seconds)\n", + "Cbc0010I After 15715000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1220.07 seconds)\n", + "Cbc0010I After 15716000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1220.13 seconds)\n", + "Cbc0010I After 15717000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1220.19 seconds)\n", + "Cbc0010I After 15718000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1220.25 seconds)\n", + "Cbc0010I After 15719000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1220.30 seconds)\n", + "Cbc0010I After 15720000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1220.35 seconds)\n", + "Cbc0010I After 15721000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1220.42 seconds)\n", + "Cbc0010I After 15722000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1220.47 seconds)\n", + "Cbc0010I After 15723000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1220.53 seconds)\n", + "Cbc0010I After 15724000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1220.58 seconds)\n", + "Cbc0010I After 15725000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1220.63 seconds)\n", + "Cbc0010I After 15726000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1220.69 seconds)\n", + "Cbc0010I After 15727000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1220.74 seconds)\n", + "Cbc0010I After 15728000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1220.81 seconds)\n", + "Cbc0010I After 15729000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1220.89 seconds)\n", + "Cbc0010I After 15730000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1220.95 seconds)\n", + "Cbc0010I After 15731000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1221.01 seconds)\n", + "Cbc0010I After 15732000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1221.07 seconds)\n", + "Cbc0010I After 15733000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1221.14 seconds)\n", + "Cbc0010I After 15734000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1221.20 seconds)\n", + "Cbc0010I After 15735000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1221.28 seconds)\n", + "Cbc0010I After 15736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1221.34 seconds)\n", + "Cbc0010I After 15737000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1221.40 seconds)\n", + "Cbc0010I After 15738000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1221.47 seconds)\n", + "Cbc0010I After 15739000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1221.54 seconds)\n", + "Cbc0010I After 15740000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1221.61 seconds)\n", + "Cbc0010I After 15741000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1221.67 seconds)\n", + "Cbc0010I After 15742000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1221.72 seconds)\n", + "Cbc0010I After 15743000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1221.77 seconds)\n", + "Cbc0010I After 15744000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1221.83 seconds)\n", + "Cbc0010I After 15745000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1221.88 seconds)\n", + "Cbc0010I After 15746000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1221.94 seconds)\n", + "Cbc0010I After 15747000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1222.01 seconds)\n", + "Cbc0010I After 15748000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1222.06 seconds)\n", + "Cbc0010I After 15749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1222.12 seconds)\n", + "Cbc0010I After 15750000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1222.18 seconds)\n", + "Cbc0010I After 15751000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1222.24 seconds)\n", + "Cbc0010I After 15752000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1222.29 seconds)\n", + "Cbc0010I After 15753000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1222.35 seconds)\n", + "Cbc0010I After 15754000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1222.40 seconds)\n", + "Cbc0010I After 15755000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1222.46 seconds)\n", + "Cbc0010I After 15756000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1222.52 seconds)\n", + "Cbc0010I After 15757000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1222.58 seconds)\n", + "Cbc0010I After 15758000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1222.64 seconds)\n", + "Cbc0010I After 15759000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1222.71 seconds)\n", + "Cbc0010I After 15760000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1222.78 seconds)\n", + "Cbc0010I After 15761000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1222.85 seconds)\n", + "Cbc0010I After 15762000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1222.91 seconds)\n", + "Cbc0010I After 15763000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1222.98 seconds)\n", + "Cbc0010I After 15764000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1223.04 seconds)\n", + "Cbc0010I After 15765000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1223.11 seconds)\n", + "Cbc0010I After 15766000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1223.17 seconds)\n", + "Cbc0010I After 15767000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1223.24 seconds)\n", + "Cbc0010I After 15768000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1223.30 seconds)\n", + "Cbc0010I After 15769000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1223.37 seconds)\n", + "Cbc0010I After 15770000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1223.43 seconds)\n", + "Cbc0010I After 15771000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1223.51 seconds)\n", + "Cbc0010I After 15772000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1223.58 seconds)\n", + "Cbc0010I After 15773000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1223.64 seconds)\n", + "Cbc0010I After 15774000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1223.70 seconds)\n", + "Cbc0010I After 15775000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1223.78 seconds)\n", + "Cbc0010I After 15776000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1223.86 seconds)\n", + "Cbc0010I After 15777000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1223.93 seconds)\n", + "Cbc0010I After 15778000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1223.99 seconds)\n", + "Cbc0010I After 15779000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1224.07 seconds)\n", + "Cbc0010I After 15780000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1224.13 seconds)\n", + "Cbc0010I After 15781000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1224.19 seconds)\n", + "Cbc0010I After 15782000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1224.26 seconds)\n", + "Cbc0010I After 15783000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1224.32 seconds)\n", + "Cbc0010I After 15784000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1224.39 seconds)\n", + "Cbc0010I After 15785000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1224.46 seconds)\n", + "Cbc0010I After 15786000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1224.52 seconds)\n", + "Cbc0010I After 15787000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1224.58 seconds)\n", + "Cbc0010I After 15788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1224.64 seconds)\n", + "Cbc0010I After 15789000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1224.72 seconds)\n", + "Cbc0010I After 15790000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1224.79 seconds)\n", + "Cbc0010I After 15791000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1224.86 seconds)\n", + "Cbc0010I After 15792000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1224.92 seconds)\n", + "Cbc0010I After 15793000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1224.98 seconds)\n", + "Cbc0010I After 15794000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1225.05 seconds)\n", + "Cbc0010I After 15795000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1225.12 seconds)\n", + "Cbc0010I After 15796000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1225.19 seconds)\n", + "Cbc0010I After 15797000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1225.26 seconds)\n", + "Cbc0010I After 15798000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1225.33 seconds)\n", + "Cbc0010I After 15799000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1225.40 seconds)\n", + "Cbc0010I After 15800000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1225.47 seconds)\n", + "Cbc0010I After 15801000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1225.55 seconds)\n", + "Cbc0010I After 15802000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1225.61 seconds)\n", + "Cbc0010I After 15803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1225.67 seconds)\n", + "Cbc0010I After 15804000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1225.75 seconds)\n", + "Cbc0010I After 15805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1225.82 seconds)\n", + "Cbc0010I After 15806000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1225.89 seconds)\n", + "Cbc0010I After 15807000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1225.95 seconds)\n", + "Cbc0010I After 15808000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1226.02 seconds)\n", + "Cbc0010I After 15809000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1226.08 seconds)\n", + "Cbc0010I After 15810000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1226.14 seconds)\n", + "Cbc0010I After 15811000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1226.20 seconds)\n", + "Cbc0010I After 15812000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1226.26 seconds)\n", + "Cbc0010I After 15813000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1226.34 seconds)\n", + "Cbc0010I After 15814000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1226.40 seconds)\n", + "Cbc0010I After 15815000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1226.48 seconds)\n", + "Cbc0010I After 15816000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1226.53 seconds)\n", + "Cbc0010I After 15817000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1226.58 seconds)\n", + "Cbc0010I After 15818000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1226.66 seconds)\n", + "Cbc0010I After 15819000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1226.76 seconds)\n", + "Cbc0010I After 15820000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1226.85 seconds)\n", + "Cbc0010I After 15821000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1226.91 seconds)\n", + "Cbc0010I After 15822000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1226.98 seconds)\n", + "Cbc0010I After 15823000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1227.03 seconds)\n", + "Cbc0010I After 15824000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1227.12 seconds)\n", + "Cbc0010I After 15825000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1227.19 seconds)\n", + "Cbc0010I After 15826000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1227.26 seconds)\n", + "Cbc0010I After 15827000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1227.33 seconds)\n", + "Cbc0010I After 15828000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1227.38 seconds)\n", + "Cbc0010I After 15829000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1227.44 seconds)\n", + "Cbc0010I After 15830000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1227.49 seconds)\n", + "Cbc0010I After 15831000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1227.55 seconds)\n", + "Cbc0010I After 15832000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1227.60 seconds)\n", + "Cbc0010I After 15833000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1227.66 seconds)\n", + "Cbc0010I After 15834000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1227.71 seconds)\n", + "Cbc0010I After 15835000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1227.76 seconds)\n", + "Cbc0010I After 15836000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1227.81 seconds)\n", + "Cbc0010I After 15837000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1227.87 seconds)\n", + "Cbc0010I After 15838000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1227.93 seconds)\n", + "Cbc0010I After 15839000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1227.98 seconds)\n", + "Cbc0010I After 15840000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1228.04 seconds)\n", + "Cbc0010I After 15841000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1228.10 seconds)\n", + "Cbc0010I After 15842000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1228.15 seconds)\n", + "Cbc0010I After 15843000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1228.22 seconds)\n", + "Cbc0010I After 15844000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1228.27 seconds)\n", + "Cbc0010I After 15845000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1228.33 seconds)\n", + "Cbc0010I After 15846000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1228.38 seconds)\n", + "Cbc0010I After 15847000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1228.43 seconds)\n", + "Cbc0010I After 15848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1228.48 seconds)\n", + "Cbc0010I After 15849000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1228.54 seconds)\n", + "Cbc0010I After 15850000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1228.59 seconds)\n", + "Cbc0010I After 15851000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1228.64 seconds)\n", + "Cbc0010I After 15852000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1228.70 seconds)\n", + "Cbc0010I After 15853000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1228.75 seconds)\n", + "Cbc0010I After 15854000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1228.81 seconds)\n", + "Cbc0010I After 15855000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1228.87 seconds)\n", + "Cbc0010I After 15856000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1228.92 seconds)\n", + "Cbc0010I After 15857000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1228.98 seconds)\n", + "Cbc0010I After 15858000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1229.05 seconds)\n", + "Cbc0010I After 15859000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1229.10 seconds)\n", + "Cbc0010I After 15860000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1229.16 seconds)\n", + "Cbc0010I After 15861000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1229.22 seconds)\n", + "Cbc0010I After 15862000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1229.29 seconds)\n", + "Cbc0010I After 15863000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1229.37 seconds)\n", + "Cbc0010I After 15864000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1229.44 seconds)\n", + "Cbc0010I After 15865000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1229.51 seconds)\n", + "Cbc0010I After 15866000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1229.57 seconds)\n", + "Cbc0010I After 15867000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1229.64 seconds)\n", + "Cbc0010I After 15868000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1229.72 seconds)\n", + "Cbc0010I After 15869000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1229.79 seconds)\n", + "Cbc0010I After 15870000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1229.86 seconds)\n", + "Cbc0010I After 15871000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1229.92 seconds)\n", + "Cbc0010I After 15872000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1229.98 seconds)\n", + "Cbc0010I After 15873000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1230.05 seconds)\n", + "Cbc0010I After 15874000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1230.11 seconds)\n", + "Cbc0010I After 15875000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1230.17 seconds)\n", + "Cbc0010I After 15876000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1230.23 seconds)\n", + "Cbc0010I After 15877000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1230.29 seconds)\n", + "Cbc0010I After 15878000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1230.35 seconds)\n", + "Cbc0010I After 15879000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1230.41 seconds)\n", + "Cbc0010I After 15880000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1230.47 seconds)\n", + "Cbc0010I After 15881000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1230.53 seconds)\n", + "Cbc0010I After 15882000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1230.59 seconds)\n", + "Cbc0010I After 15883000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1230.65 seconds)\n", + "Cbc0010I After 15884000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1230.72 seconds)\n", + "Cbc0010I After 15885000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1230.78 seconds)\n", + "Cbc0010I After 15886000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1230.83 seconds)\n", + "Cbc0010I After 15887000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1230.88 seconds)\n", + "Cbc0010I After 15888000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1230.93 seconds)\n", + "Cbc0010I After 15889000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1230.99 seconds)\n", + "Cbc0010I After 15890000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1231.05 seconds)\n", + "Cbc0010I After 15891000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1231.11 seconds)\n", + "Cbc0010I After 15892000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.17 seconds)\n", + "Cbc0010I After 15893000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1231.23 seconds)\n", + "Cbc0010I After 15894000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.29 seconds)\n", + "Cbc0010I After 15895000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.36 seconds)\n", + "Cbc0010I After 15896000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1231.42 seconds)\n", + "Cbc0010I After 15897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1231.48 seconds)\n", + "Cbc0010I After 15898000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1231.57 seconds)\n", + "Cbc0010I After 15899000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.64 seconds)\n", + "Cbc0010I After 15900000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1231.72 seconds)\n", + "Cbc0010I After 15901000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.81 seconds)\n", + "Cbc0010I After 15902000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1231.88 seconds)\n", + "Cbc0010I After 15903000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.95 seconds)\n", + "Cbc0010I After 15904000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1232.02 seconds)\n", + "Cbc0010I After 15905000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1232.08 seconds)\n", + "Cbc0010I After 15906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1232.13 seconds)\n", + "Cbc0010I After 15907000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1232.20 seconds)\n", + "Cbc0010I After 15908000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1232.26 seconds)\n", + "Cbc0010I After 15909000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1232.33 seconds)\n", + "Cbc0010I After 15910000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1232.39 seconds)\n", + "Cbc0010I After 15911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1232.46 seconds)\n", + "Cbc0010I After 15912000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1232.52 seconds)\n", + "Cbc0010I After 15913000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1232.59 seconds)\n", + "Cbc0010I After 15914000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1232.65 seconds)\n", + "Cbc0010I After 15915000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1232.72 seconds)\n", + "Cbc0010I After 15916000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1232.79 seconds)\n", + "Cbc0010I After 15917000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1232.85 seconds)\n", + "Cbc0010I After 15918000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1232.91 seconds)\n", + "Cbc0010I After 15919000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1232.96 seconds)\n", + "Cbc0010I After 15920000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1233.01 seconds)\n", + "Cbc0010I After 15921000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1233.08 seconds)\n", + "Cbc0010I After 15922000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.15 seconds)\n", + "Cbc0010I After 15923000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1233.22 seconds)\n", + "Cbc0010I After 15924000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1233.28 seconds)\n", + "Cbc0010I After 15925000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1233.34 seconds)\n", + "Cbc0010I After 15926000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.41 seconds)\n", + "Cbc0010I After 15927000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1233.48 seconds)\n", + "Cbc0010I After 15928000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1233.55 seconds)\n", + "Cbc0010I After 15929000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1233.62 seconds)\n", + "Cbc0010I After 15930000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.69 seconds)\n", + "Cbc0010I After 15931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1233.76 seconds)\n", + "Cbc0010I After 15932000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1233.83 seconds)\n", + "Cbc0010I After 15933000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1233.90 seconds)\n", + "Cbc0010I After 15934000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1233.97 seconds)\n", + "Cbc0010I After 15935000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1234.03 seconds)\n", + "Cbc0010I After 15936000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1234.08 seconds)\n", + "Cbc0010I After 15937000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1234.12 seconds)\n", + "Cbc0010I After 15938000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1234.17 seconds)\n", + "Cbc0010I After 15939000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1234.22 seconds)\n", + "Cbc0010I After 15940000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1234.29 seconds)\n", + "Cbc0010I After 15941000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1234.36 seconds)\n", + "Cbc0010I After 15942000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1234.44 seconds)\n", + "Cbc0010I After 15943000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1234.51 seconds)\n", + "Cbc0010I After 15944000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1234.57 seconds)\n", + "Cbc0010I After 15945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1234.64 seconds)\n", + "Cbc0010I After 15946000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1234.71 seconds)\n", + "Cbc0010I After 15947000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1234.77 seconds)\n", + "Cbc0010I After 15948000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1234.83 seconds)\n", + "Cbc0010I After 15949000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1234.89 seconds)\n", + "Cbc0010I After 15950000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1234.96 seconds)\n", + "Cbc0010I After 15951000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1235.02 seconds)\n", + "Cbc0010I After 15952000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1235.09 seconds)\n", + "Cbc0010I After 15953000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1235.15 seconds)\n", + "Cbc0010I After 15954000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1235.23 seconds)\n", + "Cbc0010I After 15955000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1235.31 seconds)\n", + "Cbc0010I After 15956000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1235.37 seconds)\n", + "Cbc0010I After 15957000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1235.44 seconds)\n", + "Cbc0010I After 15958000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1235.50 seconds)\n", + "Cbc0010I After 15959000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1235.55 seconds)\n", + "Cbc0010I After 15960000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1235.61 seconds)\n", + "Cbc0010I After 15961000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1235.66 seconds)\n", + "Cbc0010I After 15962000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1235.71 seconds)\n", + "Cbc0010I After 15963000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1235.77 seconds)\n", + "Cbc0010I After 15964000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1235.82 seconds)\n", + "Cbc0010I After 15965000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1235.88 seconds)\n", + "Cbc0010I After 15966000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1235.93 seconds)\n", + "Cbc0010I After 15967000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1235.99 seconds)\n", + "Cbc0010I After 15968000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1236.04 seconds)\n", + "Cbc0010I After 15969000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1236.11 seconds)\n", + "Cbc0010I After 15970000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1236.17 seconds)\n", + "Cbc0010I After 15971000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1236.23 seconds)\n", + "Cbc0010I After 15972000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1236.29 seconds)\n", + "Cbc0010I After 15973000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1236.35 seconds)\n", + "Cbc0010I After 15974000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1236.40 seconds)\n", + "Cbc0010I After 15975000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1236.46 seconds)\n", + "Cbc0010I After 15976000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1236.52 seconds)\n", + "Cbc0010I After 15977000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1236.56 seconds)\n", + "Cbc0010I After 15978000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1236.62 seconds)\n", + "Cbc0010I After 15979000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1236.69 seconds)\n", + "Cbc0010I After 15980000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1236.75 seconds)\n", + "Cbc0010I After 15981000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1236.81 seconds)\n", + "Cbc0010I After 15982000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1236.87 seconds)\n", + "Cbc0010I After 15983000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1236.93 seconds)\n", + "Cbc0010I After 15984000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1236.99 seconds)\n", + "Cbc0010I After 15985000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1237.06 seconds)\n", + "Cbc0010I After 15986000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1237.12 seconds)\n", + "Cbc0010I After 15987000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1237.20 seconds)\n", + "Cbc0010I After 15988000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1237.27 seconds)\n", + "Cbc0010I After 15989000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1237.33 seconds)\n", + "Cbc0010I After 15990000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1237.38 seconds)\n", + "Cbc0010I After 15991000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1237.43 seconds)\n", + "Cbc0010I After 15992000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1237.49 seconds)\n", + "Cbc0010I After 15993000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1237.54 seconds)\n", + "Cbc0010I After 15994000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1237.60 seconds)\n", + "Cbc0010I After 15995000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1237.66 seconds)\n", + "Cbc0010I After 15996000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1237.73 seconds)\n", + "Cbc0010I After 15997000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1237.80 seconds)\n", + "Cbc0010I After 15998000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1237.87 seconds)\n", + "Cbc0010I After 15999000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1237.92 seconds)\n", + "Cbc0010I After 16000000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1237.99 seconds)\n", + "Cbc0010I After 16001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1238.04 seconds)\n", + "Cbc0010I After 16002000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1238.11 seconds)\n", + "Cbc0010I After 16003000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1238.17 seconds)\n", + "Cbc0010I After 16004000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1238.22 seconds)\n", + "Cbc0010I After 16005000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1238.29 seconds)\n", + "Cbc0010I After 16006000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1238.35 seconds)\n", + "Cbc0010I After 16007000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1238.40 seconds)\n", + "Cbc0010I After 16008000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1238.45 seconds)\n", + "Cbc0010I After 16009000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1238.51 seconds)\n", + "Cbc0010I After 16010000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1238.56 seconds)\n", + "Cbc0010I After 16011000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1238.62 seconds)\n", + "Cbc0010I After 16012000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1238.68 seconds)\n", + "Cbc0010I After 16013000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1238.75 seconds)\n", + "Cbc0010I After 16014000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1238.80 seconds)\n", + "Cbc0010I After 16015000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1238.85 seconds)\n", + "Cbc0010I After 16016000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1238.90 seconds)\n", + "Cbc0010I After 16017000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1238.96 seconds)\n", + "Cbc0010I After 16018000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1239.02 seconds)\n", + "Cbc0010I After 16019000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1239.08 seconds)\n", + "Cbc0010I After 16020000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1239.13 seconds)\n", + "Cbc0010I After 16021000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1239.19 seconds)\n", + "Cbc0010I After 16022000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.25 seconds)\n", + "Cbc0010I After 16023000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1239.31 seconds)\n", + "Cbc0010I After 16024000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1239.39 seconds)\n", + "Cbc0010I After 16025000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1239.46 seconds)\n", + "Cbc0010I After 16026000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1239.52 seconds)\n", + "Cbc0010I After 16027000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1239.59 seconds)\n", + "Cbc0010I After 16028000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1239.66 seconds)\n", + "Cbc0010I After 16029000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.72 seconds)\n", + "Cbc0010I After 16030000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.79 seconds)\n", + "Cbc0010I After 16031000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1239.85 seconds)\n", + "Cbc0010I After 16032000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1239.91 seconds)\n", + "Cbc0010I After 16033000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1239.98 seconds)\n", + "Cbc0010I After 16034000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1240.05 seconds)\n", + "Cbc0010I After 16035000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1240.11 seconds)\n", + "Cbc0010I After 16036000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1240.17 seconds)\n", + "Cbc0010I After 16037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1240.22 seconds)\n", + "Cbc0010I After 16038000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1240.28 seconds)\n", + "Cbc0010I After 16039000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1240.35 seconds)\n", + "Cbc0010I After 16040000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1240.40 seconds)\n", + "Cbc0010I After 16041000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1240.46 seconds)\n", + "Cbc0010I After 16042000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1240.54 seconds)\n", + "Cbc0010I After 16043000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1240.60 seconds)\n", + "Cbc0010I After 16044000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1240.69 seconds)\n", + "Cbc0010I After 16045000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1240.76 seconds)\n", + "Cbc0010I After 16046000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1240.83 seconds)\n", + "Cbc0010I After 16047000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1240.89 seconds)\n", + "Cbc0010I After 16048000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1240.95 seconds)\n", + "Cbc0010I After 16049000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1241.01 seconds)\n", + "Cbc0010I After 16050000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1241.09 seconds)\n", + "Cbc0010I After 16051000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1241.15 seconds)\n", + "Cbc0010I After 16052000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1241.21 seconds)\n", + "Cbc0010I After 16053000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1241.28 seconds)\n", + "Cbc0010I After 16054000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1241.34 seconds)\n", + "Cbc0010I After 16055000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1241.42 seconds)\n", + "Cbc0010I After 16056000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1241.50 seconds)\n", + "Cbc0010I After 16057000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1241.56 seconds)\n", + "Cbc0010I After 16058000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1241.62 seconds)\n", + "Cbc0010I After 16059000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1241.68 seconds)\n", + "Cbc0010I After 16060000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1241.74 seconds)\n", + "Cbc0010I After 16061000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1241.82 seconds)\n", + "Cbc0010I After 16062000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1241.88 seconds)\n", + "Cbc0010I After 16063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1241.96 seconds)\n", + "Cbc0010I After 16064000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1242.02 seconds)\n", + "Cbc0010I After 16065000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1242.09 seconds)\n", + "Cbc0010I After 16066000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1242.16 seconds)\n", + "Cbc0010I After 16067000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1242.22 seconds)\n", + "Cbc0010I After 16068000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1242.31 seconds)\n", + "Cbc0010I After 16069000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1242.40 seconds)\n", + "Cbc0010I After 16070000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1242.47 seconds)\n", + "Cbc0010I After 16071000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1242.52 seconds)\n", + "Cbc0010I After 16072000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1242.57 seconds)\n", + "Cbc0010I After 16073000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1242.61 seconds)\n", + "Cbc0010I After 16074000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1242.69 seconds)\n", + "Cbc0010I After 16075000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1242.77 seconds)\n", + "Cbc0010I After 16076000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1242.84 seconds)\n", + "Cbc0010I After 16077000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1242.91 seconds)\n", + "Cbc0010I After 16078000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1242.98 seconds)\n", + "Cbc0010I After 16079000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1243.04 seconds)\n", + "Cbc0010I After 16080000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1243.11 seconds)\n", + "Cbc0010I After 16081000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1243.18 seconds)\n", + "Cbc0010I After 16082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1243.25 seconds)\n", + "Cbc0010I After 16083000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1243.32 seconds)\n", + "Cbc0010I After 16084000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1243.39 seconds)\n", + "Cbc0010I After 16085000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1243.47 seconds)\n", + "Cbc0010I After 16086000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1243.54 seconds)\n", + "Cbc0010I After 16087000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1243.62 seconds)\n", + "Cbc0010I After 16088000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1243.69 seconds)\n", + "Cbc0010I After 16089000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1243.76 seconds)\n", + "Cbc0010I After 16090000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1243.84 seconds)\n", + "Cbc0010I After 16091000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1243.92 seconds)\n", + "Cbc0010I After 16092000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1243.98 seconds)\n", + "Cbc0010I After 16093000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1244.05 seconds)\n", + "Cbc0010I After 16094000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1244.12 seconds)\n", + "Cbc0010I After 16095000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1244.18 seconds)\n", + "Cbc0010I After 16096000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1244.24 seconds)\n", + "Cbc0010I After 16097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1244.30 seconds)\n", + "Cbc0010I After 16098000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1244.38 seconds)\n", + "Cbc0010I After 16099000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1244.46 seconds)\n", + "Cbc0010I After 16100000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1244.55 seconds)\n", + "Cbc0010I After 16101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1244.61 seconds)\n", + "Cbc0010I After 16102000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1244.67 seconds)\n", + "Cbc0010I After 16103000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1244.74 seconds)\n", + "Cbc0010I After 16104000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1244.80 seconds)\n", + "Cbc0010I After 16105000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1244.86 seconds)\n", + "Cbc0010I After 16106000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1244.92 seconds)\n", + "Cbc0010I After 16107000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1244.99 seconds)\n", + "Cbc0010I After 16108000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1245.05 seconds)\n", + "Cbc0010I After 16109000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1245.11 seconds)\n", + "Cbc0010I After 16110000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1245.18 seconds)\n", + "Cbc0010I After 16111000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1245.24 seconds)\n", + "Cbc0010I After 16112000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1245.30 seconds)\n", + "Cbc0010I After 16113000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1245.36 seconds)\n", + "Cbc0010I After 16114000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1245.42 seconds)\n", + "Cbc0010I After 16115000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1245.47 seconds)\n", + "Cbc0010I After 16116000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1245.53 seconds)\n", + "Cbc0010I After 16117000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1245.58 seconds)\n", + "Cbc0010I After 16118000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1245.65 seconds)\n", + "Cbc0010I After 16119000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1245.72 seconds)\n", + "Cbc0010I After 16120000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1245.79 seconds)\n", + "Cbc0010I After 16121000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1245.89 seconds)\n", + "Cbc0010I After 16122000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1245.96 seconds)\n", + "Cbc0010I After 16123000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1246.03 seconds)\n", + "Cbc0010I After 16124000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.10 seconds)\n", + "Cbc0010I After 16125000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1246.15 seconds)\n", + "Cbc0010I After 16126000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1246.21 seconds)\n", + "Cbc0010I After 16127000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1246.27 seconds)\n", + "Cbc0010I After 16128000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.32 seconds)\n", + "Cbc0010I After 16129000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1246.37 seconds)\n", + "Cbc0010I After 16130000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1246.43 seconds)\n", + "Cbc0010I After 16131000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.49 seconds)\n", + "Cbc0010I After 16132000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1246.54 seconds)\n", + "Cbc0010I After 16133000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1246.59 seconds)\n", + "Cbc0010I After 16134000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1246.65 seconds)\n", + "Cbc0010I After 16135000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1246.71 seconds)\n", + "Cbc0010I After 16136000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1246.76 seconds)\n", + "Cbc0010I After 16137000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1246.82 seconds)\n", + "Cbc0010I After 16138000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1246.89 seconds)\n", + "Cbc0010I After 16139000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1246.95 seconds)\n", + "Cbc0010I After 16140000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1247.01 seconds)\n", + "Cbc0010I After 16141000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1247.07 seconds)\n", + "Cbc0010I After 16142000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1247.14 seconds)\n", + "Cbc0010I After 16143000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1247.19 seconds)\n", + "Cbc0010I After 16144000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1247.25 seconds)\n", + "Cbc0010I After 16145000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1247.32 seconds)\n", + "Cbc0010I After 16146000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1247.38 seconds)\n", + "Cbc0010I After 16147000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1247.45 seconds)\n", + "Cbc0010I After 16148000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1247.53 seconds)\n", + "Cbc0010I After 16149000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1247.60 seconds)\n", + "Cbc0010I After 16150000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1247.65 seconds)\n", + "Cbc0010I After 16151000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1247.71 seconds)\n", + "Cbc0010I After 16152000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1247.77 seconds)\n", + "Cbc0010I After 16153000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1247.84 seconds)\n", + "Cbc0010I After 16154000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1247.92 seconds)\n", + "Cbc0010I After 16155000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1247.98 seconds)\n", + "Cbc0010I After 16156000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1248.05 seconds)\n", + "Cbc0010I After 16157000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1248.12 seconds)\n", + "Cbc0010I After 16158000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1248.17 seconds)\n", + "Cbc0010I After 16159000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.24 seconds)\n", + "Cbc0010I After 16160000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1248.31 seconds)\n", + "Cbc0010I After 16161000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1248.36 seconds)\n", + "Cbc0010I After 16162000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1248.43 seconds)\n", + "Cbc0010I After 16163000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1248.50 seconds)\n", + "Cbc0010I After 16164000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1248.56 seconds)\n", + "Cbc0010I After 16165000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1248.61 seconds)\n", + "Cbc0010I After 16166000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1248.65 seconds)\n", + "Cbc0010I After 16167000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1248.70 seconds)\n", + "Cbc0010I After 16168000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.75 seconds)\n", + "Cbc0010I After 16169000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1248.83 seconds)\n", + "Cbc0010I After 16170000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1248.89 seconds)\n", + "Cbc0010I After 16171000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.95 seconds)\n", + "Cbc0010I After 16172000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1249.02 seconds)\n", + "Cbc0010I After 16173000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1249.09 seconds)\n", + "Cbc0010I After 16174000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1249.16 seconds)\n", + "Cbc0010I After 16175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1249.23 seconds)\n", + "Cbc0010I After 16176000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1249.30 seconds)\n", + "Cbc0010I After 16177000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1249.38 seconds)\n", + "Cbc0010I After 16178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1249.46 seconds)\n", + "Cbc0010I After 16179000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1249.53 seconds)\n", + "Cbc0010I After 16180000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.60 seconds)\n", + "Cbc0010I After 16181000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1249.67 seconds)\n", + "Cbc0010I After 16182000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1249.73 seconds)\n", + "Cbc0010I After 16183000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1249.79 seconds)\n", + "Cbc0010I After 16184000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.86 seconds)\n", + "Cbc0010I After 16185000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.93 seconds)\n", + "Cbc0010I After 16186000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1249.99 seconds)\n", + "Cbc0010I After 16187000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1250.05 seconds)\n", + "Cbc0010I After 16188000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1250.12 seconds)\n", + "Cbc0010I After 16189000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.19 seconds)\n", + "Cbc0010I After 16190000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1250.27 seconds)\n", + "Cbc0010I After 16191000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1250.34 seconds)\n", + "Cbc0010I After 16192000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1250.42 seconds)\n", + "Cbc0010I After 16193000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1250.49 seconds)\n", + "Cbc0010I After 16194000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1250.56 seconds)\n", + "Cbc0010I After 16195000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1250.63 seconds)\n", + "Cbc0010I After 16196000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1250.68 seconds)\n", + "Cbc0010I After 16197000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1250.73 seconds)\n", + "Cbc0010I After 16198000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.79 seconds)\n", + "Cbc0010I After 16199000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1250.86 seconds)\n", + "Cbc0010I After 16200000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1250.92 seconds)\n", + "Cbc0010I After 16201000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.99 seconds)\n", + "Cbc0010I After 16202000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1251.05 seconds)\n", + "Cbc0010I After 16203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1251.12 seconds)\n", + "Cbc0010I After 16204000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1251.19 seconds)\n", + "Cbc0010I After 16205000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1251.27 seconds)\n", + "Cbc0010I After 16206000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1251.34 seconds)\n", + "Cbc0010I After 16207000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1251.41 seconds)\n", + "Cbc0010I After 16208000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1251.47 seconds)\n", + "Cbc0010I After 16209000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1251.52 seconds)\n", + "Cbc0010I After 16210000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1251.58 seconds)\n", + "Cbc0010I After 16211000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1251.63 seconds)\n", + "Cbc0010I After 16212000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1251.68 seconds)\n", + "Cbc0010I After 16213000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1251.75 seconds)\n", + "Cbc0010I After 16214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1251.82 seconds)\n", + "Cbc0010I After 16215000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1251.90 seconds)\n", + "Cbc0010I After 16216000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1251.96 seconds)\n", + "Cbc0010I After 16217000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1252.03 seconds)\n", + "Cbc0010I After 16218000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1252.10 seconds)\n", + "Cbc0010I After 16219000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1252.17 seconds)\n", + "Cbc0010I After 16220000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1252.23 seconds)\n", + "Cbc0010I After 16221000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1252.29 seconds)\n", + "Cbc0010I After 16222000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1252.36 seconds)\n", + "Cbc0010I After 16223000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1252.42 seconds)\n", + "Cbc0010I After 16224000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1252.49 seconds)\n", + "Cbc0010I After 16225000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1252.56 seconds)\n", + "Cbc0010I After 16226000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1252.64 seconds)\n", + "Cbc0010I After 16227000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1252.71 seconds)\n", + "Cbc0010I After 16228000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1252.78 seconds)\n", + "Cbc0010I After 16229000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1252.86 seconds)\n", + "Cbc0010I After 16230000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1252.94 seconds)\n", + "Cbc0010I After 16231000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1253.00 seconds)\n", + "Cbc0010I After 16232000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1253.06 seconds)\n", + "Cbc0010I After 16233000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1253.12 seconds)\n", + "Cbc0010I After 16234000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1253.19 seconds)\n", + "Cbc0010I After 16235000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1253.27 seconds)\n", + "Cbc0010I After 16236000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1253.34 seconds)\n", + "Cbc0010I After 16237000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1253.41 seconds)\n", + "Cbc0010I After 16238000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1253.48 seconds)\n", + "Cbc0010I After 16239000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1253.54 seconds)\n", + "Cbc0010I After 16240000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1253.60 seconds)\n", + "Cbc0010I After 16241000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1253.67 seconds)\n", + "Cbc0010I After 16242000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1253.73 seconds)\n", + "Cbc0010I After 16243000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1253.82 seconds)\n", + "Cbc0010I After 16244000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1253.94 seconds)\n", + "Cbc0010I After 16245000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1254.02 seconds)\n", + "Cbc0010I After 16246000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1254.10 seconds)\n", + "Cbc0010I After 16247000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1254.18 seconds)\n", + "Cbc0010I After 16248000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1254.26 seconds)\n", + "Cbc0010I After 16249000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1254.32 seconds)\n", + "Cbc0010I After 16250000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1254.39 seconds)\n", + "Cbc0010I After 16251000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1254.44 seconds)\n", + "Cbc0010I After 16252000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1254.50 seconds)\n", + "Cbc0010I After 16253000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1254.57 seconds)\n", + "Cbc0010I After 16254000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1254.65 seconds)\n", + "Cbc0010I After 16255000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1254.70 seconds)\n", + "Cbc0010I After 16256000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1254.77 seconds)\n", + "Cbc0010I After 16257000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1254.82 seconds)\n", + "Cbc0010I After 16258000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1254.88 seconds)\n", + "Cbc0010I After 16259000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1254.94 seconds)\n", + "Cbc0010I After 16260000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1254.99 seconds)\n", + "Cbc0010I After 16261000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1255.05 seconds)\n", + "Cbc0010I After 16262000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1255.11 seconds)\n", + "Cbc0010I After 16263000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.16 seconds)\n", + "Cbc0010I After 16264000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1255.23 seconds)\n", + "Cbc0010I After 16265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.28 seconds)\n", + "Cbc0010I After 16266000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1255.34 seconds)\n", + "Cbc0010I After 16267000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1255.39 seconds)\n", + "Cbc0010I After 16268000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1255.45 seconds)\n", + "Cbc0010I After 16269000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1255.52 seconds)\n", + "Cbc0010I After 16270000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.57 seconds)\n", + "Cbc0010I After 16271000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1255.63 seconds)\n", + "Cbc0010I After 16272000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1255.70 seconds)\n", + "Cbc0010I After 16273000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1255.76 seconds)\n", + "Cbc0010I After 16274000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1255.83 seconds)\n", + "Cbc0010I After 16275000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1255.90 seconds)\n", + "Cbc0010I After 16276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1255.96 seconds)\n", + "Cbc0010I After 16277000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1256.04 seconds)\n", + "Cbc0010I After 16278000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.11 seconds)\n", + "Cbc0010I After 16279000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1256.16 seconds)\n", + "Cbc0010I After 16280000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.23 seconds)\n", + "Cbc0010I After 16281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1256.29 seconds)\n", + "Cbc0010I After 16282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1256.37 seconds)\n", + "Cbc0010I After 16283000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1256.42 seconds)\n", + "Cbc0010I After 16284000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1256.46 seconds)\n", + "Cbc0010I After 16285000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1256.52 seconds)\n", + "Cbc0010I After 16286000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.59 seconds)\n", + "Cbc0010I After 16287000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1256.65 seconds)\n", + "Cbc0010I After 16288000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1256.72 seconds)\n", + "Cbc0010I After 16289000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1256.78 seconds)\n", + "Cbc0010I After 16290000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1256.84 seconds)\n", + "Cbc0010I After 16291000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1256.88 seconds)\n", + "Cbc0010I After 16292000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1256.94 seconds)\n", + "Cbc0010I After 16293000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1257.02 seconds)\n", + "Cbc0010I After 16294000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1257.08 seconds)\n", + "Cbc0010I After 16295000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1257.16 seconds)\n", + "Cbc0010I After 16296000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1257.22 seconds)\n", + "Cbc0010I After 16297000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1257.28 seconds)\n", + "Cbc0010I After 16298000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1257.35 seconds)\n", + "Cbc0010I After 16299000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1257.41 seconds)\n", + "Cbc0010I After 16300000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1257.48 seconds)\n", + "Cbc0010I After 16301000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1257.57 seconds)\n", + "Cbc0010I After 16302000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1257.66 seconds)\n", + "Cbc0010I After 16303000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1257.74 seconds)\n", + "Cbc0010I After 16304000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1257.81 seconds)\n", + "Cbc0010I After 16305000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1257.87 seconds)\n", + "Cbc0010I After 16306000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1257.91 seconds)\n", + "Cbc0010I After 16307000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1257.97 seconds)\n", + "Cbc0010I After 16308000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1258.02 seconds)\n", + "Cbc0010I After 16309000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1258.06 seconds)\n", + "Cbc0010I After 16310000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1258.10 seconds)\n", + "Cbc0010I After 16311000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1258.16 seconds)\n", + "Cbc0010I After 16312000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1258.24 seconds)\n", + "Cbc0010I After 16313000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1258.30 seconds)\n", + "Cbc0010I After 16314000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1258.36 seconds)\n", + "Cbc0010I After 16315000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1258.42 seconds)\n", + "Cbc0010I After 16316000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1258.48 seconds)\n", + "Cbc0010I After 16317000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1258.55 seconds)\n", + "Cbc0010I After 16318000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1258.60 seconds)\n", + "Cbc0010I After 16319000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1258.68 seconds)\n", + "Cbc0010I After 16320000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1258.78 seconds)\n", + "Cbc0010I After 16321000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1258.86 seconds)\n", + "Cbc0010I After 16322000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1258.93 seconds)\n", + "Cbc0010I After 16323000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1258.99 seconds)\n", + "Cbc0010I After 16324000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1259.06 seconds)\n", + "Cbc0010I After 16325000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1259.12 seconds)\n", + "Cbc0010I After 16326000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1259.18 seconds)\n", + "Cbc0010I After 16327000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1259.25 seconds)\n", + "Cbc0010I After 16328000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1259.31 seconds)\n", + "Cbc0010I After 16329000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1259.37 seconds)\n", + "Cbc0010I After 16330000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1259.46 seconds)\n", + "Cbc0010I After 16331000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1259.54 seconds)\n", + "Cbc0010I After 16332000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1259.61 seconds)\n", + "Cbc0010I After 16333000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1259.67 seconds)\n", + "Cbc0010I After 16334000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1259.74 seconds)\n", + "Cbc0010I After 16335000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1259.81 seconds)\n", + "Cbc0010I After 16336000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1259.89 seconds)\n", + "Cbc0010I After 16337000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1259.96 seconds)\n", + "Cbc0010I After 16338000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1260.03 seconds)\n", + "Cbc0010I After 16339000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1260.11 seconds)\n", + "Cbc0010I After 16340000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1260.19 seconds)\n", + "Cbc0010I After 16341000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1260.25 seconds)\n", + "Cbc0010I After 16342000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1260.31 seconds)\n", + "Cbc0010I After 16343000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1260.40 seconds)\n", + "Cbc0010I After 16344000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1260.48 seconds)\n", + "Cbc0010I After 16345000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1260.55 seconds)\n", + "Cbc0010I After 16346000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1260.61 seconds)\n", + "Cbc0010I After 16347000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.67 seconds)\n", + "Cbc0010I After 16348000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.73 seconds)\n", + "Cbc0010I After 16349000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.81 seconds)\n", + "Cbc0010I After 16350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.89 seconds)\n", + "Cbc0010I After 16351000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1260.97 seconds)\n", + "Cbc0010I After 16352000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1261.04 seconds)\n", + "Cbc0010I After 16353000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1261.12 seconds)\n", + "Cbc0010I After 16354000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1261.19 seconds)\n", + "Cbc0010I After 16355000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1261.25 seconds)\n", + "Cbc0010I After 16356000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1261.32 seconds)\n", + "Cbc0010I After 16357000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1261.39 seconds)\n", + "Cbc0010I After 16358000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1261.44 seconds)\n", + "Cbc0010I After 16359000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1261.51 seconds)\n", + "Cbc0010I After 16360000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1261.59 seconds)\n", + "Cbc0010I After 16361000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1261.67 seconds)\n", + "Cbc0010I After 16362000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1261.73 seconds)\n", + "Cbc0010I After 16363000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1261.80 seconds)\n", + "Cbc0010I After 16364000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1261.87 seconds)\n", + "Cbc0010I After 16365000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1261.94 seconds)\n", + "Cbc0010I After 16366000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1262.01 seconds)\n", + "Cbc0010I After 16367000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1262.09 seconds)\n", + "Cbc0010I After 16368000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1262.15 seconds)\n", + "Cbc0010I After 16369000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1262.21 seconds)\n", + "Cbc0010I After 16370000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1262.28 seconds)\n", + "Cbc0010I After 16371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1262.35 seconds)\n", + "Cbc0010I After 16372000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1262.42 seconds)\n", + "Cbc0010I After 16373000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1262.50 seconds)\n", + "Cbc0010I After 16374000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1262.58 seconds)\n", + "Cbc0010I After 16375000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1262.65 seconds)\n", + "Cbc0010I After 16376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1262.72 seconds)\n", + "Cbc0010I After 16377000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1262.78 seconds)\n", + "Cbc0010I After 16378000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1262.86 seconds)\n", + "Cbc0010I After 16379000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1262.95 seconds)\n", + "Cbc0010I After 16380000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1263.03 seconds)\n", + "Cbc0010I After 16381000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1263.09 seconds)\n", + "Cbc0010I After 16382000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1263.16 seconds)\n", + "Cbc0010I After 16383000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1263.23 seconds)\n", + "Cbc0010I After 16384000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1263.29 seconds)\n", + "Cbc0010I After 16385000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1263.35 seconds)\n", + "Cbc0010I After 16386000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1263.41 seconds)\n", + "Cbc0010I After 16387000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1263.49 seconds)\n", + "Cbc0010I After 16388000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1263.54 seconds)\n", + "Cbc0010I After 16389000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1263.61 seconds)\n", + "Cbc0010I After 16390000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1263.69 seconds)\n", + "Cbc0010I After 16391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1263.75 seconds)\n", + "Cbc0010I After 16392000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1263.82 seconds)\n", + "Cbc0010I After 16393000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1263.89 seconds)\n", + "Cbc0010I After 16394000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1263.95 seconds)\n", + "Cbc0010I After 16395000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1264.02 seconds)\n", + "Cbc0010I After 16396000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1264.08 seconds)\n", + "Cbc0010I After 16397000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1264.14 seconds)\n", + "Cbc0010I After 16398000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1264.22 seconds)\n", + "Cbc0010I After 16399000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1264.29 seconds)\n", + "Cbc0010I After 16400000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1264.35 seconds)\n", + "Cbc0010I After 16401000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1264.41 seconds)\n", + "Cbc0010I After 16402000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1264.46 seconds)\n", + "Cbc0010I After 16403000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1264.53 seconds)\n", + "Cbc0010I After 16404000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1264.59 seconds)\n", + "Cbc0010I After 16405000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1264.66 seconds)\n", + "Cbc0010I After 16406000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1264.71 seconds)\n", + "Cbc0010I After 16407000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1264.77 seconds)\n", + "Cbc0010I After 16408000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1264.83 seconds)\n", + "Cbc0010I After 16409000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1264.89 seconds)\n", + "Cbc0010I After 16410000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1264.95 seconds)\n", + "Cbc0010I After 16411000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1265.01 seconds)\n", + "Cbc0010I After 16412000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1265.08 seconds)\n", + "Cbc0010I After 16413000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1265.15 seconds)\n", + "Cbc0010I After 16414000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1265.22 seconds)\n", + "Cbc0010I After 16415000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1265.28 seconds)\n", + "Cbc0010I After 16416000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1265.34 seconds)\n", + "Cbc0010I After 16417000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1265.40 seconds)\n", + "Cbc0010I After 16418000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1265.46 seconds)\n", + "Cbc0010I After 16419000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1265.53 seconds)\n", + "Cbc0010I After 16420000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1265.59 seconds)\n", + "Cbc0010I After 16421000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1265.65 seconds)\n", + "Cbc0010I After 16422000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1265.71 seconds)\n", + "Cbc0010I After 16423000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1265.77 seconds)\n", + "Cbc0010I After 16424000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1265.83 seconds)\n", + "Cbc0010I After 16425000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1265.89 seconds)\n", + "Cbc0010I After 16426000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1265.94 seconds)\n", + "Cbc0010I After 16427000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1266.00 seconds)\n", + "Cbc0010I After 16428000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1266.05 seconds)\n", + "Cbc0010I After 16429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1266.11 seconds)\n", + "Cbc0010I After 16430000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1266.17 seconds)\n", + "Cbc0010I After 16431000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1266.22 seconds)\n", + "Cbc0010I After 16432000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1266.29 seconds)\n", + "Cbc0010I After 16433000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1266.36 seconds)\n", + "Cbc0010I After 16434000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1266.42 seconds)\n", + "Cbc0010I After 16435000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1266.48 seconds)\n", + "Cbc0010I After 16436000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1266.54 seconds)\n", + "Cbc0010I After 16437000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1266.61 seconds)\n", + "Cbc0010I After 16438000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1266.67 seconds)\n", + "Cbc0010I After 16439000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1266.73 seconds)\n", + "Cbc0010I After 16440000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1266.79 seconds)\n", + "Cbc0010I After 16441000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1266.84 seconds)\n", + "Cbc0010I After 16442000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1266.89 seconds)\n", + "Cbc0010I After 16443000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1266.95 seconds)\n", + "Cbc0010I After 16444000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1267.01 seconds)\n", + "Cbc0010I After 16445000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1267.11 seconds)\n", + "Cbc0010I After 16446000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1267.21 seconds)\n", + "Cbc0010I After 16447000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1267.28 seconds)\n", + "Cbc0010I After 16448000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1267.36 seconds)\n", + "Cbc0010I After 16449000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1267.42 seconds)\n", + "Cbc0010I After 16450000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1267.49 seconds)\n", + "Cbc0010I After 16451000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1267.55 seconds)\n", + "Cbc0010I After 16452000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1267.60 seconds)\n", + "Cbc0010I After 16453000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1267.67 seconds)\n", + "Cbc0010I After 16454000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1267.73 seconds)\n", + "Cbc0010I After 16455000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1267.79 seconds)\n", + "Cbc0010I After 16456000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1267.85 seconds)\n", + "Cbc0010I After 16457000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1267.91 seconds)\n", + "Cbc0010I After 16458000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1267.96 seconds)\n", + "Cbc0010I After 16459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1268.02 seconds)\n", + "Cbc0010I After 16460000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1268.08 seconds)\n", + "Cbc0010I After 16461000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1268.14 seconds)\n", + "Cbc0010I After 16462000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1268.20 seconds)\n", + "Cbc0010I After 16463000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1268.27 seconds)\n", + "Cbc0010I After 16464000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1268.33 seconds)\n", + "Cbc0010I After 16465000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1268.39 seconds)\n", + "Cbc0010I After 16466000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1268.46 seconds)\n", + "Cbc0010I After 16467000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1268.53 seconds)\n", + "Cbc0010I After 16468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1268.61 seconds)\n", + "Cbc0010I After 16469000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1268.68 seconds)\n", + "Cbc0010I After 16470000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1268.75 seconds)\n", + "Cbc0010I After 16471000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1268.82 seconds)\n", + "Cbc0010I After 16472000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1268.88 seconds)\n", + "Cbc0010I After 16473000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1268.94 seconds)\n", + "Cbc0010I After 16474000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1269.00 seconds)\n", + "Cbc0010I After 16475000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1269.06 seconds)\n", + "Cbc0010I After 16476000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1269.11 seconds)\n", + "Cbc0010I After 16477000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1269.18 seconds)\n", + "Cbc0010I After 16478000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1269.25 seconds)\n", + "Cbc0010I After 16479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1269.32 seconds)\n", + "Cbc0010I After 16480000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1269.38 seconds)\n", + "Cbc0010I After 16481000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1269.46 seconds)\n", + "Cbc0010I After 16482000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1269.55 seconds)\n", + "Cbc0010I After 16483000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1269.63 seconds)\n", + "Cbc0010I After 16484000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1269.70 seconds)\n", + "Cbc0010I After 16485000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1269.77 seconds)\n", + "Cbc0010I After 16486000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1269.85 seconds)\n", + "Cbc0010I After 16487000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1269.92 seconds)\n", + "Cbc0010I After 16488000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1269.97 seconds)\n", + "Cbc0010I After 16489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1270.03 seconds)\n", + "Cbc0010I After 16490000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1270.12 seconds)\n", + "Cbc0010I After 16491000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1270.19 seconds)\n", + "Cbc0010I After 16492000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1270.25 seconds)\n", + "Cbc0010I After 16493000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1270.32 seconds)\n", + "Cbc0010I After 16494000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1270.38 seconds)\n", + "Cbc0010I After 16495000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1270.46 seconds)\n", + "Cbc0010I After 16496000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1270.53 seconds)\n", + "Cbc0010I After 16497000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1270.61 seconds)\n", + "Cbc0010I After 16498000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1270.68 seconds)\n", + "Cbc0010I After 16499000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1270.76 seconds)\n", + "Cbc0010I After 16500000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1270.84 seconds)\n", + "Cbc0010I After 16501000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1270.91 seconds)\n", + "Cbc0010I After 16502000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1270.96 seconds)\n", + "Cbc0010I After 16503000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1271.01 seconds)\n", + "Cbc0010I After 16504000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1271.08 seconds)\n", + "Cbc0010I After 16505000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1271.15 seconds)\n", + "Cbc0010I After 16506000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1271.22 seconds)\n", + "Cbc0010I After 16507000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1271.28 seconds)\n", + "Cbc0010I After 16508000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1271.34 seconds)\n", + "Cbc0010I After 16509000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1271.40 seconds)\n", + "Cbc0010I After 16510000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1271.49 seconds)\n", + "Cbc0010I After 16511000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1271.56 seconds)\n", + "Cbc0010I After 16512000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1271.63 seconds)\n", + "Cbc0010I After 16513000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1271.70 seconds)\n", + "Cbc0010I After 16514000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1271.76 seconds)\n", + "Cbc0010I After 16515000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1271.81 seconds)\n", + "Cbc0010I After 16516000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1271.88 seconds)\n", + "Cbc0010I After 16517000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1271.94 seconds)\n", + "Cbc0010I After 16518000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1272.00 seconds)\n", + "Cbc0010I After 16519000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1272.06 seconds)\n", + "Cbc0010I After 16520000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1272.11 seconds)\n", + "Cbc0010I After 16521000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1272.17 seconds)\n", + "Cbc0010I After 16522000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1272.22 seconds)\n", + "Cbc0010I After 16523000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1272.28 seconds)\n", + "Cbc0010I After 16524000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1272.34 seconds)\n", + "Cbc0010I After 16525000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1272.40 seconds)\n", + "Cbc0010I After 16526000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1272.45 seconds)\n", + "Cbc0010I After 16527000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1272.50 seconds)\n", + "Cbc0010I After 16528000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1272.56 seconds)\n", + "Cbc0010I After 16529000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1272.61 seconds)\n", + "Cbc0010I After 16530000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1272.67 seconds)\n", + "Cbc0010I After 16531000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1272.73 seconds)\n", + "Cbc0010I After 16532000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1272.79 seconds)\n", + "Cbc0010I After 16533000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1272.84 seconds)\n", + "Cbc0010I After 16534000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1272.90 seconds)\n", + "Cbc0010I After 16535000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1272.96 seconds)\n", + "Cbc0010I After 16536000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1273.01 seconds)\n", + "Cbc0010I After 16537000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1273.07 seconds)\n", + "Cbc0010I After 16538000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.13 seconds)\n", + "Cbc0010I After 16539000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1273.19 seconds)\n", + "Cbc0010I After 16540000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1273.25 seconds)\n", + "Cbc0010I After 16541000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1273.30 seconds)\n", + "Cbc0010I After 16542000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1273.36 seconds)\n", + "Cbc0010I After 16543000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1273.41 seconds)\n", + "Cbc0010I After 16544000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1273.46 seconds)\n", + "Cbc0010I After 16545000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.52 seconds)\n", + "Cbc0010I After 16546000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1273.57 seconds)\n", + "Cbc0010I After 16547000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1273.62 seconds)\n", + "Cbc0010I After 16548000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.68 seconds)\n", + "Cbc0010I After 16549000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1273.73 seconds)\n", + "Cbc0010I After 16550000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1273.79 seconds)\n", + "Cbc0010I After 16551000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1273.84 seconds)\n", + "Cbc0010I After 16552000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1273.89 seconds)\n", + "Cbc0010I After 16553000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1273.94 seconds)\n", + "Cbc0010I After 16554000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1273.99 seconds)\n", + "Cbc0010I After 16555000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1274.04 seconds)\n", + "Cbc0010I After 16556000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1274.10 seconds)\n", + "Cbc0010I After 16557000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1274.15 seconds)\n", + "Cbc0010I After 16558000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1274.21 seconds)\n", + "Cbc0010I After 16559000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1274.27 seconds)\n", + "Cbc0010I After 16560000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1274.33 seconds)\n", + "Cbc0010I After 16561000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1274.38 seconds)\n", + "Cbc0010I After 16562000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1274.44 seconds)\n", + "Cbc0010I After 16563000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1274.51 seconds)\n", + "Cbc0010I After 16564000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1274.58 seconds)\n", + "Cbc0010I After 16565000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1274.65 seconds)\n", + "Cbc0010I After 16566000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1274.72 seconds)\n", + "Cbc0010I After 16567000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1274.79 seconds)\n", + "Cbc0010I After 16568000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1274.86 seconds)\n", + "Cbc0010I After 16569000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1274.94 seconds)\n", + "Cbc0010I After 16570000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1275.06 seconds)\n", + "Cbc0010I After 16571000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1275.13 seconds)\n", + "Cbc0010I After 16572000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1275.19 seconds)\n", + "Cbc0010I After 16573000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1275.25 seconds)\n", + "Cbc0010I After 16574000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1275.31 seconds)\n", + "Cbc0010I After 16575000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1275.36 seconds)\n", + "Cbc0010I After 16576000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1275.42 seconds)\n", + "Cbc0010I After 16577000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1275.48 seconds)\n", + "Cbc0010I After 16578000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1275.53 seconds)\n", + "Cbc0010I After 16579000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1275.59 seconds)\n", + "Cbc0010I After 16580000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1275.64 seconds)\n", + "Cbc0010I After 16581000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1275.70 seconds)\n", + "Cbc0010I After 16582000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1275.77 seconds)\n", + "Cbc0010I After 16583000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1275.83 seconds)\n", + "Cbc0010I After 16584000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1275.90 seconds)\n", + "Cbc0010I After 16585000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1275.97 seconds)\n", + "Cbc0010I After 16586000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1276.03 seconds)\n", + "Cbc0010I After 16587000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1276.09 seconds)\n", + "Cbc0010I After 16588000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1276.16 seconds)\n", + "Cbc0010I After 16589000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1276.22 seconds)\n", + "Cbc0010I After 16590000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1276.27 seconds)\n", + "Cbc0010I After 16591000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1276.32 seconds)\n", + "Cbc0010I After 16592000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1276.37 seconds)\n", + "Cbc0010I After 16593000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1276.42 seconds)\n", + "Cbc0010I After 16594000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1276.48 seconds)\n", + "Cbc0010I After 16595000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1276.54 seconds)\n", + "Cbc0010I After 16596000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1276.60 seconds)\n", + "Cbc0010I After 16597000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1276.66 seconds)\n", + "Cbc0010I After 16598000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1276.72 seconds)\n", + "Cbc0010I After 16599000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1276.77 seconds)\n", + "Cbc0010I After 16600000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1276.83 seconds)\n", + "Cbc0010I After 16601000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1276.90 seconds)\n", + "Cbc0010I After 16602000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1276.96 seconds)\n", + "Cbc0010I After 16603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1277.02 seconds)\n", + "Cbc0010I After 16604000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1277.08 seconds)\n", + "Cbc0010I After 16605000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1277.15 seconds)\n", + "Cbc0010I After 16606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1277.21 seconds)\n", + "Cbc0010I After 16607000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1277.28 seconds)\n", + "Cbc0010I After 16608000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1277.35 seconds)\n", + "Cbc0010I After 16609000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1277.41 seconds)\n", + "Cbc0010I After 16610000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1277.47 seconds)\n", + "Cbc0010I After 16611000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1277.52 seconds)\n", + "Cbc0010I After 16612000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1277.59 seconds)\n", + "Cbc0010I After 16613000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1277.66 seconds)\n", + "Cbc0010I After 16614000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1277.72 seconds)\n", + "Cbc0010I After 16615000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1277.79 seconds)\n", + "Cbc0010I After 16616000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1277.86 seconds)\n", + "Cbc0010I After 16617000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1277.92 seconds)\n", + "Cbc0010I After 16618000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1277.99 seconds)\n", + "Cbc0010I After 16619000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1278.05 seconds)\n", + "Cbc0010I After 16620000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1278.10 seconds)\n", + "Cbc0010I After 16621000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1278.16 seconds)\n", + "Cbc0010I After 16622000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1278.23 seconds)\n", + "Cbc0010I After 16623000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1278.30 seconds)\n", + "Cbc0010I After 16624000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1278.37 seconds)\n", + "Cbc0010I After 16625000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1278.43 seconds)\n", + "Cbc0010I After 16626000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1278.50 seconds)\n", + "Cbc0010I After 16627000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1278.56 seconds)\n", + "Cbc0010I After 16628000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1278.63 seconds)\n", + "Cbc0010I After 16629000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1278.70 seconds)\n", + "Cbc0010I After 16630000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1278.78 seconds)\n", + "Cbc0010I After 16631000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1278.84 seconds)\n", + "Cbc0010I After 16632000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1278.91 seconds)\n", + "Cbc0010I After 16633000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1278.96 seconds)\n", + "Cbc0010I After 16634000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1279.04 seconds)\n", + "Cbc0010I After 16635000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1279.11 seconds)\n", + "Cbc0010I After 16636000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1279.18 seconds)\n", + "Cbc0010I After 16637000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1279.24 seconds)\n", + "Cbc0010I After 16638000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1279.30 seconds)\n", + "Cbc0010I After 16639000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1279.34 seconds)\n", + "Cbc0010I After 16640000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1279.39 seconds)\n", + "Cbc0010I After 16641000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1279.43 seconds)\n", + "Cbc0010I After 16642000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1279.49 seconds)\n", + "Cbc0010I After 16643000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1279.58 seconds)\n", + "Cbc0010I After 16644000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1279.64 seconds)\n", + "Cbc0010I After 16645000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1279.72 seconds)\n", + "Cbc0010I After 16646000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1279.78 seconds)\n", + "Cbc0010I After 16647000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1279.84 seconds)\n", + "Cbc0010I After 16648000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1279.91 seconds)\n", + "Cbc0010I After 16649000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1279.98 seconds)\n", + "Cbc0010I After 16650000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1280.06 seconds)\n", + "Cbc0010I After 16651000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1280.13 seconds)\n", + "Cbc0010I After 16652000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1280.22 seconds)\n", + "Cbc0010I After 16653000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1280.34 seconds)\n", + "Cbc0010I After 16654000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1280.44 seconds)\n", + "Cbc0010I After 16655000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1280.53 seconds)\n", + "Cbc0010I After 16656000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1280.61 seconds)\n", + "Cbc0010I After 16657000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1280.68 seconds)\n", + "Cbc0010I After 16658000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1280.75 seconds)\n", + "Cbc0010I After 16659000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1280.82 seconds)\n", + "Cbc0010I After 16660000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1280.90 seconds)\n", + "Cbc0010I After 16661000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1280.97 seconds)\n", + "Cbc0010I After 16662000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1281.05 seconds)\n", + "Cbc0010I After 16663000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.11 seconds)\n", + "Cbc0010I After 16664000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1281.17 seconds)\n", + "Cbc0010I After 16665000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1281.23 seconds)\n", + "Cbc0010I After 16666000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1281.30 seconds)\n", + "Cbc0010I After 16667000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1281.37 seconds)\n", + "Cbc0010I After 16668000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.44 seconds)\n", + "Cbc0010I After 16669000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1281.51 seconds)\n", + "Cbc0010I After 16670000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1281.57 seconds)\n", + "Cbc0010I After 16671000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1281.64 seconds)\n", + "Cbc0010I After 16672000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1281.72 seconds)\n", + "Cbc0010I After 16673000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1281.79 seconds)\n", + "Cbc0010I After 16674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.86 seconds)\n", + "Cbc0010I After 16675000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1281.92 seconds)\n", + "Cbc0010I After 16676000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1281.99 seconds)\n", + "Cbc0010I After 16677000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1282.06 seconds)\n", + "Cbc0010I After 16678000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1282.14 seconds)\n", + "Cbc0010I After 16679000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.20 seconds)\n", + "Cbc0010I After 16680000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1282.27 seconds)\n", + "Cbc0010I After 16681000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1282.33 seconds)\n", + "Cbc0010I After 16682000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1282.39 seconds)\n", + "Cbc0010I After 16683000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1282.46 seconds)\n", + "Cbc0010I After 16684000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1282.54 seconds)\n", + "Cbc0010I After 16685000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1282.61 seconds)\n", + "Cbc0010I After 16686000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.69 seconds)\n", + "Cbc0010I After 16687000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1282.75 seconds)\n", + "Cbc0010I After 16688000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.81 seconds)\n", + "Cbc0010I After 16689000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1282.88 seconds)\n", + "Cbc0010I After 16690000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1282.95 seconds)\n", + "Cbc0010I After 16691000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1283.02 seconds)\n", + "Cbc0010I After 16692000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1283.07 seconds)\n", + "Cbc0010I After 16693000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1283.13 seconds)\n", + "Cbc0010I After 16694000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1283.21 seconds)\n", + "Cbc0010I After 16695000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1283.29 seconds)\n", + "Cbc0010I After 16696000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1283.36 seconds)\n", + "Cbc0010I After 16697000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1283.43 seconds)\n", + "Cbc0010I After 16698000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1283.49 seconds)\n", + "Cbc0010I After 16699000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1283.55 seconds)\n", + "Cbc0010I After 16700000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1283.63 seconds)\n", + "Cbc0010I After 16701000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1283.70 seconds)\n", + "Cbc0010I After 16702000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1283.76 seconds)\n", + "Cbc0010I After 16703000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1283.82 seconds)\n", + "Cbc0010I After 16704000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1283.88 seconds)\n", + "Cbc0010I After 16705000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1283.95 seconds)\n", + "Cbc0010I After 16706000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1284.01 seconds)\n", + "Cbc0010I After 16707000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1284.09 seconds)\n", + "Cbc0010I After 16708000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1284.15 seconds)\n", + "Cbc0010I After 16709000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1284.21 seconds)\n", + "Cbc0010I After 16710000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1284.26 seconds)\n", + "Cbc0010I After 16711000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1284.31 seconds)\n", + "Cbc0010I After 16712000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.34 seconds)\n", + "Cbc0010I After 16713000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1284.37 seconds)\n", + "Cbc0010I After 16714000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1284.45 seconds)\n", + "Cbc0010I After 16715000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1284.52 seconds)\n", + "Cbc0010I After 16716000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1284.58 seconds)\n", + "Cbc0010I After 16717000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1284.65 seconds)\n", + "Cbc0010I After 16718000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1284.72 seconds)\n", + "Cbc0010I After 16719000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1284.79 seconds)\n", + "Cbc0010I After 16720000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.85 seconds)\n", + "Cbc0010I After 16721000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.92 seconds)\n", + "Cbc0010I After 16722000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1284.99 seconds)\n", + "Cbc0010I After 16723000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1285.06 seconds)\n", + "Cbc0010I After 16724000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1285.13 seconds)\n", + "Cbc0010I After 16725000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1285.20 seconds)\n", + "Cbc0010I After 16726000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1285.27 seconds)\n", + "Cbc0010I After 16727000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1285.35 seconds)\n", + "Cbc0010I After 16728000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1285.43 seconds)\n", + "Cbc0010I After 16729000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1285.50 seconds)\n", + "Cbc0010I After 16730000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1285.57 seconds)\n", + "Cbc0010I After 16731000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1285.63 seconds)\n", + "Cbc0010I After 16732000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1285.69 seconds)\n", + "Cbc0010I After 16733000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1285.75 seconds)\n", + "Cbc0010I After 16734000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1285.82 seconds)\n", + "Cbc0010I After 16735000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1285.89 seconds)\n", + "Cbc0010I After 16736000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1285.96 seconds)\n", + "Cbc0010I After 16737000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1286.03 seconds)\n", + "Cbc0010I After 16738000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1286.08 seconds)\n", + "Cbc0010I After 16739000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1286.12 seconds)\n", + "Cbc0010I After 16740000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1286.17 seconds)\n", + "Cbc0010I After 16741000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1286.20 seconds)\n", + "Cbc0010I After 16742000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1286.26 seconds)\n", + "Cbc0010I After 16743000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1286.30 seconds)\n", + "Cbc0010I After 16744000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1286.36 seconds)\n", + "Cbc0010I After 16745000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1286.40 seconds)\n", + "Cbc0010I After 16746000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1286.45 seconds)\n", + "Cbc0010I After 16747000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1286.52 seconds)\n", + "Cbc0010I After 16748000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1286.60 seconds)\n", + "Cbc0010I After 16749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1286.68 seconds)\n", + "Cbc0010I After 16750000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1286.74 seconds)\n", + "Cbc0010I After 16751000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1286.82 seconds)\n", + "Cbc0010I After 16752000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1286.87 seconds)\n", + "Cbc0010I After 16753000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1286.92 seconds)\n", + "Cbc0010I After 16754000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1286.98 seconds)\n", + "Cbc0010I After 16755000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1287.03 seconds)\n", + "Cbc0010I After 16756000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.06 seconds)\n", + "Cbc0010I After 16757000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1287.09 seconds)\n", + "Cbc0010I After 16758000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.13 seconds)\n", + "Cbc0010I After 16759000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1287.21 seconds)\n", + "Cbc0010I After 16760000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1287.27 seconds)\n", + "Cbc0010I After 16761000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.34 seconds)\n", + "Cbc0010I After 16762000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1287.39 seconds)\n", + "Cbc0010I After 16763000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1287.45 seconds)\n", + "Cbc0010I After 16764000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1287.51 seconds)\n", + "Cbc0010I After 16765000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1287.56 seconds)\n", + "Cbc0010I After 16766000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1287.62 seconds)\n", + "Cbc0010I After 16767000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1287.68 seconds)\n", + "Cbc0010I After 16768000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1287.74 seconds)\n", + "Cbc0010I After 16769000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1287.79 seconds)\n", + "Cbc0010I After 16770000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1287.85 seconds)\n", + "Cbc0010I After 16771000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1287.91 seconds)\n", + "Cbc0010I After 16772000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1287.98 seconds)\n", + "Cbc0010I After 16773000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.06 seconds)\n", + "Cbc0010I After 16774000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1288.13 seconds)\n", + "Cbc0010I After 16775000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1288.21 seconds)\n", + "Cbc0010I After 16776000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1288.28 seconds)\n", + "Cbc0010I After 16777000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.36 seconds)\n", + "Cbc0010I After 16778000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1288.45 seconds)\n", + "Cbc0010I After 16779000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1288.52 seconds)\n", + "Cbc0010I After 16780000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1288.60 seconds)\n", + "Cbc0010I After 16781000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.68 seconds)\n", + "Cbc0010I After 16782000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1288.76 seconds)\n", + "Cbc0010I After 16783000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1288.84 seconds)\n", + "Cbc0010I After 16784000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1288.91 seconds)\n", + "Cbc0010I After 16785000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1288.99 seconds)\n", + "Cbc0010I After 16786000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1289.06 seconds)\n", + "Cbc0010I After 16787000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1289.10 seconds)\n", + "Cbc0010I After 16788000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1289.17 seconds)\n", + "Cbc0010I After 16789000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1289.22 seconds)\n", + "Cbc0010I After 16790000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1289.30 seconds)\n", + "Cbc0010I After 16791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1289.38 seconds)\n", + "Cbc0010I After 16792000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1289.41 seconds)\n", + "Cbc0010I After 16793000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1289.46 seconds)\n", + "Cbc0010I After 16794000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1289.53 seconds)\n", + "Cbc0010I After 16795000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1289.60 seconds)\n", + "Cbc0010I After 16796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1289.67 seconds)\n", + "Cbc0010I After 16797000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1289.73 seconds)\n", + "Cbc0010I After 16798000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1289.81 seconds)\n", + "Cbc0010I After 16799000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1289.86 seconds)\n", + "Cbc0010I After 16800000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1289.91 seconds)\n", + "Cbc0010I After 16801000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1289.96 seconds)\n", + "Cbc0010I After 16802000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1290.03 seconds)\n", + "Cbc0010I After 16803000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1290.09 seconds)\n", + "Cbc0010I After 16804000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1290.12 seconds)\n", + "Cbc0010I After 16805000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1290.19 seconds)\n", + "Cbc0010I After 16806000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1290.26 seconds)\n", + "Cbc0010I After 16807000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1290.33 seconds)\n", + "Cbc0010I After 16808000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1290.41 seconds)\n", + "Cbc0010I After 16809000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1290.48 seconds)\n", + "Cbc0010I After 16810000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1290.54 seconds)\n", + "Cbc0010I After 16811000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1290.60 seconds)\n", + "Cbc0010I After 16812000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1290.64 seconds)\n", + "Cbc0010I After 16813000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1290.69 seconds)\n", + "Cbc0010I After 16814000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1290.76 seconds)\n", + "Cbc0010I After 16815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1290.80 seconds)\n", + "Cbc0010I After 16816000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1290.83 seconds)\n", + "Cbc0010I After 16817000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1290.86 seconds)\n", + "Cbc0010I After 16818000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1290.94 seconds)\n", + "Cbc0010I After 16819000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1291.01 seconds)\n", + "Cbc0010I After 16820000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1291.15 seconds)\n", + "Cbc0010I After 16821000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1291.23 seconds)\n", + "Cbc0010I After 16822000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1291.31 seconds)\n", + "Cbc0010I After 16823000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1291.40 seconds)\n", + "Cbc0010I After 16824000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1291.48 seconds)\n", + "Cbc0010I After 16825000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1291.55 seconds)\n", + "Cbc0010I After 16826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1291.63 seconds)\n", + "Cbc0010I After 16827000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1291.70 seconds)\n", + "Cbc0010I After 16828000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1291.78 seconds)\n", + "Cbc0010I After 16829000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1291.86 seconds)\n", + "Cbc0010I After 16830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1291.93 seconds)\n", + "Cbc0010I After 16831000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1292.01 seconds)\n", + "Cbc0010I After 16832000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1292.08 seconds)\n", + "Cbc0010I After 16833000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1292.16 seconds)\n", + "Cbc0010I After 16834000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1292.24 seconds)\n", + "Cbc0010I After 16835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1292.31 seconds)\n", + "Cbc0010I After 16836000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1292.39 seconds)\n", + "Cbc0010I After 16837000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1292.47 seconds)\n", + "Cbc0010I After 16838000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1292.55 seconds)\n", + "Cbc0010I After 16839000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1292.62 seconds)\n", + "Cbc0010I After 16840000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1292.71 seconds)\n", + "Cbc0010I After 16841000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1292.77 seconds)\n", + "Cbc0010I After 16842000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1292.80 seconds)\n", + "Cbc0010I After 16843000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1292.83 seconds)\n", + "Cbc0010I After 16844000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1292.89 seconds)\n", + "Cbc0010I After 16845000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1292.94 seconds)\n", + "Cbc0010I After 16846000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1292.98 seconds)\n", + "Cbc0010I After 16847000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1293.01 seconds)\n", + "Cbc0010I After 16848000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1293.03 seconds)\n", + "Cbc0010I After 16849000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1293.07 seconds)\n", + "Cbc0010I After 16850000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1293.11 seconds)\n", + "Cbc0010I After 16851000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1293.16 seconds)\n", + "Cbc0010I After 16852000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1293.20 seconds)\n", + "Cbc0010I After 16853000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1293.23 seconds)\n", + "Cbc0010I After 16854000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1293.26 seconds)\n", + "Cbc0010I After 16855000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1293.32 seconds)\n", + "Cbc0010I After 16856000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1293.39 seconds)\n", + "Cbc0010I After 16857000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1293.42 seconds)\n", + "Cbc0010I After 16858000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1293.45 seconds)\n", + "Cbc0010I After 16859000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1293.48 seconds)\n", + "Cbc0010I After 16860000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1293.53 seconds)\n", + "Cbc0010I After 16861000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1293.58 seconds)\n", + "Cbc0010I After 16862000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1293.64 seconds)\n", + "Cbc0010I After 16863000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1293.69 seconds)\n", + "Cbc0010I After 16864000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1293.80 seconds)\n", + "Cbc0010I After 16865000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1293.84 seconds)\n", + "Cbc0010I After 16866000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1293.92 seconds)\n", + "Cbc0010I After 16867000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1294.01 seconds)\n", + "Cbc0010I After 16868000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1294.07 seconds)\n", + "Cbc0010I After 16869000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1294.10 seconds)\n", + "Cbc0010I After 16870000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1294.12 seconds)\n", + "Cbc0010I After 16871000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1294.18 seconds)\n", + "Cbc0010I After 16872000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1294.24 seconds)\n", + "Cbc0010I After 16873000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1294.30 seconds)\n", + "Cbc0010I After 16874000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1294.37 seconds)\n", + "Cbc0010I After 16875000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1294.43 seconds)\n", + "Cbc0010I After 16876000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1294.50 seconds)\n", + "Cbc0010I After 16877000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1294.57 seconds)\n", + "Cbc0010I After 16878000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1294.64 seconds)\n", + "Cbc0010I After 16879000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1294.70 seconds)\n", + "Cbc0010I After 16880000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1294.77 seconds)\n", + "Cbc0010I After 16881000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1294.84 seconds)\n", + "Cbc0010I After 16882000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1294.89 seconds)\n", + "Cbc0010I After 16883000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1294.93 seconds)\n", + "Cbc0010I After 16884000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1294.98 seconds)\n", + "Cbc0010I After 16885000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1295.05 seconds)\n", + "Cbc0010I After 16886000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1295.12 seconds)\n", + "Cbc0010I After 16887000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1295.20 seconds)\n", + "Cbc0010I After 16888000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1295.28 seconds)\n", + "Cbc0010I After 16889000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1295.35 seconds)\n", + "Cbc0010I After 16890000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1295.42 seconds)\n", + "Cbc0010I After 16891000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1295.49 seconds)\n", + "Cbc0010I After 16892000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1295.55 seconds)\n", + "Cbc0010I After 16893000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1295.60 seconds)\n", + "Cbc0010I After 16894000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1295.68 seconds)\n", + "Cbc0010I After 16895000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1295.76 seconds)\n", + "Cbc0010I After 16896000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1295.81 seconds)\n", + "Cbc0010I After 16897000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1295.85 seconds)\n", + "Cbc0010I After 16898000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1295.92 seconds)\n", + "Cbc0010I After 16899000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1296.00 seconds)\n", + "Cbc0010I After 16900000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1296.07 seconds)\n", + "Cbc0010I After 16901000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1296.15 seconds)\n", + "Cbc0010I After 16902000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1296.23 seconds)\n", + "Cbc0010I After 16903000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1296.32 seconds)\n", + "Cbc0010I After 16904000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1296.40 seconds)\n", + "Cbc0010I After 16905000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.48 seconds)\n", + "Cbc0010I After 16906000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.56 seconds)\n", + "Cbc0010I After 16907000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1296.64 seconds)\n", + "Cbc0010I After 16908000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1296.72 seconds)\n", + "Cbc0010I After 16909000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1296.80 seconds)\n", + "Cbc0010I After 16910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.87 seconds)\n", + "Cbc0010I After 16911000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1296.95 seconds)\n", + "Cbc0010I After 16912000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1297.03 seconds)\n", + "Cbc0010I After 16913000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1297.11 seconds)\n", + "Cbc0010I After 16914000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1297.19 seconds)\n", + "Cbc0010I After 16915000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1297.27 seconds)\n", + "Cbc0010I After 16916000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1297.34 seconds)\n", + "Cbc0010I After 16917000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1297.42 seconds)\n", + "Cbc0010I After 16918000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1297.48 seconds)\n", + "Cbc0010I After 16919000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1297.55 seconds)\n", + "Cbc0010I After 16920000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1297.63 seconds)\n", + "Cbc0010I After 16921000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1297.69 seconds)\n", + "Cbc0010I After 16922000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1297.74 seconds)\n", + "Cbc0010I After 16923000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1297.76 seconds)\n", + "Cbc0010I After 16924000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1297.79 seconds)\n", + "Cbc0010I After 16925000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1297.82 seconds)\n", + "Cbc0010I After 16926000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1297.89 seconds)\n", + "Cbc0010I After 16927000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1297.96 seconds)\n", + "Cbc0010I After 16928000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1298.04 seconds)\n", + "Cbc0010I After 16929000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1298.11 seconds)\n", + "Cbc0010I After 16930000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1298.17 seconds)\n", + "Cbc0010I After 16931000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1298.25 seconds)\n", + "Cbc0010I After 16932000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1298.32 seconds)\n", + "Cbc0010I After 16933000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1298.39 seconds)\n", + "Cbc0010I After 16934000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1298.47 seconds)\n", + "Cbc0010I After 16935000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1298.54 seconds)\n", + "Cbc0010I After 16936000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1298.62 seconds)\n", + "Cbc0010I After 16937000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.69 seconds)\n", + "Cbc0010I After 16938000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.77 seconds)\n", + "Cbc0010I After 16939000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.84 seconds)\n", + "Cbc0010I After 16940000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1298.92 seconds)\n", + "Cbc0010I After 16941000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1298.99 seconds)\n", + "Cbc0010I After 16942000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1299.06 seconds)\n", + "Cbc0010I After 16943000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1299.14 seconds)\n", + "Cbc0010I After 16944000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1299.21 seconds)\n", + "Cbc0010I After 16945000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1299.29 seconds)\n", + "Cbc0010I After 16946000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1299.37 seconds)\n", + "Cbc0010I After 16947000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1299.46 seconds)\n", + "Cbc0010I After 16948000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1299.54 seconds)\n", + "Cbc0010I After 16949000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1299.61 seconds)\n", + "Cbc0010I After 16950000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1299.71 seconds)\n", + "Cbc0010I After 16951000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1299.78 seconds)\n", + "Cbc0010I After 16952000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1299.86 seconds)\n", + "Cbc0010I After 16953000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1299.93 seconds)\n", + "Cbc0010I After 16954000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1300.01 seconds)\n", + "Cbc0010I After 16955000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1300.09 seconds)\n", + "Cbc0010I After 16956000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1300.17 seconds)\n", + "Cbc0010I After 16957000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.24 seconds)\n", + "Cbc0010I After 16958000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1300.32 seconds)\n", + "Cbc0010I After 16959000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1300.39 seconds)\n", + "Cbc0010I After 16960000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1300.47 seconds)\n", + "Cbc0010I After 16961000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1300.55 seconds)\n", + "Cbc0010I After 16962000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1300.61 seconds)\n", + "Cbc0010I After 16963000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1300.64 seconds)\n", + "Cbc0010I After 16964000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1300.70 seconds)\n", + "Cbc0010I After 16965000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.77 seconds)\n", + "Cbc0010I After 16966000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.83 seconds)\n", + "Cbc0010I After 16967000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1300.90 seconds)\n", + "Cbc0010I After 16968000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1300.95 seconds)\n", + "Cbc0010I After 16969000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1301.02 seconds)\n", + "Cbc0010I After 16970000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1301.10 seconds)\n", + "Cbc0010I After 16971000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1301.15 seconds)\n", + "Cbc0010I After 16972000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1301.19 seconds)\n", + "Cbc0010I After 16973000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1301.23 seconds)\n", + "Cbc0010I After 16974000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1301.28 seconds)\n", + "Cbc0010I After 16975000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1301.33 seconds)\n", + "Cbc0010I After 16976000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1301.39 seconds)\n", + "Cbc0010I After 16977000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1301.42 seconds)\n", + "Cbc0010I After 16978000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1301.45 seconds)\n", + "Cbc0010I After 16979000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1301.50 seconds)\n", + "Cbc0010I After 16980000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1301.56 seconds)\n", + "Cbc0010I After 16981000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1301.62 seconds)\n", + "Cbc0010I After 16982000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1301.67 seconds)\n", + "Cbc0010I After 16983000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1301.72 seconds)\n", + "Cbc0010I After 16984000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1301.80 seconds)\n", + "Cbc0010I After 16985000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1301.85 seconds)\n", + "Cbc0010I After 16986000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1301.91 seconds)\n", + "Cbc0010I After 16987000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1301.96 seconds)\n", + "Cbc0010I After 16988000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1302.01 seconds)\n", + "Cbc0010I After 16989000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1302.08 seconds)\n", + "Cbc0010I After 16990000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1302.11 seconds)\n", + "Cbc0010I After 16991000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1302.14 seconds)\n", + "Cbc0010I After 16992000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1302.18 seconds)\n", + "Cbc0010I After 16993000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1302.21 seconds)\n", + "Cbc0010I After 16994000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1302.27 seconds)\n", + "Cbc0010I After 16995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1302.33 seconds)\n", + "Cbc0010I After 16996000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1302.40 seconds)\n", + "Cbc0010I After 16997000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1302.48 seconds)\n", + "Cbc0010I After 16998000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1302.54 seconds)\n", + "Cbc0010I After 16999000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1302.60 seconds)\n", + "Cbc0010I After 17000000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1302.66 seconds)\n", + "Cbc0010I After 17001000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1302.73 seconds)\n", + "Cbc0010I After 17002000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1302.81 seconds)\n", + "Cbc0010I After 17003000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1302.90 seconds)\n", + "Cbc0010I After 17004000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1302.97 seconds)\n", + "Cbc0010I After 17005000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1303.03 seconds)\n", + "Cbc0010I After 17006000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1303.10 seconds)\n", + "Cbc0010I After 17007000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1303.16 seconds)\n", + "Cbc0010I After 17008000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1303.22 seconds)\n", + "Cbc0010I After 17009000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1303.29 seconds)\n", + "Cbc0010I After 17010000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1303.36 seconds)\n", + "Cbc0010I After 17011000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1303.42 seconds)\n", + "Cbc0010I After 17012000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1303.48 seconds)\n", + "Cbc0010I After 17013000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1303.56 seconds)\n", + "Cbc0010I After 17014000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1303.62 seconds)\n", + "Cbc0010I After 17015000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1303.68 seconds)\n", + "Cbc0010I After 17016000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1303.75 seconds)\n", + "Cbc0010I After 17017000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1303.81 seconds)\n", + "Cbc0010I After 17018000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1303.90 seconds)\n", + "Cbc0010I After 17019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1303.98 seconds)\n", + "Cbc0010I After 17020000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1304.05 seconds)\n", + "Cbc0010I After 17021000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1304.11 seconds)\n", + "Cbc0010I After 17022000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1304.18 seconds)\n", + "Cbc0010I After 17023000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1304.25 seconds)\n", + "Cbc0010I After 17024000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1304.31 seconds)\n", + "Cbc0010I After 17025000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1304.38 seconds)\n", + "Cbc0010I After 17026000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1304.46 seconds)\n", + "Cbc0010I After 17027000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1304.52 seconds)\n", + "Cbc0010I After 17028000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1304.59 seconds)\n", + "Cbc0010I After 17029000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1304.65 seconds)\n", + "Cbc0010I After 17030000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1304.71 seconds)\n", + "Cbc0010I After 17031000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1304.77 seconds)\n", + "Cbc0010I After 17032000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1304.84 seconds)\n", + "Cbc0010I After 17033000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1304.92 seconds)\n", + "Cbc0010I After 17034000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.00 seconds)\n", + "Cbc0010I After 17035000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1305.08 seconds)\n", + "Cbc0010I After 17036000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1305.16 seconds)\n", + "Cbc0010I After 17037000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.25 seconds)\n", + "Cbc0010I After 17038000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1305.33 seconds)\n", + "Cbc0010I After 17039000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1305.41 seconds)\n", + "Cbc0010I After 17040000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1305.49 seconds)\n", + "Cbc0010I After 17041000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1305.55 seconds)\n", + "Cbc0010I After 17042000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1305.61 seconds)\n", + "Cbc0010I After 17043000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1305.69 seconds)\n", + "Cbc0010I After 17044000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1305.76 seconds)\n", + "Cbc0010I After 17045000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.84 seconds)\n", + "Cbc0010I After 17046000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1305.91 seconds)\n", + "Cbc0010I After 17047000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1305.98 seconds)\n", + "Cbc0010I After 17048000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1306.03 seconds)\n", + "Cbc0010I After 17049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1306.07 seconds)\n", + "Cbc0010I After 17050000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1306.13 seconds)\n", + "Cbc0010I After 17051000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1306.21 seconds)\n", + "Cbc0010I After 17052000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1306.28 seconds)\n", + "Cbc0010I After 17053000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1306.35 seconds)\n", + "Cbc0010I After 17054000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1306.42 seconds)\n", + "Cbc0010I After 17055000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1306.48 seconds)\n", + "Cbc0010I After 17056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1306.56 seconds)\n", + "Cbc0010I After 17057000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1306.64 seconds)\n", + "Cbc0010I After 17058000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1306.72 seconds)\n", + "Cbc0010I After 17059000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1306.79 seconds)\n", + "Cbc0010I After 17060000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1306.86 seconds)\n", + "Cbc0010I After 17061000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1306.93 seconds)\n", + "Cbc0010I After 17062000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1307.00 seconds)\n", + "Cbc0010I After 17063000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1307.07 seconds)\n", + "Cbc0010I After 17064000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1307.15 seconds)\n", + "Cbc0010I After 17065000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1307.23 seconds)\n", + "Cbc0010I After 17066000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1307.31 seconds)\n", + "Cbc0010I After 17067000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1307.40 seconds)\n", + "Cbc0010I After 17068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1307.49 seconds)\n", + "Cbc0010I After 17069000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1307.57 seconds)\n", + "Cbc0010I After 17070000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1307.68 seconds)\n", + "Cbc0010I After 17071000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1307.80 seconds)\n", + "Cbc0010I After 17072000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1307.89 seconds)\n", + "Cbc0010I After 17073000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1307.97 seconds)\n", + "Cbc0010I After 17074000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1308.05 seconds)\n", + "Cbc0010I After 17075000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.13 seconds)\n", + "Cbc0010I After 17076000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.21 seconds)\n", + "Cbc0010I After 17077000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1308.28 seconds)\n", + "Cbc0010I After 17078000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1308.31 seconds)\n", + "Cbc0010I After 17079000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1308.37 seconds)\n", + "Cbc0010I After 17080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1308.43 seconds)\n", + "Cbc0010I After 17081000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1308.49 seconds)\n", + "Cbc0010I After 17082000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1308.54 seconds)\n", + "Cbc0010I After 17083000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1308.58 seconds)\n", + "Cbc0010I After 17084000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1308.64 seconds)\n", + "Cbc0010I After 17085000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1308.70 seconds)\n", + "Cbc0010I After 17086000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1308.74 seconds)\n", + "Cbc0010I After 17087000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1308.79 seconds)\n", + "Cbc0010I After 17088000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1308.85 seconds)\n", + "Cbc0010I After 17089000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.91 seconds)\n", + "Cbc0010I After 17090000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1308.97 seconds)\n", + "Cbc0010I After 17091000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1309.05 seconds)\n", + "Cbc0010I After 17092000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1309.12 seconds)\n", + "Cbc0010I After 17093000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1309.18 seconds)\n", + "Cbc0010I After 17094000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.22 seconds)\n", + "Cbc0010I After 17095000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.30 seconds)\n", + "Cbc0010I After 17096000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1309.35 seconds)\n", + "Cbc0010I After 17097000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.44 seconds)\n", + "Cbc0010I After 17098000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.56 seconds)\n", + "Cbc0010I After 17099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1309.70 seconds)\n", + "Cbc0010I After 17100000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1309.87 seconds)\n", + "Cbc0010I After 17101000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1310.05 seconds)\n", + "Cbc0010I After 17102000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1310.20 seconds)\n", + "Cbc0010I After 17103000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1310.33 seconds)\n", + "Cbc0010I After 17104000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1310.44 seconds)\n", + "Cbc0010I After 17105000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1310.54 seconds)\n", + "Cbc0010I After 17106000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1310.62 seconds)\n", + "Cbc0010I After 17107000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1310.69 seconds)\n", + "Cbc0010I After 17108000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1310.76 seconds)\n", + "Cbc0010I After 17109000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1310.80 seconds)\n", + "Cbc0010I After 17110000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1310.84 seconds)\n", + "Cbc0010I After 17111000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1310.89 seconds)\n", + "Cbc0010I After 17112000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1310.92 seconds)\n", + "Cbc0010I After 17113000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1310.96 seconds)\n", + "Cbc0010I After 17114000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1311.01 seconds)\n", + "Cbc0010I After 17115000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1311.06 seconds)\n", + "Cbc0010I After 17116000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1311.12 seconds)\n", + "Cbc0010I After 17117000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1311.18 seconds)\n", + "Cbc0010I After 17118000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1311.22 seconds)\n", + "Cbc0010I After 17119000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1311.25 seconds)\n", + "Cbc0010I After 17120000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1311.29 seconds)\n", + "Cbc0010I After 17121000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1311.35 seconds)\n", + "Cbc0010I After 17122000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1311.40 seconds)\n", + "Cbc0010I After 17123000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1311.46 seconds)\n", + "Cbc0010I After 17124000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1311.51 seconds)\n", + "Cbc0010I After 17125000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1311.56 seconds)\n", + "Cbc0010I After 17126000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1311.61 seconds)\n", + "Cbc0010I After 17127000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1311.64 seconds)\n", + "Cbc0010I After 17128000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1311.69 seconds)\n", + "Cbc0010I After 17129000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1311.77 seconds)\n", + "Cbc0010I After 17130000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1311.85 seconds)\n", + "Cbc0010I After 17131000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1311.92 seconds)\n", + "Cbc0010I After 17132000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1311.99 seconds)\n", + "Cbc0010I After 17133000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1312.06 seconds)\n", + "Cbc0010I After 17134000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1312.13 seconds)\n", + "Cbc0010I After 17135000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1312.21 seconds)\n", + "Cbc0010I After 17136000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1312.28 seconds)\n", + "Cbc0010I After 17137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1312.35 seconds)\n", + "Cbc0010I After 17138000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1312.43 seconds)\n", + "Cbc0010I After 17139000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1312.50 seconds)\n", + "Cbc0010I After 17140000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1312.56 seconds)\n", + "Cbc0010I After 17141000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1312.62 seconds)\n", + "Cbc0010I After 17142000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1312.67 seconds)\n", + "Cbc0010I After 17143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1312.74 seconds)\n", + "Cbc0010I After 17144000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1312.82 seconds)\n", + "Cbc0010I After 17145000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1312.89 seconds)\n", + "Cbc0010I After 17146000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1312.95 seconds)\n", + "Cbc0010I After 17147000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.02 seconds)\n", + "Cbc0010I After 17148000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1313.09 seconds)\n", + "Cbc0010I After 17149000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.16 seconds)\n", + "Cbc0010I After 17150000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1313.25 seconds)\n", + "Cbc0010I After 17151000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1313.32 seconds)\n", + "Cbc0010I After 17152000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1313.40 seconds)\n", + "Cbc0010I After 17153000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1313.45 seconds)\n", + "Cbc0010I After 17154000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.53 seconds)\n", + "Cbc0010I After 17155000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1313.60 seconds)\n", + "Cbc0010I After 17156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1313.68 seconds)\n", + "Cbc0010I After 17157000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1313.76 seconds)\n", + "Cbc0010I After 17158000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1313.84 seconds)\n", + "Cbc0010I After 17159000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1313.91 seconds)\n", + "Cbc0010I After 17160000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1313.99 seconds)\n", + "Cbc0010I After 17161000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1314.06 seconds)\n", + "Cbc0010I After 17162000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1314.14 seconds)\n", + "Cbc0010I After 17163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1314.22 seconds)\n", + "Cbc0010I After 17164000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1314.29 seconds)\n", + "Cbc0010I After 17165000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1314.38 seconds)\n", + "Cbc0010I After 17166000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1314.47 seconds)\n", + "Cbc0010I After 17167000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1314.55 seconds)\n", + "Cbc0010I After 17168000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1314.62 seconds)\n", + "Cbc0010I After 17169000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1314.70 seconds)\n", + "Cbc0010I After 17170000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1314.78 seconds)\n", + "Cbc0010I After 17171000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1314.86 seconds)\n", + "Cbc0010I After 17172000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1314.94 seconds)\n", + "Cbc0010I After 17173000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1315.02 seconds)\n", + "Cbc0010I After 17174000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1315.07 seconds)\n", + "Cbc0010I After 17175000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1315.11 seconds)\n", + "Cbc0010I After 17176000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1315.17 seconds)\n", + "Cbc0010I After 17177000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1315.23 seconds)\n", + "Cbc0010I After 17178000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1315.29 seconds)\n", + "Cbc0010I After 17179000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1315.33 seconds)\n", + "Cbc0010I After 17180000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1315.41 seconds)\n", + "Cbc0010I After 17181000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1315.49 seconds)\n", + "Cbc0010I After 17182000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1315.56 seconds)\n", + "Cbc0010I After 17183000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1315.64 seconds)\n", + "Cbc0010I After 17184000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1315.72 seconds)\n", + "Cbc0010I After 17185000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1315.80 seconds)\n", + "Cbc0010I After 17186000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1315.88 seconds)\n", + "Cbc0010I After 17187000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1315.96 seconds)\n", + "Cbc0010I After 17188000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1316.03 seconds)\n", + "Cbc0010I After 17189000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1316.11 seconds)\n", + "Cbc0010I After 17190000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1316.18 seconds)\n", + "Cbc0010I After 17191000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1316.25 seconds)\n", + "Cbc0010I After 17192000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1316.32 seconds)\n", + "Cbc0010I After 17193000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1316.39 seconds)\n", + "Cbc0010I After 17194000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1316.47 seconds)\n", + "Cbc0010I After 17195000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1316.55 seconds)\n", + "Cbc0010I After 17196000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1316.63 seconds)\n", + "Cbc0010I After 17197000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1316.71 seconds)\n", + "Cbc0010I After 17198000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1316.79 seconds)\n", + "Cbc0010I After 17199000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1316.87 seconds)\n", + "Cbc0010I After 17200000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1316.95 seconds)\n", + "Cbc0010I After 17201000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.01 seconds)\n", + "Cbc0010I After 17202000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1317.04 seconds)\n", + "Cbc0010I After 17203000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1317.07 seconds)\n", + "Cbc0010I After 17204000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1317.11 seconds)\n", + "Cbc0010I After 17205000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.16 seconds)\n", + "Cbc0010I After 17206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1317.19 seconds)\n", + "Cbc0010I After 17207000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.23 seconds)\n", + "Cbc0010I After 17208000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1317.29 seconds)\n", + "Cbc0010I After 17209000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1317.32 seconds)\n", + "Cbc0010I After 17210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1317.36 seconds)\n", + "Cbc0010I After 17211000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1317.41 seconds)\n", + "Cbc0010I After 17212000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1317.45 seconds)\n", + "Cbc0010I After 17213000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1317.48 seconds)\n", + "Cbc0010I After 17214000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1317.51 seconds)\n", + "Cbc0010I After 17215000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1317.54 seconds)\n", + "Cbc0010I After 17216000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1317.58 seconds)\n", + "Cbc0010I After 17217000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1317.63 seconds)\n", + "Cbc0010I After 17218000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.68 seconds)\n", + "Cbc0010I After 17219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1317.73 seconds)\n", + "Cbc0010I After 17220000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.77 seconds)\n", + "Cbc0010I After 17221000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1317.82 seconds)\n", + "Cbc0010I After 17222000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1317.86 seconds)\n", + "Cbc0010I After 17223000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.92 seconds)\n", + "Cbc0010I After 17224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1317.98 seconds)\n", + "Cbc0010I After 17225000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.04 seconds)\n", + "Cbc0010I After 17226000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1318.11 seconds)\n", + "Cbc0010I After 17227000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1318.19 seconds)\n", + "Cbc0010I After 17228000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.23 seconds)\n", + "Cbc0010I After 17229000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1318.28 seconds)\n", + "Cbc0010I After 17230000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1318.32 seconds)\n", + "Cbc0010I After 17231000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1318.37 seconds)\n", + "Cbc0010I After 17232000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1318.44 seconds)\n", + "Cbc0010I After 17233000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1318.48 seconds)\n", + "Cbc0010I After 17234000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.55 seconds)\n", + "Cbc0010I After 17235000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1318.60 seconds)\n", + "Cbc0010I After 17236000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1318.65 seconds)\n", + "Cbc0010I After 17237000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1318.70 seconds)\n", + "Cbc0010I After 17238000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1318.77 seconds)\n", + "Cbc0010I After 17239000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1318.85 seconds)\n", + "Cbc0010I After 17240000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1318.93 seconds)\n", + "Cbc0010I After 17241000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1319.01 seconds)\n", + "Cbc0010I After 17242000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1319.08 seconds)\n", + "Cbc0010I After 17243000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1319.15 seconds)\n", + "Cbc0010I After 17244000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1319.22 seconds)\n", + "Cbc0010I After 17245000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1319.30 seconds)\n", + "Cbc0010I After 17246000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1319.37 seconds)\n", + "Cbc0010I After 17247000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1319.45 seconds)\n", + "Cbc0010I After 17248000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1319.53 seconds)\n", + "Cbc0010I After 17249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1319.62 seconds)\n", + "Cbc0010I After 17250000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1319.70 seconds)\n", + "Cbc0010I After 17251000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1319.78 seconds)\n", + "Cbc0010I After 17252000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1319.85 seconds)\n", + "Cbc0010I After 17253000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1319.91 seconds)\n", + "Cbc0010I After 17254000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1319.99 seconds)\n", + "Cbc0010I After 17255000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1320.05 seconds)\n", + "Cbc0010I After 17256000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1320.12 seconds)\n", + "Cbc0010I After 17257000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1320.19 seconds)\n", + "Cbc0010I After 17258000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1320.27 seconds)\n", + "Cbc0010I After 17259000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1320.33 seconds)\n", + "Cbc0010I After 17260000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1320.41 seconds)\n", + "Cbc0010I After 17261000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1320.49 seconds)\n", + "Cbc0010I After 17262000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1320.56 seconds)\n", + "Cbc0010I After 17263000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1320.64 seconds)\n", + "Cbc0010I After 17264000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1320.71 seconds)\n", + "Cbc0010I After 17265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1320.79 seconds)\n", + "Cbc0010I After 17266000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1320.87 seconds)\n", + "Cbc0010I After 17267000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1320.96 seconds)\n", + "Cbc0010I After 17268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1321.04 seconds)\n", + "Cbc0010I After 17269000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1321.12 seconds)\n", + "Cbc0010I After 17270000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1321.20 seconds)\n", + "Cbc0010I After 17271000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1321.27 seconds)\n", + "Cbc0010I After 17272000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1321.35 seconds)\n", + "Cbc0010I After 17273000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1321.42 seconds)\n", + "Cbc0010I After 17274000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1321.49 seconds)\n", + "Cbc0010I After 17275000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1321.57 seconds)\n", + "Cbc0010I After 17276000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1321.66 seconds)\n", + "Cbc0010I After 17277000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1321.74 seconds)\n", + "Cbc0010I After 17278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1321.82 seconds)\n", + "Cbc0010I After 17279000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1321.90 seconds)\n", + "Cbc0010I After 17280000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1322.03 seconds)\n", + "Cbc0010I After 17281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1322.14 seconds)\n", + "Cbc0010I After 17282000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1322.23 seconds)\n", + "Cbc0010I After 17283000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1322.29 seconds)\n", + "Cbc0010I After 17284000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1322.32 seconds)\n", + "Cbc0010I After 17285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1322.35 seconds)\n", + "Cbc0010I After 17286000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1322.40 seconds)\n", + "Cbc0010I After 17287000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1322.45 seconds)\n", + "Cbc0010I After 17288000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1322.53 seconds)\n", + "Cbc0010I After 17289000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1322.59 seconds)\n", + "Cbc0010I After 17290000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1322.67 seconds)\n", + "Cbc0010I After 17291000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1322.74 seconds)\n", + "Cbc0010I After 17292000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1322.82 seconds)\n", + "Cbc0010I After 17293000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1322.89 seconds)\n", + "Cbc0010I After 17294000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1322.96 seconds)\n", + "Cbc0010I After 17295000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1323.03 seconds)\n", + "Cbc0010I After 17296000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1323.11 seconds)\n", + "Cbc0010I After 17297000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1323.17 seconds)\n", + "Cbc0010I After 17298000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1323.24 seconds)\n", + "Cbc0010I After 17299000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1323.31 seconds)\n", + "Cbc0010I After 17300000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1323.38 seconds)\n", + "Cbc0010I After 17301000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1323.46 seconds)\n", + "Cbc0010I After 17302000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1323.53 seconds)\n", + "Cbc0010I After 17303000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1323.60 seconds)\n", + "Cbc0010I After 17304000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.68 seconds)\n", + "Cbc0010I After 17305000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.75 seconds)\n", + "Cbc0010I After 17306000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1323.82 seconds)\n", + "Cbc0010I After 17307000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1323.87 seconds)\n", + "Cbc0010I After 17308000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1323.92 seconds)\n", + "Cbc0010I After 17309000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1323.96 seconds)\n", + "Cbc0010I After 17310000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.99 seconds)\n", + "Cbc0010I After 17311000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1324.02 seconds)\n", + "Cbc0010I After 17312000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1324.05 seconds)\n", + "Cbc0010I After 17313000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1324.11 seconds)\n", + "Cbc0010I After 17314000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1324.17 seconds)\n", + "Cbc0010I After 17315000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.25 seconds)\n", + "Cbc0010I After 17316000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1324.30 seconds)\n", + "Cbc0010I After 17317000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1324.36 seconds)\n", + "Cbc0010I After 17318000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1324.42 seconds)\n", + "Cbc0010I After 17319000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1324.49 seconds)\n", + "Cbc0010I After 17320000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1324.56 seconds)\n", + "Cbc0010I After 17321000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.64 seconds)\n", + "Cbc0010I After 17322000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1324.72 seconds)\n", + "Cbc0010I After 17323000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1324.80 seconds)\n", + "Cbc0010I After 17324000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1324.89 seconds)\n", + "Cbc0010I After 17325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.97 seconds)\n", + "Cbc0010I After 17326000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1325.05 seconds)\n", + "Cbc0010I After 17327000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1325.13 seconds)\n", + "Cbc0010I After 17328000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1325.20 seconds)\n", + "Cbc0010I After 17329000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1325.28 seconds)\n", + "Cbc0010I After 17330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1325.32 seconds)\n", + "Cbc0010I After 17331000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1325.38 seconds)\n", + "Cbc0010I After 17332000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1325.42 seconds)\n", + "Cbc0010I After 17333000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1325.46 seconds)\n", + "Cbc0010I After 17334000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1325.53 seconds)\n", + "Cbc0010I After 17335000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1325.61 seconds)\n", + "Cbc0010I After 17336000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1325.66 seconds)\n", + "Cbc0010I After 17337000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1325.72 seconds)\n", + "Cbc0010I After 17338000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1325.79 seconds)\n", + "Cbc0010I After 17339000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1325.82 seconds)\n", + "Cbc0010I After 17340000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1325.87 seconds)\n", + "Cbc0010I After 17341000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1325.95 seconds)\n", + "Cbc0010I After 17342000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1325.99 seconds)\n", + "Cbc0010I After 17343000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1326.06 seconds)\n", + "Cbc0010I After 17344000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1326.13 seconds)\n", + "Cbc0010I After 17345000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1326.21 seconds)\n", + "Cbc0010I After 17346000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1326.28 seconds)\n", + "Cbc0010I After 17347000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1326.35 seconds)\n", + "Cbc0010I After 17348000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1326.43 seconds)\n", + "Cbc0010I After 17349000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1326.50 seconds)\n", + "Cbc0010I After 17350000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1326.58 seconds)\n", + "Cbc0010I After 17351000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1326.65 seconds)\n", + "Cbc0010I After 17352000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1326.73 seconds)\n", + "Cbc0010I After 17353000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1326.81 seconds)\n", + "Cbc0010I After 17354000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1326.88 seconds)\n", + "Cbc0010I After 17355000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1326.96 seconds)\n", + "Cbc0010I After 17356000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1327.03 seconds)\n", + "Cbc0010I After 17357000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1327.11 seconds)\n", + "Cbc0010I After 17358000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1327.19 seconds)\n", + "Cbc0010I After 17359000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1327.25 seconds)\n", + "Cbc0010I After 17360000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1327.32 seconds)\n", + "Cbc0010I After 17361000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1327.39 seconds)\n", + "Cbc0010I After 17362000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1327.46 seconds)\n", + "Cbc0010I After 17363000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1327.53 seconds)\n", + "Cbc0010I After 17364000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1327.59 seconds)\n", + "Cbc0010I After 17365000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1327.65 seconds)\n", + "Cbc0010I After 17366000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1327.72 seconds)\n", + "Cbc0010I After 17367000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1327.79 seconds)\n", + "Cbc0010I After 17368000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1327.86 seconds)\n", + "Cbc0010I After 17369000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1327.92 seconds)\n", + "Cbc0010I After 17370000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1327.99 seconds)\n", + "Cbc0010I After 17371000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1328.07 seconds)\n", + "Cbc0010I After 17372000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1328.14 seconds)\n", + "Cbc0010I After 17373000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1328.22 seconds)\n", + "Cbc0010I After 17374000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1328.29 seconds)\n", + "Cbc0010I After 17375000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1328.37 seconds)\n", + "Cbc0010I After 17376000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1328.45 seconds)\n", + "Cbc0010I After 17377000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1328.52 seconds)\n", + "Cbc0010I After 17378000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1328.60 seconds)\n", + "Cbc0010I After 17379000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1328.68 seconds)\n", + "Cbc0010I After 17380000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1328.75 seconds)\n", + "Cbc0010I After 17381000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1328.82 seconds)\n", + "Cbc0010I After 17382000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1328.89 seconds)\n", + "Cbc0010I After 17383000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1328.97 seconds)\n", + "Cbc0010I After 17384000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1329.03 seconds)\n", + "Cbc0010I After 17385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1329.09 seconds)\n", + "Cbc0010I After 17386000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1329.17 seconds)\n", + "Cbc0010I After 17387000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1329.24 seconds)\n", + "Cbc0010I After 17388000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1329.31 seconds)\n", + "Cbc0010I After 17389000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1329.39 seconds)\n", + "Cbc0010I After 17390000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1329.47 seconds)\n", + "Cbc0010I After 17391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1329.54 seconds)\n", + "Cbc0010I After 17392000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1329.61 seconds)\n", + "Cbc0010I After 17393000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1329.68 seconds)\n", + "Cbc0010I After 17394000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1329.76 seconds)\n", + "Cbc0010I After 17395000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1329.83 seconds)\n", + "Cbc0010I After 17396000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1329.90 seconds)\n", + "Cbc0010I After 17397000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1329.97 seconds)\n", + "Cbc0010I After 17398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1330.04 seconds)\n", + "Cbc0010I After 17399000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1330.11 seconds)\n", + "Cbc0010I After 17400000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1330.16 seconds)\n", + "Cbc0010I After 17401000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1330.21 seconds)\n", + "Cbc0010I After 17402000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1330.26 seconds)\n", + "Cbc0010I After 17403000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1330.32 seconds)\n", + "Cbc0010I After 17404000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1330.36 seconds)\n", + "Cbc0010I After 17405000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1330.41 seconds)\n", + "Cbc0010I After 17406000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1330.44 seconds)\n", + "Cbc0010I After 17407000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1330.51 seconds)\n", + "Cbc0010I After 17408000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1330.58 seconds)\n", + "Cbc0010I After 17409000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1330.65 seconds)\n", + "Cbc0010I After 17410000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1330.71 seconds)\n", + "Cbc0010I After 17411000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1330.77 seconds)\n", + "Cbc0010I After 17412000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1330.85 seconds)\n", + "Cbc0010I After 17413000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1330.91 seconds)\n", + "Cbc0010I After 17414000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1330.96 seconds)\n", + "Cbc0010I After 17415000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1331.02 seconds)\n", + "Cbc0010I After 17416000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1331.08 seconds)\n", + "Cbc0010I After 17417000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1331.12 seconds)\n", + "Cbc0010I After 17418000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1331.17 seconds)\n", + "Cbc0010I After 17419000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1331.23 seconds)\n", + "Cbc0010I After 17420000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1331.30 seconds)\n", + "Cbc0010I After 17421000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1331.36 seconds)\n", + "Cbc0010I After 17422000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1331.41 seconds)\n", + "Cbc0010I After 17423000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1331.47 seconds)\n", + "Cbc0010I After 17424000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1331.54 seconds)\n", + "Cbc0010I After 17425000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1331.59 seconds)\n", + "Cbc0010I After 17426000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1331.66 seconds)\n", + "Cbc0010I After 17427000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1331.73 seconds)\n", + "Cbc0010I After 17428000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1331.81 seconds)\n", + "Cbc0010I After 17429000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1331.92 seconds)\n", + "Cbc0010I After 17430000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1332.01 seconds)\n", + "Cbc0010I After 17431000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1332.09 seconds)\n", + "Cbc0010I After 17432000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1332.17 seconds)\n", + "Cbc0010I After 17433000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1332.25 seconds)\n", + "Cbc0010I After 17434000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1332.32 seconds)\n", + "Cbc0010I After 17435000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1332.40 seconds)\n", + "Cbc0010I After 17436000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1332.47 seconds)\n", + "Cbc0010I After 17437000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1332.54 seconds)\n", + "Cbc0010I After 17438000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1332.57 seconds)\n", + "Cbc0010I After 17439000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1332.64 seconds)\n", + "Cbc0010I After 17440000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1332.70 seconds)\n", + "Cbc0010I After 17441000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1332.77 seconds)\n", + "Cbc0010I After 17442000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1332.84 seconds)\n", + "Cbc0010I After 17443000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1332.90 seconds)\n", + "Cbc0010I After 17444000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1332.97 seconds)\n", + "Cbc0010I After 17445000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1333.03 seconds)\n", + "Cbc0010I After 17446000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1333.09 seconds)\n", + "Cbc0010I After 17447000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1333.15 seconds)\n", + "Cbc0010I After 17448000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1333.22 seconds)\n", + "Cbc0010I After 17449000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1333.29 seconds)\n", + "Cbc0010I After 17450000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1333.37 seconds)\n", + "Cbc0010I After 17451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1333.44 seconds)\n", + "Cbc0010I After 17452000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1333.52 seconds)\n", + "Cbc0010I After 17453000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1333.57 seconds)\n", + "Cbc0010I After 17454000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1333.65 seconds)\n", + "Cbc0010I After 17455000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1333.72 seconds)\n", + "Cbc0010I After 17456000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1333.79 seconds)\n", + "Cbc0010I After 17457000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1333.86 seconds)\n", + "Cbc0010I After 17458000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1333.93 seconds)\n", + "Cbc0010I After 17459000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1334.01 seconds)\n", + "Cbc0010I After 17460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1334.06 seconds)\n", + "Cbc0010I After 17461000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1334.11 seconds)\n", + "Cbc0010I After 17462000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1334.17 seconds)\n", + "Cbc0010I After 17463000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1334.24 seconds)\n", + "Cbc0010I After 17464000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1334.32 seconds)\n", + "Cbc0010I After 17465000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1334.38 seconds)\n", + "Cbc0010I After 17466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1334.44 seconds)\n", + "Cbc0010I After 17467000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1334.50 seconds)\n", + "Cbc0010I After 17468000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1334.56 seconds)\n", + "Cbc0010I After 17469000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1334.63 seconds)\n", + "Cbc0010I After 17470000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1334.71 seconds)\n", + "Cbc0010I After 17471000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1334.78 seconds)\n", + "Cbc0010I After 17472000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1334.85 seconds)\n", + "Cbc0010I After 17473000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1334.90 seconds)\n", + "Cbc0010I After 17474000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1334.96 seconds)\n", + "Cbc0010I After 17475000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1335.02 seconds)\n", + "Cbc0010I After 17476000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1335.09 seconds)\n", + "Cbc0010I After 17477000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1335.17 seconds)\n", + "Cbc0010I After 17478000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.25 seconds)\n", + "Cbc0010I After 17479000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1335.33 seconds)\n", + "Cbc0010I After 17480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.41 seconds)\n", + "Cbc0010I After 17481000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1335.49 seconds)\n", + "Cbc0010I After 17482000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1335.57 seconds)\n", + "Cbc0010I After 17483000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1335.64 seconds)\n", + "Cbc0010I After 17484000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1335.72 seconds)\n", + "Cbc0010I After 17485000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1335.80 seconds)\n", + "Cbc0010I After 17486000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1335.88 seconds)\n", + "Cbc0010I After 17487000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.97 seconds)\n", + "Cbc0010I After 17488000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1336.07 seconds)\n", + "Cbc0010I After 17489000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1336.18 seconds)\n", + "Cbc0010I After 17490000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1336.28 seconds)\n", + "Cbc0010I After 17491000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1336.37 seconds)\n", + "Cbc0010I After 17492000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1336.47 seconds)\n", + "Cbc0010I After 17493000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1336.52 seconds)\n", + "Cbc0010I After 17494000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1336.56 seconds)\n", + "Cbc0010I After 17495000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1336.63 seconds)\n", + "Cbc0010I After 17496000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1336.72 seconds)\n", + "Cbc0010I After 17497000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1336.78 seconds)\n", + "Cbc0010I After 17498000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1336.82 seconds)\n", + "Cbc0010I After 17499000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1336.87 seconds)\n", + "Cbc0010I After 17500000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1336.93 seconds)\n", + "Cbc0010I After 17501000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1336.97 seconds)\n", + "Cbc0010I After 17502000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1337.03 seconds)\n", + "Cbc0010I After 17503000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1337.09 seconds)\n", + "Cbc0010I After 17504000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1337.17 seconds)\n", + "Cbc0010I After 17505000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1337.25 seconds)\n", + "Cbc0010I After 17506000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1337.33 seconds)\n", + "Cbc0010I After 17507000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1337.41 seconds)\n", + "Cbc0010I After 17508000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1337.48 seconds)\n", + "Cbc0010I After 17509000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1337.51 seconds)\n", + "Cbc0010I After 17510000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1337.55 seconds)\n", + "Cbc0010I After 17511000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1337.61 seconds)\n", + "Cbc0010I After 17512000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1337.65 seconds)\n", + "Cbc0010I After 17513000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1337.68 seconds)\n", + "Cbc0010I After 17514000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1337.71 seconds)\n", + "Cbc0010I After 17515000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1337.81 seconds)\n", + "Cbc0010I After 17516000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1337.89 seconds)\n", + "Cbc0010I After 17517000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1337.99 seconds)\n", + "Cbc0010I After 17518000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1338.07 seconds)\n", + "Cbc0010I After 17519000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1338.16 seconds)\n", + "Cbc0010I After 17520000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1338.25 seconds)\n", + "Cbc0010I After 17521000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1338.35 seconds)\n", + "Cbc0010I After 17522000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1338.45 seconds)\n", + "Cbc0010I After 17523000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1338.52 seconds)\n", + "Cbc0010I After 17524000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.60 seconds)\n", + "Cbc0010I After 17525000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.66 seconds)\n", + "Cbc0010I After 17526000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1338.74 seconds)\n", + "Cbc0010I After 17527000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1338.81 seconds)\n", + "Cbc0010I After 17528000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.88 seconds)\n", + "Cbc0010I After 17529000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1338.94 seconds)\n", + "Cbc0010I After 17530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1339.00 seconds)\n", + "Cbc0010I After 17531000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1339.11 seconds)\n", + "Cbc0010I After 17532000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1339.20 seconds)\n", + "Cbc0010I After 17533000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1339.29 seconds)\n", + "Cbc0010I After 17534000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1339.37 seconds)\n", + "Cbc0010I After 17535000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1339.45 seconds)\n", + "Cbc0010I After 17536000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1339.53 seconds)\n", + "Cbc0010I After 17537000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1339.61 seconds)\n", + "Cbc0010I After 17538000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1339.69 seconds)\n", + "Cbc0010I After 17539000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1339.73 seconds)\n", + "Cbc0010I After 17540000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1339.76 seconds)\n", + "Cbc0010I After 17541000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1339.79 seconds)\n", + "Cbc0010I After 17542000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1339.85 seconds)\n", + "Cbc0010I After 17543000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1339.91 seconds)\n", + "Cbc0010I After 17544000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1339.97 seconds)\n", + "Cbc0010I After 17545000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1340.03 seconds)\n", + "Cbc0010I After 17546000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1340.08 seconds)\n", + "Cbc0010I After 17547000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1340.12 seconds)\n", + "Cbc0010I After 17548000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1340.15 seconds)\n", + "Cbc0010I After 17549000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1340.20 seconds)\n", + "Cbc0010I After 17550000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1340.28 seconds)\n", + "Cbc0010I After 17551000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1340.35 seconds)\n", + "Cbc0010I After 17552000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1340.43 seconds)\n", + "Cbc0010I After 17553000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1340.49 seconds)\n", + "Cbc0010I After 17554000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1340.53 seconds)\n", + "Cbc0010I After 17555000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1340.61 seconds)\n", + "Cbc0010I After 17556000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1340.67 seconds)\n", + "Cbc0010I After 17557000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1340.74 seconds)\n", + "Cbc0010I After 17558000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1340.81 seconds)\n", + "Cbc0010I After 17559000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1340.89 seconds)\n", + "Cbc0010I After 17560000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1340.96 seconds)\n", + "Cbc0010I After 17561000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1341.04 seconds)\n", + "Cbc0010I After 17562000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1341.12 seconds)\n", + "Cbc0010I After 17563000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1341.19 seconds)\n", + "Cbc0010I After 17564000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1341.27 seconds)\n", + "Cbc0010I After 17565000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1341.35 seconds)\n", + "Cbc0010I After 17566000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1341.43 seconds)\n", + "Cbc0010I After 17567000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1341.50 seconds)\n", + "Cbc0010I After 17568000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1341.58 seconds)\n", + "Cbc0010I After 17569000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1341.66 seconds)\n", + "Cbc0010I After 17570000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1341.71 seconds)\n", + "Cbc0010I After 17571000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1341.77 seconds)\n", + "Cbc0010I After 17572000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1341.82 seconds)\n", + "Cbc0010I After 17573000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1341.89 seconds)\n", + "Cbc0010I After 17574000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1341.92 seconds)\n", + "Cbc0010I After 17575000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1341.96 seconds)\n", + "Cbc0010I After 17576000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1342.01 seconds)\n", + "Cbc0010I After 17577000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1342.07 seconds)\n", + "Cbc0010I After 17578000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1342.13 seconds)\n", + "Cbc0010I After 17579000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1342.16 seconds)\n", + "Cbc0010I After 17580000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1342.22 seconds)\n", + "Cbc0010I After 17581000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1342.29 seconds)\n", + "Cbc0010I After 17582000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1342.37 seconds)\n", + "Cbc0010I After 17583000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1342.45 seconds)\n", + "Cbc0010I After 17584000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1342.52 seconds)\n", + "Cbc0010I After 17585000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1342.61 seconds)\n", + "Cbc0010I After 17586000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1342.67 seconds)\n", + "Cbc0010I After 17587000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1342.75 seconds)\n", + "Cbc0010I After 17588000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1342.81 seconds)\n", + "Cbc0010I After 17589000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1342.89 seconds)\n", + "Cbc0010I After 17590000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1342.96 seconds)\n", + "Cbc0010I After 17591000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1343.02 seconds)\n", + "Cbc0010I After 17592000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1343.09 seconds)\n", + "Cbc0010I After 17593000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1343.12 seconds)\n", + "Cbc0010I After 17594000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1343.20 seconds)\n", + "Cbc0010I After 17595000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1343.28 seconds)\n", + "Cbc0010I After 17596000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1343.35 seconds)\n", + "Cbc0010I After 17597000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1343.41 seconds)\n", + "Cbc0010I After 17598000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1343.48 seconds)\n", + "Cbc0010I After 17599000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1343.55 seconds)\n", + "Cbc0010I After 17600000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1343.62 seconds)\n", + "Cbc0010I After 17601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1343.70 seconds)\n", + "Cbc0010I After 17602000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1343.75 seconds)\n", + "Cbc0010I After 17603000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1343.83 seconds)\n", + "Cbc0010I After 17604000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1343.91 seconds)\n", + "Cbc0010I After 17605000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1343.98 seconds)\n", + "Cbc0010I After 17606000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1344.06 seconds)\n", + "Cbc0010I After 17607000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1344.14 seconds)\n", + "Cbc0010I After 17608000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1344.17 seconds)\n", + "Cbc0010I After 17609000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.23 seconds)\n", + "Cbc0010I After 17610000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1344.28 seconds)\n", + "Cbc0010I After 17611000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1344.35 seconds)\n", + "Cbc0010I After 17612000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1344.43 seconds)\n", + "Cbc0010I After 17613000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.52 seconds)\n", + "Cbc0010I After 17614000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1344.60 seconds)\n", + "Cbc0010I After 17615000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1344.67 seconds)\n", + "Cbc0010I After 17616000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1344.75 seconds)\n", + "Cbc0010I After 17617000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1344.83 seconds)\n", + "Cbc0010I After 17618000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1344.91 seconds)\n", + "Cbc0010I After 17619000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.98 seconds)\n", + "Cbc0010I After 17620000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1345.06 seconds)\n", + "Cbc0010I After 17621000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1345.14 seconds)\n", + "Cbc0010I After 17622000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1345.22 seconds)\n", + "Cbc0010I After 17623000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1345.29 seconds)\n", + "Cbc0010I After 17624000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1345.37 seconds)\n", + "Cbc0010I After 17625000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1345.45 seconds)\n", + "Cbc0010I After 17626000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1345.53 seconds)\n", + "Cbc0010I After 17627000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1345.61 seconds)\n", + "Cbc0010I After 17628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1345.64 seconds)\n", + "Cbc0010I After 17629000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1345.70 seconds)\n", + "Cbc0010I After 17630000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1345.76 seconds)\n", + "Cbc0010I After 17631000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1345.82 seconds)\n", + "Cbc0010I After 17632000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1345.88 seconds)\n", + "Cbc0010I After 17633000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1345.96 seconds)\n", + "Cbc0010I After 17634000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1346.05 seconds)\n", + "Cbc0010I After 17635000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1346.15 seconds)\n", + "Cbc0010I After 17636000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1346.23 seconds)\n", + "Cbc0010I After 17637000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1346.31 seconds)\n", + "Cbc0010I After 17638000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1346.34 seconds)\n", + "Cbc0010I After 17639000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1346.40 seconds)\n", + "Cbc0010I After 17640000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1346.47 seconds)\n", + "Cbc0010I After 17641000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1346.53 seconds)\n", + "Cbc0010I After 17642000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1346.59 seconds)\n", + "Cbc0010I After 17643000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1346.67 seconds)\n", + "Cbc0010I After 17644000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1346.73 seconds)\n", + "Cbc0010I After 17645000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1346.81 seconds)\n", + "Cbc0010I After 17646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1346.89 seconds)\n", + "Cbc0010I After 17647000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1346.97 seconds)\n", + "Cbc0010I After 17648000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1347.04 seconds)\n", + "Cbc0010I After 17649000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1347.12 seconds)\n", + "Cbc0010I After 17650000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1347.19 seconds)\n", + "Cbc0010I After 17651000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1347.27 seconds)\n", + "Cbc0010I After 17652000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1347.33 seconds)\n", + "Cbc0010I After 17653000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1347.36 seconds)\n", + "Cbc0010I After 17654000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1347.39 seconds)\n", + "Cbc0010I After 17655000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1347.43 seconds)\n", + "Cbc0010I After 17656000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1347.50 seconds)\n", + "Cbc0010I After 17657000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1347.56 seconds)\n", + "Cbc0010I After 17658000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1347.63 seconds)\n", + "Cbc0010I After 17659000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1347.69 seconds)\n", + "Cbc0010I After 17660000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1347.74 seconds)\n", + "Cbc0010I After 17661000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1347.81 seconds)\n", + "Cbc0010I After 17662000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1347.87 seconds)\n", + "Cbc0010I After 17663000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1347.90 seconds)\n", + "Cbc0010I After 17664000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1347.93 seconds)\n", + "Cbc0010I After 17665000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1348.00 seconds)\n", + "Cbc0010I After 17666000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1348.07 seconds)\n", + "Cbc0010I After 17667000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1348.15 seconds)\n", + "Cbc0010I After 17668000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1348.23 seconds)\n", + "Cbc0010I After 17669000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1348.31 seconds)\n", + "Cbc0010I After 17670000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1348.39 seconds)\n", + "Cbc0010I After 17671000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1348.45 seconds)\n", + "Cbc0010I After 17672000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1348.52 seconds)\n", + "Cbc0010I After 17673000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1348.60 seconds)\n", + "Cbc0010I After 17674000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1348.67 seconds)\n", + "Cbc0010I After 17675000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1348.75 seconds)\n", + "Cbc0010I After 17676000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1348.80 seconds)\n", + "Cbc0010I After 17677000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1348.86 seconds)\n", + "Cbc0010I After 17678000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1348.90 seconds)\n", + "Cbc0010I After 17679000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1348.94 seconds)\n", + "Cbc0010I After 17680000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1348.99 seconds)\n", + "Cbc0010I After 17681000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1349.05 seconds)\n", + "Cbc0010I After 17682000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1349.11 seconds)\n", + "Cbc0010I After 17683000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1349.14 seconds)\n", + "Cbc0010I After 17684000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1349.20 seconds)\n", + "Cbc0010I After 17685000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1349.23 seconds)\n", + "Cbc0010I After 17686000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1349.28 seconds)\n", + "Cbc0010I After 17687000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1349.35 seconds)\n", + "Cbc0010I After 17688000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1349.42 seconds)\n", + "Cbc0010I After 17689000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1349.49 seconds)\n", + "Cbc0010I After 17690000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1349.57 seconds)\n", + "Cbc0010I After 17691000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1349.65 seconds)\n", + "Cbc0010I After 17692000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1349.72 seconds)\n", + "Cbc0010I After 17693000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1349.80 seconds)\n", + "Cbc0010I After 17694000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1349.87 seconds)\n", + "Cbc0010I After 17695000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1349.94 seconds)\n", + "Cbc0010I After 17696000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1350.01 seconds)\n", + "Cbc0010I After 17697000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1350.08 seconds)\n", + "Cbc0010I After 17698000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1350.16 seconds)\n", + "Cbc0010I After 17699000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1350.22 seconds)\n", + "Cbc0010I After 17700000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1350.27 seconds)\n", + "Cbc0010I After 17701000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1350.34 seconds)\n", + "Cbc0010I After 17702000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1350.38 seconds)\n", + "Cbc0010I After 17703000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1350.46 seconds)\n", + "Cbc0010I After 17704000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1350.53 seconds)\n", + "Cbc0010I After 17705000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1350.58 seconds)\n", + "Cbc0010I After 17706000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1350.65 seconds)\n", + "Cbc0010I After 17707000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1350.72 seconds)\n", + "Cbc0010I After 17708000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1350.78 seconds)\n", + "Cbc0010I After 17709000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1350.85 seconds)\n", + "Cbc0010I After 17710000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1350.91 seconds)\n", + "Cbc0010I After 17711000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1350.98 seconds)\n", + "Cbc0010I After 17712000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1351.05 seconds)\n", + "Cbc0010I After 17713000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1351.10 seconds)\n", + "Cbc0010I After 17714000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1351.16 seconds)\n", + "Cbc0010I After 17715000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1351.23 seconds)\n", + "Cbc0010I After 17716000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1351.32 seconds)\n", + "Cbc0010I After 17717000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1351.39 seconds)\n", + "Cbc0010I After 17718000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1351.47 seconds)\n", + "Cbc0010I After 17719000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1351.55 seconds)\n", + "Cbc0010I After 17720000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1351.63 seconds)\n", + "Cbc0010I After 17721000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1351.69 seconds)\n", + "Cbc0010I After 17722000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1351.77 seconds)\n", + "Cbc0010I After 17723000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1351.85 seconds)\n", + "Cbc0010I After 17724000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1351.93 seconds)\n", + "Cbc0010I After 17725000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1352.00 seconds)\n", + "Cbc0010I After 17726000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1352.04 seconds)\n", + "Cbc0010I After 17727000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1352.10 seconds)\n", + "Cbc0010I After 17728000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1352.14 seconds)\n", + "Cbc0010I After 17729000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1352.18 seconds)\n", + "Cbc0010I After 17730000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1352.22 seconds)\n", + "Cbc0010I After 17731000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1352.28 seconds)\n", + "Cbc0010I After 17732000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1352.33 seconds)\n", + "Cbc0010I After 17733000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1352.36 seconds)\n", + "Cbc0010I After 17734000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.39 seconds)\n", + "Cbc0010I After 17735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1352.43 seconds)\n", + "Cbc0010I After 17736000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1352.49 seconds)\n", + "Cbc0010I After 17737000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.55 seconds)\n", + "Cbc0010I After 17738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1352.59 seconds)\n", + "Cbc0010I After 17739000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1352.65 seconds)\n", + "Cbc0010I After 17740000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1352.73 seconds)\n", + "Cbc0010I After 17741000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.79 seconds)\n", + "Cbc0010I After 17742000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1352.86 seconds)\n", + "Cbc0010I After 17743000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1352.92 seconds)\n", + "Cbc0010I After 17744000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1352.97 seconds)\n", + "Cbc0010I After 17745000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1353.02 seconds)\n", + "Cbc0010I After 17746000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1353.09 seconds)\n", + "Cbc0010I After 17747000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1353.16 seconds)\n", + "Cbc0010I After 17748000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1353.26 seconds)\n", + "Cbc0010I After 17749000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1353.29 seconds)\n", + "Cbc0010I After 17750000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1353.33 seconds)\n", + "Cbc0010I After 17751000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1353.40 seconds)\n", + "Cbc0010I After 17752000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1353.47 seconds)\n", + "Cbc0010I After 17753000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1353.53 seconds)\n", + "Cbc0010I After 17754000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1353.60 seconds)\n", + "Cbc0010I After 17755000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1353.67 seconds)\n", + "Cbc0010I After 17756000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1353.75 seconds)\n", + "Cbc0010I After 17757000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1353.82 seconds)\n", + "Cbc0010I After 17758000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1353.89 seconds)\n", + "Cbc0010I After 17759000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1353.95 seconds)\n", + "Cbc0010I After 17760000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1354.02 seconds)\n", + "Cbc0010I After 17761000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1354.10 seconds)\n", + "Cbc0010I After 17762000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1354.16 seconds)\n", + "Cbc0010I After 17763000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1354.21 seconds)\n", + "Cbc0010I After 17764000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1354.27 seconds)\n", + "Cbc0010I After 17765000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1354.31 seconds)\n", + "Cbc0010I After 17766000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1354.38 seconds)\n", + "Cbc0010I After 17767000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1354.45 seconds)\n", + "Cbc0010I After 17768000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1354.51 seconds)\n", + "Cbc0010I After 17769000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1354.58 seconds)\n", + "Cbc0010I After 17770000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1354.65 seconds)\n", + "Cbc0010I After 17771000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1354.73 seconds)\n", + "Cbc0010I After 17772000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1354.80 seconds)\n", + "Cbc0010I After 17773000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1354.87 seconds)\n", + "Cbc0010I After 17774000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1354.93 seconds)\n", + "Cbc0010I After 17775000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1354.95 seconds)\n", + "Cbc0010I After 17776000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1354.98 seconds)\n", + "Cbc0010I After 17777000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1355.02 seconds)\n", + "Cbc0010I After 17778000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.07 seconds)\n", + "Cbc0010I After 17779000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1355.13 seconds)\n", + "Cbc0010I After 17780000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1355.17 seconds)\n", + "Cbc0010I After 17781000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1355.20 seconds)\n", + "Cbc0010I After 17782000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.29 seconds)\n", + "Cbc0010I After 17783000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1355.38 seconds)\n", + "Cbc0010I After 17784000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1355.45 seconds)\n", + "Cbc0010I After 17785000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1355.53 seconds)\n", + "Cbc0010I After 17786000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1355.60 seconds)\n", + "Cbc0010I After 17787000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1355.66 seconds)\n", + "Cbc0010I After 17788000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.73 seconds)\n", + "Cbc0010I After 17789000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1355.81 seconds)\n", + "Cbc0010I After 17790000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1355.89 seconds)\n", + "Cbc0010I After 17791000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1355.97 seconds)\n", + "Cbc0010I After 17792000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.02 seconds)\n", + "Cbc0010I After 17793000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1356.06 seconds)\n", + "Cbc0010I After 17794000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.12 seconds)\n", + "Cbc0010I After 17795000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1356.19 seconds)\n", + "Cbc0010I After 17796000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1356.27 seconds)\n", + "Cbc0010I After 17797000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1356.32 seconds)\n", + "Cbc0010I After 17798000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1356.38 seconds)\n", + "Cbc0010I After 17799000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.43 seconds)\n", + "Cbc0010I After 17800000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1356.47 seconds)\n", + "Cbc0010I After 17801000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1356.54 seconds)\n", + "Cbc0010I After 17802000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1356.61 seconds)\n", + "Cbc0010I After 17803000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1356.69 seconds)\n", + "Cbc0010I After 17804000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1356.76 seconds)\n", + "Cbc0010I After 17805000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.82 seconds)\n", + "Cbc0010I After 17806000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1356.88 seconds)\n", + "Cbc0010I After 17807000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1356.91 seconds)\n", + "Cbc0010I After 17808000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1356.95 seconds)\n", + "Cbc0010I After 17809000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1356.99 seconds)\n", + "Cbc0010I After 17810000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1357.03 seconds)\n", + "Cbc0010I After 17811000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1357.06 seconds)\n", + "Cbc0010I After 17812000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1357.10 seconds)\n", + "Cbc0010I After 17813000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1357.16 seconds)\n", + "Cbc0010I After 17814000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1357.23 seconds)\n", + "Cbc0010I After 17815000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1357.28 seconds)\n", + "Cbc0010I After 17816000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1357.33 seconds)\n", + "Cbc0010I After 17817000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1357.40 seconds)\n", + "Cbc0010I After 17818000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1357.46 seconds)\n", + "Cbc0010I After 17819000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1357.54 seconds)\n", + "Cbc0010I After 17820000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1357.62 seconds)\n", + "Cbc0010I After 17821000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1357.70 seconds)\n", + "Cbc0010I After 17822000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1357.78 seconds)\n", + "Cbc0010I After 17823000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1357.86 seconds)\n", + "Cbc0010I After 17824000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1357.92 seconds)\n", + "Cbc0010I After 17825000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1357.97 seconds)\n", + "Cbc0010I After 17826000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1358.05 seconds)\n", + "Cbc0010I After 17827000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1358.12 seconds)\n", + "Cbc0010I After 17828000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1358.19 seconds)\n", + "Cbc0010I After 17829000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1358.27 seconds)\n", + "Cbc0010I After 17830000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1358.34 seconds)\n", + "Cbc0010I After 17831000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1358.40 seconds)\n", + "Cbc0010I After 17832000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1358.44 seconds)\n", + "Cbc0010I After 17833000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1358.48 seconds)\n", + "Cbc0010I After 17834000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1358.56 seconds)\n", + "Cbc0010I After 17835000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1358.62 seconds)\n", + "Cbc0010I After 17836000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1358.66 seconds)\n", + "Cbc0010I After 17837000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1358.72 seconds)\n", + "Cbc0010I After 17838000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1358.78 seconds)\n", + "Cbc0010I After 17839000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1358.85 seconds)\n", + "Cbc0010I After 17840000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1358.92 seconds)\n", + "Cbc0010I After 17841000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.00 seconds)\n", + "Cbc0010I After 17842000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1359.08 seconds)\n", + "Cbc0010I After 17843000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1359.19 seconds)\n", + "Cbc0010I After 17844000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1359.29 seconds)\n", + "Cbc0010I After 17845000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1359.37 seconds)\n", + "Cbc0010I After 17846000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1359.42 seconds)\n", + "Cbc0010I After 17847000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1359.47 seconds)\n", + "Cbc0010I After 17848000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1359.51 seconds)\n", + "Cbc0010I After 17849000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1359.58 seconds)\n", + "Cbc0010I After 17850000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1359.65 seconds)\n", + "Cbc0010I After 17851000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1359.70 seconds)\n", + "Cbc0010I After 17852000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1359.74 seconds)\n", + "Cbc0010I After 17853000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.78 seconds)\n", + "Cbc0010I After 17854000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.83 seconds)\n", + "Cbc0010I After 17855000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1359.90 seconds)\n", + "Cbc0010I After 17856000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1359.97 seconds)\n", + "Cbc0010I After 17857000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.03 seconds)\n", + "Cbc0010I After 17858000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1360.09 seconds)\n", + "Cbc0010I After 17859000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.13 seconds)\n", + "Cbc0010I After 17860000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1360.18 seconds)\n", + "Cbc0010I After 17861000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1360.22 seconds)\n", + "Cbc0010I After 17862000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1360.29 seconds)\n", + "Cbc0010I After 17863000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1360.37 seconds)\n", + "Cbc0010I After 17864000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.42 seconds)\n", + "Cbc0010I After 17865000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1360.46 seconds)\n", + "Cbc0010I After 17866000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1360.50 seconds)\n", + "Cbc0010I After 17867000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1360.55 seconds)\n", + "Cbc0010I After 17868000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1360.60 seconds)\n", + "Cbc0010I After 17869000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1360.66 seconds)\n", + "Cbc0010I After 17870000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1360.69 seconds)\n", + "Cbc0010I After 17871000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1360.72 seconds)\n", + "Cbc0010I After 17872000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1360.79 seconds)\n", + "Cbc0010I After 17873000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1360.84 seconds)\n", + "Cbc0010I After 17874000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1360.89 seconds)\n", + "Cbc0010I After 17875000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1360.96 seconds)\n", + "Cbc0010I After 17876000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1361.03 seconds)\n", + "Cbc0010I After 17877000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1361.10 seconds)\n", + "Cbc0010I After 17878000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1361.17 seconds)\n", + "Cbc0010I After 17879000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1361.24 seconds)\n", + "Cbc0010I After 17880000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1361.32 seconds)\n", + "Cbc0010I After 17881000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1361.39 seconds)\n", + "Cbc0010I After 17882000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1361.42 seconds)\n", + "Cbc0010I After 17883000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1361.47 seconds)\n", + "Cbc0010I After 17884000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1361.51 seconds)\n", + "Cbc0010I After 17885000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1361.57 seconds)\n", + "Cbc0010I After 17886000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1361.62 seconds)\n", + "Cbc0010I After 17887000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1361.67 seconds)\n", + "Cbc0010I After 17888000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1361.72 seconds)\n", + "Cbc0010I After 17889000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1361.78 seconds)\n", + "Cbc0010I After 17890000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1361.81 seconds)\n", + "Cbc0010I After 17891000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1361.84 seconds)\n", + "Cbc0010I After 17892000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1361.87 seconds)\n", + "Cbc0010I After 17893000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1361.91 seconds)\n", + "Cbc0010I After 17894000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1361.95 seconds)\n", + "Cbc0010I After 17895000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1361.98 seconds)\n", + "Cbc0010I After 17896000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1362.01 seconds)\n", + "Cbc0010I After 17897000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1362.05 seconds)\n", + "Cbc0010I After 17898000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1362.09 seconds)\n", + "Cbc0010I After 17899000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1362.13 seconds)\n", + "Cbc0010I After 17900000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1362.16 seconds)\n", + "Cbc0010I After 17901000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1362.20 seconds)\n", + "Cbc0010I After 17902000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1362.24 seconds)\n", + "Cbc0010I After 17903000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1362.29 seconds)\n", + "Cbc0010I After 17904000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1362.32 seconds)\n", + "Cbc0010I After 17905000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1362.37 seconds)\n", + "Cbc0010I After 17906000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1362.42 seconds)\n", + "Cbc0010I After 17907000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1362.47 seconds)\n", + "Cbc0010I After 17908000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1362.53 seconds)\n", + "Cbc0010I After 17909000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1362.60 seconds)\n", + "Cbc0010I After 17910000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1362.65 seconds)\n", + "Cbc0010I After 17911000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1362.73 seconds)\n", + "Cbc0010I After 17912000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1362.80 seconds)\n", + "Cbc0010I After 17913000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1362.87 seconds)\n", + "Cbc0010I After 17914000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1362.94 seconds)\n", + "Cbc0010I After 17915000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1363.01 seconds)\n", + "Cbc0010I After 17916000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1363.08 seconds)\n", + "Cbc0010I After 17917000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1363.14 seconds)\n", + "Cbc0010I After 17918000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1363.19 seconds)\n", + "Cbc0010I After 17919000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1363.22 seconds)\n", + "Cbc0010I After 17920000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1363.25 seconds)\n", + "Cbc0010I After 17921000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1363.30 seconds)\n", + "Cbc0010I After 17922000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.37 seconds)\n", + "Cbc0010I After 17923000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1363.42 seconds)\n", + "Cbc0010I After 17924000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.47 seconds)\n", + "Cbc0010I After 17925000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1363.50 seconds)\n", + "Cbc0010I After 17926000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1363.56 seconds)\n", + "Cbc0010I After 17927000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1363.62 seconds)\n", + "Cbc0010I After 17928000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1363.66 seconds)\n", + "Cbc0010I After 17929000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1363.70 seconds)\n", + "Cbc0010I After 17930000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1363.74 seconds)\n", + "Cbc0010I After 17931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1363.78 seconds)\n", + "Cbc0010I After 17932000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1363.83 seconds)\n", + "Cbc0010I After 17933000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.86 seconds)\n", + "Cbc0010I After 17934000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1363.91 seconds)\n", + "Cbc0010I After 17935000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1363.96 seconds)\n", + "Cbc0010I After 17936000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1364.00 seconds)\n", + "Cbc0010I After 17937000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1364.06 seconds)\n", + "Cbc0010I After 17938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1364.11 seconds)\n", + "Cbc0010I After 17939000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1364.17 seconds)\n", + "Cbc0010I After 17940000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1364.25 seconds)\n", + "Cbc0010I After 17941000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1364.31 seconds)\n", + "Cbc0010I After 17942000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1364.36 seconds)\n", + "Cbc0010I After 17943000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1364.40 seconds)\n", + "Cbc0010I After 17944000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1364.44 seconds)\n", + "Cbc0010I After 17945000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1364.50 seconds)\n", + "Cbc0010I After 17946000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1364.53 seconds)\n", + "Cbc0010I After 17947000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1364.58 seconds)\n", + "Cbc0010I After 17948000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1364.62 seconds)\n", + "Cbc0010I After 17949000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1364.66 seconds)\n", + "Cbc0010I After 17950000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1364.75 seconds)\n", + "Cbc0010I After 17951000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1364.80 seconds)\n", + "Cbc0010I After 17952000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1364.85 seconds)\n", + "Cbc0010I After 17953000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1364.89 seconds)\n", + "Cbc0010I After 17954000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1364.93 seconds)\n", + "Cbc0010I After 17955000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1364.97 seconds)\n", + "Cbc0010I After 17956000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1365.00 seconds)\n", + "Cbc0010I After 17957000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1365.04 seconds)\n", + "Cbc0010I After 17958000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1365.09 seconds)\n", + "Cbc0010I After 17959000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1365.15 seconds)\n", + "Cbc0010I After 17960000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1365.21 seconds)\n", + "Cbc0010I After 17961000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1365.28 seconds)\n", + "Cbc0010I After 17962000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1365.35 seconds)\n", + "Cbc0010I After 17963000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.41 seconds)\n", + "Cbc0010I After 17964000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1365.48 seconds)\n", + "Cbc0010I After 17965000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1365.54 seconds)\n", + "Cbc0010I After 17966000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1365.58 seconds)\n", + "Cbc0010I After 17967000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1365.64 seconds)\n", + "Cbc0010I After 17968000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1365.71 seconds)\n", + "Cbc0010I After 17969000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.76 seconds)\n", + "Cbc0010I After 17970000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.82 seconds)\n", + "Cbc0010I After 17971000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1365.87 seconds)\n", + "Cbc0010I After 17972000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1365.90 seconds)\n", + "Cbc0010I After 17973000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1365.94 seconds)\n", + "Cbc0010I After 17974000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1365.98 seconds)\n", + "Cbc0010I After 17975000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1366.02 seconds)\n", + "Cbc0010I After 17976000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1366.08 seconds)\n", + "Cbc0010I After 17977000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1366.12 seconds)\n", + "Cbc0010I After 17978000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1366.16 seconds)\n", + "Cbc0010I After 17979000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1366.23 seconds)\n", + "Cbc0010I After 17980000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1366.29 seconds)\n", + "Cbc0010I After 17981000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1366.36 seconds)\n", + "Cbc0010I After 17982000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1366.43 seconds)\n", + "Cbc0010I After 17983000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1366.50 seconds)\n", + "Cbc0010I After 17984000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1366.56 seconds)\n", + "Cbc0010I After 17985000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1366.62 seconds)\n", + "Cbc0010I After 17986000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1366.67 seconds)\n", + "Cbc0010I After 17987000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1366.72 seconds)\n", + "Cbc0010I After 17988000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1366.79 seconds)\n", + "Cbc0010I After 17989000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1366.84 seconds)\n", + "Cbc0010I After 17990000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1366.88 seconds)\n", + "Cbc0010I After 17991000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1366.94 seconds)\n", + "Cbc0010I After 17992000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1366.99 seconds)\n", + "Cbc0010I After 17993000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1367.05 seconds)\n", + "Cbc0010I After 17994000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.11 seconds)\n", + "Cbc0010I After 17995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1367.17 seconds)\n", + "Cbc0010I After 17996000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.24 seconds)\n", + "Cbc0010I After 17997000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.30 seconds)\n", + "Cbc0010I After 17998000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.35 seconds)\n", + "Cbc0010I After 17999000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1367.42 seconds)\n", + "Cbc0010I After 18000000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1367.47 seconds)\n", + "Cbc0010I After 18001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1367.53 seconds)\n", + "Cbc0010I After 18002000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1367.58 seconds)\n", + "Cbc0010I After 18003000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1367.63 seconds)\n", + "Cbc0010I After 18004000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.68 seconds)\n", + "Cbc0010I After 18005000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1367.73 seconds)\n", + "Cbc0010I After 18006000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1367.80 seconds)\n", + "Cbc0010I After 18007000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.87 seconds)\n", + "Cbc0010I After 18008000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1367.92 seconds)\n", + "Cbc0010I After 18009000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1367.97 seconds)\n", + "Cbc0010I After 18010000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1368.04 seconds)\n", + "Cbc0010I After 18011000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1368.10 seconds)\n", + "Cbc0010I After 18012000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1368.15 seconds)\n", + "Cbc0010I After 18013000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1368.22 seconds)\n", + "Cbc0010I After 18014000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1368.29 seconds)\n", + "Cbc0010I After 18015000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1368.36 seconds)\n", + "Cbc0010I After 18016000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1368.43 seconds)\n", + "Cbc0010I After 18017000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1368.50 seconds)\n", + "Cbc0010I After 18018000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1368.54 seconds)\n", + "Cbc0010I After 18019000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1368.60 seconds)\n", + "Cbc0010I After 18020000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1368.64 seconds)\n", + "Cbc0010I After 18021000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1368.69 seconds)\n", + "Cbc0010I After 18022000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1368.76 seconds)\n", + "Cbc0010I After 18023000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1368.84 seconds)\n", + "Cbc0010I After 18024000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1368.91 seconds)\n", + "Cbc0010I After 18025000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1368.99 seconds)\n", + "Cbc0010I After 18026000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1369.06 seconds)\n", + "Cbc0010I After 18027000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1369.13 seconds)\n", + "Cbc0010I After 18028000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1369.18 seconds)\n", + "Cbc0010I After 18029000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1369.23 seconds)\n", + "Cbc0010I After 18030000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1369.29 seconds)\n", + "Cbc0010I After 18031000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1369.35 seconds)\n", + "Cbc0010I After 18032000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1369.44 seconds)\n", + "Cbc0010I After 18033000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1369.53 seconds)\n", + "Cbc0010I After 18034000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1369.59 seconds)\n", + "Cbc0010I After 18035000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1369.66 seconds)\n", + "Cbc0010I After 18036000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1369.72 seconds)\n", + "Cbc0010I After 18037000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1369.78 seconds)\n", + "Cbc0010I After 18038000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1369.84 seconds)\n", + "Cbc0010I After 18039000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1369.89 seconds)\n", + "Cbc0010I After 18040000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1369.96 seconds)\n", + "Cbc0010I After 18041000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1370.04 seconds)\n", + "Cbc0010I After 18042000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1370.12 seconds)\n", + "Cbc0010I After 18043000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1370.18 seconds)\n", + "Cbc0010I After 18044000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1370.25 seconds)\n", + "Cbc0010I After 18045000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.30 seconds)\n", + "Cbc0010I After 18046000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1370.36 seconds)\n", + "Cbc0010I After 18047000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1370.41 seconds)\n", + "Cbc0010I After 18048000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1370.47 seconds)\n", + "Cbc0010I After 18049000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1370.53 seconds)\n", + "Cbc0010I After 18050000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.59 seconds)\n", + "Cbc0010I After 18051000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1370.65 seconds)\n", + "Cbc0010I After 18052000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1370.72 seconds)\n", + "Cbc0010I After 18053000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1370.79 seconds)\n", + "Cbc0010I After 18054000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.86 seconds)\n", + "Cbc0010I After 18055000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1370.92 seconds)\n", + "Cbc0010I After 18056000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1371.00 seconds)\n", + "Cbc0010I After 18057000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1371.07 seconds)\n", + "Cbc0010I After 18058000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1371.15 seconds)\n", + "Cbc0010I After 18059000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1371.22 seconds)\n", + "Cbc0010I After 18060000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.30 seconds)\n", + "Cbc0010I After 18061000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1371.36 seconds)\n", + "Cbc0010I After 18062000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.42 seconds)\n", + "Cbc0010I After 18063000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1371.49 seconds)\n", + "Cbc0010I After 18064000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1371.53 seconds)\n", + "Cbc0010I After 18065000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1371.58 seconds)\n", + "Cbc0010I After 18066000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.64 seconds)\n", + "Cbc0010I After 18067000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1371.68 seconds)\n", + "Cbc0010I After 18068000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1371.73 seconds)\n", + "Cbc0010I After 18069000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1371.79 seconds)\n", + "Cbc0010I After 18070000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1371.85 seconds)\n", + "Cbc0010I After 18071000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.92 seconds)\n", + "Cbc0010I After 18072000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1371.99 seconds)\n", + "Cbc0010I After 18073000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.07 seconds)\n", + "Cbc0010I After 18074000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1372.16 seconds)\n", + "Cbc0010I After 18075000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1372.24 seconds)\n", + "Cbc0010I After 18076000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.32 seconds)\n", + "Cbc0010I After 18077000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1372.39 seconds)\n", + "Cbc0010I After 18078000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1372.47 seconds)\n", + "Cbc0010I After 18079000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1372.53 seconds)\n", + "Cbc0010I After 18080000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1372.58 seconds)\n", + "Cbc0010I After 18081000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1372.64 seconds)\n", + "Cbc0010I After 18082000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1372.69 seconds)\n", + "Cbc0010I After 18083000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1372.74 seconds)\n", + "Cbc0010I After 18084000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1372.79 seconds)\n", + "Cbc0010I After 18085000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.84 seconds)\n", + "Cbc0010I After 18086000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1372.88 seconds)\n", + "Cbc0010I After 18087000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1372.93 seconds)\n", + "Cbc0010I After 18088000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1372.97 seconds)\n", + "Cbc0010I After 18089000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1373.02 seconds)\n", + "Cbc0010I After 18090000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1373.08 seconds)\n", + "Cbc0010I After 18091000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1373.15 seconds)\n", + "Cbc0010I After 18092000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1373.21 seconds)\n", + "Cbc0010I After 18093000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1373.29 seconds)\n", + "Cbc0010I After 18094000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1373.35 seconds)\n", + "Cbc0010I After 18095000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1373.42 seconds)\n", + "Cbc0010I After 18096000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1373.48 seconds)\n", + "Cbc0010I After 18097000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1373.55 seconds)\n", + "Cbc0010I After 18098000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1373.62 seconds)\n", + "Cbc0010I After 18099000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1373.68 seconds)\n", + "Cbc0010I After 18100000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1373.74 seconds)\n", + "Cbc0010I After 18101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1373.78 seconds)\n", + "Cbc0010I After 18102000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1373.83 seconds)\n", + "Cbc0010I After 18103000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1373.87 seconds)\n", + "Cbc0010I After 18104000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1373.92 seconds)\n", + "Cbc0010I After 18105000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1374.00 seconds)\n", + "Cbc0010I After 18106000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1374.07 seconds)\n", + "Cbc0010I After 18107000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1374.13 seconds)\n", + "Cbc0010I After 18108000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1374.18 seconds)\n", + "Cbc0010I After 18109000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1374.23 seconds)\n", + "Cbc0010I After 18110000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1374.29 seconds)\n", + "Cbc0010I After 18111000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1374.34 seconds)\n", + "Cbc0010I After 18112000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1374.40 seconds)\n", + "Cbc0010I After 18113000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.46 seconds)\n", + "Cbc0010I After 18114000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.52 seconds)\n", + "Cbc0010I After 18115000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1374.57 seconds)\n", + "Cbc0010I After 18116000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1374.63 seconds)\n", + "Cbc0010I After 18117000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1374.69 seconds)\n", + "Cbc0010I After 18118000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1374.75 seconds)\n", + "Cbc0010I After 18119000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.80 seconds)\n", + "Cbc0010I After 18120000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1374.86 seconds)\n", + "Cbc0010I After 18121000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1374.91 seconds)\n", + "Cbc0010I After 18122000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1374.97 seconds)\n", + "Cbc0010I After 18123000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1375.04 seconds)\n", + "Cbc0010I After 18124000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.10 seconds)\n", + "Cbc0010I After 18125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.16 seconds)\n", + "Cbc0010I After 18126000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.22 seconds)\n", + "Cbc0010I After 18127000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1375.28 seconds)\n", + "Cbc0010I After 18128000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1375.33 seconds)\n", + "Cbc0010I After 18129000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1375.40 seconds)\n", + "Cbc0010I After 18130000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1375.46 seconds)\n", + "Cbc0010I After 18131000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1375.52 seconds)\n", + "Cbc0010I After 18132000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1375.58 seconds)\n", + "Cbc0010I After 18133000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1375.64 seconds)\n", + "Cbc0010I After 18134000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1375.70 seconds)\n", + "Cbc0010I After 18135000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1375.75 seconds)\n", + "Cbc0010I After 18136000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1375.81 seconds)\n", + "Cbc0010I After 18137000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1375.87 seconds)\n", + "Cbc0010I After 18138000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1375.93 seconds)\n", + "Cbc0010I After 18139000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1376.00 seconds)\n", + "Cbc0010I After 18140000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1376.06 seconds)\n", + "Cbc0010I After 18141000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1376.11 seconds)\n", + "Cbc0010I After 18142000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.17 seconds)\n", + "Cbc0010I After 18143000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1376.23 seconds)\n", + "Cbc0010I After 18144000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.30 seconds)\n", + "Cbc0010I After 18145000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1376.35 seconds)\n", + "Cbc0010I After 18146000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.41 seconds)\n", + "Cbc0010I After 18147000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1376.47 seconds)\n", + "Cbc0010I After 18148000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.53 seconds)\n", + "Cbc0010I After 18149000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.60 seconds)\n", + "Cbc0010I After 18150000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1376.65 seconds)\n", + "Cbc0010I After 18151000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1376.71 seconds)\n", + "Cbc0010I After 18152000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1376.76 seconds)\n", + "Cbc0010I After 18153000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1376.81 seconds)\n", + "Cbc0010I After 18154000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1376.87 seconds)\n", + "Cbc0010I After 18155000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1376.91 seconds)\n", + "Cbc0010I After 18156000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.96 seconds)\n", + "Cbc0010I After 18157000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1377.02 seconds)\n", + "Cbc0010I After 18158000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1377.10 seconds)\n", + "Cbc0010I After 18159000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1377.16 seconds)\n", + "Cbc0010I After 18160000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1377.22 seconds)\n", + "Cbc0010I After 18161000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1377.28 seconds)\n", + "Cbc0010I After 18162000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1377.35 seconds)\n", + "Cbc0010I After 18163000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1377.41 seconds)\n", + "Cbc0010I After 18164000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1377.48 seconds)\n", + "Cbc0010I After 18165000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1377.53 seconds)\n", + "Cbc0010I After 18166000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1377.60 seconds)\n", + "Cbc0010I After 18167000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.66 seconds)\n", + "Cbc0010I After 18168000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.72 seconds)\n", + "Cbc0010I After 18169000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1377.78 seconds)\n", + "Cbc0010I After 18170000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1377.84 seconds)\n", + "Cbc0010I After 18171000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.89 seconds)\n", + "Cbc0010I After 18172000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1377.96 seconds)\n", + "Cbc0010I After 18173000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1378.02 seconds)\n", + "Cbc0010I After 18174000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1378.09 seconds)\n", + "Cbc0010I After 18175000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1378.15 seconds)\n", + "Cbc0010I After 18176000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1378.22 seconds)\n", + "Cbc0010I After 18177000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1378.28 seconds)\n", + "Cbc0010I After 18178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1378.34 seconds)\n", + "Cbc0010I After 18179000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1378.40 seconds)\n", + "Cbc0010I After 18180000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.46 seconds)\n", + "Cbc0010I After 18181000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1378.51 seconds)\n", + "Cbc0010I After 18182000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1378.58 seconds)\n", + "Cbc0010I After 18183000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.63 seconds)\n", + "Cbc0010I After 18184000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1378.70 seconds)\n", + "Cbc0010I After 18185000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1378.76 seconds)\n", + "Cbc0010I After 18186000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1378.82 seconds)\n", + "Cbc0010I After 18187000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.88 seconds)\n", + "Cbc0010I After 18188000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1378.95 seconds)\n", + "Cbc0010I After 18189000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1379.00 seconds)\n", + "Cbc0010I After 18190000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1379.07 seconds)\n", + "Cbc0010I After 18191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1379.13 seconds)\n", + "Cbc0010I After 18192000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1379.20 seconds)\n", + "Cbc0010I After 18193000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1379.26 seconds)\n", + "Cbc0010I After 18194000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1379.33 seconds)\n", + "Cbc0010I After 18195000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1379.39 seconds)\n", + "Cbc0010I After 18196000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1379.45 seconds)\n", + "Cbc0010I After 18197000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1379.51 seconds)\n", + "Cbc0010I After 18198000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1379.58 seconds)\n", + "Cbc0010I After 18199000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1379.65 seconds)\n", + "Cbc0010I After 18200000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1379.70 seconds)\n", + "Cbc0010I After 18201000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1379.77 seconds)\n", + "Cbc0010I After 18202000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1379.82 seconds)\n", + "Cbc0010I After 18203000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1379.90 seconds)\n", + "Cbc0010I After 18204000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1379.95 seconds)\n", + "Cbc0010I After 18205000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1380.02 seconds)\n", + "Cbc0010I After 18206000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1380.10 seconds)\n", + "Cbc0010I After 18207000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1380.15 seconds)\n", + "Cbc0010I After 18208000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1380.21 seconds)\n", + "Cbc0010I After 18209000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1380.28 seconds)\n", + "Cbc0010I After 18210000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1380.34 seconds)\n", + "Cbc0010I After 18211000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1380.42 seconds)\n", + "Cbc0010I After 18212000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1380.48 seconds)\n", + "Cbc0010I After 18213000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1380.55 seconds)\n", + "Cbc0010I After 18214000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1380.60 seconds)\n", + "Cbc0010I After 18215000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1380.67 seconds)\n", + "Cbc0010I After 18216000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1380.73 seconds)\n", + "Cbc0010I After 18217000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1380.79 seconds)\n", + "Cbc0010I After 18218000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1380.86 seconds)\n", + "Cbc0010I After 18219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1380.93 seconds)\n", + "Cbc0010I After 18220000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1381.03 seconds)\n", + "Cbc0010I After 18221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1381.10 seconds)\n", + "Cbc0010I After 18222000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1381.16 seconds)\n", + "Cbc0010I After 18223000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1381.22 seconds)\n", + "Cbc0010I After 18224000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1381.28 seconds)\n", + "Cbc0010I After 18225000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1381.35 seconds)\n", + "Cbc0010I After 18226000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1381.42 seconds)\n", + "Cbc0010I After 18227000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1381.47 seconds)\n", + "Cbc0010I After 18228000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1381.52 seconds)\n", + "Cbc0010I After 18229000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1381.59 seconds)\n", + "Cbc0010I After 18230000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1381.64 seconds)\n", + "Cbc0010I After 18231000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1381.70 seconds)\n", + "Cbc0010I After 18232000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1381.75 seconds)\n", + "Cbc0010I After 18233000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1381.82 seconds)\n", + "Cbc0010I After 18234000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1381.88 seconds)\n", + "Cbc0010I After 18235000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1381.94 seconds)\n", + "Cbc0010I After 18236000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1382.00 seconds)\n", + "Cbc0010I After 18237000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1382.07 seconds)\n", + "Cbc0010I After 18238000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1382.14 seconds)\n", + "Cbc0010I After 18239000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1382.19 seconds)\n", + "Cbc0010I After 18240000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1382.25 seconds)\n", + "Cbc0010I After 18241000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1382.32 seconds)\n", + "Cbc0010I After 18242000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1382.39 seconds)\n", + "Cbc0010I After 18243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1382.46 seconds)\n", + "Cbc0010I After 18244000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1382.56 seconds)\n", + "Cbc0010I After 18245000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1382.65 seconds)\n", + "Cbc0010I After 18246000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1382.71 seconds)\n", + "Cbc0010I After 18247000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1382.78 seconds)\n", + "Cbc0010I After 18248000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1382.84 seconds)\n", + "Cbc0010I After 18249000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1382.91 seconds)\n", + "Cbc0010I After 18250000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1382.97 seconds)\n", + "Cbc0010I After 18251000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1383.04 seconds)\n", + "Cbc0010I After 18252000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1383.10 seconds)\n", + "Cbc0010I After 18253000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1383.16 seconds)\n", + "Cbc0010I After 18254000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1383.22 seconds)\n", + "Cbc0010I After 18255000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1383.29 seconds)\n", + "Cbc0010I After 18256000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1383.34 seconds)\n", + "Cbc0010I After 18257000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1383.41 seconds)\n", + "Cbc0010I After 18258000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1383.46 seconds)\n", + "Cbc0010I After 18259000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1383.55 seconds)\n", + "Cbc0010I After 18260000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1383.61 seconds)\n", + "Cbc0010I After 18261000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1383.66 seconds)\n", + "Cbc0010I After 18262000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1383.73 seconds)\n", + "Cbc0010I After 18263000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1383.78 seconds)\n", + "Cbc0010I After 18264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1383.84 seconds)\n", + "Cbc0010I After 18265000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1383.92 seconds)\n", + "Cbc0010I After 18266000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1383.97 seconds)\n", + "Cbc0010I After 18267000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1384.03 seconds)\n", + "Cbc0010I After 18268000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1384.10 seconds)\n", + "Cbc0010I After 18269000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1384.15 seconds)\n", + "Cbc0010I After 18270000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1384.21 seconds)\n", + "Cbc0010I After 18271000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1384.27 seconds)\n", + "Cbc0010I After 18272000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1384.35 seconds)\n", + "Cbc0010I After 18273000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1384.41 seconds)\n", + "Cbc0010I After 18274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1384.47 seconds)\n", + "Cbc0010I After 18275000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1384.53 seconds)\n", + "Cbc0010I After 18276000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1384.58 seconds)\n", + "Cbc0010I After 18277000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1384.65 seconds)\n", + "Cbc0010I After 18278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1384.71 seconds)\n", + "Cbc0010I After 18279000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1384.77 seconds)\n", + "Cbc0010I After 18280000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1384.84 seconds)\n", + "Cbc0010I After 18281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1384.89 seconds)\n", + "Cbc0010I After 18282000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1384.95 seconds)\n", + "Cbc0010I After 18283000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1385.02 seconds)\n", + "Cbc0010I After 18284000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1385.08 seconds)\n", + "Cbc0010I After 18285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1385.15 seconds)\n", + "Cbc0010I After 18286000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1385.20 seconds)\n", + "Cbc0010I After 18287000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1385.28 seconds)\n", + "Cbc0010I After 18288000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1385.34 seconds)\n", + "Cbc0010I After 18289000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1385.39 seconds)\n", + "Cbc0010I After 18290000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1385.47 seconds)\n", + "Cbc0010I After 18291000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1385.53 seconds)\n", + "Cbc0010I After 18292000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.58 seconds)\n", + "Cbc0010I After 18293000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1385.65 seconds)\n", + "Cbc0010I After 18294000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.71 seconds)\n", + "Cbc0010I After 18295000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.76 seconds)\n", + "Cbc0010I After 18296000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1385.83 seconds)\n", + "Cbc0010I After 18297000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1385.90 seconds)\n", + "Cbc0010I After 18298000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1385.95 seconds)\n", + "Cbc0010I After 18299000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1386.01 seconds)\n", + "Cbc0010I After 18300000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1386.08 seconds)\n", + "Cbc0010I After 18301000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1386.13 seconds)\n", + "Cbc0010I After 18302000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1386.20 seconds)\n", + "Cbc0010I After 18303000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1386.27 seconds)\n", + "Cbc0010I After 18304000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1386.37 seconds)\n", + "Cbc0010I After 18305000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1386.45 seconds)\n", + "Cbc0010I After 18306000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1386.54 seconds)\n", + "Cbc0010I After 18307000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1386.60 seconds)\n", + "Cbc0010I After 18308000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1386.68 seconds)\n", + "Cbc0010I After 18309000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1386.76 seconds)\n", + "Cbc0010I After 18310000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1386.83 seconds)\n", + "Cbc0010I After 18311000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1386.91 seconds)\n", + "Cbc0010I After 18312000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1386.98 seconds)\n", + "Cbc0010I After 18313000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1387.05 seconds)\n", + "Cbc0010I After 18314000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1387.13 seconds)\n", + "Cbc0010I After 18315000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.21 seconds)\n", + "Cbc0010I After 18316000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1387.28 seconds)\n", + "Cbc0010I After 18317000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.35 seconds)\n", + "Cbc0010I After 18318000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1387.43 seconds)\n", + "Cbc0010I After 18319000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1387.51 seconds)\n", + "Cbc0010I After 18320000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.59 seconds)\n", + "Cbc0010I After 18321000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1387.66 seconds)\n", + "Cbc0010I After 18322000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1387.74 seconds)\n", + "Cbc0010I After 18323000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.81 seconds)\n", + "Cbc0010I After 18324000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1387.89 seconds)\n", + "Cbc0010I After 18325000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1387.97 seconds)\n", + "Cbc0010I After 18326000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1388.04 seconds)\n", + "Cbc0010I After 18327000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1388.12 seconds)\n", + "Cbc0010I After 18328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1388.20 seconds)\n", + "Cbc0010I After 18329000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1388.27 seconds)\n", + "Cbc0010I After 18330000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1388.35 seconds)\n", + "Cbc0010I After 18331000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1388.42 seconds)\n", + "Cbc0010I After 18332000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1388.50 seconds)\n", + "Cbc0010I After 18333000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1388.59 seconds)\n", + "Cbc0010I After 18334000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1388.66 seconds)\n", + "Cbc0010I After 18335000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1388.74 seconds)\n", + "Cbc0010I After 18336000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1388.79 seconds)\n", + "Cbc0010I After 18337000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1388.85 seconds)\n", + "Cbc0010I After 18338000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1388.90 seconds)\n", + "Cbc0010I After 18339000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1388.94 seconds)\n", + "Cbc0010I After 18340000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1388.98 seconds)\n", + "Cbc0010I After 18341000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1389.02 seconds)\n", + "Cbc0010I After 18342000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1389.07 seconds)\n", + "Cbc0010I After 18343000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1389.13 seconds)\n", + "Cbc0010I After 18344000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1389.19 seconds)\n", + "Cbc0010I After 18345000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1389.24 seconds)\n", + "Cbc0010I After 18346000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.29 seconds)\n", + "Cbc0010I After 18347000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1389.34 seconds)\n", + "Cbc0010I After 18348000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1389.39 seconds)\n", + "Cbc0010I After 18349000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1389.44 seconds)\n", + "Cbc0010I After 18350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.50 seconds)\n", + "Cbc0010I After 18351000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.55 seconds)\n", + "Cbc0010I After 18352000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1389.60 seconds)\n", + "Cbc0010I After 18353000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1389.64 seconds)\n", + "Cbc0010I After 18354000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1389.69 seconds)\n", + "Cbc0010I After 18355000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1389.74 seconds)\n", + "Cbc0010I After 18356000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1389.78 seconds)\n", + "Cbc0010I After 18357000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.83 seconds)\n", + "Cbc0010I After 18358000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1389.88 seconds)\n", + "Cbc0010I After 18359000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.93 seconds)\n", + "Cbc0010I After 18360000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1389.98 seconds)\n", + "Cbc0010I After 18361000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1390.03 seconds)\n", + "Cbc0010I After 18362000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1390.08 seconds)\n", + "Cbc0010I After 18363000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1390.13 seconds)\n", + "Cbc0010I After 18364000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1390.18 seconds)\n", + "Cbc0010I After 18365000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1390.25 seconds)\n", + "Cbc0010I After 18366000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1390.30 seconds)\n", + "Cbc0010I After 18367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1390.38 seconds)\n", + "Cbc0010I After 18368000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1390.44 seconds)\n", + "Cbc0010I After 18369000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1390.50 seconds)\n", + "Cbc0010I After 18370000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1390.57 seconds)\n", + "Cbc0010I After 18371000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1390.64 seconds)\n", + "Cbc0010I After 18372000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1390.71 seconds)\n", + "Cbc0010I After 18373000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1390.77 seconds)\n", + "Cbc0010I After 18374000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1390.84 seconds)\n", + "Cbc0010I After 18375000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1390.92 seconds)\n", + "Cbc0010I After 18376000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1390.98 seconds)\n", + "Cbc0010I After 18377000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1391.05 seconds)\n", + "Cbc0010I After 18378000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1391.11 seconds)\n", + "Cbc0010I After 18379000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1391.17 seconds)\n", + "Cbc0010I After 18380000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1391.24 seconds)\n", + "Cbc0010I After 18381000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1391.30 seconds)\n", + "Cbc0010I After 18382000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1391.36 seconds)\n", + "Cbc0010I After 18383000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1391.44 seconds)\n", + "Cbc0010I After 18384000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1391.50 seconds)\n", + "Cbc0010I After 18385000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1391.56 seconds)\n", + "Cbc0010I After 18386000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1391.64 seconds)\n", + "Cbc0010I After 18387000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1391.69 seconds)\n", + "Cbc0010I After 18388000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1391.78 seconds)\n", + "Cbc0010I After 18389000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1391.85 seconds)\n", + "Cbc0010I After 18390000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1391.92 seconds)\n", + "Cbc0010I After 18391000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1391.97 seconds)\n", + "Cbc0010I After 18392000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1392.04 seconds)\n", + "Cbc0010I After 18393000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1392.09 seconds)\n", + "Cbc0010I After 18394000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1392.15 seconds)\n", + "Cbc0010I After 18395000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1392.21 seconds)\n", + "Cbc0010I After 18396000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1392.27 seconds)\n", + "Cbc0010I After 18397000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1392.34 seconds)\n", + "Cbc0010I After 18398000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.40 seconds)\n", + "Cbc0010I After 18399000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1392.46 seconds)\n", + "Cbc0010I After 18400000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.54 seconds)\n", + "Cbc0010I After 18401000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1392.60 seconds)\n", + "Cbc0010I After 18402000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1392.66 seconds)\n", + "Cbc0010I After 18403000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.74 seconds)\n", + "Cbc0010I After 18404000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1392.79 seconds)\n", + "Cbc0010I After 18405000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1392.86 seconds)\n", + "Cbc0010I After 18406000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1392.92 seconds)\n", + "Cbc0010I After 18407000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1392.99 seconds)\n", + "Cbc0010I After 18408000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1393.07 seconds)\n", + "Cbc0010I After 18409000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1393.12 seconds)\n", + "Cbc0010I After 18410000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1393.17 seconds)\n", + "Cbc0010I After 18411000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1393.24 seconds)\n", + "Cbc0010I After 18412000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1393.32 seconds)\n", + "Cbc0010I After 18413000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1393.37 seconds)\n", + "Cbc0010I After 18414000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1393.44 seconds)\n", + "Cbc0010I After 18415000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1393.49 seconds)\n", + "Cbc0010I After 18416000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1393.55 seconds)\n", + "Cbc0010I After 18417000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1393.60 seconds)\n", + "Cbc0010I After 18418000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1393.64 seconds)\n", + "Cbc0010I After 18419000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1393.70 seconds)\n", + "Cbc0010I After 18420000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1393.75 seconds)\n", + "Cbc0010I After 18421000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1393.81 seconds)\n", + "Cbc0010I After 18422000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1393.89 seconds)\n", + "Cbc0010I After 18423000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1393.96 seconds)\n", + "Cbc0010I After 18424000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1394.04 seconds)\n", + "Cbc0010I After 18425000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1394.11 seconds)\n", + "Cbc0010I After 18426000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1394.17 seconds)\n", + "Cbc0010I After 18427000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1394.25 seconds)\n", + "Cbc0010I After 18428000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1394.30 seconds)\n", + "Cbc0010I After 18429000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1394.37 seconds)\n", + "Cbc0010I After 18430000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1394.43 seconds)\n", + "Cbc0010I After 18431000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1394.49 seconds)\n", + "Cbc0010I After 18432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1394.56 seconds)\n", + "Cbc0010I After 18433000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1394.62 seconds)\n", + "Cbc0010I After 18434000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1394.67 seconds)\n", + "Cbc0010I After 18435000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1394.75 seconds)\n", + "Cbc0010I After 18436000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1394.81 seconds)\n", + "Cbc0010I After 18437000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1394.86 seconds)\n", + "Cbc0010I After 18438000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1394.93 seconds)\n", + "Cbc0010I After 18439000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1395.00 seconds)\n", + "Cbc0010I After 18440000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1395.05 seconds)\n", + "Cbc0010I After 18441000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1395.14 seconds)\n", + "Cbc0010I After 18442000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1395.21 seconds)\n", + "Cbc0010I After 18443000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1395.26 seconds)\n", + "Cbc0010I After 18444000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1395.34 seconds)\n", + "Cbc0010I After 18445000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1395.42 seconds)\n", + "Cbc0010I After 18446000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1395.47 seconds)\n", + "Cbc0010I After 18447000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1395.54 seconds)\n", + "Cbc0010I After 18448000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1395.61 seconds)\n", + "Cbc0010I After 18449000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1395.66 seconds)\n", + "Cbc0010I After 18450000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1395.72 seconds)\n", + "Cbc0010I After 18451000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1395.78 seconds)\n", + "Cbc0010I After 18452000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1395.85 seconds)\n", + "Cbc0010I After 18453000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1395.92 seconds)\n", + "Cbc0010I After 18454000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1396.02 seconds)\n", + "Cbc0010I After 18455000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1396.10 seconds)\n", + "Cbc0010I After 18456000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1396.18 seconds)\n", + "Cbc0010I After 18457000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1396.23 seconds)\n", + "Cbc0010I After 18458000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1396.30 seconds)\n", + "Cbc0010I After 18459000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1396.38 seconds)\n", + "Cbc0010I After 18460000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1396.46 seconds)\n", + "Cbc0010I After 18461000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1396.53 seconds)\n", + "Cbc0010I After 18462000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1396.59 seconds)\n", + "Cbc0010I After 18463000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1396.66 seconds)\n", + "Cbc0010I After 18464000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1396.73 seconds)\n", + "Cbc0010I After 18465000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1396.80 seconds)\n", + "Cbc0010I After 18466000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1396.86 seconds)\n", + "Cbc0010I After 18467000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1396.94 seconds)\n", + "Cbc0010I After 18468000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1397.01 seconds)\n", + "Cbc0010I After 18469000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1397.08 seconds)\n", + "Cbc0010I After 18470000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1397.15 seconds)\n", + "Cbc0010I After 18471000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1397.22 seconds)\n", + "Cbc0010I After 18472000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1397.29 seconds)\n", + "Cbc0010I After 18473000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1397.37 seconds)\n", + "Cbc0010I After 18474000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1397.46 seconds)\n", + "Cbc0010I After 18475000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1397.52 seconds)\n", + "Cbc0010I After 18476000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1397.59 seconds)\n", + "Cbc0010I After 18477000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1397.66 seconds)\n", + "Cbc0010I After 18478000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1397.74 seconds)\n", + "Cbc0010I After 18479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1397.82 seconds)\n", + "Cbc0010I After 18480000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1397.89 seconds)\n", + "Cbc0010I After 18481000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1397.97 seconds)\n", + "Cbc0010I After 18482000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1398.04 seconds)\n", + "Cbc0010I After 18483000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1398.10 seconds)\n", + "Cbc0010I After 18484000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1398.18 seconds)\n", + "Cbc0010I After 18485000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1398.26 seconds)\n", + "Cbc0010I After 18486000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1398.34 seconds)\n", + "Cbc0010I After 18487000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1398.40 seconds)\n", + "Cbc0010I After 18488000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1398.47 seconds)\n", + "Cbc0010I After 18489000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1398.54 seconds)\n", + "Cbc0010I After 18490000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1398.61 seconds)\n", + "Cbc0010I After 18491000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1398.68 seconds)\n", + "Cbc0010I After 18492000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1398.77 seconds)\n", + "Cbc0010I After 18493000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1398.84 seconds)\n", + "Cbc0010I After 18494000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1398.92 seconds)\n", + "Cbc0010I After 18495000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1398.99 seconds)\n", + "Cbc0010I After 18496000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1399.07 seconds)\n", + "Cbc0010I After 18497000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1399.15 seconds)\n", + "Cbc0010I After 18498000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1399.23 seconds)\n", + "Cbc0010I After 18499000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1399.30 seconds)\n", + "Cbc0010I After 18500000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1399.37 seconds)\n", + "Cbc0010I After 18501000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1399.44 seconds)\n", + "Cbc0010I After 18502000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1399.52 seconds)\n", + "Cbc0010I After 18503000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1399.59 seconds)\n", + "Cbc0010I After 18504000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1399.66 seconds)\n", + "Cbc0010I After 18505000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1399.72 seconds)\n", + "Cbc0010I After 18506000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1399.79 seconds)\n", + "Cbc0010I After 18507000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1399.86 seconds)\n", + "Cbc0010I After 18508000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1399.93 seconds)\n", + "Cbc0010I After 18509000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1400.01 seconds)\n", + "Cbc0010I After 18510000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1400.07 seconds)\n", + "Cbc0010I After 18511000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1400.13 seconds)\n", + "Cbc0010I After 18512000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1400.19 seconds)\n", + "Cbc0010I After 18513000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1400.25 seconds)\n", + "Cbc0010I After 18514000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1400.32 seconds)\n", + "Cbc0010I After 18515000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1400.38 seconds)\n", + "Cbc0010I After 18516000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1400.45 seconds)\n", + "Cbc0010I After 18517000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1400.51 seconds)\n", + "Cbc0010I After 18518000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1400.58 seconds)\n", + "Cbc0010I After 18519000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1400.63 seconds)\n", + "Cbc0010I After 18520000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1400.70 seconds)\n", + "Cbc0010I After 18521000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1400.77 seconds)\n", + "Cbc0010I After 18522000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1400.82 seconds)\n", + "Cbc0010I After 18523000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1400.88 seconds)\n", + "Cbc0010I After 18524000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1400.95 seconds)\n", + "Cbc0010I After 18525000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1401.01 seconds)\n", + "Cbc0010I After 18526000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1401.08 seconds)\n", + "Cbc0010I After 18527000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1401.15 seconds)\n", + "Cbc0010I After 18528000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1401.22 seconds)\n", + "Cbc0010I After 18529000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1401.28 seconds)\n", + "Cbc0010I After 18530000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1401.35 seconds)\n", + "Cbc0010I After 18531000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1401.40 seconds)\n", + "Cbc0010I After 18532000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1401.46 seconds)\n", + "Cbc0010I After 18533000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1401.51 seconds)\n", + "Cbc0010I After 18534000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1401.56 seconds)\n", + "Cbc0010I After 18535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1401.62 seconds)\n", + "Cbc0010I After 18536000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1401.67 seconds)\n", + "Cbc0010I After 18537000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1401.72 seconds)\n", + "Cbc0010I After 18538000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1401.77 seconds)\n", + "Cbc0010I After 18539000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1401.82 seconds)\n", + "Cbc0010I After 18540000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1401.90 seconds)\n", + "Cbc0010I After 18541000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1401.96 seconds)\n", + "Cbc0010I After 18542000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.02 seconds)\n", + "Cbc0010I After 18543000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.09 seconds)\n", + "Cbc0010I After 18544000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1402.14 seconds)\n", + "Cbc0010I After 18545000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1402.21 seconds)\n", + "Cbc0010I After 18546000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.28 seconds)\n", + "Cbc0010I After 18547000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1402.33 seconds)\n", + "Cbc0010I After 18548000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1402.40 seconds)\n", + "Cbc0010I After 18549000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1402.47 seconds)\n", + "Cbc0010I After 18550000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1402.54 seconds)\n", + "Cbc0010I After 18551000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1402.65 seconds)\n", + "Cbc0010I After 18552000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1402.74 seconds)\n", + "Cbc0010I After 18553000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1402.82 seconds)\n", + "Cbc0010I After 18554000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1402.90 seconds)\n", + "Cbc0010I After 18555000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1402.97 seconds)\n", + "Cbc0010I After 18556000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1403.05 seconds)\n", + "Cbc0010I After 18557000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1403.13 seconds)\n", + "Cbc0010I After 18558000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1403.21 seconds)\n", + "Cbc0010I After 18559000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1403.29 seconds)\n", + "Cbc0010I After 18560000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1403.37 seconds)\n", + "Cbc0010I After 18561000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1403.44 seconds)\n", + "Cbc0010I After 18562000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1403.51 seconds)\n", + "Cbc0010I After 18563000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1403.58 seconds)\n", + "Cbc0010I After 18564000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1403.66 seconds)\n", + "Cbc0010I After 18565000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1403.73 seconds)\n", + "Cbc0010I After 18566000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1403.81 seconds)\n", + "Cbc0010I After 18567000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1403.87 seconds)\n", + "Cbc0010I After 18568000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1403.94 seconds)\n", + "Cbc0010I After 18569000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.01 seconds)\n", + "Cbc0010I After 18570000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1404.07 seconds)\n", + "Cbc0010I After 18571000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1404.14 seconds)\n", + "Cbc0010I After 18572000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1404.22 seconds)\n", + "Cbc0010I After 18573000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1404.30 seconds)\n", + "Cbc0010I After 18574000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1404.39 seconds)\n", + "Cbc0010I After 18575000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.50 seconds)\n", + "Cbc0010I After 18576000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1404.59 seconds)\n", + "Cbc0010I After 18577000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1404.67 seconds)\n", + "Cbc0010I After 18578000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1404.76 seconds)\n", + "Cbc0010I After 18579000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.84 seconds)\n", + "Cbc0010I After 18580000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1404.92 seconds)\n", + "Cbc0010I After 18581000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1405.01 seconds)\n", + "Cbc0010I After 18582000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1405.08 seconds)\n", + "Cbc0010I After 18583000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1405.16 seconds)\n", + "Cbc0010I After 18584000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1405.24 seconds)\n", + "Cbc0010I After 18585000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1405.32 seconds)\n", + "Cbc0010I After 18586000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1405.40 seconds)\n", + "Cbc0010I After 18587000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.47 seconds)\n", + "Cbc0010I After 18588000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1405.55 seconds)\n", + "Cbc0010I After 18589000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.63 seconds)\n", + "Cbc0010I After 18590000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1405.70 seconds)\n", + "Cbc0010I After 18591000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1405.77 seconds)\n", + "Cbc0010I After 18592000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1405.83 seconds)\n", + "Cbc0010I After 18593000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.90 seconds)\n", + "Cbc0010I After 18594000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1405.97 seconds)\n", + "Cbc0010I After 18595000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1406.04 seconds)\n", + "Cbc0010I After 18596000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1406.12 seconds)\n", + "Cbc0010I After 18597000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1406.19 seconds)\n", + "Cbc0010I After 18598000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1406.25 seconds)\n", + "Cbc0010I After 18599000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1406.33 seconds)\n", + "Cbc0010I After 18600000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1406.40 seconds)\n", + "Cbc0010I After 18601000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1406.47 seconds)\n", + "Cbc0010I After 18602000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1406.54 seconds)\n", + "Cbc0010I After 18603000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1406.61 seconds)\n", + "Cbc0010I After 18604000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1406.68 seconds)\n", + "Cbc0010I After 18605000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1406.74 seconds)\n", + "Cbc0010I After 18606000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1406.81 seconds)\n", + "Cbc0010I After 18607000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1406.86 seconds)\n", + "Cbc0010I After 18608000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1406.92 seconds)\n", + "Cbc0010I After 18609000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1406.99 seconds)\n", + "Cbc0010I After 18610000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1407.05 seconds)\n", + "Cbc0010I After 18611000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1407.11 seconds)\n", + "Cbc0010I After 18612000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.16 seconds)\n", + "Cbc0010I After 18613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1407.21 seconds)\n", + "Cbc0010I After 18614000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1407.27 seconds)\n", + "Cbc0010I After 18615000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.34 seconds)\n", + "Cbc0010I After 18616000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1407.40 seconds)\n", + "Cbc0010I After 18617000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1407.48 seconds)\n", + "Cbc0010I After 18618000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1407.56 seconds)\n", + "Cbc0010I After 18619000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1407.65 seconds)\n", + "Cbc0010I After 18620000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1407.72 seconds)\n", + "Cbc0010I After 18621000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1407.79 seconds)\n", + "Cbc0010I After 18622000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.85 seconds)\n", + "Cbc0010I After 18623000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1407.91 seconds)\n", + "Cbc0010I After 18624000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1407.96 seconds)\n", + "Cbc0010I After 18625000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1408.03 seconds)\n", + "Cbc0010I After 18626000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.09 seconds)\n", + "Cbc0010I After 18627000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1408.16 seconds)\n", + "Cbc0010I After 18628000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.22 seconds)\n", + "Cbc0010I After 18629000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1408.27 seconds)\n", + "Cbc0010I After 18630000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1408.30 seconds)\n", + "Cbc0010I After 18631000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.34 seconds)\n", + "Cbc0010I After 18632000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1408.41 seconds)\n", + "Cbc0010I After 18633000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1408.47 seconds)\n", + "Cbc0010I After 18634000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1408.51 seconds)\n", + "Cbc0010I After 18635000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1408.55 seconds)\n", + "Cbc0010I After 18636000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1408.63 seconds)\n", + "Cbc0010I After 18637000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1408.69 seconds)\n", + "Cbc0010I After 18638000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1408.74 seconds)\n", + "Cbc0010I After 18639000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1408.78 seconds)\n", + "Cbc0010I After 18640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1408.82 seconds)\n", + "Cbc0010I After 18641000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1408.89 seconds)\n", + "Cbc0010I After 18642000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1408.95 seconds)\n", + "Cbc0010I After 18643000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1409.01 seconds)\n", + "Cbc0010I After 18644000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1409.07 seconds)\n", + "Cbc0010I After 18645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.14 seconds)\n", + "Cbc0010I After 18646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.20 seconds)\n", + "Cbc0010I After 18647000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1409.28 seconds)\n", + "Cbc0010I After 18648000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.33 seconds)\n", + "Cbc0010I After 18649000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1409.40 seconds)\n", + "Cbc0010I After 18650000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1409.46 seconds)\n", + "Cbc0010I After 18651000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1409.51 seconds)\n", + "Cbc0010I After 18652000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1409.58 seconds)\n", + "Cbc0010I After 18653000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1409.64 seconds)\n", + "Cbc0010I After 18654000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1409.71 seconds)\n", + "Cbc0010I After 18655000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1409.77 seconds)\n", + "Cbc0010I After 18656000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1409.82 seconds)\n", + "Cbc0010I After 18657000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1409.90 seconds)\n", + "Cbc0010I After 18658000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1409.95 seconds)\n", + "Cbc0010I After 18659000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1410.00 seconds)\n", + "Cbc0010I After 18660000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1410.08 seconds)\n", + "Cbc0010I After 18661000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1410.15 seconds)\n", + "Cbc0010I After 18662000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1410.26 seconds)\n", + "Cbc0010I After 18663000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1410.34 seconds)\n", + "Cbc0010I After 18664000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1410.40 seconds)\n", + "Cbc0010I After 18665000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1410.46 seconds)\n", + "Cbc0010I After 18666000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1410.54 seconds)\n", + "Cbc0010I After 18667000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1410.60 seconds)\n", + "Cbc0010I After 18668000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1410.65 seconds)\n", + "Cbc0010I After 18669000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1410.71 seconds)\n", + "Cbc0010I After 18670000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1410.78 seconds)\n", + "Cbc0010I After 18671000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1410.83 seconds)\n", + "Cbc0010I After 18672000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1410.88 seconds)\n", + "Cbc0010I After 18673000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1410.96 seconds)\n", + "Cbc0010I After 18674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1411.03 seconds)\n", + "Cbc0010I After 18675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1411.07 seconds)\n", + "Cbc0010I After 18676000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1411.13 seconds)\n", + "Cbc0010I After 18677000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1411.21 seconds)\n", + "Cbc0010I After 18678000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1411.26 seconds)\n", + "Cbc0010I After 18679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1411.32 seconds)\n", + "Cbc0010I After 18680000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1411.39 seconds)\n", + "Cbc0010I After 18681000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1411.44 seconds)\n", + "Cbc0010I After 18682000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1411.49 seconds)\n", + "Cbc0010I After 18683000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1411.54 seconds)\n", + "Cbc0010I After 18684000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1411.61 seconds)\n", + "Cbc0010I After 18685000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1411.67 seconds)\n", + "Cbc0010I After 18686000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1411.71 seconds)\n", + "Cbc0010I After 18687000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1411.76 seconds)\n", + "Cbc0010I After 18688000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1411.83 seconds)\n", + "Cbc0010I After 18689000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1411.90 seconds)\n", + "Cbc0010I After 18690000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1411.95 seconds)\n", + "Cbc0010I After 18691000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1412.00 seconds)\n", + "Cbc0010I After 18692000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1412.04 seconds)\n", + "Cbc0010I After 18693000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1412.11 seconds)\n", + "Cbc0010I After 18694000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.17 seconds)\n", + "Cbc0010I After 18695000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1412.23 seconds)\n", + "Cbc0010I After 18696000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1412.28 seconds)\n", + "Cbc0010I After 18697000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1412.33 seconds)\n", + "Cbc0010I After 18698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.40 seconds)\n", + "Cbc0010I After 18699000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.46 seconds)\n", + "Cbc0010I After 18700000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1412.51 seconds)\n", + "Cbc0010I After 18701000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1412.59 seconds)\n", + "Cbc0010I After 18702000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1412.67 seconds)\n", + "Cbc0010I After 18703000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.72 seconds)\n", + "Cbc0010I After 18704000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.77 seconds)\n", + "Cbc0010I After 18705000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1412.85 seconds)\n", + "Cbc0010I After 18706000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.92 seconds)\n", + "Cbc0010I After 18707000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1413.00 seconds)\n", + "Cbc0010I After 18708000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.06 seconds)\n", + "Cbc0010I After 18709000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.13 seconds)\n", + "Cbc0010I After 18710000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1413.19 seconds)\n", + "Cbc0010I After 18711000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.24 seconds)\n", + "Cbc0010I After 18712000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1413.29 seconds)\n", + "Cbc0010I After 18713000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1413.36 seconds)\n", + "Cbc0010I After 18714000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1413.45 seconds)\n", + "Cbc0010I After 18715000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1413.51 seconds)\n", + "Cbc0010I After 18716000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1413.60 seconds)\n", + "Cbc0010I After 18717000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1413.66 seconds)\n", + "Cbc0010I After 18718000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1413.71 seconds)\n", + "Cbc0010I After 18719000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1413.79 seconds)\n", + "Cbc0010I After 18720000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1413.84 seconds)\n", + "Cbc0010I After 18721000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1413.91 seconds)\n", + "Cbc0010I After 18722000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1413.98 seconds)\n", + "Cbc0010I After 18723000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1414.03 seconds)\n", + "Cbc0010I After 18724000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1414.10 seconds)\n", + "Cbc0010I After 18725000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1414.17 seconds)\n", + "Cbc0010I After 18726000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1414.22 seconds)\n", + "Cbc0010I After 18727000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1414.27 seconds)\n", + "Cbc0010I After 18728000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1414.34 seconds)\n", + "Cbc0010I After 18729000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1414.40 seconds)\n", + "Cbc0010I After 18730000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1414.44 seconds)\n", + "Cbc0010I After 18731000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1414.51 seconds)\n", + "Cbc0010I After 18732000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1414.58 seconds)\n", + "Cbc0010I After 18733000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1414.63 seconds)\n", + "Cbc0010I After 18734000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1414.70 seconds)\n", + "Cbc0010I After 18735000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1414.78 seconds)\n", + "Cbc0010I After 18736000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1414.83 seconds)\n", + "Cbc0010I After 18737000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1414.90 seconds)\n", + "Cbc0010I After 18738000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1414.98 seconds)\n", + "Cbc0010I After 18739000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1415.04 seconds)\n", + "Cbc0010I After 18740000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1415.09 seconds)\n", + "Cbc0010I After 18741000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1415.16 seconds)\n", + "Cbc0010I After 18742000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1415.22 seconds)\n", + "Cbc0010I After 18743000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1415.27 seconds)\n", + "Cbc0010I After 18744000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1415.32 seconds)\n", + "Cbc0010I After 18745000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1415.38 seconds)\n", + "Cbc0010I After 18746000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1415.43 seconds)\n", + "Cbc0010I After 18747000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1415.50 seconds)\n", + "Cbc0010I After 18748000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1415.57 seconds)\n", + "Cbc0010I After 18749000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1415.62 seconds)\n", + "Cbc0010I After 18750000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1415.70 seconds)\n", + "Cbc0010I After 18751000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1415.77 seconds)\n", + "Cbc0010I After 18752000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1415.83 seconds)\n", + "Cbc0010I After 18753000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1415.89 seconds)\n", + "Cbc0010I After 18754000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1415.96 seconds)\n", + "Cbc0010I After 18755000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1416.01 seconds)\n", + "Cbc0010I After 18756000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1416.09 seconds)\n", + "Cbc0010I After 18757000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1416.16 seconds)\n", + "Cbc0010I After 18758000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1416.21 seconds)\n", + "Cbc0010I After 18759000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1416.28 seconds)\n", + "Cbc0010I After 18760000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1416.35 seconds)\n", + "Cbc0010I After 18761000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1416.40 seconds)\n", + "Cbc0010I After 18762000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1416.47 seconds)\n", + "Cbc0010I After 18763000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1416.53 seconds)\n", + "Cbc0010I After 18764000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1416.58 seconds)\n", + "Cbc0010I After 18765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1416.64 seconds)\n", + "Cbc0010I After 18766000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1416.71 seconds)\n", + "Cbc0010I After 18767000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1416.76 seconds)\n", + "Cbc0010I After 18768000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1416.82 seconds)\n", + "Cbc0010I After 18769000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1416.91 seconds)\n", + "Cbc0010I After 18770000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1416.96 seconds)\n", + "Cbc0010I After 18771000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1417.01 seconds)\n", + "Cbc0010I After 18772000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1417.07 seconds)\n", + "Cbc0010I After 18773000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1417.15 seconds)\n", + "Cbc0010I After 18774000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1417.20 seconds)\n", + "Cbc0010I After 18775000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1417.25 seconds)\n", + "Cbc0010I After 18776000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1417.31 seconds)\n", + "Cbc0010I After 18777000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1417.38 seconds)\n", + "Cbc0010I After 18778000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1417.44 seconds)\n", + "Cbc0010I After 18779000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1417.49 seconds)\n", + "Cbc0010I After 18780000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1417.56 seconds)\n", + "Cbc0010I After 18781000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1417.63 seconds)\n", + "Cbc0010I After 18782000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1417.68 seconds)\n", + "Cbc0010I After 18783000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1417.73 seconds)\n", + "Cbc0010I After 18784000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1417.80 seconds)\n", + "Cbc0010I After 18785000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1417.90 seconds)\n", + "Cbc0010I After 18786000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1417.98 seconds)\n", + "Cbc0010I After 18787000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1418.04 seconds)\n", + "Cbc0010I After 18788000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1418.11 seconds)\n", + "Cbc0010I After 18789000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1418.18 seconds)\n", + "Cbc0010I After 18790000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1418.23 seconds)\n", + "Cbc0010I After 18791000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1418.30 seconds)\n", + "Cbc0010I After 18792000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1418.38 seconds)\n", + "Cbc0010I After 18793000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1418.44 seconds)\n", + "Cbc0010I After 18794000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1418.50 seconds)\n", + "Cbc0010I After 18795000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1418.57 seconds)\n", + "Cbc0010I After 18796000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1418.63 seconds)\n", + "Cbc0010I After 18797000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1418.68 seconds)\n", + "Cbc0010I After 18798000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1418.74 seconds)\n", + "Cbc0010I After 18799000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1418.82 seconds)\n", + "Cbc0010I After 18800000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1418.89 seconds)\n", + "Cbc0010I After 18801000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1418.97 seconds)\n", + "Cbc0010I After 18802000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1419.03 seconds)\n", + "Cbc0010I After 18803000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.10 seconds)\n", + "Cbc0010I After 18804000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1419.17 seconds)\n", + "Cbc0010I After 18805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1419.24 seconds)\n", + "Cbc0010I After 18806000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1419.32 seconds)\n", + "Cbc0010I After 18807000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1419.39 seconds)\n", + "Cbc0010I After 18808000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1419.46 seconds)\n", + "Cbc0010I After 18809000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1419.54 seconds)\n", + "Cbc0010I After 18810000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1419.61 seconds)\n", + "Cbc0010I After 18811000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.69 seconds)\n", + "Cbc0010I After 18812000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1419.76 seconds)\n", + "Cbc0010I After 18813000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.84 seconds)\n", + "Cbc0010I After 18814000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1419.92 seconds)\n", + "Cbc0010I After 18815000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.99 seconds)\n", + "Cbc0010I After 18816000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1420.07 seconds)\n", + "Cbc0010I After 18817000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1420.15 seconds)\n", + "Cbc0010I After 18818000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1420.22 seconds)\n", + "Cbc0010I After 18819000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1420.30 seconds)\n", + "Cbc0010I After 18820000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1420.38 seconds)\n", + "Cbc0010I After 18821000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1420.45 seconds)\n", + "Cbc0010I After 18822000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1420.53 seconds)\n", + "Cbc0010I After 18823000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1420.60 seconds)\n", + "Cbc0010I After 18824000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1420.68 seconds)\n", + "Cbc0010I After 18825000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1420.76 seconds)\n", + "Cbc0010I After 18826000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1420.85 seconds)\n", + "Cbc0010I After 18827000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1420.93 seconds)\n", + "Cbc0010I After 18828000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1421.01 seconds)\n", + "Cbc0010I After 18829000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1421.07 seconds)\n", + "Cbc0010I After 18830000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1421.14 seconds)\n", + "Cbc0010I After 18831000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1421.21 seconds)\n", + "Cbc0010I After 18832000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1421.29 seconds)\n", + "Cbc0010I After 18833000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1421.36 seconds)\n", + "Cbc0010I After 18834000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1421.44 seconds)\n", + "Cbc0010I After 18835000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1421.51 seconds)\n", + "Cbc0010I After 18836000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1421.59 seconds)\n", + "Cbc0010I After 18837000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1421.66 seconds)\n", + "Cbc0010I After 18838000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1421.74 seconds)\n", + "Cbc0010I After 18839000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1421.82 seconds)\n", + "Cbc0010I After 18840000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1421.89 seconds)\n", + "Cbc0010I After 18841000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1421.97 seconds)\n", + "Cbc0010I After 18842000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1422.04 seconds)\n", + "Cbc0010I After 18843000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1422.12 seconds)\n", + "Cbc0010I After 18844000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1422.19 seconds)\n", + "Cbc0010I After 18845000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1422.26 seconds)\n", + "Cbc0010I After 18846000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1422.33 seconds)\n", + "Cbc0010I After 18847000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1422.40 seconds)\n", + "Cbc0010I After 18848000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1422.48 seconds)\n", + "Cbc0010I After 18849000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1422.55 seconds)\n", + "Cbc0010I After 18850000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1422.63 seconds)\n", + "Cbc0010I After 18851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1422.70 seconds)\n", + "Cbc0010I After 18852000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1422.77 seconds)\n", + "Cbc0010I After 18853000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1422.84 seconds)\n", + "Cbc0010I After 18854000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1422.92 seconds)\n", + "Cbc0010I After 18855000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1422.99 seconds)\n", + "Cbc0010I After 18856000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1423.07 seconds)\n", + "Cbc0010I After 18857000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1423.15 seconds)\n", + "Cbc0010I After 18858000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.22 seconds)\n", + "Cbc0010I After 18859000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1423.29 seconds)\n", + "Cbc0010I After 18860000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1423.36 seconds)\n", + "Cbc0010I After 18861000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1423.44 seconds)\n", + "Cbc0010I After 18862000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.51 seconds)\n", + "Cbc0010I After 18863000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1423.58 seconds)\n", + "Cbc0010I After 18864000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1423.66 seconds)\n", + "Cbc0010I After 18865000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1423.73 seconds)\n", + "Cbc0010I After 18866000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.80 seconds)\n", + "Cbc0010I After 18867000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1423.88 seconds)\n", + "Cbc0010I After 18868000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1424.01 seconds)\n", + "Cbc0010I After 18869000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1424.10 seconds)\n", + "Cbc0010I After 18870000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1424.22 seconds)\n", + "Cbc0010I After 18871000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1424.32 seconds)\n", + "Cbc0010I After 18872000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1424.41 seconds)\n", + "Cbc0010I After 18873000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1424.50 seconds)\n", + "Cbc0010I After 18874000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1424.58 seconds)\n", + "Cbc0010I After 18875000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1424.65 seconds)\n", + "Cbc0010I After 18876000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1424.72 seconds)\n", + "Cbc0010I After 18877000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1424.79 seconds)\n", + "Cbc0010I After 18878000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1424.86 seconds)\n", + "Cbc0010I After 18879000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1424.93 seconds)\n", + "Cbc0010I After 18880000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1424.98 seconds)\n", + "Cbc0010I After 18881000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1425.05 seconds)\n", + "Cbc0010I After 18882000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1425.11 seconds)\n", + "Cbc0010I After 18883000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1425.17 seconds)\n", + "Cbc0010I After 18884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1425.23 seconds)\n", + "Cbc0010I After 18885000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1425.29 seconds)\n", + "Cbc0010I After 18886000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1425.37 seconds)\n", + "Cbc0010I After 18887000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1425.44 seconds)\n", + "Cbc0010I After 18888000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1425.49 seconds)\n", + "Cbc0010I After 18889000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1425.56 seconds)\n", + "Cbc0010I After 18890000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1425.63 seconds)\n", + "Cbc0010I After 18891000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1425.69 seconds)\n", + "Cbc0010I After 18892000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1425.76 seconds)\n", + "Cbc0010I After 18893000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1425.82 seconds)\n", + "Cbc0010I After 18894000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1425.87 seconds)\n", + "Cbc0010I After 18895000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1425.96 seconds)\n", + "Cbc0010I After 18896000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.02 seconds)\n", + "Cbc0010I After 18897000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1426.10 seconds)\n", + "Cbc0010I After 18898000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1426.16 seconds)\n", + "Cbc0010I After 18899000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1426.21 seconds)\n", + "Cbc0010I After 18900000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1426.26 seconds)\n", + "Cbc0010I After 18901000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1426.31 seconds)\n", + "Cbc0010I After 18902000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.36 seconds)\n", + "Cbc0010I After 18903000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1426.42 seconds)\n", + "Cbc0010I After 18904000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1426.46 seconds)\n", + "Cbc0010I After 18905000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.51 seconds)\n", + "Cbc0010I After 18906000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1426.58 seconds)\n", + "Cbc0010I After 18907000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1426.65 seconds)\n", + "Cbc0010I After 18908000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1426.69 seconds)\n", + "Cbc0010I After 18909000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1426.77 seconds)\n", + "Cbc0010I After 18910000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1426.86 seconds)\n", + "Cbc0010I After 18911000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1426.91 seconds)\n", + "Cbc0010I After 18912000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1426.99 seconds)\n", + "Cbc0010I After 18913000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1427.06 seconds)\n", + "Cbc0010I After 18914000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1427.11 seconds)\n", + "Cbc0010I After 18915000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1427.19 seconds)\n", + "Cbc0010I After 18916000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1427.26 seconds)\n", + "Cbc0010I After 18917000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1427.31 seconds)\n", + "Cbc0010I After 18918000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1427.37 seconds)\n", + "Cbc0010I After 18919000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1427.45 seconds)\n", + "Cbc0010I After 18920000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1427.50 seconds)\n", + "Cbc0010I After 18921000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1427.56 seconds)\n", + "Cbc0010I After 18922000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1427.64 seconds)\n", + "Cbc0010I After 18923000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1427.71 seconds)\n", + "Cbc0010I After 18924000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1427.77 seconds)\n", + "Cbc0010I After 18925000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1427.83 seconds)\n", + "Cbc0010I After 18926000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1427.88 seconds)\n", + "Cbc0010I After 18927000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1427.94 seconds)\n", + "Cbc0010I After 18928000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1427.99 seconds)\n", + "Cbc0010I After 18929000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.05 seconds)\n", + "Cbc0010I After 18930000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1428.12 seconds)\n", + "Cbc0010I After 18931000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1428.19 seconds)\n", + "Cbc0010I After 18932000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1428.26 seconds)\n", + "Cbc0010I After 18933000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1428.32 seconds)\n", + "Cbc0010I After 18934000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1428.36 seconds)\n", + "Cbc0010I After 18935000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1428.43 seconds)\n", + "Cbc0010I After 18936000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1428.51 seconds)\n", + "Cbc0010I After 18937000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1428.59 seconds)\n", + "Cbc0010I After 18938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.65 seconds)\n", + "Cbc0010I After 18939000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1428.72 seconds)\n", + "Cbc0010I After 18940000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1428.77 seconds)\n", + "Cbc0010I After 18941000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.85 seconds)\n", + "Cbc0010I After 18942000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1428.92 seconds)\n", + "Cbc0010I After 18943000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1428.97 seconds)\n", + "Cbc0010I After 18944000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.04 seconds)\n", + "Cbc0010I After 18945000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.11 seconds)\n", + "Cbc0010I After 18946000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1429.16 seconds)\n", + "Cbc0010I After 18947000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.23 seconds)\n", + "Cbc0010I After 18948000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1429.29 seconds)\n", + "Cbc0010I After 18949000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1429.34 seconds)\n", + "Cbc0010I After 18950000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1429.40 seconds)\n", + "Cbc0010I After 18951000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1429.48 seconds)\n", + "Cbc0010I After 18952000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1429.54 seconds)\n", + "Cbc0010I After 18953000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1429.59 seconds)\n", + "Cbc0010I After 18954000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1429.66 seconds)\n", + "Cbc0010I After 18955000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1429.73 seconds)\n", + "Cbc0010I After 18956000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1429.78 seconds)\n", + "Cbc0010I After 18957000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1429.85 seconds)\n", + "Cbc0010I After 18958000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1429.93 seconds)\n", + "Cbc0010I After 18959000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1429.99 seconds)\n", + "Cbc0010I After 18960000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1430.05 seconds)\n", + "Cbc0010I After 18961000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1430.12 seconds)\n", + "Cbc0010I After 18962000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1430.19 seconds)\n", + "Cbc0010I After 18963000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1430.23 seconds)\n", + "Cbc0010I After 18964000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1430.30 seconds)\n", + "Cbc0010I After 18965000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1430.37 seconds)\n", + "Cbc0010I After 18966000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1430.43 seconds)\n", + "Cbc0010I After 18967000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1430.48 seconds)\n", + "Cbc0010I After 18968000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.56 seconds)\n", + "Cbc0010I After 18969000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.62 seconds)\n", + "Cbc0010I After 18970000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1430.67 seconds)\n", + "Cbc0010I After 18971000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1430.73 seconds)\n", + "Cbc0010I After 18972000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1430.80 seconds)\n", + "Cbc0010I After 18973000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.89 seconds)\n", + "Cbc0010I After 18974000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1430.94 seconds)\n", + "Cbc0010I After 18975000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1430.99 seconds)\n", + "Cbc0010I After 18976000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1431.07 seconds)\n", + "Cbc0010I After 18977000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1431.14 seconds)\n", + "Cbc0010I After 18978000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1431.19 seconds)\n", + "Cbc0010I After 18979000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1431.24 seconds)\n", + "Cbc0010I After 18980000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1431.30 seconds)\n", + "Cbc0010I After 18981000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1431.37 seconds)\n", + "Cbc0010I After 18982000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1431.44 seconds)\n", + "Cbc0010I After 18983000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1431.49 seconds)\n", + "Cbc0010I After 18984000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1431.53 seconds)\n", + "Cbc0010I After 18985000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1431.58 seconds)\n", + "Cbc0010I After 18986000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1431.66 seconds)\n", + "Cbc0010I After 18987000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1431.73 seconds)\n", + "Cbc0010I After 18988000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1431.77 seconds)\n", + "Cbc0010I After 18989000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1431.82 seconds)\n", + "Cbc0010I After 18990000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1431.89 seconds)\n", + "Cbc0010I After 18991000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1431.96 seconds)\n", + "Cbc0010I After 18992000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1432.03 seconds)\n", + "Cbc0010I After 18993000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1432.12 seconds)\n", + "Cbc0010I After 18994000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1432.18 seconds)\n", + "Cbc0010I After 18995000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1432.24 seconds)\n", + "Cbc0010I After 18996000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1432.32 seconds)\n", + "Cbc0010I After 18997000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1432.39 seconds)\n", + "Cbc0010I After 18998000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1432.48 seconds)\n", + "Cbc0010I After 18999000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1432.53 seconds)\n", + "Cbc0010I After 19000000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1432.59 seconds)\n", + "Cbc0010I After 19001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1432.67 seconds)\n", + "Cbc0010I After 19002000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1432.72 seconds)\n", + "Cbc0010I After 19003000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1432.78 seconds)\n", + "Cbc0010I After 19004000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1432.86 seconds)\n", + "Cbc0010I After 19005000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1432.91 seconds)\n", + "Cbc0010I After 19006000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1432.96 seconds)\n", + "Cbc0010I After 19007000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1433.04 seconds)\n", + "Cbc0010I After 19008000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1433.10 seconds)\n", + "Cbc0010I After 19009000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1433.15 seconds)\n", + "Cbc0010I After 19010000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1433.23 seconds)\n", + "Cbc0010I After 19011000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1433.30 seconds)\n", + "Cbc0010I After 19012000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1433.35 seconds)\n", + "Cbc0010I After 19013000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1433.41 seconds)\n", + "Cbc0010I After 19014000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1433.48 seconds)\n", + "Cbc0010I After 19015000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1433.55 seconds)\n", + "Cbc0010I After 19016000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1433.60 seconds)\n", + "Cbc0010I After 19017000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1433.66 seconds)\n", + "Cbc0010I After 19018000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1433.74 seconds)\n", + "Cbc0010I After 19019000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1433.80 seconds)\n", + "Cbc0010I After 19020000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1433.85 seconds)\n", + "Cbc0010I After 19021000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1433.91 seconds)\n", + "Cbc0010I After 19022000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1433.99 seconds)\n", + "Cbc0010I After 19023000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1434.04 seconds)\n", + "Cbc0010I After 19024000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1434.09 seconds)\n", + "Cbc0010I After 19025000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.17 seconds)\n", + "Cbc0010I After 19026000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1434.24 seconds)\n", + "Cbc0010I After 19027000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.29 seconds)\n", + "Cbc0010I After 19028000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1434.34 seconds)\n", + "Cbc0010I After 19029000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1434.41 seconds)\n", + "Cbc0010I After 19030000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.49 seconds)\n", + "Cbc0010I After 19031000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.54 seconds)\n", + "Cbc0010I After 19032000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1434.59 seconds)\n", + "Cbc0010I After 19033000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1434.64 seconds)\n", + "Cbc0010I After 19034000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.73 seconds)\n", + "Cbc0010I After 19035000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1434.80 seconds)\n", + "Cbc0010I After 19036000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.85 seconds)\n", + "Cbc0010I After 19037000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1434.91 seconds)\n", + "Cbc0010I After 19038000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.98 seconds)\n", + "Cbc0010I After 19039000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1435.05 seconds)\n", + "Cbc0010I After 19040000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1435.13 seconds)\n", + "Cbc0010I After 19041000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1435.19 seconds)\n", + "Cbc0010I After 19042000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1435.25 seconds)\n", + "Cbc0010I After 19043000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.30 seconds)\n", + "Cbc0010I After 19044000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.39 seconds)\n", + "Cbc0010I After 19045000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1435.47 seconds)\n", + "Cbc0010I After 19046000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1435.55 seconds)\n", + "Cbc0010I After 19047000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1435.60 seconds)\n", + "Cbc0010I After 19048000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1435.64 seconds)\n", + "Cbc0010I After 19049000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1435.71 seconds)\n", + "Cbc0010I After 19050000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.79 seconds)\n", + "Cbc0010I After 19051000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.85 seconds)\n", + "Cbc0010I After 19052000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1435.89 seconds)\n", + "Cbc0010I After 19053000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1435.94 seconds)\n", + "Cbc0010I After 19054000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.01 seconds)\n", + "Cbc0010I After 19055000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1436.08 seconds)\n", + "Cbc0010I After 19056000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1436.15 seconds)\n", + "Cbc0010I After 19057000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1436.20 seconds)\n", + "Cbc0010I After 19058000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.25 seconds)\n", + "Cbc0010I After 19059000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1436.33 seconds)\n", + "Cbc0010I After 19060000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1436.40 seconds)\n", + "Cbc0010I After 19061000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1436.45 seconds)\n", + "Cbc0010I After 19062000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1436.50 seconds)\n", + "Cbc0010I After 19063000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1436.53 seconds)\n", + "Cbc0010I After 19064000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1436.56 seconds)\n", + "Cbc0010I After 19065000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1436.58 seconds)\n", + "Cbc0010I After 19066000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1436.61 seconds)\n", + "Cbc0010I After 19067000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1436.65 seconds)\n", + "Cbc0010I After 19068000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1436.67 seconds)\n", + "Cbc0010I After 19069000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1436.70 seconds)\n", + "Cbc0010I After 19070000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1436.74 seconds)\n", + "Cbc0010I After 19071000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1436.76 seconds)\n", + "Cbc0010I After 19072000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1436.80 seconds)\n", + "Cbc0010I After 19073000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.83 seconds)\n", + "Cbc0010I After 19074000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1436.86 seconds)\n", + "Cbc0010I After 19075000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1436.89 seconds)\n", + "Cbc0010I After 19076000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1436.92 seconds)\n", + "Cbc0010I After 19077000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1436.95 seconds)\n", + "Cbc0010I After 19078000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1436.97 seconds)\n", + "Cbc0010I After 19079000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1437.00 seconds)\n", + "Cbc0010I After 19080000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1437.04 seconds)\n", + "Cbc0010I After 19081000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1437.11 seconds)\n", + "Cbc0010I After 19082000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1437.17 seconds)\n", + "Cbc0010I After 19083000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1437.21 seconds)\n", + "Cbc0010I After 19084000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1437.25 seconds)\n", + "Cbc0010I After 19085000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1437.29 seconds)\n", + "Cbc0010I After 19086000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1437.32 seconds)\n", + "Cbc0010I After 19087000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1437.36 seconds)\n", + "Cbc0010I After 19088000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1437.40 seconds)\n", + "Cbc0010I After 19089000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1437.43 seconds)\n", + "Cbc0010I After 19090000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1437.46 seconds)\n", + "Cbc0010I After 19091000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1437.49 seconds)\n", + "Cbc0010I After 19092000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1437.53 seconds)\n", + "Cbc0010I After 19093000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1437.56 seconds)\n", + "Cbc0010I After 19094000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1437.59 seconds)\n", + "Cbc0010I After 19095000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1437.62 seconds)\n", + "Cbc0010I After 19096000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1437.65 seconds)\n", + "Cbc0010I After 19097000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1437.69 seconds)\n", + "Cbc0010I After 19098000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1437.72 seconds)\n", + "Cbc0010I After 19099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1437.75 seconds)\n", + "Cbc0010I After 19100000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1437.78 seconds)\n", + "Cbc0010I After 19101000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1437.81 seconds)\n", + "Cbc0010I After 19102000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1437.85 seconds)\n", + "Cbc0010I After 19103000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1437.87 seconds)\n", + "Cbc0010I After 19104000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1437.90 seconds)\n", + "Cbc0010I After 19105000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1437.93 seconds)\n", + "Cbc0010I After 19106000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1437.97 seconds)\n", + "Cbc0010I After 19107000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1438.00 seconds)\n", + "Cbc0010I After 19108000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1438.03 seconds)\n", + "Cbc0010I After 19109000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1438.06 seconds)\n", + "Cbc0010I After 19110000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1438.09 seconds)\n", + "Cbc0010I After 19111000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1438.12 seconds)\n", + "Cbc0010I After 19112000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1438.15 seconds)\n", + "Cbc0010I After 19113000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1438.19 seconds)\n", + "Cbc0010I After 19114000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1438.22 seconds)\n", + "Cbc0010I After 19115000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1438.25 seconds)\n", + "Cbc0010I After 19116000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1438.29 seconds)\n", + "Cbc0010I After 19117000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1438.32 seconds)\n", + "Cbc0010I After 19118000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1438.35 seconds)\n", + "Cbc0010I After 19119000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1438.38 seconds)\n", + "Cbc0010I After 19120000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1438.42 seconds)\n", + "Cbc0010I After 19121000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1438.44 seconds)\n", + "Cbc0010I After 19122000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1438.47 seconds)\n", + "Cbc0010I After 19123000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1438.51 seconds)\n", + "Cbc0010I After 19124000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1438.54 seconds)\n", + "Cbc0010I After 19125000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1438.56 seconds)\n", + "Cbc0010I After 19126000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1438.59 seconds)\n", + "Cbc0010I After 19127000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1438.62 seconds)\n", + "Cbc0010I After 19128000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1438.65 seconds)\n", + "Cbc0010I After 19129000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1438.68 seconds)\n", + "Cbc0010I After 19130000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1438.72 seconds)\n", + "Cbc0010I After 19131000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1438.75 seconds)\n", + "Cbc0010I After 19132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1438.78 seconds)\n", + "Cbc0010I After 19133000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1438.81 seconds)\n", + "Cbc0010I After 19134000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1438.85 seconds)\n", + "Cbc0010I After 19135000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1438.88 seconds)\n", + "Cbc0010I After 19136000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1438.91 seconds)\n", + "Cbc0010I After 19137000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1438.94 seconds)\n", + "Cbc0010I After 19138000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1438.99 seconds)\n", + "Cbc0010I After 19139000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1439.02 seconds)\n", + "Cbc0010I After 19140000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1439.05 seconds)\n", + "Cbc0010I After 19141000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1439.08 seconds)\n", + "Cbc0010I After 19142000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1439.11 seconds)\n", + "Cbc0010I After 19143000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1439.14 seconds)\n", + "Cbc0010I After 19144000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1439.17 seconds)\n", + "Cbc0010I After 19145000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1439.20 seconds)\n", + "Cbc0010I After 19146000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1439.23 seconds)\n", + "Cbc0010I After 19147000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1439.27 seconds)\n", + "Cbc0010I After 19148000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1439.30 seconds)\n", + "Cbc0010I After 19149000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1439.34 seconds)\n", + "Cbc0010I After 19150000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1439.37 seconds)\n", + "Cbc0010I After 19151000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1439.41 seconds)\n", + "Cbc0010I After 19152000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1439.44 seconds)\n", + "Cbc0010I After 19153000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1439.48 seconds)\n", + "Cbc0010I After 19154000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1439.51 seconds)\n", + "Cbc0010I After 19155000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1439.54 seconds)\n", + "Cbc0010I After 19156000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1439.58 seconds)\n", + "Cbc0010I After 19157000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1439.61 seconds)\n", + "Cbc0010I After 19158000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1439.64 seconds)\n", + "Cbc0010I After 19159000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1439.67 seconds)\n", + "Cbc0010I After 19160000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1439.70 seconds)\n", + "Cbc0010I After 19161000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1439.74 seconds)\n", + "Cbc0010I After 19162000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1439.77 seconds)\n", + "Cbc0010I After 19163000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1439.82 seconds)\n", + "Cbc0010I After 19164000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1439.87 seconds)\n", + "Cbc0010I After 19165000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1439.93 seconds)\n", + "Cbc0010I After 19166000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1439.97 seconds)\n", + "Cbc0010I After 19167000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1440.02 seconds)\n", + "Cbc0010I After 19168000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1440.05 seconds)\n", + "Cbc0010I After 19169000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1440.09 seconds)\n", + "Cbc0010I After 19170000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1440.14 seconds)\n", + "Cbc0010I After 19171000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1440.17 seconds)\n", + "Cbc0010I After 19172000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1440.20 seconds)\n", + "Cbc0010I After 19173000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1440.23 seconds)\n", + "Cbc0010I After 19174000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1440.27 seconds)\n", + "Cbc0010I After 19175000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1440.31 seconds)\n", + "Cbc0010I After 19176000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1440.36 seconds)\n", + "Cbc0010I After 19177000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1440.40 seconds)\n", + "Cbc0010I After 19178000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1440.44 seconds)\n", + "Cbc0010I After 19179000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1440.47 seconds)\n", + "Cbc0010I After 19180000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1440.50 seconds)\n", + "Cbc0010I After 19181000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1440.53 seconds)\n", + "Cbc0010I After 19182000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1440.57 seconds)\n", + "Cbc0010I After 19183000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1440.62 seconds)\n", + "Cbc0010I After 19184000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1440.66 seconds)\n", + "Cbc0010I After 19185000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1440.70 seconds)\n", + "Cbc0010I After 19186000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1440.74 seconds)\n", + "Cbc0010I After 19187000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1440.79 seconds)\n", + "Cbc0010I After 19188000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1440.83 seconds)\n", + "Cbc0010I After 19189000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1440.87 seconds)\n", + "Cbc0010I After 19190000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1440.90 seconds)\n", + "Cbc0010I After 19191000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1440.92 seconds)\n", + "Cbc0010I After 19192000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1440.96 seconds)\n", + "Cbc0010I After 19193000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1441.00 seconds)\n", + "Cbc0010I After 19194000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1441.04 seconds)\n", + "Cbc0010I After 19195000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.08 seconds)\n", + "Cbc0010I After 19196000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1441.13 seconds)\n", + "Cbc0010I After 19197000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1441.17 seconds)\n", + "Cbc0010I After 19198000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1441.21 seconds)\n", + "Cbc0010I After 19199000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1441.26 seconds)\n", + "Cbc0010I After 19200000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1441.30 seconds)\n", + "Cbc0010I After 19201000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1441.34 seconds)\n", + "Cbc0010I After 19202000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1441.39 seconds)\n", + "Cbc0010I After 19203000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1441.44 seconds)\n", + "Cbc0010I After 19204000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1441.49 seconds)\n", + "Cbc0010I After 19205000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1441.53 seconds)\n", + "Cbc0010I After 19206000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1441.58 seconds)\n", + "Cbc0010I After 19207000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1441.62 seconds)\n", + "Cbc0010I After 19208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1441.66 seconds)\n", + "Cbc0010I After 19209000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1441.69 seconds)\n", + "Cbc0010I After 19210000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1441.72 seconds)\n", + "Cbc0010I After 19211000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1441.75 seconds)\n", + "Cbc0010I After 19212000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1441.79 seconds)\n", + "Cbc0010I After 19213000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1441.83 seconds)\n", + "Cbc0010I After 19214000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.87 seconds)\n", + "Cbc0010I After 19215000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1441.92 seconds)\n", + "Cbc0010I After 19216000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1441.96 seconds)\n", + "Cbc0010I After 19217000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.99 seconds)\n", + "Cbc0010I After 19218000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1442.01 seconds)\n", + "Cbc0010I After 19219000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1442.05 seconds)\n", + "Cbc0010I After 19220000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1442.09 seconds)\n", + "Cbc0010I After 19221000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1442.13 seconds)\n", + "Cbc0010I After 19222000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1442.18 seconds)\n", + "Cbc0010I After 19223000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1442.22 seconds)\n", + "Cbc0010I After 19224000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1442.26 seconds)\n", + "Cbc0010I After 19225000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1442.31 seconds)\n", + "Cbc0010I After 19226000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1442.35 seconds)\n", + "Cbc0010I After 19227000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1442.40 seconds)\n", + "Cbc0010I After 19228000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1442.44 seconds)\n", + "Cbc0010I After 19229000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1442.48 seconds)\n", + "Cbc0010I After 19230000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1442.52 seconds)\n", + "Cbc0010I After 19231000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1442.55 seconds)\n", + "Cbc0010I After 19232000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1442.57 seconds)\n", + "Cbc0010I After 19233000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1442.62 seconds)\n", + "Cbc0010I After 19234000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1442.66 seconds)\n", + "Cbc0010I After 19235000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1442.70 seconds)\n", + "Cbc0010I After 19236000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1442.73 seconds)\n", + "Cbc0010I After 19237000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1442.76 seconds)\n", + "Cbc0010I After 19238000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1442.79 seconds)\n", + "Cbc0010I After 19239000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1442.82 seconds)\n", + "Cbc0010I After 19240000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1442.85 seconds)\n", + "Cbc0010I After 19241000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1442.89 seconds)\n", + "Cbc0010I After 19242000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1442.93 seconds)\n", + "Cbc0010I After 19243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1442.96 seconds)\n", + "Cbc0010I After 19244000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1443.00 seconds)\n", + "Cbc0010I After 19245000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1443.04 seconds)\n", + "Cbc0010I After 19246000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.08 seconds)\n", + "Cbc0010I After 19247000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1443.13 seconds)\n", + "Cbc0010I After 19248000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1443.17 seconds)\n", + "Cbc0010I After 19249000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1443.20 seconds)\n", + "Cbc0010I After 19250000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1443.24 seconds)\n", + "Cbc0010I After 19251000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1443.28 seconds)\n", + "Cbc0010I After 19252000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1443.32 seconds)\n", + "Cbc0010I After 19253000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1443.35 seconds)\n", + "Cbc0010I After 19254000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.38 seconds)\n", + "Cbc0010I After 19255000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1443.41 seconds)\n", + "Cbc0010I After 19256000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1443.44 seconds)\n", + "Cbc0010I After 19257000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1443.47 seconds)\n", + "Cbc0010I After 19258000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1443.49 seconds)\n", + "Cbc0010I After 19259000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1443.53 seconds)\n", + "Cbc0010I After 19260000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1443.57 seconds)\n", + "Cbc0010I After 19261000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.61 seconds)\n", + "Cbc0010I After 19262000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1443.69 seconds)\n", + "Cbc0010I After 19263000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1443.77 seconds)\n", + "Cbc0010I After 19264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1443.84 seconds)\n", + "Cbc0010I After 19265000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1443.89 seconds)\n", + "Cbc0010I After 19266000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1443.94 seconds)\n", + "Cbc0010I After 19267000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1444.01 seconds)\n", + "Cbc0010I After 19268000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1444.07 seconds)\n", + "Cbc0010I After 19269000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1444.14 seconds)\n", + "Cbc0010I After 19270000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1444.20 seconds)\n", + "Cbc0010I After 19271000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1444.27 seconds)\n", + "Cbc0010I After 19272000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1444.33 seconds)\n", + "Cbc0010I After 19273000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1444.39 seconds)\n", + "Cbc0010I After 19274000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1444.46 seconds)\n", + "Cbc0010I After 19275000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1444.52 seconds)\n", + "Cbc0010I After 19276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1444.59 seconds)\n", + "Cbc0010I After 19277000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1444.66 seconds)\n", + "Cbc0010I After 19278000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1444.73 seconds)\n", + "Cbc0010I After 19279000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1444.79 seconds)\n", + "Cbc0010I After 19280000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1444.86 seconds)\n", + "Cbc0010I After 19281000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1444.93 seconds)\n", + "Cbc0010I After 19282000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1445.00 seconds)\n", + "Cbc0010I After 19283000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1445.07 seconds)\n", + "Cbc0010I After 19284000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1445.13 seconds)\n", + "Cbc0010I After 19285000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1445.20 seconds)\n", + "Cbc0010I After 19286000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1445.28 seconds)\n", + "Cbc0010I After 19287000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1445.35 seconds)\n", + "Cbc0010I After 19288000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1445.44 seconds)\n", + "Cbc0010I After 19289000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1445.52 seconds)\n", + "Cbc0010I After 19290000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1445.59 seconds)\n", + "Cbc0010I After 19291000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1445.66 seconds)\n", + "Cbc0010I After 19292000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1445.75 seconds)\n", + "Cbc0010I After 19293000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1445.84 seconds)\n", + "Cbc0010I After 19294000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1445.93 seconds)\n", + "Cbc0010I After 19295000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1446.01 seconds)\n", + "Cbc0010I After 19296000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1446.09 seconds)\n", + "Cbc0010I After 19297000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1446.16 seconds)\n", + "Cbc0010I After 19298000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1446.24 seconds)\n", + "Cbc0010I After 19299000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1446.31 seconds)\n", + "Cbc0010I After 19300000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1446.38 seconds)\n", + "Cbc0010I After 19301000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1446.46 seconds)\n", + "Cbc0010I After 19302000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1446.53 seconds)\n", + "Cbc0010I After 19303000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1446.60 seconds)\n", + "Cbc0010I After 19304000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1446.68 seconds)\n", + "Cbc0010I After 19305000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1446.75 seconds)\n", + "Cbc0010I After 19306000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1446.82 seconds)\n", + "Cbc0010I After 19307000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1446.89 seconds)\n", + "Cbc0010I After 19308000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1446.96 seconds)\n", + "Cbc0010I After 19309000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1447.04 seconds)\n", + "Cbc0010I After 19310000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1447.11 seconds)\n", + "Cbc0010I After 19311000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1447.18 seconds)\n", + "Cbc0010I After 19312000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1447.25 seconds)\n", + "Cbc0010I After 19313000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1447.31 seconds)\n", + "Cbc0010I After 19314000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1447.39 seconds)\n", + "Cbc0010I After 19315000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1447.45 seconds)\n", + "Cbc0010I After 19316000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1447.53 seconds)\n", + "Cbc0010I After 19317000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1447.59 seconds)\n", + "Cbc0010I After 19318000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1447.67 seconds)\n", + "Cbc0010I After 19319000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1447.74 seconds)\n", + "Cbc0010I After 19320000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1447.81 seconds)\n", + "Cbc0010I After 19321000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1447.90 seconds)\n", + "Cbc0010I After 19322000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1447.99 seconds)\n", + "Cbc0010I After 19323000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1448.07 seconds)\n", + "Cbc0010I After 19324000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1448.14 seconds)\n", + "Cbc0010I After 19325000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1448.22 seconds)\n", + "Cbc0010I After 19326000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1448.29 seconds)\n", + "Cbc0010I After 19327000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1448.37 seconds)\n", + "Cbc0010I After 19328000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1448.45 seconds)\n", + "Cbc0010I After 19329000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1448.53 seconds)\n", + "Cbc0010I After 19330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1448.60 seconds)\n", + "Cbc0010I After 19331000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1448.68 seconds)\n", + "Cbc0010I After 19332000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1448.75 seconds)\n", + "Cbc0010I After 19333000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1448.82 seconds)\n", + "Cbc0010I After 19334000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1448.90 seconds)\n", + "Cbc0010I After 19335000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1448.96 seconds)\n", + "Cbc0010I After 19336000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1449.04 seconds)\n", + "Cbc0010I After 19337000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1449.11 seconds)\n", + "Cbc0010I After 19338000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1449.18 seconds)\n", + "Cbc0010I After 19339000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1449.25 seconds)\n", + "Cbc0010I After 19340000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1449.33 seconds)\n", + "Cbc0010I After 19341000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1449.41 seconds)\n", + "Cbc0010I After 19342000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1449.48 seconds)\n", + "Cbc0010I After 19343000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1449.56 seconds)\n", + "Cbc0010I After 19344000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1449.63 seconds)\n", + "Cbc0010I After 19345000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1449.70 seconds)\n", + "Cbc0010I After 19346000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1449.78 seconds)\n", + "Cbc0010I After 19347000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1449.84 seconds)\n", + "Cbc0010I After 19348000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1449.92 seconds)\n", + "Cbc0010I After 19349000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1449.99 seconds)\n", + "Cbc0010I After 19350000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1450.06 seconds)\n", + "Cbc0010I After 19351000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1450.14 seconds)\n", + "Cbc0010I After 19352000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1450.21 seconds)\n", + "Cbc0010I After 19353000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1450.28 seconds)\n", + "Cbc0010I After 19354000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1450.34 seconds)\n", + "Cbc0010I After 19355000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1450.41 seconds)\n", + "Cbc0010I After 19356000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1450.48 seconds)\n", + "Cbc0010I After 19357000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1450.55 seconds)\n", + "Cbc0010I After 19358000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1450.61 seconds)\n", + "Cbc0010I After 19359000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1450.68 seconds)\n", + "Cbc0010I After 19360000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1450.74 seconds)\n", + "Cbc0010I After 19361000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1450.81 seconds)\n", + "Cbc0010I After 19362000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1450.87 seconds)\n", + "Cbc0010I After 19363000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1450.94 seconds)\n", + "Cbc0010I After 19364000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1451.02 seconds)\n", + "Cbc0010I After 19365000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1451.08 seconds)\n", + "Cbc0010I After 19366000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1451.15 seconds)\n", + "Cbc0010I After 19367000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1451.22 seconds)\n", + "Cbc0010I After 19368000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1451.29 seconds)\n", + "Cbc0010I After 19369000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1451.41 seconds)\n", + "Cbc0010I After 19370000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1451.50 seconds)\n", + "Cbc0010I After 19371000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1451.59 seconds)\n", + "Cbc0010I After 19372000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1451.67 seconds)\n", + "Cbc0010I After 19373000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1451.75 seconds)\n", + "Cbc0010I After 19374000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1451.82 seconds)\n", + "Cbc0010I After 19375000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1451.89 seconds)\n", + "Cbc0010I After 19376000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1451.96 seconds)\n", + "Cbc0010I After 19377000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1452.05 seconds)\n", + "Cbc0010I After 19378000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1452.13 seconds)\n", + "Cbc0010I After 19379000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1452.21 seconds)\n", + "Cbc0010I After 19380000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1452.29 seconds)\n", + "Cbc0010I After 19381000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1452.36 seconds)\n", + "Cbc0010I After 19382000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1452.43 seconds)\n", + "Cbc0010I After 19383000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1452.49 seconds)\n", + "Cbc0010I After 19384000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1452.56 seconds)\n", + "Cbc0010I After 19385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1452.62 seconds)\n", + "Cbc0010I After 19386000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1452.69 seconds)\n", + "Cbc0010I After 19387000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1452.76 seconds)\n", + "Cbc0010I After 19388000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1452.83 seconds)\n", + "Cbc0010I After 19389000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1452.91 seconds)\n", + "Cbc0010I After 19390000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1452.98 seconds)\n", + "Cbc0010I After 19391000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1453.05 seconds)\n", + "Cbc0010I After 19392000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1453.11 seconds)\n", + "Cbc0010I After 19393000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1453.18 seconds)\n", + "Cbc0010I After 19394000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1453.25 seconds)\n", + "Cbc0010I After 19395000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1453.32 seconds)\n", + "Cbc0010I After 19396000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1453.38 seconds)\n", + "Cbc0010I After 19397000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1453.45 seconds)\n", + "Cbc0010I After 19398000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1453.52 seconds)\n", + "Cbc0010I After 19399000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1453.58 seconds)\n", + "Cbc0010I After 19400000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1453.65 seconds)\n", + "Cbc0010I After 19401000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1453.72 seconds)\n", + "Cbc0010I After 19402000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1453.79 seconds)\n", + "Cbc0010I After 19403000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1453.86 seconds)\n", + "Cbc0010I After 19404000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1453.92 seconds)\n", + "Cbc0010I After 19405000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1453.98 seconds)\n", + "Cbc0010I After 19406000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1454.05 seconds)\n", + "Cbc0010I After 19407000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1454.11 seconds)\n", + "Cbc0010I After 19408000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1454.18 seconds)\n", + "Cbc0010I After 19409000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1454.25 seconds)\n", + "Cbc0010I After 19410000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1454.32 seconds)\n", + "Cbc0010I After 19411000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1454.40 seconds)\n", + "Cbc0010I After 19412000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1454.48 seconds)\n", + "Cbc0010I After 19413000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1454.56 seconds)\n", + "Cbc0010I After 19414000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1454.63 seconds)\n", + "Cbc0010I After 19415000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1454.70 seconds)\n", + "Cbc0010I After 19416000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1454.78 seconds)\n", + "Cbc0010I After 19417000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1454.85 seconds)\n", + "Cbc0010I After 19418000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1454.92 seconds)\n", + "Cbc0010I After 19419000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1455.00 seconds)\n", + "Cbc0010I After 19420000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1455.07 seconds)\n", + "Cbc0010I After 19421000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1455.14 seconds)\n", + "Cbc0010I After 19422000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1455.22 seconds)\n", + "Cbc0010I After 19423000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1455.29 seconds)\n", + "Cbc0010I After 19424000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1455.36 seconds)\n", + "Cbc0010I After 19425000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1455.45 seconds)\n", + "Cbc0010I After 19426000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1455.53 seconds)\n", + "Cbc0010I After 19427000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1455.60 seconds)\n", + "Cbc0010I After 19428000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1455.68 seconds)\n", + "Cbc0010I After 19429000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1455.75 seconds)\n", + "Cbc0010I After 19430000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1455.83 seconds)\n", + "Cbc0010I After 19431000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1455.91 seconds)\n", + "Cbc0010I After 19432000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1455.99 seconds)\n", + "Cbc0010I After 19433000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1456.07 seconds)\n", + "Cbc0010I After 19434000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1456.14 seconds)\n", + "Cbc0010I After 19435000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1456.22 seconds)\n", + "Cbc0010I After 19436000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1456.29 seconds)\n", + "Cbc0010I After 19437000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1456.36 seconds)\n", + "Cbc0010I After 19438000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1456.43 seconds)\n", + "Cbc0010I After 19439000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1456.51 seconds)\n", + "Cbc0010I After 19440000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1456.60 seconds)\n", + "Cbc0010I After 19441000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1456.69 seconds)\n", + "Cbc0010I After 19442000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1456.77 seconds)\n", + "Cbc0010I After 19443000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1456.84 seconds)\n", + "Cbc0010I After 19444000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1456.91 seconds)\n", + "Cbc0010I After 19445000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1456.97 seconds)\n", + "Cbc0010I After 19446000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1457.04 seconds)\n", + "Cbc0010I After 19447000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1457.11 seconds)\n", + "Cbc0010I After 19448000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1457.18 seconds)\n", + "Cbc0010I After 19449000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1457.25 seconds)\n", + "Cbc0010I After 19450000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1457.32 seconds)\n", + "Cbc0010I After 19451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1457.39 seconds)\n", + "Cbc0010I After 19452000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1457.46 seconds)\n", + "Cbc0010I After 19453000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1457.54 seconds)\n", + "Cbc0010I After 19454000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1457.61 seconds)\n", + "Cbc0010I After 19455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1457.69 seconds)\n", + "Cbc0010I After 19456000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1457.76 seconds)\n", + "Cbc0010I After 19457000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1457.84 seconds)\n", + "Cbc0010I After 19458000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1457.90 seconds)\n", + "Cbc0010I After 19459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1457.97 seconds)\n", + "Cbc0010I After 19460000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1458.04 seconds)\n", + "Cbc0010I After 19461000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1458.12 seconds)\n", + "Cbc0010I After 19462000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1458.19 seconds)\n", + "Cbc0010I After 19463000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1458.26 seconds)\n", + "Cbc0010I After 19464000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1458.33 seconds)\n", + "Cbc0010I After 19465000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1458.40 seconds)\n", + "Cbc0010I After 19466000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1458.48 seconds)\n", + "Cbc0010I After 19467000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1458.55 seconds)\n", + "Cbc0010I After 19468000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1458.62 seconds)\n", + "Cbc0010I After 19469000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1458.70 seconds)\n", + "Cbc0010I After 19470000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1458.77 seconds)\n", + "Cbc0010I After 19471000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1458.84 seconds)\n", + "Cbc0010I After 19472000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1458.91 seconds)\n", + "Cbc0010I After 19473000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1458.98 seconds)\n", + "Cbc0010I After 19474000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1459.06 seconds)\n", + "Cbc0010I After 19475000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1459.13 seconds)\n", + "Cbc0010I After 19476000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1459.20 seconds)\n", + "Cbc0010I After 19477000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1459.28 seconds)\n", + "Cbc0010I After 19478000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1459.35 seconds)\n", + "Cbc0010I After 19479000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1459.41 seconds)\n", + "Cbc0010I After 19480000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1459.48 seconds)\n", + "Cbc0010I After 19481000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1459.56 seconds)\n", + "Cbc0010I After 19482000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1459.63 seconds)\n", + "Cbc0010I After 19483000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1459.70 seconds)\n", + "Cbc0010I After 19484000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1459.78 seconds)\n", + "Cbc0010I After 19485000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1459.85 seconds)\n", + "Cbc0010I After 19486000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1459.92 seconds)\n", + "Cbc0010I After 19487000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1459.99 seconds)\n", + "Cbc0010I After 19488000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1460.07 seconds)\n", + "Cbc0010I After 19489000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1460.14 seconds)\n", + "Cbc0010I After 19490000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1460.21 seconds)\n", + "Cbc0010I After 19491000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1460.29 seconds)\n", + "Cbc0010I After 19492000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1460.36 seconds)\n", + "Cbc0010I After 19493000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1460.44 seconds)\n", + "Cbc0010I After 19494000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1460.54 seconds)\n", + "Cbc0010I After 19495000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1460.63 seconds)\n", + "Cbc0010I After 19496000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1460.71 seconds)\n", + "Cbc0010I After 19497000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1460.78 seconds)\n", + "Cbc0010I After 19498000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1460.85 seconds)\n", + "Cbc0010I After 19499000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1460.92 seconds)\n", + "Cbc0010I After 19500000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1460.99 seconds)\n", + "Cbc0010I After 19501000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1461.07 seconds)\n", + "Cbc0010I After 19502000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1461.13 seconds)\n", + "Cbc0010I After 19503000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1461.20 seconds)\n", + "Cbc0010I After 19504000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1461.27 seconds)\n", + "Cbc0010I After 19505000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1461.35 seconds)\n", + "Cbc0010I After 19506000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1461.42 seconds)\n", + "Cbc0010I After 19507000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1461.49 seconds)\n", + "Cbc0010I After 19508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1461.56 seconds)\n", + "Cbc0010I After 19509000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1461.64 seconds)\n", + "Cbc0010I After 19510000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1461.71 seconds)\n", + "Cbc0010I After 19511000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1461.78 seconds)\n", + "Cbc0010I After 19512000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1461.85 seconds)\n", + "Cbc0010I After 19513000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1461.93 seconds)\n", + "Cbc0010I After 19514000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1462.00 seconds)\n", + "Cbc0010I After 19515000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1462.07 seconds)\n", + "Cbc0010I After 19516000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1462.14 seconds)\n", + "Cbc0010I After 19517000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1462.21 seconds)\n", + "Cbc0010I After 19518000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1462.29 seconds)\n", + "Cbc0010I After 19519000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1462.36 seconds)\n", + "Cbc0010I After 19520000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1462.43 seconds)\n", + "Cbc0010I After 19521000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1462.50 seconds)\n", + "Cbc0010I After 19522000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1462.58 seconds)\n", + "Cbc0010I After 19523000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1462.65 seconds)\n", + "Cbc0010I After 19524000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1462.72 seconds)\n", + "Cbc0010I After 19525000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1462.79 seconds)\n", + "Cbc0010I After 19526000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1462.86 seconds)\n", + "Cbc0010I After 19527000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1462.93 seconds)\n", + "Cbc0010I After 19528000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1463.01 seconds)\n", + "Cbc0010I After 19529000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1463.07 seconds)\n", + "Cbc0010I After 19530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1463.15 seconds)\n", + "Cbc0010I After 19531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1463.22 seconds)\n", + "Cbc0010I After 19532000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1463.30 seconds)\n", + "Cbc0010I After 19533000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1463.37 seconds)\n", + "Cbc0010I After 19534000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1463.44 seconds)\n", + "Cbc0010I After 19535000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1463.52 seconds)\n", + "Cbc0010I After 19536000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1463.60 seconds)\n", + "Cbc0010I After 19537000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1463.67 seconds)\n", + "Cbc0010I After 19538000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1463.74 seconds)\n", + "Cbc0010I After 19539000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1463.81 seconds)\n", + "Cbc0010I After 19540000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1463.89 seconds)\n", + "Cbc0010I After 19541000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1463.96 seconds)\n", + "Cbc0010I After 19542000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1464.03 seconds)\n", + "Cbc0010I After 19543000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1464.09 seconds)\n", + "Cbc0010I After 19544000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1464.16 seconds)\n", + "Cbc0010I After 19545000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.23 seconds)\n", + "Cbc0010I After 19546000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.30 seconds)\n", + "Cbc0010I After 19547000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1464.37 seconds)\n", + "Cbc0010I After 19548000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1464.44 seconds)\n", + "Cbc0010I After 19549000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.51 seconds)\n", + "Cbc0010I After 19550000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1464.58 seconds)\n", + "Cbc0010I After 19551000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1464.66 seconds)\n", + "Cbc0010I After 19552000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1464.72 seconds)\n", + "Cbc0010I After 19553000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1464.79 seconds)\n", + "Cbc0010I After 19554000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1464.87 seconds)\n", + "Cbc0010I After 19555000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1464.94 seconds)\n", + "Cbc0010I After 19556000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1465.01 seconds)\n", + "Cbc0010I After 19557000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1465.09 seconds)\n", + "Cbc0010I After 19558000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1465.16 seconds)\n", + "Cbc0010I After 19559000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1465.24 seconds)\n", + "Cbc0010I After 19560000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1465.31 seconds)\n", + "Cbc0010I After 19561000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1465.38 seconds)\n", + "Cbc0010I After 19562000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1465.46 seconds)\n", + "Cbc0010I After 19563000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1465.53 seconds)\n", + "Cbc0010I After 19564000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1465.60 seconds)\n", + "Cbc0010I After 19565000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1465.67 seconds)\n", + "Cbc0010I After 19566000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1465.74 seconds)\n", + "Cbc0010I After 19567000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1465.82 seconds)\n", + "Cbc0010I After 19568000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1465.89 seconds)\n", + "Cbc0010I After 19569000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1465.96 seconds)\n", + "Cbc0010I After 19570000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1466.03 seconds)\n", + "Cbc0010I After 19571000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1466.10 seconds)\n", + "Cbc0010I After 19572000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1466.18 seconds)\n", + "Cbc0010I After 19573000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1466.25 seconds)\n", + "Cbc0010I After 19574000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1466.34 seconds)\n", + "Cbc0010I After 19575000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1466.42 seconds)\n", + "Cbc0010I After 19576000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1466.49 seconds)\n", + "Cbc0010I After 19577000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1466.56 seconds)\n", + "Cbc0010I After 19578000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1466.69 seconds)\n", + "Cbc0010I After 19579000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1466.78 seconds)\n", + "Cbc0010I After 19580000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1466.88 seconds)\n", + "Cbc0010I After 19581000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1466.97 seconds)\n", + "Cbc0010I After 19582000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1467.05 seconds)\n", + "Cbc0010I After 19583000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1467.13 seconds)\n", + "Cbc0010I After 19584000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1467.20 seconds)\n", + "Cbc0010I After 19585000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1467.31 seconds)\n", + "Cbc0010I After 19586000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1467.40 seconds)\n", + "Cbc0010I After 19587000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1467.47 seconds)\n", + "Cbc0010I After 19588000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1467.54 seconds)\n", + "Cbc0010I After 19589000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1467.60 seconds)\n", + "Cbc0010I After 19590000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1467.67 seconds)\n", + "Cbc0010I After 19591000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1467.74 seconds)\n", + "Cbc0010I After 19592000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1467.81 seconds)\n", + "Cbc0010I After 19593000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1467.87 seconds)\n", + "Cbc0010I After 19594000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1467.94 seconds)\n", + "Cbc0010I After 19595000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1468.01 seconds)\n", + "Cbc0010I After 19596000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1468.08 seconds)\n", + "Cbc0010I After 19597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1468.15 seconds)\n", + "Cbc0010I After 19598000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1468.22 seconds)\n", + "Cbc0010I After 19599000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1468.29 seconds)\n", + "Cbc0010I After 19600000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1468.36 seconds)\n", + "Cbc0010I After 19601000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1468.43 seconds)\n", + "Cbc0010I After 19602000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1468.50 seconds)\n", + "Cbc0010I After 19603000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1468.56 seconds)\n", + "Cbc0010I After 19604000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1468.63 seconds)\n", + "Cbc0010I After 19605000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1468.70 seconds)\n", + "Cbc0010I After 19606000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1468.77 seconds)\n", + "Cbc0010I After 19607000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1468.84 seconds)\n", + "Cbc0010I After 19608000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1468.91 seconds)\n", + "Cbc0010I After 19609000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1468.97 seconds)\n", + "Cbc0010I After 19610000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1469.04 seconds)\n", + "Cbc0010I After 19611000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1469.11 seconds)\n", + "Cbc0010I After 19612000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1469.18 seconds)\n", + "Cbc0010I After 19613000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1469.25 seconds)\n", + "Cbc0010I After 19614000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1469.31 seconds)\n", + "Cbc0010I After 19615000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1469.38 seconds)\n", + "Cbc0010I After 19616000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1469.46 seconds)\n", + "Cbc0010I After 19617000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1469.54 seconds)\n", + "Cbc0010I After 19618000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1469.62 seconds)\n", + "Cbc0010I After 19619000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1469.70 seconds)\n", + "Cbc0010I After 19620000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1469.77 seconds)\n", + "Cbc0010I After 19621000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1469.84 seconds)\n", + "Cbc0010I After 19622000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1469.91 seconds)\n", + "Cbc0010I After 19623000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1469.98 seconds)\n", + "Cbc0010I After 19624000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1470.05 seconds)\n", + "Cbc0010I After 19625000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1470.12 seconds)\n", + "Cbc0010I After 19626000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1470.19 seconds)\n", + "Cbc0010I After 19627000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1470.27 seconds)\n", + "Cbc0010I After 19628000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1470.34 seconds)\n", + "Cbc0010I After 19629000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1470.41 seconds)\n", + "Cbc0010I After 19630000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1470.48 seconds)\n", + "Cbc0010I After 19631000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1470.56 seconds)\n", + "Cbc0010I After 19632000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1470.63 seconds)\n", + "Cbc0010I After 19633000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1470.70 seconds)\n", + "Cbc0010I After 19634000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1470.77 seconds)\n", + "Cbc0010I After 19635000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1470.84 seconds)\n", + "Cbc0010I After 19636000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1470.92 seconds)\n", + "Cbc0010I After 19637000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1471.00 seconds)\n", + "Cbc0010I After 19638000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1471.08 seconds)\n", + "Cbc0010I After 19639000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1471.15 seconds)\n", + "Cbc0010I After 19640000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1471.22 seconds)\n", + "Cbc0010I After 19641000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1471.29 seconds)\n", + "Cbc0010I After 19642000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1471.36 seconds)\n", + "Cbc0010I After 19643000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1471.43 seconds)\n", + "Cbc0010I After 19644000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1471.50 seconds)\n", + "Cbc0010I After 19645000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1471.57 seconds)\n", + "Cbc0010I After 19646000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1471.65 seconds)\n", + "Cbc0010I After 19647000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1471.72 seconds)\n", + "Cbc0010I After 19648000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1471.79 seconds)\n", + "Cbc0010I After 19649000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1471.86 seconds)\n", + "Cbc0010I After 19650000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1471.92 seconds)\n", + "Cbc0010I After 19651000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1471.99 seconds)\n", + "Cbc0010I After 19652000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1472.06 seconds)\n", + "Cbc0010I After 19653000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1472.12 seconds)\n", + "Cbc0010I After 19654000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1472.19 seconds)\n", + "Cbc0010I After 19655000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.26 seconds)\n", + "Cbc0010I After 19656000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1472.33 seconds)\n", + "Cbc0010I After 19657000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1472.41 seconds)\n", + "Cbc0010I After 19658000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.48 seconds)\n", + "Cbc0010I After 19659000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1472.54 seconds)\n", + "Cbc0010I After 19660000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1472.61 seconds)\n", + "Cbc0010I After 19661000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1472.70 seconds)\n", + "Cbc0010I After 19662000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1472.78 seconds)\n", + "Cbc0010I After 19663000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.86 seconds)\n", + "Cbc0010I After 19664000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1472.93 seconds)\n", + "Cbc0010I After 19665000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1473.01 seconds)\n", + "Cbc0010I After 19666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.08 seconds)\n", + "Cbc0010I After 19667000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1473.15 seconds)\n", + "Cbc0010I After 19668000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1473.23 seconds)\n", + "Cbc0010I After 19669000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.30 seconds)\n", + "Cbc0010I After 19670000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1473.38 seconds)\n", + "Cbc0010I After 19671000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1473.45 seconds)\n", + "Cbc0010I After 19672000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1473.53 seconds)\n", + "Cbc0010I After 19673000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1473.60 seconds)\n", + "Cbc0010I After 19674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.67 seconds)\n", + "Cbc0010I After 19675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1473.75 seconds)\n", + "Cbc0010I After 19676000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1473.82 seconds)\n", + "Cbc0010I After 19677000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1473.90 seconds)\n", + "Cbc0010I After 19678000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1473.97 seconds)\n", + "Cbc0010I After 19679000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1474.04 seconds)\n", + "Cbc0010I After 19680000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1474.11 seconds)\n", + "Cbc0010I After 19681000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1474.18 seconds)\n", + "Cbc0010I After 19682000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1474.25 seconds)\n", + "Cbc0010I After 19683000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1474.32 seconds)\n", + "Cbc0010I After 19684000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1474.39 seconds)\n", + "Cbc0010I After 19685000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1474.46 seconds)\n", + "Cbc0010I After 19686000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1474.52 seconds)\n", + "Cbc0010I After 19687000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1474.60 seconds)\n", + "Cbc0010I After 19688000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1474.66 seconds)\n", + "Cbc0010I After 19689000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1474.73 seconds)\n", + "Cbc0010I After 19690000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1474.80 seconds)\n", + "Cbc0010I After 19691000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1474.88 seconds)\n", + "Cbc0010I After 19692000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1474.96 seconds)\n", + "Cbc0010I After 19693000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1475.04 seconds)\n", + "Cbc0010I After 19694000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1475.11 seconds)\n", + "Cbc0010I After 19695000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1475.19 seconds)\n", + "Cbc0010I After 19696000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1475.26 seconds)\n", + "Cbc0010I After 19697000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1475.33 seconds)\n", + "Cbc0010I After 19698000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1475.41 seconds)\n", + "Cbc0010I After 19699000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1475.47 seconds)\n", + "Cbc0010I After 19700000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1475.54 seconds)\n", + "Cbc0010I After 19701000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1475.62 seconds)\n", + "Cbc0010I After 19702000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1475.69 seconds)\n", + "Cbc0010I After 19703000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1475.77 seconds)\n", + "Cbc0010I After 19704000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1475.84 seconds)\n", + "Cbc0010I After 19705000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1475.92 seconds)\n", + "Cbc0010I After 19706000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1476.00 seconds)\n", + "Cbc0010I After 19707000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1476.08 seconds)\n", + "Cbc0010I After 19708000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1476.15 seconds)\n", + "Cbc0010I After 19709000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1476.22 seconds)\n", + "Cbc0010I After 19710000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1476.29 seconds)\n", + "Cbc0010I After 19711000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1476.37 seconds)\n", + "Cbc0010I After 19712000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1476.44 seconds)\n", + "Cbc0010I After 19713000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1476.51 seconds)\n", + "Cbc0010I After 19714000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1476.59 seconds)\n", + "Cbc0010I After 19715000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1476.66 seconds)\n", + "Cbc0010I After 19716000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1476.74 seconds)\n", + "Cbc0010I After 19717000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1476.83 seconds)\n", + "Cbc0010I After 19718000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1476.90 seconds)\n", + "Cbc0010I After 19719000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1476.97 seconds)\n", + "Cbc0010I After 19720000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1477.04 seconds)\n", + "Cbc0010I After 19721000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1477.11 seconds)\n", + "Cbc0010I After 19722000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1477.18 seconds)\n", + "Cbc0010I After 19723000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1477.25 seconds)\n", + "Cbc0010I After 19724000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1477.32 seconds)\n", + "Cbc0010I After 19725000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1477.39 seconds)\n", + "Cbc0010I After 19726000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1477.45 seconds)\n", + "Cbc0010I After 19727000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1477.51 seconds)\n", + "Cbc0010I After 19728000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1477.58 seconds)\n", + "Cbc0010I After 19729000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1477.65 seconds)\n", + "Cbc0010I After 19730000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1477.72 seconds)\n", + "Cbc0010I After 19731000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1477.79 seconds)\n", + "Cbc0010I After 19732000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1477.86 seconds)\n", + "Cbc0010I After 19733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1477.92 seconds)\n", + "Cbc0010I After 19734000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1478.00 seconds)\n", + "Cbc0010I After 19735000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1478.07 seconds)\n", + "Cbc0010I After 19736000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1478.14 seconds)\n", + "Cbc0010I After 19737000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1478.20 seconds)\n", + "Cbc0010I After 19738000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1478.27 seconds)\n", + "Cbc0010I After 19739000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1478.34 seconds)\n", + "Cbc0010I After 19740000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1478.41 seconds)\n", + "Cbc0010I After 19741000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1478.48 seconds)\n", + "Cbc0010I After 19742000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1478.56 seconds)\n", + "Cbc0010I After 19743000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1478.64 seconds)\n", + "Cbc0010I After 19744000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1478.71 seconds)\n", + "Cbc0010I After 19745000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1478.82 seconds)\n", + "Cbc0010I After 19746000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1478.91 seconds)\n", + "Cbc0010I After 19747000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1478.99 seconds)\n", + "Cbc0010I After 19748000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1479.07 seconds)\n", + "Cbc0010I After 19749000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1479.14 seconds)\n", + "Cbc0010I After 19750000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1479.21 seconds)\n", + "Cbc0010I After 19751000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1479.29 seconds)\n", + "Cbc0010I After 19752000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1479.36 seconds)\n", + "Cbc0010I After 19753000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1479.44 seconds)\n", + "Cbc0010I After 19754000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1479.51 seconds)\n", + "Cbc0010I After 19755000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1479.58 seconds)\n", + "Cbc0010I After 19756000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1479.65 seconds)\n", + "Cbc0010I After 19757000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1479.72 seconds)\n", + "Cbc0010I After 19758000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1479.80 seconds)\n", + "Cbc0010I After 19759000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1479.87 seconds)\n", + "Cbc0010I After 19760000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1479.94 seconds)\n", + "Cbc0010I After 19761000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1480.01 seconds)\n", + "Cbc0010I After 19762000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1480.08 seconds)\n", + "Cbc0010I After 19763000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1480.15 seconds)\n", + "Cbc0010I After 19764000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1480.23 seconds)\n", + "Cbc0010I After 19765000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1480.30 seconds)\n", + "Cbc0010I After 19766000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1480.38 seconds)\n", + "Cbc0010I After 19767000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1480.45 seconds)\n", + "Cbc0010I After 19768000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1480.53 seconds)\n", + "Cbc0010I After 19769000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1480.60 seconds)\n", + "Cbc0010I After 19770000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1480.67 seconds)\n", + "Cbc0010I After 19771000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1480.74 seconds)\n", + "Cbc0010I After 19772000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1480.81 seconds)\n", + "Cbc0010I After 19773000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1480.88 seconds)\n", + "Cbc0010I After 19774000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1480.95 seconds)\n", + "Cbc0010I After 19775000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1481.01 seconds)\n", + "Cbc0010I After 19776000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1481.08 seconds)\n", + "Cbc0010I After 19777000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1481.15 seconds)\n", + "Cbc0010I After 19778000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1481.23 seconds)\n", + "Cbc0010I After 19779000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1481.30 seconds)\n", + "Cbc0010I After 19780000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1481.37 seconds)\n", + "Cbc0010I After 19781000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1481.45 seconds)\n", + "Cbc0010I After 19782000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1481.52 seconds)\n", + "Cbc0010I After 19783000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1481.59 seconds)\n", + "Cbc0010I After 19784000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1481.66 seconds)\n", + "Cbc0010I After 19785000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1481.73 seconds)\n", + "Cbc0010I After 19786000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1481.86 seconds)\n", + "Cbc0010I After 19787000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1481.95 seconds)\n", + "Cbc0010I After 19788000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1482.03 seconds)\n", + "Cbc0010I After 19789000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1482.11 seconds)\n", + "Cbc0010I After 19790000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1482.19 seconds)\n", + "Cbc0010I After 19791000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1482.26 seconds)\n", + "Cbc0010I After 19792000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1482.33 seconds)\n", + "Cbc0010I After 19793000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1482.40 seconds)\n", + "Cbc0010I After 19794000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1482.48 seconds)\n", + "Cbc0010I After 19795000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1482.55 seconds)\n", + "Cbc0010I After 19796000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1482.63 seconds)\n", + "Cbc0010I After 19797000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1482.69 seconds)\n", + "Cbc0010I After 19798000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1482.77 seconds)\n", + "Cbc0010I After 19799000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1482.83 seconds)\n", + "Cbc0010I After 19800000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1482.90 seconds)\n", + "Cbc0010I After 19801000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1482.98 seconds)\n", + "Cbc0010I After 19802000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1483.05 seconds)\n", + "Cbc0010I After 19803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1483.13 seconds)\n", + "Cbc0010I After 19804000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1483.20 seconds)\n", + "Cbc0010I After 19805000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1483.27 seconds)\n", + "Cbc0010I After 19806000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1483.34 seconds)\n", + "Cbc0010I After 19807000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1483.41 seconds)\n", + "Cbc0010I After 19808000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1483.47 seconds)\n", + "Cbc0010I After 19809000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1483.54 seconds)\n", + "Cbc0010I After 19810000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1483.61 seconds)\n", + "Cbc0010I After 19811000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1483.68 seconds)\n", + "Cbc0010I After 19812000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1483.75 seconds)\n", + "Cbc0010I After 19813000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1483.82 seconds)\n", + "Cbc0010I After 19814000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1483.89 seconds)\n", + "Cbc0010I After 19815000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1483.96 seconds)\n", + "Cbc0010I After 19816000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1484.03 seconds)\n", + "Cbc0010I After 19817000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1484.09 seconds)\n", + "Cbc0010I After 19818000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1484.16 seconds)\n", + "Cbc0010I After 19819000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1484.23 seconds)\n", + "Cbc0010I After 19820000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1484.30 seconds)\n", + "Cbc0010I After 19821000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1484.39 seconds)\n", + "Cbc0010I After 19822000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1484.48 seconds)\n", + "Cbc0010I After 19823000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1484.56 seconds)\n", + "Cbc0010I After 19824000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1484.64 seconds)\n", + "Cbc0010I After 19825000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1484.71 seconds)\n", + "Cbc0010I After 19826000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1484.78 seconds)\n", + "Cbc0010I After 19827000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1484.85 seconds)\n", + "Cbc0010I After 19828000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1484.93 seconds)\n", + "Cbc0010I After 19829000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1485.00 seconds)\n", + "Cbc0010I After 19830000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1485.07 seconds)\n", + "Cbc0010I After 19831000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1485.15 seconds)\n", + "Cbc0010I After 19832000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1485.22 seconds)\n", + "Cbc0010I After 19833000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1485.30 seconds)\n", + "Cbc0010I After 19834000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1485.37 seconds)\n", + "Cbc0010I After 19835000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1485.45 seconds)\n", + "Cbc0010I After 19836000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1485.52 seconds)\n", + "Cbc0010I After 19837000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1485.59 seconds)\n", + "Cbc0010I After 19838000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1485.67 seconds)\n", + "Cbc0010I After 19839000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1485.74 seconds)\n", + "Cbc0010I After 19840000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1485.82 seconds)\n", + "Cbc0010I After 19841000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1485.89 seconds)\n", + "Cbc0010I After 19842000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1485.96 seconds)\n", + "Cbc0010I After 19843000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1486.04 seconds)\n", + "Cbc0010I After 19844000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1486.11 seconds)\n", + "Cbc0010I After 19845000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1486.19 seconds)\n", + "Cbc0010I After 19846000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1486.25 seconds)\n", + "Cbc0010I After 19847000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1486.32 seconds)\n", + "Cbc0010I After 19848000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1486.40 seconds)\n", + "Cbc0010I After 19849000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1486.47 seconds)\n", + "Cbc0010I After 19850000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1486.55 seconds)\n", + "Cbc0010I After 19851000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1486.63 seconds)\n", + "Cbc0010I After 19852000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1486.70 seconds)\n", + "Cbc0010I After 19853000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1486.77 seconds)\n", + "Cbc0010I After 19854000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1486.84 seconds)\n", + "Cbc0010I After 19855000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1486.92 seconds)\n", + "Cbc0010I After 19856000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1486.99 seconds)\n", + "Cbc0010I After 19857000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1487.06 seconds)\n", + "Cbc0010I After 19858000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1487.13 seconds)\n", + "Cbc0010I After 19859000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.21 seconds)\n", + "Cbc0010I After 19860000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1487.28 seconds)\n", + "Cbc0010I After 19861000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1487.37 seconds)\n", + "Cbc0010I After 19862000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1487.45 seconds)\n", + "Cbc0010I After 19863000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1487.53 seconds)\n", + "Cbc0010I After 19864000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.60 seconds)\n", + "Cbc0010I After 19865000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1487.67 seconds)\n", + "Cbc0010I After 19866000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1487.74 seconds)\n", + "Cbc0010I After 19867000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1487.81 seconds)\n", + "Cbc0010I After 19868000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1487.89 seconds)\n", + "Cbc0010I After 19869000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.96 seconds)\n", + "Cbc0010I After 19870000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1488.05 seconds)\n", + "Cbc0010I After 19871000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1488.12 seconds)\n", + "Cbc0010I After 19872000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1488.19 seconds)\n", + "Cbc0010I After 19873000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1488.26 seconds)\n", + "Cbc0010I After 19874000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1488.33 seconds)\n", + "Cbc0010I After 19875000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1488.42 seconds)\n", + "Cbc0010I After 19876000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1488.50 seconds)\n", + "Cbc0010I After 19877000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1488.57 seconds)\n", + "Cbc0010I After 19878000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1488.64 seconds)\n", + "Cbc0010I After 19879000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1488.72 seconds)\n", + "Cbc0010I After 19880000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1488.80 seconds)\n", + "Cbc0010I After 19881000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1488.87 seconds)\n", + "Cbc0010I After 19882000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1488.94 seconds)\n", + "Cbc0010I After 19883000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1489.00 seconds)\n", + "Cbc0010I After 19884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1489.07 seconds)\n", + "Cbc0010I After 19885000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1489.14 seconds)\n", + "Cbc0010I After 19886000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1489.20 seconds)\n", + "Cbc0010I After 19887000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1489.27 seconds)\n", + "Cbc0010I After 19888000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1489.34 seconds)\n", + "Cbc0010I After 19889000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1489.42 seconds)\n", + "Cbc0010I After 19890000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1489.49 seconds)\n", + "Cbc0010I After 19891000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1489.56 seconds)\n", + "Cbc0010I After 19892000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1489.63 seconds)\n", + "Cbc0010I After 19893000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1489.70 seconds)\n", + "Cbc0010I After 19894000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1489.77 seconds)\n", + "Cbc0010I After 19895000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1489.84 seconds)\n", + "Cbc0010I After 19896000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1489.92 seconds)\n", + "Cbc0010I After 19897000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1489.98 seconds)\n", + "Cbc0010I After 19898000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1490.05 seconds)\n", + "Cbc0010I After 19899000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1490.12 seconds)\n", + "Cbc0010I After 19900000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1490.19 seconds)\n", + "Cbc0010I After 19901000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1490.26 seconds)\n", + "Cbc0010I After 19902000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1490.33 seconds)\n", + "Cbc0010I After 19903000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1490.40 seconds)\n", + "Cbc0010I After 19904000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1490.47 seconds)\n", + "Cbc0010I After 19905000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1490.54 seconds)\n", + "Cbc0010I After 19906000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1490.61 seconds)\n", + "Cbc0010I After 19907000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1490.68 seconds)\n", + "Cbc0010I After 19908000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1490.75 seconds)\n", + "Cbc0010I After 19909000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1490.82 seconds)\n", + "Cbc0010I After 19910000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1490.89 seconds)\n", + "Cbc0010I After 19911000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1490.97 seconds)\n", + "Cbc0010I After 19912000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1491.05 seconds)\n", + "Cbc0010I After 19913000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1491.12 seconds)\n", + "Cbc0010I After 19914000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1491.20 seconds)\n", + "Cbc0010I After 19915000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1491.27 seconds)\n", + "Cbc0010I After 19916000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1491.34 seconds)\n", + "Cbc0010I After 19917000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1491.41 seconds)\n", + "Cbc0010I After 19918000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1491.48 seconds)\n", + "Cbc0010I After 19919000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1491.55 seconds)\n", + "Cbc0010I After 19920000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1491.62 seconds)\n", + "Cbc0010I After 19921000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (1491.69 seconds)\n", + "Cbc0010I After 19922000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1491.76 seconds)\n", + "Cbc0010I After 19923000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1491.84 seconds)\n", + "Cbc0010I After 19924000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1491.91 seconds)\n", + "Cbc0010I After 19925000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1491.98 seconds)\n", + "Cbc0010I After 19926000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1492.05 seconds)\n", + "Cbc0010I After 19927000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1492.12 seconds)\n", + "Cbc0010I After 19928000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1492.20 seconds)\n", + "Cbc0010I After 19929000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1492.27 seconds)\n", + "Cbc0010I After 19930000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1492.34 seconds)\n", + "Cbc0010I After 19931000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1492.41 seconds)\n", + "Cbc0010I After 19932000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1492.49 seconds)\n", + "Cbc0010I After 19933000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1492.56 seconds)\n", + "Cbc0010I After 19934000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1492.63 seconds)\n", + "Cbc0010I After 19935000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1492.70 seconds)\n", + "Cbc0010I After 19936000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1492.78 seconds)\n", + "Cbc0010I After 19937000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1492.85 seconds)\n", + "Cbc0010I After 19938000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1492.93 seconds)\n", + "Cbc0010I After 19939000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1493.00 seconds)\n", + "Cbc0010I After 19940000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1493.08 seconds)\n", + "Cbc0010I After 19941000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1493.15 seconds)\n", + "Cbc0010I After 19942000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1493.22 seconds)\n", + "Cbc0010I After 19943000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1493.29 seconds)\n", + "Cbc0010I After 19944000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1493.37 seconds)\n", + "Cbc0010I After 19945000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1493.44 seconds)\n", + "Cbc0010I After 19946000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1493.51 seconds)\n", + "Cbc0010I After 19947000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1493.59 seconds)\n", + "Cbc0010I After 19948000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1493.66 seconds)\n", + "Cbc0010I After 19949000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1493.73 seconds)\n", + "Cbc0010I After 19950000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1493.81 seconds)\n", + "Cbc0010I After 19951000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1493.88 seconds)\n", + "Cbc0010I After 19952000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1493.95 seconds)\n", + "Cbc0010I After 19953000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1494.03 seconds)\n", + "Cbc0010I After 19954000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1494.10 seconds)\n", + "Cbc0010I After 19955000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1494.17 seconds)\n", + "Cbc0010I After 19956000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1494.25 seconds)\n", + "Cbc0010I After 19957000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1494.32 seconds)\n", + "Cbc0010I After 19958000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1494.40 seconds)\n", + "Cbc0010I After 19959000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1494.47 seconds)\n", + "Cbc0010I After 19960000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1494.54 seconds)\n", + "Cbc0010I After 19961000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1494.61 seconds)\n", + "Cbc0010I After 19962000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1494.69 seconds)\n", + "Cbc0010I After 19963000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1494.75 seconds)\n", + "Cbc0010I After 19964000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1494.83 seconds)\n", + "Cbc0010I After 19965000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1494.91 seconds)\n", + "Cbc0010I After 19966000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1494.98 seconds)\n", + "Cbc0010I After 19967000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1495.06 seconds)\n", + "Cbc0010I After 19968000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1495.13 seconds)\n", + "Cbc0010I After 19969000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1495.20 seconds)\n", + "Cbc0010I After 19970000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1495.28 seconds)\n", + "Cbc0010I After 19971000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1495.36 seconds)\n", + "Cbc0010I After 19972000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1495.43 seconds)\n", + "Cbc0010I After 19973000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1495.50 seconds)\n", + "Cbc0010I After 19974000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1495.57 seconds)\n", + "Cbc0010I After 19975000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1495.65 seconds)\n", + "Cbc0010I After 19976000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1495.72 seconds)\n", + "Cbc0010I After 19977000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1495.80 seconds)\n", + "Cbc0010I After 19978000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1495.87 seconds)\n", + "Cbc0010I After 19979000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1495.94 seconds)\n", + "Cbc0010I After 19980000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1496.03 seconds)\n", + "Cbc0010I After 19981000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1496.11 seconds)\n", + "Cbc0010I After 19982000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1496.19 seconds)\n", + "Cbc0010I After 19983000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1496.26 seconds)\n", + "Cbc0010I After 19984000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1496.34 seconds)\n", + "Cbc0010I After 19985000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1496.41 seconds)\n", + "Cbc0010I After 19986000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1496.48 seconds)\n", + "Cbc0010I After 19987000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1496.55 seconds)\n", + "Cbc0010I After 19988000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1496.63 seconds)\n", + "Cbc0010I After 19989000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1496.70 seconds)\n", + "Cbc0010I After 19990000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1496.77 seconds)\n", + "Cbc0010I After 19991000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1496.84 seconds)\n", + "Cbc0010I After 19992000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1496.92 seconds)\n", + "Cbc0010I After 19993000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1496.99 seconds)\n", + "Cbc0010I After 19994000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1497.07 seconds)\n", + "Cbc0010I After 19995000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1497.22 seconds)\n", + "Cbc0010I After 19996000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1497.31 seconds)\n", + "Cbc0010I After 19997000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1497.42 seconds)\n", + "Cbc0010I After 19998000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1497.53 seconds)\n", + "Cbc0010I After 19999000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1497.62 seconds)\n", + "Cbc0010I After 20000000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1497.70 seconds)\n", + "Cbc0010I After 20001000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1497.78 seconds)\n", + "Cbc0010I After 20002000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1497.86 seconds)\n", + "Cbc0010I After 20003000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1497.93 seconds)\n", + "Cbc0010I After 20004000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1498.01 seconds)\n", + "Cbc0010I After 20005000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1498.08 seconds)\n", + "Cbc0010I After 20006000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1498.15 seconds)\n", + "Cbc0010I After 20007000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1498.22 seconds)\n", + "Cbc0010I After 20008000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1498.30 seconds)\n", + "Cbc0010I After 20009000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1498.37 seconds)\n", + "Cbc0010I After 20010000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1498.45 seconds)\n", + "Cbc0010I After 20011000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1498.53 seconds)\n", + "Cbc0010I After 20012000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1498.60 seconds)\n", + "Cbc0010I After 20013000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1498.68 seconds)\n", + "Cbc0010I After 20014000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1498.75 seconds)\n", + "Cbc0010I After 20015000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1498.83 seconds)\n", + "Cbc0010I After 20016000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1498.91 seconds)\n", + "Cbc0010I After 20017000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1498.98 seconds)\n", + "Cbc0010I After 20018000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1499.05 seconds)\n", + "Cbc0010I After 20019000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1499.13 seconds)\n", + "Cbc0010I After 20020000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1499.21 seconds)\n", + "Cbc0010I After 20021000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1499.28 seconds)\n", + "Cbc0010I After 20022000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1499.38 seconds)\n", + "Cbc0010I After 20023000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1499.49 seconds)\n", + "Cbc0010I After 20024000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1499.58 seconds)\n", + "Cbc0010I After 20025000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1499.66 seconds)\n", + "Cbc0010I After 20026000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1499.74 seconds)\n", + "Cbc0010I After 20027000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1499.81 seconds)\n", + "Cbc0010I After 20028000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1499.89 seconds)\n", + "Cbc0010I After 20029000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1499.96 seconds)\n", + "Cbc0010I After 20030000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1500.04 seconds)\n", + "Cbc0010I After 20031000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1500.12 seconds)\n", + "Cbc0010I After 20032000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1500.19 seconds)\n", + "Cbc0010I After 20033000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1500.27 seconds)\n", + "Cbc0010I After 20034000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1500.34 seconds)\n", + "Cbc0010I After 20035000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1500.42 seconds)\n", + "Cbc0010I After 20036000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1500.50 seconds)\n", + "Cbc0010I After 20037000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1500.58 seconds)\n", + "Cbc0010I After 20038000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1500.64 seconds)\n", + "Cbc0010I After 20039000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1500.70 seconds)\n", + "Cbc0010I After 20040000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1500.76 seconds)\n", + "Cbc0010I After 20041000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1500.82 seconds)\n", + "Cbc0010I After 20042000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1500.88 seconds)\n", + "Cbc0010I After 20043000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1500.94 seconds)\n", + "Cbc0010I After 20044000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1501.00 seconds)\n", + "Cbc0010I After 20045000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1501.06 seconds)\n", + "Cbc0010I After 20046000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1501.12 seconds)\n", + "Cbc0010I After 20047000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1501.18 seconds)\n", + "Cbc0010I After 20048000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1501.23 seconds)\n", + "Cbc0010I After 20049000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1501.30 seconds)\n", + "Cbc0010I After 20050000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1501.37 seconds)\n", + "Cbc0010I After 20051000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1501.43 seconds)\n", + "Cbc0010I After 20052000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1501.49 seconds)\n", + "Cbc0010I After 20053000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1501.55 seconds)\n", + "Cbc0010I After 20054000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1501.61 seconds)\n", + "Cbc0010I After 20055000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1501.66 seconds)\n", + "Cbc0010I After 20056000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1501.72 seconds)\n", + "Cbc0010I After 20057000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1501.78 seconds)\n", + "Cbc0010I After 20058000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1501.83 seconds)\n", + "Cbc0010I After 20059000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1501.89 seconds)\n", + "Cbc0010I After 20060000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1501.95 seconds)\n", + "Cbc0010I After 20061000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1502.02 seconds)\n", + "Cbc0010I After 20062000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1502.07 seconds)\n", + "Cbc0010I After 20063000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1502.13 seconds)\n", + "Cbc0010I After 20064000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1502.19 seconds)\n", + "Cbc0010I After 20065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1502.26 seconds)\n", + "Cbc0010I After 20066000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1502.32 seconds)\n", + "Cbc0010I After 20067000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1502.38 seconds)\n", + "Cbc0010I After 20068000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1502.45 seconds)\n", + "Cbc0010I After 20069000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1502.51 seconds)\n", + "Cbc0010I After 20070000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1502.57 seconds)\n", + "Cbc0010I After 20071000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1502.63 seconds)\n", + "Cbc0010I After 20072000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1502.69 seconds)\n", + "Cbc0010I After 20073000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1502.76 seconds)\n", + "Cbc0010I After 20074000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1502.82 seconds)\n", + "Cbc0010I After 20075000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1502.88 seconds)\n", + "Cbc0010I After 20076000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1502.93 seconds)\n", + "Cbc0010I After 20077000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1503.00 seconds)\n", + "Cbc0010I After 20078000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1503.07 seconds)\n", + "Cbc0010I After 20079000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1503.13 seconds)\n", + "Cbc0010I After 20080000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1503.19 seconds)\n", + "Cbc0010I After 20081000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1503.25 seconds)\n", + "Cbc0010I After 20082000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1503.33 seconds)\n", + "Cbc0010I After 20083000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1503.39 seconds)\n", + "Cbc0010I After 20084000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1503.46 seconds)\n", + "Cbc0010I After 20085000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1503.53 seconds)\n", + "Cbc0010I After 20086000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1503.61 seconds)\n", + "Cbc0010I After 20087000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1503.67 seconds)\n", + "Cbc0010I After 20088000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1503.75 seconds)\n", + "Cbc0010I After 20089000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1503.80 seconds)\n", + "Cbc0010I After 20090000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1503.88 seconds)\n", + "Cbc0010I After 20091000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1503.95 seconds)\n", + "Cbc0010I After 20092000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1504.01 seconds)\n", + "Cbc0010I After 20093000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1504.07 seconds)\n", + "Cbc0010I After 20094000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1504.13 seconds)\n", + "Cbc0010I After 20095000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1504.20 seconds)\n", + "Cbc0010I After 20096000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1504.27 seconds)\n", + "Cbc0010I After 20097000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1504.33 seconds)\n", + "Cbc0010I After 20098000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1504.40 seconds)\n", + "Cbc0010I After 20099000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1504.46 seconds)\n", + "Cbc0010I After 20100000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1504.53 seconds)\n", + "Cbc0010I After 20101000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1504.60 seconds)\n", + "Cbc0010I After 20102000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1504.66 seconds)\n", + "Cbc0010I After 20103000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1504.72 seconds)\n", + "Cbc0010I After 20104000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1504.78 seconds)\n", + "Cbc0010I After 20105000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1504.85 seconds)\n", + "Cbc0010I After 20106000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1504.91 seconds)\n", + "Cbc0010I After 20107000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1504.97 seconds)\n", + "Cbc0010I After 20108000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1505.04 seconds)\n", + "Cbc0010I After 20109000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1505.13 seconds)\n", + "Cbc0010I After 20110000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1505.20 seconds)\n", + "Cbc0010I After 20111000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1505.25 seconds)\n", + "Cbc0010I After 20112000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1505.31 seconds)\n", + "Cbc0010I After 20113000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1505.37 seconds)\n", + "Cbc0010I After 20114000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1505.43 seconds)\n", + "Cbc0010I After 20115000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1505.49 seconds)\n", + "Cbc0010I After 20116000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1505.55 seconds)\n", + "Cbc0010I After 20117000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1505.61 seconds)\n", + "Cbc0010I After 20118000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1505.67 seconds)\n", + "Cbc0010I After 20119000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1505.75 seconds)\n", + "Cbc0010I After 20120000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1505.82 seconds)\n", + "Cbc0010I After 20121000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1505.89 seconds)\n", + "Cbc0010I After 20122000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1505.97 seconds)\n", + "Cbc0010I After 20123000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1506.04 seconds)\n", + "Cbc0010I After 20124000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1506.10 seconds)\n", + "Cbc0010I After 20125000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1506.17 seconds)\n", + "Cbc0010I After 20126000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1506.23 seconds)\n", + "Cbc0010I After 20127000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1506.29 seconds)\n", + "Cbc0010I After 20128000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1506.35 seconds)\n", + "Cbc0010I After 20129000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1506.41 seconds)\n", + "Cbc0010I After 20130000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1506.47 seconds)\n", + "Cbc0010I After 20131000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1506.53 seconds)\n", + "Cbc0010I After 20132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1506.59 seconds)\n", + "Cbc0010I After 20133000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1506.64 seconds)\n", + "Cbc0010I After 20134000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1506.70 seconds)\n", + "Cbc0010I After 20135000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1506.77 seconds)\n", + "Cbc0010I After 20136000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1506.82 seconds)\n", + "Cbc0010I After 20137000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1506.88 seconds)\n", + "Cbc0010I After 20138000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1506.94 seconds)\n", + "Cbc0010I After 20139000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1507.00 seconds)\n", + "Cbc0010I After 20140000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1507.07 seconds)\n", + "Cbc0010I After 20141000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1507.13 seconds)\n", + "Cbc0010I After 20142000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1507.19 seconds)\n", + "Cbc0010I After 20143000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1507.25 seconds)\n", + "Cbc0010I After 20144000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1507.31 seconds)\n", + "Cbc0010I After 20145000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1507.37 seconds)\n", + "Cbc0010I After 20146000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1507.43 seconds)\n", + "Cbc0010I After 20147000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1507.49 seconds)\n", + "Cbc0010I After 20148000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1507.55 seconds)\n", + "Cbc0010I After 20149000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1507.61 seconds)\n", + "Cbc0010I After 20150000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1507.67 seconds)\n", + "Cbc0010I After 20151000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1507.73 seconds)\n", + "Cbc0010I After 20152000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1507.79 seconds)\n", + "Cbc0010I After 20153000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1507.85 seconds)\n", + "Cbc0010I After 20154000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1507.91 seconds)\n", + "Cbc0010I After 20155000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1507.98 seconds)\n", + "Cbc0010I After 20156000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1508.04 seconds)\n", + "Cbc0010I After 20157000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1508.11 seconds)\n", + "Cbc0010I After 20158000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1508.17 seconds)\n", + "Cbc0010I After 20159000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1508.24 seconds)\n", + "Cbc0010I After 20160000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1508.31 seconds)\n", + "Cbc0010I After 20161000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1508.39 seconds)\n", + "Cbc0010I After 20162000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1508.47 seconds)\n", + "Cbc0010I After 20163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1508.54 seconds)\n", + "Cbc0010I After 20164000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1508.59 seconds)\n", + "Cbc0010I After 20165000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1508.64 seconds)\n", + "Cbc0010I After 20166000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1508.71 seconds)\n", + "Cbc0010I After 20167000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1508.76 seconds)\n", + "Cbc0010I After 20168000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1508.82 seconds)\n", + "Cbc0010I After 20169000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1508.88 seconds)\n", + "Cbc0010I After 20170000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1508.94 seconds)\n", + "Cbc0010I After 20171000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1509.01 seconds)\n", + "Cbc0010I After 20172000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1509.17 seconds)\n", + "Cbc0010I After 20173000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1509.32 seconds)\n", + "Cbc0010I After 20174000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1509.40 seconds)\n", + "Cbc0010I After 20175000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1509.46 seconds)\n", + "Cbc0010I After 20176000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1509.54 seconds)\n", + "Cbc0010I After 20177000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1509.61 seconds)\n", + "Cbc0010I After 20178000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1509.68 seconds)\n", + "Cbc0010I After 20179000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1509.73 seconds)\n", + "Cbc0010I After 20180000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1509.78 seconds)\n", + "Cbc0010I After 20181000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1509.85 seconds)\n", + "Cbc0010I After 20182000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1509.91 seconds)\n", + "Cbc0010I After 20183000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1509.99 seconds)\n", + "Cbc0010I After 20184000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1510.08 seconds)\n", + "Cbc0010I After 20185000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1510.16 seconds)\n", + "Cbc0010I After 20186000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1510.22 seconds)\n", + "Cbc0010I After 20187000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1510.28 seconds)\n", + "Cbc0010I After 20188000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1510.34 seconds)\n", + "Cbc0010I After 20189000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1510.40 seconds)\n", + "Cbc0010I After 20190000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1510.45 seconds)\n", + "Cbc0010I After 20191000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1510.51 seconds)\n", + "Cbc0010I After 20192000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1510.57 seconds)\n", + "Cbc0010I After 20193000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1510.63 seconds)\n", + "Cbc0010I After 20194000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1510.69 seconds)\n", + "Cbc0010I After 20195000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1510.75 seconds)\n", + "Cbc0010I After 20196000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1510.81 seconds)\n", + "Cbc0010I After 20197000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1510.88 seconds)\n", + "Cbc0010I After 20198000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1510.93 seconds)\n", + "Cbc0010I After 20199000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1510.99 seconds)\n", + "Cbc0010I After 20200000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1511.05 seconds)\n", + "Cbc0010I After 20201000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1511.12 seconds)\n", + "Cbc0010I After 20202000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1511.19 seconds)\n", + "Cbc0010I After 20203000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1511.27 seconds)\n", + "Cbc0010I After 20204000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1511.35 seconds)\n", + "Cbc0010I After 20205000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1511.42 seconds)\n", + "Cbc0010I After 20206000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1511.50 seconds)\n", + "Cbc0010I After 20207000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1511.56 seconds)\n", + "Cbc0010I After 20208000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1511.64 seconds)\n", + "Cbc0010I After 20209000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1511.71 seconds)\n", + "Cbc0010I After 20210000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1511.78 seconds)\n", + "Cbc0010I After 20211000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1511.85 seconds)\n", + "Cbc0010I After 20212000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1511.93 seconds)\n", + "Cbc0010I After 20213000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1512.00 seconds)\n", + "Cbc0010I After 20214000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1512.07 seconds)\n", + "Cbc0010I After 20215000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1512.14 seconds)\n", + "Cbc0010I After 20216000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1512.22 seconds)\n", + "Cbc0010I After 20217000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1512.30 seconds)\n", + "Cbc0010I After 20218000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1512.36 seconds)\n", + "Cbc0010I After 20219000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1512.44 seconds)\n", + "Cbc0010I After 20220000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1512.51 seconds)\n", + "Cbc0010I After 20221000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1512.57 seconds)\n", + "Cbc0010I After 20222000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1512.64 seconds)\n", + "Cbc0010I After 20223000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1512.71 seconds)\n", + "Cbc0010I After 20224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1512.78 seconds)\n", + "Cbc0010I After 20225000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1512.85 seconds)\n", + "Cbc0010I After 20226000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1512.92 seconds)\n", + "Cbc0010I After 20227000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1512.99 seconds)\n", + "Cbc0010I After 20228000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1513.06 seconds)\n", + "Cbc0010I After 20229000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1513.13 seconds)\n", + "Cbc0010I After 20230000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1513.20 seconds)\n", + "Cbc0010I After 20231000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1513.27 seconds)\n", + "Cbc0010I After 20232000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1513.34 seconds)\n", + "Cbc0010I After 20233000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1513.41 seconds)\n", + "Cbc0010I After 20234000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1513.48 seconds)\n", + "Cbc0010I After 20235000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1513.55 seconds)\n", + "Cbc0010I After 20236000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1513.62 seconds)\n", + "Cbc0010I After 20237000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1513.69 seconds)\n", + "Cbc0010I After 20238000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1513.76 seconds)\n", + "Cbc0010I After 20239000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1513.83 seconds)\n", + "Cbc0010I After 20240000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1513.90 seconds)\n", + "Cbc0010I After 20241000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1513.97 seconds)\n", + "Cbc0010I After 20242000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1514.05 seconds)\n", + "Cbc0010I After 20243000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1514.13 seconds)\n", + "Cbc0010I After 20244000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1514.21 seconds)\n", + "Cbc0010I After 20245000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1514.31 seconds)\n", + "Cbc0010I After 20246000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1514.39 seconds)\n", + "Cbc0010I After 20247000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1514.47 seconds)\n", + "Cbc0010I After 20248000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1514.54 seconds)\n", + "Cbc0010I After 20249000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1514.62 seconds)\n", + "Cbc0010I After 20250000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1514.69 seconds)\n", + "Cbc0010I After 20251000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1514.76 seconds)\n", + "Cbc0010I After 20252000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1514.84 seconds)\n", + "Cbc0010I After 20253000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1514.92 seconds)\n", + "Cbc0010I After 20254000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1514.99 seconds)\n", + "Cbc0010I After 20255000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1515.07 seconds)\n", + "Cbc0010I After 20256000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1515.14 seconds)\n", + "Cbc0010I After 20257000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1515.21 seconds)\n", + "Cbc0010I After 20258000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1515.29 seconds)\n", + "Cbc0010I After 20259000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1515.36 seconds)\n", + "Cbc0010I After 20260000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1515.43 seconds)\n", + "Cbc0010I After 20261000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1515.50 seconds)\n", + "Cbc0010I After 20262000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1515.58 seconds)\n", + "Cbc0010I After 20263000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1515.65 seconds)\n", + "Cbc0010I After 20264000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1515.72 seconds)\n", + "Cbc0010I After 20265000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1515.80 seconds)\n", + "Cbc0010I After 20266000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1515.87 seconds)\n", + "Cbc0010I After 20267000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1515.96 seconds)\n", + "Cbc0010I After 20268000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1516.04 seconds)\n", + "Cbc0010I After 20269000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1516.12 seconds)\n", + "Cbc0010I After 20270000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1516.20 seconds)\n", + "Cbc0010I After 20271000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1516.27 seconds)\n", + "Cbc0010I After 20272000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1516.35 seconds)\n", + "Cbc0010I After 20273000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1516.42 seconds)\n", + "Cbc0010I After 20274000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1516.50 seconds)\n", + "Cbc0010I After 20275000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1516.58 seconds)\n", + "Cbc0010I After 20276000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1516.65 seconds)\n", + "Cbc0010I After 20277000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1516.72 seconds)\n", + "Cbc0010I After 20278000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1516.80 seconds)\n", + "Cbc0010I After 20279000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1516.87 seconds)\n", + "Cbc0010I After 20280000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1516.94 seconds)\n", + "Cbc0010I After 20281000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1517.02 seconds)\n", + "Cbc0010I After 20282000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1517.09 seconds)\n", + "Cbc0010I After 20283000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1517.17 seconds)\n", + "Cbc0010I After 20284000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1517.26 seconds)\n", + "Cbc0010I After 20285000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1517.35 seconds)\n", + "Cbc0010I After 20286000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1517.43 seconds)\n", + "Cbc0010I After 20287000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1517.50 seconds)\n", + "Cbc0010I After 20288000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1517.58 seconds)\n", + "Cbc0010I After 20289000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1517.66 seconds)\n", + "Cbc0010I After 20290000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1517.73 seconds)\n", + "Cbc0010I After 20291000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1517.81 seconds)\n", + "Cbc0010I After 20292000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1517.88 seconds)\n", + "Cbc0010I After 20293000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1517.96 seconds)\n", + "Cbc0010I After 20294000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1518.03 seconds)\n", + "Cbc0010I After 20295000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1518.11 seconds)\n", + "Cbc0010I After 20296000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1518.18 seconds)\n", + "Cbc0010I After 20297000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1518.26 seconds)\n", + "Cbc0010I After 20298000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1518.34 seconds)\n", + "Cbc0010I After 20299000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1518.41 seconds)\n", + "Cbc0010I After 20300000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1518.49 seconds)\n", + "Cbc0010I After 20301000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1518.57 seconds)\n", + "Cbc0010I After 20302000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1518.65 seconds)\n", + "Cbc0010I After 20303000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1518.72 seconds)\n", + "Cbc0010I After 20304000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1518.80 seconds)\n", + "Cbc0010I After 20305000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1518.88 seconds)\n", + "Cbc0010I After 20306000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1518.95 seconds)\n", + "Cbc0010I After 20307000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1519.03 seconds)\n", + "Cbc0010I After 20308000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1519.11 seconds)\n", + "Cbc0010I After 20309000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1519.18 seconds)\n", + "Cbc0010I After 20310000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.26 seconds)\n", + "Cbc0010I After 20311000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1519.35 seconds)\n", + "Cbc0010I After 20312000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1519.44 seconds)\n", + "Cbc0010I After 20313000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1519.52 seconds)\n", + "Cbc0010I After 20314000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.60 seconds)\n", + "Cbc0010I After 20315000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1519.68 seconds)\n", + "Cbc0010I After 20316000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1519.75 seconds)\n", + "Cbc0010I After 20317000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1519.83 seconds)\n", + "Cbc0010I After 20318000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.90 seconds)\n", + "Cbc0010I After 20319000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1519.98 seconds)\n", + "Cbc0010I After 20320000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1520.05 seconds)\n", + "Cbc0010I After 20321000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1520.13 seconds)\n", + "Cbc0010I After 20322000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1520.20 seconds)\n", + "Cbc0010I After 20323000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1520.28 seconds)\n", + "Cbc0010I After 20324000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1520.34 seconds)\n", + "Cbc0010I After 20325000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1520.41 seconds)\n", + "Cbc0010I After 20326000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1520.47 seconds)\n", + "Cbc0010I After 20327000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1520.53 seconds)\n", + "Cbc0010I After 20328000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1520.65 seconds)\n", + "Cbc0010I After 20329000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1520.75 seconds)\n", + "Cbc0010I After 20330000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1520.85 seconds)\n", + "Cbc0010I After 20331000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1520.95 seconds)\n", + "Cbc0010I After 20332000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1521.04 seconds)\n", + "Cbc0010I After 20333000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1521.13 seconds)\n", + "Cbc0010I After 20334000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1521.20 seconds)\n", + "Cbc0010I After 20335000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1521.28 seconds)\n", + "Cbc0010I After 20336000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1521.35 seconds)\n", + "Cbc0010I After 20337000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1521.41 seconds)\n", + "Cbc0010I After 20338000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1521.47 seconds)\n", + "Cbc0010I After 20339000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1521.52 seconds)\n", + "Cbc0010I After 20340000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1521.58 seconds)\n", + "Cbc0010I After 20341000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1521.64 seconds)\n", + "Cbc0010I After 20342000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1521.69 seconds)\n", + "Cbc0010I After 20343000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1521.75 seconds)\n", + "Cbc0010I After 20344000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1521.81 seconds)\n", + "Cbc0010I After 20345000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1521.87 seconds)\n", + "Cbc0010I After 20346000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1521.92 seconds)\n", + "Cbc0010I After 20347000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1522.00 seconds)\n", + "Cbc0010I After 20348000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1522.06 seconds)\n", + "Cbc0010I After 20349000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1522.12 seconds)\n", + "Cbc0010I After 20350000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1522.18 seconds)\n", + "Cbc0010I After 20351000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1522.25 seconds)\n", + "Cbc0010I After 20352000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1522.31 seconds)\n", + "Cbc0010I After 20353000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1522.37 seconds)\n", + "Cbc0010I After 20354000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1522.43 seconds)\n", + "Cbc0010I After 20355000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1522.50 seconds)\n", + "Cbc0010I After 20356000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1522.55 seconds)\n", + "Cbc0010I After 20357000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1522.61 seconds)\n", + "Cbc0010I After 20358000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1522.67 seconds)\n", + "Cbc0010I After 20359000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1522.73 seconds)\n", + "Cbc0010I After 20360000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1522.80 seconds)\n", + "Cbc0010I After 20361000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1522.86 seconds)\n", + "Cbc0010I After 20362000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1522.92 seconds)\n", + "Cbc0010I After 20363000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1522.98 seconds)\n", + "Cbc0010I After 20364000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1523.05 seconds)\n", + "Cbc0010I After 20365000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1523.11 seconds)\n", + "Cbc0010I After 20366000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.18 seconds)\n", + "Cbc0010I After 20367000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1523.24 seconds)\n", + "Cbc0010I After 20368000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1523.29 seconds)\n", + "Cbc0010I After 20369000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.36 seconds)\n", + "Cbc0010I After 20370000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1523.42 seconds)\n", + "Cbc0010I After 20371000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1523.49 seconds)\n", + "Cbc0010I After 20372000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1523.56 seconds)\n", + "Cbc0010I After 20373000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1523.62 seconds)\n", + "Cbc0010I After 20374000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1523.68 seconds)\n", + "Cbc0010I After 20375000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1523.75 seconds)\n", + "Cbc0010I After 20376000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.82 seconds)\n", + "Cbc0010I After 20377000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1523.90 seconds)\n", + "Cbc0010I After 20378000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1523.98 seconds)\n", + "Cbc0010I After 20379000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1524.04 seconds)\n", + "Cbc0010I After 20380000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1524.10 seconds)\n", + "Cbc0010I After 20381000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1524.16 seconds)\n", + "Cbc0010I After 20382000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1524.24 seconds)\n", + "Cbc0010I After 20383000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1524.29 seconds)\n", + "Cbc0010I After 20384000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1524.35 seconds)\n", + "Cbc0010I After 20385000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1524.42 seconds)\n", + "Cbc0010I After 20386000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1524.49 seconds)\n", + "Cbc0010I After 20387000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1524.55 seconds)\n", + "Cbc0010I After 20388000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1524.61 seconds)\n", + "Cbc0010I After 20389000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1524.67 seconds)\n", + "Cbc0010I After 20390000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1524.72 seconds)\n", + "Cbc0010I After 20391000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1524.78 seconds)\n", + "Cbc0010I After 20392000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1524.85 seconds)\n", + "Cbc0010I After 20393000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1524.91 seconds)\n", + "Cbc0010I After 20394000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1524.98 seconds)\n", + "Cbc0010I After 20395000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1525.05 seconds)\n", + "Cbc0010I After 20396000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1525.11 seconds)\n", + "Cbc0010I After 20397000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1525.16 seconds)\n", + "Cbc0010I After 20398000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1525.23 seconds)\n", + "Cbc0010I After 20399000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1525.28 seconds)\n", + "Cbc0010I After 20400000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1525.34 seconds)\n", + "Cbc0010I After 20401000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1525.40 seconds)\n", + "Cbc0010I After 20402000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1525.46 seconds)\n", + "Cbc0010I After 20403000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1525.52 seconds)\n", + "Cbc0010I After 20404000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1525.58 seconds)\n", + "Cbc0010I After 20405000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1525.64 seconds)\n", + "Cbc0010I After 20406000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1525.70 seconds)\n", + "Cbc0010I After 20407000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1525.77 seconds)\n", + "Cbc0010I After 20408000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1525.83 seconds)\n", + "Cbc0010I After 20409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1525.90 seconds)\n", + "Cbc0010I After 20410000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1525.95 seconds)\n", + "Cbc0010I After 20411000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1526.02 seconds)\n", + "Cbc0010I After 20412000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1526.08 seconds)\n", + "Cbc0010I After 20413000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1526.14 seconds)\n", + "Cbc0010I After 20414000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1526.21 seconds)\n", + "Cbc0010I After 20415000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1526.26 seconds)\n", + "Cbc0010I After 20416000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1526.32 seconds)\n", + "Cbc0010I After 20417000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1526.39 seconds)\n", + "Cbc0010I After 20418000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1526.45 seconds)\n", + "Cbc0010I After 20419000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.50 seconds)\n", + "Cbc0010I After 20420000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1526.56 seconds)\n", + "Cbc0010I After 20421000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1526.64 seconds)\n", + "Cbc0010I After 20422000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1526.70 seconds)\n", + "Cbc0010I After 20423000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.75 seconds)\n", + "Cbc0010I After 20424000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1526.81 seconds)\n", + "Cbc0010I After 20425000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1526.86 seconds)\n", + "Cbc0010I After 20426000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.92 seconds)\n", + "Cbc0010I After 20427000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1526.98 seconds)\n", + "Cbc0010I After 20428000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1527.05 seconds)\n", + "Cbc0010I After 20429000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1527.11 seconds)\n", + "Cbc0010I After 20430000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1527.16 seconds)\n", + "Cbc0010I After 20431000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1527.22 seconds)\n", + "Cbc0010I After 20432000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.27 seconds)\n", + "Cbc0010I After 20433000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1527.33 seconds)\n", + "Cbc0010I After 20434000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1527.38 seconds)\n", + "Cbc0010I After 20435000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1527.44 seconds)\n", + "Cbc0010I After 20436000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.50 seconds)\n", + "Cbc0010I After 20437000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1527.56 seconds)\n", + "Cbc0010I After 20438000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1527.61 seconds)\n", + "Cbc0010I After 20439000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1527.67 seconds)\n", + "Cbc0010I After 20440000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1527.73 seconds)\n", + "Cbc0010I After 20441000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1527.79 seconds)\n", + "Cbc0010I After 20442000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1527.84 seconds)\n", + "Cbc0010I After 20443000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1527.90 seconds)\n", + "Cbc0010I After 20444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.96 seconds)\n", + "Cbc0010I After 20445000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.04 seconds)\n", + "Cbc0010I After 20446000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.09 seconds)\n", + "Cbc0010I After 20447000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1528.14 seconds)\n", + "Cbc0010I After 20448000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1528.20 seconds)\n", + "Cbc0010I After 20449000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1528.26 seconds)\n", + "Cbc0010I After 20450000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1528.33 seconds)\n", + "Cbc0010I After 20451000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1528.38 seconds)\n", + "Cbc0010I After 20452000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1528.43 seconds)\n", + "Cbc0010I After 20453000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1528.49 seconds)\n", + "Cbc0010I After 20454000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1528.59 seconds)\n", + "Cbc0010I After 20455000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.66 seconds)\n", + "Cbc0010I After 20456000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (1528.73 seconds)\n", + "Cbc0010I After 20457000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1528.80 seconds)\n", + "Cbc0010I After 20458000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1528.87 seconds)\n", + "Cbc0010I After 20459000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1528.93 seconds)\n", + "Cbc0010I After 20460000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1528.99 seconds)\n", + "Cbc0010I After 20461000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1529.05 seconds)\n", + "Cbc0010I After 20462000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1529.11 seconds)\n", + "Cbc0010I After 20463000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1529.17 seconds)\n", + "Cbc0010I After 20464000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1529.24 seconds)\n", + "Cbc0010I After 20465000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1529.30 seconds)\n", + "Cbc0010I After 20466000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1529.36 seconds)\n", + "Cbc0010I After 20467000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1529.42 seconds)\n", + "Cbc0010I After 20468000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1529.47 seconds)\n", + "Cbc0010I After 20469000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1529.53 seconds)\n", + "Cbc0010I After 20470000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1529.59 seconds)\n", + "Cbc0010I After 20471000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1529.64 seconds)\n", + "Cbc0010I After 20472000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1529.71 seconds)\n", + "Cbc0010I After 20473000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1529.77 seconds)\n", + "Cbc0010I After 20474000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1529.83 seconds)\n", + "Cbc0010I After 20475000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1529.88 seconds)\n", + "Cbc0010I After 20476000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1529.95 seconds)\n", + "Cbc0010I After 20477000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1530.03 seconds)\n", + "Cbc0010I After 20478000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1530.10 seconds)\n", + "Cbc0010I After 20479000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1530.18 seconds)\n", + "Cbc0010I After 20480000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1530.25 seconds)\n", + "Cbc0010I After 20481000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1530.33 seconds)\n", + "Cbc0010I After 20482000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1530.40 seconds)\n", + "Cbc0010I After 20483000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1530.47 seconds)\n", + "Cbc0010I After 20484000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1530.54 seconds)\n", + "Cbc0010I After 20485000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1530.61 seconds)\n", + "Cbc0010I After 20486000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1530.69 seconds)\n", + "Cbc0010I After 20487000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1530.76 seconds)\n", + "Cbc0010I After 20488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1530.85 seconds)\n", + "Cbc0010I After 20489000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1530.93 seconds)\n", + "Cbc0010I After 20490000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1531.00 seconds)\n", + "Cbc0010I After 20491000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1531.08 seconds)\n", + "Cbc0010I After 20492000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1531.15 seconds)\n", + "Cbc0010I After 20493000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1531.22 seconds)\n", + "Cbc0010I After 20494000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1531.30 seconds)\n", + "Cbc0010I After 20495000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1531.43 seconds)\n", + "Cbc0010I After 20496000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1531.53 seconds)\n", + "Cbc0010I After 20497000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1531.63 seconds)\n", + "Cbc0010I After 20498000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1531.73 seconds)\n", + "Cbc0010I After 20499000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1531.82 seconds)\n", + "Cbc0010I After 20500000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1531.89 seconds)\n", + "Cbc0010I After 20501000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1531.96 seconds)\n", + "Cbc0010I After 20502000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1532.03 seconds)\n", + "Cbc0010I After 20503000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1532.10 seconds)\n", + "Cbc0010I After 20504000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1532.17 seconds)\n", + "Cbc0010I After 20505000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1532.24 seconds)\n", + "Cbc0010I After 20506000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1532.32 seconds)\n", + "Cbc0010I After 20507000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1532.40 seconds)\n", + "Cbc0010I After 20508000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1532.47 seconds)\n", + "Cbc0010I After 20509000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1532.54 seconds)\n", + "Cbc0010I After 20510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1532.61 seconds)\n", + "Cbc0010I After 20511000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1532.67 seconds)\n", + "Cbc0010I After 20512000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1532.74 seconds)\n", + "Cbc0010I After 20513000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1532.81 seconds)\n", + "Cbc0010I After 20514000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1532.87 seconds)\n", + "Cbc0010I After 20515000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1532.94 seconds)\n", + "Cbc0010I After 20516000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1533.01 seconds)\n", + "Cbc0010I After 20517000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1533.08 seconds)\n", + "Cbc0010I After 20518000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1533.15 seconds)\n", + "Cbc0010I After 20519000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1533.22 seconds)\n", + "Cbc0010I After 20520000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1533.29 seconds)\n", + "Cbc0010I After 20521000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1533.36 seconds)\n", + "Cbc0010I After 20522000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1533.43 seconds)\n", + "Cbc0010I After 20523000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1533.50 seconds)\n", + "Cbc0010I After 20524000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1533.57 seconds)\n", + "Cbc0010I After 20525000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1533.64 seconds)\n", + "Cbc0010I After 20526000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1533.71 seconds)\n", + "Cbc0010I After 20527000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1533.78 seconds)\n", + "Cbc0010I After 20528000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1533.85 seconds)\n", + "Cbc0010I After 20529000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1533.92 seconds)\n", + "Cbc0010I After 20530000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1533.99 seconds)\n", + "Cbc0010I After 20531000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1534.06 seconds)\n", + "Cbc0010I After 20532000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1534.13 seconds)\n", + "Cbc0010I After 20533000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1534.20 seconds)\n", + "Cbc0010I After 20534000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1534.27 seconds)\n", + "Cbc0010I After 20535000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1534.34 seconds)\n", + "Cbc0010I After 20536000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1534.41 seconds)\n", + "Cbc0010I After 20537000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1534.48 seconds)\n", + "Cbc0010I After 20538000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1534.55 seconds)\n", + "Cbc0010I After 20539000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1534.62 seconds)\n", + "Cbc0010I After 20540000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1534.69 seconds)\n", + "Cbc0010I After 20541000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1534.77 seconds)\n", + "Cbc0010I After 20542000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1534.84 seconds)\n", + "Cbc0010I After 20543000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1534.91 seconds)\n", + "Cbc0010I After 20544000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1534.99 seconds)\n", + "Cbc0010I After 20545000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1535.06 seconds)\n", + "Cbc0010I After 20546000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1535.13 seconds)\n", + "Cbc0010I After 20547000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1535.21 seconds)\n", + "Cbc0010I After 20548000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1535.28 seconds)\n", + "Cbc0010I After 20549000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1535.36 seconds)\n", + "Cbc0010I After 20550000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1535.43 seconds)\n", + "Cbc0010I After 20551000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1535.50 seconds)\n", + "Cbc0010I After 20552000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1535.58 seconds)\n", + "Cbc0010I After 20553000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1535.65 seconds)\n", + "Cbc0010I After 20554000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1535.72 seconds)\n", + "Cbc0010I After 20555000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1535.80 seconds)\n", + "Cbc0010I After 20556000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1535.87 seconds)\n", + "Cbc0010I After 20557000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1535.94 seconds)\n", + "Cbc0010I After 20558000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1536.01 seconds)\n", + "Cbc0010I After 20559000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1536.08 seconds)\n", + "Cbc0010I After 20560000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1536.15 seconds)\n", + "Cbc0010I After 20561000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1536.22 seconds)\n", + "Cbc0010I After 20562000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1536.29 seconds)\n", + "Cbc0010I After 20563000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1536.36 seconds)\n", + "Cbc0010I After 20564000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1536.43 seconds)\n", + "Cbc0010I After 20565000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1536.50 seconds)\n", + "Cbc0010I After 20566000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1536.57 seconds)\n", + "Cbc0010I After 20567000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1536.64 seconds)\n", + "Cbc0010I After 20568000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1536.71 seconds)\n", + "Cbc0010I After 20569000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1536.79 seconds)\n", + "Cbc0010I After 20570000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1536.86 seconds)\n", + "Cbc0010I After 20571000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1536.94 seconds)\n", + "Cbc0010I After 20572000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1537.01 seconds)\n", + "Cbc0010I After 20573000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1537.08 seconds)\n", + "Cbc0010I After 20574000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1537.16 seconds)\n", + "Cbc0010I After 20575000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1537.23 seconds)\n", + "Cbc0010I After 20576000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1537.30 seconds)\n", + "Cbc0010I After 20577000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1537.39 seconds)\n", + "Cbc0010I After 20578000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1537.48 seconds)\n", + "Cbc0010I After 20579000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1537.55 seconds)\n", + "Cbc0010I After 20580000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1537.63 seconds)\n", + "Cbc0010I After 20581000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1537.72 seconds)\n", + "Cbc0010I After 20582000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1537.79 seconds)\n", + "Cbc0010I After 20583000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1537.89 seconds)\n", + "Cbc0010I After 20584000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1537.97 seconds)\n", + "Cbc0010I After 20585000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1538.05 seconds)\n", + "Cbc0010I After 20586000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1538.13 seconds)\n", + "Cbc0010I After 20587000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1538.21 seconds)\n", + "Cbc0010I After 20588000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1538.28 seconds)\n", + "Cbc0010I After 20589000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1538.36 seconds)\n", + "Cbc0010I After 20590000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1538.43 seconds)\n", + "Cbc0010I After 20591000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1538.51 seconds)\n", + "Cbc0010I After 20592000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1538.58 seconds)\n", + "Cbc0010I After 20593000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1538.66 seconds)\n", + "Cbc0010I After 20594000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1538.75 seconds)\n", + "Cbc0010I After 20595000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1538.81 seconds)\n", + "Cbc0010I After 20596000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1538.87 seconds)\n", + "Cbc0010I After 20597000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1538.94 seconds)\n", + "Cbc0010I After 20598000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1539.00 seconds)\n", + "Cbc0010I After 20599000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1539.06 seconds)\n", + "Cbc0010I After 20600000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1539.12 seconds)\n", + "Cbc0010I After 20601000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1539.18 seconds)\n", + "Cbc0010I After 20602000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1539.24 seconds)\n", + "Cbc0010I After 20603000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1539.30 seconds)\n", + "Cbc0010I After 20604000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1539.36 seconds)\n", + "Cbc0010I After 20605000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1539.43 seconds)\n", + "Cbc0010I After 20606000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1539.49 seconds)\n", + "Cbc0010I After 20607000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1539.56 seconds)\n", + "Cbc0010I After 20608000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1539.63 seconds)\n", + "Cbc0010I After 20609000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1539.69 seconds)\n", + "Cbc0010I After 20610000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1539.75 seconds)\n", + "Cbc0010I After 20611000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1539.82 seconds)\n", + "Cbc0010I After 20612000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1539.88 seconds)\n", + "Cbc0010I After 20613000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1539.94 seconds)\n", + "Cbc0010I After 20614000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1540.00 seconds)\n", + "Cbc0010I After 20615000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1540.07 seconds)\n", + "Cbc0010I After 20616000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1540.13 seconds)\n", + "Cbc0010I After 20617000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.19 seconds)\n", + "Cbc0010I After 20618000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.26 seconds)\n", + "Cbc0010I After 20619000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1540.33 seconds)\n", + "Cbc0010I After 20620000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1540.39 seconds)\n", + "Cbc0010I After 20621000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1540.46 seconds)\n", + "Cbc0010I After 20622000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.53 seconds)\n", + "Cbc0010I After 20623000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1540.61 seconds)\n", + "Cbc0010I After 20624000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1540.69 seconds)\n", + "Cbc0010I After 20625000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1540.76 seconds)\n", + "Cbc0010I After 20626000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1540.83 seconds)\n", + "Cbc0010I After 20627000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1540.90 seconds)\n", + "Cbc0010I After 20628000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1540.96 seconds)\n", + "Cbc0010I After 20629000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1541.02 seconds)\n", + "Cbc0010I After 20630000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1541.07 seconds)\n", + "Cbc0010I After 20631000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1541.13 seconds)\n", + "Cbc0010I After 20632000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1541.19 seconds)\n", + "Cbc0010I After 20633000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1541.24 seconds)\n", + "Cbc0010I After 20634000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1541.30 seconds)\n", + "Cbc0010I After 20635000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1541.36 seconds)\n", + "Cbc0010I After 20636000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1541.42 seconds)\n", + "Cbc0010I After 20637000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1541.49 seconds)\n", + "Cbc0010I After 20638000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1541.55 seconds)\n", + "Cbc0010I After 20639000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1541.62 seconds)\n", + "Cbc0010I After 20640000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1541.67 seconds)\n", + "Cbc0010I After 20641000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1541.73 seconds)\n", + "Cbc0010I After 20642000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1541.79 seconds)\n", + "Cbc0010I After 20643000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1541.84 seconds)\n", + "Cbc0010I After 20644000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1541.90 seconds)\n", + "Cbc0010I After 20645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1541.99 seconds)\n", + "Cbc0010I After 20646000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1542.06 seconds)\n", + "Cbc0010I After 20647000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1542.13 seconds)\n", + "Cbc0010I After 20648000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1542.19 seconds)\n", + "Cbc0010I After 20649000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1542.24 seconds)\n", + "Cbc0010I After 20650000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1542.31 seconds)\n", + "Cbc0010I After 20651000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1542.37 seconds)\n", + "Cbc0010I After 20652000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1542.43 seconds)\n", + "Cbc0010I After 20653000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1542.49 seconds)\n", + "Cbc0010I After 20654000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1542.55 seconds)\n", + "Cbc0010I After 20655000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1542.62 seconds)\n", + "Cbc0010I After 20656000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1542.68 seconds)\n", + "Cbc0010I After 20657000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1542.76 seconds)\n", + "Cbc0010I After 20658000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1542.81 seconds)\n", + "Cbc0010I After 20659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1542.87 seconds)\n", + "Cbc0010I After 20660000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1542.93 seconds)\n", + "Cbc0010I After 20661000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1543.05 seconds)\n", + "Cbc0010I After 20662000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1543.14 seconds)\n", + "Cbc0010I After 20663000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1543.22 seconds)\n", + "Cbc0010I After 20664000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1543.30 seconds)\n", + "Cbc0010I After 20665000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1543.37 seconds)\n", + "Cbc0010I After 20666000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1543.44 seconds)\n", + "Cbc0010I After 20667000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1543.50 seconds)\n", + "Cbc0010I After 20668000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1543.57 seconds)\n", + "Cbc0010I After 20669000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1543.63 seconds)\n", + "Cbc0010I After 20670000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1543.69 seconds)\n", + "Cbc0010I After 20671000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1543.76 seconds)\n", + "Cbc0010I After 20672000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1543.82 seconds)\n", + "Cbc0010I After 20673000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1543.89 seconds)\n", + "Cbc0010I After 20674000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1543.95 seconds)\n", + "Cbc0010I After 20675000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1544.02 seconds)\n", + "Cbc0010I After 20676000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1544.09 seconds)\n", + "Cbc0010I After 20677000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1544.15 seconds)\n", + "Cbc0010I After 20678000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1544.20 seconds)\n", + "Cbc0010I After 20679000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1544.26 seconds)\n", + "Cbc0010I After 20680000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1544.32 seconds)\n", + "Cbc0010I After 20681000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1544.37 seconds)\n", + "Cbc0010I After 20682000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1544.43 seconds)\n", + "Cbc0010I After 20683000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1544.49 seconds)\n", + "Cbc0010I After 20684000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1544.55 seconds)\n", + "Cbc0010I After 20685000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1544.60 seconds)\n", + "Cbc0010I After 20686000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1544.66 seconds)\n", + "Cbc0010I After 20687000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1544.71 seconds)\n", + "Cbc0010I After 20688000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1544.77 seconds)\n", + "Cbc0010I After 20689000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1544.84 seconds)\n", + "Cbc0010I After 20690000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1544.91 seconds)\n", + "Cbc0010I After 20691000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1544.96 seconds)\n", + "Cbc0010I After 20692000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1545.03 seconds)\n", + "Cbc0010I After 20693000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1545.11 seconds)\n", + "Cbc0010I After 20694000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1545.16 seconds)\n", + "Cbc0010I After 20695000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1545.21 seconds)\n", + "Cbc0010I After 20696000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1545.27 seconds)\n", + "Cbc0010I After 20697000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1545.33 seconds)\n", + "Cbc0010I After 20698000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1545.39 seconds)\n", + "Cbc0010I After 20699000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1545.46 seconds)\n", + "Cbc0010I After 20700000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1545.51 seconds)\n", + "Cbc0010I After 20701000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1545.58 seconds)\n", + "Cbc0010I After 20702000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1545.64 seconds)\n", + "Cbc0010I After 20703000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1545.70 seconds)\n", + "Cbc0010I After 20704000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1545.77 seconds)\n", + "Cbc0010I After 20705000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1545.83 seconds)\n", + "Cbc0010I After 20706000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1545.89 seconds)\n", + "Cbc0010I After 20707000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1545.95 seconds)\n", + "Cbc0010I After 20708000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1546.02 seconds)\n", + "Cbc0010I After 20709000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1546.08 seconds)\n", + "Cbc0010I After 20710000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1546.15 seconds)\n", + "Cbc0010I After 20711000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1546.22 seconds)\n", + "Cbc0010I After 20712000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1546.28 seconds)\n", + "Cbc0010I After 20713000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1546.36 seconds)\n", + "Cbc0010I After 20714000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1546.44 seconds)\n", + "Cbc0010I After 20715000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1546.50 seconds)\n", + "Cbc0010I After 20716000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1546.56 seconds)\n", + "Cbc0010I After 20717000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1546.63 seconds)\n", + "Cbc0010I After 20718000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1546.69 seconds)\n", + "Cbc0010I After 20719000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1546.75 seconds)\n", + "Cbc0010I After 20720000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1546.81 seconds)\n", + "Cbc0010I After 20721000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1546.88 seconds)\n", + "Cbc0010I After 20722000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1546.93 seconds)\n", + "Cbc0010I After 20723000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1546.99 seconds)\n", + "Cbc0010I After 20724000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1547.05 seconds)\n", + "Cbc0010I After 20725000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1547.11 seconds)\n", + "Cbc0010I After 20726000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1547.17 seconds)\n", + "Cbc0010I After 20727000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1547.23 seconds)\n", + "Cbc0010I After 20728000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (1547.29 seconds)\n", + "Cbc0010I After 20729000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1547.36 seconds)\n", + "Cbc0010I After 20730000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1547.42 seconds)\n", + "Cbc0010I After 20731000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1547.49 seconds)\n", + "Cbc0010I After 20732000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1547.55 seconds)\n", + "Cbc0010I After 20733000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1547.61 seconds)\n", + "Cbc0010I After 20734000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1547.68 seconds)\n", + "Cbc0010I After 20735000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1547.74 seconds)\n", + "Cbc0010I After 20736000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1547.80 seconds)\n", + "Cbc0010I After 20737000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1547.87 seconds)\n", + "Cbc0010I After 20738000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1547.93 seconds)\n", + "Cbc0010I After 20739000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1547.98 seconds)\n", + "Cbc0010I After 20740000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (1548.04 seconds)\n", + "Cbc0010I After 20741000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1548.09 seconds)\n", + "Cbc0010I After 20742000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1548.15 seconds)\n", + "Cbc0010I After 20743000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1548.21 seconds)\n", + "Cbc0010I After 20744000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1548.27 seconds)\n", + "Cbc0010I After 20745000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1548.34 seconds)\n", + "Cbc0010I After 20746000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1548.43 seconds)\n", + "Cbc0010I After 20747000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1548.51 seconds)\n", + "Cbc0010I After 20748000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1548.59 seconds)\n", + "Cbc0010I After 20749000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1548.66 seconds)\n", + "Cbc0010I After 20750000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1548.73 seconds)\n", + "Cbc0010I After 20751000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1548.81 seconds)\n", + "Cbc0010I After 20752000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1548.88 seconds)\n", + "Cbc0010I After 20753000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1548.95 seconds)\n", + "Cbc0010I After 20754000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1549.02 seconds)\n", + "Cbc0010I After 20755000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1549.10 seconds)\n", + "Cbc0010I After 20756000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1549.17 seconds)\n", + "Cbc0010I After 20757000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1549.24 seconds)\n", + "Cbc0010I After 20758000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1549.31 seconds)\n", + "Cbc0010I After 20759000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1549.38 seconds)\n", + "Cbc0010I After 20760000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1549.45 seconds)\n", + "Cbc0010I After 20761000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1549.53 seconds)\n", + "Cbc0010I After 20762000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1549.60 seconds)\n", + "Cbc0010I After 20763000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1549.67 seconds)\n", + "Cbc0010I After 20764000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1549.75 seconds)\n", + "Cbc0010I After 20765000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1549.82 seconds)\n", + "Cbc0010I After 20766000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1549.90 seconds)\n", + "Cbc0010I After 20767000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1549.98 seconds)\n", + "Cbc0010I After 20768000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1550.05 seconds)\n", + "Cbc0010I After 20769000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1550.12 seconds)\n", + "Cbc0010I After 20770000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1550.19 seconds)\n", + "Cbc0010I After 20771000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1550.26 seconds)\n", + "Cbc0010I After 20772000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1550.33 seconds)\n", + "Cbc0010I After 20773000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1550.41 seconds)\n", + "Cbc0010I After 20774000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1550.48 seconds)\n", + "Cbc0010I After 20775000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1550.55 seconds)\n", + "Cbc0010I After 20776000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1550.63 seconds)\n", + "Cbc0010I After 20777000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1550.70 seconds)\n", + "Cbc0010I After 20778000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1550.78 seconds)\n", + "Cbc0010I After 20779000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1550.84 seconds)\n", + "Cbc0010I After 20780000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1550.91 seconds)\n", + "Cbc0010I After 20781000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1550.98 seconds)\n", + "Cbc0010I After 20782000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1551.05 seconds)\n", + "Cbc0010I After 20783000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1551.11 seconds)\n", + "Cbc0010I After 20784000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1551.18 seconds)\n", + "Cbc0010I After 20785000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1551.25 seconds)\n", + "Cbc0010I After 20786000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1551.33 seconds)\n", + "Cbc0010I After 20787000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1551.40 seconds)\n", + "Cbc0010I After 20788000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1551.50 seconds)\n", + "Cbc0010I After 20789000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1551.58 seconds)\n", + "Cbc0010I After 20790000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1551.65 seconds)\n", + "Cbc0010I After 20791000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1551.73 seconds)\n", + "Cbc0010I After 20792000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1551.80 seconds)\n", + "Cbc0010I After 20793000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1551.87 seconds)\n", + "Cbc0010I After 20794000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1551.95 seconds)\n", + "Cbc0010I After 20795000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1552.02 seconds)\n", + "Cbc0010I After 20796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1552.10 seconds)\n", + "Cbc0010I After 20797000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1552.17 seconds)\n", + "Cbc0010I After 20798000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1552.25 seconds)\n", + "Cbc0010I After 20799000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1552.32 seconds)\n", + "Cbc0010I After 20800000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1552.39 seconds)\n", + "Cbc0010I After 20801000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1552.48 seconds)\n", + "Cbc0010I After 20802000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1552.55 seconds)\n", + "Cbc0010I After 20803000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1552.62 seconds)\n", + "Cbc0010I After 20804000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1552.70 seconds)\n", + "Cbc0010I After 20805000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1552.78 seconds)\n", + "Cbc0010I After 20806000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1552.85 seconds)\n", + "Cbc0010I After 20807000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1552.92 seconds)\n", + "Cbc0010I After 20808000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1553.00 seconds)\n", + "Cbc0010I After 20809000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1553.07 seconds)\n", + "Cbc0010I After 20810000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1553.15 seconds)\n", + "Cbc0010I After 20811000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1553.23 seconds)\n", + "Cbc0010I After 20812000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1553.30 seconds)\n", + "Cbc0010I After 20813000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1553.37 seconds)\n", + "Cbc0010I After 20814000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1553.45 seconds)\n", + "Cbc0010I After 20815000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1553.52 seconds)\n", + "Cbc0010I After 20816000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1553.60 seconds)\n", + "Cbc0010I After 20817000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1553.67 seconds)\n", + "Cbc0010I After 20818000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1553.75 seconds)\n", + "Cbc0010I After 20819000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1553.83 seconds)\n", + "Cbc0010I After 20820000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1553.92 seconds)\n", + "Cbc0010I After 20821000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1554.00 seconds)\n", + "Cbc0010I After 20822000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1554.08 seconds)\n", + "Cbc0010I After 20823000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1554.15 seconds)\n", + "Cbc0010I After 20824000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1554.23 seconds)\n", + "Cbc0010I After 20825000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1554.30 seconds)\n", + "Cbc0010I After 20826000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1554.37 seconds)\n", + "Cbc0010I After 20827000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1554.44 seconds)\n", + "Cbc0010I After 20828000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1554.54 seconds)\n", + "Cbc0010I After 20829000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1554.61 seconds)\n", + "Cbc0010I After 20830000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1554.69 seconds)\n", + "Cbc0010I After 20831000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1554.77 seconds)\n", + "Cbc0010I After 20832000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1554.84 seconds)\n", + "Cbc0010I After 20833000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1554.90 seconds)\n", + "Cbc0010I After 20834000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1554.97 seconds)\n", + "Cbc0010I After 20835000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1555.04 seconds)\n", + "Cbc0010I After 20836000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1555.12 seconds)\n", + "Cbc0010I After 20837000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1555.19 seconds)\n", + "Cbc0010I After 20838000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1555.26 seconds)\n", + "Cbc0010I After 20839000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1555.33 seconds)\n", + "Cbc0010I After 20840000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1555.41 seconds)\n", + "Cbc0010I After 20841000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1555.49 seconds)\n", + "Cbc0010I After 20842000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1555.57 seconds)\n", + "Cbc0010I After 20843000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1555.63 seconds)\n", + "Cbc0010I After 20844000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1555.70 seconds)\n", + "Cbc0010I After 20845000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1555.77 seconds)\n", + "Cbc0010I After 20846000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1555.84 seconds)\n", + "Cbc0010I After 20847000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1555.91 seconds)\n", + "Cbc0010I After 20848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1555.98 seconds)\n", + "Cbc0010I After 20849000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1556.06 seconds)\n", + "Cbc0010I After 20850000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1556.13 seconds)\n", + "Cbc0010I After 20851000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1556.20 seconds)\n", + "Cbc0010I After 20852000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1556.27 seconds)\n", + "Cbc0010I After 20853000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1556.34 seconds)\n", + "Cbc0010I After 20854000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1556.41 seconds)\n", + "Cbc0010I After 20855000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1556.48 seconds)\n", + "Cbc0010I After 20856000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1556.55 seconds)\n", + "Cbc0010I After 20857000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1556.63 seconds)\n", + "Cbc0010I After 20858000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1556.71 seconds)\n", + "Cbc0010I After 20859000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1556.81 seconds)\n", + "Cbc0010I After 20860000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1556.89 seconds)\n", + "Cbc0010I After 20861000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1556.97 seconds)\n", + "Cbc0010I After 20862000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1557.05 seconds)\n", + "Cbc0010I After 20863000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1557.13 seconds)\n", + "Cbc0010I After 20864000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1557.20 seconds)\n", + "Cbc0010I After 20865000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1557.27 seconds)\n", + "Cbc0010I After 20866000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1557.35 seconds)\n", + "Cbc0010I After 20867000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1557.43 seconds)\n", + "Cbc0010I After 20868000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1557.50 seconds)\n", + "Cbc0010I After 20869000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1557.58 seconds)\n", + "Cbc0010I After 20870000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1557.71 seconds)\n", + "Cbc0010I After 20871000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1557.80 seconds)\n", + "Cbc0010I After 20872000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1557.88 seconds)\n", + "Cbc0010I After 20873000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1557.96 seconds)\n", + "Cbc0010I After 20874000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1558.06 seconds)\n", + "Cbc0010I After 20875000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1558.16 seconds)\n", + "Cbc0010I After 20876000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1558.24 seconds)\n", + "Cbc0010I After 20877000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1558.30 seconds)\n", + "Cbc0010I After 20878000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1558.36 seconds)\n", + "Cbc0010I After 20879000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1558.42 seconds)\n", + "Cbc0010I After 20880000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1558.48 seconds)\n", + "Cbc0010I After 20881000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1558.54 seconds)\n", + "Cbc0010I After 20882000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1558.60 seconds)\n", + "Cbc0010I After 20883000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1558.66 seconds)\n", + "Cbc0010I After 20884000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1558.73 seconds)\n", + "Cbc0010I After 20885000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1558.78 seconds)\n", + "Cbc0010I After 20886000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1558.86 seconds)\n", + "Cbc0010I After 20887000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1558.93 seconds)\n", + "Cbc0010I After 20888000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1559.00 seconds)\n", + "Cbc0010I After 20889000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1559.06 seconds)\n", + "Cbc0010I After 20890000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1559.12 seconds)\n", + "Cbc0010I After 20891000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1559.19 seconds)\n", + "Cbc0010I After 20892000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1559.26 seconds)\n", + "Cbc0010I After 20893000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1559.32 seconds)\n", + "Cbc0010I After 20894000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1559.39 seconds)\n", + "Cbc0010I After 20895000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1559.46 seconds)\n", + "Cbc0010I After 20896000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1559.53 seconds)\n", + "Cbc0010I After 20897000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1559.60 seconds)\n", + "Cbc0010I After 20898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1559.66 seconds)\n", + "Cbc0010I After 20899000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1559.72 seconds)\n", + "Cbc0010I After 20900000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1559.78 seconds)\n", + "Cbc0010I After 20901000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1559.84 seconds)\n", + "Cbc0010I After 20902000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1559.90 seconds)\n", + "Cbc0010I After 20903000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1559.97 seconds)\n", + "Cbc0010I After 20904000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1560.03 seconds)\n", + "Cbc0010I After 20905000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1560.10 seconds)\n", + "Cbc0010I After 20906000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1560.16 seconds)\n", + "Cbc0010I After 20907000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1560.22 seconds)\n", + "Cbc0010I After 20908000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1560.28 seconds)\n", + "Cbc0010I After 20909000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1560.35 seconds)\n", + "Cbc0010I After 20910000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1560.40 seconds)\n", + "Cbc0010I After 20911000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1560.47 seconds)\n", + "Cbc0010I After 20912000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1560.54 seconds)\n", + "Cbc0010I After 20913000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1560.60 seconds)\n", + "Cbc0010I After 20914000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1560.66 seconds)\n", + "Cbc0010I After 20915000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1560.74 seconds)\n", + "Cbc0010I After 20916000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1560.81 seconds)\n", + "Cbc0010I After 20917000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1560.88 seconds)\n", + "Cbc0010I After 20918000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1560.95 seconds)\n", + "Cbc0010I After 20919000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1561.03 seconds)\n", + "Cbc0010I After 20920000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1561.10 seconds)\n", + "Cbc0010I After 20921000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1561.16 seconds)\n", + "Cbc0010I After 20922000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1561.22 seconds)\n", + "Cbc0010I After 20923000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1561.28 seconds)\n", + "Cbc0010I After 20924000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1561.35 seconds)\n", + "Cbc0010I After 20925000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1561.41 seconds)\n", + "Cbc0010I After 20926000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1561.48 seconds)\n", + "Cbc0010I After 20927000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1561.55 seconds)\n", + "Cbc0010I After 20928000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1561.61 seconds)\n", + "Cbc0010I After 20929000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1561.67 seconds)\n", + "Cbc0010I After 20930000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1561.75 seconds)\n", + "Cbc0010I After 20931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1561.81 seconds)\n", + "Cbc0010I After 20932000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1561.86 seconds)\n", + "Cbc0010I After 20933000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1561.92 seconds)\n", + "Cbc0010I After 20934000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1561.99 seconds)\n", + "Cbc0010I After 20935000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1562.04 seconds)\n", + "Cbc0010I After 20936000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1562.10 seconds)\n", + "Cbc0010I After 20937000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1562.16 seconds)\n", + "Cbc0010I After 20938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1562.23 seconds)\n", + "Cbc0010I After 20939000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1562.30 seconds)\n", + "Cbc0010I After 20940000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1562.36 seconds)\n", + "Cbc0010I After 20941000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1562.43 seconds)\n", + "Cbc0010I After 20942000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1562.49 seconds)\n", + "Cbc0010I After 20943000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1562.56 seconds)\n", + "Cbc0010I After 20944000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1562.62 seconds)\n", + "Cbc0010I After 20945000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1562.69 seconds)\n", + "Cbc0010I After 20946000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1562.75 seconds)\n", + "Cbc0010I After 20947000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1562.83 seconds)\n", + "Cbc0010I After 20948000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1562.90 seconds)\n", + "Cbc0010I After 20949000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1562.96 seconds)\n", + "Cbc0010I After 20950000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1563.04 seconds)\n", + "Cbc0010I After 20951000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1563.10 seconds)\n", + "Cbc0010I After 20952000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1563.17 seconds)\n", + "Cbc0010I After 20953000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1563.24 seconds)\n", + "Cbc0010I After 20954000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1563.31 seconds)\n", + "Cbc0010I After 20955000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1563.39 seconds)\n", + "Cbc0010I After 20956000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1563.46 seconds)\n", + "Cbc0010I After 20957000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1563.52 seconds)\n", + "Cbc0010I After 20958000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1563.59 seconds)\n", + "Cbc0010I After 20959000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1563.65 seconds)\n", + "Cbc0010I After 20960000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1563.72 seconds)\n", + "Cbc0010I After 20961000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1563.78 seconds)\n", + "Cbc0010I After 20962000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1563.87 seconds)\n", + "Cbc0010I After 20963000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1563.95 seconds)\n", + "Cbc0010I After 20964000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1564.00 seconds)\n", + "Cbc0010I After 20965000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1564.07 seconds)\n", + "Cbc0010I After 20966000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1564.13 seconds)\n", + "Cbc0010I After 20967000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1564.19 seconds)\n", + "Cbc0010I After 20968000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1564.25 seconds)\n", + "Cbc0010I After 20969000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1564.31 seconds)\n", + "Cbc0010I After 20970000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1564.37 seconds)\n", + "Cbc0010I After 20971000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1564.44 seconds)\n", + "Cbc0010I After 20972000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1564.52 seconds)\n", + "Cbc0010I After 20973000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1564.60 seconds)\n", + "Cbc0010I After 20974000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1564.65 seconds)\n", + "Cbc0010I After 20975000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1564.73 seconds)\n", + "Cbc0010I After 20976000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1564.79 seconds)\n", + "Cbc0010I After 20977000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1564.84 seconds)\n", + "Cbc0010I After 20978000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1564.90 seconds)\n", + "Cbc0010I After 20979000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1564.96 seconds)\n", + "Cbc0010I After 20980000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1565.03 seconds)\n", + "Cbc0010I After 20981000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1565.09 seconds)\n", + "Cbc0010I After 20982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1565.16 seconds)\n", + "Cbc0010I After 20983000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1565.22 seconds)\n", + "Cbc0010I After 20984000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1565.29 seconds)\n", + "Cbc0010I After 20985000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (1565.35 seconds)\n", + "Cbc0010I After 20986000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1565.41 seconds)\n", + "Cbc0010I After 20987000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1565.47 seconds)\n", + "Cbc0010I After 20988000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1565.54 seconds)\n", + "Cbc0010I After 20989000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1565.60 seconds)\n", + "Cbc0010I After 20990000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1565.66 seconds)\n", + "Cbc0010I After 20991000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1565.72 seconds)\n", + "Cbc0010I After 20992000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1565.79 seconds)\n", + "Cbc0010I After 20993000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1565.87 seconds)\n", + "Cbc0010I After 20994000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1565.93 seconds)\n", + "Cbc0010I After 20995000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1566.00 seconds)\n", + "Cbc0010I After 20996000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1566.05 seconds)\n", + "Cbc0010I After 20997000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1566.11 seconds)\n", + "Cbc0010I After 20998000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1566.17 seconds)\n", + "Cbc0010I After 20999000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1566.22 seconds)\n", + "Cbc0010I After 21000000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1566.29 seconds)\n", + "Cbc0010I After 21001000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1566.35 seconds)\n", + "Cbc0010I After 21002000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1566.41 seconds)\n", + "Cbc0010I After 21003000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (1566.47 seconds)\n", + "Cbc0010I After 21004000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1566.54 seconds)\n", + "Cbc0010I After 21005000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1566.62 seconds)\n", + "Cbc0010I After 21006000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1566.69 seconds)\n", + "Cbc0010I After 21007000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1566.76 seconds)\n", + "Cbc0010I After 21008000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1566.83 seconds)\n", + "Cbc0010I After 21009000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1566.91 seconds)\n", + "Cbc0010I After 21010000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1566.98 seconds)\n", + "Cbc0010I After 21011000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1567.06 seconds)\n", + "Cbc0010I After 21012000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1567.14 seconds)\n", + "Cbc0010I After 21013000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1567.23 seconds)\n", + "Cbc0010I After 21014000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1567.30 seconds)\n", + "Cbc0010I After 21015000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1567.38 seconds)\n", + "Cbc0010I After 21016000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1567.45 seconds)\n", + "Cbc0010I After 21017000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1567.52 seconds)\n", + "Cbc0010I After 21018000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1567.59 seconds)\n", + "Cbc0010I After 21019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1567.66 seconds)\n", + "Cbc0010I After 21020000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1567.74 seconds)\n", + "Cbc0010I After 21021000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1567.81 seconds)\n", + "Cbc0010I After 21022000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1567.89 seconds)\n", + "Cbc0010I After 21023000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1567.97 seconds)\n", + "Cbc0010I After 21024000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1568.04 seconds)\n", + "Cbc0010I After 21025000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1568.11 seconds)\n", + "Cbc0010I After 21026000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1568.18 seconds)\n", + "Cbc0010I After 21027000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1568.25 seconds)\n", + "Cbc0010I After 21028000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1568.32 seconds)\n", + "Cbc0010I After 21029000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1568.38 seconds)\n", + "Cbc0010I After 21030000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1568.46 seconds)\n", + "Cbc0010I After 21031000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1568.53 seconds)\n", + "Cbc0010I After 21032000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1568.61 seconds)\n", + "Cbc0010I After 21033000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1568.67 seconds)\n", + "Cbc0010I After 21034000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1568.75 seconds)\n", + "Cbc0010I After 21035000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1568.83 seconds)\n", + "Cbc0010I After 21036000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1568.91 seconds)\n", + "Cbc0010I After 21037000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1568.98 seconds)\n", + "Cbc0010I After 21038000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1569.06 seconds)\n", + "Cbc0010I After 21039000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1569.13 seconds)\n", + "Cbc0010I After 21040000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1569.21 seconds)\n", + "Cbc0010I After 21041000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1569.28 seconds)\n", + "Cbc0010I After 21042000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1569.36 seconds)\n", + "Cbc0010I After 21043000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1569.43 seconds)\n", + "Cbc0010I After 21044000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1569.51 seconds)\n", + "Cbc0010I After 21045000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1569.59 seconds)\n", + "Cbc0010I After 21046000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1569.66 seconds)\n", + "Cbc0010I After 21047000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1569.73 seconds)\n", + "Cbc0010I After 21048000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1569.81 seconds)\n", + "Cbc0010I After 21049000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1569.89 seconds)\n", + "Cbc0010I After 21050000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1569.96 seconds)\n", + "Cbc0010I After 21051000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1570.03 seconds)\n", + "Cbc0010I After 21052000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1570.11 seconds)\n", + "Cbc0010I After 21053000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1570.18 seconds)\n", + "Cbc0010I After 21054000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1570.26 seconds)\n", + "Cbc0010I After 21055000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1570.33 seconds)\n", + "Cbc0010I After 21056000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1570.40 seconds)\n", + "Cbc0010I After 21057000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1570.47 seconds)\n", + "Cbc0010I After 21058000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1570.54 seconds)\n", + "Cbc0010I After 21059000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1570.62 seconds)\n", + "Cbc0010I After 21060000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1570.69 seconds)\n", + "Cbc0010I After 21061000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1570.76 seconds)\n", + "Cbc0010I After 21062000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1570.83 seconds)\n", + "Cbc0010I After 21063000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1570.90 seconds)\n", + "Cbc0010I After 21064000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1570.97 seconds)\n", + "Cbc0010I After 21065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1571.05 seconds)\n", + "Cbc0010I After 21066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1571.12 seconds)\n", + "Cbc0010I After 21067000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1571.19 seconds)\n", + "Cbc0010I After 21068000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1571.26 seconds)\n", + "Cbc0010I After 21069000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1571.33 seconds)\n", + "Cbc0010I After 21070000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1571.40 seconds)\n", + "Cbc0010I After 21071000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1571.48 seconds)\n", + "Cbc0010I After 21072000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1571.55 seconds)\n", + "Cbc0010I After 21073000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1571.62 seconds)\n", + "Cbc0010I After 21074000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1571.69 seconds)\n", + "Cbc0010I After 21075000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1571.77 seconds)\n", + "Cbc0010I After 21076000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1571.85 seconds)\n", + "Cbc0010I After 21077000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1571.97 seconds)\n", + "Cbc0010I After 21078000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1572.08 seconds)\n", + "Cbc0010I After 21079000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1572.18 seconds)\n", + "Cbc0010I After 21080000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1572.27 seconds)\n", + "Cbc0010I After 21081000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1572.35 seconds)\n", + "Cbc0010I After 21082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1572.42 seconds)\n", + "Cbc0010I After 21083000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1572.50 seconds)\n", + "Cbc0010I After 21084000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1572.57 seconds)\n", + "Cbc0010I After 21085000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1572.64 seconds)\n", + "Cbc0010I After 21086000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1572.71 seconds)\n", + "Cbc0010I After 21087000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1572.79 seconds)\n", + "Cbc0010I After 21088000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1572.86 seconds)\n", + "Cbc0010I After 21089000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1572.94 seconds)\n", + "Cbc0010I After 21090000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1573.01 seconds)\n", + "Cbc0010I After 21091000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1573.08 seconds)\n", + "Cbc0010I After 21092000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1573.16 seconds)\n", + "Cbc0010I After 21093000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1573.23 seconds)\n", + "Cbc0010I After 21094000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1573.31 seconds)\n", + "Cbc0010I After 21095000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1573.39 seconds)\n", + "Cbc0010I After 21096000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1573.47 seconds)\n", + "Cbc0010I After 21097000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1573.55 seconds)\n", + "Cbc0010I After 21098000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1573.63 seconds)\n", + "Cbc0010I After 21099000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1573.71 seconds)\n", + "Cbc0010I After 21100000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1573.78 seconds)\n", + "Cbc0010I After 21101000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1573.86 seconds)\n", + "Cbc0010I After 21102000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1573.93 seconds)\n", + "Cbc0010I After 21103000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1574.00 seconds)\n", + "Cbc0010I After 21104000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1574.08 seconds)\n", + "Cbc0010I After 21105000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1574.17 seconds)\n", + "Cbc0010I After 21106000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1574.25 seconds)\n", + "Cbc0010I After 21107000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1574.33 seconds)\n", + "Cbc0010I After 21108000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1574.40 seconds)\n", + "Cbc0010I After 21109000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1574.47 seconds)\n", + "Cbc0010I After 21110000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1574.55 seconds)\n", + "Cbc0010I After 21111000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1574.62 seconds)\n", + "Cbc0010I After 21112000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1574.70 seconds)\n", + "Cbc0010I After 21113000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1574.78 seconds)\n", + "Cbc0010I After 21114000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1574.85 seconds)\n", + "Cbc0010I After 21115000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1574.93 seconds)\n", + "Cbc0010I After 21116000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1575.01 seconds)\n", + "Cbc0010I After 21117000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1575.08 seconds)\n", + "Cbc0010I After 21118000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1575.16 seconds)\n", + "Cbc0010I After 21119000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1575.24 seconds)\n", + "Cbc0010I After 21120000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1575.33 seconds)\n", + "Cbc0010I After 21121000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1575.41 seconds)\n", + "Cbc0010I After 21122000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1575.48 seconds)\n", + "Cbc0010I After 21123000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1575.56 seconds)\n", + "Cbc0010I After 21124000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1575.64 seconds)\n", + "Cbc0010I After 21125000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1575.70 seconds)\n", + "Cbc0010I After 21126000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1575.77 seconds)\n", + "Cbc0010I After 21127000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1575.83 seconds)\n", + "Cbc0010I After 21128000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1575.90 seconds)\n", + "Cbc0010I After 21129000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1575.98 seconds)\n", + "Cbc0010I After 21130000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1576.04 seconds)\n", + "Cbc0010I After 21131000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1576.10 seconds)\n", + "Cbc0010I After 21132000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1576.16 seconds)\n", + "Cbc0010I After 21133000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1576.22 seconds)\n", + "Cbc0010I After 21134000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1576.29 seconds)\n", + "Cbc0010I After 21135000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1576.35 seconds)\n", + "Cbc0010I After 21136000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1576.42 seconds)\n", + "Cbc0010I After 21137000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1576.49 seconds)\n", + "Cbc0010I After 21138000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1576.55 seconds)\n", + "Cbc0010I After 21139000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1576.61 seconds)\n", + "Cbc0010I After 21140000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1576.66 seconds)\n", + "Cbc0010I After 21141000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1576.72 seconds)\n", + "Cbc0010I After 21142000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1576.78 seconds)\n", + "Cbc0010I After 21143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1576.84 seconds)\n", + "Cbc0010I After 21144000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1576.90 seconds)\n", + "Cbc0010I After 21145000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1576.96 seconds)\n", + "Cbc0010I After 21146000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1577.04 seconds)\n", + "Cbc0010I After 21147000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1577.10 seconds)\n", + "Cbc0010I After 21148000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1577.18 seconds)\n", + "Cbc0010I After 21149000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1577.24 seconds)\n", + "Cbc0010I After 21150000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1577.30 seconds)\n", + "Cbc0010I After 21151000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1577.36 seconds)\n", + "Cbc0010I After 21152000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1577.41 seconds)\n", + "Cbc0010I After 21153000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1577.47 seconds)\n", + "Cbc0010I After 21154000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1577.53 seconds)\n", + "Cbc0010I After 21155000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1577.59 seconds)\n", + "Cbc0010I After 21156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1577.66 seconds)\n", + "Cbc0010I After 21157000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1577.71 seconds)\n", + "Cbc0010I After 21158000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1577.76 seconds)\n", + "Cbc0010I After 21159000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1577.82 seconds)\n", + "Cbc0010I After 21160000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1577.90 seconds)\n", + "Cbc0010I After 21161000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1578.00 seconds)\n", + "Cbc0010I After 21162000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1578.08 seconds)\n", + "Cbc0010I After 21163000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1578.15 seconds)\n", + "Cbc0010I After 21164000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1578.23 seconds)\n", + "Cbc0010I After 21165000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1578.28 seconds)\n", + "Cbc0010I After 21166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1578.34 seconds)\n", + "Cbc0010I After 21167000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1578.40 seconds)\n", + "Cbc0010I After 21168000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1578.46 seconds)\n", + "Cbc0010I After 21169000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1578.52 seconds)\n", + "Cbc0010I After 21170000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1578.59 seconds)\n", + "Cbc0010I After 21171000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1578.65 seconds)\n", + "Cbc0010I After 21172000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1578.71 seconds)\n", + "Cbc0010I After 21173000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1578.78 seconds)\n", + "Cbc0010I After 21174000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1578.84 seconds)\n", + "Cbc0010I After 21175000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1578.90 seconds)\n", + "Cbc0010I After 21176000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1578.97 seconds)\n", + "Cbc0010I After 21177000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1579.03 seconds)\n", + "Cbc0010I After 21178000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1579.09 seconds)\n", + "Cbc0010I After 21179000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1579.15 seconds)\n", + "Cbc0010I After 21180000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1579.22 seconds)\n", + "Cbc0010I After 21181000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1579.29 seconds)\n", + "Cbc0010I After 21182000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1579.36 seconds)\n", + "Cbc0010I After 21183000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1579.42 seconds)\n", + "Cbc0010I After 21184000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1579.48 seconds)\n", + "Cbc0010I After 21185000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1579.55 seconds)\n", + "Cbc0010I After 21186000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1579.61 seconds)\n", + "Cbc0010I After 21187000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1579.67 seconds)\n", + "Cbc0010I After 21188000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1579.73 seconds)\n", + "Cbc0010I After 21189000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1579.80 seconds)\n", + "Cbc0010I After 21190000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1579.86 seconds)\n", + "Cbc0010I After 21191000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1579.92 seconds)\n", + "Cbc0010I After 21192000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1579.98 seconds)\n", + "Cbc0010I After 21193000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1580.04 seconds)\n", + "Cbc0010I After 21194000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1580.10 seconds)\n", + "Cbc0010I After 21195000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1580.16 seconds)\n", + "Cbc0010I After 21196000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1580.22 seconds)\n", + "Cbc0010I After 21197000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1580.27 seconds)\n", + "Cbc0010I After 21198000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1580.33 seconds)\n", + "Cbc0010I After 21199000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1580.39 seconds)\n", + "Cbc0010I After 21200000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1580.44 seconds)\n", + "Cbc0010I After 21201000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1580.50 seconds)\n", + "Cbc0010I After 21202000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1580.56 seconds)\n", + "Cbc0010I After 21203000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1580.61 seconds)\n", + "Cbc0010I After 21204000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1580.68 seconds)\n", + "Cbc0010I After 21205000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1580.74 seconds)\n", + "Cbc0010I After 21206000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1580.81 seconds)\n", + "Cbc0010I After 21207000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1580.90 seconds)\n", + "Cbc0010I After 21208000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1580.95 seconds)\n", + "Cbc0010I After 21209000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1581.02 seconds)\n", + "Cbc0010I After 21210000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1581.10 seconds)\n", + "Cbc0010I After 21211000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1581.14 seconds)\n", + "Cbc0010I After 21212000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1581.20 seconds)\n", + "Cbc0010I After 21213000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1581.26 seconds)\n", + "Cbc0010I After 21214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1581.32 seconds)\n", + "Cbc0010I After 21215000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1581.39 seconds)\n", + "Cbc0010I After 21216000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1581.45 seconds)\n", + "Cbc0010I After 21217000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1581.51 seconds)\n", + "Cbc0010I After 21218000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1581.57 seconds)\n", + "Cbc0010I After 21219000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1581.63 seconds)\n", + "Cbc0010I After 21220000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1581.70 seconds)\n", + "Cbc0010I After 21221000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1581.76 seconds)\n", + "Cbc0010I After 21222000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1581.83 seconds)\n", + "Cbc0010I After 21223000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1581.90 seconds)\n", + "Cbc0010I After 21224000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1581.96 seconds)\n", + "Cbc0010I After 21225000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1582.03 seconds)\n", + "Cbc0010I After 21226000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1582.10 seconds)\n", + "Cbc0010I After 21227000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1582.16 seconds)\n", + "Cbc0010I After 21228000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1582.23 seconds)\n", + "Cbc0010I After 21229000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1582.29 seconds)\n", + "Cbc0010I After 21230000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1582.35 seconds)\n", + "Cbc0010I After 21231000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1582.42 seconds)\n", + "Cbc0010I After 21232000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1582.48 seconds)\n", + "Cbc0010I After 21233000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1582.55 seconds)\n", + "Cbc0010I After 21234000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1582.62 seconds)\n", + "Cbc0010I After 21235000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1582.67 seconds)\n", + "Cbc0010I After 21236000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1582.72 seconds)\n", + "Cbc0010I After 21237000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1582.77 seconds)\n", + "Cbc0010I After 21238000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1582.84 seconds)\n", + "Cbc0010I After 21239000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1582.90 seconds)\n", + "Cbc0010I After 21240000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1582.96 seconds)\n", + "Cbc0010I After 21241000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1583.03 seconds)\n", + "Cbc0010I After 21242000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1583.08 seconds)\n", + "Cbc0010I After 21243000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1583.14 seconds)\n", + "Cbc0010I After 21244000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1583.20 seconds)\n", + "Cbc0010I After 21245000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1583.27 seconds)\n", + "Cbc0010I After 21246000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1583.32 seconds)\n", + "Cbc0010I After 21247000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1583.38 seconds)\n", + "Cbc0010I After 21248000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1583.44 seconds)\n", + "Cbc0010I After 21249000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1583.50 seconds)\n", + "Cbc0010I After 21250000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1583.56 seconds)\n", + "Cbc0010I After 21251000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1583.62 seconds)\n", + "Cbc0010I After 21252000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1583.68 seconds)\n", + "Cbc0010I After 21253000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1583.74 seconds)\n", + "Cbc0010I After 21254000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1583.80 seconds)\n", + "Cbc0010I After 21255000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1583.87 seconds)\n", + "Cbc0010I After 21256000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1583.93 seconds)\n", + "Cbc0010I After 21257000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1583.98 seconds)\n", + "Cbc0010I After 21258000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (1584.04 seconds)\n", + "Cbc0010I After 21259000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1584.10 seconds)\n", + "Cbc0010I After 21260000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1584.19 seconds)\n", + "Cbc0010I After 21261000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1584.26 seconds)\n", + "Cbc0010I After 21262000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1584.34 seconds)\n", + "Cbc0010I After 21263000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1584.42 seconds)\n", + "Cbc0010I After 21264000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1584.50 seconds)\n", + "Cbc0010I After 21265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1584.56 seconds)\n", + "Cbc0010I After 21266000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1584.63 seconds)\n", + "Cbc0010I After 21267000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1584.70 seconds)\n", + "Cbc0010I After 21268000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1584.77 seconds)\n", + "Cbc0010I After 21269000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1584.85 seconds)\n", + "Cbc0010I After 21270000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1584.92 seconds)\n", + "Cbc0010I After 21271000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1584.99 seconds)\n", + "Cbc0010I After 21272000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1585.05 seconds)\n", + "Cbc0010I After 21273000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1585.12 seconds)\n", + "Cbc0010I After 21274000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1585.19 seconds)\n", + "Cbc0010I After 21275000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1585.26 seconds)\n", + "Cbc0010I After 21276000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1585.33 seconds)\n", + "Cbc0010I After 21277000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1585.42 seconds)\n", + "Cbc0010I After 21278000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1585.52 seconds)\n", + "Cbc0010I After 21279000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1585.61 seconds)\n", + "Cbc0010I After 21280000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1585.69 seconds)\n", + "Cbc0010I After 21281000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1585.77 seconds)\n", + "Cbc0010I After 21282000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1585.84 seconds)\n", + "Cbc0010I After 21283000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1585.91 seconds)\n", + "Cbc0010I After 21284000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1585.98 seconds)\n", + "Cbc0010I After 21285000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1586.06 seconds)\n", + "Cbc0010I After 21286000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1586.19 seconds)\n", + "Cbc0010I After 21287000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1586.27 seconds)\n", + "Cbc0010I After 21288000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1586.35 seconds)\n", + "Cbc0010I After 21289000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1586.44 seconds)\n", + "Cbc0010I After 21290000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1586.51 seconds)\n", + "Cbc0010I After 21291000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1586.58 seconds)\n", + "Cbc0010I After 21292000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1586.65 seconds)\n", + "Cbc0010I After 21293000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1586.73 seconds)\n", + "Cbc0010I After 21294000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1586.80 seconds)\n", + "Cbc0010I After 21295000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1586.87 seconds)\n", + "Cbc0010I After 21296000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1586.95 seconds)\n", + "Cbc0010I After 21297000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1587.02 seconds)\n", + "Cbc0010I After 21298000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1587.09 seconds)\n", + "Cbc0010I After 21299000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1587.17 seconds)\n", + "Cbc0010I After 21300000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1587.24 seconds)\n", + "Cbc0010I After 21301000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1587.32 seconds)\n", + "Cbc0010I After 21302000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1587.39 seconds)\n", + "Cbc0010I After 21303000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1587.46 seconds)\n", + "Cbc0010I After 21304000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1587.54 seconds)\n", + "Cbc0010I After 21305000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1587.61 seconds)\n", + "Cbc0010I After 21306000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1587.68 seconds)\n", + "Cbc0010I After 21307000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1587.76 seconds)\n", + "Cbc0010I After 21308000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1587.83 seconds)\n", + "Cbc0010I After 21309000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1587.91 seconds)\n", + "Cbc0010I After 21310000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1587.98 seconds)\n", + "Cbc0010I After 21311000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1588.05 seconds)\n", + "Cbc0010I After 21312000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1588.13 seconds)\n", + "Cbc0010I After 21313000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1588.20 seconds)\n", + "Cbc0010I After 21314000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1588.28 seconds)\n", + "Cbc0010I After 21315000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1588.36 seconds)\n", + "Cbc0010I After 21316000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1588.47 seconds)\n", + "Cbc0010I After 21317000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1588.56 seconds)\n", + "Cbc0010I After 21318000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1588.64 seconds)\n", + "Cbc0010I After 21319000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1588.71 seconds)\n", + "Cbc0010I After 21320000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1588.78 seconds)\n", + "Cbc0010I After 21321000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1588.86 seconds)\n", + "Cbc0010I After 21322000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1588.93 seconds)\n", + "Cbc0010I After 21323000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1589.00 seconds)\n", + "Cbc0010I After 21324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1589.08 seconds)\n", + "Cbc0010I After 21325000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1589.15 seconds)\n", + "Cbc0010I After 21326000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1589.23 seconds)\n", + "Cbc0010I After 21327000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1589.30 seconds)\n", + "Cbc0010I After 21328000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1589.41 seconds)\n", + "Cbc0010I After 21329000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1589.50 seconds)\n", + "Cbc0010I After 21330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1589.59 seconds)\n", + "Cbc0010I After 21331000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1589.67 seconds)\n", + "Cbc0010I After 21332000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1589.74 seconds)\n", + "Cbc0010I After 21333000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1589.82 seconds)\n", + "Cbc0010I After 21334000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1589.89 seconds)\n", + "Cbc0010I After 21335000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1589.97 seconds)\n", + "Cbc0010I After 21336000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1590.05 seconds)\n", + "Cbc0010I After 21337000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1590.12 seconds)\n", + "Cbc0010I After 21338000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.20 seconds)\n", + "Cbc0010I After 21339000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1590.27 seconds)\n", + "Cbc0010I After 21340000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1590.35 seconds)\n", + "Cbc0010I After 21341000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1590.42 seconds)\n", + "Cbc0010I After 21342000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1590.50 seconds)\n", + "Cbc0010I After 21343000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.58 seconds)\n", + "Cbc0010I After 21344000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1590.66 seconds)\n", + "Cbc0010I After 21345000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.74 seconds)\n", + "Cbc0010I After 21346000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1590.81 seconds)\n", + "Cbc0010I After 21347000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1590.89 seconds)\n", + "Cbc0010I After 21348000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1590.97 seconds)\n", + "Cbc0010I After 21349000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1591.05 seconds)\n", + "Cbc0010I After 21350000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1591.12 seconds)\n", + "Cbc0010I After 21351000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1591.20 seconds)\n", + "Cbc0010I After 21352000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1591.27 seconds)\n", + "Cbc0010I After 21353000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1591.35 seconds)\n", + "Cbc0010I After 21354000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1591.43 seconds)\n", + "Cbc0010I After 21355000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1591.50 seconds)\n", + "Cbc0010I After 21356000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1591.58 seconds)\n", + "Cbc0010I After 21357000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1591.65 seconds)\n", + "Cbc0010I After 21358000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1591.73 seconds)\n", + "Cbc0010I After 21359000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1591.81 seconds)\n", + "Cbc0010I After 21360000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1591.88 seconds)\n", + "Cbc0010I After 21361000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1591.96 seconds)\n", + "Cbc0010I After 21362000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1592.03 seconds)\n", + "Cbc0010I After 21363000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1592.11 seconds)\n", + "Cbc0010I After 21364000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1592.19 seconds)\n", + "Cbc0010I After 21365000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1592.26 seconds)\n", + "Cbc0010I After 21366000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1592.34 seconds)\n", + "Cbc0010I After 21367000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1592.41 seconds)\n", + "Cbc0010I After 21368000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1592.50 seconds)\n", + "Cbc0010I After 21369000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1592.58 seconds)\n", + "Cbc0010I After 21370000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1592.66 seconds)\n", + "Cbc0010I After 21371000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1592.74 seconds)\n", + "Cbc0010I After 21372000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1592.82 seconds)\n", + "Cbc0010I After 21373000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1592.89 seconds)\n", + "Cbc0010I After 21374000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1592.97 seconds)\n", + "Cbc0010I After 21375000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1593.05 seconds)\n", + "Cbc0010I After 21376000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1593.13 seconds)\n", + "Cbc0010I After 21377000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1593.20 seconds)\n", + "Cbc0010I After 21378000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1593.28 seconds)\n", + "Cbc0010I After 21379000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1593.36 seconds)\n", + "Cbc0010I After 21380000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1593.43 seconds)\n", + "Cbc0010I After 21381000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1593.51 seconds)\n", + "Cbc0010I After 21382000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1593.59 seconds)\n", + "Cbc0010I After 21383000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1593.67 seconds)\n", + "Cbc0010I After 21384000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1593.74 seconds)\n", + "Cbc0010I After 21385000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1593.82 seconds)\n", + "Cbc0010I After 21386000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1593.90 seconds)\n", + "Cbc0010I After 21387000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1593.98 seconds)\n", + "Cbc0010I After 21388000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1594.06 seconds)\n", + "Cbc0010I After 21389000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1594.15 seconds)\n", + "Cbc0010I After 21390000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1594.21 seconds)\n", + "Cbc0010I After 21391000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1594.28 seconds)\n", + "Cbc0010I After 21392000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1594.34 seconds)\n", + "Cbc0010I After 21393000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1594.40 seconds)\n", + "Cbc0010I After 21394000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1594.46 seconds)\n", + "Cbc0010I After 21395000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1594.53 seconds)\n", + "Cbc0010I After 21396000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1594.59 seconds)\n", + "Cbc0010I After 21397000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1594.66 seconds)\n", + "Cbc0010I After 21398000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1594.73 seconds)\n", + "Cbc0010I After 21399000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1594.80 seconds)\n", + "Cbc0010I After 21400000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1594.86 seconds)\n", + "Cbc0010I After 21401000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1594.93 seconds)\n", + "Cbc0010I After 21402000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1594.99 seconds)\n", + "Cbc0010I After 21403000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1595.05 seconds)\n", + "Cbc0010I After 21404000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1595.11 seconds)\n", + "Cbc0010I After 21405000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1595.17 seconds)\n", + "Cbc0010I After 21406000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1595.24 seconds)\n", + "Cbc0010I After 21407000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1595.32 seconds)\n", + "Cbc0010I After 21408000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1595.38 seconds)\n", + "Cbc0010I After 21409000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1595.44 seconds)\n", + "Cbc0010I After 21410000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1595.50 seconds)\n", + "Cbc0010I After 21411000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1595.57 seconds)\n", + "Cbc0010I After 21412000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1595.64 seconds)\n", + "Cbc0010I After 21413000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1595.71 seconds)\n", + "Cbc0010I After 21414000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1595.78 seconds)\n", + "Cbc0010I After 21415000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1595.85 seconds)\n", + "Cbc0010I After 21416000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1595.92 seconds)\n", + "Cbc0010I After 21417000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1595.99 seconds)\n", + "Cbc0010I After 21418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1596.06 seconds)\n", + "Cbc0010I After 21419000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1596.12 seconds)\n", + "Cbc0010I After 21420000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1596.19 seconds)\n", + "Cbc0010I After 21421000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1596.25 seconds)\n", + "Cbc0010I After 21422000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1596.32 seconds)\n", + "Cbc0010I After 21423000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1596.38 seconds)\n", + "Cbc0010I After 21424000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1596.44 seconds)\n", + "Cbc0010I After 21425000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1596.50 seconds)\n", + "Cbc0010I After 21426000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1596.56 seconds)\n", + "Cbc0010I After 21427000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1596.63 seconds)\n", + "Cbc0010I After 21428000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1596.69 seconds)\n", + "Cbc0010I After 21429000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1596.76 seconds)\n", + "Cbc0010I After 21430000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1596.83 seconds)\n", + "Cbc0010I After 21431000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1596.90 seconds)\n", + "Cbc0010I After 21432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1596.97 seconds)\n", + "Cbc0010I After 21433000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1597.04 seconds)\n", + "Cbc0010I After 21434000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1597.10 seconds)\n", + "Cbc0010I After 21435000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1597.16 seconds)\n", + "Cbc0010I After 21436000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1597.22 seconds)\n", + "Cbc0010I After 21437000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1597.29 seconds)\n", + "Cbc0010I After 21438000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1597.35 seconds)\n", + "Cbc0010I After 21439000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1597.42 seconds)\n", + "Cbc0010I After 21440000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1597.48 seconds)\n", + "Cbc0010I After 21441000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1597.54 seconds)\n", + "Cbc0010I After 21442000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1597.60 seconds)\n", + "Cbc0010I After 21443000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1597.67 seconds)\n", + "Cbc0010I After 21444000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1597.73 seconds)\n", + "Cbc0010I After 21445000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1597.79 seconds)\n", + "Cbc0010I After 21446000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1597.86 seconds)\n", + "Cbc0010I After 21447000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1597.92 seconds)\n", + "Cbc0010I After 21448000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1597.99 seconds)\n", + "Cbc0010I After 21449000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1598.05 seconds)\n", + "Cbc0010I After 21450000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1598.10 seconds)\n", + "Cbc0010I After 21451000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1598.16 seconds)\n", + "Cbc0010I After 21452000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1598.22 seconds)\n", + "Cbc0010I After 21453000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1598.28 seconds)\n", + "Cbc0010I After 21454000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1598.35 seconds)\n", + "Cbc0010I After 21455000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1598.42 seconds)\n", + "Cbc0010I After 21456000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1598.49 seconds)\n", + "Cbc0010I After 21457000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1598.55 seconds)\n", + "Cbc0010I After 21458000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1598.62 seconds)\n", + "Cbc0010I After 21459000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1598.68 seconds)\n", + "Cbc0010I After 21460000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1598.76 seconds)\n", + "Cbc0010I After 21461000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1598.81 seconds)\n", + "Cbc0010I After 21462000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1598.87 seconds)\n", + "Cbc0010I After 21463000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1598.98 seconds)\n", + "Cbc0010I After 21464000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1599.05 seconds)\n", + "Cbc0010I After 21465000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1599.11 seconds)\n", + "Cbc0010I After 21466000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1599.18 seconds)\n", + "Cbc0010I After 21467000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1599.24 seconds)\n", + "Cbc0010I After 21468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1599.30 seconds)\n", + "Cbc0010I After 21469000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1599.36 seconds)\n", + "Cbc0010I After 21470000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1599.42 seconds)\n", + "Cbc0010I After 21471000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1599.48 seconds)\n", + "Cbc0010I After 21472000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1599.54 seconds)\n", + "Cbc0010I After 21473000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1599.60 seconds)\n", + "Cbc0010I After 21474000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1599.66 seconds)\n", + "Cbc0010I After 21475000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1599.72 seconds)\n", + "Cbc0010I After 21476000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1599.78 seconds)\n", + "Cbc0010I After 21477000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1599.85 seconds)\n", + "Cbc0010I After 21478000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1599.92 seconds)\n", + "Cbc0010I After 21479000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1599.98 seconds)\n", + "Cbc0010I After 21480000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1600.03 seconds)\n", + "Cbc0010I After 21481000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1600.09 seconds)\n", + "Cbc0010I After 21482000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1600.16 seconds)\n", + "Cbc0010I After 21483000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1600.23 seconds)\n", + "Cbc0010I After 21484000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1600.27 seconds)\n", + "Cbc0010I After 21485000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1600.33 seconds)\n", + "Cbc0010I After 21486000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1600.40 seconds)\n", + "Cbc0010I After 21487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1600.46 seconds)\n", + "Cbc0010I After 21488000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1600.51 seconds)\n", + "Cbc0010I After 21489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1600.56 seconds)\n", + "Cbc0010I After 21490000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1600.62 seconds)\n", + "Cbc0010I After 21491000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1600.68 seconds)\n", + "Cbc0010I After 21492000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1600.74 seconds)\n", + "Cbc0010I After 21493000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1600.80 seconds)\n", + "Cbc0010I After 21494000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1600.87 seconds)\n", + "Cbc0010I After 21495000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1600.98 seconds)\n", + "Cbc0010I After 21496000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1601.07 seconds)\n", + "Cbc0010I After 21497000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1601.15 seconds)\n", + "Cbc0010I After 21498000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1601.23 seconds)\n", + "Cbc0010I After 21499000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1601.30 seconds)\n", + "Cbc0010I After 21500000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1601.37 seconds)\n", + "Cbc0010I After 21501000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1601.44 seconds)\n", + "Cbc0010I After 21502000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1601.50 seconds)\n", + "Cbc0010I After 21503000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1601.56 seconds)\n", + "Cbc0010I After 21504000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1601.62 seconds)\n", + "Cbc0010I After 21505000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1601.68 seconds)\n", + "Cbc0010I After 21506000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1601.75 seconds)\n", + "Cbc0010I After 21507000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1601.83 seconds)\n", + "Cbc0010I After 21508000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1601.90 seconds)\n", + "Cbc0010I After 21509000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1601.97 seconds)\n", + "Cbc0010I After 21510000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1602.04 seconds)\n", + "Cbc0010I After 21511000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1602.12 seconds)\n", + "Cbc0010I After 21512000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1602.19 seconds)\n", + "Cbc0010I After 21513000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1602.26 seconds)\n", + "Cbc0010I After 21514000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1602.34 seconds)\n", + "Cbc0010I After 21515000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1602.41 seconds)\n", + "Cbc0010I After 21516000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1602.48 seconds)\n", + "Cbc0010I After 21517000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1602.55 seconds)\n", + "Cbc0010I After 21518000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1602.63 seconds)\n", + "Cbc0010I After 21519000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1602.70 seconds)\n", + "Cbc0010I After 21520000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1602.77 seconds)\n", + "Cbc0010I After 21521000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1602.85 seconds)\n", + "Cbc0010I After 21522000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1602.92 seconds)\n", + "Cbc0010I After 21523000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1603.00 seconds)\n", + "Cbc0010I After 21524000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1603.07 seconds)\n", + "Cbc0010I After 21525000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1603.15 seconds)\n", + "Cbc0010I After 21526000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1603.22 seconds)\n", + "Cbc0010I After 21527000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1603.30 seconds)\n", + "Cbc0010I After 21528000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1603.39 seconds)\n", + "Cbc0010I After 21529000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1603.47 seconds)\n", + "Cbc0010I After 21530000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1603.55 seconds)\n", + "Cbc0010I After 21531000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1603.63 seconds)\n", + "Cbc0010I After 21532000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1603.70 seconds)\n", + "Cbc0010I After 21533000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1603.77 seconds)\n", + "Cbc0010I After 21534000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1603.84 seconds)\n", + "Cbc0010I After 21535000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1603.92 seconds)\n", + "Cbc0010I After 21536000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1604.00 seconds)\n", + "Cbc0010I After 21537000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1604.07 seconds)\n", + "Cbc0010I After 21538000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1604.15 seconds)\n", + "Cbc0010I After 21539000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1604.22 seconds)\n", + "Cbc0010I After 21540000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1604.30 seconds)\n", + "Cbc0010I After 21541000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1604.37 seconds)\n", + "Cbc0010I After 21542000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1604.45 seconds)\n", + "Cbc0010I After 21543000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1604.52 seconds)\n", + "Cbc0010I After 21544000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1604.60 seconds)\n", + "Cbc0010I After 21545000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1604.68 seconds)\n", + "Cbc0010I After 21546000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1604.75 seconds)\n", + "Cbc0010I After 21547000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1604.83 seconds)\n", + "Cbc0010I After 21548000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1604.90 seconds)\n", + "Cbc0010I After 21549000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1604.98 seconds)\n", + "Cbc0010I After 21550000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1605.05 seconds)\n", + "Cbc0010I After 21551000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1605.12 seconds)\n", + "Cbc0010I After 21552000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1605.20 seconds)\n", + "Cbc0010I After 21553000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1605.28 seconds)\n", + "Cbc0010I After 21554000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1605.35 seconds)\n", + "Cbc0010I After 21555000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1605.43 seconds)\n", + "Cbc0010I After 21556000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1605.51 seconds)\n", + "Cbc0010I After 21557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1605.58 seconds)\n", + "Cbc0010I After 21558000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1605.66 seconds)\n", + "Cbc0010I After 21559000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1605.73 seconds)\n", + "Cbc0010I After 21560000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1605.83 seconds)\n", + "Cbc0010I After 21561000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1605.91 seconds)\n", + "Cbc0010I After 21562000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1605.98 seconds)\n", + "Cbc0010I After 21563000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1606.06 seconds)\n", + "Cbc0010I After 21564000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1606.13 seconds)\n", + "Cbc0010I After 21565000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1606.21 seconds)\n", + "Cbc0010I After 21566000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1606.29 seconds)\n", + "Cbc0010I After 21567000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1606.36 seconds)\n", + "Cbc0010I After 21568000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1606.44 seconds)\n", + "Cbc0010I After 21569000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1606.51 seconds)\n", + "Cbc0010I After 21570000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1606.59 seconds)\n", + "Cbc0010I After 21571000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1606.67 seconds)\n", + "Cbc0010I After 21572000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1606.74 seconds)\n", + "Cbc0010I After 21573000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1606.82 seconds)\n", + "Cbc0010I After 21574000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1606.90 seconds)\n", + "Cbc0010I After 21575000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1606.97 seconds)\n", + "Cbc0010I After 21576000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1607.05 seconds)\n", + "Cbc0010I After 21577000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1607.13 seconds)\n", + "Cbc0010I After 21578000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1607.22 seconds)\n", + "Cbc0010I After 21579000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1607.30 seconds)\n", + "Cbc0010I After 21580000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1607.40 seconds)\n", + "Cbc0010I After 21581000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1607.49 seconds)\n", + "Cbc0010I After 21582000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1607.58 seconds)\n", + "Cbc0010I After 21583000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1607.66 seconds)\n", + "Cbc0010I After 21584000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1607.74 seconds)\n", + "Cbc0010I After 21585000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1607.81 seconds)\n", + "Cbc0010I After 21586000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1607.89 seconds)\n", + "Cbc0010I After 21587000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1607.96 seconds)\n", + "Cbc0010I After 21588000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1608.04 seconds)\n", + "Cbc0010I After 21589000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1608.12 seconds)\n", + "Cbc0010I After 21590000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1608.19 seconds)\n", + "Cbc0010I After 21591000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1608.27 seconds)\n", + "Cbc0010I After 21592000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1608.35 seconds)\n", + "Cbc0010I After 21593000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1608.43 seconds)\n", + "Cbc0010I After 21594000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1608.50 seconds)\n", + "Cbc0010I After 21595000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1608.58 seconds)\n", + "Cbc0010I After 21596000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1608.66 seconds)\n", + "Cbc0010I After 21597000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1608.74 seconds)\n", + "Cbc0010I After 21598000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1608.81 seconds)\n", + "Cbc0010I After 21599000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1608.89 seconds)\n", + "Cbc0010I After 21600000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1608.96 seconds)\n", + "Cbc0010I After 21601000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1609.04 seconds)\n", + "Cbc0010I After 21602000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1609.12 seconds)\n", + "Cbc0010I After 21603000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1609.20 seconds)\n", + "Cbc0010I After 21604000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1609.29 seconds)\n", + "Cbc0010I After 21605000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1609.37 seconds)\n", + "Cbc0010I After 21606000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1609.43 seconds)\n", + "Cbc0010I After 21607000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1609.50 seconds)\n", + "Cbc0010I After 21608000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1609.58 seconds)\n", + "Cbc0010I After 21609000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1609.65 seconds)\n", + "Cbc0010I After 21610000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1609.72 seconds)\n", + "Cbc0010I After 21611000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1609.78 seconds)\n", + "Cbc0010I After 21612000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1609.84 seconds)\n", + "Cbc0010I After 21613000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1609.90 seconds)\n", + "Cbc0010I After 21614000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1609.97 seconds)\n", + "Cbc0010I After 21615000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1610.04 seconds)\n", + "Cbc0010I After 21616000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1610.10 seconds)\n", + "Cbc0010I After 21617000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1610.17 seconds)\n", + "Cbc0010I After 21618000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1610.23 seconds)\n", + "Cbc0010I After 21619000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1610.30 seconds)\n", + "Cbc0010I After 21620000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1610.37 seconds)\n", + "Cbc0010I After 21621000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1610.44 seconds)\n", + "Cbc0010I After 21622000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1610.54 seconds)\n", + "Cbc0010I After 21623000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1610.64 seconds)\n", + "Cbc0010I After 21624000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1610.76 seconds)\n", + "Cbc0010I After 21625000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1610.90 seconds)\n", + "Cbc0010I After 21626000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1611.03 seconds)\n", + "Cbc0010I After 21627000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1611.21 seconds)\n", + "Cbc0010I After 21628000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1611.31 seconds)\n", + "Cbc0010I After 21629000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1611.40 seconds)\n", + "Cbc0010I After 21630000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1611.47 seconds)\n", + "Cbc0010I After 21631000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1611.55 seconds)\n", + "Cbc0010I After 21632000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1611.64 seconds)\n", + "Cbc0010I After 21633000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1611.71 seconds)\n", + "Cbc0010I After 21634000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1611.77 seconds)\n", + "Cbc0010I After 21635000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1611.85 seconds)\n", + "Cbc0010I After 21636000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1611.92 seconds)\n", + "Cbc0010I After 21637000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1612.00 seconds)\n", + "Cbc0010I After 21638000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1612.05 seconds)\n", + "Cbc0010I After 21639000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1612.12 seconds)\n", + "Cbc0010I After 21640000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.19 seconds)\n", + "Cbc0010I After 21641000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.26 seconds)\n", + "Cbc0010I After 21642000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1612.32 seconds)\n", + "Cbc0010I After 21643000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1612.38 seconds)\n", + "Cbc0010I After 21644000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1612.45 seconds)\n", + "Cbc0010I After 21645000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1612.51 seconds)\n", + "Cbc0010I After 21646000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1612.58 seconds)\n", + "Cbc0010I After 21647000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.64 seconds)\n", + "Cbc0010I After 21648000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1612.70 seconds)\n", + "Cbc0010I After 21649000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1612.76 seconds)\n", + "Cbc0010I After 21650000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1612.82 seconds)\n", + "Cbc0010I After 21651000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1612.88 seconds)\n", + "Cbc0010I After 21652000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1612.93 seconds)\n", + "Cbc0010I After 21653000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1612.99 seconds)\n", + "Cbc0010I After 21654000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1613.05 seconds)\n", + "Cbc0010I After 21655000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1613.10 seconds)\n", + "Cbc0010I After 21656000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1613.17 seconds)\n", + "Cbc0010I After 21657000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1613.23 seconds)\n", + "Cbc0010I After 21658000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1613.28 seconds)\n", + "Cbc0010I After 21659000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.34 seconds)\n", + "Cbc0010I After 21660000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1613.40 seconds)\n", + "Cbc0010I After 21661000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1613.47 seconds)\n", + "Cbc0010I After 21662000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1613.53 seconds)\n", + "Cbc0010I After 21663000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1613.59 seconds)\n", + "Cbc0010I After 21664000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1613.66 seconds)\n", + "Cbc0010I After 21665000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.73 seconds)\n", + "Cbc0010I After 21666000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1613.81 seconds)\n", + "Cbc0010I After 21667000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1613.91 seconds)\n", + "Cbc0010I After 21668000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.98 seconds)\n", + "Cbc0010I After 21669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.05 seconds)\n", + "Cbc0010I After 21670000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1614.11 seconds)\n", + "Cbc0010I After 21671000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1614.17 seconds)\n", + "Cbc0010I After 21672000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1614.24 seconds)\n", + "Cbc0010I After 21673000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.30 seconds)\n", + "Cbc0010I After 21674000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1614.36 seconds)\n", + "Cbc0010I After 21675000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.43 seconds)\n", + "Cbc0010I After 21676000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1614.49 seconds)\n", + "Cbc0010I After 21677000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1614.56 seconds)\n", + "Cbc0010I After 21678000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1614.63 seconds)\n", + "Cbc0010I After 21679000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1614.69 seconds)\n", + "Cbc0010I After 21680000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1614.76 seconds)\n", + "Cbc0010I After 21681000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1614.83 seconds)\n", + "Cbc0010I After 21682000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1614.90 seconds)\n", + "Cbc0010I After 21683000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1614.95 seconds)\n", + "Cbc0010I After 21684000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1615.00 seconds)\n", + "Cbc0010I After 21685000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1615.06 seconds)\n", + "Cbc0010I After 21686000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1615.11 seconds)\n", + "Cbc0010I After 21687000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1615.16 seconds)\n", + "Cbc0010I After 21688000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1615.22 seconds)\n", + "Cbc0010I After 21689000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1615.28 seconds)\n", + "Cbc0010I After 21690000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1615.34 seconds)\n", + "Cbc0010I After 21691000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1615.39 seconds)\n", + "Cbc0010I After 21692000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1615.45 seconds)\n", + "Cbc0010I After 21693000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1615.50 seconds)\n", + "Cbc0010I After 21694000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1615.56 seconds)\n", + "Cbc0010I After 21695000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1615.61 seconds)\n", + "Cbc0010I After 21696000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1615.67 seconds)\n", + "Cbc0010I After 21697000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1615.73 seconds)\n", + "Cbc0010I After 21698000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1615.81 seconds)\n", + "Cbc0010I After 21699000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1615.88 seconds)\n", + "Cbc0010I After 21700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1615.94 seconds)\n", + "Cbc0010I After 21701000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1615.99 seconds)\n", + "Cbc0010I After 21702000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1616.06 seconds)\n", + "Cbc0010I After 21703000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1616.15 seconds)\n", + "Cbc0010I After 21704000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1616.21 seconds)\n", + "Cbc0010I After 21705000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1616.28 seconds)\n", + "Cbc0010I After 21706000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1616.37 seconds)\n", + "Cbc0010I After 21707000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1616.45 seconds)\n", + "Cbc0010I After 21708000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1616.51 seconds)\n", + "Cbc0010I After 21709000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1616.58 seconds)\n", + "Cbc0010I After 21710000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1616.64 seconds)\n", + "Cbc0010I After 21711000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1616.70 seconds)\n", + "Cbc0010I After 21712000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1616.77 seconds)\n", + "Cbc0010I After 21713000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1616.83 seconds)\n", + "Cbc0010I After 21714000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1616.89 seconds)\n", + "Cbc0010I After 21715000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1616.96 seconds)\n", + "Cbc0010I After 21716000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1617.02 seconds)\n", + "Cbc0010I After 21717000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1617.09 seconds)\n", + "Cbc0010I After 21718000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1617.15 seconds)\n", + "Cbc0010I After 21719000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1617.21 seconds)\n", + "Cbc0010I After 21720000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1617.28 seconds)\n", + "Cbc0010I After 21721000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1617.35 seconds)\n", + "Cbc0010I After 21722000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1617.40 seconds)\n", + "Cbc0010I After 21723000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1617.46 seconds)\n", + "Cbc0010I After 21724000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1617.52 seconds)\n", + "Cbc0010I After 21725000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1617.58 seconds)\n", + "Cbc0010I After 21726000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1617.64 seconds)\n", + "Cbc0010I After 21727000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1617.70 seconds)\n", + "Cbc0010I After 21728000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1617.76 seconds)\n", + "Cbc0010I After 21729000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1617.82 seconds)\n", + "Cbc0010I After 21730000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1617.89 seconds)\n", + "Cbc0010I After 21731000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1617.96 seconds)\n", + "Cbc0010I After 21732000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1618.05 seconds)\n", + "Cbc0010I After 21733000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1618.10 seconds)\n", + "Cbc0010I After 21734000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1618.16 seconds)\n", + "Cbc0010I After 21735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1618.21 seconds)\n", + "Cbc0010I After 21736000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1618.27 seconds)\n", + "Cbc0010I After 21737000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1618.33 seconds)\n", + "Cbc0010I After 21738000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1618.39 seconds)\n", + "Cbc0010I After 21739000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1618.45 seconds)\n", + "Cbc0010I After 21740000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1618.52 seconds)\n", + "Cbc0010I After 21741000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1618.60 seconds)\n", + "Cbc0010I After 21742000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1618.65 seconds)\n", + "Cbc0010I After 21743000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1618.71 seconds)\n", + "Cbc0010I After 21744000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1618.79 seconds)\n", + "Cbc0010I After 21745000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1618.86 seconds)\n", + "Cbc0010I After 21746000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1618.92 seconds)\n", + "Cbc0010I After 21747000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1618.97 seconds)\n", + "Cbc0010I After 21748000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1619.03 seconds)\n", + "Cbc0010I After 21749000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1619.09 seconds)\n", + "Cbc0010I After 21750000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1619.15 seconds)\n", + "Cbc0010I After 21751000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1619.21 seconds)\n", + "Cbc0010I After 21752000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1619.27 seconds)\n", + "Cbc0010I After 21753000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (1619.33 seconds)\n", + "Cbc0010I After 21754000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1619.39 seconds)\n", + "Cbc0010I After 21755000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1619.45 seconds)\n", + "Cbc0010I After 21756000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1619.52 seconds)\n", + "Cbc0010I After 21757000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1619.59 seconds)\n", + "Cbc0010I After 21758000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1619.66 seconds)\n", + "Cbc0010I After 21759000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1619.72 seconds)\n", + "Cbc0010I After 21760000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1619.80 seconds)\n", + "Cbc0010I After 21761000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1619.87 seconds)\n", + "Cbc0010I After 21762000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1619.96 seconds)\n", + "Cbc0010I After 21763000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1620.05 seconds)\n", + "Cbc0010I After 21764000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1620.13 seconds)\n", + "Cbc0010I After 21765000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1620.21 seconds)\n", + "Cbc0010I After 21766000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1620.28 seconds)\n", + "Cbc0010I After 21767000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1620.36 seconds)\n", + "Cbc0010I After 21768000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1620.43 seconds)\n", + "Cbc0010I After 21769000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1620.50 seconds)\n", + "Cbc0010I After 21770000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1620.58 seconds)\n", + "Cbc0010I After 21771000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1620.65 seconds)\n", + "Cbc0010I After 21772000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1620.72 seconds)\n", + "Cbc0010I After 21773000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1620.80 seconds)\n", + "Cbc0010I After 21774000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1620.87 seconds)\n", + "Cbc0010I After 21775000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1620.94 seconds)\n", + "Cbc0010I After 21776000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1621.02 seconds)\n", + "Cbc0010I After 21777000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1621.10 seconds)\n", + "Cbc0010I After 21778000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1621.17 seconds)\n", + "Cbc0010I After 21779000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1621.24 seconds)\n", + "Cbc0010I After 21780000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1621.32 seconds)\n", + "Cbc0010I After 21781000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1621.41 seconds)\n", + "Cbc0010I After 21782000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1621.49 seconds)\n", + "Cbc0010I After 21783000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1621.57 seconds)\n", + "Cbc0010I After 21784000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1621.64 seconds)\n", + "Cbc0010I After 21785000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1621.71 seconds)\n", + "Cbc0010I After 21786000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1621.78 seconds)\n", + "Cbc0010I After 21787000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1621.86 seconds)\n", + "Cbc0010I After 21788000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1621.93 seconds)\n", + "Cbc0010I After 21789000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1622.00 seconds)\n", + "Cbc0010I After 21790000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1622.08 seconds)\n", + "Cbc0010I After 21791000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1622.16 seconds)\n", + "Cbc0010I After 21792000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1622.23 seconds)\n", + "Cbc0010I After 21793000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1622.30 seconds)\n", + "Cbc0010I After 21794000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1622.38 seconds)\n", + "Cbc0010I After 21795000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1622.45 seconds)\n", + "Cbc0010I After 21796000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1622.53 seconds)\n", + "Cbc0010I After 21797000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1622.61 seconds)\n", + "Cbc0010I After 21798000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1622.68 seconds)\n", + "Cbc0010I After 21799000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1622.75 seconds)\n", + "Cbc0010I After 21800000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1622.83 seconds)\n", + "Cbc0010I After 21801000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1622.90 seconds)\n", + "Cbc0010I After 21802000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1622.98 seconds)\n", + "Cbc0010I After 21803000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1623.05 seconds)\n", + "Cbc0010I After 21804000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1623.13 seconds)\n", + "Cbc0010I After 21805000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1623.20 seconds)\n", + "Cbc0010I After 21806000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1623.28 seconds)\n", + "Cbc0010I After 21807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1623.35 seconds)\n", + "Cbc0010I After 21808000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1623.42 seconds)\n", + "Cbc0010I After 21809000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1623.50 seconds)\n", + "Cbc0010I After 21810000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1623.58 seconds)\n", + "Cbc0010I After 21811000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1623.66 seconds)\n", + "Cbc0010I After 21812000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1623.73 seconds)\n", + "Cbc0010I After 21813000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1623.81 seconds)\n", + "Cbc0010I After 21814000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1623.88 seconds)\n", + "Cbc0010I After 21815000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1623.95 seconds)\n", + "Cbc0010I After 21816000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1624.03 seconds)\n", + "Cbc0010I After 21817000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1624.10 seconds)\n", + "Cbc0010I After 21818000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1624.18 seconds)\n", + "Cbc0010I After 21819000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1624.26 seconds)\n", + "Cbc0010I After 21820000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1624.35 seconds)\n", + "Cbc0010I After 21821000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1624.43 seconds)\n", + "Cbc0010I After 21822000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1624.51 seconds)\n", + "Cbc0010I After 21823000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1624.59 seconds)\n", + "Cbc0010I After 21824000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1624.66 seconds)\n", + "Cbc0010I After 21825000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1624.74 seconds)\n", + "Cbc0010I After 21826000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1624.81 seconds)\n", + "Cbc0010I After 21827000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1624.89 seconds)\n", + "Cbc0010I After 21828000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1624.97 seconds)\n", + "Cbc0010I After 21829000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1625.04 seconds)\n", + "Cbc0010I After 21830000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1625.12 seconds)\n", + "Cbc0010I After 21831000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1625.19 seconds)\n", + "Cbc0010I After 21832000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1625.26 seconds)\n", + "Cbc0010I After 21833000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1625.33 seconds)\n", + "Cbc0010I After 21834000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1625.40 seconds)\n", + "Cbc0010I After 21835000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1625.47 seconds)\n", + "Cbc0010I After 21836000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1625.54 seconds)\n", + "Cbc0010I After 21837000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1625.61 seconds)\n", + "Cbc0010I After 21838000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1625.69 seconds)\n", + "Cbc0010I After 21839000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1625.76 seconds)\n", + "Cbc0010I After 21840000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1625.83 seconds)\n", + "Cbc0010I After 21841000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1625.90 seconds)\n", + "Cbc0010I After 21842000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1625.97 seconds)\n", + "Cbc0010I After 21843000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1626.05 seconds)\n", + "Cbc0010I After 21844000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1626.12 seconds)\n", + "Cbc0010I After 21845000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1626.19 seconds)\n", + "Cbc0010I After 21846000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1626.29 seconds)\n", + "Cbc0010I After 21847000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1626.37 seconds)\n", + "Cbc0010I After 21848000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1626.45 seconds)\n", + "Cbc0010I After 21849000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1626.52 seconds)\n", + "Cbc0010I After 21850000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1626.60 seconds)\n", + "Cbc0010I After 21851000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1626.68 seconds)\n", + "Cbc0010I After 21852000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1626.76 seconds)\n", + "Cbc0010I After 21853000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1626.83 seconds)\n", + "Cbc0010I After 21854000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1626.91 seconds)\n", + "Cbc0010I After 21855000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1626.99 seconds)\n", + "Cbc0010I After 21856000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1627.07 seconds)\n", + "Cbc0010I After 21857000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1627.17 seconds)\n", + "Cbc0010I After 21858000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1627.25 seconds)\n", + "Cbc0010I After 21859000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1627.32 seconds)\n", + "Cbc0010I After 21860000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1627.39 seconds)\n", + "Cbc0010I After 21861000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1627.45 seconds)\n", + "Cbc0010I After 21862000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1627.51 seconds)\n", + "Cbc0010I After 21863000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1627.57 seconds)\n", + "Cbc0010I After 21864000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1627.63 seconds)\n", + "Cbc0010I After 21865000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1627.70 seconds)\n", + "Cbc0010I After 21866000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1627.77 seconds)\n", + "Cbc0010I After 21867000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1627.84 seconds)\n", + "Cbc0010I After 21868000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1627.90 seconds)\n", + "Cbc0010I After 21869000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1628.02 seconds)\n", + "Cbc0010I After 21870000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1628.10 seconds)\n", + "Cbc0010I After 21871000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.17 seconds)\n", + "Cbc0010I After 21872000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1628.23 seconds)\n", + "Cbc0010I After 21873000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.29 seconds)\n", + "Cbc0010I After 21874000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1628.36 seconds)\n", + "Cbc0010I After 21875000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.43 seconds)\n", + "Cbc0010I After 21876000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.51 seconds)\n", + "Cbc0010I After 21877000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1628.58 seconds)\n", + "Cbc0010I After 21878000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.64 seconds)\n", + "Cbc0010I After 21879000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1628.71 seconds)\n", + "Cbc0010I After 21880000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1628.78 seconds)\n", + "Cbc0010I After 21881000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.84 seconds)\n", + "Cbc0010I After 21882000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1628.91 seconds)\n", + "Cbc0010I After 21883000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1628.98 seconds)\n", + "Cbc0010I After 21884000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1629.05 seconds)\n", + "Cbc0010I After 21885000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1629.12 seconds)\n", + "Cbc0010I After 21886000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1629.19 seconds)\n", + "Cbc0010I After 21887000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1629.25 seconds)\n", + "Cbc0010I After 21888000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1629.31 seconds)\n", + "Cbc0010I After 21889000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1629.37 seconds)\n", + "Cbc0010I After 21890000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1629.43 seconds)\n", + "Cbc0010I After 21891000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1629.51 seconds)\n", + "Cbc0010I After 21892000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1629.56 seconds)\n", + "Cbc0010I After 21893000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1629.63 seconds)\n", + "Cbc0010I After 21894000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1629.69 seconds)\n", + "Cbc0010I After 21895000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1629.75 seconds)\n", + "Cbc0010I After 21896000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1629.81 seconds)\n", + "Cbc0010I After 21897000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1629.89 seconds)\n", + "Cbc0010I After 21898000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1629.97 seconds)\n", + "Cbc0010I After 21899000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1630.04 seconds)\n", + "Cbc0010I After 21900000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1630.10 seconds)\n", + "Cbc0010I After 21901000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1630.16 seconds)\n", + "Cbc0010I After 21902000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1630.22 seconds)\n", + "Cbc0010I After 21903000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1630.27 seconds)\n", + "Cbc0010I After 21904000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1630.33 seconds)\n", + "Cbc0010I After 21905000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1630.39 seconds)\n", + "Cbc0010I After 21906000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1630.46 seconds)\n", + "Cbc0010I After 21907000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1630.54 seconds)\n", + "Cbc0010I After 21908000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1630.62 seconds)\n", + "Cbc0010I After 21909000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1630.68 seconds)\n", + "Cbc0010I After 21910000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1630.76 seconds)\n", + "Cbc0010I After 21911000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1630.82 seconds)\n", + "Cbc0010I After 21912000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1630.91 seconds)\n", + "Cbc0010I After 21913000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1630.96 seconds)\n", + "Cbc0010I After 21914000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1631.03 seconds)\n", + "Cbc0010I After 21915000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1631.09 seconds)\n", + "Cbc0010I After 21916000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1631.16 seconds)\n", + "Cbc0010I After 21917000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1631.23 seconds)\n", + "Cbc0010I After 21918000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1631.30 seconds)\n", + "Cbc0010I After 21919000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1631.37 seconds)\n", + "Cbc0010I After 21920000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1631.44 seconds)\n", + "Cbc0010I After 21921000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1631.51 seconds)\n", + "Cbc0010I After 21922000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.57 seconds)\n", + "Cbc0010I After 21923000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.64 seconds)\n", + "Cbc0010I After 21924000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.71 seconds)\n", + "Cbc0010I After 21925000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1631.77 seconds)\n", + "Cbc0010I After 21926000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1631.84 seconds)\n", + "Cbc0010I After 21927000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1631.91 seconds)\n", + "Cbc0010I After 21928000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1631.97 seconds)\n", + "Cbc0010I After 21929000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1632.04 seconds)\n", + "Cbc0010I After 21930000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1632.09 seconds)\n", + "Cbc0010I After 21931000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1632.15 seconds)\n", + "Cbc0010I After 21932000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1632.21 seconds)\n", + "Cbc0010I After 21933000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1632.28 seconds)\n", + "Cbc0010I After 21934000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1632.34 seconds)\n", + "Cbc0010I After 21935000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1632.40 seconds)\n", + "Cbc0010I After 21936000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1632.46 seconds)\n", + "Cbc0010I After 21937000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1632.52 seconds)\n", + "Cbc0010I After 21938000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1632.59 seconds)\n", + "Cbc0010I After 21939000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1632.65 seconds)\n", + "Cbc0010I After 21940000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1632.71 seconds)\n", + "Cbc0010I After 21941000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1632.77 seconds)\n", + "Cbc0010I After 21942000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1632.83 seconds)\n", + "Cbc0010I After 21943000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1632.89 seconds)\n", + "Cbc0010I After 21944000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1632.95 seconds)\n", + "Cbc0010I After 21945000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1633.01 seconds)\n", + "Cbc0010I After 21946000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1633.07 seconds)\n", + "Cbc0010I After 21947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1633.14 seconds)\n", + "Cbc0010I After 21948000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1633.21 seconds)\n", + "Cbc0010I After 21949000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1633.27 seconds)\n", + "Cbc0010I After 21950000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1633.35 seconds)\n", + "Cbc0010I After 21951000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1633.41 seconds)\n", + "Cbc0010I After 21952000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1633.48 seconds)\n", + "Cbc0010I After 21953000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1633.54 seconds)\n", + "Cbc0010I After 21954000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1633.60 seconds)\n", + "Cbc0010I After 21955000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1633.67 seconds)\n", + "Cbc0010I After 21956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1633.73 seconds)\n", + "Cbc0010I After 21957000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1633.80 seconds)\n", + "Cbc0010I After 21958000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1633.88 seconds)\n", + "Cbc0010I After 21959000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1633.95 seconds)\n", + "Cbc0010I After 21960000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1634.02 seconds)\n", + "Cbc0010I After 21961000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1634.08 seconds)\n", + "Cbc0010I After 21962000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1634.15 seconds)\n", + "Cbc0010I After 21963000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1634.21 seconds)\n", + "Cbc0010I After 21964000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1634.28 seconds)\n", + "Cbc0010I After 21965000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1634.34 seconds)\n", + "Cbc0010I After 21966000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1634.40 seconds)\n", + "Cbc0010I After 21967000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1634.46 seconds)\n", + "Cbc0010I After 21968000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1634.52 seconds)\n", + "Cbc0010I After 21969000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1634.58 seconds)\n", + "Cbc0010I After 21970000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1634.64 seconds)\n", + "Cbc0010I After 21971000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1634.70 seconds)\n", + "Cbc0010I After 21972000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1634.76 seconds)\n", + "Cbc0010I After 21973000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1634.82 seconds)\n", + "Cbc0010I After 21974000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1634.89 seconds)\n", + "Cbc0010I After 21975000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1634.96 seconds)\n", + "Cbc0010I After 21976000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1635.02 seconds)\n", + "Cbc0010I After 21977000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1635.09 seconds)\n", + "Cbc0010I After 21978000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1635.15 seconds)\n", + "Cbc0010I After 21979000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1635.21 seconds)\n", + "Cbc0010I After 21980000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1635.28 seconds)\n", + "Cbc0010I After 21981000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1635.34 seconds)\n", + "Cbc0010I After 21982000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1635.40 seconds)\n", + "Cbc0010I After 21983000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1635.46 seconds)\n", + "Cbc0010I After 21984000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1635.51 seconds)\n", + "Cbc0010I After 21985000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1635.57 seconds)\n", + "Cbc0010I After 21986000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1635.63 seconds)\n", + "Cbc0010I After 21987000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1635.69 seconds)\n", + "Cbc0010I After 21988000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1635.75 seconds)\n", + "Cbc0010I After 21989000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1635.81 seconds)\n", + "Cbc0010I After 21990000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1635.87 seconds)\n", + "Cbc0010I After 21991000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1635.93 seconds)\n", + "Cbc0010I After 21992000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1635.99 seconds)\n", + "Cbc0010I After 21993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1636.05 seconds)\n", + "Cbc0010I After 21994000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1636.13 seconds)\n", + "Cbc0010I After 21995000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1636.19 seconds)\n", + "Cbc0010I After 21996000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1636.26 seconds)\n", + "Cbc0010I After 21997000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1636.33 seconds)\n", + "Cbc0010I After 21998000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1636.38 seconds)\n", + "Cbc0010I After 21999000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1636.44 seconds)\n", + "Cbc0010I After 22000000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1636.50 seconds)\n", + "Cbc0010I After 22001000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1636.56 seconds)\n", + "Cbc0010I After 22002000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1636.62 seconds)\n", + "Cbc0010I After 22003000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1636.68 seconds)\n", + "Cbc0010I After 22004000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1636.74 seconds)\n", + "Cbc0010I After 22005000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (1636.81 seconds)\n", + "Cbc0010I After 22006000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (1636.91 seconds)\n", + "Cbc0010I After 22007000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (1636.98 seconds)\n", + "Cbc0010I After 22008000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1637.04 seconds)\n", + "Cbc0010I After 22009000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1637.12 seconds)\n", + "Cbc0010I After 22010000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1637.18 seconds)\n", + "Cbc0010I After 22011000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1637.26 seconds)\n", + "Cbc0010I After 22012000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1637.32 seconds)\n", + "Cbc0010I After 22013000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (1637.39 seconds)\n", + "Cbc0010I After 22014000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1637.45 seconds)\n", + "Cbc0010I After 22015000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1637.53 seconds)\n", + "Cbc0010I After 22016000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1637.60 seconds)\n", + "Cbc0010I After 22017000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1637.69 seconds)\n", + "Cbc0010I After 22018000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1637.75 seconds)\n", + "Cbc0010I After 22019000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1637.82 seconds)\n", + "Cbc0010I After 22020000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1637.89 seconds)\n", + "Cbc0010I After 22021000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1637.97 seconds)\n", + "Cbc0010I After 22022000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1638.03 seconds)\n", + "Cbc0010I After 22023000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1638.09 seconds)\n", + "Cbc0010I After 22024000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1638.16 seconds)\n", + "Cbc0010I After 22025000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1638.22 seconds)\n", + "Cbc0010I After 22026000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (1638.29 seconds)\n", + "Cbc0010I After 22027000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1638.37 seconds)\n", + "Cbc0010I After 22028000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1638.45 seconds)\n", + "Cbc0010I After 22029000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1638.51 seconds)\n", + "Cbc0010I After 22030000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1638.58 seconds)\n", + "Cbc0010I After 22031000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1638.66 seconds)\n", + "Cbc0010I After 22032000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1638.73 seconds)\n", + "Cbc0010I After 22033000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1638.80 seconds)\n", + "Cbc0010I After 22034000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1638.86 seconds)\n", + "Cbc0010I After 22035000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1638.94 seconds)\n", + "Cbc0010I After 22036000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1639.03 seconds)\n", + "Cbc0010I After 22037000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1639.10 seconds)\n", + "Cbc0010I After 22038000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1639.17 seconds)\n", + "Cbc0010I After 22039000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1639.24 seconds)\n", + "Cbc0010I After 22040000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1639.30 seconds)\n", + "Cbc0010I After 22041000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1639.37 seconds)\n", + "Cbc0010I After 22042000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1639.43 seconds)\n", + "Cbc0010I After 22043000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1639.49 seconds)\n", + "Cbc0010I After 22044000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1639.56 seconds)\n", + "Cbc0010I After 22045000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1639.62 seconds)\n", + "Cbc0010I After 22046000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1639.69 seconds)\n", + "Cbc0010I After 22047000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1639.75 seconds)\n", + "Cbc0010I After 22048000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1639.83 seconds)\n", + "Cbc0010I After 22049000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1639.90 seconds)\n", + "Cbc0010I After 22050000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1639.96 seconds)\n", + "Cbc0010I After 22051000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1640.04 seconds)\n", + "Cbc0010I After 22052000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1640.11 seconds)\n", + "Cbc0010I After 22053000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1640.19 seconds)\n", + "Cbc0010I After 22054000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1640.27 seconds)\n", + "Cbc0010I After 22055000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1640.34 seconds)\n", + "Cbc0010I After 22056000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1640.41 seconds)\n", + "Cbc0010I After 22057000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1640.49 seconds)\n", + "Cbc0010I After 22058000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1640.57 seconds)\n", + "Cbc0010I After 22059000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1640.64 seconds)\n", + "Cbc0010I After 22060000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1640.71 seconds)\n", + "Cbc0010I After 22061000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1640.78 seconds)\n", + "Cbc0010I After 22062000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1640.86 seconds)\n", + "Cbc0010I After 22063000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1640.95 seconds)\n", + "Cbc0010I After 22064000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1641.04 seconds)\n", + "Cbc0010I After 22065000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1641.11 seconds)\n", + "Cbc0010I After 22066000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1641.18 seconds)\n", + "Cbc0010I After 22067000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1641.26 seconds)\n", + "Cbc0010I After 22068000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1641.33 seconds)\n", + "Cbc0010I After 22069000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1641.40 seconds)\n", + "Cbc0010I After 22070000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1641.46 seconds)\n", + "Cbc0010I After 22071000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1641.53 seconds)\n", + "Cbc0010I After 22072000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1641.59 seconds)\n", + "Cbc0010I After 22073000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1641.65 seconds)\n", + "Cbc0010I After 22074000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1641.72 seconds)\n", + "Cbc0010I After 22075000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1641.79 seconds)\n", + "Cbc0010I After 22076000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1641.86 seconds)\n", + "Cbc0010I After 22077000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1642.00 seconds)\n", + "Cbc0010I After 22078000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1642.09 seconds)\n", + "Cbc0010I After 22079000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1642.16 seconds)\n", + "Cbc0010I After 22080000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1642.23 seconds)\n", + "Cbc0010I After 22081000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1642.30 seconds)\n", + "Cbc0010I After 22082000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1642.37 seconds)\n", + "Cbc0010I After 22083000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1642.44 seconds)\n", + "Cbc0010I After 22084000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1642.51 seconds)\n", + "Cbc0010I After 22085000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1642.57 seconds)\n", + "Cbc0010I After 22086000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1642.63 seconds)\n", + "Cbc0010I After 22087000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1642.69 seconds)\n", + "Cbc0010I After 22088000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1642.75 seconds)\n", + "Cbc0010I After 22089000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1642.82 seconds)\n", + "Cbc0010I After 22090000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1642.88 seconds)\n", + "Cbc0010I After 22091000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1642.94 seconds)\n", + "Cbc0010I After 22092000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1643.00 seconds)\n", + "Cbc0010I After 22093000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1643.06 seconds)\n", + "Cbc0010I After 22094000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1643.12 seconds)\n", + "Cbc0010I After 22095000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1643.19 seconds)\n", + "Cbc0010I After 22096000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1643.25 seconds)\n", + "Cbc0010I After 22097000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1643.32 seconds)\n", + "Cbc0010I After 22098000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1643.37 seconds)\n", + "Cbc0010I After 22099000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1643.43 seconds)\n", + "Cbc0010I After 22100000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1643.49 seconds)\n", + "Cbc0010I After 22101000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1643.55 seconds)\n", + "Cbc0010I After 22102000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1643.61 seconds)\n", + "Cbc0010I After 22103000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1643.67 seconds)\n", + "Cbc0010I After 22104000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1643.74 seconds)\n", + "Cbc0010I After 22105000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1643.80 seconds)\n", + "Cbc0010I After 22106000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1643.86 seconds)\n", + "Cbc0010I After 22107000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1643.92 seconds)\n", + "Cbc0010I After 22108000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1643.98 seconds)\n", + "Cbc0010I After 22109000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1644.04 seconds)\n", + "Cbc0010I After 22110000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1644.11 seconds)\n", + "Cbc0010I After 22111000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1644.19 seconds)\n", + "Cbc0010I After 22112000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1644.27 seconds)\n", + "Cbc0010I After 22113000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1644.33 seconds)\n", + "Cbc0010I After 22114000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1644.40 seconds)\n", + "Cbc0010I After 22115000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1644.46 seconds)\n", + "Cbc0010I After 22116000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1644.52 seconds)\n", + "Cbc0010I After 22117000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1644.58 seconds)\n", + "Cbc0010I After 22118000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1644.67 seconds)\n", + "Cbc0010I After 22119000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1644.74 seconds)\n", + "Cbc0010I After 22120000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1644.81 seconds)\n", + "Cbc0010I After 22121000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1644.89 seconds)\n", + "Cbc0010I After 22122000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1644.95 seconds)\n", + "Cbc0010I After 22123000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1645.01 seconds)\n", + "Cbc0010I After 22124000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1645.08 seconds)\n", + "Cbc0010I After 22125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1645.15 seconds)\n", + "Cbc0010I After 22126000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1645.21 seconds)\n", + "Cbc0010I After 22127000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1645.28 seconds)\n", + "Cbc0010I After 22128000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1645.34 seconds)\n", + "Cbc0010I After 22129000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1645.42 seconds)\n", + "Cbc0010I After 22130000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1645.49 seconds)\n", + "Cbc0010I After 22131000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1645.56 seconds)\n", + "Cbc0010I After 22132000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1645.62 seconds)\n", + "Cbc0010I After 22133000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1645.68 seconds)\n", + "Cbc0010I After 22134000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1645.74 seconds)\n", + "Cbc0010I After 22135000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1645.82 seconds)\n", + "Cbc0010I After 22136000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1645.89 seconds)\n", + "Cbc0010I After 22137000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1645.95 seconds)\n", + "Cbc0010I After 22138000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1646.01 seconds)\n", + "Cbc0010I After 22139000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1646.08 seconds)\n", + "Cbc0010I After 22140000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1646.15 seconds)\n", + "Cbc0010I After 22141000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1646.22 seconds)\n", + "Cbc0010I After 22142000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1646.28 seconds)\n", + "Cbc0010I After 22143000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1646.34 seconds)\n", + "Cbc0010I After 22144000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1646.40 seconds)\n", + "Cbc0010I After 22145000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1646.47 seconds)\n", + "Cbc0010I After 22146000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1646.54 seconds)\n", + "Cbc0010I After 22147000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1646.61 seconds)\n", + "Cbc0010I After 22148000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1646.68 seconds)\n", + "Cbc0010I After 22149000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1646.75 seconds)\n", + "Cbc0010I After 22150000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1646.82 seconds)\n", + "Cbc0010I After 22151000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1646.89 seconds)\n", + "Cbc0010I After 22152000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1646.95 seconds)\n", + "Cbc0010I After 22153000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1647.03 seconds)\n", + "Cbc0010I After 22154000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1647.10 seconds)\n", + "Cbc0010I After 22155000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1647.17 seconds)\n", + "Cbc0010I After 22156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1647.22 seconds)\n", + "Cbc0010I After 22157000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1647.29 seconds)\n", + "Cbc0010I After 22158000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1647.37 seconds)\n", + "Cbc0010I After 22159000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1647.45 seconds)\n", + "Cbc0010I After 22160000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1647.54 seconds)\n", + "Cbc0010I After 22161000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1647.61 seconds)\n", + "Cbc0010I After 22162000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1647.68 seconds)\n", + "Cbc0010I After 22163000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1647.74 seconds)\n", + "Cbc0010I After 22164000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1647.81 seconds)\n", + "Cbc0010I After 22165000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1647.88 seconds)\n", + "Cbc0010I After 22166000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1647.95 seconds)\n", + "Cbc0010I After 22167000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1648.02 seconds)\n", + "Cbc0010I After 22168000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1648.10 seconds)\n", + "Cbc0010I After 22169000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1648.16 seconds)\n", + "Cbc0010I After 22170000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1648.23 seconds)\n", + "Cbc0010I After 22171000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1648.29 seconds)\n", + "Cbc0010I After 22172000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1648.35 seconds)\n", + "Cbc0010I After 22173000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1648.41 seconds)\n", + "Cbc0010I After 22174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1648.48 seconds)\n", + "Cbc0010I After 22175000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1648.53 seconds)\n", + "Cbc0010I After 22176000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1648.60 seconds)\n", + "Cbc0010I After 22177000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1648.68 seconds)\n", + "Cbc0010I After 22178000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1648.76 seconds)\n", + "Cbc0010I After 22179000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1648.83 seconds)\n", + "Cbc0010I After 22180000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1648.91 seconds)\n", + "Cbc0010I After 22181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1648.98 seconds)\n", + "Cbc0010I After 22182000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1649.05 seconds)\n", + "Cbc0010I After 22183000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1649.12 seconds)\n", + "Cbc0010I After 22184000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1649.18 seconds)\n", + "Cbc0010I After 22185000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1649.25 seconds)\n", + "Cbc0010I After 22186000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1649.33 seconds)\n", + "Cbc0010I After 22187000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1649.41 seconds)\n", + "Cbc0010I After 22188000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1649.48 seconds)\n", + "Cbc0010I After 22189000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1649.56 seconds)\n", + "Cbc0010I After 22190000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1649.63 seconds)\n", + "Cbc0010I After 22191000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1649.71 seconds)\n", + "Cbc0010I After 22192000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1649.78 seconds)\n", + "Cbc0010I After 22193000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1649.84 seconds)\n", + "Cbc0010I After 22194000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1649.91 seconds)\n", + "Cbc0010I After 22195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1649.97 seconds)\n", + "Cbc0010I After 22196000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1650.03 seconds)\n", + "Cbc0010I After 22197000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1650.10 seconds)\n", + "Cbc0010I After 22198000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1650.18 seconds)\n", + "Cbc0010I After 22199000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1650.25 seconds)\n", + "Cbc0010I After 22200000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1650.33 seconds)\n", + "Cbc0010I After 22201000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1650.40 seconds)\n", + "Cbc0010I After 22202000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1650.49 seconds)\n", + "Cbc0010I After 22203000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1650.56 seconds)\n", + "Cbc0010I After 22204000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1650.63 seconds)\n", + "Cbc0010I After 22205000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1650.70 seconds)\n", + "Cbc0010I After 22206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1650.76 seconds)\n", + "Cbc0010I After 22207000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1650.82 seconds)\n", + "Cbc0010I After 22208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1650.88 seconds)\n", + "Cbc0010I After 22209000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1650.96 seconds)\n", + "Cbc0010I After 22210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1651.03 seconds)\n", + "Cbc0010I After 22211000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1651.11 seconds)\n", + "Cbc0010I After 22212000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1651.18 seconds)\n", + "Cbc0010I After 22213000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1651.24 seconds)\n", + "Cbc0010I After 22214000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1651.33 seconds)\n", + "Cbc0010I After 22215000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1651.43 seconds)\n", + "Cbc0010I After 22216000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1651.52 seconds)\n", + "Cbc0010I After 22217000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1651.60 seconds)\n", + "Cbc0010I After 22218000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1651.68 seconds)\n", + "Cbc0010I After 22219000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1651.76 seconds)\n", + "Cbc0010I After 22220000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1651.83 seconds)\n", + "Cbc0010I After 22221000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1651.89 seconds)\n", + "Cbc0010I After 22222000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1651.95 seconds)\n", + "Cbc0010I After 22223000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1652.01 seconds)\n", + "Cbc0010I After 22224000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1652.07 seconds)\n", + "Cbc0010I After 22225000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1652.14 seconds)\n", + "Cbc0010I After 22226000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1652.21 seconds)\n", + "Cbc0010I After 22227000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1652.28 seconds)\n", + "Cbc0010I After 22228000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1652.35 seconds)\n", + "Cbc0010I After 22229000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1652.41 seconds)\n", + "Cbc0010I After 22230000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1652.46 seconds)\n", + "Cbc0010I After 22231000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1652.52 seconds)\n", + "Cbc0010I After 22232000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1652.57 seconds)\n", + "Cbc0010I After 22233000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1652.63 seconds)\n", + "Cbc0010I After 22234000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1652.69 seconds)\n", + "Cbc0010I After 22235000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1652.76 seconds)\n", + "Cbc0010I After 22236000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1652.83 seconds)\n", + "Cbc0010I After 22237000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1652.89 seconds)\n", + "Cbc0010I After 22238000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1652.96 seconds)\n", + "Cbc0010I After 22239000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1653.03 seconds)\n", + "Cbc0010I After 22240000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1653.10 seconds)\n", + "Cbc0010I After 22241000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1653.17 seconds)\n", + "Cbc0010I After 22242000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1653.24 seconds)\n", + "Cbc0010I After 22243000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1653.31 seconds)\n", + "Cbc0010I After 22244000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1653.39 seconds)\n", + "Cbc0010I After 22245000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1653.49 seconds)\n", + "Cbc0010I After 22246000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1653.58 seconds)\n", + "Cbc0010I After 22247000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1653.65 seconds)\n", + "Cbc0010I After 22248000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (1653.76 seconds)\n", + "Cbc0010I After 22249000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (1653.83 seconds)\n", + "Cbc0010I After 22250000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (1653.91 seconds)\n", + "Cbc0010I After 22251000 nodes, 206 on tree, 1e+50 best solution, best possible 0 (1653.98 seconds)\n", + "Cbc0010I After 22252000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (1654.06 seconds)\n", + "Cbc0010I After 22253000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1654.12 seconds)\n", + "Cbc0010I After 22254000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1654.19 seconds)\n", + "Cbc0010I After 22255000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1654.25 seconds)\n", + "Cbc0010I After 22256000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1654.30 seconds)\n", + "Cbc0010I After 22257000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1654.36 seconds)\n", + "Cbc0010I After 22258000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1654.43 seconds)\n", + "Cbc0010I After 22259000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1654.50 seconds)\n", + "Cbc0010I After 22260000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1654.57 seconds)\n", + "Cbc0010I After 22261000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1654.64 seconds)\n", + "Cbc0010I After 22262000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1654.71 seconds)\n", + "Cbc0010I After 22263000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (1654.78 seconds)\n", + "Cbc0010I After 22264000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (1654.85 seconds)\n", + "Cbc0010I After 22265000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1654.92 seconds)\n", + "Cbc0010I After 22266000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (1654.99 seconds)\n", + "Cbc0010I After 22267000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1655.06 seconds)\n", + "Cbc0010I After 22268000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1655.12 seconds)\n", + "Cbc0010I After 22269000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1655.18 seconds)\n", + "Cbc0010I After 22270000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1655.25 seconds)\n", + "Cbc0010I After 22271000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1655.33 seconds)\n", + "Cbc0010I After 22272000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1655.39 seconds)\n", + "Cbc0010I After 22273000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1655.46 seconds)\n", + "Cbc0010I After 22274000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1655.54 seconds)\n", + "Cbc0010I After 22275000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1655.62 seconds)\n", + "Cbc0010I After 22276000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1655.68 seconds)\n", + "Cbc0010I After 22277000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1655.75 seconds)\n", + "Cbc0010I After 22278000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1655.81 seconds)\n", + "Cbc0010I After 22279000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1655.87 seconds)\n", + "Cbc0010I After 22280000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1655.94 seconds)\n", + "Cbc0010I After 22281000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1656.01 seconds)\n", + "Cbc0010I After 22282000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1656.07 seconds)\n", + "Cbc0010I After 22283000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1656.13 seconds)\n", + "Cbc0010I After 22284000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1656.20 seconds)\n", + "Cbc0010I After 22285000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1656.32 seconds)\n", + "Cbc0010I After 22286000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1656.40 seconds)\n", + "Cbc0010I After 22287000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1656.46 seconds)\n", + "Cbc0010I After 22288000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1656.56 seconds)\n", + "Cbc0010I After 22289000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1656.64 seconds)\n", + "Cbc0010I After 22290000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1656.74 seconds)\n", + "Cbc0010I After 22291000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1656.84 seconds)\n", + "Cbc0010I After 22292000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1656.94 seconds)\n", + "Cbc0010I After 22293000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1657.05 seconds)\n", + "Cbc0010I After 22294000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1657.16 seconds)\n", + "Cbc0010I After 22295000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1657.26 seconds)\n", + "Cbc0010I After 22296000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1657.34 seconds)\n", + "Cbc0010I After 22297000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1657.45 seconds)\n", + "Cbc0010I After 22298000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1657.54 seconds)\n", + "Cbc0010I After 22299000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1657.63 seconds)\n", + "Cbc0010I After 22300000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1657.70 seconds)\n", + "Cbc0010I After 22301000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1657.78 seconds)\n", + "Cbc0010I After 22302000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1657.86 seconds)\n", + "Cbc0010I After 22303000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1657.93 seconds)\n", + "Cbc0010I After 22304000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1658.01 seconds)\n", + "Cbc0010I After 22305000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1658.07 seconds)\n", + "Cbc0010I After 22306000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1658.15 seconds)\n", + "Cbc0010I After 22307000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1658.23 seconds)\n", + "Cbc0010I After 22308000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1658.30 seconds)\n", + "Cbc0010I After 22309000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1658.37 seconds)\n", + "Cbc0010I After 22310000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1658.44 seconds)\n", + "Cbc0010I After 22311000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1658.50 seconds)\n", + "Cbc0010I After 22312000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1658.56 seconds)\n", + "Cbc0010I After 22313000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1658.62 seconds)\n", + "Cbc0010I After 22314000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1658.69 seconds)\n", + "Cbc0010I After 22315000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1658.77 seconds)\n", + "Cbc0010I After 22316000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1658.85 seconds)\n", + "Cbc0010I After 22317000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1658.94 seconds)\n", + "Cbc0010I After 22318000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1659.03 seconds)\n", + "Cbc0010I After 22319000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1659.13 seconds)\n", + "Cbc0010I After 22320000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1659.27 seconds)\n", + "Cbc0010I After 22321000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1659.41 seconds)\n", + "Cbc0010I After 22322000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1659.53 seconds)\n", + "Cbc0010I After 22323000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1659.64 seconds)\n", + "Cbc0010I After 22324000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1659.76 seconds)\n", + "Cbc0010I After 22325000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1659.92 seconds)\n", + "Cbc0010I After 22326000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1660.05 seconds)\n", + "Cbc0010I After 22327000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1660.22 seconds)\n", + "Cbc0010I After 22328000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1660.68 seconds)\n", + "Cbc0010I After 22329000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1661.06 seconds)\n", + "Cbc0010I After 22330000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1661.42 seconds)\n", + "Cbc0010I After 22331000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1661.86 seconds)\n", + "Cbc0010I After 22332000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1662.20 seconds)\n", + "Cbc0010I After 22333000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1662.41 seconds)\n", + "Cbc0010I After 22334000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1662.63 seconds)\n", + "Cbc0010I After 22335000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1662.83 seconds)\n", + "Cbc0010I After 22336000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1662.99 seconds)\n", + "Cbc0010I After 22337000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1663.15 seconds)\n", + "Cbc0010I After 22338000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1663.34 seconds)\n", + "Cbc0010I After 22339000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1663.55 seconds)\n", + "Cbc0010I After 22340000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1663.75 seconds)\n", + "Cbc0010I After 22341000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1663.92 seconds)\n", + "Cbc0010I After 22342000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1664.07 seconds)\n", + "Cbc0010I After 22343000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1664.27 seconds)\n", + "Cbc0010I After 22344000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1664.46 seconds)\n", + "Cbc0010I After 22345000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1664.63 seconds)\n", + "Cbc0010I After 22346000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1664.79 seconds)\n", + "Cbc0010I After 22347000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1664.95 seconds)\n", + "Cbc0010I After 22348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1665.09 seconds)\n", + "Cbc0010I After 22349000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1665.28 seconds)\n", + "Cbc0010I After 22350000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1665.43 seconds)\n", + "Cbc0010I After 22351000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1665.60 seconds)\n", + "Cbc0010I After 22352000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1665.74 seconds)\n", + "Cbc0010I After 22353000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1665.86 seconds)\n", + "Cbc0010I After 22354000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1666.00 seconds)\n", + "Cbc0010I After 22355000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1666.14 seconds)\n", + "Cbc0010I After 22356000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1666.27 seconds)\n", + "Cbc0010I After 22357000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1666.38 seconds)\n", + "Cbc0010I After 22358000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1666.51 seconds)\n", + "Cbc0010I After 22359000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1666.68 seconds)\n", + "Cbc0010I After 22360000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1666.85 seconds)\n", + "Cbc0010I After 22361000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1667.13 seconds)\n", + "Cbc0010I After 22362000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1667.34 seconds)\n", + "Cbc0010I After 22363000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1667.61 seconds)\n", + "Cbc0010I After 22364000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1667.89 seconds)\n", + "Cbc0010I After 22365000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1668.13 seconds)\n", + "Cbc0010I After 22366000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1668.35 seconds)\n", + "Cbc0010I After 22367000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1668.59 seconds)\n", + "Cbc0010I After 22368000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1668.81 seconds)\n", + "Cbc0010I After 22369000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1669.04 seconds)\n", + "Cbc0010I After 22370000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1669.32 seconds)\n", + "Cbc0010I After 22371000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1669.48 seconds)\n", + "Cbc0010I After 22372000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1669.71 seconds)\n", + "Cbc0010I After 22373000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1669.89 seconds)\n", + "Cbc0010I After 22374000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1670.03 seconds)\n", + "Cbc0010I After 22375000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1670.18 seconds)\n", + "Cbc0010I After 22376000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1670.32 seconds)\n", + "Cbc0010I After 22377000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1670.48 seconds)\n", + "Cbc0010I After 22378000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1670.62 seconds)\n", + "Cbc0010I After 22379000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1670.72 seconds)\n", + "Cbc0010I After 22380000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1670.83 seconds)\n", + "Cbc0010I After 22381000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1670.94 seconds)\n", + "Cbc0010I After 22382000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1671.04 seconds)\n", + "Cbc0010I After 22383000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1671.13 seconds)\n", + "Cbc0010I After 22384000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1671.33 seconds)\n", + "Cbc0010I After 22385000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1671.48 seconds)\n", + "Cbc0010I After 22386000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1671.60 seconds)\n", + "Cbc0010I After 22387000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1671.73 seconds)\n", + "Cbc0010I After 22388000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1671.84 seconds)\n", + "Cbc0010I After 22389000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1671.97 seconds)\n", + "Cbc0010I After 22390000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1672.07 seconds)\n", + "Cbc0010I After 22391000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1672.20 seconds)\n", + "Cbc0010I After 22392000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1672.30 seconds)\n", + "Cbc0010I After 22393000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1672.46 seconds)\n", + "Cbc0010I After 22394000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1672.60 seconds)\n", + "Cbc0010I After 22395000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1672.73 seconds)\n", + "Cbc0010I After 22396000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1672.87 seconds)\n", + "Cbc0010I After 22397000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1672.99 seconds)\n", + "Cbc0010I After 22398000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1673.14 seconds)\n", + "Cbc0010I After 22399000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1673.29 seconds)\n", + "Cbc0010I After 22400000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1673.41 seconds)\n", + "Cbc0010I After 22401000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1673.54 seconds)\n", + "Cbc0010I After 22402000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1673.65 seconds)\n", + "Cbc0010I After 22403000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1673.78 seconds)\n", + "Cbc0010I After 22404000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1673.92 seconds)\n", + "Cbc0010I After 22405000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1674.03 seconds)\n", + "Cbc0010I After 22406000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1674.15 seconds)\n", + "Cbc0010I After 22407000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1674.26 seconds)\n", + "Cbc0010I After 22408000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1674.40 seconds)\n", + "Cbc0010I After 22409000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1674.52 seconds)\n", + "Cbc0010I After 22410000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1674.65 seconds)\n", + "Cbc0010I After 22411000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1674.84 seconds)\n", + "Cbc0010I After 22412000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1674.96 seconds)\n", + "Cbc0010I After 22413000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1675.10 seconds)\n", + "Cbc0010I After 22414000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1675.22 seconds)\n", + "Cbc0010I After 22415000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1675.33 seconds)\n", + "Cbc0010I After 22416000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1675.46 seconds)\n", + "Cbc0010I After 22417000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1675.59 seconds)\n", + "Cbc0010I After 22418000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1675.72 seconds)\n", + "Cbc0010I After 22419000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1675.85 seconds)\n", + "Cbc0010I After 22420000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1675.99 seconds)\n", + "Cbc0010I After 22421000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1676.12 seconds)\n", + "Cbc0010I After 22422000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1676.23 seconds)\n", + "Cbc0010I After 22423000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1676.36 seconds)\n", + "Cbc0010I After 22424000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1676.45 seconds)\n", + "Cbc0010I After 22425000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1676.54 seconds)\n", + "Cbc0010I After 22426000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1676.62 seconds)\n", + "Cbc0010I After 22427000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1676.70 seconds)\n", + "Cbc0010I After 22428000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1676.80 seconds)\n", + "Cbc0010I After 22429000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1676.87 seconds)\n", + "Cbc0010I After 22430000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1676.95 seconds)\n", + "Cbc0010I After 22431000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1677.01 seconds)\n", + "Cbc0010I After 22432000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1677.08 seconds)\n", + "Cbc0010I After 22433000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1677.14 seconds)\n", + "Cbc0010I After 22434000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1677.21 seconds)\n", + "Cbc0010I After 22435000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1677.27 seconds)\n", + "Cbc0010I After 22436000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1677.33 seconds)\n", + "Cbc0010I After 22437000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1677.40 seconds)\n", + "Cbc0010I After 22438000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1677.46 seconds)\n", + "Cbc0010I After 22439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1677.52 seconds)\n", + "Cbc0010I After 22440000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1677.59 seconds)\n", + "Cbc0010I After 22441000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1677.66 seconds)\n", + "Cbc0010I After 22442000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1677.72 seconds)\n", + "Cbc0010I After 22443000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1677.78 seconds)\n", + "Cbc0010I After 22444000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1677.84 seconds)\n", + "Cbc0010I After 22445000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1677.89 seconds)\n", + "Cbc0010I After 22446000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1677.95 seconds)\n", + "Cbc0010I After 22447000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1678.01 seconds)\n", + "Cbc0010I After 22448000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1678.07 seconds)\n", + "Cbc0010I After 22449000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1678.15 seconds)\n", + "Cbc0010I After 22450000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1678.20 seconds)\n", + "Cbc0010I After 22451000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1678.28 seconds)\n", + "Cbc0010I After 22452000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1678.34 seconds)\n", + "Cbc0010I After 22453000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1678.40 seconds)\n", + "Cbc0010I After 22454000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1678.46 seconds)\n", + "Cbc0010I After 22455000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1678.53 seconds)\n", + "Cbc0010I After 22456000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1678.59 seconds)\n", + "Cbc0010I After 22457000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1678.65 seconds)\n", + "Cbc0010I After 22458000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1678.71 seconds)\n", + "Cbc0010I After 22459000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1678.77 seconds)\n", + "Cbc0010I After 22460000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1678.84 seconds)\n", + "Cbc0010I After 22461000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1678.90 seconds)\n", + "Cbc0010I After 22462000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1678.98 seconds)\n", + "Cbc0010I After 22463000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1679.05 seconds)\n", + "Cbc0010I After 22464000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1679.11 seconds)\n", + "Cbc0010I After 22465000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1679.19 seconds)\n", + "Cbc0010I After 22466000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1679.26 seconds)\n", + "Cbc0010I After 22467000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1679.33 seconds)\n", + "Cbc0010I After 22468000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1679.40 seconds)\n", + "Cbc0010I After 22469000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1679.46 seconds)\n", + "Cbc0010I After 22470000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1679.52 seconds)\n", + "Cbc0010I After 22471000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1679.58 seconds)\n", + "Cbc0010I After 22472000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1679.65 seconds)\n", + "Cbc0010I After 22473000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1679.70 seconds)\n", + "Cbc0010I After 22474000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1679.78 seconds)\n", + "Cbc0010I After 22475000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1679.85 seconds)\n", + "Cbc0010I After 22476000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1679.92 seconds)\n", + "Cbc0010I After 22477000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1679.98 seconds)\n", + "Cbc0010I After 22478000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1680.05 seconds)\n", + "Cbc0010I After 22479000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1680.12 seconds)\n", + "Cbc0010I After 22480000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1680.20 seconds)\n", + "Cbc0010I After 22481000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1680.27 seconds)\n", + "Cbc0010I After 22482000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1680.32 seconds)\n", + "Cbc0010I After 22483000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1680.38 seconds)\n", + "Cbc0010I After 22484000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1680.47 seconds)\n", + "Cbc0010I After 22485000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1680.55 seconds)\n", + "Cbc0010I After 22486000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1680.63 seconds)\n", + "Cbc0010I After 22487000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1680.70 seconds)\n", + "Cbc0010I After 22488000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (1680.77 seconds)\n", + "Cbc0010I After 22489000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1680.84 seconds)\n", + "Cbc0010I After 22490000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (1680.91 seconds)\n", + "Cbc0010I After 22491000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1680.97 seconds)\n", + "Cbc0010I After 22492000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1681.03 seconds)\n", + "Cbc0010I After 22493000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1681.10 seconds)\n", + "Cbc0010I After 22494000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1681.18 seconds)\n", + "Cbc0010I After 22495000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1681.26 seconds)\n", + "Cbc0010I After 22496000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1681.40 seconds)\n", + "Cbc0010I After 22497000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1681.52 seconds)\n", + "Cbc0010I After 22498000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1681.63 seconds)\n", + "Cbc0010I After 22499000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1681.76 seconds)\n", + "Cbc0010I After 22500000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1681.89 seconds)\n", + "Cbc0010I After 22501000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1682.05 seconds)\n", + "Cbc0010I After 22502000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1682.18 seconds)\n", + "Cbc0010I After 22503000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1682.35 seconds)\n", + "Cbc0010I After 22504000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1682.46 seconds)\n", + "Cbc0010I After 22505000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1682.60 seconds)\n", + "Cbc0010I After 22506000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1682.73 seconds)\n", + "Cbc0010I After 22507000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1682.85 seconds)\n", + "Cbc0010I After 22508000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1682.97 seconds)\n", + "Cbc0010I After 22509000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1683.14 seconds)\n", + "Cbc0010I After 22510000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1683.30 seconds)\n", + "Cbc0010I After 22511000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1683.43 seconds)\n", + "Cbc0010I After 22512000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1683.55 seconds)\n", + "Cbc0010I After 22513000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1683.68 seconds)\n", + "Cbc0010I After 22514000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1683.79 seconds)\n", + "Cbc0010I After 22515000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1683.92 seconds)\n", + "Cbc0010I After 22516000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1684.07 seconds)\n", + "Cbc0010I After 22517000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1684.22 seconds)\n", + "Cbc0010I After 22518000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1684.37 seconds)\n", + "Cbc0010I After 22519000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1684.50 seconds)\n", + "Cbc0010I After 22520000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1684.71 seconds)\n", + "Cbc0010I After 22521000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1684.85 seconds)\n", + "Cbc0010I After 22522000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1685.01 seconds)\n", + "Cbc0010I After 22523000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1685.11 seconds)\n", + "Cbc0010I After 22524000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1685.20 seconds)\n", + "Cbc0010I After 22525000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1685.29 seconds)\n", + "Cbc0010I After 22526000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1685.35 seconds)\n", + "Cbc0010I After 22527000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1685.43 seconds)\n", + "Cbc0010I After 22528000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1685.51 seconds)\n", + "Cbc0010I After 22529000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1685.61 seconds)\n", + "Cbc0010I After 22530000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1685.71 seconds)\n", + "Cbc0010I After 22531000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1685.80 seconds)\n", + "Cbc0010I After 22532000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1685.89 seconds)\n", + "Cbc0010I After 22533000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1686.00 seconds)\n", + "Cbc0010I After 22534000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1686.11 seconds)\n", + "Cbc0010I After 22535000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1686.24 seconds)\n", + "Cbc0010I After 22536000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1686.37 seconds)\n", + "Cbc0010I After 22537000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1686.51 seconds)\n", + "Cbc0010I After 22538000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1686.62 seconds)\n", + "Cbc0010I After 22539000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1686.74 seconds)\n", + "Cbc0010I After 22540000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1686.90 seconds)\n", + "Cbc0010I After 22541000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1687.03 seconds)\n", + "Cbc0010I After 22542000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1687.18 seconds)\n", + "Cbc0010I After 22543000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1687.42 seconds)\n", + "Cbc0010I After 22544000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1687.58 seconds)\n", + "Cbc0010I After 22545000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1687.74 seconds)\n", + "Cbc0010I After 22546000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1687.88 seconds)\n", + "Cbc0010I After 22547000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1688.02 seconds)\n", + "Cbc0010I After 22548000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1688.16 seconds)\n", + "Cbc0010I After 22549000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1688.29 seconds)\n", + "Cbc0010I After 22550000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1688.42 seconds)\n", + "Cbc0010I After 22551000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1688.53 seconds)\n", + "Cbc0010I After 22552000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1688.64 seconds)\n", + "Cbc0010I After 22553000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1688.75 seconds)\n", + "Cbc0010I After 22554000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1688.88 seconds)\n", + "Cbc0010I After 22555000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1689.01 seconds)\n", + "Cbc0010I After 22556000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1689.15 seconds)\n", + "Cbc0010I After 22557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1689.31 seconds)\n", + "Cbc0010I After 22558000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1689.55 seconds)\n", + "Cbc0010I After 22559000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1689.75 seconds)\n", + "Cbc0010I After 22560000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1689.96 seconds)\n", + "Cbc0010I After 22561000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1690.12 seconds)\n", + "Cbc0010I After 22562000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1690.27 seconds)\n", + "Cbc0010I After 22563000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1690.41 seconds)\n", + "Cbc0010I After 22564000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1690.53 seconds)\n", + "Cbc0010I After 22565000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1690.63 seconds)\n", + "Cbc0010I After 22566000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1690.75 seconds)\n", + "Cbc0010I After 22567000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1690.88 seconds)\n", + "Cbc0010I After 22568000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1691.02 seconds)\n", + "Cbc0010I After 22569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1691.15 seconds)\n", + "Cbc0010I After 22570000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1691.29 seconds)\n", + "Cbc0010I After 22571000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1691.42 seconds)\n", + "Cbc0010I After 22572000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1691.54 seconds)\n", + "Cbc0010I After 22573000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1691.68 seconds)\n", + "Cbc0010I After 22574000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1691.82 seconds)\n", + "Cbc0010I After 22575000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1691.97 seconds)\n", + "Cbc0010I After 22576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1692.16 seconds)\n", + "Cbc0010I After 22577000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1692.30 seconds)\n", + "Cbc0010I After 22578000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1692.41 seconds)\n", + "Cbc0010I After 22579000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1692.51 seconds)\n", + "Cbc0010I After 22580000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1692.60 seconds)\n", + "Cbc0010I After 22581000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1692.68 seconds)\n", + "Cbc0010I After 22582000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1692.76 seconds)\n", + "Cbc0010I After 22583000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1692.84 seconds)\n", + "Cbc0010I After 22584000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1692.91 seconds)\n", + "Cbc0010I After 22585000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1692.99 seconds)\n", + "Cbc0010I After 22586000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1693.06 seconds)\n", + "Cbc0010I After 22587000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1693.12 seconds)\n", + "Cbc0010I After 22588000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1693.19 seconds)\n", + "Cbc0010I After 22589000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1693.27 seconds)\n", + "Cbc0010I After 22590000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1693.34 seconds)\n", + "Cbc0010I After 22591000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1693.42 seconds)\n", + "Cbc0010I After 22592000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1693.50 seconds)\n", + "Cbc0010I After 22593000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1693.57 seconds)\n", + "Cbc0010I After 22594000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1693.63 seconds)\n", + "Cbc0010I After 22595000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1693.70 seconds)\n", + "Cbc0010I After 22596000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1693.77 seconds)\n", + "Cbc0010I After 22597000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1693.84 seconds)\n", + "Cbc0010I After 22598000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1693.92 seconds)\n", + "Cbc0010I After 22599000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1693.99 seconds)\n", + "Cbc0010I After 22600000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1694.08 seconds)\n", + "Cbc0010I After 22601000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1694.16 seconds)\n", + "Cbc0010I After 22602000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1694.22 seconds)\n", + "Cbc0010I After 22603000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1694.29 seconds)\n", + "Cbc0010I After 22604000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1694.35 seconds)\n", + "Cbc0010I After 22605000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1694.41 seconds)\n", + "Cbc0010I After 22606000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1694.47 seconds)\n", + "Cbc0010I After 22607000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1694.53 seconds)\n", + "Cbc0010I After 22608000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1694.59 seconds)\n", + "Cbc0010I After 22609000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1694.67 seconds)\n", + "Cbc0010I After 22610000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1694.74 seconds)\n", + "Cbc0010I After 22611000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1694.81 seconds)\n", + "Cbc0010I After 22612000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1694.89 seconds)\n", + "Cbc0010I After 22613000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1694.96 seconds)\n", + "Cbc0010I After 22614000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1695.04 seconds)\n", + "Cbc0010I After 22615000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1695.11 seconds)\n", + "Cbc0010I After 22616000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1695.19 seconds)\n", + "Cbc0010I After 22617000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1695.28 seconds)\n", + "Cbc0010I After 22618000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1695.36 seconds)\n", + "Cbc0010I After 22619000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1695.44 seconds)\n", + "Cbc0010I After 22620000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1695.51 seconds)\n", + "Cbc0010I After 22621000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1695.58 seconds)\n", + "Cbc0010I After 22622000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1695.65 seconds)\n", + "Cbc0010I After 22623000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1695.74 seconds)\n", + "Cbc0010I After 22624000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1695.84 seconds)\n", + "Cbc0010I After 22625000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1695.94 seconds)\n", + "Cbc0010I After 22626000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1696.06 seconds)\n", + "Cbc0010I After 22627000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1696.20 seconds)\n", + "Cbc0010I After 22628000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1696.34 seconds)\n", + "Cbc0010I After 22629000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1696.47 seconds)\n", + "Cbc0010I After 22630000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1696.63 seconds)\n", + "Cbc0010I After 22631000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1696.83 seconds)\n", + "Cbc0010I After 22632000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1697.11 seconds)\n", + "Cbc0010I After 22633000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1697.26 seconds)\n", + "Cbc0010I After 22634000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1697.43 seconds)\n", + "Cbc0010I After 22635000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1697.59 seconds)\n", + "Cbc0010I After 22636000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1697.74 seconds)\n", + "Cbc0010I After 22637000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1697.91 seconds)\n", + "Cbc0010I After 22638000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1698.07 seconds)\n", + "Cbc0010I After 22639000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1698.23 seconds)\n", + "Cbc0010I After 22640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1698.35 seconds)\n", + "Cbc0010I After 22641000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1698.45 seconds)\n", + "Cbc0010I After 22642000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1698.57 seconds)\n", + "Cbc0010I After 22643000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1698.75 seconds)\n", + "Cbc0010I After 22644000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1698.92 seconds)\n", + "Cbc0010I After 22645000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1699.08 seconds)\n", + "Cbc0010I After 22646000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1699.23 seconds)\n", + "Cbc0010I After 22647000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1699.36 seconds)\n", + "Cbc0010I After 22648000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1699.48 seconds)\n", + "Cbc0010I After 22649000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1699.61 seconds)\n", + "Cbc0010I After 22650000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1699.73 seconds)\n", + "Cbc0010I After 22651000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1699.82 seconds)\n", + "Cbc0010I After 22652000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1699.91 seconds)\n", + "Cbc0010I After 22653000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1700.01 seconds)\n", + "Cbc0010I After 22654000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1700.09 seconds)\n", + "Cbc0010I After 22655000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1700.18 seconds)\n", + "Cbc0010I After 22656000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1700.27 seconds)\n", + "Cbc0010I After 22657000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1700.37 seconds)\n", + "Cbc0010I After 22658000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1700.48 seconds)\n", + "Cbc0010I After 22659000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1700.61 seconds)\n", + "Cbc0010I After 22660000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1700.73 seconds)\n", + "Cbc0010I After 22661000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1700.85 seconds)\n", + "Cbc0010I After 22662000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1700.95 seconds)\n", + "Cbc0010I After 22663000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1701.06 seconds)\n", + "Cbc0010I After 22664000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1701.13 seconds)\n", + "Cbc0010I After 22665000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1701.21 seconds)\n", + "Cbc0010I After 22666000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1701.28 seconds)\n", + "Cbc0010I After 22667000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1701.35 seconds)\n", + "Cbc0010I After 22668000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1701.42 seconds)\n", + "Cbc0010I After 22669000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1701.49 seconds)\n", + "Cbc0010I After 22670000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1701.58 seconds)\n", + "Cbc0010I After 22671000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1701.66 seconds)\n", + "Cbc0010I After 22672000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1701.73 seconds)\n", + "Cbc0010I After 22673000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1701.79 seconds)\n", + "Cbc0010I After 22674000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1701.85 seconds)\n", + "Cbc0010I After 22675000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1701.91 seconds)\n", + "Cbc0010I After 22676000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1701.97 seconds)\n", + "Cbc0010I After 22677000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1702.04 seconds)\n", + "Cbc0010I After 22678000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1702.10 seconds)\n", + "Cbc0010I After 22679000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1702.16 seconds)\n", + "Cbc0010I After 22680000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1702.22 seconds)\n", + "Cbc0010I After 22681000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1702.27 seconds)\n", + "Cbc0010I After 22682000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1702.34 seconds)\n", + "Cbc0010I After 22683000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1702.41 seconds)\n", + "Cbc0010I After 22684000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1702.47 seconds)\n", + "Cbc0010I After 22685000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1702.53 seconds)\n", + "Cbc0010I After 22686000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1702.59 seconds)\n", + "Cbc0010I After 22687000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1702.65 seconds)\n", + "Cbc0010I After 22688000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1702.70 seconds)\n", + "Cbc0010I After 22689000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1702.77 seconds)\n", + "Cbc0010I After 22690000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1702.83 seconds)\n", + "Cbc0010I After 22691000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1702.89 seconds)\n", + "Cbc0010I After 22692000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1702.95 seconds)\n", + "Cbc0010I After 22693000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1703.01 seconds)\n", + "Cbc0010I After 22694000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1703.07 seconds)\n", + "Cbc0010I After 22695000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1703.15 seconds)\n", + "Cbc0010I After 22696000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1703.22 seconds)\n", + "Cbc0010I After 22697000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1703.30 seconds)\n", + "Cbc0010I After 22698000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1703.38 seconds)\n", + "Cbc0010I After 22699000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1703.48 seconds)\n", + "Cbc0010I After 22700000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1703.59 seconds)\n", + "Cbc0010I After 22701000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1703.72 seconds)\n", + "Cbc0010I After 22702000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1703.84 seconds)\n", + "Cbc0010I After 22703000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1703.95 seconds)\n", + "Cbc0010I After 22704000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1704.14 seconds)\n", + "Cbc0010I After 22705000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1704.28 seconds)\n", + "Cbc0010I After 22706000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1704.42 seconds)\n", + "Cbc0010I After 22707000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1704.54 seconds)\n", + "Cbc0010I After 22708000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1704.63 seconds)\n", + "Cbc0010I After 22709000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1704.74 seconds)\n", + "Cbc0010I After 22710000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1704.84 seconds)\n", + "Cbc0010I After 22711000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1704.95 seconds)\n", + "Cbc0010I After 22712000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1705.06 seconds)\n", + "Cbc0010I After 22713000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1705.20 seconds)\n", + "Cbc0010I After 22714000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1705.33 seconds)\n", + "Cbc0010I After 22715000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1705.46 seconds)\n", + "Cbc0010I After 22716000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1705.56 seconds)\n", + "Cbc0010I After 22717000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1705.67 seconds)\n", + "Cbc0010I After 22718000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1705.83 seconds)\n", + "Cbc0010I After 22719000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1705.97 seconds)\n", + "Cbc0010I After 22720000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1706.11 seconds)\n", + "Cbc0010I After 22721000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1706.25 seconds)\n", + "Cbc0010I After 22722000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1706.37 seconds)\n", + "Cbc0010I After 22723000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1706.53 seconds)\n", + "Cbc0010I After 22724000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (1706.61 seconds)\n", + "Cbc0010I After 22725000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1706.68 seconds)\n", + "Cbc0010I After 22726000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (1706.77 seconds)\n", + "Cbc0010I After 22727000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1706.85 seconds)\n", + "Cbc0010I After 22728000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1706.95 seconds)\n", + "Cbc0010I After 22729000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1707.06 seconds)\n", + "Cbc0010I After 22730000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (1707.16 seconds)\n", + "Cbc0010I After 22731000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1707.25 seconds)\n", + "Cbc0010I After 22732000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1707.34 seconds)\n", + "Cbc0010I After 22733000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (1707.44 seconds)\n", + "Cbc0010I After 22734000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (1707.56 seconds)\n", + "Cbc0010I After 22735000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1707.65 seconds)\n", + "Cbc0010I After 22736000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1707.72 seconds)\n", + "Cbc0010I After 22737000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1707.79 seconds)\n", + "Cbc0010I After 22738000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1707.86 seconds)\n", + "Cbc0010I After 22739000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1707.94 seconds)\n", + "Cbc0010I After 22740000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1708.04 seconds)\n", + "Cbc0010I After 22741000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1708.13 seconds)\n", + "Cbc0010I After 22742000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1708.23 seconds)\n", + "Cbc0010I After 22743000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1708.35 seconds)\n", + "Cbc0010I After 22744000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1708.45 seconds)\n", + "Cbc0010I After 22745000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1708.54 seconds)\n", + "Cbc0010I After 22746000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1708.64 seconds)\n", + "Cbc0010I After 22747000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1708.75 seconds)\n", + "Cbc0010I After 22748000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1708.87 seconds)\n", + "Cbc0010I After 22749000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1708.97 seconds)\n", + "Cbc0010I After 22750000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (1709.06 seconds)\n", + "Cbc0010I After 22751000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1709.13 seconds)\n", + "Cbc0010I After 22752000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1709.20 seconds)\n", + "Cbc0010I After 22753000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.26 seconds)\n", + "Cbc0010I After 22754000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.33 seconds)\n", + "Cbc0010I After 22755000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1709.39 seconds)\n", + "Cbc0010I After 22756000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1709.46 seconds)\n", + "Cbc0010I After 22757000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.52 seconds)\n", + "Cbc0010I After 22758000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1709.60 seconds)\n", + "Cbc0010I After 22759000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1709.68 seconds)\n", + "Cbc0010I After 22760000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1709.76 seconds)\n", + "Cbc0010I After 22761000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1709.83 seconds)\n", + "Cbc0010I After 22762000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.90 seconds)\n", + "Cbc0010I After 22763000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1709.98 seconds)\n", + "Cbc0010I After 22764000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1710.06 seconds)\n", + "Cbc0010I After 22765000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1710.13 seconds)\n", + "Cbc0010I After 22766000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1710.21 seconds)\n", + "Cbc0010I After 22767000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1710.28 seconds)\n", + "Cbc0010I After 22768000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1710.35 seconds)\n", + "Cbc0010I After 22769000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1710.42 seconds)\n", + "Cbc0010I After 22770000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1710.49 seconds)\n", + "Cbc0010I After 22771000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1710.57 seconds)\n", + "Cbc0010I After 22772000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1710.64 seconds)\n", + "Cbc0010I After 22773000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1710.70 seconds)\n", + "Cbc0010I After 22774000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1710.78 seconds)\n", + "Cbc0010I After 22775000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1710.85 seconds)\n", + "Cbc0010I After 22776000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1710.93 seconds)\n", + "Cbc0010I After 22777000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1711.00 seconds)\n", + "Cbc0010I After 22778000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1711.07 seconds)\n", + "Cbc0010I After 22779000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1711.15 seconds)\n", + "Cbc0010I After 22780000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1711.25 seconds)\n", + "Cbc0010I After 22781000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1711.35 seconds)\n", + "Cbc0010I After 22782000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1711.54 seconds)\n", + "Cbc0010I After 22783000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1711.68 seconds)\n", + "Cbc0010I After 22784000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1711.81 seconds)\n", + "Cbc0010I After 22785000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1711.98 seconds)\n", + "Cbc0010I After 22786000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1712.11 seconds)\n", + "Cbc0010I After 22787000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1712.25 seconds)\n", + "Cbc0010I After 22788000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1712.38 seconds)\n", + "Cbc0010I After 22789000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1712.49 seconds)\n", + "Cbc0010I After 22790000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1712.61 seconds)\n", + "Cbc0010I After 22791000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1712.71 seconds)\n", + "Cbc0010I After 22792000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1712.85 seconds)\n", + "Cbc0010I After 22793000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1712.99 seconds)\n", + "Cbc0010I After 22794000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1713.13 seconds)\n", + "Cbc0010I After 22795000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1713.25 seconds)\n", + "Cbc0010I After 22796000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1713.38 seconds)\n", + "Cbc0010I After 22797000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1713.50 seconds)\n", + "Cbc0010I After 22798000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1713.66 seconds)\n", + "Cbc0010I After 22799000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1713.78 seconds)\n", + "Cbc0010I After 22800000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1713.89 seconds)\n", + "Cbc0010I After 22801000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1714.04 seconds)\n", + "Cbc0010I After 22802000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1714.18 seconds)\n", + "Cbc0010I After 22803000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1714.30 seconds)\n", + "Cbc0010I After 22804000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1714.42 seconds)\n", + "Cbc0010I After 22805000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1714.52 seconds)\n", + "Cbc0010I After 22806000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1714.61 seconds)\n", + "Cbc0010I After 22807000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1714.73 seconds)\n", + "Cbc0010I After 22808000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1714.83 seconds)\n", + "Cbc0010I After 22809000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1714.93 seconds)\n", + "Cbc0010I After 22810000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1715.03 seconds)\n", + "Cbc0010I After 22811000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1715.13 seconds)\n", + "Cbc0010I After 22812000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1715.23 seconds)\n", + "Cbc0010I After 22813000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1715.34 seconds)\n", + "Cbc0010I After 22814000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1715.43 seconds)\n", + "Cbc0010I After 22815000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1715.51 seconds)\n", + "Cbc0010I After 22816000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1715.59 seconds)\n", + "Cbc0010I After 22817000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1715.67 seconds)\n", + "Cbc0010I After 22818000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1715.76 seconds)\n", + "Cbc0010I After 22819000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1715.84 seconds)\n", + "Cbc0010I After 22820000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1715.91 seconds)\n", + "Cbc0010I After 22821000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1715.98 seconds)\n", + "Cbc0010I After 22822000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1716.04 seconds)\n", + "Cbc0010I After 22823000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1716.10 seconds)\n", + "Cbc0010I After 22824000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1716.18 seconds)\n", + "Cbc0010I After 22825000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1716.30 seconds)\n", + "Cbc0010I After 22826000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1716.40 seconds)\n", + "Cbc0010I After 22827000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1716.54 seconds)\n", + "Cbc0010I After 22828000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1716.80 seconds)\n", + "Cbc0010I After 22829000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1716.95 seconds)\n", + "Cbc0010I After 22830000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1717.08 seconds)\n", + "Cbc0010I After 22831000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1717.23 seconds)\n", + "Cbc0010I After 22832000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1717.36 seconds)\n", + "Cbc0010I After 22833000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1717.51 seconds)\n", + "Cbc0010I After 22834000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1717.63 seconds)\n", + "Cbc0010I After 22835000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1717.76 seconds)\n", + "Cbc0010I After 22836000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1717.89 seconds)\n", + "Cbc0010I After 22837000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1718.03 seconds)\n", + "Cbc0010I After 22838000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1718.16 seconds)\n", + "Cbc0010I After 22839000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1718.27 seconds)\n", + "Cbc0010I After 22840000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1718.42 seconds)\n", + "Cbc0010I After 22841000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1718.55 seconds)\n", + "Cbc0010I After 22842000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1718.69 seconds)\n", + "Cbc0010I After 22843000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1718.81 seconds)\n", + "Cbc0010I After 22844000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1718.92 seconds)\n", + "Cbc0010I After 22845000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1719.02 seconds)\n", + "Cbc0010I After 22846000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1719.13 seconds)\n", + "Cbc0010I After 22847000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1719.24 seconds)\n", + "Cbc0010I After 22848000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1719.34 seconds)\n", + "Cbc0010I After 22849000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1719.45 seconds)\n", + "Cbc0010I After 22850000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1719.62 seconds)\n", + "Cbc0010I After 22851000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1719.75 seconds)\n", + "Cbc0010I After 22852000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1719.88 seconds)\n", + "Cbc0010I After 22853000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1720.01 seconds)\n", + "Cbc0010I After 22854000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1720.16 seconds)\n", + "Cbc0010I After 22855000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1720.28 seconds)\n", + "Cbc0010I After 22856000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1720.39 seconds)\n", + "Cbc0010I After 22857000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1720.49 seconds)\n", + "Cbc0010I After 22858000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1720.59 seconds)\n", + "Cbc0010I After 22859000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1720.69 seconds)\n", + "Cbc0010I After 22860000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1720.79 seconds)\n", + "Cbc0010I After 22861000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1720.90 seconds)\n", + "Cbc0010I After 22862000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1720.99 seconds)\n", + "Cbc0010I After 22863000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1721.09 seconds)\n", + "Cbc0010I After 22864000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1721.21 seconds)\n", + "Cbc0010I After 22865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1721.43 seconds)\n", + "Cbc0010I After 22866000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1721.55 seconds)\n", + "Cbc0010I After 22867000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1721.66 seconds)\n", + "Cbc0010I After 22868000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1721.74 seconds)\n", + "Cbc0010I After 22869000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1721.83 seconds)\n", + "Cbc0010I After 22870000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1721.91 seconds)\n", + "Cbc0010I After 22871000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1722.01 seconds)\n", + "Cbc0010I After 22872000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1722.12 seconds)\n", + "Cbc0010I After 22873000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1722.23 seconds)\n", + "Cbc0010I After 22874000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1722.32 seconds)\n", + "Cbc0010I After 22875000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1722.40 seconds)\n", + "Cbc0010I After 22876000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1722.47 seconds)\n", + "Cbc0010I After 22877000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1722.54 seconds)\n", + "Cbc0010I After 22878000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1722.60 seconds)\n", + "Cbc0010I After 22879000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1722.67 seconds)\n", + "Cbc0010I After 22880000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1722.74 seconds)\n", + "Cbc0010I After 22881000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1722.81 seconds)\n", + "Cbc0010I After 22882000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1722.89 seconds)\n", + "Cbc0010I After 22883000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1722.99 seconds)\n", + "Cbc0010I After 22884000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1723.12 seconds)\n", + "Cbc0010I After 22885000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1723.25 seconds)\n", + "Cbc0010I After 22886000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1723.41 seconds)\n", + "Cbc0010I After 22887000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1723.59 seconds)\n", + "Cbc0010I After 22888000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1723.71 seconds)\n", + "Cbc0010I After 22889000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1723.82 seconds)\n", + "Cbc0010I After 22890000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1723.91 seconds)\n", + "Cbc0010I After 22891000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1724.06 seconds)\n", + "Cbc0010I After 22892000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1724.18 seconds)\n", + "Cbc0010I After 22893000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1724.29 seconds)\n", + "Cbc0010I After 22894000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1724.42 seconds)\n", + "Cbc0010I After 22895000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1724.52 seconds)\n", + "Cbc0010I After 22896000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1724.63 seconds)\n", + "Cbc0010I After 22897000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1724.73 seconds)\n", + "Cbc0010I After 22898000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1724.81 seconds)\n", + "Cbc0010I After 22899000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1724.90 seconds)\n", + "Cbc0010I After 22900000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1724.97 seconds)\n", + "Cbc0010I After 22901000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1725.05 seconds)\n", + "Cbc0010I After 22902000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1725.14 seconds)\n", + "Cbc0010I After 22903000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1725.24 seconds)\n", + "Cbc0010I After 22904000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1725.34 seconds)\n", + "Cbc0010I After 22905000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1725.43 seconds)\n", + "Cbc0010I After 22906000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1725.53 seconds)\n", + "Cbc0010I After 22907000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1725.65 seconds)\n", + "Cbc0010I After 22908000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1725.74 seconds)\n", + "Cbc0010I After 22909000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1725.82 seconds)\n", + "Cbc0010I After 22910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1725.93 seconds)\n", + "Cbc0010I After 22911000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1726.04 seconds)\n", + "Cbc0010I After 22912000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1726.12 seconds)\n", + "Cbc0010I After 22913000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1726.22 seconds)\n", + "Cbc0010I After 22914000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1726.30 seconds)\n", + "Cbc0010I After 22915000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1726.38 seconds)\n", + "Cbc0010I After 22916000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1726.46 seconds)\n", + "Cbc0010I After 22917000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1726.54 seconds)\n", + "Cbc0010I After 22918000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1726.62 seconds)\n", + "Cbc0010I After 22919000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1726.70 seconds)\n", + "Cbc0010I After 22920000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1726.76 seconds)\n", + "Cbc0010I After 22921000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1726.82 seconds)\n", + "Cbc0010I After 22922000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1726.90 seconds)\n", + "Cbc0010I After 22923000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1726.97 seconds)\n", + "Cbc0010I After 22924000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1727.04 seconds)\n", + "Cbc0010I After 22925000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1727.13 seconds)\n", + "Cbc0010I After 22926000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1727.20 seconds)\n", + "Cbc0010I After 22927000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1727.26 seconds)\n", + "Cbc0010I After 22928000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1727.32 seconds)\n", + "Cbc0010I After 22929000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1727.38 seconds)\n", + "Cbc0010I After 22930000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1727.44 seconds)\n", + "Cbc0010I After 22931000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1727.50 seconds)\n", + "Cbc0010I After 22932000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1727.59 seconds)\n", + "Cbc0010I After 22933000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1727.66 seconds)\n", + "Cbc0010I After 22934000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1727.72 seconds)\n", + "Cbc0010I After 22935000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1727.78 seconds)\n", + "Cbc0010I After 22936000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1727.85 seconds)\n", + "Cbc0010I After 22937000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1727.91 seconds)\n", + "Cbc0010I After 22938000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1727.97 seconds)\n", + "Cbc0010I After 22939000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1728.02 seconds)\n", + "Cbc0010I After 22940000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1728.08 seconds)\n", + "Cbc0010I After 22941000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1728.14 seconds)\n", + "Cbc0010I After 22942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1728.20 seconds)\n", + "Cbc0010I After 22943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1728.26 seconds)\n", + "Cbc0010I After 22944000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1728.32 seconds)\n", + "Cbc0010I After 22945000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1728.39 seconds)\n", + "Cbc0010I After 22946000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1728.46 seconds)\n", + "Cbc0010I After 22947000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1728.54 seconds)\n", + "Cbc0010I After 22948000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1728.64 seconds)\n", + "Cbc0010I After 22949000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (1728.74 seconds)\n", + "Cbc0010I After 22950000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (1728.85 seconds)\n", + "Cbc0010I After 22951000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (1728.96 seconds)\n", + "Cbc0010I After 22952000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1729.06 seconds)\n", + "Cbc0010I After 22953000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1729.18 seconds)\n", + "Cbc0010I After 22954000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (1729.29 seconds)\n", + "Cbc0010I After 22955000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1729.46 seconds)\n", + "Cbc0010I After 22956000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1729.60 seconds)\n", + "Cbc0010I After 22957000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1729.71 seconds)\n", + "Cbc0010I After 22958000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1729.81 seconds)\n", + "Cbc0010I After 22959000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1729.89 seconds)\n", + "Cbc0010I After 22960000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1729.98 seconds)\n", + "Cbc0010I After 22961000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1730.05 seconds)\n", + "Cbc0010I After 22962000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1730.11 seconds)\n", + "Cbc0010I After 22963000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1730.17 seconds)\n", + "Cbc0010I After 22964000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1730.23 seconds)\n", + "Cbc0010I After 22965000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1730.29 seconds)\n", + "Cbc0010I After 22966000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1730.37 seconds)\n", + "Cbc0010I After 22967000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1730.44 seconds)\n", + "Cbc0010I After 22968000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1730.51 seconds)\n", + "Cbc0010I After 22969000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1730.57 seconds)\n", + "Cbc0010I After 22970000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1730.63 seconds)\n", + "Cbc0010I After 22971000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1730.70 seconds)\n", + "Cbc0010I After 22972000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1730.77 seconds)\n", + "Cbc0010I After 22973000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1730.83 seconds)\n", + "Cbc0010I After 22974000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1730.91 seconds)\n", + "Cbc0010I After 22975000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1730.99 seconds)\n", + "Cbc0010I After 22976000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1731.05 seconds)\n", + "Cbc0010I After 22977000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1731.12 seconds)\n", + "Cbc0010I After 22978000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1731.22 seconds)\n", + "Cbc0010I After 22979000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1731.29 seconds)\n", + "Cbc0010I After 22980000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1731.35 seconds)\n", + "Cbc0010I After 22981000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1731.44 seconds)\n", + "Cbc0010I After 22982000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1731.54 seconds)\n", + "Cbc0010I After 22983000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1731.65 seconds)\n", + "Cbc0010I After 22984000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1731.74 seconds)\n", + "Cbc0010I After 22985000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1731.86 seconds)\n", + "Cbc0010I After 22986000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1732.00 seconds)\n", + "Cbc0010I After 22987000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1732.14 seconds)\n", + "Cbc0010I After 22988000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1732.29 seconds)\n", + "Cbc0010I After 22989000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1732.45 seconds)\n", + "Cbc0010I After 22990000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1732.71 seconds)\n", + "Cbc0010I After 22991000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1732.93 seconds)\n", + "Cbc0010I After 22992000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1733.07 seconds)\n", + "Cbc0010I After 22993000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1733.21 seconds)\n", + "Cbc0010I After 22994000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1733.34 seconds)\n", + "Cbc0010I After 22995000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1733.46 seconds)\n", + "Cbc0010I After 22996000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1733.59 seconds)\n", + "Cbc0010I After 22997000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1733.69 seconds)\n", + "Cbc0010I After 22998000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1733.76 seconds)\n", + "Cbc0010I After 22999000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1733.85 seconds)\n", + "Cbc0010I After 23000000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1733.93 seconds)\n", + "Cbc0010I After 23001000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.01 seconds)\n", + "Cbc0010I After 23002000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1734.09 seconds)\n", + "Cbc0010I After 23003000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1734.16 seconds)\n", + "Cbc0010I After 23004000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.23 seconds)\n", + "Cbc0010I After 23005000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1734.32 seconds)\n", + "Cbc0010I After 23006000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1734.39 seconds)\n", + "Cbc0010I After 23007000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1734.46 seconds)\n", + "Cbc0010I After 23008000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1734.53 seconds)\n", + "Cbc0010I After 23009000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1734.60 seconds)\n", + "Cbc0010I After 23010000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1734.66 seconds)\n", + "Cbc0010I After 23011000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1734.73 seconds)\n", + "Cbc0010I After 23012000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.80 seconds)\n", + "Cbc0010I After 23013000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1734.86 seconds)\n", + "Cbc0010I After 23014000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1734.95 seconds)\n", + "Cbc0010I After 23015000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1735.04 seconds)\n", + "Cbc0010I After 23016000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1735.12 seconds)\n", + "Cbc0010I After 23017000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1735.22 seconds)\n", + "Cbc0010I After 23018000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1735.32 seconds)\n", + "Cbc0010I After 23019000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1735.46 seconds)\n", + "Cbc0010I After 23020000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1735.60 seconds)\n", + "Cbc0010I After 23021000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1735.74 seconds)\n", + "Cbc0010I After 23022000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1735.87 seconds)\n", + "Cbc0010I After 23023000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1736.00 seconds)\n", + "Cbc0010I After 23024000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1736.13 seconds)\n", + "Cbc0010I After 23025000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1736.23 seconds)\n", + "Cbc0010I After 23026000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1736.35 seconds)\n", + "Cbc0010I After 23027000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1736.48 seconds)\n", + "Cbc0010I After 23028000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1736.63 seconds)\n", + "Cbc0010I After 23029000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1736.76 seconds)\n", + "Cbc0010I After 23030000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1736.89 seconds)\n", + "Cbc0010I After 23031000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1737.02 seconds)\n", + "Cbc0010I After 23032000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1737.17 seconds)\n", + "Cbc0010I After 23033000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1737.33 seconds)\n", + "Cbc0010I After 23034000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1737.43 seconds)\n", + "Cbc0010I After 23035000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1737.53 seconds)\n", + "Cbc0010I After 23036000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1737.63 seconds)\n", + "Cbc0010I After 23037000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1737.73 seconds)\n", + "Cbc0010I After 23038000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1737.85 seconds)\n", + "Cbc0010I After 23039000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1737.95 seconds)\n", + "Cbc0010I After 23040000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1738.03 seconds)\n", + "Cbc0010I After 23041000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1738.18 seconds)\n", + "Cbc0010I After 23042000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1738.36 seconds)\n", + "Cbc0010I After 23043000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1738.49 seconds)\n", + "Cbc0010I After 23044000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1738.61 seconds)\n", + "Cbc0010I After 23045000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1738.74 seconds)\n", + "Cbc0010I After 23046000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1738.86 seconds)\n", + "Cbc0010I After 23047000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1738.98 seconds)\n", + "Cbc0010I After 23048000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1739.09 seconds)\n", + "Cbc0010I After 23049000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1739.21 seconds)\n", + "Cbc0010I After 23050000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1739.31 seconds)\n", + "Cbc0010I After 23051000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1739.41 seconds)\n", + "Cbc0010I After 23052000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1739.53 seconds)\n", + "Cbc0010I After 23053000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1739.66 seconds)\n", + "Cbc0010I After 23054000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1739.78 seconds)\n", + "Cbc0010I After 23055000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1739.91 seconds)\n", + "Cbc0010I After 23056000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1740.03 seconds)\n", + "Cbc0010I After 23057000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1740.15 seconds)\n", + "Cbc0010I After 23058000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1740.24 seconds)\n", + "Cbc0010I After 23059000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1740.33 seconds)\n", + "Cbc0010I After 23060000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1740.42 seconds)\n", + "Cbc0010I After 23061000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1740.49 seconds)\n", + "Cbc0010I After 23062000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1740.56 seconds)\n", + "Cbc0010I After 23063000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1740.65 seconds)\n", + "Cbc0010I After 23064000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1740.74 seconds)\n", + "Cbc0010I After 23065000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1740.82 seconds)\n", + "Cbc0010I After 23066000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1740.92 seconds)\n", + "Cbc0010I After 23067000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1741.03 seconds)\n", + "Cbc0010I After 23068000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1741.18 seconds)\n", + "Cbc0010I After 23069000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1741.32 seconds)\n", + "Cbc0010I After 23070000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1741.47 seconds)\n", + "Cbc0010I After 23071000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1741.63 seconds)\n", + "Cbc0010I After 23072000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1741.79 seconds)\n", + "Cbc0010I After 23073000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1741.97 seconds)\n", + "Cbc0010I After 23074000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1742.13 seconds)\n", + "Cbc0010I After 23075000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1742.34 seconds)\n", + "Cbc0010I After 23076000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1742.56 seconds)\n", + "Cbc0010I After 23077000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1742.76 seconds)\n", + "Cbc0010I After 23078000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1742.97 seconds)\n", + "Cbc0010I After 23079000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1743.14 seconds)\n", + "Cbc0010I After 23080000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1743.30 seconds)\n", + "Cbc0010I After 23081000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1743.41 seconds)\n", + "Cbc0010I After 23082000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1743.51 seconds)\n", + "Cbc0010I After 23083000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1743.63 seconds)\n", + "Cbc0010I After 23084000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1743.73 seconds)\n", + "Cbc0010I After 23085000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1743.82 seconds)\n", + "Cbc0010I After 23086000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1743.90 seconds)\n", + "Cbc0010I After 23087000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1743.97 seconds)\n", + "Cbc0010I After 23088000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1744.05 seconds)\n", + "Cbc0010I After 23089000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1744.12 seconds)\n", + "Cbc0010I After 23090000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1744.20 seconds)\n", + "Cbc0010I After 23091000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1744.29 seconds)\n", + "Cbc0010I After 23092000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1744.38 seconds)\n", + "Cbc0010I After 23093000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1744.49 seconds)\n", + "Cbc0010I After 23094000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1744.60 seconds)\n", + "Cbc0010I After 23095000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1744.70 seconds)\n", + "Cbc0010I After 23096000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1744.80 seconds)\n", + "Cbc0010I After 23097000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1744.87 seconds)\n", + "Cbc0010I After 23098000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1744.94 seconds)\n", + "Cbc0010I After 23099000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1745.00 seconds)\n", + "Cbc0010I After 23100000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1745.08 seconds)\n", + "Cbc0010I After 23101000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1745.15 seconds)\n", + "Cbc0010I After 23102000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1745.26 seconds)\n", + "Cbc0010I After 23103000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1745.35 seconds)\n", + "Cbc0010I After 23104000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1745.43 seconds)\n", + "Cbc0010I After 23105000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1745.52 seconds)\n", + "Cbc0010I After 23106000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1745.60 seconds)\n", + "Cbc0010I After 23107000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1745.67 seconds)\n", + "Cbc0010I After 23108000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1745.75 seconds)\n", + "Cbc0010I After 23109000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1745.82 seconds)\n", + "Cbc0010I After 23110000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1745.89 seconds)\n", + "Cbc0010I After 23111000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1745.98 seconds)\n", + "Cbc0010I After 23112000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1746.08 seconds)\n", + "Cbc0010I After 23113000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1746.16 seconds)\n", + "Cbc0010I After 23114000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1746.28 seconds)\n", + "Cbc0010I After 23115000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1746.42 seconds)\n", + "Cbc0010I After 23116000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1746.54 seconds)\n", + "Cbc0010I After 23117000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1746.65 seconds)\n", + "Cbc0010I After 23118000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1746.75 seconds)\n", + "Cbc0010I After 23119000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1746.88 seconds)\n", + "Cbc0010I After 23120000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1746.97 seconds)\n", + "Cbc0010I After 23121000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1747.06 seconds)\n", + "Cbc0010I After 23122000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1747.17 seconds)\n", + "Cbc0010I After 23123000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1747.30 seconds)\n", + "Cbc0010I After 23124000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1747.43 seconds)\n", + "Cbc0010I After 23125000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1747.55 seconds)\n", + "Cbc0010I After 23126000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1747.68 seconds)\n", + "Cbc0010I After 23127000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1747.79 seconds)\n", + "Cbc0010I After 23128000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1747.88 seconds)\n", + "Cbc0010I After 23129000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1747.97 seconds)\n", + "Cbc0010I After 23130000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1748.05 seconds)\n", + "Cbc0010I After 23131000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1748.13 seconds)\n", + "Cbc0010I After 23132000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1748.20 seconds)\n", + "Cbc0010I After 23133000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1748.28 seconds)\n", + "Cbc0010I After 23134000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1748.38 seconds)\n", + "Cbc0010I After 23135000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1748.49 seconds)\n", + "Cbc0010I After 23136000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1748.58 seconds)\n", + "Cbc0010I After 23137000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1748.67 seconds)\n", + "Cbc0010I After 23138000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1748.79 seconds)\n", + "Cbc0010I After 23139000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1748.93 seconds)\n", + "Cbc0010I After 23140000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1749.06 seconds)\n", + "Cbc0010I After 23141000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1749.19 seconds)\n", + "Cbc0010I After 23142000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1749.30 seconds)\n", + "Cbc0010I After 23143000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1749.40 seconds)\n", + "Cbc0010I After 23144000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1749.50 seconds)\n", + "Cbc0010I After 23145000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1749.58 seconds)\n", + "Cbc0010I After 23146000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1749.68 seconds)\n", + "Cbc0010I After 23147000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1749.78 seconds)\n", + "Cbc0010I After 23148000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1749.88 seconds)\n", + "Cbc0010I After 23149000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1749.98 seconds)\n", + "Cbc0010I After 23150000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1750.06 seconds)\n", + "Cbc0010I After 23151000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1750.15 seconds)\n", + "Cbc0010I After 23152000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1750.22 seconds)\n", + "Cbc0010I After 23153000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1750.28 seconds)\n", + "Cbc0010I After 23154000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1750.36 seconds)\n", + "Cbc0010I After 23155000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1750.43 seconds)\n", + "Cbc0010I After 23156000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1750.52 seconds)\n", + "Cbc0010I After 23157000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1750.62 seconds)\n", + "Cbc0010I After 23158000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1750.70 seconds)\n", + "Cbc0010I After 23159000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1750.78 seconds)\n", + "Cbc0010I After 23160000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1750.85 seconds)\n", + "Cbc0010I After 23161000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1750.93 seconds)\n", + "Cbc0010I After 23162000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1751.00 seconds)\n", + "Cbc0010I After 23163000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1751.07 seconds)\n", + "Cbc0010I After 23164000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1751.14 seconds)\n", + "Cbc0010I After 23165000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1751.20 seconds)\n", + "Cbc0010I After 23166000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1751.29 seconds)\n", + "Cbc0010I After 23167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1751.37 seconds)\n", + "Cbc0010I After 23168000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1751.49 seconds)\n", + "Cbc0010I After 23169000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1751.62 seconds)\n", + "Cbc0010I After 23170000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1751.76 seconds)\n", + "Cbc0010I After 23171000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1751.90 seconds)\n", + "Cbc0010I After 23172000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1752.03 seconds)\n", + "Cbc0010I After 23173000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1752.14 seconds)\n", + "Cbc0010I After 23174000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1752.25 seconds)\n", + "Cbc0010I After 23175000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1752.35 seconds)\n", + "Cbc0010I After 23176000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1752.47 seconds)\n", + "Cbc0010I After 23177000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1752.58 seconds)\n", + "Cbc0010I After 23178000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1752.67 seconds)\n", + "Cbc0010I After 23179000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (1752.78 seconds)\n", + "Cbc0010I After 23180000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1752.87 seconds)\n", + "Cbc0010I After 23181000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1752.95 seconds)\n", + "Cbc0010I After 23182000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1753.04 seconds)\n", + "Cbc0010I After 23183000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1753.11 seconds)\n", + "Cbc0010I After 23184000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1753.21 seconds)\n", + "Cbc0010I After 23185000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1753.28 seconds)\n", + "Cbc0010I After 23186000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1753.35 seconds)\n", + "Cbc0010I After 23187000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1753.42 seconds)\n", + "Cbc0010I After 23188000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1753.50 seconds)\n", + "Cbc0010I After 23189000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1753.58 seconds)\n", + "Cbc0010I After 23190000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1753.65 seconds)\n", + "Cbc0010I After 23191000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1753.73 seconds)\n", + "Cbc0010I After 23192000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1753.80 seconds)\n", + "Cbc0010I After 23193000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1753.86 seconds)\n", + "Cbc0010I After 23194000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1753.93 seconds)\n", + "Cbc0010I After 23195000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1754.00 seconds)\n", + "Cbc0010I After 23196000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1754.07 seconds)\n", + "Cbc0010I After 23197000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1754.15 seconds)\n", + "Cbc0010I After 23198000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1754.24 seconds)\n", + "Cbc0010I After 23199000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1754.41 seconds)\n", + "Cbc0010I After 23200000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1754.57 seconds)\n", + "Cbc0010I After 23201000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1754.69 seconds)\n", + "Cbc0010I After 23202000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1754.80 seconds)\n", + "Cbc0010I After 23203000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1754.90 seconds)\n", + "Cbc0010I After 23204000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1754.98 seconds)\n", + "Cbc0010I After 23205000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1755.08 seconds)\n", + "Cbc0010I After 23206000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1755.16 seconds)\n", + "Cbc0010I After 23207000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1755.23 seconds)\n", + "Cbc0010I After 23208000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1755.31 seconds)\n", + "Cbc0010I After 23209000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1755.40 seconds)\n", + "Cbc0010I After 23210000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1755.49 seconds)\n", + "Cbc0010I After 23211000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1755.60 seconds)\n", + "Cbc0010I After 23212000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1755.68 seconds)\n", + "Cbc0010I After 23213000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1755.76 seconds)\n", + "Cbc0010I After 23214000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1755.83 seconds)\n", + "Cbc0010I After 23215000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1755.89 seconds)\n", + "Cbc0010I After 23216000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1755.95 seconds)\n", + "Cbc0010I After 23217000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1756.01 seconds)\n", + "Cbc0010I After 23218000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1756.07 seconds)\n", + "Cbc0010I After 23219000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1756.12 seconds)\n", + "Cbc0010I After 23220000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1756.19 seconds)\n", + "Cbc0010I After 23221000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.26 seconds)\n", + "Cbc0010I After 23222000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1756.33 seconds)\n", + "Cbc0010I After 23223000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1756.39 seconds)\n", + "Cbc0010I After 23224000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.44 seconds)\n", + "Cbc0010I After 23225000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1756.50 seconds)\n", + "Cbc0010I After 23226000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.56 seconds)\n", + "Cbc0010I After 23227000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1756.61 seconds)\n", + "Cbc0010I After 23228000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1756.67 seconds)\n", + "Cbc0010I After 23229000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1756.73 seconds)\n", + "Cbc0010I After 23230000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1756.81 seconds)\n", + "Cbc0010I After 23231000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1756.89 seconds)\n", + "Cbc0010I After 23232000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1756.98 seconds)\n", + "Cbc0010I After 23233000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1757.06 seconds)\n", + "Cbc0010I After 23234000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1757.14 seconds)\n", + "Cbc0010I After 23235000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1757.21 seconds)\n", + "Cbc0010I After 23236000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1757.28 seconds)\n", + "Cbc0010I After 23237000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1757.36 seconds)\n", + "Cbc0010I After 23238000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1757.44 seconds)\n", + "Cbc0010I After 23239000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1757.54 seconds)\n", + "Cbc0010I After 23240000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1757.62 seconds)\n", + "Cbc0010I After 23241000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1757.71 seconds)\n", + "Cbc0010I After 23242000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1757.79 seconds)\n", + "Cbc0010I After 23243000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1757.85 seconds)\n", + "Cbc0010I After 23244000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1757.93 seconds)\n", + "Cbc0010I After 23245000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1758.01 seconds)\n", + "Cbc0010I After 23246000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1758.08 seconds)\n", + "Cbc0010I After 23247000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.16 seconds)\n", + "Cbc0010I After 23248000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1758.23 seconds)\n", + "Cbc0010I After 23249000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.31 seconds)\n", + "Cbc0010I After 23250000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.38 seconds)\n", + "Cbc0010I After 23251000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1758.46 seconds)\n", + "Cbc0010I After 23252000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1758.55 seconds)\n", + "Cbc0010I After 23253000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1758.62 seconds)\n", + "Cbc0010I After 23254000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.70 seconds)\n", + "Cbc0010I After 23255000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1758.77 seconds)\n", + "Cbc0010I After 23256000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1758.83 seconds)\n", + "Cbc0010I After 23257000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1758.90 seconds)\n", + "Cbc0010I After 23258000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1758.97 seconds)\n", + "Cbc0010I After 23259000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1759.06 seconds)\n", + "Cbc0010I After 23260000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1759.14 seconds)\n", + "Cbc0010I After 23261000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1759.21 seconds)\n", + "Cbc0010I After 23262000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1759.28 seconds)\n", + "Cbc0010I After 23263000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1759.35 seconds)\n", + "Cbc0010I After 23264000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1759.43 seconds)\n", + "Cbc0010I After 23265000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1759.50 seconds)\n", + "Cbc0010I After 23266000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1759.58 seconds)\n", + "Cbc0010I After 23267000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1759.66 seconds)\n", + "Cbc0010I After 23268000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1759.73 seconds)\n", + "Cbc0010I After 23269000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1759.81 seconds)\n", + "Cbc0010I After 23270000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1759.89 seconds)\n", + "Cbc0010I After 23271000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1759.96 seconds)\n", + "Cbc0010I After 23272000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1760.04 seconds)\n", + "Cbc0010I After 23273000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1760.11 seconds)\n", + "Cbc0010I After 23274000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1760.17 seconds)\n", + "Cbc0010I After 23275000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1760.24 seconds)\n", + "Cbc0010I After 23276000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1760.32 seconds)\n", + "Cbc0010I After 23277000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1760.39 seconds)\n", + "Cbc0010I After 23278000 n" + ] } ], "source": [ @@ -209,6 +22643,13 @@ "result['inconsistency']" ] }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [] + }, { "cell_type": "code", "execution_count": null, diff --git a/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb index 6fc08c1..901e706 100644 --- a/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb +++ b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 9, "metadata": {}, "outputs": [], "source": [ @@ -12,23 +12,23 @@ }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 10, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "({0: 55, 1: 103},\n", - " {'folds': [{0: 28, 1: 51}, {0: 27, 1: 52}]},\n", - " {'acc': 0.4494,\n", - " 'sens': 0.4494,\n", - " 'spec': 0.4494,\n", - " 'f1p': 0.4494,\n", + "({0: 165, 1: 130, 2: 77, 3: 66, 4: 116},\n", + " {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6726,\n", + " 'sens': 0.1814,\n", + " 'spec': 0.7954,\n", + " 'f1p': 0.1814,\n", " 'beta_positive': 2,\n", " 'beta_negative': 2})" ] }, - "execution_count": 2, + "execution_count": 10, "metadata": {}, "output_type": "execute_result" } @@ -44,7 +44,7 @@ }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 11, "metadata": {}, "outputs": [], "source": [ @@ -55,58 +55,51 @@ }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 12, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 07:56:08,379:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", - "2023-11-03 07:56:08,382:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 07:56:08,383:INFO:intervals before: (0, 346), (0, 1038)\n", - "2023-11-03 07:56:08,385:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,386:INFO:the tn solutions: (779.8805399999999, 780.23346)\n", - "2023-11-03 07:56:08,387:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,388:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 07:56:08,389:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,390:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", - "2023-11-03 07:56:08,391:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,392:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,393:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-11-03 07:56:08,394:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,395:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", - "2023-11-03 07:56:08,396:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", - "2023-11-03 07:56:08,398:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,399:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 07:56:08,400:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,401:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,402:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,402:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,403:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-11-03 07:56:08,404:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,405:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,405:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", - "2023-11-03 07:56:08,406:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,407:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-11-03 07:56:08,409:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,410:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", - "2023-11-03 07:56:08,411:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,412:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 07:56:08,415:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-11-03 07:56:08,416:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-11-03 07:56:08,417:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-03 07:56:08,419:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-11-03 07:56:08,419:INFO:constructing final tp, tn pair set\n", - "2023-11-03 07:56:08,420:INFO:final number of intervals: 1\n", - "2023-11-03 07:56:08,421:INFO:final number of pairs: 1\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + "2023-11-03 20:23:20,198:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-03 20:23:20,200:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 20:23:20,202:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-03 20:23:20,202:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 20:23:20,203:INFO:the tn solutions: (779.8805399999999, 780.23346)\n", + "2023-11-03 20:23:20,205:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,205:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 20:23:20,206:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,207:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", + "2023-11-03 20:23:20,208:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,209:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,210:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 20:23:20,211:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,211:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", + "2023-11-03 20:23:20,213:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", + "2023-11-03 20:23:20,213:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,214:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 20:23:20,215:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,217:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 20:23:20,218:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,219:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,220:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 20:23:20,221:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,222:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-03 20:23:20,223:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", + "2023-11-03 20:23:20,224:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,224:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 20:23:20,225:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,226:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-03 20:23:20,226:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,227:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-03 20:23:20,227:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-03 20:23:20,230:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-03 20:23:20,230:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-03 20:23:20,231:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-03 20:23:20,232:INFO:constructing final tp, tn pair set\n", + "2023-11-03 20:23:20,232:INFO:final number of intervals: 1\n", + "2023-11-03 20:23:20,233:INFO:final number of pairs: 1\n" ] }, { @@ -115,7 +108,7 @@ "False" ] }, - "execution_count": 4, + "execution_count": 12, "metadata": {}, "output_type": "execute_result" } @@ -130,94 +123,77 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 13, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" + "#scores['acc'] = (1.0 + scores['spec']) / 2.0" ] }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 14, "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "0.8756999999999999" - ] - }, - "execution_count": 6, - "metadata": {}, - "output_type": "execute_result" - } - ], + "outputs": [], "source": [ - "scores['acc']" + "#scores['acc']" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 15, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.8756" + "#scores['acc'] = 0.8756\n", + "scores['sens'] = 0.2553" ] }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 16, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 07:56:08,470:INFO:checking the scores {'acc': 0.8756, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", - "2023-11-03 07:56:08,471:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 07:56:08,473:INFO:intervals before: (0, 346), (0, 1038)\n", - "2023-11-03 07:56:08,474:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,475:INFO:the tn solutions: (1123.66614, 1124.01906)\n", - "2023-11-03 07:56:08,476:INFO:intervals after: [(88, 88)], []\n", - "2023-11-03 07:56:08,477:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 07:56:08,478:INFO:intervals before: [(88, 88)], []\n", - "2023-11-03 07:56:08,479:INFO:the tp solutions: (431.63015599999994, 432.1242440000002)\n", - "2023-11-03 07:56:08,480:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,484:INFO:intervals after: [], []\n", - "2023-11-03 07:56:08,485:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-11-03 07:56:08,486:INFO:intervals before: [], []\n", - "2023-11-03 07:56:08,487:INFO:the tp solutions: (29.316952326177706, 29.396674884278127)\n", - "2023-11-03 07:56:08,488:INFO:the tn solutions: (1181.921009301171, 1183.026325582998)\n", - "2023-11-03 07:56:08,489:INFO:intervals after: [], []\n", - "2023-11-03 07:56:08,490:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 07:56:08,491:INFO:intervals before: [], []\n", - "2023-11-03 07:56:08,492:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,493:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,495:INFO:intervals after: [], []\n", - "2023-11-03 07:56:08,496:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-11-03 07:56:08,497:INFO:intervals before: [], []\n", - "2023-11-03 07:56:08,498:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 07:56:08,499:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", - "2023-11-03 07:56:08,499:INFO:intervals after: [], []\n", - "2023-11-03 07:56:08,501:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-11-03 07:56:08,502:INFO:intervals before: [], []\n", - "2023-11-03 07:56:08,503:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", - "2023-11-03 07:56:08,503:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 07:56:08,504:INFO:intervals after: [], []\n", - "2023-11-03 07:56:08,506:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-11-03 07:56:08,506:INFO:no more feasible tp,tn pairs left\n", - "2023-11-03 07:56:08,507:INFO:constructing final tp, tn pair set\n", - "2023-11-03 07:56:08,508:INFO:final number of intervals: 0\n", - "2023-11-03 07:56:08,509:INFO:final number of pairs: 0\n" - ] - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]\n" + "2023-11-03 20:23:20,274:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2553, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-03 20:23:20,276:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-03 20:23:20,277:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-03 20:23:20,277:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-03 20:23:20,278:INFO:the tn solutions: (779.5345399999999, 779.88746)\n", + "2023-11-03 20:23:20,279:INFO:intervals after: [(1, 0)], [(1, 0)]\n", + "2023-11-03 20:23:20,279:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-03 20:23:20,280:INFO:intervals before: [(1, 0)], [(1, 0)]\n", + "2023-11-03 20:23:20,280:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", + "2023-11-03 20:23:20,281:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,282:INFO:intervals after: [], []\n", + "2023-11-03 20:23:20,282:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-03 20:23:20,283:INFO:intervals before: [], []\n", + "2023-11-03 20:23:20,284:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", + "2023-11-03 20:23:20,285:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", + "2023-11-03 20:23:20,286:INFO:intervals after: [], []\n", + "2023-11-03 20:23:20,286:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-03 20:23:20,289:INFO:intervals before: [], []\n", + "2023-11-03 20:23:20,290:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-03 20:23:20,290:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,291:INFO:intervals after: [], []\n", + "2023-11-03 20:23:20,291:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-03 20:23:20,293:INFO:intervals before: [], []\n", + "2023-11-03 20:23:20,294:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-03 20:23:20,294:INFO:the tn solutions: (776.397796151697, 778.8284162069881)\n", + "2023-11-03 20:23:20,295:INFO:intervals after: [], []\n", + "2023-11-03 20:23:20,295:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-03 20:23:20,296:INFO:intervals before: [], []\n", + "2023-11-03 20:23:20,297:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-03 20:23:20,297:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-03 20:23:20,298:INFO:intervals after: [], []\n", + "2023-11-03 20:23:20,299:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-03 20:23:20,300:INFO:no more feasible tp,tn pairs left\n", + "2023-11-03 20:23:20,301:INFO:constructing final tp, tn pair set\n", + "2023-11-03 20:23:20,301:INFO:final number of intervals: 0\n", + "2023-11-03 20:23:20,302:INFO:final number of pairs: 0\n" ] }, { @@ -226,7 +202,7 @@ "True" ] }, - "execution_count": 8, + "execution_count": 16, "metadata": {}, "output_type": "execute_result" } From c272b7eb74189a51b74993fb3e9b20629f2d5cc1 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 10:36:20 +0100 Subject: [PATCH 21/40] timeout added --- tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py | 3 ++- tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py | 3 ++- tests/check/multiclass/test_1_dataset_known_folds_som_macro.py | 3 ++- 3 files changed, 6 insertions(+), 3 deletions(-) diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py index b708812..f466aff 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -53,6 +53,7 @@ def test_inconsistent(random_seed: int): result = check_1_dataset_known_folds_mos_macro(dataset=dataset, folding=folding, scores=scores, - eps=1e-4) + eps=1e-4, + timeout=2) assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py index 76716a0..a695f00 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py @@ -53,6 +53,7 @@ def test_inconsistent(random_seed: int): result = check_1_dataset_known_folds_mos_micro(dataset=dataset, folding=folding, scores=scores, - eps=1e-4) + eps=1e-4, + timeout=2) assert result['inconsistency'] diff --git a/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py index 86dce60..779bc73 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py @@ -47,6 +47,7 @@ def test_inconsistent(random_seed: int): result = check_1_dataset_known_folds_som_macro(dataset=dataset, folding=folding, scores=scores, - eps=1e-4) + eps=1e-4, + timeout=2) assert result['inconsistency'] From 7bf18ecdfd4f40f83eb236070c8328c12e970aad Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 11:23:47 +0100 Subject: [PATCH 22/40] docs update --- README.rst | 135 +++++++++++++++++++++++++++--- docs/01c_consistency_checking.rst | 2 +- 2 files changed, 126 insertions(+), 11 deletions(-) diff --git a/README.rst b/README.rst index 8596622..39a2d31 100644 --- a/README.rst +++ b/README.rst @@ -249,8 +249,11 @@ In the context of a single testset or a Score of Means (SoM) aggregation, which With a MoS type of aggregation, only the averages of scores over folds or datasets are available. In this case, it is feasible to reconstruct fold-level or dataset-level confusion matrices for the linear scores ``acc``, ``sens``, ``spec`` and ``bacc`` using linear integer programming. These tests formulate a linear integer program based on the reported scores and the experimental setup, and check if the program is feasible to produce the reported values within the estimated numerical uncertainties. +Binary classification +^^^^^^^^^^^^^^^^^^^^^ + 1 testset with no k-fold -^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~ A scenario like this is having one single test set to which classification is applied and the scores are computed from the resulting confusion matrix. For example, given a test image, which is segmented and the scores of the segmentation (as a binary classification of pixels) are calculated and reported. @@ -287,7 +290,7 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura As the ``inconsistency`` flag shows, here inconsistencies were identified, there are no such ``tp`` and ``tn`` combinations which would end up with the reported scores. Either the assumption on the properties of the dataset, or the scores are incorrect. 1 dataset with k-fold, mean-of-scores (MoS) -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This scenario is the most common in the literature. A classification technique is executed to each fold in a (repeated) k-fold scenario, the scores are calculated for each fold, and the average of the scores is reported with some numerical uncertainty due to rounding/ceiling/flooring. Because of the averaging, this test supports only the linear scores (``acc``, ``sens``, ``spec``, ``bacc``) which usually are among the most commonly reported scores. The test constructs a linear integer program describing the scenario with the true positive and true negative parameters of all folds and checks its feasibility. @@ -345,7 +348,7 @@ with a true positive and true negative configuration with the specified lower an Note that in this example, although ``f1`` is provided, it is completely ignored as the aggregated tests work only for the four linear scores. 1 dataset with kfold score-of-means (SoM) -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ When the scores are calculated in the Score-of-Means (SoM) manner in a k-fold scenario, it means that the total confusion matrix of all folds is calculated first, and then the score formulas are applied to it. The only difference compared to the "1 testset no kfold" scenario is that the number of repetitions of the k-fold scheme multiples the ``p`` and ``n`` statistics of the dataset, but the actual structure of the folds is irrelevant. The result of the analysis is structured similarly to the "1 testset no kfold" case. @@ -383,7 +386,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan # True n testsets without k-folding, SoM over the testsets -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In this scenario there are n different testsets, the classifier is evaluated on each testsets, and the scores are aggregated by the SoM aggregation. This scenario is similar to the "1 dataset k-fold SoM" case, except the scores are aggregated over testsets rather than folds. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case. In the following example, a consistent case is tested. @@ -413,7 +416,7 @@ If one of the scores is slightly adjusted, for example, ``npv`` changed to 0.626 # True n testsets without k-folding, MoS over the testsets -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This scenario is analogous to the "n testsets without k-folding, SoM" scenario, except the aggregation over the testsets is carried out with the MoS approach. The output is structured similarly to the output of the "1 dataset k-fold MoS" scenario. In the first example, a feasible scenario is tested. @@ -446,7 +449,7 @@ If one of the scores is slightly adjusted, for example, ``sens`` is updated to 0 # True n datasets with k-folds, SoM over datasets and SoM over folds -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except there is another level of aggregation over datasets, and one single confusion matrix is determined for the entire experiment and the scores are calculated from that. In this scenario a list of evaluations need to be specified. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case, there is a top level ``inconsistency`` flag indicating if inconsistency has been detected. In the following example, a consistent case is prepared with two datasets. @@ -483,7 +486,7 @@ However, if one of the scores is adjusted a little, like accuracy is changed to # True n datasets with k-folds, MoS over datasets and SoM over folds -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This scenario is about performance scores calculated for each dataset individually by the SoM aggregation in any k-folding strategy, and then the scores are aggregated across the datasets in the MoS manner. Because of the overall averaging, one cannot do inference about the non-linear scores, only the four linear scores are supported (``acc``, ``sens``, ``spec``, ``bacc``), and the scores are checked by linear programming. Similarly as before, the specification of a list of evaluations is needed. In the following example a consistent scenario is tested, with score bounds also specified on the datasets: @@ -523,7 +526,7 @@ However, if one of the scores is adjusted a little (accuracy changed to 0.412 an The output is structured similarly to the '1 dataset k-folds MoS' case, one can query the status of the solver by the key ``lp_status`` and the actual configuration of the variables by the ``lp_configuration`` key. If there are hints on the minimum and maximum scores across the datasets, one can add those bounds through the ``dataset_score_bounds`` parameter to strengthen the test. n datasets with k-folds, MoS over datasets and MoS over folds -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In this scenario, scores are calculated in the MoS manner for each dataset, and then aggregated again across the datasets. Again, because of the averaging, only the four linear scores (``acc``, ``sens``, ``spec``, ``bacc``) are supported. In the following example a consistent scenario is checked with three datasets and without score bounds specified at any level: @@ -560,12 +563,12 @@ Again, the details of the analysis are accessible under the ``lp_status`` and `` If there are hints on the minimum and maximum scores across the datasets, one can add those bounds through the ``dataset_score_bounds`` parameter to strengthen the test. Not knowing the mode of aggregation ------------------------------------ +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. Not knowing the k-folding scheme --------------------------------- +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In many cases, it is not stated explicitly if stratification was applied or not, only the use of k-fold is phrased in papers. Not knowing the folding structure, the MoS aggregated tests cannot be used. However, if the cardinality of the minority class is not too big (a couple of dozens), then all potential k-fold configurations can be generated, and the MoS tests can be applied to each. If the scores are inconsistent with each, it means that no k-fold could result the scores. There are two functions supporting these exhaustive tests, one for the dataset level, and one for the experiment level. @@ -634,6 +637,118 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th result['inconsistency'] # True +Multiclass classification +^^^^^^^^^^^^^^^^^^^^^^^^^ + +In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. + +1 testset, no k-fold, micro/macro-averaging +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + +In this scenario, we suppose there is a multiclass classification testset and the class level scores on the testset are aggregated by micro-averaging. The test is based on exhaustive enumeration, so all 20 performance scores are supported. In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro + + >>> testset = {0: 10, 1: 100, 2: 80} + >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, + 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # False + +As the test confirms, the setup is consistent. However, if one of the scores is adjusted a little, for example, accuracy is changed to 0.5258, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['acc'] = 0.5258 + >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores=scores, + eps=1e-4) + >>> results['inconsistency'] + # True + +Similar functionality is provided for macro-averaging. + +1 dataset, known k-folds, SoM/MoS aggregation, micro/macro-averaging +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + +In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by micro-averaging, and the fold level results are aggregated in the score of means fashion. The test is based on exhaustive enumeration, therefore, all 20 performance scores are supported. + +In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro + + >>> dataset = {0: 86, 1: 96, 2: 59, 3: 105} + >>> folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]} + >>> scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543} + + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the test confirms, the scenario is feasible. However, if one of the scores is adjusted a little, for example, sensitivity is changed to 0.2553, the configuration becomes infeasible: + +.. code-block:: Python + + >>> scores['sens'] = 0.2553 + >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + folding=folding, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + +Similar functionality is provided for mean of scores aggregation and macro averaging. + +Regression +^^^^^^^^^^ + +From the point of view of consistency testing, regression is the hardest problem as the predictions can produce any performance scores. The tests implemented in the package allow testing the relation of the *mean squared error* (``mse``), *root mean squared error* (``rmse``), *mean average error* (``mae``) and *r^2 scores* (``r2``). + +1 testset, no k-fold +~~~~~~~~~~~~~~~~~~~~ + +In this scenario, we assume there is a regression testset, and the performance scores are calculated on the testset. + +In the first example, we test an artificially generated, consistent scenario: + +.. code-block:: Python + + >>> from mlscorecheck.check.regression import check_1_testset_no_kfold + + >>> var = 0.0831619 # the variance of the target values in the testset + >>> n_samples = 100 + >>> scores = {'mae': 0.0254, 'r2': 0.9897} + + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # False + +As the results show, there is no inconsistency detected. However, if the mae score is adjusted slightly to 0.03, the configuration becomes inconsistent: + +.. code-block:: Python + + >>> scores['mae'] = 0.03 + >>> result = check_1_testset_no_kfold(var=var, + n_samples=n_samples, + scores=scores, + eps=1e-4) + >>> result['inconsistency'] + # True + + Test bundles ============ diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index bbcde29..ef4bda8 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -440,7 +440,7 @@ As the test confirms, the setup is consistent. However, if one of the scores is >>> results['inconsistency'] # True -1 testset, no k-fold, micro-averaging +1 testset, no k-fold, macro-averaging ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ This scenario is similar to the previous one, except the scores are aggregated by macro-averaging. The test is based on linear programming, so only accuracy, sensitivity, specificity and balanced accuracy are supported. In the first example, we test an artificially generated, consistent scenario: From f04a92ff52536ee7ae1fc3a2f1388781c14205c2 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 11:35:13 +0100 Subject: [PATCH 23/40] examples updated --- .../_check_1_dataset_known_folds_mos_macro.py | 14 +- .../_check_1_dataset_known_folds_mos_micro.py | 14 +- .../_check_1_dataset_known_folds_som_macro.py | 8 +- .../_check_1_dataset_known_folds_som_micro.py | 2 +- .../_check_1_testset_no_kfold_macro.py | 2 +- .../_check_1_testset_no_kfold_micro.py | 2 +- .../00_check_1_testset_no_kfold_macro.ipynb | 93 +- .../01_check_1_testset_no_kfold_micro.ipynb | 356 +- ...heck_1_dataset_known_folds_mos_macro.ipynb | 72 +- ...heck_1_dataset_known_folds_mos_micro.ipynb | 83 +- ...heck_1_dataset_known_folds_som_macro.ipynb | 22515 +--------------- ...heck_1_dataset_known_folds_som_micro.ipynb | 189 +- 12 files changed, 397 insertions(+), 22953 deletions(-) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py index de51bd1..fa8bf51 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -74,19 +74,19 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro - >>> dataset = {0: 66, 1: 178, 2: 151} - >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} - >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} - >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro + >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} + >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8367 - >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, + >>> scores['acc'] = 0.656 + >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index bd63e9b..4a9a3d5 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -74,19 +74,19 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, ValueError: if the problem is not specified properly Examples: - >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro - >>> dataset = {0: 149, 1: 118, 2: 83, 3: 154} - >>> folding = {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} - >>> scores = {'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469} - >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro + >>> dataset = {0: 66, 1: 178, 2: 151} + >>> folding = {'folds': [{0: 33, 1: 89, 2: 76}, {0: 33, 1: 89, 2: 75}]} + >>> scores = {'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469} + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) >>> result['inconsistency'] # False - >>> scores['acc'] = 0.8745 - >>> result = check_1_dataset_known_folds_mos_macro(dataset=dataset, + >>> scores['acc'] = 0.5746 + >>> result = check_1_dataset_known_folds_mos_micro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py index 63be44e..cb6265d 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -76,9 +76,9 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, Examples: >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro - >>> dataset = {0: 34, 1: 135, 2: 170, 3: 192} - >>> folding = {'n_folds': 2, 'n_repeats': 1, 'strategy': 'stratified_sklearn'} - >>> scores = {'acc': 0.6271, 'sens': 0.2422, 'spec': 0.7525, 'f1p': 0.2333} + >>> dataset = {0: 129, 1: 81, 2: 135} + >>> folding = {'n_folds': 2, 'n_repeats': 2, 'strategy': 'stratified_sklearn'} + >>> scores = {'acc': 0.5662, 'sens': 0.3577, 'spec': 0.6767, 'f1p': 0.3481} >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, folding=folding, scores=scores, @@ -86,7 +86,7 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, >>> result['inconsistency'] # False - >>> scores['acc'] = 0.8762 + >>> scores['acc'] = 0.6762 >>> result = check_1_dataset_known_folds_som_macro(dataset=dataset, folding=folding, scores=scores, diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index bac6732..2885d67 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -74,7 +74,7 @@ class level scores on a single multiclass dataset and averaging across the folds >>> result['inconsistency'] # False - >>> scores['acc'] = 0.8756 + >>> scores['sens'] = 0.2553 >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, folding=folding, scores=scores, diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py index eb3359d..cb61276 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py @@ -78,7 +78,7 @@ class level scores on one single multiclass dataset. >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8464 + >>> scores['acc'] = 0.6020 >>> results = check_1_testset_no_kfold_macro(scores=scores, testset=testset, eps=1e-4) >>> results['inconsistency'] # True diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py index 8dab30a..f0688a2 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py @@ -73,7 +73,7 @@ def check_1_testset_no_kfold_micro(testset: dict, >>> results['inconsistency'] # False - >>> scores['acc'] = 0.8184 + >>> scores['acc'] = 0.5258 >>> results = check_1_testset_no_kfold_micro(testset=testset, scores=scores, eps=1e-4) diff --git a/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb index 0975792..665262e 100644 --- a/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb +++ b/notebooks/illustration/multiclass/00_check_1_testset_no_kfold_macro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 1, + "execution_count": 17, "metadata": {}, "outputs": [], "source": [ @@ -11,7 +11,7 @@ }, { "cell_type": "code", - "execution_count": 2, + "execution_count": 18, "metadata": {}, "outputs": [], "source": [ @@ -20,7 +20,7 @@ }, { "cell_type": "code", - "execution_count": 3, + "execution_count": 19, "metadata": {}, "outputs": [], "source": [ @@ -29,7 +29,7 @@ }, { "cell_type": "code", - "execution_count": 4, + "execution_count": 20, "metadata": {}, "outputs": [ { @@ -40,7 +40,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f6fc4d6fe990483db85d417dd55b4cf3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6fc4d6fe990483db85d417dd55b4cf3-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/62d7116b71bc46a88a616d361418de8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62d7116b71bc46a88a616d361418de8f-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -54,7 +54,7 @@ "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", "Cbc0031I 2 added rows had average density of 6\n", "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 39 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 1 (Gomory) - 86 row cuts average 5.7 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", @@ -62,12 +62,12 @@ "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 6 (TwoMirCuts) - 10 row cuts average 3.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 81 iterations and 3 nodes (0.03 seconds)\n", - "Cbc0001I Search completed - best objective 0, took 81 iterations and 3 nodes (0.03 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 81 iterations and 3 nodes (0.02 seconds)\n", + "Cbc0001I Search completed - best objective 0, took 81 iterations and 3 nodes (0.02 seconds)\n", "Cbc0032I Strong branching done 20 times (30 iterations), fathomed 0 nodes and fixed 4 variables\n", "Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Gomory was tried 39 times and created 86 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Knapsack was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "Clique was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", @@ -81,11 +81,11 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 3\n", "Total iterations: 81\n", - "Time (CPU seconds): 0.03\n", - "Time (Wallclock seconds): 0.03\n", + "Time (CPU seconds): 0.02\n", + "Time (Wallclock seconds): 0.02\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", "\n" ] }, @@ -95,7 +95,7 @@ "False" ] }, - "execution_count": 4, + "execution_count": 20, "metadata": {}, "output_type": "execute_result" } @@ -107,25 +107,36 @@ }, { "cell_type": "code", - "execution_count": 5, + "execution_count": 22, "metadata": {}, - "outputs": [], + "outputs": [ + { + "data": { + "text/plain": [ + "{'acc': 0.6, 'sens': 0.3417, 'spec': 0.6928, 'f1p': 0.3308}" + ] + }, + "execution_count": 22, + "metadata": {}, + "output_type": "execute_result" + } + ], "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" + "scores" ] }, { "cell_type": "code", - "execution_count": 6, + "execution_count": 24, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.601" + "scores['acc'] = 0.6020" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 25, "metadata": {}, "outputs": [ { @@ -136,7 +147,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/b026655b35024810ad4b2a8bb71f0907-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b026655b35024810ad4b2a8bb71f0907-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/f1cf50867bd542b1987d654e01fbe5ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1cf50867bd542b1987d654e01fbe5ab-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -149,39 +160,39 @@ "Continuous objective value is 0 - 0.00 seconds\n", "Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 12 elements\n", "Cbc0031I 2 added rows had average density of 6\n", - "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 31 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 65 row cuts average 5.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 37 passes\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 90 row cuts average 5.8 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 3 row cuts average 2.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 10 row cuts average 3.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 8 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.01 seconds)\n", - "Cbc0010I After 1000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (0.78 seconds)\n", - "Cbc0001I Search completed - best objective 1e+50, took 201914 iterations and 126163 nodes (0.88 seconds)\n", - "Cbc0032I Strong branching done 3252 times (5439 iterations), fathomed 277 nodes and fixed 436 variables\n", - "Cbc0041I Maximum depth 48, 0 variables fixed on reduced cost (complete fathoming 52 times, 124723 nodes taking 189250 iterations)\n", + "Cbc0010I After 1000 nodes, 2 on tree, 1e+50 best solution, best possible 0 (0.29 seconds)\n", + "Cbc0001I Search completed - best objective 1e+50, took 69036 iterations and 45721 nodes (0.32 seconds)\n", + "Cbc0032I Strong branching done 2622 times (4495 iterations), fathomed 179 nodes and fixed 418 variables\n", + "Cbc0041I Maximum depth 29, 0 variables fixed on reduced cost (complete fathoming 141 times, 44653 nodes taking 60327 iterations)\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Gomory was tried 31 times and created 65 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 31 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 31 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 31 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Probing was tried 37 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Gomory was tried 37 times and created 90 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "Knapsack was tried 37 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Clique was tried 37 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "MixedIntegerRounding2 was tried 37 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 37 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "TwoMirCuts was tried 37 times and created 8 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Problem proven infeasible\n", "\n", "No feasible solution found\n", - "Enumerated nodes: 126163\n", - "Total iterations: 201914\n", - "Time (CPU seconds): 0.88\n", - "Time (Wallclock seconds): 0.88\n", + "Enumerated nodes: 45721\n", + "Total iterations: 69036\n", + "Time (CPU seconds): 0.32\n", + "Time (Wallclock seconds): 0.32\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.88 (Wallclock seconds): 0.88\n", + "Total time (CPU seconds): 0.32 (Wallclock seconds): 0.32\n", "\n" ] }, @@ -191,7 +202,7 @@ "True" ] }, - "execution_count": 7, + "execution_count": 25, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb index a4b1a70..91eeb3f 100644 --- a/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb +++ b/notebooks/illustration/multiclass/01_check_1_testset_no_kfold_micro.ipynb @@ -37,91 +37,91 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 20:15:50,791:INFO:checking the scores {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", - "2023-11-03 20:15:50,796:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 20:15:50,798:INFO:intervals before: (0, 190), (0, 380)\n", - "2023-11-03 20:15:50,800:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:15:50,801:INFO:the tn solutions: (241.92548, 242.08052000000006)\n", - "2023-11-03 20:15:50,802:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,803:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 20:15:50,803:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,804:INFO:the tp solutions: (51.92509999999996, 52.11890000000008)\n", - "2023-11-03 20:15:50,805:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:15:50,806:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,807:INFO:evaluating the tp and tn solution for acc and bacc\n", - "2023-11-03 20:15:50,809:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,810:INFO:the tp solutions: (51.886339999999905, 52.157659999999964)\n", - "2023-11-03 20:15:50,811:INFO:the tn solutions: (241.79020000000003, 242.17780000000016)\n", - "2023-11-03 20:15:50,812:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,813:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-11-03 20:15:50,814:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,815:INFO:the tp solutions: (51.92507006183688, 52.081026437634286)\n", - "2023-11-03 20:15:50,815:INFO:the tn solutions: (241.57858662847494, 242.42776991777123)\n", - "2023-11-03 20:15:50,816:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,817:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-11-03 20:15:50,818:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,818:INFO:the tp solutions: (51.36701642883198, 52.50098353406811)\n", - "2023-11-03 20:15:50,819:INFO:the tn solutions: (241.71814351243938, 242.4273174965254)\n", - "2023-11-03 20:15:50,820:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,821:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 20:15:50,822:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,822:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:15:50,823:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:15:50,824:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,825:INFO:evaluating the tp and tn solution for sens and bacc\n", - "2023-11-03 20:15:50,826:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,826:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:15:50,827:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", - "2023-11-03 20:15:50,828:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,829:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-11-03 20:15:50,830:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,833:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:15:50,836:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", - "2023-11-03 20:15:50,837:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,838:INFO:evaluating the tp and tn solution for sens and npv\n", - "2023-11-03 20:15:50,838:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,839:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:15:50,840:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", - "2023-11-03 20:15:50,841:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,842:INFO:evaluating the tp and tn solution for spec and bacc\n", - "2023-11-03 20:15:50,844:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,845:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", - "2023-11-03 20:15:50,846:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:15:50,847:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,847:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-11-03 20:15:50,848:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,849:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", - "2023-11-03 20:15:50,849:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:15:50,850:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,851:INFO:evaluating the tp and tn solution for spec and npv\n", - "2023-11-03 20:15:50,852:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,852:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", - "2023-11-03 20:15:50,853:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:15:50,853:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,854:INFO:evaluating the tp and tn solution for bacc and ppv\n", - "2023-11-03 20:15:50,855:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,856:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", - "2023-11-03 20:15:50,857:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", - "2023-11-03 20:15:50,857:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,862:INFO:evaluating the tp and tn solution for bacc and npv\n", - "2023-11-03 20:15:50,864:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,864:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", - "2023-11-03 20:15:50,866:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", - "2023-11-03 20:15:50,867:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,869:INFO:evaluating the tp and tn solution for ppv and npv\n", - "2023-11-03 20:15:50,871:INFO:intervals before: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,871:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", - "2023-11-03 20:15:50,872:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", - "2023-11-03 20:15:50,873:INFO:intervals after: [(52, 52)], [(242, 242)]\n", - "2023-11-03 20:15:50,874:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,875:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,876:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,877:INFO:testing bacc, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,879:INFO:testing npv, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,880:INFO:testing ppv, feasible tptn pairs: 1\n", - "2023-11-03 20:15:50,881:INFO:constructing final tp, tn pair set\n", - "2023-11-03 20:15:50,882:INFO:final number of intervals: 1\n", - "2023-11-03 20:15:50,882:INFO:final number of pairs: 1\n" + "2023-11-04 11:34:20,704:INFO:checking the scores {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-04 11:34:20,705:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-04 11:34:20,706:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-04 11:34:20,707:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,709:INFO:the tn solutions: (241.92548, 242.08052000000006)\n", + "2023-11-04 11:34:20,709:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,710:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-04 11:34:20,711:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,712:INFO:the tp solutions: (51.92509999999996, 52.11890000000008)\n", + "2023-11-04 11:34:20,713:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,714:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,716:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-04 11:34:20,717:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,718:INFO:the tp solutions: (51.886339999999905, 52.157659999999964)\n", + "2023-11-04 11:34:20,719:INFO:the tn solutions: (241.79020000000003, 242.17780000000016)\n", + "2023-11-04 11:34:20,719:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,720:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-04 11:34:20,721:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,722:INFO:the tp solutions: (51.92507006183688, 52.081026437634286)\n", + "2023-11-04 11:34:20,722:INFO:the tn solutions: (241.57858662847494, 242.42776991777123)\n", + "2023-11-04 11:34:20,723:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,724:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-04 11:34:20,725:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,726:INFO:the tp solutions: (51.36701642883198, 52.50098353406811)\n", + "2023-11-04 11:34:20,727:INFO:the tn solutions: (241.71814351243938, 242.4273174965254)\n", + "2023-11-04 11:34:20,729:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,730:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-04 11:34:20,730:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,731:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,732:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,733:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,733:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-04 11:34:20,734:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,735:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,736:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-04 11:34:20,737:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,738:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-04 11:34:20,738:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,740:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,741:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-04 11:34:20,742:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,742:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-04 11:34:20,743:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,745:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,747:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-04 11:34:20,751:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,751:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-04 11:34:20,753:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,753:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-04 11:34:20,754:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,755:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,756:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-04 11:34:20,756:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,758:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-04 11:34:20,759:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,759:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,760:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-04 11:34:20,761:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,762:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-04 11:34:20,763:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,764:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,765:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-04 11:34:20,766:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,767:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-04 11:34:20,768:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-04 11:34:20,769:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,769:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-04 11:34:20,770:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,771:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-04 11:34:20,771:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-04 11:34:20,772:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,773:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-04 11:34:20,773:INFO:intervals before: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,774:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-04 11:34:20,775:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-04 11:34:20,776:INFO:intervals after: [(52, 52)], [(242, 242)]\n", + "2023-11-04 11:34:20,777:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,778:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,779:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,781:INFO:testing bacc, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,782:INFO:testing npv, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,784:INFO:testing ppv, feasible tptn pairs: 1\n", + "2023-11-04 11:34:20,785:INFO:constructing final tp, tn pair set\n", + "2023-11-04 11:34:20,786:INFO:final number of intervals: 1\n", + "2023-11-04 11:34:20,787:INFO:final number of pairs: 1\n" ] }, { @@ -142,15 +142,6 @@ "results['inconsistency']" ] }, - { - "cell_type": "code", - "execution_count": 5, - "metadata": {}, - "outputs": [], - "source": [ - "scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, { "cell_type": "code", "execution_count": 6, @@ -159,7 +150,12 @@ { "data": { "text/plain": [ - "0.8184" + "{'acc': 0.5158,\n", + " 'sens': 0.2737,\n", + " 'spec': 0.6368,\n", + " 'bacc': 0.4553,\n", + " 'ppv': 0.2737,\n", + " 'npv': 0.6368}" ] }, "execution_count": 6, @@ -168,12 +164,12 @@ } ], "source": [ - "scores['acc']" + "scores" ] }, { "cell_type": "code", - "execution_count": 7, + "execution_count": 8, "metadata": {}, "outputs": [], "source": [ @@ -182,94 +178,94 @@ }, { "cell_type": "code", - "execution_count": 8, + "execution_count": 9, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 20:16:02,927:INFO:checking the scores {'acc': 0.5258, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", - "2023-11-03 20:16:02,929:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 20:16:02,930:INFO:intervals before: (0, 190), (0, 380)\n", - "2023-11-03 20:16:02,930:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:16:02,931:INFO:the tn solutions: (247.62548000000004, 247.78052000000005)\n", - "2023-11-03 20:16:02,932:INFO:intervals after: [(52, 52)], [(1, 0)]\n", - "2023-11-03 20:16:02,932:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 20:16:02,933:INFO:intervals before: [(52, 52)], [(1, 0)]\n", - "2023-11-03 20:16:02,935:INFO:the tp solutions: (57.6251, 57.81890000000007)\n", - "2023-11-03 20:16:02,936:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:16:02,937:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,938:INFO:evaluating the tp and tn solution for acc and bacc\n", - "2023-11-03 20:16:02,938:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,939:INFO:the tp solutions: (46.18633999999993, 46.45765999999995)\n", - "2023-11-03 20:16:02,940:INFO:the tn solutions: (253.19020000000012, 253.57780000000014)\n", - "2023-11-03 20:16:02,940:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,941:INFO:evaluating the tp and tn solution for acc and ppv\n", - "2023-11-03 20:16:02,942:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,944:INFO:the tp solutions: (48.48095605224332, 48.631235988558664)\n", - "2023-11-03 20:16:02,945:INFO:the tn solutions: (250.7201326395527, 251.58013068134997)\n", - "2023-11-03 20:16:02,946:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,946:INFO:evaluating the tp and tn solution for acc and npv\n", - "2023-11-03 20:16:02,947:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,948:INFO:the tp solutions: (43.80386395479962, 44.93079743039423)\n", - "2023-11-03 20:16:02,949:INFO:the tn solutions: (254.97280231946934, 255.70600994264748)\n", - "2023-11-03 20:16:02,951:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,951:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 20:16:02,952:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,952:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:16:02,953:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:16:02,954:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,955:INFO:evaluating the tp and tn solution for sens and bacc\n", - "2023-11-03 20:16:02,957:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,958:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:16:02,959:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", - "2023-11-03 20:16:02,960:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,961:INFO:evaluating the tp and tn solution for sens and ppv\n", - "2023-11-03 20:16:02,962:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,963:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:16:02,963:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", - "2023-11-03 20:16:02,966:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,966:INFO:evaluating the tp and tn solution for sens and npv\n", - "2023-11-03 20:16:02,967:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,968:INFO:the tp solutions: (51.98362, 52.02238)\n", - "2023-11-03 20:16:02,968:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", - "2023-11-03 20:16:02,969:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,970:INFO:evaluating the tp and tn solution for spec and bacc\n", - "2023-11-03 20:16:02,971:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,971:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", - "2023-11-03 20:16:02,972:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:16:02,972:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,974:INFO:evaluating the tp and tn solution for spec and ppv\n", - "2023-11-03 20:16:02,975:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,976:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", - "2023-11-03 20:16:02,977:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:16:02,978:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,978:INFO:evaluating the tp and tn solution for spec and npv\n", - "2023-11-03 20:16:02,979:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,980:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", - "2023-11-03 20:16:02,980:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", - "2023-11-03 20:16:02,981:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,983:INFO:evaluating the tp and tn solution for bacc and ppv\n", - "2023-11-03 20:16:02,984:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,985:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", - "2023-11-03 20:16:02,985:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", - "2023-11-03 20:16:02,986:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,986:INFO:evaluating the tp and tn solution for bacc and npv\n", - "2023-11-03 20:16:02,987:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,988:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", - "2023-11-03 20:16:02,989:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", - "2023-11-03 20:16:02,990:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,990:INFO:evaluating the tp and tn solution for ppv and npv\n", - "2023-11-03 20:16:02,991:INFO:intervals before: [], []\n", - "2023-11-03 20:16:02,992:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", - "2023-11-03 20:16:02,996:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", - "2023-11-03 20:16:02,997:INFO:intervals after: [], []\n", - "2023-11-03 20:16:02,998:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-11-03 20:16:02,998:INFO:no more feasible tp,tn pairs left\n", - "2023-11-03 20:16:02,999:INFO:constructing final tp, tn pair set\n", - "2023-11-03 20:16:03,000:INFO:final number of intervals: 0\n", - "2023-11-03 20:16:03,000:INFO:final number of pairs: 0\n" + "2023-11-04 11:34:20,856:INFO:checking the scores {'acc': 0.5258, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368}\n", + "2023-11-04 11:34:20,857:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-04 11:34:20,858:INFO:intervals before: (0, 190), (0, 380)\n", + "2023-11-04 11:34:20,859:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,860:INFO:the tn solutions: (247.62548000000004, 247.78052000000005)\n", + "2023-11-04 11:34:20,862:INFO:intervals after: [(52, 52)], [(1, 0)]\n", + "2023-11-04 11:34:20,863:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-04 11:34:20,864:INFO:intervals before: [(52, 52)], [(1, 0)]\n", + "2023-11-04 11:34:20,865:INFO:the tp solutions: (57.6251, 57.81890000000007)\n", + "2023-11-04 11:34:20,866:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,867:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,867:INFO:evaluating the tp and tn solution for acc and bacc\n", + "2023-11-04 11:34:20,868:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,869:INFO:the tp solutions: (46.18633999999993, 46.45765999999995)\n", + "2023-11-04 11:34:20,870:INFO:the tn solutions: (253.19020000000012, 253.57780000000014)\n", + "2023-11-04 11:34:20,871:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,871:INFO:evaluating the tp and tn solution for acc and ppv\n", + "2023-11-04 11:34:20,872:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,873:INFO:the tp solutions: (48.48095605224332, 48.631235988558664)\n", + "2023-11-04 11:34:20,879:INFO:the tn solutions: (250.7201326395527, 251.58013068134997)\n", + "2023-11-04 11:34:20,880:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,881:INFO:evaluating the tp and tn solution for acc and npv\n", + "2023-11-04 11:34:20,883:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,884:INFO:the tp solutions: (43.80386395479962, 44.93079743039423)\n", + "2023-11-04 11:34:20,884:INFO:the tn solutions: (254.97280231946934, 255.70600994264748)\n", + "2023-11-04 11:34:20,885:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,885:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-04 11:34:20,886:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,887:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,887:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,888:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,889:INFO:evaluating the tp and tn solution for sens and bacc\n", + "2023-11-04 11:34:20,890:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,891:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,892:INFO:the tn solutions: (241.90572, 242.13827999999998)\n", + "2023-11-04 11:34:20,893:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,894:INFO:evaluating the tp and tn solution for sens and ppv\n", + "2023-11-04 11:34:20,896:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,897:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,898:INFO:the tn solutions: (241.66176457717626, 242.3445043047098)\n", + "2023-11-04 11:34:20,899:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,899:INFO:evaluating the tp and tn solution for sens and npv\n", + "2023-11-04 11:34:20,900:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,901:INFO:the tp solutions: (51.98362, 52.02238)\n", + "2023-11-04 11:34:20,902:INFO:the tn solutions: (241.81004976234647, 242.0914145898904)\n", + "2023-11-04 11:34:20,902:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,903:INFO:evaluating the tp and tn solution for spec and bacc\n", + "2023-11-04 11:34:20,904:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,904:INFO:the tp solutions: (51.96385999999998, 52.08013999999999)\n", + "2023-11-04 11:34:20,905:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,905:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,906:INFO:evaluating the tp and tn solution for spec and ppv\n", + "2023-11-04 11:34:20,906:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,910:INFO:the tp solutions: (51.96887798976324, 52.0514644732153)\n", + "2023-11-04 11:34:20,912:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,913:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,914:INFO:evaluating the tp and tn solution for spec and npv\n", + "2023-11-04 11:34:20,915:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,915:INFO:the tp solutions: (51.806887743357564, 52.161181422778235)\n", + "2023-11-04 11:34:20,916:INFO:the tn solutions: (241.94523999999998, 242.02276000000003)\n", + "2023-11-04 11:34:20,916:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,917:INFO:evaluating the tp and tn solution for bacc and ppv\n", + "2023-11-04 11:34:20,918:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,919:INFO:the tp solutions: (51.74749695345026, 52.201231144607334)\n", + "2023-11-04 11:34:20,925:INFO:the tn solutions: (240.48623602424024, 243.67941013113506)\n", + "2023-11-04 11:34:20,925:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,926:INFO:evaluating the tp and tn solution for bacc and npv\n", + "2023-11-04 11:34:20,928:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,928:INFO:the tp solutions: (50.094566557959965, 54.50446037762892)\n", + "2023-11-04 11:34:20,929:INFO:the tn solutions: (240.03456529085898, 242.86298504983597)\n", + "2023-11-04 11:34:20,930:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,931:INFO:evaluating the tp and tn solution for ppv and npv\n", + "2023-11-04 11:34:20,932:INFO:intervals before: [], []\n", + "2023-11-04 11:34:20,933:INFO:the tp solutions: (51.74602430527055, 52.37775596084947)\n", + "2023-11-04 11:34:20,934:INFO:the tn solutions: (240.84749951261927, 242.85483520292078)\n", + "2023-11-04 11:34:20,935:INFO:intervals after: [], []\n", + "2023-11-04 11:34:20,939:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-04 11:34:20,940:INFO:no more feasible tp,tn pairs left\n", + "2023-11-04 11:34:20,940:INFO:constructing final tp, tn pair set\n", + "2023-11-04 11:34:20,941:INFO:final number of intervals: 0\n", + "2023-11-04 11:34:20,942:INFO:final number of pairs: 0\n" ] }, { @@ -278,7 +274,7 @@ "True" ] }, - "execution_count": 8, + "execution_count": 9, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb index fec4469..bae0883 100644 --- a/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb +++ b/notebooks/illustration/multiclass/02_check_1_dataset_known_folds_mos_macro.ipynb @@ -18,9 +18,9 @@ { "data": { "text/plain": [ - "({0: 62, 1: 81, 2: 132, 3: 105},\n", - " {'n_folds': 3, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.6132, 'sens': 0.2343, 'spec': 0.7456, 'f1p': 0.2236})" + "({0: 71, 1: 38, 2: 21},\n", + " {'folds': [{0: 24, 1: 13, 2: 7}, {0: 24, 1: 12, 2: 7}, {0: 23, 1: 13, 2: 7}]},\n", + " {'acc': 0.5536, 'sens': 0.3247, 'spec': 0.6544, 'f1p': 0.3063})" ] }, "execution_count": 2, @@ -61,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/0026927817f044f68794b0e423930702-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0026927817f044f68794b0e423930702-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/e602a5cac2494b4b83930f267d731f2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e602a5cac2494b4b83930f267d731f2e-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -118,68 +118,10 @@ "result['inconsistency']" ] }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [ - "#scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "0.8754500000000001" - ] - }, - "execution_count": 14, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "#scores['acc']" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [ - "#scores['acc'] = 0.8745" - ] - }, { "cell_type": "code", "execution_count": 5, "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "{'acc': 0.626, 'sens': 0.2483, 'spec': 0.7509, 'f1p': 0.2469}" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores" - ] - }, - { - "cell_type": "code", - "execution_count": 10, - "metadata": {}, "outputs": [], "source": [ "scores['acc'] = 0.656" @@ -187,7 +129,7 @@ }, { "cell_type": "code", - "execution_count": 11, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -198,7 +140,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/4fdb093f3d764b499205becb67c53562-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fdb093f3d764b499205becb67c53562-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/870a6e1de01f441c8178286af5968aae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/870a6e1de01f441c8178286af5968aae-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -220,7 +162,7 @@ "True" ] }, - "execution_count": 11, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb index e296c26..600b92b 100644 --- a/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb +++ b/notebooks/illustration/multiclass/03_check_1_dataset_known_folds_mos_micro.ipynb @@ -18,9 +18,9 @@ { "data": { "text/plain": [ - "({0: 181, 1: 169, 2: 118},\n", - " {'n_folds': 3, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.5342, 'sens': 0.3013, 'spec': 0.6506, 'f1p': 0.3013})" + "({0: 99, 1: 29, 2: 119},\n", + " {'folds': [{0: 50, 1: 14, 2: 60}, {0: 49, 1: 15, 2: 59}]},\n", + " {'acc': 0.579, 'sens': 0.3685, 'spec': 0.6843, 'f1p': 0.3685})" ] }, "execution_count": 2, @@ -61,7 +61,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a9bbea2e97a44fc0a26ab83a4282952d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a9bbea2e97a44fc0a26ab83a4282952d-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/794c36f09f26415db85a540793d0d103-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/794c36f09f26415db85a540793d0d103-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -105,26 +105,26 @@ "Cgl0003I 0 fixed, 10 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0003I 0 fixed, 4 tightened bounds, 0 strengthened rows, 0 substitutions\n", "Cgl0004I processed model has 3 rows, 4 columns (4 integer (0 of which binary)) and 8 elements\n", - "Cbc0012I Integer solution of 0 found by DiveCoefficient after 18 iterations and 0 nodes (0.02 seconds)\n", + "Cbc0012I Integer solution of 0 found by DiveCoefficient after 18 iterations and 0 nodes (0.01 seconds)\n", "Cbc0031I 2 added rows had average density of 2\n", "Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 33 passes\n", - "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 75 column cuts (75 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 19 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 75 column cuts (75 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 19 row cuts average 2.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 15 row cuts average 2.1 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0001I Search completed - best objective 0, took 18 iterations and 0 nodes (0.02 seconds)\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 15 row cuts average 2.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0001I Search completed - best objective 0, took 18 iterations and 0 nodes (0.01 seconds)\n", "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 33 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 33 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Probing was tried 33 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 33 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "Knapsack was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "Clique was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "MixedIntegerRounding2 was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "FlowCover was tried 33 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 33 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "TwoMirCuts was tried 33 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", @@ -132,11 +132,11 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 0\n", "Total iterations: 18\n", - "Time (CPU seconds): 0.02\n", - "Time (Wallclock seconds): 0.02\n", + "Time (CPU seconds): 0.00\n", + "Time (Wallclock seconds): 0.01\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", + "Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01\n", "\n" ] }, @@ -164,60 +164,13 @@ "execution_count": 5, "metadata": {}, "outputs": [], - "source": [ - "#scores['acc'] = (1.0 + scores['spec']) / 2.0" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "metadata": {}, - "outputs": [], - "source": [ - "#scores['acc']" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [], - "source": [ - "#scores['acc'] = 0.8367" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "{'acc': 0.5646, 'sens': 0.3469, 'spec': 0.6734, 'f1p': 0.3469}" - ] - }, - "execution_count": 7, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores" - ] - }, - { - "cell_type": "code", - "execution_count": 8, - "metadata": {}, - "outputs": [], "source": [ "scores['acc'] = 0.5746" ] }, { "cell_type": "code", - "execution_count": 9, + "execution_count": 6, "metadata": {}, "outputs": [ { @@ -228,7 +181,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/5705aa05247e470281daacd2a5a0c474-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5705aa05247e470281daacd2a5a0c474-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/c519d509ea944541b893c7ab86b8178a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c519d509ea944541b893c7ab86b8178a-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -250,7 +203,7 @@ "True" ] }, - "execution_count": 9, + "execution_count": 6, "metadata": {}, "output_type": "execute_result" } diff --git a/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb index 89cf35e..031e6f1 100644 --- a/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb +++ b/notebooks/illustration/multiclass/04_check_1_dataset_known_folds_som_macro.ipynb @@ -2,7 +2,7 @@ "cells": [ { "cell_type": "code", - "execution_count": 22, + "execution_count": 15, "metadata": {}, "outputs": [], "source": [ @@ -12,23 +12,23 @@ }, { "cell_type": "code", - "execution_count": 23, + "execution_count": 16, "metadata": {}, "outputs": [ { "data": { "text/plain": [ - "({0: 141, 1: 186, 2: 76, 3: 101},\n", - " {'n_folds': 3, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.6255,\n", - " 'sens': 0.2591,\n", - " 'spec': 0.7518,\n", - " 'f1p': 0.2471,\n", + "({0: 26, 1: 167, 2: 72, 3: 156},\n", + " {'n_folds': 3, 'n_repeats': 1, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6211,\n", + " 'sens': 0.2695,\n", + " 'spec': 0.7509,\n", + " 'f1p': 0.2272,\n", " 'beta_positive': 2,\n", " 'beta_negative': 2})" ] }, - "execution_count": 23, + "execution_count": 16, "metadata": {}, "output_type": "execute_result" } @@ -44,7 +44,7 @@ }, { "cell_type": "code", - "execution_count": 24, + "execution_count": 17, "metadata": {}, "outputs": [], "source": [ @@ -55,7 +55,7 @@ }, { "cell_type": "code", - "execution_count": 25, + "execution_count": 18, "metadata": {}, "outputs": [ { @@ -66,7 +66,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/9ffe1098237b4125a1ecde690104c6e2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ffe1098237b4125a1ecde690104c6e2-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/791f13693e8f4b3399949d625fbc3460-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/791f13693e8f4b3399949d625fbc3460-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -81,12 +81,12 @@ "Cbc0031I 4 added rows had average density of 4.5\n", "Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 50 passes\n", "Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 1 (Gomory) - 84 row cuts average 5.2 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 1 (Gomory) - 84 row cuts average 5.2 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", "Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 2.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", - "Cbc0014I Cut generator 6 (TwoMirCuts) - 19 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", + "Cbc0014I Cut generator 6 (TwoMirCuts) - 19 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100\n", "Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.02 seconds)\n", "Cbc0012I Integer solution of 0 found by DiveCoefficient after 68 iterations and 1 nodes (0.02 seconds)\n", "Cbc0001I Search completed - best objective 0, took 68 iterations and 1 nodes (0.02 seconds)\n", @@ -94,12 +94,12 @@ "Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost\n", "Cuts at root node changed objective from 0 to 0\n", "Probing was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 50 times and created 84 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "Gomory was tried 50 times and created 84 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)\n", + "Knapsack was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "Clique was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "MixedIntegerRounding2 was tried 50 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "FlowCover was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 50 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", + "FlowCover was tried 50 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", + "TwoMirCuts was tried 50 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", "\n", "Result - Optimal solution found\n", @@ -107,11 +107,11 @@ "Objective value: 0.00000000\n", "Enumerated nodes: 1\n", "Total iterations: 68\n", - "Time (CPU seconds): 0.01\n", + "Time (CPU seconds): 0.02\n", "Time (Wallclock seconds): 0.02\n", "\n", "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02\n", + "Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02\n", "\n" ] }, @@ -121,7 +121,7 @@ "False" ] }, - "execution_count": 25, + "execution_count": 18, "metadata": {}, "output_type": "execute_result" } @@ -136,36 +136,16 @@ }, { "cell_type": "code", - "execution_count": 26, - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "{'acc': 0.5662, 'sens': 0.3577, 'spec': 0.6767, 'f1p': 0.3481}" - ] - }, - "execution_count": 26, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "scores" - ] - }, - { - "cell_type": "code", - "execution_count": 27, + "execution_count": 19, "metadata": {}, "outputs": [], "source": [ - "scores['acc'] = 0.6662" + "scores['acc'] = 0.6762" ] }, { "cell_type": "code", - "execution_count": 28, + "execution_count": 20, "metadata": {}, "outputs": [ { @@ -176,7 +156,7 @@ "Version: 2.10.3 \n", "Build Date: Dec 15 2019 \n", "\n", - "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/a1921acbb79047d0b66cefa54c902e59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a1921acbb79047d0b66cefa54c902e59-pulp.sol (default strategy 1)\n", + "command line - /home/gykovacs/anaconda3/envs/mlscorecheck/lib/python3.10/site-packages/pulp/solverdir/cbc/linux/64/cbc /tmp/bc4f50ab17ad4604b3b040ce2c6f2a15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc4f50ab17ad4604b3b040ce2c6f2a15-pulp.sol (default strategy 1)\n", "At line 2 NAME MODEL\n", "At line 3 ROWS\n", "At line 11 COLUMNS\n", @@ -198,22441 +178,9 @@ "True" ] }, - "execution_count": 28, + "execution_count": 20, "metadata": {}, "output_type": "execute_result" - }, - { - "name": "stdout", - "output_type": "stream", - "text": [ - "on tree, 1e+50 best solution, best possible 0 (270.34 seconds)\n", - "Cbc0010I After 2898000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (270.51 seconds)\n", - "Cbc0010I After 2899000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (270.65 seconds)\n", - "Cbc0010I After 2900000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (270.76 seconds)\n", - "Cbc0010I After 2901000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (270.83 seconds)\n", - "Cbc0010I After 2902000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (270.90 seconds)\n", - "Cbc0010I After 2903000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (270.98 seconds)\n", - "Cbc0010I After 2904000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (271.08 seconds)\n", - "Cbc0010I After 2905000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (271.17 seconds)\n", - "Cbc0010I After 2906000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (271.26 seconds)\n", - "Cbc0010I After 2907000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (271.36 seconds)\n", - "Cbc0010I After 2908000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (271.43 seconds)\n", - "Cbc0010I After 2909000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (271.50 seconds)\n", - "Cbc0010I After 2910000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (271.57 seconds)\n", - "Cbc0010I After 2911000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (271.65 seconds)\n", - "Cbc0010I After 2912000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (271.75 seconds)\n", - "Cbc0010I After 2913000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (271.87 seconds)\n", - "Cbc0010I After 2914000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (271.94 seconds)\n", - "Cbc0010I After 2915000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (272.02 seconds)\n", - "Cbc0010I After 2916000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (272.13 seconds)\n", - "Cbc0010I After 2917000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (272.22 seconds)\n", - "Cbc0010I After 2918000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (272.35 seconds)\n", - "Cbc0010I After 2919000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (272.53 seconds)\n", - "Cbc0010I After 2920000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (272.64 seconds)\n", - "Cbc0010I After 2921000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (272.83 seconds)\n", - "Cbc0010I After 2922000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (272.99 seconds)\n", - "Cbc0010I After 2923000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (273.10 seconds)\n", - "Cbc0010I After 2924000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (273.20 seconds)\n", - "Cbc0010I After 2925000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (273.29 seconds)\n", - "Cbc0010I After 2926000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (273.43 seconds)\n", - "Cbc0010I After 2927000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (273.57 seconds)\n", - "Cbc0010I After 2928000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (273.73 seconds)\n", - "Cbc0010I After 2929000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (273.89 seconds)\n", - "Cbc0010I After 2930000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (274.02 seconds)\n", - "Cbc0010I After 2931000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (274.12 seconds)\n", - "Cbc0010I After 2932000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (274.23 seconds)\n", - "Cbc0010I After 2933000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (274.33 seconds)\n", - "Cbc0010I After 2934000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (274.45 seconds)\n", - "Cbc0010I After 2935000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (274.54 seconds)\n", - "Cbc0010I After 2936000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (274.64 seconds)\n", - "Cbc0010I After 2937000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (274.73 seconds)\n", - "Cbc0010I After 2938000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (274.80 seconds)\n", - "Cbc0010I After 2939000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (274.8 954 on tree, 1e+50 best solution, best possible 0 (30.83 seconds)\n", - "Cbc0010I After 112000 nodes, 938 on tree, 1e+50 best solution, best possible 0 (30.96 seconds)\n", - "Cbc0010I After 113000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (31.11 seconds)\n", - "Cbc0010I After 114000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (31.24 seconds)\n", - "Cbc0010I After 115000 nodes, 942 on tree, 1e+50 best solution, best possible 0 (31.37 seconds)\n", - "Cbc0010I After 116000 nodes, 949 on tree, 1e+50 best solution, best possible 0 (31.51 seconds)\n", - "Cbc0010I After 117000 nodes, 970 on tree, 1e+50 best solution, best possible 0 (31.69 seconds)\n", - "Cbc0010I After 118000 nodes, 969 on tree, 1e+50 best solution, best possible 0 (31.99 seconds)\n", - "Cbc0010I After 119000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (32.33 seconds)\n", - "Cbc0010I After 120000 nodes, 977 on tree, 1e+50 best solution, best possible 0 (32.56 seconds)\n", - "Cbc0010I After 121000 nodes, 946 on tree, 1e+50 best solution, best possible 0 (32.74 seconds)\n", - "Cbc0010I After 122000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (32.95 seconds)\n", - "Cbc0010I After 123000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (33.22 seconds)\n", - "Cbc0010I After 124000 nodes, 945 on tree, 1e+50 best solution, best possible 0 (33.43 seconds)\n", - "Cbc0010I After 125000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (33.61 seconds)\n", - "Cbc0010I After 126000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (33.77 seconds)\n", - "Cbc0010I After 127000 nodes, 928 on tree, 1e+50 best solution, best possible 0 (33.92 seconds)\n", - "Cbc0010I After 128000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (34.02 seconds)\n", - "Cbc0010I After 129000 nodes, 985 on tree, 1e+50 best solution, best possible 0 (34.13 seconds)\n", - "Cbc0010I After 130000 nodes, 984 on tree, 1e+50 best solution, best possible 0 (34.29 seconds)\n", - "Cbc0010I After 131000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (34.43 seconds)\n", - "Cbc0010I After 132000 nodes, 959 on tree, 1e+50 best solution, best possible 0 (34.63 seconds)\n", - "Cbc0010I After 133000 nodes, 932 on tree, 1e+50 best solution, best possible 0 (34.80 seconds)\n", - "Cbc0010I After 134000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (34.99 seconds)\n", - "Cbc0010I After 135000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (35.15 seconds)\n", - "Cbc0010I After 136000 nodes, 953 on tree, 1e+50 best solution, best possible 0 (35.32 seconds)\n", - "Cbc0010I After 137000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (35.49 seconds)\n", - "Cbc0010I After 138000 nodes, 979 on tree, 1e+50 best solution, best possible 0 (35.62 seconds)\n", - "Cbc0010I After 139000 nodes, 963 on tree, 1e+50 best solution, best possible 0 (35.77 seconds)\n", - "Cbc0010I After 140000 nodes, 974 on tree, 1e+50 best solution, best possible 0 (35.91 seconds)\n", - "Cbc0010I After 141000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (36.04 seconds)\n", - "Cbc0010I After 142000 nodes, 903 on tree, 1e+50 best solution, best possible 0 (36.19 seconds)\n", - "Cbc0010I After 143000 nodes, 924 on tree, 1e+50 best solution, best possible 0 (36.40 seconds)\n", - "Cbc0010I After 144000 nodes, 968 on tree, 1e+50 best solution, best possible 0 (36.65 seconds)\n", - "Cbc0010I After 145000 nodes, 960 on tree, 1e+50 best solution, best possible 0 (36.85 seconds)\n", - "Cbc0010I After 146000 nodes, 942 on tree, 1e+50 best solution, best possible 0 (37.04 seconds)\n", - "Cbc0010I After 147000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (37.20 seconds)\n", - "Cbc0010I After 148000 nodes, 948 on tree, 1e+50 best solution, best possible 0 (37.33 seconds)\n", - "Cbc0010I After 149000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (37.43 seconds)\n", - "Cbc0010I After 150000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (37.54 seconds)\n", - "Cbc0010I After 151000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (37.64 seconds)\n", - "Cbc0010I After 152000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (37.76 seconds)\n", - "Cbc0010I After 153000 nodes, 967 on tree, 1e+50 best solution, best possible 0 (37.90 seconds)\n", - "Cbc0010I After 154000 nodes, 952 on tre9 seconds)\n", - "Cbc0010I After 2940000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (274.97 seconds)\n", - "Cbc0010I After 2941000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (275.04 seconds)\n", - "Cbc0010I After 2942000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (275.12 seconds)\n", - "Cbc0010I After 2943000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (275.19 seconds)\n", - "Cbc0010I After 2944000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (275.26 seconds)\n", - "Cbc0010I After 2945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (275.35 seconds)\n", - "Cbc0010I After 2946000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (275.47 seconds)\n", - "Cbc0010I After 2947000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (275.60 seconds)\n", - "Cbc0010I After 2948000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (275.76 seconds)\n", - "Cbc0010I After 2949000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (275.89 seconds)\n", - "Cbc0010I After 2950000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (276.00 seconds)\n", - "Cbc0010I After 2951000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (276.14 seconds)\n", - "Cbc0010I After 2952000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (276.29 seconds)\n", - "Cbc0010I After 2953000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (276.38 seconds)\n", - "Cbc0010I After 2954000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (276.48 seconds)\n", - "Cbc0010I After 2955000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (276.59 seconds)\n", - "Cbc0010I After 2956000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (276.75 seconds)\n", - "Cbc0010I After 2957000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (276.89 seconds)\n", - "Cbc0010I After 2958000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (277.04 seconds)\n", - "Cbc0010I After 2959000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (277.14 seconds)\n", - "Cbc0010I After 2960000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (277.24 seconds)\n", - "Cbc0010I After 2961000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (277.35 seconds)\n", - "Cbc0010I After 2962000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (277.48 seconds)\n", - "Cbc0010I After 2963000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (277.63 seconds)\n", - "Cbc0010I After 2964000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (277.75 seconds)\n", - "Cbc0010I After 2965000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (277.85 seconds)\n", - "Cbc0010I After 2966000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (277.95 seconds)\n", - "Cbc0010I After 2967000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (278.04 seconds)\n", - "Cbc0010I After 2968000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (278.13 seconds)\n", - "Cbc0010I After 2969000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (278.23 seconds)\n", - "Cbc0010I After 2970000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (278.30 seconds)\n", - "Cbc0010I After 2971000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (278.40 seconds)\n", - "Cbc0010I After 2972000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (278.54 seconds)\n", - "Cbc0010I After 2973000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (278.63 seconds)\n", - "Cbc0010I After 2974000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (278.73 seconds)\n", - "Cbc0010I After 2975000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (278.84 seconds)\n", - "Cbc0010I After 2976000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (278.97 seconds)\n", - "Cbc0010I After 2977000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (279.12 seconds)\n", - "Cbc0010I After 2978000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (279.21 seconds)\n", - "Cbc0010I After 2979000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (279.29 seconds)\n", - "Cbc0010I After 2980000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (279.34 seconds)\n", - "Cbc0010I After 2981000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (279.44 seconds)\n", - "Cbc0010I After 2982000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (279.56 seconds)\n", - "Cbc0010I After 2983000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (279.64 seconds)\n", - "Cbc0010I After 2984000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (279.74 seconds)\n", - "Cbc0010I After 2985000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (279.83 seconds)\n", - "Cbc0010I After 2986000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (279.89 seconds)\n", - "Cbc0010I After 2987000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (280.01 seconds)\n", - "Cbc0010I After 2988000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (280.13 seconds)\n", - "Cbc0010I After 2989000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (280.26 seconds)\n", - "Cbc0010I After 2990000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (280.34 seconds)\n", - "Cbc0010I After 2991000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (280.42 seconds)\n", - "Cbc0010I After 2992000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (280.48 seconds)\n", - "Cbc0010I After 2993000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (280.55 seconds)\n", - "Cbc0010I After 2994000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (280.63 seconds)\n", - "Cbc0010I After 2995000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (280.70 seconds)\n", - "Cbc0010I After 2996000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (280.85 seconds)\n", - "Cbc0010I After 2997000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (281.04 seconds)\n", - "Cbc0010I After 2998000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (281.29 seconds)\n", - "Cbc0010I After 2999000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (281.53 seconds)\n", - "Cbc0010I After 3000000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (281.75 seconds)\n", - "Cbc0010I After 3001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (281.90 seconds)\n", - "Cbc0010I After 3002000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (282.02 seconds)\n", - "Cbc0010I After 3003000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (282.15 seconds)\n", - "Cbc0010I After 3004000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (282.24 seconds)\n", - "Cbc0010I After 3005000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (282.30 seconds)\n", - "Cbc0010I After 3006000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (282.37 seconds)\n", - "Cbc0010I After 3007000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (282.44 seconds)\n", - "Cbc0010I After 3008000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (282.49 seconds)\n", - "Cbc0010I After 3009000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (282.55 seconds)\n", - "Cbc0010I After 3010000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (282.60 seconds)\n", - "Cbc0010I After 3011000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (282.66 seconds)\n", - "Cbc0010I After 3012000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (282.72 seconds)\n", - "Cbc0010I After 3013000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (282.79 seconds)\n", - "Cbc0010I After 3014000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (282.87 seconds)\n", - "Cbc0010I After 3015000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (282.95 seconds)\n", - "Cbc0010I After 3016000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (283.04 seconds)\n", - "Cbc0010I After 3017000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (283.15 seconds)\n", - "Cbc0010I After 3018000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (283.22 seconds)\n", - "Cbc0010I After 3019000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (283.36 seconds)\n", - "Cbc0010I After 3020000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (283.53 seconds)\n", - "Cbc0010I After 3021000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (283.66 seconds)\n", - "Cbc0010I After 3022000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (283.80 seconds)\n", - "Cbc0010I After 3023000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (283.95 seconds)\n", - "Cbc0010I After 3024000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (284.07 see, 1e+50 best solution, best possible 0 (38.05 seconds)\n", - "Cbc0010I After 155000 nodes, 963 on tree, 1e+50 best solution, best possible 0 (38.22 seconds)\n", - "Cbc0010I After 156000 nodes, 931 on tree, 1e+50 best solution, best possible 0 (38.39 seconds)\n", - "Cbc0010I After 157000 nodes, 929 on tree, 1e+50 best solution, best possible 0 (38.55 seconds)\n", - "Cbc0010I After 158000 nodes, 913 on tree, 1e+50 best solution, best possible 0 (38.71 seconds)\n", - "Cbc0010I After 159000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (38.85 seconds)\n", - "Cbc0010I After 160000 nodes, 874 on tree, 1e+50 best solution, best possible 0 (39.03 seconds)\n", - "Cbc0010I After 161000 nodes, 983 on tree, 1e+50 best solution, best possible 0 (39.21 seconds)\n", - "Cbc0010I After 162000 nodes, 973 on tree, 1e+50 best solution, best possible 0 (39.37 seconds)\n", - "Cbc0010I After 163000 nodes, 962 on tree, 1e+50 best solution, best possible 0 (39.53 seconds)\n", - "Cbc0010I After 164000 nodes, 938 on tree, 1e+50 best solution, best possible 0 (39.66 seconds)\n", - "Cbc0010I After 165000 nodes, 921 on tree, 1e+50 best solution, best possible 0 (39.79 seconds)\n", - "Cbc0010I After 166000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (39.92 seconds)\n", - "Cbc0010I After 167000 nodes, 933 on tree, 1e+50 best solution, best possible 0 (40.07 seconds)\n", - "Cbc0010I After 168000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (40.21 seconds)\n", - "Cbc0010I After 169000 nodes, 960 on tree, 1e+50 best solution, best possible 0 (40.36 seconds)\n", - "Cbc0010I After 170000 nodes, 964 on tree, 1e+50 best solution, best possible 0 (40.50 seconds)\n", - "Cbc0010I After 171000 nodes, 920 on tree, 1e+50 best solution, best possible 0 (40.70 seconds)\n", - "Cbc0010I After 172000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (40.92 seconds)\n", - "Cbc0010I After 173000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (41.14 seconds)\n", - "Cbc0010I After 174000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (41.30 seconds)\n", - "Cbc0010I After 175000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (41.43 seconds)\n", - "Cbc0010I After 176000 nodes, 919 on tree, 1e+50 best solution, best possible 0 (41.56 seconds)\n", - "Cbc0010I After 177000 nodes, 921 on tree, 1e+50 best solution, best possible 0 (41.69 seconds)\n", - "Cbc0010I After 178000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (41.82 seconds)\n", - "Cbc0010I After 179000 nodes, 925 on tree, 1e+50 best solution, best possible 0 (41.96 seconds)\n", - "Cbc0010I After 180000 nodes, 957 on tree, 1e+50 best solution, best possible 0 (42.07 seconds)\n", - "Cbc0010I After 181000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (42.19 seconds)\n", - "Cbc0010I After 182000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (42.31 seconds)\n", - "Cbc0010I After 183000 nodes, 896 on tree, 1e+50 best solution, best possible 0 (42.42 seconds)\n", - "Cbc0010I After 184000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (42.54 seconds)\n", - "Cbc0010I After 185000 nodes, 906 on tree, 1e+50 best solution, best possible 0 (42.70 seconds)\n", - "Cbc0010I After 186000 nodes, 885 on tree, 1e+50 best solution, best possible 0 (42.85 seconds)\n", - "Cbc0010I After 187000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (43.04 seconds)\n", - "Cbc0010I After 188000 nodes, 918 on tree, 1e+50 best solution, best possible 0 (43.19 seconds)\n", - "Cbc0010I After 189000 nodes, 941 on tree, 1e+50 best solution, best possible 0 (43.33 seconds)\n", - "Cbc0010I After 190000 nodes, 933 on tree, 1e+50 best solution, best possible 0 (43.47 seconds)\n", - "Cbc0010I After 191000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (43.59 seconds)\n", - "Cbc0010I After 192000 nodes, 943 on tree, 1e+50 best solution, best possible 0 (43.70 seconds)\n", - "Cbc0010I After 193000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (43.84 seconds)\n", - "Cbc0010I After 194000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (43.97 seconds)\n", - "Cbc0010I After 195000 nodes, 917 on tree, 1e+50 best solution, best possible 0 (44.13 seconds)\n", - "Cbc0010I After 196000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (44.33 seconds)\n", - "Cbc0010I After 197000 nodes, 917 on tree, 1e+50 beconds)\n", - "Cbc0010I After 3025000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (284.17 seconds)\n", - "Cbc0010I After 3026000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (284.30 seconds)\n", - "Cbc0010I After 3027000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (284.38 seconds)\n", - "Cbc0010I After 3028000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (284.48 seconds)\n", - "Cbc0010I After 3029000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (284.63 seconds)\n", - "Cbc0010I After 3030000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (284.83 seconds)\n", - "Cbc0010I After 3031000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (285.01 seconds)\n", - "Cbc0010I After 3032000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (285.19 seconds)\n", - "Cbc0010I After 3033000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (285.35 seconds)\n", - "Cbc0010I After 3034000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (285.55 seconds)\n", - "Cbc0010I After 3035000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (285.69 seconds)\n", - "Cbc0010I After 3036000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (285.81 seconds)\n", - "Cbc0010I After 3037000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (285.95 seconds)\n", - "Cbc0010I After 3038000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (286.08 seconds)\n", - "Cbc0010I After 3039000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (286.22 seconds)\n", - "Cbc0010I After 3040000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (286.37 seconds)\n", - "Cbc0010I After 3041000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (286.53 seconds)\n", - "Cbc0010I After 3042000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (286.62 seconds)\n", - "Cbc0010I After 3043000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (286.71 seconds)\n", - "Cbc0010I After 3044000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (286.80 seconds)\n", - "Cbc0010I After 3045000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (286.94 seconds)\n", - "Cbc0010I After 3046000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (287.09 seconds)\n", - "Cbc0010I After 3047000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (287.22 seconds)\n", - "Cbc0010I After 3048000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (287.40 seconds)\n", - "Cbc0010I After 3049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (287.60 seconds)\n", - "Cbc0010I After 3050000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (287.80 seconds)\n", - "Cbc0010I After 3051000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (287.94 seconds)\n", - "Cbc0010I After 3052000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (288.07 seconds)\n", - "Cbc0010I After 3053000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (288.21 seconds)\n", - "Cbc0010I After 3054000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (288.33 seconds)\n", - "Cbc0010I After 3055000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (288.48 seconds)\n", - "Cbc0010I After 3056000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (288.66 seconds)\n", - "Cbc0010I After 3057000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (288.83 seconds)\n", - "Cbc0010I After 3058000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (289.09 seconds)\n", - "Cbc0010I After 3059000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (289.25 seconds)\n", - "Cbc0010I After 3060000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (289.47 seconds)\n", - "Cbc0010I After 3061000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (289.62 seconds)\n", - "Cbc0010I After 3062000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (289.75 seconds)\n", - "Cbc0010I After 3063000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (289.92 seconds)\n", - "Cbc0010I After 3064000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (290.03 seconds)\n", - "Cbc0010I After 3065000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (290.14 seconds)\n", - "Cbc0010I After 3066000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (290.23 seconds)\n", - "Cbc0010I After 3067000 nodes, 94 on tree, 1e+50st solution, best possible 0 (44.49 seconds)\n", - "Cbc0010I After 198000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (44.67 seconds)\n", - "Cbc0010I After 199000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (44.84 seconds)\n", - "Cbc0010I After 200000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (45.03 seconds)\n", - "Cbc0010I After 201000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (45.22 seconds)\n", - "Cbc0010I After 202000 nodes, 939 on tree, 1e+50 best solution, best possible 0 (45.38 seconds)\n", - "Cbc0010I After 203000 nodes, 916 on tree, 1e+50 best solution, best possible 0 (45.57 seconds)\n", - "Cbc0010I After 204000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (45.79 seconds)\n", - "Cbc0010I After 205000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (46.02 seconds)\n", - "Cbc0010I After 206000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (46.17 seconds)\n", - "Cbc0010I After 207000 nodes, 974 on tree, 1e+50 best solution, best possible 0 (46.31 seconds)\n", - "Cbc0010I After 208000 nodes, 936 on tree, 1e+50 best solution, best possible 0 (46.45 seconds)\n", - "Cbc0010I After 209000 nodes, 940 on tree, 1e+50 best solution, best possible 0 (46.60 seconds)\n", - "Cbc0010I After 210000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (46.74 seconds)\n", - "Cbc0010I After 211000 nodes, 894 on tree, 1e+50 best solution, best possible 0 (46.85 seconds)\n", - "Cbc0010I After 212000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (47.04 seconds)\n", - "Cbc0010I After 213000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (47.19 seconds)\n", - "Cbc0010I After 214000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (47.34 seconds)\n", - "Cbc0010I After 215000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (47.49 seconds)\n", - "Cbc0010I After 216000 nodes, 976 on tree, 1e+50 best solution, best possible 0 (47.66 seconds)\n", - "Cbc0010I After 217000 nodes, 954 on tree, 1e+50 best solution, best possible 0 (47.78 seconds)\n", - "Cbc0010I After 218000 nodes, 936 on tree, 1e+50 best solution, best possible 0 (47.92 seconds)\n", - "Cbc0010I After 219000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (48.09 seconds)\n", - "Cbc0010I After 220000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (48.25 seconds)\n", - "Cbc0010I After 221000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (48.45 seconds)\n", - "Cbc0010I After 222000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (48.67 seconds)\n", - "Cbc0010I After 223000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (48.87 seconds)\n", - "Cbc0010I After 224000 nodes, 908 on tree, 1e+50 best solution, best possible 0 (49.10 seconds)\n", - "Cbc0010I After 225000 nodes, 971 on tree, 1e+50 best solution, best possible 0 (49.29 seconds)\n", - "Cbc0010I After 226000 nodes, 953 on tree, 1e+50 best solution, best possible 0 (49.48 seconds)\n", - "Cbc0010I After 227000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (49.66 seconds)\n", - "Cbc0010I After 228000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (49.77 seconds)\n", - "Cbc0010I After 229000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (49.89 seconds)\n", - "Cbc0010I After 230000 nodes, 903 on tree, 1e+50 best solution, best possible 0 (50.02 seconds)\n", - "Cbc0010I After 231000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (50.14 seconds)\n", - "Cbc0010I After 232000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (50.26 seconds)\n", - "Cbc0010I After 233000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (50.37 seconds)\n", - "Cbc0010I After 234000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (50.56 seconds)\n", - "Cbc0010I After 235000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (50.78 seconds)\n", - "Cbc0010I After 236000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (50.96 seconds)\n", - "Cbc0010I After 237000 nodes, 969 on tree, 1e+50 best solution, best possible 0 (51.20 seconds)\n", - "Cbc0010I After 238000 nodes, 950 on tree, 1e+50 best solution, best possible 0 (51.39 seconds)\n", - "Cbc0010I After 239000 nodes, 935 on tree, 1e+50 best solution, best possible 0 (51.63 seconds)\n", - "Cbc0010I After 240000 nodes, 921 on tree, 1e+50 best solution best solution, best possible 0 (290.32 seconds)\n", - "Cbc0010I After 3068000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (290.43 seconds)\n", - "Cbc0010I After 3069000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (290.50 seconds)\n", - "Cbc0010I After 3070000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (290.60 seconds)\n", - "Cbc0010I After 3071000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (290.72 seconds)\n", - "Cbc0010I After 3072000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (290.84 seconds)\n", - "Cbc0010I After 3073000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (290.99 seconds)\n", - "Cbc0010I After 3074000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (291.11 seconds)\n", - "Cbc0010I After 3075000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (291.23 seconds)\n", - "Cbc0010I After 3076000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (291.32 seconds)\n", - "Cbc0010I After 3077000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (291.41 seconds)\n", - "Cbc0010I After 3078000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (291.53 seconds)\n", - "Cbc0010I After 3079000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (291.68 seconds)\n", - "Cbc0010I After 3080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (291.82 seconds)\n", - "Cbc0010I After 3081000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (292.01 seconds)\n", - "Cbc0010I After 3082000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (292.17 seconds)\n", - "Cbc0010I After 3083000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (292.34 seconds)\n", - "Cbc0010I After 3084000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (292.52 seconds)\n", - "Cbc0010I After 3085000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (292.68 seconds)\n", - "Cbc0010I After 3086000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (292.82 seconds)\n", - "Cbc0010I After 3087000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (292.96 seconds)\n", - "Cbc0010I After 3088000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (293.11 seconds)\n", - "Cbc0010I After 3089000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (293.24 seconds)\n", - "Cbc0010I After 3090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (293.41 seconds)\n", - "Cbc0010I After 3091000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.49 seconds)\n", - "Cbc0010I After 3092000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.56 seconds)\n", - "Cbc0010I After 3093000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (293.62 seconds)\n", - "Cbc0010I After 3094000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.71 seconds)\n", - "Cbc0010I After 3095000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (293.76 seconds)\n", - "Cbc0010I After 3096000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.81 seconds)\n", - "Cbc0010I After 3097000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (293.86 seconds)\n", - "Cbc0010I After 3098000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (293.91 seconds)\n", - "Cbc0010I After 3099000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (293.97 seconds)\n", - "Cbc0010I After 3100000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (294.01 seconds)\n", - "Cbc0010I After 3101000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (294.07 seconds)\n", - "Cbc0010I After 3102000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.11 seconds)\n", - "Cbc0010I After 3103000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (294.22 seconds)\n", - "Cbc0010I After 3104000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (294.31 seconds)\n", - "Cbc0010I After 3105000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (294.38 seconds)\n", - "Cbc0010I After 3106000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.45 seconds)\n", - "Cbc0010I After 3107000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (294.52 seconds)\n", - "Cbc0010I After 3108000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (294.58 seconds)\n", - "Cbc0010I After 3109000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (294.77 seconds)\n", - "Cbc0010I After 3110000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (294.90 seconds)\n", - "Cbc0010I After 3111000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (295.07 seconds)\n", - "Cbc0010I After 3112000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (295.27 seconds)\n", - "Cbc0010I After 3113000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (295.42 seconds)\n", - "Cbc0010I After 3114000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (295.52 seconds)\n", - "Cbc0010I After 3115000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (295.63 seconds)\n", - "Cbc0010I After 3116000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (295.78 seconds)\n", - "Cbc0010I After 3117000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (295.90 seconds)\n", - "Cbc0010I After 3118000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (295.98 seconds)\n", - "Cbc0010I After 3119000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (296.07 seconds)\n", - "Cbc0010I After 3120000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (296.19 seconds)\n", - "Cbc0010I After 3121000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (296.30 seconds)\n", - "Cbc0010I After 3122000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (296.40 seconds)\n", - "Cbc0010I After 3123000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (296.54 seconds)\n", - "Cbc0010I After 3124000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (296.62 seconds)\n", - "Cbc0010I After 3125000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (296.72 seconds)\n", - "Cbc0010I After 3126000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (296.87 seconds)\n", - "Cbc0010I After 3127000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (296.99 seconds)\n", - "Cbc0010I After 3128000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (297.15 seconds)\n", - "Cbc0010I After 3129000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (297.23 seconds)\n", - "Cbc0010I After 3130000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (297.32 seconds)\n", - "Cbc0010I After 3131000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (297.39 seconds)\n", - "Cbc0010I After 3132000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (297.49 seconds)\n", - "Cbc0010I After 3133000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (297.58 seconds)\n", - "Cbc0010I After 3134000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (297.65 seconds)\n", - "Cbc0010I After 3135000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (297.74 seconds)\n", - "Cbc0010I After 3136000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (297.89 seconds)\n", - "Cbc0010I After 3137000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (298.01 seconds)\n", - "Cbc0010I After 3138000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (298.08 seconds)\n", - "Cbc0010I After 3139000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (298.13 seconds)\n", - "Cbc0010I After 3140000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (298.24 seconds)\n", - "Cbc0010I After 3141000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (298.32 seconds)\n", - "Cbc0010I After 3142000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (298.43 seconds)\n", - "Cbc0010I After 3143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (298.55 seconds)\n", - "Cbc0010I After 3144000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (298.63 seconds)\n", - "Cbc0010I After 3145000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (298.72 seconds)\n", - "Cbc0010I After 3146000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (298.79 seconds)\n", - "Cbc0010I After 3147000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (298.86 seconds)\n", - "Cbc0010I After 3148000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (298.93 seconds)\n", - "Cbc0010I After 3149000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (299.00 seconds)\n", - "Cbc0010I After 3150000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (299.08 seconds)\n", - "Cbc0010I After 3151000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (299.17 seconds)\n", - "Cbc0010I After 3152000 nodes, 103 on tree, 1e+50 best s, best possible 0 (51.82 seconds)\n", - "Cbc0010I After 241000 nodes, 907 on tree, 1e+50 best solution, best possible 0 (51.98 seconds)\n", - "Cbc0010I After 242000 nodes, 882 on tree, 1e+50 best solution, best possible 0 (52.21 seconds)\n", - "Cbc0010I After 243000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (52.41 seconds)\n", - "Cbc0010I After 244000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (52.57 seconds)\n", - "Cbc0010I After 245000 nodes, 949 on tree, 1e+50 best solution, best possible 0 (52.73 seconds)\n", - "Cbc0010I After 246000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (52.87 seconds)\n", - "Cbc0010I After 247000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (52.97 seconds)\n", - "Cbc0010I After 248000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (53.07 seconds)\n", - "Cbc0010I After 249000 nodes, 882 on tree, 1e+50 best solution, best possible 0 (53.22 seconds)\n", - "Cbc0010I After 250000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (53.32 seconds)\n", - "Cbc0010I After 251000 nodes, 871 on tree, 1e+50 best solution, best possible 0 (53.41 seconds)\n", - "Cbc0010I After 252000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (53.51 seconds)\n", - "Cbc0010I After 253000 nodes, 930 on tree, 1e+50 best solution, best possible 0 (53.60 seconds)\n", - "Cbc0010I After 254000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (53.69 seconds)\n", - "Cbc0010I After 255000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (53.82 seconds)\n", - "Cbc0010I After 256000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (53.94 seconds)\n", - "Cbc0010I After 257000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (54.06 seconds)\n", - "Cbc0010I After 258000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (54.25 seconds)\n", - "Cbc0010I After 259000 nodes, 879 on tree, 1e+50 best solution, best possible 0 (54.42 seconds)\n", - "Cbc0010I After 260000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (54.60 seconds)\n", - "Cbc0010I After 261000 nodes, 951 on tree, 1e+50 best solution, best possible 0 (54.84 seconds)\n", - "Cbc0010I After 262000 nodes, 937 on tree, 1e+50 best solution, best possible 0 (55.07 seconds)\n", - "Cbc0010I After 263000 nodes, 918 on tree, 1e+50 best solution, best possible 0 (55.32 seconds)\n", - "Cbc0010I After 264000 nodes, 928 on tree, 1e+50 best solution, best possible 0 (55.54 seconds)\n", - "Cbc0010I After 265000 nodes, 896 on tree, 1e+50 best solution, best possible 0 (55.79 seconds)\n", - "Cbc0010I After 266000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (55.99 seconds)\n", - "Cbc0010I After 267000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (56.22 seconds)\n", - "Cbc0010I After 268000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (56.40 seconds)\n", - "Cbc0010I After 269000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (56.58 seconds)\n", - "Cbc0010I After 270000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (56.81 seconds)\n", - "Cbc0010I After 271000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (56.96 seconds)\n", - "Cbc0010I After 272000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (57.09 seconds)\n", - "Cbc0010I After 273000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (57.29 seconds)\n", - "Cbc0010I After 274000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (57.50 seconds)\n", - "Cbc0010I After 275000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (57.69 seconds)\n", - "Cbc0010I After 276000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (57.86 seconds)\n", - "Cbc0010I After 277000 nodes, 894 on tree, 1e+50 best solution, best possible 0 (58.03 seconds)\n", - "Cbc0010I After 278000 nodes, 862 on tree, 1e+50 best solution, best possible 0 (58.25 seconds)\n", - "Cbc0010I After 279000 nodes, 915 on tree, 1e+50 best solution, best possible 0 (58.44 seconds)\n", - "Cbc0010I After 280000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (58.65 seconds)\n", - "Cbc0010I After 281000 nodes, 851 on tree, 1e+50 best solution, best possible 0 (58.83 seconds)\n", - "Cbc0010I After 282000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (59.12 seconds)\n", - "Cbc0010I After 283000 nodes, 855 on tree, 1e+50 best solution, best possolution, best possible 0 (299.26 seconds)\n", - "Cbc0010I After 3153000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (299.35 seconds)\n", - "Cbc0010I After 3154000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (299.52 seconds)\n", - "Cbc0010I After 3155000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (299.69 seconds)\n", - "Cbc0010I After 3156000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (299.79 seconds)\n", - "Cbc0010I After 3157000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (299.93 seconds)\n", - "Cbc0010I After 3158000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (300.11 seconds)\n", - "Cbc0010I After 3159000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (300.19 seconds)\n", - "Cbc0010I After 3160000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (300.26 seconds)\n", - "Cbc0010I After 3161000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (300.39 seconds)\n", - "Cbc0010I After 3162000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (300.53 seconds)\n", - "Cbc0010I After 3163000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (300.65 seconds)\n", - "Cbc0010I After 3164000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (300.79 seconds)\n", - "Cbc0010I After 3165000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (300.95 seconds)\n", - "Cbc0010I After 3166000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (301.07 seconds)\n", - "Cbc0010I After 3167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (301.19 seconds)\n", - "Cbc0010I After 3168000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (301.31 seconds)\n", - "Cbc0010I After 3169000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (301.40 seconds)\n", - "Cbc0010I After 3170000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (301.48 seconds)\n", - "Cbc0010I After 3171000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (301.56 seconds)\n", - "Cbc0010I After 3172000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (301.67 seconds)\n", - "Cbc0010I After 3173000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (301.76 seconds)\n", - "Cbc0010I After 3174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (301.84 seconds)\n", - "Cbc0010I After 3175000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (302.01 seconds)\n", - "Cbc0010I After 3176000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (302.12 seconds)\n", - "Cbc0010I After 3177000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (302.25 seconds)\n", - "Cbc0010I After 3178000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (302.37 seconds)\n", - "Cbc0010I After 3179000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (302.46 seconds)\n", - "Cbc0010I After 3180000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (302.55 seconds)\n", - "Cbc0010I After 3181000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (302.65 seconds)\n", - "Cbc0010I After 3182000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (302.73 seconds)\n", - "Cbc0010I After 3183000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (302.80 seconds)\n", - "Cbc0010I After 3184000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (302.96 seconds)\n", - "Cbc0010I After 3185000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (303.10 seconds)\n", - "Cbc0010I After 3186000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (303.23 seconds)\n", - "Cbc0010I After 3187000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (303.32 seconds)\n", - "Cbc0010I After 3188000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (303.41 seconds)\n", - "Cbc0010I After 3189000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (303.48 seconds)\n", - "Cbc0010I After 3190000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (303.59 seconds)\n", - "Cbc0010I After 3191000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (303.68 seconds)\n", - "Cbc0010I After 3192000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (303.79 seconds)\n", - "Cbc0010I After 3193000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (303.89 seconds)\n", - "Cbc0010I After 3194000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (303.97 seconds)\n", - "Cbc0010I After 3195000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (304.07 seconds)\n", - "Cbc0010I After 3196000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (304.17 seconds)\n", - "Cbc0010I After 3197000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (304.46 seconds)\n", - "Cbc0010I After 3198000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (304.63 seconds)\n", - "Cbc0010I After 3199000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (304.87 seconds)\n", - "Cbc0010I After 3200000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (305.08 seconds)\n", - "Cbc0010I After 3201000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (305.34 seconds)\n", - "Cbc0010I After 3202000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (305.56 seconds)\n", - "Cbc0010I After 3203000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (305.92 seconds)\n", - "Cbc0010I After 3204000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (306.40 seconds)\n", - "Cbc0010I After 3205000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (306.54 seconds)\n", - "Cbc0010I After 3206000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (306.66 seconds)\n", - "Cbc0010I After 3207000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (306.79 seconds)\n", - "Cbc0010I After 3208000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (306.92 seconds)\n", - "Cbc0010I After 3209000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (307.10 seconds)\n", - "Cbc0010I After 3210000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (307.21 seconds)\n", - "Cbc0010I After 3211000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (307.32 seconds)\n", - "Cbc0010I After 3212000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (307.41 seconds)\n", - "Cbc0010I After 3213000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (307.52 seconds)\n", - "Cbc0010I After 3214000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (307.61 seconds)\n", - "Cbc0010I After 3215000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (307.72 seconds)\n", - "Cbc0010I After 3216000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (307.89 seconds)\n", - "Cbc0010I After 3217000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (308.05 seconds)\n", - "Cbc0010I After 3218000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (308.18 seconds)\n", - "Cbc0010I After 3219000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (308.32 seconds)\n", - "Cbc0010I After 3220000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (308.68 seconds)\n", - "Cbc0010I After 3221000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (308.93 seconds)\n", - "Cbc0010I After 3222000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (309.12 seconds)\n", - "Cbc0010I After 3223000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (309.32 seconds)\n", - "Cbc0010I After 3224000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (309.53 seconds)\n", - "Cbc0010I After 3225000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (309.71 seconds)\n", - "Cbc0010I After 3226000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (309.90 seconds)\n", - "Cbc0010I After 3227000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.12 seconds)\n", - "Cbc0010I After 3228000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.30 seconds)\n", - "Cbc0010I After 3229000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (310.53 seconds)\n", - "Cbc0010I After 3230000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (310.71 seconds)\n", - "Cbc0010I After 3231000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (310.85 seconds)\n", - "Cbc0010I After 3232000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (311.03 seconds)\n", - "Cbc0010I After 3233000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (311.22 seconds)\n", - "Cbc0010I After 3234000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (311.39 seconds)\n", - "Cbc0010I After 3235000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (311.54 seconds)\n", - "Cbc0010I After 3236000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (311.73 seconds)\n", - "Cbc0010I After 3237000 nodes, 80 on tree, 1e+50 best solution,ible 0 (59.36 seconds)\n", - "Cbc0010I After 284000 nodes, 870 on tree, 1e+50 best solution, best possible 0 (59.51 seconds)\n", - "Cbc0010I After 285000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (59.69 seconds)\n", - "Cbc0010I After 286000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (59.82 seconds)\n", - "Cbc0010I After 287000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (59.96 seconds)\n", - "Cbc0010I After 288000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (60.13 seconds)\n", - "Cbc0010I After 289000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (60.45 seconds)\n", - "Cbc0010I After 290000 nodes, 883 on tree, 1e+50 best solution, best possible 0 (60.77 seconds)\n", - "Cbc0010I After 291000 nodes, 827 on tree, 1e+50 best solution, best possible 0 (61.02 seconds)\n", - "Cbc0010I After 292000 nodes, 870 on tree, 1e+50 best solution, best possible 0 (61.31 seconds)\n", - "Cbc0010I After 293000 nodes, 917 on tree, 1e+50 best solution, best possible 0 (61.61 seconds)\n", - "Cbc0010I After 294000 nodes, 878 on tree, 1e+50 best solution, best possible 0 (61.94 seconds)\n", - "Cbc0010I After 295000 nodes, 877 on tree, 1e+50 best solution, best possible 0 (62.21 seconds)\n", - "Cbc0010I After 296000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (62.43 seconds)\n", - "Cbc0010I After 297000 nodes, 935 on tree, 1e+50 best solution, best possible 0 (62.63 seconds)\n", - "Cbc0010I After 298000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (62.83 seconds)\n", - "Cbc0010I After 299000 nodes, 912 on tree, 1e+50 best solution, best possible 0 (63.06 seconds)\n", - "Cbc0010I After 300000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (63.31 seconds)\n", - "Cbc0010I After 301000 nodes, 905 on tree, 1e+50 best solution, best possible 0 (63.58 seconds)\n", - "Cbc0010I After 302000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (63.91 seconds)\n", - "Cbc0010I After 303000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (64.40 seconds)\n", - "Cbc0010I After 304000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (64.93 seconds)\n", - "Cbc0010I After 305000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (65.39 seconds)\n", - "Cbc0010I After 306000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (65.89 seconds)\n", - "Cbc0010I After 307000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (66.26 seconds)\n", - "Cbc0010I After 308000 nodes, 923 on tree, 1e+50 best solution, best possible 0 (66.62 seconds)\n", - "Cbc0010I After 309000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (66.91 seconds)\n", - "Cbc0010I After 310000 nodes, 873 on tree, 1e+50 best solution, best possible 0 (67.20 seconds)\n", - "Cbc0010I After 311000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (67.67 seconds)\n", - "Cbc0010I After 312000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (68.15 seconds)\n", - "Cbc0010I After 313000 nodes, 822 on tree, 1e+50 best solution, best possible 0 (68.53 seconds)\n", - "Cbc0010I After 314000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (68.87 seconds)\n", - "Cbc0010I After 315000 nodes, 841 on tree, 1e+50 best solution, best possible 0 (69.17 seconds)\n", - "Cbc0010I After 316000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (69.46 seconds)\n", - "Cbc0010I After 317000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (69.75 seconds)\n", - "Cbc0010I After 318000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (70.04 seconds)\n", - "Cbc0010I After 319000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (70.33 seconds)\n", - "Cbc0010I After 320000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (70.59 seconds)\n", - "Cbc0010I After 321000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (70.87 seconds)\n", - "Cbc0010I After 322000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (71.06 seconds)\n", - "Cbc0010I After 323000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (71.33 seconds)\n", - "Cbc0010I After 324000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (71.61 seconds)\n", - "Cbc0010I After 325000 nodes, 868 on tree, 1e+50 best solution, best possible 0 (71.89 seconds)\n", - "Cbc0010I After 326000 nodes, 909 on tree, 1e+50 best solution, best possible 0 (72. best possible 0 (311.97 seconds)\n", - "Cbc0010I After 3238000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (312.14 seconds)\n", - "Cbc0010I After 3239000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (312.30 seconds)\n", - "Cbc0010I After 3240000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (312.46 seconds)\n", - "Cbc0010I After 3241000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (312.66 seconds)\n", - "Cbc0010I After 3242000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (312.89 seconds)\n", - "Cbc0010I After 3243000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (313.15 seconds)\n", - "Cbc0010I After 3244000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (313.38 seconds)\n", - "Cbc0010I After 3245000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (313.55 seconds)\n", - "Cbc0010I After 3246000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (313.68 seconds)\n", - "Cbc0010I After 3247000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (313.78 seconds)\n", - "Cbc0010I After 3248000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (313.87 seconds)\n", - "Cbc0010I After 3249000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (313.94 seconds)\n", - "Cbc0010I After 3250000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (314.04 seconds)\n", - "Cbc0010I After 3251000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (314.13 seconds)\n", - "Cbc0010I After 3252000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (314.21 seconds)\n", - "Cbc0010I After 3253000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (314.27 seconds)\n", - "Cbc0010I After 3254000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (314.34 seconds)\n", - "Cbc0010I After 3255000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (314.42 seconds)\n", - "Cbc0010I After 3256000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (314.56 seconds)\n", - "Cbc0010I After 3257000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (314.77 seconds)\n", - "Cbc0010I After 3258000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (314.85 seconds)\n", - "Cbc0010I After 3259000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (314.92 seconds)\n", - "Cbc0010I After 3260000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (315.07 seconds)\n", - "Cbc0010I After 3261000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (315.21 seconds)\n", - "Cbc0010I After 3262000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (315.42 seconds)\n", - "Cbc0010I After 3263000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (315.60 seconds)\n", - "Cbc0010I After 3264000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (315.76 seconds)\n", - "Cbc0010I After 3265000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (315.92 seconds)\n", - "Cbc0010I After 3266000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (316.07 seconds)\n", - "Cbc0010I After 3267000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (316.20 seconds)\n", - "Cbc0010I After 3268000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (316.34 seconds)\n", - "Cbc0010I After 3269000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (316.46 seconds)\n", - "Cbc0010I After 3270000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (316.55 seconds)\n", - "Cbc0010I After 3271000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (316.65 seconds)\n", - "Cbc0010I After 3272000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (316.78 seconds)\n", - "Cbc0010I After 3273000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (316.90 seconds)\n", - "Cbc0010I After 3274000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (317.03 seconds)\n", - "Cbc0010I After 3275000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (317.18 seconds)\n", - "Cbc0010I After 3276000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.32 seconds)\n", - "Cbc0010I After 3277000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (317.45 seconds)\n", - "Cbc0010I After 3278000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.51 seconds)\n", - "Cbc0010I After 3279000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (317.59 seconds)\n", - "Cbc0010I After16 seconds)\n", - "Cbc0010I After 327000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (72.49 seconds)\n", - "Cbc0010I After 328000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (72.82 seconds)\n", - "Cbc0010I After 329000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (73.12 seconds)\n", - "Cbc0010I After 330000 nodes, 913 on tree, 1e+50 best solution, best possible 0 (73.32 seconds)\n", - "Cbc0010I After 331000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (73.51 seconds)\n", - "Cbc0010I After 332000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (73.68 seconds)\n", - "Cbc0010I After 333000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (73.84 seconds)\n", - "Cbc0010I After 334000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (74.05 seconds)\n", - "Cbc0010I After 335000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (74.31 seconds)\n", - "Cbc0010I After 336000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (74.52 seconds)\n", - "Cbc0010I After 337000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (74.67 seconds)\n", - "Cbc0010I After 338000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (74.92 seconds)\n", - "Cbc0010I After 339000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (75.17 seconds)\n", - "Cbc0010I After 340000 nodes, 852 on tree, 1e+50 best solution, best possible 0 (75.39 seconds)\n", - "Cbc0010I After 341000 nodes, 885 on tree, 1e+50 best solution, best possible 0 (75.58 seconds)\n", - "Cbc0010I After 342000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (75.75 seconds)\n", - "Cbc0010I After 343000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (75.92 seconds)\n", - "Cbc0010I After 344000 nodes, 876 on tree, 1e+50 best solution, best possible 0 (76.10 seconds)\n", - "Cbc0010I After 345000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (76.27 seconds)\n", - "Cbc0010I After 346000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (76.44 seconds)\n", - "Cbc0010I After 347000 nodes, 893 on tree, 1e+50 best solution, best possible 0 (76.61 seconds)\n", - "Cbc0010I After 348000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (76.81 seconds)\n", - "Cbc0010I After 349000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (76.98 seconds)\n", - "Cbc0010I After 350000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (77.08 seconds)\n", - "Cbc0010I After 351000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (77.21 seconds)\n", - "Cbc0010I After 352000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (77.32 seconds)\n", - "Cbc0010I After 353000 nodes, 899 on tree, 1e+50 best solution, best possible 0 (77.41 seconds)\n", - "Cbc0010I After 354000 nodes, 888 on tree, 1e+50 best solution, best possible 0 (77.50 seconds)\n", - "Cbc0010I After 355000 nodes, 887 on tree, 1e+50 best solution, best possible 0 (77.59 seconds)\n", - "Cbc0010I After 356000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (77.67 seconds)\n", - "Cbc0010I After 357000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (77.77 seconds)\n", - "Cbc0010I After 358000 nodes, 857 on tree, 1e+50 best solution, best possible 0 (77.86 seconds)\n", - "Cbc0010I After 359000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (77.95 seconds)\n", - "Cbc0010I After 360000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (78.06 seconds)\n", - "Cbc0010I After 361000 nodes, 813 on tree, 1e+50 best solution, best possible 0 (78.17 seconds)\n", - "Cbc0010I After 362000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (78.28 seconds)\n", - "Cbc0010I After 363000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (78.36 seconds)\n", - "Cbc0010I After 364000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (78.44 seconds)\n", - "Cbc0010I After 365000 nodes, 890 on tree, 1e+50 best solution, best possible 0 (78.53 seconds)\n", - "Cbc0010I After 366000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (78.61 seconds)\n", - "Cbc0010I After 367000 nodes, 891 on tree, 1e+50 best solution, best possible 0 (78.71 seconds)\n", - "Cbc0010I After 368000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (78.80 seconds)\n", - "Cbc0010I After 369000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (78.93 seconds) 3280000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (317.68 seconds)\n", - "Cbc0010I After 3281000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (317.75 seconds)\n", - "Cbc0010I After 3282000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (317.84 seconds)\n", - "Cbc0010I After 3283000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (317.93 seconds)\n", - "Cbc0010I After 3284000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (318.03 seconds)\n", - "Cbc0010I After 3285000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (318.10 seconds)\n", - "Cbc0010I After 3286000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (318.19 seconds)\n", - "Cbc0010I After 3287000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (318.29 seconds)\n", - "Cbc0010I After 3288000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (318.36 seconds)\n", - "Cbc0010I After 3289000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (318.41 seconds)\n", - "Cbc0010I After 3290000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (318.49 seconds)\n", - "Cbc0010I After 3291000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (318.58 seconds)\n", - "Cbc0010I After 3292000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (318.65 seconds)\n", - "Cbc0010I After 3293000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (318.74 seconds)\n", - "Cbc0010I After 3294000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (318.85 seconds)\n", - "Cbc0010I After 3295000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (318.92 seconds)\n", - "Cbc0010I After 3296000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (319.01 seconds)\n", - "Cbc0010I After 3297000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (319.09 seconds)\n", - "Cbc0010I After 3298000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (319.20 seconds)\n", - "Cbc0010I After 3299000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (319.29 seconds)\n", - "Cbc0010I After 3300000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (319.42 seconds)\n", - "Cbc0010I After 3301000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (319.51 seconds)\n", - "Cbc0010I After 3302000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (319.59 seconds)\n", - "Cbc0010I After 3303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (319.69 seconds)\n", - "Cbc0010I After 3304000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (319.77 seconds)\n", - "Cbc0010I After 3305000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (319.88 seconds)\n", - "Cbc0010I After 3306000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (320.05 seconds)\n", - "Cbc0010I After 3307000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (320.22 seconds)\n", - "Cbc0010I After 3308000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (320.39 seconds)\n", - "Cbc0010I After 3309000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (320.61 seconds)\n", - "Cbc0010I After 3310000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (320.81 seconds)\n", - "Cbc0010I After 3311000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (321.00 seconds)\n", - "Cbc0010I After 3312000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (321.18 seconds)\n", - "Cbc0010I After 3313000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (321.30 seconds)\n", - "Cbc0010I After 3314000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (321.42 seconds)\n", - "Cbc0010I After 3315000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (321.51 seconds)\n", - "Cbc0010I After 3316000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (321.61 seconds)\n", - "Cbc0010I After 3317000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (321.69 seconds)\n", - "Cbc0010I After 3318000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (321.75 seconds)\n", - "Cbc0010I After 3319000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (321.86 seconds)\n", - "Cbc0010I After 3320000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (322.04 seconds)\n", - "Cbc0010I After 3321000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (322.15 seconds)\n", - "Cbc0010I After 3322000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (322.27 seconds)\n", - "Cbc0010I After 3323000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (322.40 seconds)\n", - "Cbc0010I After 3324000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (322.53 seconds)\n", - "Cbc0010I After 3325000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (322.66 seconds)\n", - "Cbc0010I After 3326000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (322.77 seconds)\n", - "Cbc0010I After 3327000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (322.91 seconds)\n", - "Cbc0010I After 3328000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (323.01 seconds)\n", - "Cbc0010I After 3329000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (323.10 seconds)\n", - "Cbc0010I After 3330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (323.19 seconds)\n", - "Cbc0010I After 3331000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (323.29 seconds)\n", - "Cbc0010I After 3332000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (323.37 seconds)\n", - "Cbc0010I After 3333000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (323.47 seconds)\n", - "Cbc0010I After 3334000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (323.57 seconds)\n", - "Cbc0010I After 3335000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (323.66 seconds)\n", - "Cbc0010I After 3336000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (323.75 seconds)\n", - "Cbc0010I After 3337000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (323.83 seconds)\n", - "Cbc0010I After 3338000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (323.91 seconds)\n", - "Cbc0010I After 3339000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (324.00 seconds)\n", - "Cbc0010I After 3340000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (324.07 seconds)\n", - "Cbc0010I After 3341000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (324.19 seconds)\n", - "Cbc0010I After 3342000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (324.24 seconds)\n", - "Cbc0010I After 3343000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (324.32 seconds)\n", - "Cbc0010I After 3344000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (324.37 seconds)\n", - "Cbc0010I After 3345000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (324.49 seconds)\n", - "Cbc0010I After 3346000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (324.61 seconds)\n", - "Cbc0010I After 3347000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (324.75 seconds)\n", - "Cbc0010I After 3348000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (324.88 seconds)\n", - "Cbc0010I After 3349000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (324.92 seconds)\n", - "Cbc0010I After 3350000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (325.02 seconds)\n", - "Cbc0010I After 3351000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (325.11 seconds)\n", - "Cbc0010I After 3352000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (325.16 seconds)\n", - "Cbc0010I After 3353000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (325.20 seconds)\n", - "Cbc0010I After 3354000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (325.26 seconds)\n", - "Cbc0010I After 3355000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (325.30 seconds)\n", - "Cbc0010I After 3356000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (325.34 seconds)\n", - "Cbc0010I After 3357000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (325.39 seconds)\n", - "Cbc0010I After 3358000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (325.50 seconds)\n", - "Cbc0010I After 3359000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (325.67 seconds)\n", - "Cbc0010I After 3360000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (325.83 seconds)\n", - "Cbc0010I After 3361000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (325.93 seconds)\n", - "Cbc0010I After 3362000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (326.02 seconds)\n", - "Cbc0010I After 3363000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (326.07 seconds)\n", - "Cbc0010I After 3364000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (326.12 seconds)\n", - "Cbc0010I After 33\n", - "Cbc0010I After 370000 nodes, 861 on tree, 1e+50 best solution, best possible 0 (79.01 seconds)\n", - "Cbc0010I After 371000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (79.10 seconds)\n", - "Cbc0010I After 372000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (79.20 seconds)\n", - "Cbc0010I After 373000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (79.28 seconds)\n", - "Cbc0010I After 374000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (79.39 seconds)\n", - "Cbc0010I After 375000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (79.56 seconds)\n", - "Cbc0010I After 376000 nodes, 801 on tree, 1e+50 best solution, best possible 0 (79.77 seconds)\n", - "Cbc0010I After 377000 nodes, 902 on tree, 1e+50 best solution, best possible 0 (80.01 seconds)\n", - "Cbc0010I After 378000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (80.27 seconds)\n", - "Cbc0010I After 379000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (80.56 seconds)\n", - "Cbc0010I After 380000 nodes, 843 on tree, 1e+50 best solution, best possible 0 (80.78 seconds)\n", - "Cbc0010I After 381000 nodes, 827 on tree, 1e+50 best solution, best possible 0 (80.95 seconds)\n", - "Cbc0010I After 382000 nodes, 869 on tree, 1e+50 best solution, best possible 0 (81.08 seconds)\n", - "Cbc0010I After 383000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (81.21 seconds)\n", - "Cbc0010I After 384000 nodes, 884 on tree, 1e+50 best solution, best possible 0 (81.33 seconds)\n", - "Cbc0010I After 385000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (81.52 seconds)\n", - "Cbc0010I After 386000 nodes, 881 on tree, 1e+50 best solution, best possible 0 (81.71 seconds)\n", - "Cbc0010I After 387000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (81.89 seconds)\n", - "Cbc0010I After 388000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (82.09 seconds)\n", - "Cbc0010I After 389000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (82.23 seconds)\n", - "Cbc0010I After 390000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (82.40 seconds)\n", - "Cbc0010I After 391000 nodes, 854 on tree, 1e+50 best solution, best possible 0 (82.55 seconds)\n", - "Cbc0010I After 392000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (82.74 seconds)\n", - "Cbc0010I After 393000 nodes, 874 on tree, 1e+50 best solution, best possible 0 (82.92 seconds)\n", - "Cbc0010I After 394000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (83.12 seconds)\n", - "Cbc0010I After 395000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (83.30 seconds)\n", - "Cbc0010I After 396000 nodes, 843 on tree, 1e+50 best solution, best possible 0 (83.44 seconds)\n", - "Cbc0010I After 397000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (83.60 seconds)\n", - "Cbc0010I After 398000 nodes, 898 on tree, 1e+50 best solution, best possible 0 (83.73 seconds)\n", - "Cbc0010I After 399000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (83.87 seconds)\n", - "Cbc0010I After 400000 nodes, 900 on tree, 1e+50 best solution, best possible 0 (83.99 seconds)\n", - "Cbc0010I After 401000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (84.12 seconds)\n", - "Cbc0010I After 402000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (84.28 seconds)\n", - "Cbc0010I After 403000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (84.43 seconds)\n", - "Cbc0010I After 404000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (84.55 seconds)\n", - "Cbc0010I After 405000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (84.67 seconds)\n", - "Cbc0010I After 406000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (84.82 seconds)\n", - "Cbc0010I After 407000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (84.93 seconds)\n", - "Cbc0010I After 408000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (85.07 seconds)\n", - "Cbc0010I After 409000 nodes, 808 on tree, 1e+50 best solution, best possible 0 (85.24 seconds)\n", - "Cbc0010I After 410000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (85.40 seconds)\n", - "Cbc0010I After 411000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (85.51 seconds)\n", - "Cbc0010I After 412000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (85.63 seconds)\n", - "Cbc0010I A65000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (326.17 seconds)\n", - "Cbc0010I After 3366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (326.26 seconds)\n", - "Cbc0010I After 3367000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (326.39 seconds)\n", - "Cbc0010I After 3368000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (326.46 seconds)\n", - "Cbc0010I After 3369000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (326.54 seconds)\n", - "Cbc0010I After 3370000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (326.62 seconds)\n", - "Cbc0010I After 3371000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (326.70 seconds)\n", - "Cbc0010I After 3372000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (326.77 seconds)\n", - "Cbc0010I After 3373000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (326.91 seconds)\n", - "Cbc0010I After 3374000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (327.04 seconds)\n", - "Cbc0010I After 3375000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (327.21 seconds)\n", - "Cbc0010I After 3376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (327.35 seconds)\n", - "Cbc0010I After 3377000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (327.48 seconds)\n", - "Cbc0010I After 3378000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (327.66 seconds)\n", - "Cbc0010I After 3379000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (327.73 seconds)\n", - "Cbc0010I After 3380000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (327.80 seconds)\n", - "Cbc0010I After 3381000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (327.87 seconds)\n", - "Cbc0010I After 3382000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (327.94 seconds)\n", - "Cbc0010I After 3383000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (328.02 seconds)\n", - "Cbc0010I After 3384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (328.14 seconds)\n", - "Cbc0010I After 3385000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (328.22 seconds)\n", - "Cbc0010I After 3386000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (328.32 seconds)\n", - "Cbc0010I After 3387000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (328.46 seconds)\n", - "Cbc0010I After 3388000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (328.62 seconds)\n", - "Cbc0010I After 3389000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (328.83 seconds)\n", - "Cbc0010I After 3390000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (328.93 seconds)\n", - "Cbc0010I After 3391000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (329.00 seconds)\n", - "Cbc0010I After 3392000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (329.08 seconds)\n", - "Cbc0010I After 3393000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (329.15 seconds)\n", - "Cbc0010I After 3394000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (329.30 seconds)\n", - "Cbc0010I After 3395000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (329.39 seconds)\n", - "Cbc0010I After 3396000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (329.48 seconds)\n", - "Cbc0010I After 3397000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (329.69 seconds)\n", - "Cbc0010I After 3398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (329.91 seconds)\n", - "Cbc0010I After 3399000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (330.04 seconds)\n", - "Cbc0010I After 3400000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (330.13 seconds)\n", - "Cbc0010I After 3401000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (330.23 seconds)\n", - "Cbc0010I After 3402000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (330.32 seconds)\n", - "Cbc0010I After 3403000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (330.41 seconds)\n", - "Cbc0010I After 3404000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (330.52 seconds)\n", - "Cbc0010I After 3405000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (330.62 seconds)\n", - "Cbc0010I After 3406000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (330.73 seconds)\n", - "Cbc0010I After 3407000 nodes, 88 on tree, 1e+50 best solution, best possible 0 fter 413000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (85.78 seconds)\n", - "Cbc0010I After 414000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (85.92 seconds)\n", - "Cbc0010I After 415000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (86.08 seconds)\n", - "Cbc0010I After 416000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (86.21 seconds)\n", - "Cbc0010I After 417000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (86.35 seconds)\n", - "Cbc0010I After 418000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (86.49 seconds)\n", - "Cbc0010I After 419000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (86.61 seconds)\n", - "Cbc0010I After 420000 nodes, 808 on tree, 1e+50 best solution, best possible 0 (86.78 seconds)\n", - "Cbc0010I After 421000 nodes, 892 on tree, 1e+50 best solution, best possible 0 (86.90 seconds)\n", - "Cbc0010I After 422000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (87.06 seconds)\n", - "Cbc0010I After 423000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (87.23 seconds)\n", - "Cbc0010I After 424000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (87.44 seconds)\n", - "Cbc0010I After 425000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (87.66 seconds)\n", - "Cbc0010I After 426000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (87.86 seconds)\n", - "Cbc0010I After 427000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (88.13 seconds)\n", - "Cbc0010I After 428000 nodes, 887 on tree, 1e+50 best solution, best possible 0 (88.37 seconds)\n", - "Cbc0010I After 429000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (88.56 seconds)\n", - "Cbc0010I After 430000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (88.73 seconds)\n", - "Cbc0010I After 431000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (88.90 seconds)\n", - "Cbc0010I After 432000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (89.11 seconds)\n", - "Cbc0010I After 433000 nodes, 842 on tree, 1e+50 best solution, best possible 0 (89.33 seconds)\n", - "Cbc0010I After 434000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (89.60 seconds)\n", - "Cbc0010I After 435000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (89.85 seconds)\n", - "Cbc0010I After 436000 nodes, 803 on tree, 1e+50 best solution, best possible 0 (90.12 seconds)\n", - "Cbc0010I After 437000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (90.39 seconds)\n", - "Cbc0010I After 438000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (90.60 seconds)\n", - "Cbc0010I After 439000 nodes, 844 on tree, 1e+50 best solution, best possible 0 (90.83 seconds)\n", - "Cbc0010I After 440000 nodes, 850 on tree, 1e+50 best solution, best possible 0 (91.10 seconds)\n", - "Cbc0010I After 441000 nodes, 853 on tree, 1e+50 best solution, best possible 0 (91.34 seconds)\n", - "Cbc0010I After 442000 nodes, 825 on tree, 1e+50 best solution, best possible 0 (91.53 seconds)\n", - "Cbc0010I After 443000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (91.73 seconds)\n", - "Cbc0010I After 444000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (91.90 seconds)\n", - "Cbc0010I After 445000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (92.05 seconds)\n", - "Cbc0010I After 446000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (92.18 seconds)\n", - "Cbc0010I After 447000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (92.31 seconds)\n", - "Cbc0010I After 448000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (92.43 seconds)\n", - "Cbc0010I After 449000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (92.61 seconds)\n", - "Cbc0010I After 450000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (92.75 seconds)\n", - "Cbc0010I After 451000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (92.89 seconds)\n", - "Cbc0010I After 452000 nodes, 886 on tree, 1e+50 best solution, best possible 0 (93.03 seconds)\n", - "Cbc0010I After 453000 nodes, 841 on tree, 1e+50 best solution, best possible 0 (93.19 seconds)\n", - "Cbc0010I After 454000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (93.35 seconds)\n", - "Cbc0010I After 455000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (93.49 seconds)\n", - "Cbc0010I After 456000(330.84 seconds)\n", - "Cbc0010I After 3408000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (330.94 seconds)\n", - "Cbc0010I After 3409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (331.02 seconds)\n", - "Cbc0010I After 3410000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (331.22 seconds)\n", - "Cbc0010I After 3411000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (331.58 seconds)\n", - "Cbc0010I After 3412000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (331.84 seconds)\n", - "Cbc0010I After 3413000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (332.04 seconds)\n", - "Cbc0010I After 3414000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (332.24 seconds)\n", - "Cbc0010I After 3415000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (332.44 seconds)\n", - "Cbc0010I After 3416000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (332.58 seconds)\n", - "Cbc0010I After 3417000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (332.77 seconds)\n", - "Cbc0010I After 3418000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (332.90 seconds)\n", - "Cbc0010I After 3419000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (333.10 seconds)\n", - "Cbc0010I After 3420000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (333.24 seconds)\n", - "Cbc0010I After 3421000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (333.37 seconds)\n", - "Cbc0010I After 3422000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (333.50 seconds)\n", - "Cbc0010I After 3423000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (333.61 seconds)\n", - "Cbc0010I After 3424000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (333.80 seconds)\n", - "Cbc0010I After 3425000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (333.92 seconds)\n", - "Cbc0010I After 3426000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (334.10 seconds)\n", - "Cbc0010I After 3427000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (334.24 seconds)\n", - "Cbc0010I After 3428000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (334.42 seconds)\n", - "Cbc0010I After 3429000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (334.58 seconds)\n", - "Cbc0010I After 3430000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (334.71 seconds)\n", - "Cbc0010I After 3431000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (334.83 seconds)\n", - "Cbc0010I After 3432000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (334.98 seconds)\n", - "Cbc0010I After 3433000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (335.13 seconds)\n", - "Cbc0010I After 3434000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (335.29 seconds)\n", - "Cbc0010I After 3435000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (335.52 seconds)\n", - "Cbc0010I After 3436000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (335.71 seconds)\n", - "Cbc0010I After 3437000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (335.93 seconds)\n", - "Cbc0010I After 3438000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (336.08 seconds)\n", - "Cbc0010I After 3439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (336.26 seconds)\n", - "Cbc0010I After 3440000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (336.42 seconds)\n", - "Cbc0010I After 3441000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (336.53 seconds)\n", - "Cbc0010I After 3442000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (336.62 seconds)\n", - "Cbc0010I After 3443000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (336.71 seconds)\n", - "Cbc0010I After 3444000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (336.77 seconds)\n", - "Cbc0010I After 3445000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (336.83 seconds)\n", - "Cbc0010I After 3446000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (336.92 seconds)\n", - "Cbc0010I After 3447000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (337.03 seconds)\n", - "Cbc0010I After 3448000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (337.11 seconds)\n", - "Cbc0010I After 3449000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (337.21 seconds)\n", - "Cbc0010I After 3450000 node nodes, 847 on tree, 1e+50 best solution, best possible 0 (93.64 seconds)\n", - "Cbc0010I After 457000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (93.78 seconds)\n", - "Cbc0010I After 458000 nodes, 830 on tree, 1e+50 best solution, best possible 0 (93.92 seconds)\n", - "Cbc0010I After 459000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (94.08 seconds)\n", - "Cbc0010I After 460000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (94.24 seconds)\n", - "Cbc0010I After 461000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (94.37 seconds)\n", - "Cbc0010I After 462000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (94.53 seconds)\n", - "Cbc0010I After 463000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (94.71 seconds)\n", - "Cbc0010I After 464000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (94.85 seconds)\n", - "Cbc0010I After 465000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (95.14 seconds)\n", - "Cbc0010I After 466000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (95.41 seconds)\n", - "Cbc0010I After 467000 nodes, 897 on tree, 1e+50 best solution, best possible 0 (95.63 seconds)\n", - "Cbc0010I After 468000 nodes, 860 on tree, 1e+50 best solution, best possible 0 (95.77 seconds)\n", - "Cbc0010I After 469000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (95.92 seconds)\n", - "Cbc0010I After 470000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (96.02 seconds)\n", - "Cbc0010I After 471000 nodes, 842 on tree, 1e+50 best solution, best possible 0 (96.10 seconds)\n", - "Cbc0010I After 472000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (96.21 seconds)\n", - "Cbc0010I After 473000 nodes, 810 on tree, 1e+50 best solution, best possible 0 (96.29 seconds)\n", - "Cbc0010I After 474000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (96.38 seconds)\n", - "Cbc0010I After 475000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (96.46 seconds)\n", - "Cbc0010I After 476000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (96.55 seconds)\n", - "Cbc0010I After 477000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (96.64 seconds)\n", - "Cbc0010I After 478000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (96.73 seconds)\n", - "Cbc0010I After 479000 nodes, 895 on tree, 1e+50 best solution, best possible 0 (96.82 seconds)\n", - "Cbc0010I After 480000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (96.96 seconds)\n", - "Cbc0010I After 481000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (97.11 seconds)\n", - "Cbc0010I After 482000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (97.25 seconds)\n", - "Cbc0010I After 483000 nodes, 826 on tree, 1e+50 best solution, best possible 0 (97.46 seconds)\n", - "Cbc0010I After 484000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (97.58 seconds)\n", - "Cbc0010I After 485000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (97.70 seconds)\n", - "Cbc0010I After 486000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (97.84 seconds)\n", - "Cbc0010I After 487000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (97.96 seconds)\n", - "Cbc0010I After 488000 nodes, 839 on tree, 1e+50 best solution, best possible 0 (98.09 seconds)\n", - "Cbc0010I After 489000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (98.23 seconds)\n", - "Cbc0010I After 490000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (98.36 seconds)\n", - "Cbc0010I After 491000 nodes, 836 on tree, 1e+50 best solution, best possible 0 (98.46 seconds)\n", - "Cbc0010I After 492000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (98.57 seconds)\n", - "Cbc0010I After 493000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (98.68 seconds)\n", - "Cbc0010I After 494000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (98.78 seconds)\n", - "Cbc0010I After 495000 nodes, 875 on tree, 1e+50 best solution, best possible 0 (98.90 seconds)\n", - "Cbc0010I After 496000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (99.06 seconds)\n", - "Cbc0010I After 497000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (99.31 seconds)\n", - "Cbc0010I After 498000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (99.50 seconds)\n", - "Cbc0010I After 499000 nodes, 781s, 100 on tree, 1e+50 best solution, best possible 0 (337.31 seconds)\n", - "Cbc0010I After 3451000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (337.41 seconds)\n", - "Cbc0010I After 3452000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (337.53 seconds)\n", - "Cbc0010I After 3453000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (337.64 seconds)\n", - "Cbc0010I After 3454000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (337.74 seconds)\n", - "Cbc0010I After 3455000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (337.95 seconds)\n", - "Cbc0010I After 3456000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (338.05 seconds)\n", - "Cbc0010I After 3457000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (338.15 seconds)\n", - "Cbc0010I After 3458000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (338.27 seconds)\n", - "Cbc0010I After 3459000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (338.37 seconds)\n", - "Cbc0010I After 3460000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (338.50 seconds)\n", - "Cbc0010I After 3461000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (338.64 seconds)\n", - "Cbc0010I After 3462000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (338.76 seconds)\n", - "Cbc0010I After 3463000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (338.87 seconds)\n", - "Cbc0010I After 3464000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (338.99 seconds)\n", - "Cbc0010I After 3465000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.07 seconds)\n", - "Cbc0010I After 3466000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.18 seconds)\n", - "Cbc0010I After 3467000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (339.29 seconds)\n", - "Cbc0010I After 3468000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (339.40 seconds)\n", - "Cbc0010I After 3469000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (339.54 seconds)\n", - "Cbc0010I After 3470000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (339.74 seconds)\n", - "Cbc0010I After 3471000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (339.91 seconds)\n", - "Cbc0010I After 3472000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (340.03 seconds)\n", - "Cbc0010I After 3473000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (340.14 seconds)\n", - "Cbc0010I After 3474000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (340.28 seconds)\n", - "Cbc0010I After 3475000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (340.44 seconds)\n", - "Cbc0010I After 3476000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (340.58 seconds)\n", - "Cbc0010I After 3477000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (340.70 seconds)\n", - "Cbc0010I After 3478000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (340.87 seconds)\n", - "Cbc0010I After 3479000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.09 seconds)\n", - "Cbc0010I After 3480000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (341.25 seconds)\n", - "Cbc0010I After 3481000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (341.42 seconds)\n", - "Cbc0010I After 3482000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.54 seconds)\n", - "Cbc0010I After 3483000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (341.68 seconds)\n", - "Cbc0010I After 3484000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (341.78 seconds)\n", - "Cbc0010I After 3485000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (341.90 seconds)\n", - "Cbc0010I After 3486000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (342.05 seconds)\n", - "Cbc0010I After 3487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (342.17 seconds)\n", - "Cbc0010I After 3488000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (342.27 seconds)\n", - "Cbc0010I After 3489000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (342.37 seconds)\n", - "Cbc0010I After 3490000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (342.47 seconds)\n", - "Cbc0010I After 3491000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (342.58 seconds)\n", - "Cbc0010I After 3492000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (342.68 on tree, 1e+50 best solution, best possible 0 (99.62 seconds)\n", - "Cbc0010I After 500000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (99.75 seconds)\n", - "Cbc0010I After 501000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (99.92 seconds)\n", - "Cbc0010I After 502000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (100.06 seconds)\n", - "Cbc0010I After 503000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (100.21 seconds)\n", - "Cbc0010I After 504000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (100.37 seconds)\n", - "Cbc0010I After 505000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (100.60 seconds)\n", - "Cbc0010I After 506000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (100.81 seconds)\n", - "Cbc0010I After 507000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (101.01 seconds)\n", - "Cbc0010I After 508000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (101.14 seconds)\n", - "Cbc0010I After 509000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (101.28 seconds)\n", - "Cbc0010I After 510000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (101.41 seconds)\n", - "Cbc0010I After 511000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (101.56 seconds)\n", - "Cbc0010I After 512000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (101.70 seconds)\n", - "Cbc0010I After 513000 nodes, 864 on tree, 1e+50 best solution, best possible 0 (101.81 seconds)\n", - "Cbc0010I After 514000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (101.94 seconds)\n", - "Cbc0010I After 515000 nodes, 752 on tree, 1e+50 best solution, best possible 0 (102.06 seconds)\n", - "Cbc0010I After 516000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (102.18 seconds)\n", - "Cbc0010I After 517000 nodes, 799 on tree, 1e+50 best solution, best possible 0 (102.30 seconds)\n", - "Cbc0010I After 518000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (102.48 seconds)\n", - "Cbc0010I After 519000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (102.70 seconds)\n", - "Cbc0010I After 520000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (102.94 seconds)\n", - "Cbc0010I After 521000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (103.14 seconds)\n", - "Cbc0010I After 522000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (103.30 seconds)\n", - "Cbc0010I After 523000 nodes, 739 on tree, 1e+50 best solution, best possible 0 (103.49 seconds)\n", - "Cbc0010I After 524000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (103.65 seconds)\n", - "Cbc0010I After 525000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (103.79 seconds)\n", - "Cbc0010I After 526000 nodes, 861 on tree, 1e+50 best solution, best possible 0 (103.93 seconds)\n", - "Cbc0010I After 527000 nodes, 775 on tree, 1e+50 best solution, best possible 0 (104.05 seconds)\n", - "Cbc0010I After 528000 nodes, 774 on tree, 1e+50 best solution, best possible 0 (104.18 seconds)\n", - "Cbc0010I After 529000 nodes, 822 on tree, 1e+50 best solution, best possible 0 (104.33 seconds)\n", - "Cbc0010I After 530000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (104.46 seconds)\n", - "Cbc0010I After 531000 nodes, 869 on tree, 1e+50 best solution, best possible 0 (104.64 seconds)\n", - "Cbc0010I After 532000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (104.79 seconds)\n", - "Cbc0010I After 533000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (104.90 seconds)\n", - "Cbc0010I After 534000 nodes, 840 on tree, 1e+50 best solution, best possible 0 (105.03 seconds)\n", - "Cbc0010I After 535000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (105.17 seconds)\n", - "Cbc0010I After 536000 nodes, 879 on tree, 1e+50 best solution, best possible 0 (105.29 seconds)\n", - "Cbc0010I After 537000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (105.41 seconds)\n", - "Cbc0010I After 538000 nodes, 753 on tree, 1e+50 best solution, best possible 0 (105.52 seconds)\n", - "Cbc0010I After 539000 nodes, 845 on tree, 1e+50 best solution, best possible 0 (105.64 seconds)\n", - "Cbc0010I After 540000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (105.78 seconds)\n", - "Cbc0010I After 541000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (105.89 seconds)\n", - "Cbcseconds)\n", - "Cbc0010I After 3493000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (342.78 seconds)\n", - "Cbc0010I After 3494000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (342.92 seconds)\n", - "Cbc0010I After 3495000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (343.12 seconds)\n", - "Cbc0010I After 3496000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (343.34 seconds)\n", - "Cbc0010I After 3497000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (343.54 seconds)\n", - "Cbc0010I After 3498000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (343.69 seconds)\n", - "Cbc0010I After 3499000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (343.88 seconds)\n", - "Cbc0010I After 3500000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (344.02 seconds)\n", - "Cbc0010I After 3501000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (344.11 seconds)\n", - "Cbc0010I After 3502000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (344.21 seconds)\n", - "Cbc0010I After 3503000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (344.29 seconds)\n", - "Cbc0010I After 3504000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (344.39 seconds)\n", - "Cbc0010I After 3505000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (344.51 seconds)\n", - "Cbc0010I After 3506000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (344.62 seconds)\n", - "Cbc0010I After 3507000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (344.72 seconds)\n", - "Cbc0010I After 3508000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (344.88 seconds)\n", - "Cbc0010I After 3509000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (345.04 seconds)\n", - "Cbc0010I After 3510000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (345.16 seconds)\n", - "Cbc0010I After 3511000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (345.25 seconds)\n", - "Cbc0010I After 3512000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (345.38 seconds)\n", - "Cbc0010I After 3513000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (345.50 seconds)\n", - "Cbc0010I After 3514000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (345.61 seconds)\n", - "Cbc0010I After 3515000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (345.72 seconds)\n", - "Cbc0010I After 3516000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (345.86 seconds)\n", - "Cbc0010I After 3517000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (345.96 seconds)\n", - "Cbc0010I After 3518000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (346.08 seconds)\n", - "Cbc0010I After 3519000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (346.20 seconds)\n", - "Cbc0010I After 3520000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (346.29 seconds)\n", - "Cbc0010I After 3521000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (346.34 seconds)\n", - "Cbc0010I After 3522000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (346.39 seconds)\n", - "Cbc0010I After 3523000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (346.45 seconds)\n", - "Cbc0010I After 3524000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (346.58 seconds)\n", - "Cbc0010I After 3525000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (346.71 seconds)\n", - "Cbc0010I After 3526000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (346.86 seconds)\n", - "Cbc0010I After 3527000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (347.04 seconds)\n", - "Cbc0010I After 3528000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (347.19 seconds)\n", - "Cbc0010I After 3529000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (347.35 seconds)\n", - "Cbc0010I After 3530000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (347.48 seconds)\n", - "Cbc0010I After 3531000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (347.62 seconds)\n", - "Cbc0010I After 3532000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (347.77 seconds)\n", - "Cbc0010I After 3533000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (347.91 seconds)\n", - "Cbc0010I After 3534000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (348.05 seconds)\n", - "Cbc0010I After 3535000 nodes, 66 on tree, 1e+50010I After 542000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (106.02 seconds)\n", - "Cbc0010I After 543000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (106.13 seconds)\n", - "Cbc0010I After 544000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (106.22 seconds)\n", - "Cbc0010I After 545000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (106.33 seconds)\n", - "Cbc0010I After 546000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (106.43 seconds)\n", - "Cbc0010I After 547000 nodes, 794 on tree, 1e+50 best solution, best possible 0 (106.56 seconds)\n", - "Cbc0010I After 548000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (106.66 seconds)\n", - "Cbc0010I After 549000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (106.76 seconds)\n", - "Cbc0010I After 550000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (106.86 seconds)\n", - "Cbc0010I After 551000 nodes, 825 on tree, 1e+50 best solution, best possible 0 (106.95 seconds)\n", - "Cbc0010I After 552000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (107.04 seconds)\n", - "Cbc0010I After 553000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (107.13 seconds)\n", - "Cbc0010I After 554000 nodes, 760 on tree, 1e+50 best solution, best possible 0 (107.23 seconds)\n", - "Cbc0010I After 555000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (107.32 seconds)\n", - "Cbc0010I After 556000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (107.42 seconds)\n", - "Cbc0010I After 557000 nodes, 735 on tree, 1e+50 best solution, best possible 0 (107.55 seconds)\n", - "Cbc0010I After 558000 nodes, 830 on tree, 1e+50 best solution, best possible 0 (107.65 seconds)\n", - "Cbc0010I After 559000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (107.75 seconds)\n", - "Cbc0010I After 560000 nodes, 824 on tree, 1e+50 best solution, best possible 0 (107.84 seconds)\n", - "Cbc0010I After 561000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (107.95 seconds)\n", - "Cbc0010I After 562000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (108.07 seconds)\n", - "Cbc0010I After 563000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (108.18 seconds)\n", - "Cbc0010I After 564000 nodes, 781 on tree, 1e+50 best solution, best possible 0 (108.28 seconds)\n", - "Cbc0010I After 565000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.40 seconds)\n", - "Cbc0010I After 566000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (108.51 seconds)\n", - "Cbc0010I After 567000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.61 seconds)\n", - "Cbc0010I After 568000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (108.71 seconds)\n", - "Cbc0010I After 569000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (108.80 seconds)\n", - "Cbc0010I After 570000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (108.91 seconds)\n", - "Cbc0010I After 571000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (109.01 seconds)\n", - "Cbc0010I After 572000 nodes, 812 on tree, 1e+50 best solution, best possible 0 (109.12 seconds)\n", - "Cbc0010I After 573000 nodes, 815 on tree, 1e+50 best solution, best possible 0 (109.21 seconds)\n", - "Cbc0010I After 574000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (109.31 seconds)\n", - "Cbc0010I After 575000 nodes, 785 on tree, 1e+50 best solution, best possible 0 (109.39 seconds)\n", - "Cbc0010I After 576000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (109.48 seconds)\n", - "Cbc0010I After 577000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (109.58 seconds)\n", - "Cbc0010I After 578000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (109.69 seconds)\n", - "Cbc0010I After 579000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (109.78 seconds)\n", - "Cbc0010I After 580000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (109.87 seconds)\n", - "Cbc0010I After 581000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (110.00 seconds)\n", - "Cbc0010I After 582000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (110.14 seconds)\n", - "Cbc0010I After 583000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (110.26 seconds)\n", - "Cbc0010I After 584000 nodes, 756 on tree, 1e+50 best solution, best0 best solution, best possible 0 (348.19 seconds)\n", - "Cbc0010I After 3536000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (348.32 seconds)\n", - "Cbc0010I After 3537000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (348.50 seconds)\n", - "Cbc0010I After 3538000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (348.65 seconds)\n", - "Cbc0010I After 3539000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (348.81 seconds)\n", - "Cbc0010I After 3540000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (348.98 seconds)\n", - "Cbc0010I After 3541000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (349.10 seconds)\n", - "Cbc0010I After 3542000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (349.19 seconds)\n", - "Cbc0010I After 3543000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (349.31 seconds)\n", - "Cbc0010I After 3544000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (349.47 seconds)\n", - "Cbc0010I After 3545000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (349.59 seconds)\n", - "Cbc0010I After 3546000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (349.65 seconds)\n", - "Cbc0010I After 3547000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (349.70 seconds)\n", - "Cbc0010I After 3548000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (349.79 seconds)\n", - "Cbc0010I After 3549000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (349.85 seconds)\n", - "Cbc0010I After 3550000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (349.97 seconds)\n", - "Cbc0010I After 3551000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (350.04 seconds)\n", - "Cbc0010I After 3552000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (350.15 seconds)\n", - "Cbc0010I After 3553000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (350.29 seconds)\n", - "Cbc0010I After 3554000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (350.45 seconds)\n", - "Cbc0010I After 3555000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (350.64 seconds)\n", - "Cbc0010I After 3556000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (350.74 seconds)\n", - "Cbc0010I After 3557000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (350.84 seconds)\n", - "Cbc0010I After 3558000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (351.01 seconds)\n", - "Cbc0010I After 3559000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (351.10 seconds)\n", - "Cbc0010I After 3560000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (351.26 seconds)\n", - "Cbc0010I After 3561000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (351.38 seconds)\n", - "Cbc0010I After 3562000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (351.59 seconds)\n", - "Cbc0010I After 3563000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (351.66 seconds)\n", - "Cbc0010I After 3564000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (351.87 seconds)\n", - "Cbc0010I After 3565000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (352.04 seconds)\n", - "Cbc0010I After 3566000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (352.22 seconds)\n", - "Cbc0010I After 3567000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (352.39 seconds)\n", - "Cbc0010I After 3568000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (352.51 seconds)\n", - "Cbc0010I After 3569000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (352.67 seconds)\n", - "Cbc0010I After 3570000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (352.82 seconds)\n", - "Cbc0010I After 3571000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (352.99 seconds)\n", - "Cbc0010I After 3572000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (353.16 seconds)\n", - "Cbc0010I After 3573000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (353.29 seconds)\n", - "Cbc0010I After 3574000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (353.43 seconds)\n", - "Cbc0010I After 3575000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (353.55 seconds)\n", - "Cbc0010I After 3576000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (353.67 seconds)\n", - "Cbc0010I After 3577000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (353.78 seconds)\n", - "Cbc0010I Aft possible 0 (110.38 seconds)\n", - "Cbc0010I After 585000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (110.49 seconds)\n", - "Cbc0010I After 586000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (110.61 seconds)\n", - "Cbc0010I After 587000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (110.78 seconds)\n", - "Cbc0010I After 588000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (110.97 seconds)\n", - "Cbc0010I After 589000 nodes, 733 on tree, 1e+50 best solution, best possible 0 (111.16 seconds)\n", - "Cbc0010I After 590000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (111.36 seconds)\n", - "Cbc0010I After 591000 nodes, 877 on tree, 1e+50 best solution, best possible 0 (111.52 seconds)\n", - "Cbc0010I After 592000 nodes, 866 on tree, 1e+50 best solution, best possible 0 (111.65 seconds)\n", - "Cbc0010I After 593000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (111.80 seconds)\n", - "Cbc0010I After 594000 nodes, 832 on tree, 1e+50 best solution, best possible 0 (111.90 seconds)\n", - "Cbc0010I After 595000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (111.99 seconds)\n", - "Cbc0010I After 596000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (112.11 seconds)\n", - "Cbc0010I After 597000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (112.25 seconds)\n", - "Cbc0010I After 598000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (112.39 seconds)\n", - "Cbc0010I After 599000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (112.52 seconds)\n", - "Cbc0010I After 600000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (112.64 seconds)\n", - "Cbc0010I After 601000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (112.76 seconds)\n", - "Cbc0010I After 602000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (112.89 seconds)\n", - "Cbc0010I After 603000 nodes, 749 on tree, 1e+50 best solution, best possible 0 (112.98 seconds)\n", - "Cbc0010I After 604000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (113.06 seconds)\n", - "Cbc0010I After 605000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (113.15 seconds)\n", - "Cbc0010I After 606000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (113.23 seconds)\n", - "Cbc0010I After 607000 nodes, 791 on tree, 1e+50 best solution, best possible 0 (113.31 seconds)\n", - "Cbc0010I After 608000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (113.39 seconds)\n", - "Cbc0010I After 609000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (113.48 seconds)\n", - "Cbc0010I After 610000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (113.57 seconds)\n", - "Cbc0010I After 611000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (113.73 seconds)\n", - "Cbc0010I After 612000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (113.87 seconds)\n", - "Cbc0010I After 613000 nodes, 778 on tree, 1e+50 best solution, best possible 0 (113.98 seconds)\n", - "Cbc0010I After 614000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (114.08 seconds)\n", - "Cbc0010I After 615000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (114.16 seconds)\n", - "Cbc0010I After 616000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (114.25 seconds)\n", - "Cbc0010I After 617000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (114.33 seconds)\n", - "Cbc0010I After 618000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (114.43 seconds)\n", - "Cbc0010I After 619000 nodes, 720 on tree, 1e+50 best solution, best possible 0 (114.52 seconds)\n", - "Cbc0010I After 620000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (114.62 seconds)\n", - "Cbc0010I After 621000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (114.72 seconds)\n", - "Cbc0010I After 622000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (114.81 seconds)\n", - "Cbc0010I After 623000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (114.88 seconds)\n", - "Cbc0010I After 624000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (114.97 seconds)\n", - "Cbc0010I After 625000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (115.07 seconds)\n", - "Cbc0010I After 626000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (115.15 seconds)\n", - "Cbc0010I After 627000 nodes, 784 oner 3578000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (353.90 seconds)\n", - "Cbc0010I After 3579000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (354.03 seconds)\n", - "Cbc0010I After 3580000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (354.25 seconds)\n", - "Cbc0010I After 3581000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (354.42 seconds)\n", - "Cbc0010I After 3582000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (354.57 seconds)\n", - "Cbc0010I After 3583000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (354.65 seconds)\n", - "Cbc0010I After 3584000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (354.76 seconds)\n", - "Cbc0010I After 3585000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (354.85 seconds)\n", - "Cbc0010I After 3586000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (354.97 seconds)\n", - "Cbc0010I After 3587000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (355.08 seconds)\n", - "Cbc0010I After 3588000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (355.18 seconds)\n", - "Cbc0010I After 3589000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (355.27 seconds)\n", - "Cbc0010I After 3590000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (355.34 seconds)\n", - "Cbc0010I After 3591000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (355.40 seconds)\n", - "Cbc0010I After 3592000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (355.52 seconds)\n", - "Cbc0010I After 3593000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (355.62 seconds)\n", - "Cbc0010I After 3594000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (355.74 seconds)\n", - "Cbc0010I After 3595000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (355.84 seconds)\n", - "Cbc0010I After 3596000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (355.94 seconds)\n", - "Cbc0010I After 3597000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (356.06 seconds)\n", - "Cbc0010I After 3598000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (356.17 seconds)\n", - "Cbc0010I After 3599000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (356.25 seconds)\n", - "Cbc0010I After 3600000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (356.31 seconds)\n", - "Cbc0010I After 3601000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (356.42 seconds)\n", - "Cbc0010I After 3602000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (356.52 seconds)\n", - "Cbc0010I After 3603000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (356.67 seconds)\n", - "Cbc0010I After 3604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (356.81 seconds)\n", - "Cbc0010I After 3605000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (356.93 seconds)\n", - "Cbc0010I After 3606000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (357.03 seconds)\n", - "Cbc0010I After 3607000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (357.12 seconds)\n", - "Cbc0010I After 3608000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (357.20 seconds)\n", - "Cbc0010I After 3609000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (357.29 seconds)\n", - "Cbc0010I After 3610000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (357.39 seconds)\n", - "Cbc0010I After 3611000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (357.50 seconds)\n", - "Cbc0010I After 3612000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (357.60 seconds)\n", - "Cbc0010I After 3613000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (357.70 seconds)\n", - "Cbc0010I After 3614000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (357.82 seconds)\n", - "Cbc0010I After 3615000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (357.92 seconds)\n", - "Cbc0010I After 3616000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (358.03 seconds)\n", - "Cbc0010I After 3617000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (358.11 seconds)\n", - "Cbc0010I After 3618000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (358.24 seconds)\n", - "Cbc0010I After 3619000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (358.46 seconds)\n", - "Cbc0010I After 3620000 nodes, 83 on tree, 1e+50 best solution, tree, 1e+50 best solution, best possible 0 (115.24 seconds)\n", - "Cbc0010I After 628000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (115.32 seconds)\n", - "Cbc0010I After 629000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (115.42 seconds)\n", - "Cbc0010I After 630000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (115.52 seconds)\n", - "Cbc0010I After 631000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (115.60 seconds)\n", - "Cbc0010I After 632000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (115.70 seconds)\n", - "Cbc0010I After 633000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (115.80 seconds)\n", - "Cbc0010I After 634000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (115.89 seconds)\n", - "Cbc0010I After 635000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (115.98 seconds)\n", - "Cbc0010I After 636000 nodes, 747 on tree, 1e+50 best solution, best possible 0 (116.11 seconds)\n", - "Cbc0010I After 637000 nodes, 727 on tree, 1e+50 best solution, best possible 0 (116.25 seconds)\n", - "Cbc0010I After 638000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (116.41 seconds)\n", - "Cbc0010I After 639000 nodes, 804 on tree, 1e+50 best solution, best possible 0 (116.54 seconds)\n", - "Cbc0010I After 640000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (116.66 seconds)\n", - "Cbc0010I After 641000 nodes, 875 on tree, 1e+50 best solution, best possible 0 (116.77 seconds)\n", - "Cbc0010I After 642000 nodes, 865 on tree, 1e+50 best solution, best possible 0 (116.87 seconds)\n", - "Cbc0010I After 643000 nodes, 829 on tree, 1e+50 best solution, best possible 0 (116.97 seconds)\n", - "Cbc0010I After 644000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (117.07 seconds)\n", - "Cbc0010I After 645000 nodes, 828 on tree, 1e+50 best solution, best possible 0 (117.16 seconds)\n", - "Cbc0010I After 646000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (117.27 seconds)\n", - "Cbc0010I After 647000 nodes, 809 on tree, 1e+50 best solution, best possible 0 (117.37 seconds)\n", - "Cbc0010I After 648000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (117.46 seconds)\n", - "Cbc0010I After 649000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (117.57 seconds)\n", - "Cbc0010I After 650000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (117.69 seconds)\n", - "Cbc0010I After 651000 nodes, 773 on tree, 1e+50 best solution, best possible 0 (117.86 seconds)\n", - "Cbc0010I After 652000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (118.11 seconds)\n", - "Cbc0010I After 653000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (118.27 seconds)\n", - "Cbc0010I After 654000 nodes, 756 on tree, 1e+50 best solution, best possible 0 (118.40 seconds)\n", - "Cbc0010I After 655000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (118.55 seconds)\n", - "Cbc0010I After 656000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (118.69 seconds)\n", - "Cbc0010I After 657000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (118.82 seconds)\n", - "Cbc0010I After 658000 nodes, 743 on tree, 1e+50 best solution, best possible 0 (118.96 seconds)\n", - "Cbc0010I After 659000 nodes, 723 on tree, 1e+50 best solution, best possible 0 (119.09 seconds)\n", - "Cbc0010I After 660000 nodes, 922 on tree, 1e+50 best solution, best possible 0 (119.21 seconds)\n", - "Cbc0010I After 661000 nodes, 867 on tree, 1e+50 best solution, best possible 0 (119.31 seconds)\n", - "Cbc0010I After 662000 nodes, 857 on tree, 1e+50 best solution, best possible 0 (119.43 seconds)\n", - "Cbc0010I After 663000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (119.55 seconds)\n", - "Cbc0010I After 664000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (119.65 seconds)\n", - "Cbc0010I After 665000 nodes, 837 on tree, 1e+50 best solution, best possible 0 (119.77 seconds)\n", - "Cbc0010I After 666000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (119.88 seconds)\n", - "Cbc0010I After 667000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (120.00 seconds)\n", - "Cbc0010I After 668000 nodes, 801 on tree, 1e+50 best solution, best possible 0 (120.12 seconds)\n", - "Cbc0010I After 669000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (120.19 seconds)\n", - "Cbc best possible 0 (358.65 seconds)\n", - "Cbc0010I After 3621000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (358.81 seconds)\n", - "Cbc0010I After 3622000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (358.95 seconds)\n", - "Cbc0010I After 3623000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (359.07 seconds)\n", - "Cbc0010I After 3624000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (359.20 seconds)\n", - "Cbc0010I After 3625000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (359.28 seconds)\n", - "Cbc0010I After 3626000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (359.35 seconds)\n", - "Cbc0010I After 3627000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (359.42 seconds)\n", - "Cbc0010I After 3628000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (359.52 seconds)\n", - "Cbc0010I After 3629000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (359.62 seconds)\n", - "Cbc0010I After 3630000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (359.72 seconds)\n", - "Cbc0010I After 3631000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (359.79 seconds)\n", - "Cbc0010I After 3632000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (359.89 seconds)\n", - "Cbc0010I After 3633000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (359.98 seconds)\n", - "Cbc0010I After 3634000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (360.04 seconds)\n", - "Cbc0010I After 3635000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (360.12 seconds)\n", - "Cbc0010I After 3636000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (360.25 seconds)\n", - "Cbc0010I After 3637000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (360.35 seconds)\n", - "Cbc0010I After 3638000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (360.47 seconds)\n", - "Cbc0010I After 3639000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (360.55 seconds)\n", - "Cbc0010I After 3640000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (360.62 seconds)\n", - "Cbc0010I After 3641000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (360.72 seconds)\n", - "Cbc0010I After 3642000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (360.79 seconds)\n", - "Cbc0010I After 3643000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (360.89 seconds)\n", - "Cbc0010I After 3644000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (360.98 seconds)\n", - "Cbc0010I After 3645000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (361.14 seconds)\n", - "Cbc0010I After 3646000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (361.30 seconds)\n", - "Cbc0010I After 3647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (361.52 seconds)\n", - "Cbc0010I After 3648000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (361.72 seconds)\n", - "Cbc0010I After 3649000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (361.94 seconds)\n", - "Cbc0010I After 3650000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (362.12 seconds)\n", - "Cbc0010I After 3651000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (362.20 seconds)\n", - "Cbc0010I After 3652000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (362.27 seconds)\n", - "Cbc0010I After 3653000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (362.35 seconds)\n", - "Cbc0010I After 3654000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (362.44 seconds)\n", - "Cbc0010I After 3655000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (362.55 seconds)\n", - "Cbc0010I After 3656000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (362.66 seconds)\n", - "Cbc0010I After 3657000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (362.72 seconds)\n", - "Cbc0010I After 3658000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (362.82 seconds)\n", - "Cbc0010I After 3659000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (362.93 seconds)\n", - "Cbc0010I After 3660000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (363.06 seconds)\n", - "Cbc0010I After 3661000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (363.14 seconds)\n", - "Cbc0010I After 3662000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (363.22 seconds)\n", - "Cbc00010I After 670000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (120.28 seconds)\n", - "Cbc0010I After 671000 nodes, 765 on tree, 1e+50 best solution, best possible 0 (120.42 seconds)\n", - "Cbc0010I After 672000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (120.53 seconds)\n", - "Cbc0010I After 673000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (120.68 seconds)\n", - "Cbc0010I After 674000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (120.88 seconds)\n", - "Cbc0010I After 675000 nodes, 729 on tree, 1e+50 best solution, best possible 0 (121.08 seconds)\n", - "Cbc0010I After 676000 nodes, 714 on tree, 1e+50 best solution, best possible 0 (121.19 seconds)\n", - "Cbc0010I After 677000 nodes, 820 on tree, 1e+50 best solution, best possible 0 (121.36 seconds)\n", - "Cbc0010I After 678000 nodes, 811 on tree, 1e+50 best solution, best possible 0 (121.51 seconds)\n", - "Cbc0010I After 679000 nodes, 778 on tree, 1e+50 best solution, best possible 0 (121.65 seconds)\n", - "Cbc0010I After 680000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (121.78 seconds)\n", - "Cbc0010I After 681000 nodes, 833 on tree, 1e+50 best solution, best possible 0 (121.89 seconds)\n", - "Cbc0010I After 682000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (121.99 seconds)\n", - "Cbc0010I After 683000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (122.07 seconds)\n", - "Cbc0010I After 684000 nodes, 800 on tree, 1e+50 best solution, best possible 0 (122.15 seconds)\n", - "Cbc0010I After 685000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (122.23 seconds)\n", - "Cbc0010I After 686000 nodes, 788 on tree, 1e+50 best solution, best possible 0 (122.31 seconds)\n", - "Cbc0010I After 687000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (122.39 seconds)\n", - "Cbc0010I After 688000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (122.49 seconds)\n", - "Cbc0010I After 689000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (122.57 seconds)\n", - "Cbc0010I After 690000 nodes, 774 on tree, 1e+50 best solution, best possible 0 (122.68 seconds)\n", - "Cbc0010I After 691000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (122.79 seconds)\n", - "Cbc0010I After 692000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (122.90 seconds)\n", - "Cbc0010I After 693000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (123.05 seconds)\n", - "Cbc0010I After 694000 nodes, 740 on tree, 1e+50 best solution, best possible 0 (123.26 seconds)\n", - "Cbc0010I After 695000 nodes, 712 on tree, 1e+50 best solution, best possible 0 (123.43 seconds)\n", - "Cbc0010I After 696000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (123.62 seconds)\n", - "Cbc0010I After 697000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (123.80 seconds)\n", - "Cbc0010I After 698000 nodes, 735 on tree, 1e+50 best solution, best possible 0 (123.95 seconds)\n", - "Cbc0010I After 699000 nodes, 849 on tree, 1e+50 best solution, best possible 0 (124.07 seconds)\n", - "Cbc0010I After 700000 nodes, 851 on tree, 1e+50 best solution, best possible 0 (124.16 seconds)\n", - "Cbc0010I After 701000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (124.26 seconds)\n", - "Cbc0010I After 702000 nodes, 807 on tree, 1e+50 best solution, best possible 0 (124.35 seconds)\n", - "Cbc0010I After 703000 nodes, 810 on tree, 1e+50 best solution, best possible 0 (124.45 seconds)\n", - "Cbc0010I After 704000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (124.56 seconds)\n", - "Cbc0010I After 705000 nodes, 802 on tree, 1e+50 best solution, best possible 0 (124.65 seconds)\n", - "Cbc0010I After 706000 nodes, 763 on tree, 1e+50 best solution, best possible 0 (124.76 seconds)\n", - "Cbc0010I After 707000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (124.86 seconds)\n", - "Cbc0010I After 708000 nodes, 740 on tree, 1e+50 best solution, best possible 0 (124.96 seconds)\n", - "Cbc0010I After 709000 nodes, 738 on tree, 1e+50 best solution, best possible 0 (125.05 seconds)\n", - "Cbc0010I After 710000 nodes, 727 on tree, 1e+50 best solution, best possible 0 (125.16 seconds)\n", - "Cbc0010I After 711000 nodes, 721 on tree, 1e+50 best solution, best possible 0 (125.31 seconds)\n", - "Cbc0010I After 712000 nodes, 753 on tree, 1e+50 best solution, best010I After 3663000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (363.32 seconds)\n", - "Cbc0010I After 3664000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (363.38 seconds)\n", - "Cbc0010I After 3665000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (363.56 seconds)\n", - "Cbc0010I After 3666000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (363.74 seconds)\n", - "Cbc0010I After 3667000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (363.81 seconds)\n", - "Cbc0010I After 3668000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (363.88 seconds)\n", - "Cbc0010I After 3669000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (363.99 seconds)\n", - "Cbc0010I After 3670000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (364.13 seconds)\n", - "Cbc0010I After 3671000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (364.32 seconds)\n", - "Cbc0010I After 3672000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (364.39 seconds)\n", - "Cbc0010I After 3673000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (364.55 seconds)\n", - "Cbc0010I After 3674000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (364.69 seconds)\n", - "Cbc0010I After 3675000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (364.82 seconds)\n", - "Cbc0010I After 3676000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (364.91 seconds)\n", - "Cbc0010I After 3677000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (365.05 seconds)\n", - "Cbc0010I After 3678000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (365.13 seconds)\n", - "Cbc0010I After 3679000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (365.25 seconds)\n", - "Cbc0010I After 3680000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (365.37 seconds)\n", - "Cbc0010I After 3681000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (365.50 seconds)\n", - "Cbc0010I After 3682000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (365.65 seconds)\n", - "Cbc0010I After 3683000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (365.80 seconds)\n", - "Cbc0010I After 3684000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (365.93 seconds)\n", - "Cbc0010I After 3685000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (366.03 seconds)\n", - "Cbc0010I After 3686000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (366.08 seconds)\n", - "Cbc0010I After 3687000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (366.15 seconds)\n", - "Cbc0010I After 3688000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (366.21 seconds)\n", - "Cbc0010I After 3689000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (366.37 seconds)\n", - "Cbc0010I After 3690000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (366.57 seconds)\n", - "Cbc0010I After 3691000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (366.75 seconds)\n", - "Cbc0010I After 3692000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (366.88 seconds)\n", - "Cbc0010I After 3693000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (367.01 seconds)\n", - "Cbc0010I After 3694000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (367.13 seconds)\n", - "Cbc0010I After 3695000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (367.17 seconds)\n", - "Cbc0010I After 3696000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (367.22 seconds)\n", - "Cbc0010I After 3697000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (367.27 seconds)\n", - "Cbc0010I After 3698000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (367.41 seconds)\n", - "Cbc0010I After 3699000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (367.52 seconds)\n", - "Cbc0010I After 3700000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (367.61 seconds)\n", - "Cbc0010I After 3701000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (367.73 seconds)\n", - "Cbc0010I After 3702000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (367.81 seconds)\n", - "Cbc0010I After 3703000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (367.86 seconds)\n", - "Cbc0010I After 3704000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (367.98 seconds)\n", - "Cbc0010I After 3705000 nodes, 77 on tree, 1e+50 best solution, possible 0 (125.42 seconds)\n", - "Cbc0010I After 713000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (125.53 seconds)\n", - "Cbc0010I After 714000 nodes, 819 on tree, 1e+50 best solution, best possible 0 (125.63 seconds)\n", - "Cbc0010I After 715000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (125.73 seconds)\n", - "Cbc0010I After 716000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (125.87 seconds)\n", - "Cbc0010I After 717000 nodes, 797 on tree, 1e+50 best solution, best possible 0 (125.99 seconds)\n", - "Cbc0010I After 718000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (126.13 seconds)\n", - "Cbc0010I After 719000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (126.24 seconds)\n", - "Cbc0010I After 720000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (126.36 seconds)\n", - "Cbc0010I After 721000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (126.45 seconds)\n", - "Cbc0010I After 722000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (126.54 seconds)\n", - "Cbc0010I After 723000 nodes, 762 on tree, 1e+50 best solution, best possible 0 (126.64 seconds)\n", - "Cbc0010I After 724000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (126.72 seconds)\n", - "Cbc0010I After 725000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (126.82 seconds)\n", - "Cbc0010I After 726000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (126.91 seconds)\n", - "Cbc0010I After 727000 nodes, 714 on tree, 1e+50 best solution, best possible 0 (127.02 seconds)\n", - "Cbc0010I After 728000 nodes, 731 on tree, 1e+50 best solution, best possible 0 (127.10 seconds)\n", - "Cbc0010I After 729000 nodes, 831 on tree, 1e+50 best solution, best possible 0 (127.19 seconds)\n", - "Cbc0010I After 730000 nodes, 846 on tree, 1e+50 best solution, best possible 0 (127.28 seconds)\n", - "Cbc0010I After 731000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (127.37 seconds)\n", - "Cbc0010I After 732000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (127.46 seconds)\n", - "Cbc0010I After 733000 nodes, 789 on tree, 1e+50 best solution, best possible 0 (127.55 seconds)\n", - "Cbc0010I After 734000 nodes, 806 on tree, 1e+50 best solution, best possible 0 (127.66 seconds)\n", - "Cbc0010I After 735000 nodes, 760 on tree, 1e+50 best solution, best possible 0 (127.75 seconds)\n", - "Cbc0010I After 736000 nodes, 772 on tree, 1e+50 best solution, best possible 0 (127.82 seconds)\n", - "Cbc0010I After 737000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (127.93 seconds)\n", - "Cbc0010I After 738000 nodes, 770 on tree, 1e+50 best solution, best possible 0 (128.02 seconds)\n", - "Cbc0010I After 739000 nodes, 768 on tree, 1e+50 best solution, best possible 0 (128.12 seconds)\n", - "Cbc0010I After 740000 nodes, 730 on tree, 1e+50 best solution, best possible 0 (128.22 seconds)\n", - "Cbc0010I After 741000 nodes, 720 on tree, 1e+50 best solution, best possible 0 (128.31 seconds)\n", - "Cbc0010I After 742000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (128.41 seconds)\n", - "Cbc0010I After 743000 nodes, 710 on tree, 1e+50 best solution, best possible 0 (128.50 seconds)\n", - "Cbc0010I After 744000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (128.62 seconds)\n", - "Cbc0010I After 745000 nodes, 769 on tree, 1e+50 best solution, best possible 0 (128.78 seconds)\n", - "Cbc0010I After 746000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (128.93 seconds)\n", - "Cbc0010I After 747000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (129.06 seconds)\n", - "Cbc0010I After 748000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (129.21 seconds)\n", - "Cbc0010I After 749000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (129.35 seconds)\n", - "Cbc0010I After 750000 nodes, 694 on tree, 1e+50 best solution, best possible 0 (129.50 seconds)\n", - "Cbc0010I After 751000 nodes, 816 on tree, 1e+50 best solution, best possible 0 (129.63 seconds)\n", - "Cbc0010I After 752000 nodes, 767 on tree, 1e+50 best solution, best possible 0 (129.79 seconds)\n", - "Cbc0010I After 753000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (129.95 seconds)\n", - "Cbc0010I After 754000 nodes, 766 on tree, 1e+50 best solution, best possible 0 (130.09 seconds)\n", - "Cbc0010I After 755000 nodes, 710 onbest possible 0 (368.12 seconds)\n", - "Cbc0010I After 3706000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (368.26 seconds)\n", - "Cbc0010I After 3707000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (368.40 seconds)\n", - "Cbc0010I After 3708000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (368.53 seconds)\n", - "Cbc0010I After 3709000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (368.70 seconds)\n", - "Cbc0010I After 3710000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (368.79 seconds)\n", - "Cbc0010I After 3711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (368.88 seconds)\n", - "Cbc0010I After 3712000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (368.93 seconds)\n", - "Cbc0010I After 3713000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (368.99 seconds)\n", - "Cbc0010I After 3714000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (369.06 seconds)\n", - "Cbc0010I After 3715000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (369.13 seconds)\n", - "Cbc0010I After 3716000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (369.27 seconds)\n", - "Cbc0010I After 3717000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (369.37 seconds)\n", - "Cbc0010I After 3718000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (369.42 seconds)\n", - "Cbc0010I After 3719000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (369.47 seconds)\n", - "Cbc0010I After 3720000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (369.51 seconds)\n", - "Cbc0010I After 3721000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (369.55 seconds)\n", - "Cbc0010I After 3722000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (369.66 seconds)\n", - "Cbc0010I After 3723000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (369.78 seconds)\n", - "Cbc0010I After 3724000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (369.89 seconds)\n", - "Cbc0010I After 3725000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (370.06 seconds)\n", - "Cbc0010I After 3726000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (370.20 seconds)\n", - "Cbc0010I After 3727000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (370.35 seconds)\n", - "Cbc0010I After 3728000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (370.46 seconds)\n", - "Cbc0010I After 3729000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (370.59 seconds)\n", - "Cbc0010I After 3730000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (370.75 seconds)\n", - "Cbc0010I After 3731000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (370.80 seconds)\n", - "Cbc0010I After 3732000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (370.85 seconds)\n", - "Cbc0010I After 3733000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (370.90 seconds)\n", - "Cbc0010I After 3734000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (370.95 seconds)\n", - "Cbc0010I After 3735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (371.05 seconds)\n", - "Cbc0010I After 3736000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (371.14 seconds)\n", - "Cbc0010I After 3737000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (371.23 seconds)\n", - "Cbc0010I After 3738000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (371.32 seconds)\n", - "Cbc0010I After 3739000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (371.45 seconds)\n", - "Cbc0010I After 3740000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (371.50 seconds)\n", - "Cbc0010I After 3741000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (371.55 seconds)\n", - "Cbc0010I After 3742000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (371.62 seconds)\n", - "Cbc0010I After 3743000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (371.78 seconds)\n", - "Cbc0010I After 3744000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (371.90 seconds)\n", - "Cbc0010I After 3745000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (372.03 seconds)\n", - "Cbc0010I After 3746000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (372.12 seconds)\n", - "Cbc0010I After 3747000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (372.16 seconds)\n", - "Cbc0010I After 3748000 node tree, 1e+50 best solution, best possible 0 (130.22 seconds)\n", - "Cbc0010I After 756000 nodes, 889 on tree, 1e+50 best solution, best possible 0 (130.35 seconds)\n", - "Cbc0010I After 757000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (130.49 seconds)\n", - "Cbc0010I After 758000 nodes, 856 on tree, 1e+50 best solution, best possible 0 (130.75 seconds)\n", - "Cbc0010I After 759000 nodes, 838 on tree, 1e+50 best solution, best possible 0 (130.89 seconds)\n", - "Cbc0010I After 760000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (131.05 seconds)\n", - "Cbc0010I After 761000 nodes, 786 on tree, 1e+50 best solution, best possible 0 (131.17 seconds)\n", - "Cbc0010I After 762000 nodes, 787 on tree, 1e+50 best solution, best possible 0 (131.31 seconds)\n", - "Cbc0010I After 763000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (131.44 seconds)\n", - "Cbc0010I After 764000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (131.57 seconds)\n", - "Cbc0010I After 765000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (131.67 seconds)\n", - "Cbc0010I After 766000 nodes, 754 on tree, 1e+50 best solution, best possible 0 (131.83 seconds)\n", - "Cbc0010I After 767000 nodes, 737 on tree, 1e+50 best solution, best possible 0 (131.91 seconds)\n", - "Cbc0010I After 768000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (132.00 seconds)\n", - "Cbc0010I After 769000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (132.16 seconds)\n", - "Cbc0010I After 770000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (132.31 seconds)\n", - "Cbc0010I After 771000 nodes, 818 on tree, 1e+50 best solution, best possible 0 (132.42 seconds)\n", - "Cbc0010I After 772000 nodes, 757 on tree, 1e+50 best solution, best possible 0 (132.56 seconds)\n", - "Cbc0010I After 773000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (132.68 seconds)\n", - "Cbc0010I After 774000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (132.81 seconds)\n", - "Cbc0010I After 775000 nodes, 859 on tree, 1e+50 best solution, best possible 0 (132.93 seconds)\n", - "Cbc0010I After 776000 nodes, 848 on tree, 1e+50 best solution, best possible 0 (133.06 seconds)\n", - "Cbc0010I After 777000 nodes, 821 on tree, 1e+50 best solution, best possible 0 (133.17 seconds)\n", - "Cbc0010I After 778000 nodes, 817 on tree, 1e+50 best solution, best possible 0 (133.31 seconds)\n", - "Cbc0010I After 779000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (133.41 seconds)\n", - "Cbc0010I After 780000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (133.56 seconds)\n", - "Cbc0010I After 781000 nodes, 777 on tree, 1e+50 best solution, best possible 0 (133.69 seconds)\n", - "Cbc0010I After 782000 nodes, 755 on tree, 1e+50 best solution, best possible 0 (133.80 seconds)\n", - "Cbc0010I After 783000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (133.95 seconds)\n", - "Cbc0010I After 784000 nodes, 725 on tree, 1e+50 best solution, best possible 0 (134.06 seconds)\n", - "Cbc0010I After 785000 nodes, 722 on tree, 1e+50 best solution, best possible 0 (134.17 seconds)\n", - "Cbc0010I After 786000 nodes, 713 on tree, 1e+50 best solution, best possible 0 (134.27 seconds)\n", - "Cbc0010I After 787000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (134.42 seconds)\n", - "Cbc0010I After 788000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (134.54 seconds)\n", - "Cbc0010I After 789000 nodes, 693 on tree, 1e+50 best solution, best possible 0 (134.65 seconds)\n", - "Cbc0010I After 790000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (134.73 seconds)\n", - "Cbc0010I After 791000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (134.82 seconds)\n", - "Cbc0010I After 792000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (134.91 seconds)\n", - "Cbc0010I After 793000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (135.00 seconds)\n", - "Cbc0010I After 794000 nodes, 764 on tree, 1e+50 best solution, best possible 0 (135.09 seconds)\n", - "Cbc0010I After 795000 nodes, 751 on tree, 1e+50 best solution, best possible 0 (135.20 seconds)\n", - "Cbc0010I After 796000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (135.30 seconds)\n", - "Cbc0010I After 797000 nodes, 731 on tree, 1e+50 best solution, best possible 0 (135.40 seconds)\n", - "Cbcs, 70 on tree, 1e+50 best solution, best possible 0 (372.28 seconds)\n", - "Cbc0010I After 3749000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (372.40 seconds)\n", - "Cbc0010I After 3750000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (372.54 seconds)\n", - "Cbc0010I After 3751000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (372.69 seconds)\n", - "Cbc0010I After 3752000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (372.85 seconds)\n", - "Cbc0010I After 3753000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (372.98 seconds)\n", - "Cbc0010I After 3754000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (373.11 seconds)\n", - "Cbc0010I After 3755000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (373.23 seconds)\n", - "Cbc0010I After 3756000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (373.38 seconds)\n", - "Cbc0010I After 3757000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (373.50 seconds)\n", - "Cbc0010I After 3758000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (373.64 seconds)\n", - "Cbc0010I After 3759000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (373.77 seconds)\n", - "Cbc0010I After 3760000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (373.92 seconds)\n", - "Cbc0010I After 3761000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (374.08 seconds)\n", - "Cbc0010I After 3762000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (374.22 seconds)\n", - "Cbc0010I After 3763000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (374.40 seconds)\n", - "Cbc0010I After 3764000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (374.53 seconds)\n", - "Cbc0010I After 3765000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (374.67 seconds)\n", - "Cbc0010I After 3766000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (374.81 seconds)\n", - "Cbc0010I After 3767000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (374.96 seconds)\n", - "Cbc0010I After 3768000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (375.10 seconds)\n", - "Cbc0010I After 3769000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (375.23 seconds)\n", - "Cbc0010I After 3770000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (375.36 seconds)\n", - "Cbc0010I After 3771000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (375.49 seconds)\n", - "Cbc0010I After 3772000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (375.64 seconds)\n", - "Cbc0010I After 3773000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (375.78 seconds)\n", - "Cbc0010I After 3774000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (375.91 seconds)\n", - "Cbc0010I After 3775000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (376.02 seconds)\n", - "Cbc0010I After 3776000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (376.15 seconds)\n", - "Cbc0010I After 3777000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (376.31 seconds)\n", - "Cbc0010I After 3778000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (376.47 seconds)\n", - "Cbc0010I After 3779000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (376.60 seconds)\n", - "Cbc0010I After 3780000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (376.75 seconds)\n", - "Cbc0010I After 3781000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (376.90 seconds)\n", - "Cbc0010I After 3782000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (377.05 seconds)\n", - "Cbc0010I After 3783000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (377.19 seconds)\n", - "Cbc0010I After 3784000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (377.35 seconds)\n", - "Cbc0010I After 3785000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (377.46 seconds)\n", - "Cbc0010I After 3786000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (377.50 seconds)\n", - "Cbc0010I After 3787000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (377.54 seconds)\n", - "Cbc0010I After 3788000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (377.58 seconds)\n", - "Cbc0010I After 3789000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (377.64 seconds)\n", - "Cbc0010I After 3790000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (377.79 seco0010I After 798000 nodes, 734 on tree, 1e+50 best solution, best possible 0 (135.48 seconds)\n", - "Cbc0010I After 799000 nodes, 718 on tree, 1e+50 best solution, best possible 0 (135.57 seconds)\n", - "Cbc0010I After 800000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (135.65 seconds)\n", - "Cbc0010I After 801000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (135.75 seconds)\n", - "Cbc0010I After 802000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (135.85 seconds)\n", - "Cbc0010I After 803000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (135.96 seconds)\n", - "Cbc0010I After 804000 nodes, 698 on tree, 1e+50 best solution, best possible 0 (136.04 seconds)\n", - "Cbc0010I After 805000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (136.13 seconds)\n", - "Cbc0010I After 806000 nodes, 792 on tree, 1e+50 best solution, best possible 0 (136.25 seconds)\n", - "Cbc0010I After 807000 nodes, 776 on tree, 1e+50 best solution, best possible 0 (136.35 seconds)\n", - "Cbc0010I After 808000 nodes, 758 on tree, 1e+50 best solution, best possible 0 (136.44 seconds)\n", - "Cbc0010I After 809000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (136.54 seconds)\n", - "Cbc0010I After 810000 nodes, 752 on tree, 1e+50 best solution, best possible 0 (136.62 seconds)\n", - "Cbc0010I After 811000 nodes, 738 on tree, 1e+50 best solution, best possible 0 (136.72 seconds)\n", - "Cbc0010I After 812000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (136.82 seconds)\n", - "Cbc0010I After 813000 nodes, 716 on tree, 1e+50 best solution, best possible 0 (136.93 seconds)\n", - "Cbc0010I After 814000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (137.00 seconds)\n", - "Cbc0010I After 815000 nodes, 722 on tree, 1e+50 best solution, best possible 0 (137.08 seconds)\n", - "Cbc0010I After 816000 nodes, 716 on tree, 1e+50 best solution, best possible 0 (137.15 seconds)\n", - "Cbc0010I After 817000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (137.24 seconds)\n", - "Cbc0010I After 818000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (137.33 seconds)\n", - "Cbc0010I After 819000 nodes, 677 on tree, 1e+50 best solution, best possible 0 (137.42 seconds)\n", - "Cbc0010I After 820000 nodes, 730 on tree, 1e+50 best solution, best possible 0 (137.53 seconds)\n", - "Cbc0010I After 821000 nodes, 689 on tree, 1e+50 best solution, best possible 0 (137.67 seconds)\n", - "Cbc0010I After 822000 nodes, 798 on tree, 1e+50 best solution, best possible 0 (137.84 seconds)\n", - "Cbc0010I After 823000 nodes, 742 on tree, 1e+50 best solution, best possible 0 (137.98 seconds)\n", - "Cbc0010I After 824000 nodes, 697 on tree, 1e+50 best solution, best possible 0 (138.11 seconds)\n", - "Cbc0010I After 825000 nodes, 706 on tree, 1e+50 best solution, best possible 0 (138.26 seconds)\n", - "Cbc0010I After 826000 nodes, 863 on tree, 1e+50 best solution, best possible 0 (138.39 seconds)\n", - "Cbc0010I After 827000 nodes, 847 on tree, 1e+50 best solution, best possible 0 (138.52 seconds)\n", - "Cbc0010I After 828000 nodes, 805 on tree, 1e+50 best solution, best possible 0 (138.65 seconds)\n", - "Cbc0010I After 829000 nodes, 790 on tree, 1e+50 best solution, best possible 0 (138.86 seconds)\n", - "Cbc0010I After 830000 nodes, 785 on tree, 1e+50 best solution, best possible 0 (139.04 seconds)\n", - "Cbc0010I After 831000 nodes, 782 on tree, 1e+50 best solution, best possible 0 (139.30 seconds)\n", - "Cbc0010I After 832000 nodes, 780 on tree, 1e+50 best solution, best possible 0 (139.62 seconds)\n", - "Cbc0010I After 833000 nodes, 748 on tree, 1e+50 best solution, best possible 0 (139.82 seconds)\n", - "Cbc0010I After 834000 nodes, 739 on tree, 1e+50 best solution, best possible 0 (140.06 seconds)\n", - "Cbc0010I After 835000 nodes, 715 on tree, 1e+50 best solution, best possible 0 (140.36 seconds)\n", - "Cbc0010I After 836000 nodes, 726 on tree, 1e+50 best solution, best possible 0 (140.52 seconds)\n", - "Cbc0010I After 837000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (140.76 seconds)\n", - "Cbc0010I After 838000 nodes, 704 on tree, 1e+50 best solution, best possible 0 (141.01 seconds)\n", - "Cbc0010I After 839000 nodes, 672 on tree, 1e+50 best solution, best possible 0 (141.18 seconds)\n", - "Cbc0010I After 840000 nodes, 662 on tree, 1e+50 best solution, bestnds)\n", - "Cbc0010I After 3791000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (377.91 seconds)\n", - "Cbc0010I After 3792000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (378.05 seconds)\n", - "Cbc0010I After 3793000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (378.14 seconds)\n", - "Cbc0010I After 3794000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (378.29 seconds)\n", - "Cbc0010I After 3795000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (378.38 seconds)\n", - "Cbc0010I After 3796000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (378.52 seconds)\n", - "Cbc0010I After 3797000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (378.63 seconds)\n", - "Cbc0010I After 3798000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (378.71 seconds)\n", - "Cbc0010I After 3799000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (378.75 seconds)\n", - "Cbc0010I After 3800000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (378.80 seconds)\n", - "Cbc0010I After 3801000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (378.85 seconds)\n", - "Cbc0010I After 3802000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (378.90 seconds)\n", - "Cbc0010I After 3803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (378.95 seconds)\n", - "Cbc0010I After 3804000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (378.99 seconds)\n", - "Cbc0010I After 3805000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (379.04 seconds)\n", - "Cbc0010I After 3806000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (379.08 seconds)\n", - "Cbc0010I After 3807000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (379.18 seconds)\n", - "Cbc0010I After 3808000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (379.37 seconds)\n", - "Cbc0010I After 3809000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (379.52 seconds)\n", - "Cbc0010I After 3810000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (379.73 seconds)\n", - "Cbc0010I After 3811000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (379.94 seconds)\n", - "Cbc0010I After 3812000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (380.21 seconds)\n", - "Cbc0010I After 3813000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (380.41 seconds)\n", - "Cbc0010I After 3814000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (380.64 seconds)\n", - "Cbc0010I After 3815000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (380.81 seconds)\n", - "Cbc0010I After 3816000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (380.98 seconds)\n", - "Cbc0010I After 3817000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (381.12 seconds)\n", - "Cbc0010I After 3818000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (381.34 seconds)\n", - "Cbc0010I After 3819000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (381.53 seconds)\n", - "Cbc0010I After 3820000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (381.64 seconds)\n", - "Cbc0010I After 3821000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (381.78 seconds)\n", - "Cbc0010I After 3822000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (381.93 seconds)\n", - "Cbc0010I After 3823000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (382.15 seconds)\n", - "Cbc0010I After 3824000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (382.35 seconds)\n", - "Cbc0010I After 3825000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (382.55 seconds)\n", - "Cbc0010I After 3826000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (382.71 seconds)\n", - "Cbc0010I After 3827000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (382.89 seconds)\n", - "Cbc0010I After 3828000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (383.09 seconds)\n", - "Cbc0010I After 3829000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (383.25 seconds)\n", - "Cbc0010I After 3830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (383.35 seconds)\n", - "Cbc0010I After 3831000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (383.45 seconds)\n", - "Cbc0010I After 3832000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (383.56 seconds)\n", - "Cbc0010I After 3833000 nodes, 108 on tree, 1e+50 possible 0 (141.35 seconds)\n", - "Cbc0010I After 841000 nodes, 701 on tree, 1e+50 best solution, best possible 0 (141.49 seconds)\n", - "Cbc0010I After 842000 nodes, 834 on tree, 1e+50 best solution, best possible 0 (141.76 seconds)\n", - "Cbc0010I After 843000 nodes, 835 on tree, 1e+50 best solution, best possible 0 (142.01 seconds)\n", - "Cbc0010I After 844000 nodes, 793 on tree, 1e+50 best solution, best possible 0 (142.20 seconds)\n", - "Cbc0010I After 845000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (142.43 seconds)\n", - "Cbc0010I After 846000 nodes, 795 on tree, 1e+50 best solution, best possible 0 (142.62 seconds)\n", - "Cbc0010I After 847000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (142.81 seconds)\n", - "Cbc0010I After 848000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (142.93 seconds)\n", - "Cbc0010I After 849000 nodes, 745 on tree, 1e+50 best solution, best possible 0 (143.07 seconds)\n", - "Cbc0010I After 850000 nodes, 707 on tree, 1e+50 best solution, best possible 0 (143.19 seconds)\n", - "Cbc0010I After 851000 nodes, 709 on tree, 1e+50 best solution, best possible 0 (143.30 seconds)\n", - "Cbc0010I After 852000 nodes, 695 on tree, 1e+50 best solution, best possible 0 (143.41 seconds)\n", - "Cbc0010I After 853000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (143.53 seconds)\n", - "Cbc0010I After 854000 nodes, 671 on tree, 1e+50 best solution, best possible 0 (143.68 seconds)\n", - "Cbc0010I After 855000 nodes, 667 on tree, 1e+50 best solution, best possible 0 (143.81 seconds)\n", - "Cbc0010I After 856000 nodes, 683 on tree, 1e+50 best solution, best possible 0 (143.93 seconds)\n", - "Cbc0010I After 857000 nodes, 658 on tree, 1e+50 best solution, best possible 0 (144.07 seconds)\n", - "Cbc0010I After 858000 nodes, 858 on tree, 1e+50 best solution, best possible 0 (144.19 seconds)\n", - "Cbc0010I After 859000 nodes, 823 on tree, 1e+50 best solution, best possible 0 (144.33 seconds)\n", - "Cbc0010I After 860000 nodes, 796 on tree, 1e+50 best solution, best possible 0 (144.45 seconds)\n", - "Cbc0010I After 861000 nodes, 784 on tree, 1e+50 best solution, best possible 0 (144.58 seconds)\n", - "Cbc0010I After 862000 nodes, 783 on tree, 1e+50 best solution, best possible 0 (144.67 seconds)\n", - "Cbc0010I After 863000 nodes, 761 on tree, 1e+50 best solution, best possible 0 (144.82 seconds)\n", - "Cbc0010I After 864000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (144.91 seconds)\n", - "Cbc0010I After 865000 nodes, 729 on tree, 1e+50 best solution, best possible 0 (145.10 seconds)\n", - "Cbc0010I After 866000 nodes, 724 on tree, 1e+50 best solution, best possible 0 (145.18 seconds)\n", - "Cbc0010I After 867000 nodes, 717 on tree, 1e+50 best solution, best possible 0 (145.31 seconds)\n", - "Cbc0010I After 868000 nodes, 697 on tree, 1e+50 best solution, best possible 0 (145.41 seconds)\n", - "Cbc0010I After 869000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (145.48 seconds)\n", - "Cbc0010I After 870000 nodes, 698 on tree, 1e+50 best solution, best possible 0 (145.59 seconds)\n", - "Cbc0010I After 871000 nodes, 687 on tree, 1e+50 best solution, best possible 0 (145.71 seconds)\n", - "Cbc0010I After 872000 nodes, 664 on tree, 1e+50 best solution, best possible 0 (145.78 seconds)\n", - "Cbc0010I After 873000 nodes, 676 on tree, 1e+50 best solution, best possible 0 (145.98 seconds)\n", - "Cbc0010I After 874000 nodes, 648 on tree, 1e+50 best solution, best possible 0 (146.21 seconds)\n", - "Cbc0010I After 875000 nodes, 759 on tree, 1e+50 best solution, best possible 0 (146.40 seconds)\n", - "Cbc0010I After 876000 nodes, 710 on tree, 1e+50 best solution, best possible 0 (146.62 seconds)\n", - "Cbc0010I After 877000 nodes, 673 on tree, 1e+50 best solution, best possible 0 (146.83 seconds)\n", - "Cbc0010I After 878000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (147.00 seconds)\n", - "Cbc0010I After 879000 nodes, 771 on tree, 1e+50 best solution, best possible 0 (147.11 seconds)\n", - "Cbc0010I After 880000 nodes, 741 on tree, 1e+50 best solution, best possible 0 (147.20 seconds)\n", - "Cbc0010I After 881000 nodes, 719 on tree, 1e+50 best solution, best possible 0 (147.28 seconds)\n", - "Cbc0010I After 882000 nodes, 694 on tree, 1e+50 best solution, best possible 0 (147.35 seconds)\n", - "Cbc0010I After 883000 nodes, 701 on best solution, best possible 0 (383.66 seconds)\n", - "Cbc0010I After 3834000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (383.75 seconds)\n", - "Cbc0010I After 3835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (383.88 seconds)\n", - "Cbc0010I After 3836000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (383.99 seconds)\n", - "Cbc0010I After 3837000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (384.13 seconds)\n", - "Cbc0010I After 3838000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (384.26 seconds)\n", - "Cbc0010I After 3839000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (384.38 seconds)\n", - "Cbc0010I After 3840000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (384.50 seconds)\n", - "Cbc0010I After 3841000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (384.61 seconds)\n", - "Cbc0010I After 3842000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (384.71 seconds)\n", - "Cbc0010I After 3843000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (384.79 seconds)\n", - "Cbc0010I After 3844000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (384.90 seconds)\n", - "Cbc0010I After 3845000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (385.01 seconds)\n", - "Cbc0010I After 3846000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (385.12 seconds)\n", - "Cbc0010I After 3847000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (385.21 seconds)\n", - "Cbc0010I After 3848000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (385.31 seconds)\n", - "Cbc0010I After 3849000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (385.41 seconds)\n", - "Cbc0010I After 3850000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (385.57 seconds)\n", - "Cbc0010I After 3851000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (385.65 seconds)\n", - "Cbc0010I After 3852000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (385.77 seconds)\n", - "Cbc0010I After 3853000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (385.87 seconds)\n", - "Cbc0010I After 3854000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (385.94 seconds)\n", - "Cbc0010I After 3855000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (386.00 seconds)\n", - "Cbc0010I After 3856000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (386.08 seconds)\n", - "Cbc0010I After 3857000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (386.17 seconds)\n", - "Cbc0010I After 3858000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (386.24 seconds)\n", - "Cbc0010I After 3859000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (386.37 seconds)\n", - "Cbc0010I After 3860000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (386.49 seconds)\n", - "Cbc0010I After 3861000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (386.69 seconds)\n", - "Cbc0010I After 3862000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (386.81 seconds)\n", - "Cbc0010I After 3863000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (386.90 seconds)\n", - "Cbc0010I After 3864000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (387.11 seconds)\n", - "Cbc0010I After 3865000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (387.26 seconds)\n", - "Cbc0010I After 3866000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (387.42 seconds)\n", - "Cbc0010I After 3867000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (387.54 seconds)\n", - "Cbc0010I After 3868000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (387.65 seconds)\n", - "Cbc0010I After 3869000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (387.74 seconds)\n", - "Cbc0010I After 3870000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (387.85 seconds)\n", - "Cbc0010I After 3871000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (387.98 seconds)\n", - "Cbc0010I After 3872000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (388.09 seconds)\n", - "Cbc0010I After 3873000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (388.22 seconds)\n", - "Cbc0010I After 3874000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (388.32 seconds)\n", - "Cbc0010I After 3875000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (388.44 seconds)\n", - "Cbc tree, 1e+50 best solution, best possible 0 (147.47 seconds)\n", - "Cbc0010I After 884000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (147.58 seconds)\n", - "Cbc0010I After 885000 nodes, 692 on tree, 1e+50 best solution, best possible 0 (147.64 seconds)\n", - "Cbc0010I After 886000 nodes, 666 on tree, 1e+50 best solution, best possible 0 (147.72 seconds)\n", - "Cbc0010I After 887000 nodes, 659 on tree, 1e+50 best solution, best possible 0 (147.82 seconds)\n", - "Cbc0010I After 888000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (147.90 seconds)\n", - "Cbc0010I After 889000 nodes, 664 on tree, 1e+50 best solution, best possible 0 (148.03 seconds)\n", - "Cbc0010I After 890000 nodes, 651 on tree, 1e+50 best solution, best possible 0 (148.17 seconds)\n", - "Cbc0010I After 891000 nodes, 649 on tree, 1e+50 best solution, best possible 0 (148.31 seconds)\n", - "Cbc0010I After 892000 nodes, 633 on tree, 1e+50 best solution, best possible 0 (148.44 seconds)\n", - "Cbc0010I After 893000 nodes, 627 on tree, 1e+50 best solution, best possible 0 (148.61 seconds)\n", - "Cbc0010I After 894000 nodes, 721 on tree, 1e+50 best solution, best possible 0 (148.84 seconds)\n", - "Cbc0010I After 895000 nodes, 669 on tree, 1e+50 best solution, best possible 0 (149.12 seconds)\n", - "Cbc0010I After 896000 nodes, 631 on tree, 1e+50 best solution, best possible 0 (149.35 seconds)\n", - "Cbc0010I After 897000 nodes, 607 on tree, 1e+50 best solution, best possible 0 (149.50 seconds)\n", - "Cbc0010I After 898000 nodes, 779 on tree, 1e+50 best solution, best possible 0 (149.62 seconds)\n", - "Cbc0010I After 899000 nodes, 744 on tree, 1e+50 best solution, best possible 0 (149.77 seconds)\n", - "Cbc0010I After 900000 nodes, 750 on tree, 1e+50 best solution, best possible 0 (149.92 seconds)\n", - "Cbc0010I After 901000 nodes, 713 on tree, 1e+50 best solution, best possible 0 (150.04 seconds)\n", - "Cbc0010I After 902000 nodes, 686 on tree, 1e+50 best solution, best possible 0 (150.19 seconds)\n", - "Cbc0010I After 903000 nodes, 702 on tree, 1e+50 best solution, best possible 0 (150.35 seconds)\n", - "Cbc0010I After 904000 nodes, 671 on tree, 1e+50 best solution, best possible 0 (150.47 seconds)\n", - "Cbc0010I After 905000 nodes, 661 on tree, 1e+50 best solution, best possible 0 (150.60 seconds)\n", - "Cbc0010I After 906000 nodes, 647 on tree, 1e+50 best solution, best possible 0 (150.75 seconds)\n", - "Cbc0010I After 907000 nodes, 634 on tree, 1e+50 best solution, best possible 0 (150.86 seconds)\n", - "Cbc0010I After 908000 nodes, 633 on tree, 1e+50 best solution, best possible 0 (150.95 seconds)\n", - "Cbc0010I After 909000 nodes, 623 on tree, 1e+50 best solution, best possible 0 (151.05 seconds)\n", - "Cbc0010I After 910000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (151.18 seconds)\n", - "Cbc0010I After 911000 nodes, 616 on tree, 1e+50 best solution, best possible 0 (151.30 seconds)\n", - "Cbc0010I After 912000 nodes, 593 on tree, 1e+50 best solution, best possible 0 (151.41 seconds)\n", - "Cbc0010I After 913000 nodes, 584 on tree, 1e+50 best solution, best possible 0 (151.49 seconds)\n", - "Cbc0010I After 914000 nodes, 596 on tree, 1e+50 best solution, best possible 0 (151.60 seconds)\n", - "Cbc0010I After 915000 nodes, 626 on tree, 1e+50 best solution, best possible 0 (151.71 seconds)\n", - "Cbc0010I After 916000 nodes, 583 on tree, 1e+50 best solution, best possible 0 (151.82 seconds)\n", - "Cbc0010I After 917000 nodes, 566 on tree, 1e+50 best solution, best possible 0 (151.91 seconds)\n", - "Cbc0010I After 918000 nodes, 743 on tree, 1e+50 best solution, best possible 0 (152.01 seconds)\n", - "Cbc0010I After 919000 nodes, 707 on tree, 1e+50 best solution, best possible 0 (152.15 seconds)\n", - "Cbc0010I After 920000 nodes, 688 on tree, 1e+50 best solution, best possible 0 (152.29 seconds)\n", - "Cbc0010I After 921000 nodes, 660 on tree, 1e+50 best solution, best possible 0 (152.48 seconds)\n", - "Cbc0010I After 922000 nodes, 665 on tree, 1e+50 best solution, best possible 0 (152.64 seconds)\n", - "Cbc0010I After 923000 nodes, 635 on tree, 1e+50 best solution, best possible 0 (152.85 seconds)\n", - "Cbc0010I After 924000 nodes, 625 on tree, 1e+50 best solution, best possible 0 (153.15 seconds)\n", - "Cbc0010I After 925000 nodes, 624 on tree, 1e+50 best solution, best possible 0 (153.35 seconds)\n", - "Cbc0010I After 3876000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (388.63 seconds)\n", - "Cbc0010I After 3877000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (388.77 seconds)\n", - "Cbc0010I After 3878000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (388.95 seconds)\n", - "Cbc0010I After 3879000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (389.17 seconds)\n", - "Cbc0010I After 3880000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (389.36 seconds)\n", - "Cbc0010I After 3881000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (389.62 seconds)\n", - "Cbc0010I After 3882000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (389.82 seconds)\n", - "Cbc0010I After 3883000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (389.97 seconds)\n", - "Cbc0010I After 3884000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (390.05 seconds)\n", - "Cbc0010I After 3885000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (390.16 seconds)\n", - "Cbc0010I After 3886000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (390.25 seconds)\n", - "Cbc0010I After 3887000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (390.37 seconds)\n", - "Cbc0010I After 3888000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (390.48 seconds)\n", - "Cbc0010I After 3889000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (390.58 seconds)\n", - "Cbc0010I After 3890000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (390.72 seconds)\n", - "Cbc0010I After 3891000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (390.84 seconds)\n", - "Cbc0010I After 3892000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (390.96 seconds)\n", - "Cbc0010I After 3893000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (391.07 seconds)\n", - "Cbc0010I After 3894000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (391.19 seconds)\n", - "Cbc0010I After 3895000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (391.28 seconds)\n", - "Cbc0010I After 3896000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (391.38 seconds)\n", - "Cbc0010I After 3897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (391.46 seconds)\n", - "Cbc0010I After 3898000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (391.55 seconds)\n", - "Cbc0010I After 3899000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (391.66 seconds)\n", - "Cbc0010I After 3900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (391.77 seconds)\n", - "Cbc0010I After 3901000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (391.85 seconds)\n", - "Cbc0010I After 3902000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (391.94 seconds)\n", - "Cbc0010I After 3903000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (392.05 seconds)\n", - "Cbc0010I After 3904000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (392.15 seconds)\n", - "Cbc0010I After 3905000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (392.22 seconds)\n", - "Cbc0010I After 3906000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (392.31 seconds)\n", - "Cbc0010I After 3907000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (392.45 seconds)\n", - "Cbc0010I After 3908000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (392.59 seconds)\n", - "Cbc0010I After 3909000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (392.69 seconds)\n", - "Cbc0010I After 3910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (392.82 seconds)\n", - "Cbc0010I After 3911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (393.04 seconds)\n", - "Cbc0010I After 3912000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (393.18 seconds)\n", - "Cbc0010I After 3913000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (393.43 seconds)\n", - "Cbc0010I After 3914000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (393.66 seconds)\n", - "Cbc0010I After 3915000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (393.81 seconds)\n", - "Cbc0010I After 3916000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (393.92 seconds)\n", - "Cbc0010I After 3917000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (394.12 seconds)\n", - "Cbc0010I After 3918000 nodes, 61 on tree, 1e+50 best solution0010I After 926000 nodes, 622 on tree, 1e+50 best solution, best possible 0 (153.55 seconds)\n", - "Cbc0010I After 927000 nodes, 618 on tree, 1e+50 best solution, best possible 0 (153.82 seconds)\n", - "Cbc0010I After 928000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (154.01 seconds)\n", - "Cbc0010I After 929000 nodes, 615 on tree, 1e+50 best solution, best possible 0 (154.27 seconds)\n", - "Cbc0010I After 930000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (154.45 seconds)\n", - "Cbc0010I After 931000 nodes, 590 on tree, 1e+50 best solution, best possible 0 (154.60 seconds)\n", - "Cbc0010I After 932000 nodes, 553 on tree, 1e+50 best solution, best possible 0 (154.71 seconds)\n", - "Cbc0010I After 933000 nodes, 669 on tree, 1e+50 best solution, best possible 0 (154.80 seconds)\n", - "Cbc0010I After 934000 nodes, 637 on tree, 1e+50 best solution, best possible 0 (154.88 seconds)\n", - "Cbc0010I After 935000 nodes, 625 on tree, 1e+50 best solution, best possible 0 (154.99 seconds)\n", - "Cbc0010I After 936000 nodes, 631 on tree, 1e+50 best solution, best possible 0 (155.10 seconds)\n", - "Cbc0010I After 937000 nodes, 601 on tree, 1e+50 best solution, best possible 0 (155.20 seconds)\n", - "Cbc0010I After 938000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (155.31 seconds)\n", - "Cbc0010I After 939000 nodes, 595 on tree, 1e+50 best solution, best possible 0 (155.44 seconds)\n", - "Cbc0010I After 940000 nodes, 604 on tree, 1e+50 best solution, best possible 0 (155.57 seconds)\n", - "Cbc0010I After 941000 nodes, 582 on tree, 1e+50 best solution, best possible 0 (155.70 seconds)\n", - "Cbc0010I After 942000 nodes, 564 on tree, 1e+50 best solution, best possible 0 (155.84 seconds)\n", - "Cbc0010I After 943000 nodes, 560 on tree, 1e+50 best solution, best possible 0 (155.97 seconds)\n", - "Cbc0010I After 944000 nodes, 561 on tree, 1e+50 best solution, best possible 0 (156.11 seconds)\n", - "Cbc0010I After 945000 nodes, 576 on tree, 1e+50 best solution, best possible 0 (156.22 seconds)\n", - "Cbc0010I After 946000 nodes, 560 on tree, 1e+50 best solution, best possible 0 (156.34 seconds)\n", - "Cbc0010I After 947000 nodes, 557 on tree, 1e+50 best solution, best possible 0 (156.45 seconds)\n", - "Cbc0010I After 948000 nodes, 548 on tree, 1e+50 best solution, best possible 0 (156.55 seconds)\n", - "Cbc0010I After 949000 nodes, 641 on tree, 1e+50 best solution, best possible 0 (156.66 seconds)\n", - "Cbc0010I After 950000 nodes, 642 on tree, 1e+50 best solution, best possible 0 (156.76 seconds)\n", - "Cbc0010I After 951000 nodes, 640 on tree, 1e+50 best solution, best possible 0 (156.85 seconds)\n", - "Cbc0010I After 952000 nodes, 615 on tree, 1e+50 best solution, best possible 0 (156.96 seconds)\n", - "Cbc0010I After 953000 nodes, 594 on tree, 1e+50 best solution, best possible 0 (157.07 seconds)\n", - "Cbc0010I After 954000 nodes, 579 on tree, 1e+50 best solution, best possible 0 (157.16 seconds)\n", - "Cbc0010I After 955000 nodes, 577 on tree, 1e+50 best solution, best possible 0 (157.25 seconds)\n", - "Cbc0010I After 956000 nodes, 578 on tree, 1e+50 best solution, best possible 0 (157.36 seconds)\n", - "Cbc0010I After 957000 nodes, 569 on tree, 1e+50 best solution, best possible 0 (157.45 seconds)\n", - "Cbc0010I After 958000 nodes, 569 on tree, 1e+50 best solution, best possible 0 (157.54 seconds)\n", - "Cbc0010I After 959000 nodes, 559 on tree, 1e+50 best solution, best possible 0 (157.61 seconds)\n", - "Cbc0010I After 960000 nodes, 537 on tree, 1e+50 best solution, best possible 0 (157.69 seconds)\n", - "Cbc0010I After 961000 nodes, 543 on tree, 1e+50 best solution, best possible 0 (157.77 seconds)\n", - "Cbc0010I After 962000 nodes, 571 on tree, 1e+50 best solution, best possible 0 (157.85 seconds)\n", - "Cbc0010I After 963000 nodes, 541 on tree, 1e+50 best solution, best possible 0 (157.94 seconds)\n", - "Cbc0010I After 964000 nodes, 534 on tree, 1e+50 best solution, best possible 0 (158.05 seconds)\n", - "Cbc0010I After 965000 nodes, 542 on tree, 1e+50 best solution, best possible 0 (158.15 seconds)\n", - "Cbc0010I After 966000 nodes, 493 on tree, 1e+50 best solution, best possible 0 (158.25 seconds)\n", - "Cbc0010I After 967000 nodes, 592 on tree, 1e+50 best solution, best possible 0 (158.39 seconds)\n", - "Cbc0010I After 968000 nodes, 546 on tree, 1e+50 best solution, best, best possible 0 (394.37 seconds)\n", - "Cbc0010I After 3919000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (394.56 seconds)\n", - "Cbc0010I After 3920000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (394.80 seconds)\n", - "Cbc0010I After 3921000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (394.93 seconds)\n", - "Cbc0010I After 3922000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (395.08 seconds)\n", - "Cbc0010I After 3923000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (395.19 seconds)\n", - "Cbc0010I After 3924000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (395.29 seconds)\n", - "Cbc0010I After 3925000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (395.39 seconds)\n", - "Cbc0010I After 3926000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (395.47 seconds)\n", - "Cbc0010I After 3927000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (395.56 seconds)\n", - "Cbc0010I After 3928000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (395.70 seconds)\n", - "Cbc0010I After 3929000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (395.85 seconds)\n", - "Cbc0010I After 3930000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (395.99 seconds)\n", - "Cbc0010I After 3931000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (396.07 seconds)\n", - "Cbc0010I After 3932000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (396.15 seconds)\n", - "Cbc0010I After 3933000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (396.34 seconds)\n", - "Cbc0010I After 3934000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (396.56 seconds)\n", - "Cbc0010I After 3935000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (396.74 seconds)\n", - "Cbc0010I After 3936000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (396.91 seconds)\n", - "Cbc0010I After 3937000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (397.08 seconds)\n", - "Cbc0010I After 3938000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (397.14 seconds)\n", - "Cbc0010I After 3939000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (397.24 seconds)\n", - "Cbc0010I After 3940000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (397.33 seconds)\n", - "Cbc0010I After 3941000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (397.44 seconds)\n", - "Cbc0010I After 3942000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (397.50 seconds)\n", - "Cbc0010I After 3943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (397.60 seconds)\n", - "Cbc0010I After 3944000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (397.68 seconds)\n", - "Cbc0010I After 3945000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (397.76 seconds)\n", - "Cbc0010I After 3946000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (397.87 seconds)\n", - "Cbc0010I After 3947000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (397.96 seconds)\n", - "Cbc0010I After 3948000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (398.09 seconds)\n", - "Cbc0010I After 3949000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (398.22 seconds)\n", - "Cbc0010I After 3950000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (398.34 seconds)\n", - "Cbc0010I After 3951000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (398.48 seconds)\n", - "Cbc0010I After 3952000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (398.60 seconds)\n", - "Cbc0010I After 3953000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (398.72 seconds)\n", - "Cbc0010I After 3954000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (398.86 seconds)\n", - "Cbc0010I After 3955000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (399.00 seconds)\n", - "Cbc0010I After 3956000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (399.12 seconds)\n", - "Cbc0010I After 3957000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (399.29 seconds)\n", - "Cbc0010I After 3958000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (399.50 seconds)\n", - "Cbc0010I After 3959000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (399.65 seconds)\n", - "Cbc0010I After 3960000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (399.80 seconds)\n", - "Cbc0010I After 3961000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (399.87 seconds)\n", - "Cbc0010I After 3962000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (399.98 seconds)\n", - "Cbc0010I After 3963000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (400.04 seconds)\n", - "Cbc0010I After 3964000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (400.17 seconds)\n", - "Cbc0010I After 3965000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (400.32 seconds)\n", - "Cbc0010I After 3966000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (400.49 seconds)\n", - "Cbc0010I After 3967000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (400.66 seconds)\n", - "Cbc0010I After 3968000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (400.83 seconds)\n", - "Cbc0010I After 3969000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (401.00 seconds)\n", - "Cbc0010I After 3970000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (401.13 seconds)\n", - "Cbc0010I After 3971000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (401.28 seconds)\n", - "Cbc0010I After 3972000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (401.46 seconds)\n", - "Cbc0010I After 3973000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (401.62 seconds)\n", - "Cbc0010I After 3974000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (401.77 seconds)\n", - "Cbc0010I After 3975000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (401.91 seconds)\n", - "Cbc0010I After 3976000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (402.04 seconds)\n", - "Cbc0010I After 3977000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (402.16 seconds)\n", - "Cbc0010I After 3978000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (402.27 seconds)\n", - "Cbc0010I After 3979000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (402.41 seconds)\n", - "Cbc0010I After 3980000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (402.57 seconds)\n", - "Cbc0010I After 3981000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (402.67 seconds)\n", - "Cbc0010I After 3982000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (402.75 seconds)\n", - "Cbc0010I After 3983000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (402.80 seconds)\n", - "Cbc0010I After 3984000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (402.94 seconds)\n", - "Cbc0010I After 3985000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (403.13 seconds)\n", - "Cbc0010I After 3986000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (403.23 seconds)\n", - "Cbc0010I After 3987000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (403.30 seconds)\n", - "Cbc0010I After 3988000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (403.37 seconds)\n", - "Cbc0010I After 3989000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (403.48 seconds)\n", - "Cbc0010I After 3990000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (403.56 seconds)\n", - "Cbc0010I After 3991000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (403.66 seconds)\n", - "Cbc0010I After 3992000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (403.82 seconds)\n", - "Cbc0010I After 3993000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (403.96 seconds)\n", - "Cbc0010I After 3994000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (404.10 seconds)\n", - "Cbc0010I After 3995000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (404.19 seconds)\n", - "Cbc0010I After 3996000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (404.27 seconds)\n", - "Cbc0010I After 3997000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (404.43 seconds)\n", - "Cbc0010I After 3998000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (404.60 seconds)\n", - "Cbc0010I After 3999000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (404.70 seconds)\n", - "Cbc0010I After 4000000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (404.75 seconds)\n", - "Cbc0010I After 4001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (404.81 seconds)\n", - "Cbc0010I After 4002000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (404.86 seconds)\n", - "Cbc0010I After 4003000 nodes, 106 on tree, 1e+50 best solution, best possib possible 0 (158.54 seconds)\n", - "Cbc0010I After 969000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (158.72 seconds)\n", - "Cbc0010I After 970000 nodes, 487 on tree, 1e+50 best solution, best possible 0 (158.91 seconds)\n", - "Cbc0010I After 971000 nodes, 449 on tree, 1e+50 best solution, best possible 0 (159.13 seconds)\n", - "Cbc0010I After 972000 nodes, 653 on tree, 1e+50 best solution, best possible 0 (159.30 seconds)\n", - "Cbc0010I After 973000 nodes, 621 on tree, 1e+50 best solution, best possible 0 (159.46 seconds)\n", - "Cbc0010I After 974000 nodes, 612 on tree, 1e+50 best solution, best possible 0 (159.60 seconds)\n", - "Cbc0010I After 975000 nodes, 584 on tree, 1e+50 best solution, best possible 0 (159.75 seconds)\n", - "Cbc0010I After 976000 nodes, 558 on tree, 1e+50 best solution, best possible 0 (159.91 seconds)\n", - "Cbc0010I After 977000 nodes, 544 on tree, 1e+50 best solution, best possible 0 (160.08 seconds)\n", - "Cbc0010I After 978000 nodes, 535 on tree, 1e+50 best solution, best possible 0 (160.24 seconds)\n", - "Cbc0010I After 979000 nodes, 535 on tree, 1e+50 best solution, best possible 0 (160.40 seconds)\n", - "Cbc0010I After 980000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (160.58 seconds)\n", - "Cbc0010I After 981000 nodes, 512 on tree, 1e+50 best solution, best possible 0 (160.70 seconds)\n", - "Cbc0010I After 982000 nodes, 488 on tree, 1e+50 best solution, best possible 0 (160.90 seconds)\n", - "Cbc0010I After 983000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (161.03 seconds)\n", - "Cbc0010I After 984000 nodes, 484 on tree, 1e+50 best solution, best possible 0 (161.18 seconds)\n", - "Cbc0010I After 985000 nodes, 459 on tree, 1e+50 best solution, best possible 0 (161.34 seconds)\n", - "Cbc0010I After 986000 nodes, 489 on tree, 1e+50 best solution, best possible 0 (161.45 seconds)\n", - "Cbc0010I After 987000 nodes, 469 on tree, 1e+50 best solution, best possible 0 (161.58 seconds)\n", - "Cbc0010I After 988000 nodes, 426 on tree, 1e+50 best solution, best possible 0 (161.71 seconds)\n", - "Cbc0010I After 989000 nodes, 554 on tree, 1e+50 best solution, best possible 0 (161.81 seconds)\n", - "Cbc0010I After 990000 nodes, 500 on tree, 1e+50 best solution, best possible 0 (161.97 seconds)\n", - "Cbc0010I After 991000 nodes, 458 on tree, 1e+50 best solution, best possible 0 (162.12 seconds)\n", - "Cbc0010I After 992000 nodes, 437 on tree, 1e+50 best solution, best possible 0 (162.28 seconds)\n", - "Cbc0010I After 993000 nodes, 401 on tree, 1e+50 best solution, best possible 0 (162.45 seconds)\n", - "Cbc0010I After 994000 nodes, 453 on tree, 1e+50 best solution, best possible 0 (162.61 seconds)\n", - "Cbc0010I After 995000 nodes, 413 on tree, 1e+50 best solution, best possible 0 (162.77 seconds)\n", - "Cbc0010I After 996000 nodes, 407 on tree, 1e+50 best solution, best possible 0 (162.92 seconds)\n", - "Cbc0010I After 997000 nodes, 491 on tree, 1e+50 best solution, best possible 0 (163.13 seconds)\n", - "Cbc0010I After 998000 nodes, 454 on tree, 1e+50 best solution, best possible 0 (163.38 seconds)\n", - "Cbc0010I After 999000 nodes, 414 on tree, 1e+50 best solution, best possible 0 (163.70 seconds)\n", - "Cbc0010I After 1000000 nodes, 387 on tree, 1e+50 best solution, best possible 0 (163.93 seconds)\n", - "Cbc0010I After 1001000 nodes, 507 on tree, 1e+50 best solution, best possible 0 (164.11 seconds)\n", - "Cbc0010I After 1002000 nodes, 456 on tree, 1e+50 best solution, best possible 0 (164.27 seconds)\n", - "Cbc0010I After 1003000 nodes, 423 on tree, 1e+50 best solution, best possible 0 (164.39 seconds)\n", - "Cbc0010I After 1004000 nodes, 391 on tree, 1e+50 best solution, best possible 0 (164.55 seconds)\n", - "Cbc0010I After 1005000 nodes, 360 on tree, 1e+50 best solution, best possible 0 (164.69 seconds)\n", - "Cbc0010I After 1006000 nodes, 483 on tree, 1e+50 best solution, best possible 0 (164.85 seconds)\n", - "Cbc0010I After 1007000 nodes, 428 on tree, 1e+50 best solution, best possible 0 (165.04 seconds)\n", - "Cbc0010I After 1008000 nodes, 393 on tree, 1e+50 best solution, best possible 0 (165.25 seconds)\n", - "Cbc0010I After 1009000 nodes, 368 on tree, 1e+50 best solution, best possible 0 (165.43 seconds)\n", - "Cbc0010I After 1010000 nodes, 421 on tree, 1e+50 best solution, best possible 0 (165.62 seconds)\n", - "Cbc0010I After 1011000 nle 0 (404.94 seconds)\n", - "Cbc0010I After 4004000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (405.01 seconds)\n", - "Cbc0010I After 4005000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (405.07 seconds)\n", - "Cbc0010I After 4006000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (405.16 seconds)\n", - "Cbc0010I After 4007000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (405.23 seconds)\n", - "Cbc0010I After 4008000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (405.30 seconds)\n", - "Cbc0010I After 4009000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (405.35 seconds)\n", - "Cbc0010I After 4010000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (405.43 seconds)\n", - "Cbc0010I After 4011000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (405.51 seconds)\n", - "Cbc0010I After 4012000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (405.63 seconds)\n", - "Cbc0010I After 4013000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (405.78 seconds)\n", - "Cbc0010I After 4014000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (405.87 seconds)\n", - "Cbc0010I After 4015000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (406.01 seconds)\n", - "Cbc0010I After 4016000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (406.17 seconds)\n", - "Cbc0010I After 4017000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (406.27 seconds)\n", - "Cbc0010I After 4018000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (406.42 seconds)\n", - "Cbc0010I After 4019000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (406.56 seconds)\n", - "Cbc0010I After 4020000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (406.67 seconds)\n", - "Cbc0010I After 4021000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (406.78 seconds)\n", - "Cbc0010I After 4022000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (406.93 seconds)\n", - "Cbc0010I After 4023000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (407.02 seconds)\n", - "Cbc0010I After 4024000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (407.16 seconds)\n", - "Cbc0010I After 4025000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (407.25 seconds)\n", - "Cbc0010I After 4026000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (407.36 seconds)\n", - "Cbc0010I After 4027000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (407.43 seconds)\n", - "Cbc0010I After 4028000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (407.51 seconds)\n", - "Cbc0010I After 4029000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (407.58 seconds)\n", - "Cbc0010I After 4030000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (407.71 seconds)\n", - "Cbc0010I After 4031000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (407.83 seconds)\n", - "Cbc0010I After 4032000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (407.95 seconds)\n", - "Cbc0010I After 4033000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (408.07 seconds)\n", - "Cbc0010I After 4034000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (408.20 seconds)\n", - "Cbc0010I After 4035000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (408.30 seconds)\n", - "Cbc0010I After 4036000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (408.39 seconds)\n", - "Cbc0010I After 4037000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (408.50 seconds)\n", - "Cbc0010I After 4038000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (408.66 seconds)\n", - "Cbc0010I After 4039000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (408.78 seconds)\n", - "Cbc0010I After 4040000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (408.88 seconds)\n", - "Cbc0010I After 4041000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (408.98 seconds)\n", - "Cbc0010I After 4042000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (409.07 seconds)\n", - "Cbc0010I After 4043000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (409.16 seconds)\n", - "Cbc0010I After 4044000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (409.24 seconds)\n", - "Cbc0010I After 4045000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (409.33 seconds)\n", - "Cbc0010I After 4046000 nodesodes, 440 on tree, 1e+50 best solution, best possible 0 (165.80 seconds)\n", - "Cbc0010I After 1012000 nodes, 410 on tree, 1e+50 best solution, best possible 0 (166.05 seconds)\n", - "Cbc0010I After 1013000 nodes, 383 on tree, 1e+50 best solution, best possible 0 (166.27 seconds)\n", - "Cbc0010I After 1014000 nodes, 356 on tree, 1e+50 best solution, best possible 0 (166.46 seconds)\n", - "Cbc0010I After 1015000 nodes, 329 on tree, 1e+50 best solution, best possible 0 (166.61 seconds)\n", - "Cbc0010I After 1016000 nodes, 436 on tree, 1e+50 best solution, best possible 0 (166.73 seconds)\n", - "Cbc0010I After 1017000 nodes, 388 on tree, 1e+50 best solution, best possible 0 (166.89 seconds)\n", - "Cbc0010I After 1018000 nodes, 372 on tree, 1e+50 best solution, best possible 0 (167.04 seconds)\n", - "Cbc0010I After 1019000 nodes, 322 on tree, 1e+50 best solution, best possible 0 (167.19 seconds)\n", - "Cbc0010I After 1020000 nodes, 295 on tree, 1e+50 best solution, best possible 0 (167.34 seconds)\n", - "Cbc0010I After 1021000 nodes, 269 on tree, 1e+50 best solution, best possible 0 (167.46 seconds)\n", - "Cbc0010I After 1022000 nodes, 249 on tree, 1e+50 best solution, best possible 0 (167.65 seconds)\n", - "Cbc0010I After 1023000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (167.76 seconds)\n", - "Cbc0010I After 1024000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (167.87 seconds)\n", - "Cbc0010I After 1025000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (167.99 seconds)\n", - "Cbc0010I After 1026000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (168.12 seconds)\n", - "Cbc0010I After 1027000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (168.23 seconds)\n", - "Cbc0010I After 1028000 nodes, 379 on tree, 1e+50 best solution, best possible 0 (168.34 seconds)\n", - "Cbc0010I After 1029000 nodes, 368 on tree, 1e+50 best solution, best possible 0 (168.44 seconds)\n", - "Cbc0010I After 1030000 nodes, 325 on tree, 1e+50 best solution, best possible 0 (168.54 seconds)\n", - "Cbc0010I After 1031000 nodes, 299 on tree, 1e+50 best solution, best possible 0 (168.64 seconds)\n", - "Cbc0010I After 1032000 nodes, 283 on tree, 1e+50 best solution, best possible 0 (168.73 seconds)\n", - "Cbc0010I After 1033000 nodes, 267 on tree, 1e+50 best solution, best possible 0 (168.82 seconds)\n", - "Cbc0010I After 1034000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (168.92 seconds)\n", - "Cbc0010I After 1035000 nodes, 252 on tree, 1e+50 best solution, best possible 0 (169.04 seconds)\n", - "Cbc0010I After 1036000 nodes, 235 on tree, 1e+50 best solution, best possible 0 (169.12 seconds)\n", - "Cbc0010I After 1037000 nodes, 251 on tree, 1e+50 best solution, best possible 0 (169.23 seconds)\n", - "Cbc0010I After 1038000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (169.36 seconds)\n", - "Cbc0010I After 1039000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (169.48 seconds)\n", - "Cbc0010I After 1040000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (169.64 seconds)\n", - "Cbc0010I After 1041000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (169.74 seconds)\n", - "Cbc0010I After 1042000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (169.82 seconds)\n", - "Cbc0010I After 1043000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (169.93 seconds)\n", - "Cbc0010I After 1044000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (170.04 seconds)\n", - "Cbc0010I After 1045000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (170.13 seconds)\n", - "Cbc0010I After 1046000 nodes, 270 on tree, 1e+50 best solution, best possible 0 (170.22 seconds)\n", - "Cbc0010I After 1047000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (170.31 seconds)\n", - "Cbc0010I After 1048000 nodes, 257 on tree, 1e+50 best solution, best possible 0 (170.39 seconds)\n", - "Cbc0010I After 1049000 nodes, 238 on tree, 1e+50 best solution, best possible 0 (170.46 seconds)\n", - "Cbc0010I After 1050000 nodes, 229 on tree, 1e+50 best solution, best possible 0 (170.56 seconds)\n", - "Cbc0010I After 1051000 nodes, 220 on tree, 1e+50 best solution, best possible 0 (170.66 seconds)\n", - "Cbc0010I After 1052000 nodes, 226 on tree, 1e+50 best solution, best possible 0 (170.74 seconds)\n", - "Cbc0010I After 1053000 nodes, 212 on tree, 1e+, 116 on tree, 1e+50 best solution, best possible 0 (409.43 seconds)\n", - "Cbc0010I After 4047000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (409.53 seconds)\n", - "Cbc0010I After 4048000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (409.63 seconds)\n", - "Cbc0010I After 4049000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (409.74 seconds)\n", - "Cbc0010I After 4050000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (409.84 seconds)\n", - "Cbc0010I After 4051000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (409.97 seconds)\n", - "Cbc0010I After 4052000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (410.10 seconds)\n", - "Cbc0010I After 4053000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (410.22 seconds)\n", - "Cbc0010I After 4054000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (410.32 seconds)\n", - "Cbc0010I After 4055000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (410.42 seconds)\n", - "Cbc0010I After 4056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (410.54 seconds)\n", - "Cbc0010I After 4057000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (410.63 seconds)\n", - "Cbc0010I After 4058000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (410.72 seconds)\n", - "Cbc0010I After 4059000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (410.83 seconds)\n", - "Cbc0010I After 4060000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (410.93 seconds)\n", - "Cbc0010I After 4061000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (411.02 seconds)\n", - "Cbc0010I After 4062000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (411.13 seconds)\n", - "Cbc0010I After 4063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (411.24 seconds)\n", - "Cbc0010I After 4064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (411.33 seconds)\n", - "Cbc0010I After 4065000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (411.41 seconds)\n", - "Cbc0010I After 4066000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (411.50 seconds)\n", - "Cbc0010I After 4067000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (411.58 seconds)\n", - "Cbc0010I After 4068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (411.68 seconds)\n", - "Cbc0010I After 4069000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (411.85 seconds)\n", - "Cbc0010I After 4070000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (411.99 seconds)\n", - "Cbc0010I After 4071000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (412.11 seconds)\n", - "Cbc0010I After 4072000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (412.23 seconds)\n", - "Cbc0010I After 4073000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (412.35 seconds)\n", - "Cbc0010I After 4074000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (412.43 seconds)\n", - "Cbc0010I After 4075000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (412.54 seconds)\n", - "Cbc0010I After 4076000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (412.64 seconds)\n", - "Cbc0010I After 4077000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (412.72 seconds)\n", - "Cbc0010I After 4078000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (412.81 seconds)\n", - "Cbc0010I After 4079000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (412.94 seconds)\n", - "Cbc0010I After 4080000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (413.02 seconds)\n", - "Cbc0010I After 4081000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (413.11 seconds)\n", - "Cbc0010I After 4082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (413.18 seconds)\n", - "Cbc0010I After 4083000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (413.27 seconds)\n", - "Cbc0010I After 4084000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (413.36 seconds)\n", - "Cbc0010I After 4085000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (413.43 seconds)\n", - "Cbc0010I After 4086000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (413.47 seconds)\n", - "Cbc0010I After 4087000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (413.53 seconds)\n", - "Cbc0010I After 4088000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (41350 best solution, best possible 0 (170.81 seconds)\n", - "Cbc0010I After 1054000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (170.89 seconds)\n", - "Cbc0010I After 1055000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (170.97 seconds)\n", - "Cbc0010I After 1056000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (171.06 seconds)\n", - "Cbc0010I After 1057000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (171.13 seconds)\n", - "Cbc0010I After 1058000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (171.24 seconds)\n", - "Cbc0010I After 1059000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (171.34 seconds)\n", - "Cbc0010I After 1060000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (171.45 seconds)\n", - "Cbc0010I After 1061000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (171.57 seconds)\n", - "Cbc0010I After 1062000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (171.65 seconds)\n", - "Cbc0010I After 1063000 nodes, 290 on tree, 1e+50 best solution, best possible 0 (171.77 seconds)\n", - "Cbc0010I After 1064000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (171.90 seconds)\n", - "Cbc0010I After 1065000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (172.03 seconds)\n", - "Cbc0010I After 1066000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (172.15 seconds)\n", - "Cbc0010I After 1067000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (172.27 seconds)\n", - "Cbc0010I After 1068000 nodes, 271 on tree, 1e+50 best solution, best possible 0 (172.41 seconds)\n", - "Cbc0010I After 1069000 nodes, 223 on tree, 1e+50 best solution, best possible 0 (172.50 seconds)\n", - "Cbc0010I After 1070000 nodes, 196 on tree, 1e+50 best solution, best possible 0 (172.62 seconds)\n", - "Cbc0010I After 1071000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (172.73 seconds)\n", - "Cbc0010I After 1072000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (172.84 seconds)\n", - "Cbc0010I After 1073000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (172.94 seconds)\n", - "Cbc0010I After 1074000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (173.04 seconds)\n", - "Cbc0010I After 1075000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (173.15 seconds)\n", - "Cbc0010I After 1076000 nodes, 264 on tree, 1e+50 best solution, best possible 0 (173.27 seconds)\n", - "Cbc0010I After 1077000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (173.41 seconds)\n", - "Cbc0010I After 1078000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (173.58 seconds)\n", - "Cbc0010I After 1079000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (173.71 seconds)\n", - "Cbc0010I After 1080000 nodes, 292 on tree, 1e+50 best solution, best possible 0 (173.84 seconds)\n", - "Cbc0010I After 1081000 nodes, 250 on tree, 1e+50 best solution, best possible 0 (173.98 seconds)\n", - "Cbc0010I After 1082000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (174.21 seconds)\n", - "Cbc0010I After 1083000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (174.40 seconds)\n", - "Cbc0010I After 1084000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (174.58 seconds)\n", - "Cbc0010I After 1085000 nodes, 264 on tree, 1e+50 best solution, best possible 0 (174.78 seconds)\n", - "Cbc0010I After 1086000 nodes, 224 on tree, 1e+50 best solution, best possible 0 (174.98 seconds)\n", - "Cbc0010I After 1087000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (175.17 seconds)\n", - "Cbc0010I After 1088000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (175.33 seconds)\n", - "Cbc0010I After 1089000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (175.46 seconds)\n", - "Cbc0010I After 1090000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (175.60 seconds)\n", - "Cbc0010I After 1091000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (175.71 seconds)\n", - "Cbc0010I After 1092000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (175.82 seconds)\n", - "Cbc0010I After 1093000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (175.93 seconds)\n", - "Cbc0010I After 1094000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (176.03 seconds)\n", - "Cbc0010I After 1095000 nodes, 189 on tree, 1e+50 best solution, best.61 seconds)\n", - "Cbc0010I After 4089000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (413.67 seconds)\n", - "Cbc0010I After 4090000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (413.74 seconds)\n", - "Cbc0010I After 4091000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (413.86 seconds)\n", - "Cbc0010I After 4092000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (413.97 seconds)\n", - "Cbc0010I After 4093000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (414.05 seconds)\n", - "Cbc0010I After 4094000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (414.12 seconds)\n", - "Cbc0010I After 4095000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (414.24 seconds)\n", - "Cbc0010I After 4096000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (414.38 seconds)\n", - "Cbc0010I After 4097000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (414.47 seconds)\n", - "Cbc0010I After 4098000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (414.72 seconds)\n", - "Cbc0010I After 4099000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (414.82 seconds)\n", - "Cbc0010I After 4100000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (414.97 seconds)\n", - "Cbc0010I After 4101000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (415.13 seconds)\n", - "Cbc0010I After 4102000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (415.34 seconds)\n", - "Cbc0010I After 4103000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (415.49 seconds)\n", - "Cbc0010I After 4104000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (415.66 seconds)\n", - "Cbc0010I After 4105000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (415.80 seconds)\n", - "Cbc0010I After 4106000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (415.94 seconds)\n", - "Cbc0010I After 4107000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (416.01 seconds)\n", - "Cbc0010I After 4108000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (416.14 seconds)\n", - "Cbc0010I After 4109000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (416.24 seconds)\n", - "Cbc0010I After 4110000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (416.33 seconds)\n", - "Cbc0010I After 4111000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (416.46 seconds)\n", - "Cbc0010I After 4112000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (416.60 seconds)\n", - "Cbc0010I After 4113000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (416.75 seconds)\n", - "Cbc0010I After 4114000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (416.89 seconds)\n", - "Cbc0010I After 4115000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (417.03 seconds)\n", - "Cbc0010I After 4116000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (417.19 seconds)\n", - "Cbc0010I After 4117000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (417.33 seconds)\n", - "Cbc0010I After 4118000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (417.47 seconds)\n", - "Cbc0010I After 4119000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (417.59 seconds)\n", - "Cbc0010I After 4120000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (417.71 seconds)\n", - "Cbc0010I After 4121000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (417.82 seconds)\n", - "Cbc0010I After 4122000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (417.92 seconds)\n", - "Cbc0010I After 4123000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (418.05 seconds)\n", - "Cbc0010I After 4124000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (418.22 seconds)\n", - "Cbc0010I After 4125000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (418.37 seconds)\n", - "Cbc0010I After 4126000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (418.51 seconds)\n", - "Cbc0010I After 4127000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (418.66 seconds)\n", - "Cbc0010I After 4128000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (418.70 seconds)\n", - "Cbc0010I After 4129000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (418.79 seconds)\n", - "Cbc0010I After 4130000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (418.89 seconds)\n", - "Cbc0010I After 4131000 nodes, 82 on tree, possible 0 (176.15 seconds)\n", - "Cbc0010I After 1096000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (176.27 seconds)\n", - "Cbc0010I After 1097000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (176.38 seconds)\n", - "Cbc0010I After 1098000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (176.51 seconds)\n", - "Cbc0010I After 1099000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (176.64 seconds)\n", - "Cbc0010I After 1100000 nodes, 352 on tree, 1e+50 best solution, best possible 0 (176.78 seconds)\n", - "Cbc0010I After 1101000 nodes, 316 on tree, 1e+50 best solution, best possible 0 (176.92 seconds)\n", - "Cbc0010I After 1102000 nodes, 318 on tree, 1e+50 best solution, best possible 0 (177.03 seconds)\n", - "Cbc0010I After 1103000 nodes, 299 on tree, 1e+50 best solution, best possible 0 (177.15 seconds)\n", - "Cbc0010I After 1104000 nodes, 271 on tree, 1e+50 best solution, best possible 0 (177.25 seconds)\n", - "Cbc0010I After 1105000 nodes, 257 on tree, 1e+50 best solution, best possible 0 (177.35 seconds)\n", - "Cbc0010I After 1106000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (177.45 seconds)\n", - "Cbc0010I After 1107000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (177.56 seconds)\n", - "Cbc0010I After 1108000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (177.68 seconds)\n", - "Cbc0010I After 1109000 nodes, 219 on tree, 1e+50 best solution, best possible 0 (177.90 seconds)\n", - "Cbc0010I After 1110000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (178.02 seconds)\n", - "Cbc0010I After 1111000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (178.18 seconds)\n", - "Cbc0010I After 1112000 nodes, 207 on tree, 1e+50 best solution, best possible 0 (178.28 seconds)\n", - "Cbc0010I After 1113000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (178.41 seconds)\n", - "Cbc0010I After 1114000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (178.51 seconds)\n", - "Cbc0010I After 1115000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (178.61 seconds)\n", - "Cbc0010I After 1116000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (178.73 seconds)\n", - "Cbc0010I After 1117000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (178.88 seconds)\n", - "Cbc0010I After 1118000 nodes, 322 on tree, 1e+50 best solution, best possible 0 (179.00 seconds)\n", - "Cbc0010I After 1119000 nodes, 311 on tree, 1e+50 best solution, best possible 0 (179.12 seconds)\n", - "Cbc0010I After 1120000 nodes, 293 on tree, 1e+50 best solution, best possible 0 (179.21 seconds)\n", - "Cbc0010I After 1121000 nodes, 291 on tree, 1e+50 best solution, best possible 0 (179.28 seconds)\n", - "Cbc0010I After 1122000 nodes, 260 on tree, 1e+50 best solution, best possible 0 (179.40 seconds)\n", - "Cbc0010I After 1123000 nodes, 261 on tree, 1e+50 best solution, best possible 0 (179.50 seconds)\n", - "Cbc0010I After 1124000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (179.63 seconds)\n", - "Cbc0010I After 1125000 nodes, 250 on tree, 1e+50 best solution, best possible 0 (179.79 seconds)\n", - "Cbc0010I After 1126000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (179.92 seconds)\n", - "Cbc0010I After 1127000 nodes, 232 on tree, 1e+50 best solution, best possible 0 (180.04 seconds)\n", - "Cbc0010I After 1128000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (180.22 seconds)\n", - "Cbc0010I After 1129000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (180.42 seconds)\n", - "Cbc0010I After 1130000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (180.63 seconds)\n", - "Cbc0010I After 1131000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (180.82 seconds)\n", - "Cbc0010I After 1132000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (181.07 seconds)\n", - "Cbc0010I After 1133000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (181.24 seconds)\n", - "Cbc0010I After 1134000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (181.38 seconds)\n", - "Cbc0010I After 1135000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (181.52 seconds)\n", - "Cbc0010I After 1136000 nodes, 267 on tree, 1e+50 best solution, best possible 0 (181.66 seconds)\n", - "Cbc0010I After 1137000 nodes, 244 on tree, 1e+50 best solution, best possible 0 (181.78 se1e+50 best solution, best possible 0 (418.95 seconds)\n", - "Cbc0010I After 4132000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.09 seconds)\n", - "Cbc0010I After 4133000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.14 seconds)\n", - "Cbc0010I After 4134000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (419.20 seconds)\n", - "Cbc0010I After 4135000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (419.35 seconds)\n", - "Cbc0010I After 4136000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.45 seconds)\n", - "Cbc0010I After 4137000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (419.52 seconds)\n", - "Cbc0010I After 4138000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (419.57 seconds)\n", - "Cbc0010I After 4139000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (419.63 seconds)\n", - "Cbc0010I After 4140000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.72 seconds)\n", - "Cbc0010I After 4141000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (419.77 seconds)\n", - "Cbc0010I After 4142000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (419.89 seconds)\n", - "Cbc0010I After 4143000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (419.97 seconds)\n", - "Cbc0010I After 4144000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (420.13 seconds)\n", - "Cbc0010I After 4145000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (420.22 seconds)\n", - "Cbc0010I After 4146000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (420.28 seconds)\n", - "Cbc0010I After 4147000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (420.49 seconds)\n", - "Cbc0010I After 4148000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (420.66 seconds)\n", - "Cbc0010I After 4149000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (420.94 seconds)\n", - "Cbc0010I After 4150000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (421.08 seconds)\n", - "Cbc0010I After 4151000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (421.31 seconds)\n", - "Cbc0010I After 4152000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (421.61 seconds)\n", - "Cbc0010I After 4153000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (421.73 seconds)\n", - "Cbc0010I After 4154000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (421.88 seconds)\n", - "Cbc0010I After 4155000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (422.07 seconds)\n", - "Cbc0010I After 4156000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (422.24 seconds)\n", - "Cbc0010I After 4157000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (422.37 seconds)\n", - "Cbc0010I After 4158000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (422.51 seconds)\n", - "Cbc0010I After 4159000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (422.69 seconds)\n", - "Cbc0010I After 4160000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (422.87 seconds)\n", - "Cbc0010I After 4161000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (423.00 seconds)\n", - "Cbc0010I After 4162000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (423.11 seconds)\n", - "Cbc0010I After 4163000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (423.26 seconds)\n", - "Cbc0010I After 4164000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (423.50 seconds)\n", - "Cbc0010I After 4165000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (423.73 seconds)\n", - "Cbc0010I After 4166000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (423.86 seconds)\n", - "Cbc0010I After 4167000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (423.97 seconds)\n", - "Cbc0010I After 4168000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (424.09 seconds)\n", - "Cbc0010I After 4169000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (424.19 seconds)\n", - "Cbc0010I After 4170000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (424.32 seconds)\n", - "Cbc0010I After 4171000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (424.40 seconds)\n", - "Cbc0010I After 4172000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (424.49 seconds)\n", - "Cbc0010I After 4173000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (424.70 seconds)\n", - "Cbc0010conds)\n", - "Cbc0010I After 1138000 nodes, 248 on tree, 1e+50 best solution, best possible 0 (181.91 seconds)\n", - "Cbc0010I After 1139000 nodes, 247 on tree, 1e+50 best solution, best possible 0 (182.00 seconds)\n", - "Cbc0010I After 1140000 nodes, 233 on tree, 1e+50 best solution, best possible 0 (182.12 seconds)\n", - "Cbc0010I After 1141000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (182.22 seconds)\n", - "Cbc0010I After 1142000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (182.35 seconds)\n", - "Cbc0010I After 1143000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (182.44 seconds)\n", - "Cbc0010I After 1144000 nodes, 209 on tree, 1e+50 best solution, best possible 0 (182.53 seconds)\n", - "Cbc0010I After 1145000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (182.61 seconds)\n", - "Cbc0010I After 1146000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (182.68 seconds)\n", - "Cbc0010I After 1147000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (182.78 seconds)\n", - "Cbc0010I After 1148000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (182.97 seconds)\n", - "Cbc0010I After 1149000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (183.12 seconds)\n", - "Cbc0010I After 1150000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (183.25 seconds)\n", - "Cbc0010I After 1151000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (183.40 seconds)\n", - "Cbc0010I After 1152000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (183.55 seconds)\n", - "Cbc0010I After 1153000 nodes, 291 on tree, 1e+50 best solution, best possible 0 (183.73 seconds)\n", - "Cbc0010I After 1154000 nodes, 246 on tree, 1e+50 best solution, best possible 0 (183.94 seconds)\n", - "Cbc0010I After 1155000 nodes, 217 on tree, 1e+50 best solution, best possible 0 (184.17 seconds)\n", - "Cbc0010I After 1156000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (184.36 seconds)\n", - "Cbc0010I After 1157000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (184.54 seconds)\n", - "Cbc0010I After 1158000 nodes, 222 on tree, 1e+50 best solution, best possible 0 (184.77 seconds)\n", - "Cbc0010I After 1159000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (184.92 seconds)\n", - "Cbc0010I After 1160000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (185.10 seconds)\n", - "Cbc0010I After 1161000 nodes, 364 on tree, 1e+50 best solution, best possible 0 (185.28 seconds)\n", - "Cbc0010I After 1162000 nodes, 301 on tree, 1e+50 best solution, best possible 0 (185.48 seconds)\n", - "Cbc0010I After 1163000 nodes, 277 on tree, 1e+50 best solution, best possible 0 (185.65 seconds)\n", - "Cbc0010I After 1164000 nodes, 274 on tree, 1e+50 best solution, best possible 0 (185.83 seconds)\n", - "Cbc0010I After 1165000 nodes, 272 on tree, 1e+50 best solution, best possible 0 (186.00 seconds)\n", - "Cbc0010I After 1166000 nodes, 236 on tree, 1e+50 best solution, best possible 0 (186.13 seconds)\n", - "Cbc0010I After 1167000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (186.24 seconds)\n", - "Cbc0010I After 1168000 nodes, 210 on tree, 1e+50 best solution, best possible 0 (186.37 seconds)\n", - "Cbc0010I After 1169000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (186.51 seconds)\n", - "Cbc0010I After 1170000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (186.64 seconds)\n", - "Cbc0010I After 1171000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (186.74 seconds)\n", - "Cbc0010I After 1172000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (186.82 seconds)\n", - "Cbc0010I After 1173000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (186.90 seconds)\n", - "Cbc0010I After 1174000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (186.99 seconds)\n", - "Cbc0010I After 1175000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (187.08 seconds)\n", - "Cbc0010I After 1176000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (187.15 seconds)\n", - "Cbc0010I After 1177000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (187.24 seconds)\n", - "Cbc0010I After 1178000 nodes, 239 on tree, 1e+50 best solution, best possible 0 (187.38 seconds)\n", - "Cbc0010I After 1179000 nodes, 208 on tree, 1e+50 best solution, best possible 0 (187.49 seconds)\n", - "Cbc0010I After I After 4174000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (424.90 seconds)\n", - "Cbc0010I After 4175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (425.09 seconds)\n", - "Cbc0010I After 4176000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (425.25 seconds)\n", - "Cbc0010I After 4177000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (425.32 seconds)\n", - "Cbc0010I After 4178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (425.39 seconds)\n", - "Cbc0010I After 4179000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (425.48 seconds)\n", - "Cbc0010I After 4180000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (425.56 seconds)\n", - "Cbc0010I After 4181000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (425.70 seconds)\n", - "Cbc0010I After 4182000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (425.77 seconds)\n", - "Cbc0010I After 4183000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (425.85 seconds)\n", - "Cbc0010I After 4184000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (426.04 seconds)\n", - "Cbc0010I After 4185000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (426.23 seconds)\n", - "Cbc0010I After 4186000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (426.40 seconds)\n", - "Cbc0010I After 4187000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (426.47 seconds)\n", - "Cbc0010I After 4188000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (426.54 seconds)\n", - "Cbc0010I After 4189000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (426.64 seconds)\n", - "Cbc0010I After 4190000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (426.72 seconds)\n", - "Cbc0010I After 4191000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (426.80 seconds)\n", - "Cbc0010I After 4192000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (426.90 seconds)\n", - "Cbc0010I After 4193000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (427.03 seconds)\n", - "Cbc0010I After 4194000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (427.15 seconds)\n", - "Cbc0010I After 4195000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (427.22 seconds)\n", - "Cbc0010I After 4196000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (427.29 seconds)\n", - "Cbc0010I After 4197000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (427.38 seconds)\n", - "Cbc0010I After 4198000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (427.45 seconds)\n", - "Cbc0010I After 4199000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (427.53 seconds)\n", - "Cbc0010I After 4200000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (427.64 seconds)\n", - "Cbc0010I After 4201000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (427.72 seconds)\n", - "Cbc0010I After 4202000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (427.83 seconds)\n", - "Cbc0010I After 4203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (427.92 seconds)\n", - "Cbc0010I After 4204000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (428.00 seconds)\n", - "Cbc0010I After 4205000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (428.10 seconds)\n", - "Cbc0010I After 4206000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (428.22 seconds)\n", - "Cbc0010I After 4207000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (428.29 seconds)\n", - "Cbc0010I After 4208000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (428.36 seconds)\n", - "Cbc0010I After 4209000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (428.46 seconds)\n", - "Cbc0010I After 4210000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (428.59 seconds)\n", - "Cbc0010I After 4211000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (428.71 seconds)\n", - "Cbc0010I After 4212000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (428.84 seconds)\n", - "Cbc0010I After 4213000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (428.93 seconds)\n", - "Cbc0010I After 4214000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (429.01 seconds)\n", - "Cbc0010I After 4215000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (429.12 seconds)\n", - "Cbc0010I After 4216000 nodes, 118 on tree, 1e+50 best solutio1180000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (187.59 seconds)\n", - "Cbc0010I After 1181000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (187.72 seconds)\n", - "Cbc0010I After 1182000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (187.83 seconds)\n", - "Cbc0010I After 1183000 nodes, 235 on tree, 1e+50 best solution, best possible 0 (187.95 seconds)\n", - "Cbc0010I After 1184000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (188.09 seconds)\n", - "Cbc0010I After 1185000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (188.22 seconds)\n", - "Cbc0010I After 1186000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (188.36 seconds)\n", - "Cbc0010I After 1187000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (188.47 seconds)\n", - "Cbc0010I After 1188000 nodes, 241 on tree, 1e+50 best solution, best possible 0 (188.58 seconds)\n", - "Cbc0010I After 1189000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (188.71 seconds)\n", - "Cbc0010I After 1190000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (188.82 seconds)\n", - "Cbc0010I After 1191000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (188.93 seconds)\n", - "Cbc0010I After 1192000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (189.05 seconds)\n", - "Cbc0010I After 1193000 nodes, 233 on tree, 1e+50 best solution, best possible 0 (189.17 seconds)\n", - "Cbc0010I After 1194000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (189.28 seconds)\n", - "Cbc0010I After 1195000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (189.38 seconds)\n", - "Cbc0010I After 1196000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (189.47 seconds)\n", - "Cbc0010I After 1197000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (189.57 seconds)\n", - "Cbc0010I After 1198000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (189.67 seconds)\n", - "Cbc0010I After 1199000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (189.80 seconds)\n", - "Cbc0010I After 1200000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (189.92 seconds)\n", - "Cbc0010I After 1201000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (190.07 seconds)\n", - "Cbc0010I After 1202000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (190.21 seconds)\n", - "Cbc0010I After 1203000 nodes, 219 on tree, 1e+50 best solution, best possible 0 (190.36 seconds)\n", - "Cbc0010I After 1204000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (190.58 seconds)\n", - "Cbc0010I After 1205000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (190.86 seconds)\n", - "Cbc0010I After 1206000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (191.06 seconds)\n", - "Cbc0010I After 1207000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (191.27 seconds)\n", - "Cbc0010I After 1208000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (191.52 seconds)\n", - "Cbc0010I After 1209000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (191.77 seconds)\n", - "Cbc0010I After 1210000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (191.99 seconds)\n", - "Cbc0010I After 1211000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (192.19 seconds)\n", - "Cbc0010I After 1212000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (192.35 seconds)\n", - "Cbc0010I After 1213000 nodes, 215 on tree, 1e+50 best solution, best possible 0 (192.57 seconds)\n", - "Cbc0010I After 1214000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (192.71 seconds)\n", - "Cbc0010I After 1215000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (192.83 seconds)\n", - "Cbc0010I After 1216000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (192.96 seconds)\n", - "Cbc0010I After 1217000 nodes, 249 on tree, 1e+50 best solution, best possible 0 (193.12 seconds)\n", - "Cbc0010I After 1218000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (193.28 seconds)\n", - "Cbc0010I After 1219000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (193.44 seconds)\n", - "Cbc0010I After 1220000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (193.63 seconds)\n", - "Cbc0010I After 1221000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (193.78 seconds)\n", - "Cbc0010I After 1222000 nodes, 235 on n, best possible 0 (429.22 seconds)\n", - "Cbc0010I After 4217000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.33 seconds)\n", - "Cbc0010I After 4218000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (429.42 seconds)\n", - "Cbc0010I After 4219000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (429.52 seconds)\n", - "Cbc0010I After 4220000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (429.61 seconds)\n", - "Cbc0010I After 4221000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (429.72 seconds)\n", - "Cbc0010I After 4222000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (429.79 seconds)\n", - "Cbc0010I After 4223000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.87 seconds)\n", - "Cbc0010I After 4224000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (429.96 seconds)\n", - "Cbc0010I After 4225000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (430.05 seconds)\n", - "Cbc0010I After 4226000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (430.14 seconds)\n", - "Cbc0010I After 4227000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (430.24 seconds)\n", - "Cbc0010I After 4228000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (430.35 seconds)\n", - "Cbc0010I After 4229000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (430.43 seconds)\n", - "Cbc0010I After 4230000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (430.57 seconds)\n", - "Cbc0010I After 4231000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (430.67 seconds)\n", - "Cbc0010I After 4232000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (430.80 seconds)\n", - "Cbc0010I After 4233000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (430.95 seconds)\n", - "Cbc0010I After 4234000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (431.23 seconds)\n", - "Cbc0010I After 4235000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (431.38 seconds)\n", - "Cbc0010I After 4236000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (431.55 seconds)\n", - "Cbc0010I After 4237000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (431.73 seconds)\n", - "Cbc0010I After 4238000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (431.92 seconds)\n", - "Cbc0010I After 4239000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (432.04 seconds)\n", - "Cbc0010I After 4240000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (432.18 seconds)\n", - "Cbc0010I After 4241000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (432.36 seconds)\n", - "Cbc0010I After 4242000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (432.60 seconds)\n", - "Cbc0010I After 4243000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (432.77 seconds)\n", - "Cbc0010I After 4244000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (432.91 seconds)\n", - "Cbc0010I After 4245000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (433.09 seconds)\n", - "Cbc0010I After 4246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (433.21 seconds)\n", - "Cbc0010I After 4247000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (433.29 seconds)\n", - "Cbc0010I After 4248000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.40 seconds)\n", - "Cbc0010I After 4249000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (433.54 seconds)\n", - "Cbc0010I After 4250000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.69 seconds)\n", - "Cbc0010I After 4251000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (433.81 seconds)\n", - "Cbc0010I After 4252000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (433.94 seconds)\n", - "Cbc0010I After 4253000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (434.12 seconds)\n", - "Cbc0010I After 4254000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (434.24 seconds)\n", - "Cbc0010I After 4255000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (434.34 seconds)\n", - "Cbc0010I After 4256000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (434.43 seconds)\n", - "Cbc0010I After 4257000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (434.52 seconds)\n", - "Cbc0010I After 4258000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (434.64 seconds)\n", - "Cbc0010I Aftertree, 1e+50 best solution, best possible 0 (193.92 seconds)\n", - "Cbc0010I After 1223000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (194.10 seconds)\n", - "Cbc0010I After 1224000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (194.27 seconds)\n", - "Cbc0010I After 1225000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (194.42 seconds)\n", - "Cbc0010I After 1226000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (194.59 seconds)\n", - "Cbc0010I After 1227000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (194.73 seconds)\n", - "Cbc0010I After 1228000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (195.01 seconds)\n", - "Cbc0010I After 1229000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (195.32 seconds)\n", - "Cbc0010I After 1230000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (195.50 seconds)\n", - "Cbc0010I After 1231000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (195.67 seconds)\n", - "Cbc0010I After 1232000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (195.78 seconds)\n", - "Cbc0010I After 1233000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (195.89 seconds)\n", - "Cbc0010I After 1234000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (196.03 seconds)\n", - "Cbc0010I After 1235000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (196.16 seconds)\n", - "Cbc0010I After 1236000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (196.30 seconds)\n", - "Cbc0010I After 1237000 nodes, 211 on tree, 1e+50 best solution, best possible 0 (196.46 seconds)\n", - "Cbc0010I After 1238000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (196.59 seconds)\n", - "Cbc0010I After 1239000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (196.71 seconds)\n", - "Cbc0010I After 1240000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (196.82 seconds)\n", - "Cbc0010I After 1241000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (196.96 seconds)\n", - "Cbc0010I After 1242000 nodes, 206 on tree, 1e+50 best solution, best possible 0 (197.08 seconds)\n", - "Cbc0010I After 1243000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (197.20 seconds)\n", - "Cbc0010I After 1244000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (197.33 seconds)\n", - "Cbc0010I After 1245000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (197.44 seconds)\n", - "Cbc0010I After 1246000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (197.56 seconds)\n", - "Cbc0010I After 1247000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (197.68 seconds)\n", - "Cbc0010I After 1248000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (197.80 seconds)\n", - "Cbc0010I After 1249000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (197.91 seconds)\n", - "Cbc0010I After 1250000 nodes, 263 on tree, 1e+50 best solution, best possible 0 (198.01 seconds)\n", - "Cbc0010I After 1251000 nodes, 232 on tree, 1e+50 best solution, best possible 0 (198.14 seconds)\n", - "Cbc0010I After 1252000 nodes, 204 on tree, 1e+50 best solution, best possible 0 (198.28 seconds)\n", - "Cbc0010I After 1253000 nodes, 228 on tree, 1e+50 best solution, best possible 0 (198.36 seconds)\n", - "Cbc0010I After 1254000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (198.43 seconds)\n", - "Cbc0010I After 1255000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (198.52 seconds)\n", - "Cbc0010I After 1256000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (198.63 seconds)\n", - "Cbc0010I After 1257000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (198.75 seconds)\n", - "Cbc0010I After 1258000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (198.80 seconds)\n", - "Cbc0010I After 1259000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (198.88 seconds)\n", - "Cbc0010I After 1260000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (199.00 seconds)\n", - "Cbc0010I After 1261000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (199.08 seconds)\n", - "Cbc0010I After 1262000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (199.21 seconds)\n", - "Cbc0010I After 1263000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (199.29 seconds)\n", - "Cbc0010I After 1264000 nodes, 91 on tree, 1e+50 best solution, bes 4259000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (434.79 seconds)\n", - "Cbc0010I After 4260000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (434.91 seconds)\n", - "Cbc0010I After 4261000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (435.07 seconds)\n", - "Cbc0010I After 4262000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (435.20 seconds)\n", - "Cbc0010I After 4263000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (435.41 seconds)\n", - "Cbc0010I After 4264000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (435.74 seconds)\n", - "Cbc0010I After 4265000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (435.93 seconds)\n", - "Cbc0010I After 4266000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (436.06 seconds)\n", - "Cbc0010I After 4267000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (436.15 seconds)\n", - "Cbc0010I After 4268000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (436.26 seconds)\n", - "Cbc0010I After 4269000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (436.36 seconds)\n", - "Cbc0010I After 4270000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (436.47 seconds)\n", - "Cbc0010I After 4271000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (436.57 seconds)\n", - "Cbc0010I After 4272000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (436.68 seconds)\n", - "Cbc0010I After 4273000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (436.78 seconds)\n", - "Cbc0010I After 4274000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (436.93 seconds)\n", - "Cbc0010I After 4275000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (437.08 seconds)\n", - "Cbc0010I After 4276000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (437.20 seconds)\n", - "Cbc0010I After 4277000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (437.28 seconds)\n", - "Cbc0010I After 4278000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (437.41 seconds)\n", - "Cbc0010I After 4279000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (437.54 seconds)\n", - "Cbc0010I After 4280000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (437.68 seconds)\n", - "Cbc0010I After 4281000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (437.82 seconds)\n", - "Cbc0010I After 4282000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (437.95 seconds)\n", - "Cbc0010I After 4283000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (438.03 seconds)\n", - "Cbc0010I After 4284000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (438.15 seconds)\n", - "Cbc0010I After 4285000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (438.29 seconds)\n", - "Cbc0010I After 4286000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (438.43 seconds)\n", - "Cbc0010I After 4287000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (438.58 seconds)\n", - "Cbc0010I After 4288000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (438.76 seconds)\n", - "Cbc0010I After 4289000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (438.87 seconds)\n", - "Cbc0010I After 4290000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (438.97 seconds)\n", - "Cbc0010I After 4291000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (439.10 seconds)\n", - "Cbc0010I After 4292000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (439.24 seconds)\n", - "Cbc0010I After 4293000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (439.36 seconds)\n", - "Cbc0010I After 4294000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (439.48 seconds)\n", - "Cbc0010I After 4295000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (439.61 seconds)\n", - "Cbc0010I After 4296000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (439.73 seconds)\n", - "Cbc0010I After 4297000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (439.83 seconds)\n", - "Cbc0010I After 4298000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (439.97 seconds)\n", - "Cbc0010I After 4299000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (440.13 seconds)\n", - "Cbc0010I After 4300000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (440.27 seconds)\n", - "Cbc0010I After 4301000 nodes, 104 on tree, 1e+50 best sot possible 0 (199.39 seconds)\n", - "Cbc0010I After 1265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (199.47 seconds)\n", - "Cbc0010I After 1266000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (199.62 seconds)\n", - "Cbc0010I After 1267000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (199.75 seconds)\n", - "Cbc0010I After 1268000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (199.85 seconds)\n", - "Cbc0010I After 1269000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (200.13 seconds)\n", - "Cbc0010I After 1270000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (200.30 seconds)\n", - "Cbc0010I After 1271000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (200.44 seconds)\n", - "Cbc0010I After 1272000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (200.61 seconds)\n", - "Cbc0010I After 1273000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (200.74 seconds)\n", - "Cbc0010I After 1274000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (200.86 seconds)\n", - "Cbc0010I After 1275000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (200.96 seconds)\n", - "Cbc0010I After 1276000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (201.04 seconds)\n", - "Cbc0010I After 1277000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (201.12 seconds)\n", - "Cbc0010I After 1278000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (201.20 seconds)\n", - "Cbc0010I After 1279000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (201.27 seconds)\n", - "Cbc0010I After 1280000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (201.34 seconds)\n", - "Cbc0010I After 1281000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (201.46 seconds)\n", - "Cbc0010I After 1282000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (201.54 seconds)\n", - "Cbc0010I After 1283000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (201.62 seconds)\n", - "Cbc0010I After 1284000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (201.72 seconds)\n", - "Cbc0010I After 1285000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (201.79 seconds)\n", - "Cbc0010I After 1286000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (201.86 seconds)\n", - "Cbc0010I After 1287000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (201.93 seconds)\n", - "Cbc0010I After 1288000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (202.00 seconds)\n", - "Cbc0010I After 1289000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (202.10 seconds)\n", - "Cbc0010I After 1290000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (202.22 seconds)\n", - "Cbc0010I After 1291000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (202.31 seconds)\n", - "Cbc0010I After 1292000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (202.43 seconds)\n", - "Cbc0010I After 1293000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (202.55 seconds)\n", - "Cbc0010I After 1294000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (202.66 seconds)\n", - "Cbc0010I After 1295000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (202.77 seconds)\n", - "Cbc0010I After 1296000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (202.91 seconds)\n", - "Cbc0010I After 1297000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (203.02 seconds)\n", - "Cbc0010I After 1298000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (203.14 seconds)\n", - "Cbc0010I After 1299000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (203.23 seconds)\n", - "Cbc0010I After 1300000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (203.33 seconds)\n", - "Cbc0010I After 1301000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (203.44 seconds)\n", - "Cbc0010I After 1302000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (203.60 seconds)\n", - "Cbc0010I After 1303000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (203.79 seconds)\n", - "Cbc0010I After 1304000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (204.01 seconds)\n", - "Cbc0010I After 1305000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (204.19 seconds)\n", - "Cbc0010I After 1306000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (204.37 seconds)\n", - "Cbc0010I After 130lution, best possible 0 (440.65 seconds)\n", - "Cbc0010I After 4302000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (440.89 seconds)\n", - "Cbc0010I After 4303000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (441.12 seconds)\n", - "Cbc0010I After 4304000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (441.25 seconds)\n", - "Cbc0010I After 4305000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (441.36 seconds)\n", - "Cbc0010I After 4306000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (441.48 seconds)\n", - "Cbc0010I After 4307000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (441.60 seconds)\n", - "Cbc0010I After 4308000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (441.68 seconds)\n", - "Cbc0010I After 4309000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (441.79 seconds)\n", - "Cbc0010I After 4310000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (441.95 seconds)\n", - "Cbc0010I After 4311000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (442.06 seconds)\n", - "Cbc0010I After 4312000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.14 seconds)\n", - "Cbc0010I After 4313000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (442.20 seconds)\n", - "Cbc0010I After 4314000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.28 seconds)\n", - "Cbc0010I After 4315000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (442.40 seconds)\n", - "Cbc0010I After 4316000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (442.49 seconds)\n", - "Cbc0010I After 4317000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (442.61 seconds)\n", - "Cbc0010I After 4318000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (442.73 seconds)\n", - "Cbc0010I After 4319000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (442.82 seconds)\n", - "Cbc0010I After 4320000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (442.97 seconds)\n", - "Cbc0010I After 4321000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (443.09 seconds)\n", - "Cbc0010I After 4322000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (443.21 seconds)\n", - "Cbc0010I After 4323000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (443.36 seconds)\n", - "Cbc0010I After 4324000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (443.48 seconds)\n", - "Cbc0010I After 4325000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (443.60 seconds)\n", - "Cbc0010I After 4326000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (443.70 seconds)\n", - "Cbc0010I After 4327000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (443.81 seconds)\n", - "Cbc0010I After 4328000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (443.87 seconds)\n", - "Cbc0010I After 4329000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (443.96 seconds)\n", - "Cbc0010I After 4330000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (444.15 seconds)\n", - "Cbc0010I After 4331000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (444.35 seconds)\n", - "Cbc0010I After 4332000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (444.55 seconds)\n", - "Cbc0010I After 4333000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (444.73 seconds)\n", - "Cbc0010I After 4334000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (444.92 seconds)\n", - "Cbc0010I After 4335000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (445.12 seconds)\n", - "Cbc0010I After 4336000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (445.26 seconds)\n", - "Cbc0010I After 4337000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (445.38 seconds)\n", - "Cbc0010I After 4338000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (445.68 seconds)\n", - "Cbc0010I After 4339000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (445.88 seconds)\n", - "Cbc0010I After 4340000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (446.05 seconds)\n", - "Cbc0010I After 4341000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (446.19 seconds)\n", - "Cbc0010I After 4342000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (446.34 seconds)\n", - "Cbc0010I After 4343000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (446.53 seconds)\n", - "Cbc0017000 nodes, 218 on tree, 1e+50 best solution, best possible 0 (204.51 seconds)\n", - "Cbc0010I After 1308000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (204.63 seconds)\n", - "Cbc0010I After 1309000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (204.83 seconds)\n", - "Cbc0010I After 1310000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (205.02 seconds)\n", - "Cbc0010I After 1311000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (205.23 seconds)\n", - "Cbc0010I After 1312000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (205.38 seconds)\n", - "Cbc0010I After 1313000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (205.50 seconds)\n", - "Cbc0010I After 1314000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (205.63 seconds)\n", - "Cbc0010I After 1315000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (205.78 seconds)\n", - "Cbc0010I After 1316000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (205.94 seconds)\n", - "Cbc0010I After 1317000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (206.18 seconds)\n", - "Cbc0010I After 1318000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (206.34 seconds)\n", - "Cbc0010I After 1319000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (206.58 seconds)\n", - "Cbc0010I After 1320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (206.77 seconds)\n", - "Cbc0010I After 1321000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (206.94 seconds)\n", - "Cbc0010I After 1322000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (207.15 seconds)\n", - "Cbc0010I After 1323000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (207.37 seconds)\n", - "Cbc0010I After 1324000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (207.67 seconds)\n", - "Cbc0010I After 1325000 nodes, 241 on tree, 1e+50 best solution, best possible 0 (207.85 seconds)\n", - "Cbc0010I After 1326000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (208.08 seconds)\n", - "Cbc0010I After 1327000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (208.43 seconds)\n", - "Cbc0010I After 1328000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (208.66 seconds)\n", - "Cbc0010I After 1329000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (208.79 seconds)\n", - "Cbc0010I After 1330000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (208.91 seconds)\n", - "Cbc0010I After 1331000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (209.08 seconds)\n", - "Cbc0010I After 1332000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (209.20 seconds)\n", - "Cbc0010I After 1333000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (209.37 seconds)\n", - "Cbc0010I After 1334000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (209.50 seconds)\n", - "Cbc0010I After 1335000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (209.63 seconds)\n", - "Cbc0010I After 1336000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (209.72 seconds)\n", - "Cbc0010I After 1337000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (209.86 seconds)\n", - "Cbc0010I After 1338000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (209.98 seconds)\n", - "Cbc0010I After 1339000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (210.08 seconds)\n", - "Cbc0010I After 1340000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (210.17 seconds)\n", - "Cbc0010I After 1341000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (210.27 seconds)\n", - "Cbc0010I After 1342000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (210.34 seconds)\n", - "Cbc0010I After 1343000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (210.43 seconds)\n", - "Cbc0010I After 1344000 nodes, 15 on tree, 1e+50 best solution, best possible 0 (210.52 seconds)\n", - "Cbc0010I After 1345000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (210.63 seconds)\n", - "Cbc0010I After 1346000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (210.75 seconds)\n", - "Cbc0010I After 1347000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (210.86 seconds)\n", - "Cbc0010I After 1348000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (210.96 seconds)\n", - "Cbc0010I After 1349000 nodes, 111 on tree, 1e+50 best so0I After 4344000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (446.78 seconds)\n", - "Cbc0010I After 4345000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (446.92 seconds)\n", - "Cbc0010I After 4346000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (447.03 seconds)\n", - "Cbc0010I After 4347000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (447.17 seconds)\n", - "Cbc0010I After 4348000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (447.30 seconds)\n", - "Cbc0010I After 4349000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (447.53 seconds)\n", - "Cbc0010I After 4350000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (447.73 seconds)\n", - "Cbc0010I After 4351000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (447.95 seconds)\n", - "Cbc0010I After 4352000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (448.12 seconds)\n", - "Cbc0010I After 4353000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (448.33 seconds)\n", - "Cbc0010I After 4354000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (448.61 seconds)\n", - "Cbc0010I After 4355000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (449.08 seconds)\n", - "Cbc0010I After 4356000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (449.25 seconds)\n", - "Cbc0010I After 4357000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (449.44 seconds)\n", - "Cbc0010I After 4358000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.65 seconds)\n", - "Cbc0010I After 4359000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.80 seconds)\n", - "Cbc0010I After 4360000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (449.96 seconds)\n", - "Cbc0010I After 4361000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (450.15 seconds)\n", - "Cbc0010I After 4362000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (450.25 seconds)\n", - "Cbc0010I After 4363000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (450.38 seconds)\n", - "Cbc0010I After 4364000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (450.52 seconds)\n", - "Cbc0010I After 4365000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (450.64 seconds)\n", - "Cbc0010I After 4366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (450.76 seconds)\n", - "Cbc0010I After 4367000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (450.89 seconds)\n", - "Cbc0010I After 4368000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (451.05 seconds)\n", - "Cbc0010I After 4369000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (451.24 seconds)\n", - "Cbc0010I After 4370000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (451.41 seconds)\n", - "Cbc0010I After 4371000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (451.57 seconds)\n", - "Cbc0010I After 4372000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (451.84 seconds)\n", - "Cbc0010I After 4373000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (452.07 seconds)\n", - "Cbc0010I After 4374000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (452.17 seconds)\n", - "Cbc0010I After 4375000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (452.25 seconds)\n", - "Cbc0010I After 4376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (452.33 seconds)\n", - "Cbc0010I After 4377000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (452.41 seconds)\n", - "Cbc0010I After 4378000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (452.66 seconds)\n", - "Cbc0010I After 4379000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (452.80 seconds)\n", - "Cbc0010I After 4380000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (452.99 seconds)\n", - "Cbc0010I After 4381000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (453.17 seconds)\n", - "Cbc0010I After 4382000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (453.35 seconds)\n", - "Cbc0010I After 4383000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (453.53 seconds)\n", - "Cbc0010I After 4384000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (453.70 seconds)\n", - "Cbc0010I After 4385000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (453.90 seconds)\n", - "Cbc0010I After 4386000 nodes, 82 on tree, 1e+50 best solution, bestlution, best possible 0 (211.06 seconds)\n", - "Cbc0010I After 1350000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (211.23 seconds)\n", - "Cbc0010I After 1351000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (211.35 seconds)\n", - "Cbc0010I After 1352000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (211.50 seconds)\n", - "Cbc0010I After 1353000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (211.63 seconds)\n", - "Cbc0010I After 1354000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (211.75 seconds)\n", - "Cbc0010I After 1355000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (211.88 seconds)\n", - "Cbc0010I After 1356000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (212.02 seconds)\n", - "Cbc0010I After 1357000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (212.16 seconds)\n", - "Cbc0010I After 1358000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (212.30 seconds)\n", - "Cbc0010I After 1359000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (212.42 seconds)\n", - "Cbc0010I After 1360000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (212.55 seconds)\n", - "Cbc0010I After 1361000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (212.66 seconds)\n", - "Cbc0010I After 1362000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (212.77 seconds)\n", - "Cbc0010I After 1363000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (212.88 seconds)\n", - "Cbc0010I After 1364000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (213.00 seconds)\n", - "Cbc0010I After 1365000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (213.17 seconds)\n", - "Cbc0010I After 1366000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (213.35 seconds)\n", - "Cbc0010I After 1367000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (213.52 seconds)\n", - "Cbc0010I After 1368000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (213.70 seconds)\n", - "Cbc0010I After 1369000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (213.89 seconds)\n", - "Cbc0010I After 1370000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (214.08 seconds)\n", - "Cbc0010I After 1371000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (214.28 seconds)\n", - "Cbc0010I After 1372000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (214.42 seconds)\n", - "Cbc0010I After 1373000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (214.59 seconds)\n", - "Cbc0010I After 1374000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (214.85 seconds)\n", - "Cbc0010I After 1375000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (215.05 seconds)\n", - "Cbc0010I After 1376000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (215.24 seconds)\n", - "Cbc0010I After 1377000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (215.41 seconds)\n", - "Cbc0010I After 1378000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (215.58 seconds)\n", - "Cbc0010I After 1379000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (215.74 seconds)\n", - "Cbc0010I After 1380000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (215.90 seconds)\n", - "Cbc0010I After 1381000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (216.05 seconds)\n", - "Cbc0010I After 1382000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (216.23 seconds)\n", - "Cbc0010I After 1383000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (216.42 seconds)\n", - "Cbc0010I After 1384000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (216.62 seconds)\n", - "Cbc0010I After 1385000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (216.80 seconds)\n", - "Cbc0010I After 1386000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (217.01 seconds)\n", - "Cbc0010I After 1387000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (217.15 seconds)\n", - "Cbc0010I After 1388000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (217.31 seconds)\n", - "Cbc0010I After 1389000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (217.45 seconds)\n", - "Cbc0010I After 1390000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (217.58 seconds)\n", - "Cbc0010I After 1391000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (217.72 seconds)\n", - "Cbc0010I After 13 possible 0 (454.08 seconds)\n", - "Cbc0010I After 4387000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (454.17 seconds)\n", - "Cbc0010I After 4388000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (454.25 seconds)\n", - "Cbc0010I After 4389000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (454.50 seconds)\n", - "Cbc0010I After 4390000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (454.72 seconds)\n", - "Cbc0010I After 4391000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (454.89 seconds)\n", - "Cbc0010I After 4392000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (455.09 seconds)\n", - "Cbc0010I After 4393000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (455.33 seconds)\n", - "Cbc0010I After 4394000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (455.58 seconds)\n", - "Cbc0010I After 4395000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (455.79 seconds)\n", - "Cbc0010I After 4396000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (455.88 seconds)\n", - "Cbc0010I After 4397000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (456.13 seconds)\n", - "Cbc0010I After 4398000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (456.22 seconds)\n", - "Cbc0010I After 4399000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (456.35 seconds)\n", - "Cbc0010I After 4400000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (456.53 seconds)\n", - "Cbc0010I After 4401000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (456.82 seconds)\n", - "Cbc0010I After 4402000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (457.12 seconds)\n", - "Cbc0010I After 4403000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (457.44 seconds)\n", - "Cbc0010I After 4404000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (457.72 seconds)\n", - "Cbc0010I After 4405000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (457.97 seconds)\n", - "Cbc0010I After 4406000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (458.22 seconds)\n", - "Cbc0010I After 4407000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (458.37 seconds)\n", - "Cbc0010I After 4408000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (458.53 seconds)\n", - "Cbc0010I After 4409000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (458.69 seconds)\n", - "Cbc0010I After 4410000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (458.84 seconds)\n", - "Cbc0010I After 4411000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (459.03 seconds)\n", - "Cbc0010I After 4412000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (459.12 seconds)\n", - "Cbc0010I After 4413000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (459.18 seconds)\n", - "Cbc0010I After 4414000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (459.25 seconds)\n", - "Cbc0010I After 4415000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (459.33 seconds)\n", - "Cbc0010I After 4416000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (459.42 seconds)\n", - "Cbc0010I After 4417000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (459.50 seconds)\n", - "Cbc0010I After 4418000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (459.59 seconds)\n", - "Cbc0010I After 4419000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (459.67 seconds)\n", - "Cbc0010I After 4420000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (459.85 seconds)\n", - "Cbc0010I After 4421000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (460.00 seconds)\n", - "Cbc0010I After 4422000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (460.06 seconds)\n", - "Cbc0010I After 4423000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (460.12 seconds)\n", - "Cbc0010I After 4424000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (460.16 seconds)\n", - "Cbc0010I After 4425000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (460.27 seconds)\n", - "Cbc0010I After 4426000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (460.41 seconds)\n", - "Cbc0010I After 4427000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (460.56 seconds)\n", - "Cbc0010I After 4428000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (460.70 seconds)\n", - "Cbc0010I After 4429000 nodes,92000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (217.82 seconds)\n", - "Cbc0010I After 1393000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (217.90 seconds)\n", - "Cbc0010I After 1394000 nodes, 13 on tree, 1e+50 best solution, best possible 0 (217.99 seconds)\n", - "Cbc0010I After 1395000 nodes, 21 on tree, 1e+50 best solution, best possible 0 (218.10 seconds)\n", - "Cbc0010I After 1396000 nodes, 253 on tree, 1e+50 best solution, best possible 0 (218.29 seconds)\n", - "Cbc0010I After 1397000 nodes, 214 on tree, 1e+50 best solution, best possible 0 (218.51 seconds)\n", - "Cbc0010I After 1398000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (218.70 seconds)\n", - "Cbc0010I After 1399000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (218.88 seconds)\n", - "Cbc0010I After 1400000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (219.10 seconds)\n", - "Cbc0010I After 1401000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (219.30 seconds)\n", - "Cbc0010I After 1402000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (219.47 seconds)\n", - "Cbc0010I After 1403000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (219.61 seconds)\n", - "Cbc0010I After 1404000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (219.72 seconds)\n", - "Cbc0010I After 1405000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (219.84 seconds)\n", - "Cbc0010I After 1406000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (219.98 seconds)\n", - "Cbc0010I After 1407000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (220.11 seconds)\n", - "Cbc0010I After 1408000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (220.21 seconds)\n", - "Cbc0010I After 1409000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (220.31 seconds)\n", - "Cbc0010I After 1410000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (220.42 seconds)\n", - "Cbc0010I After 1411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (220.51 seconds)\n", - "Cbc0010I After 1412000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (220.65 seconds)\n", - "Cbc0010I After 1413000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (220.76 seconds)\n", - "Cbc0010I After 1414000 nodes, 247 on tree, 1e+50 best solution, best possible 0 (220.86 seconds)\n", - "Cbc0010I After 1415000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (221.00 seconds)\n", - "Cbc0010I After 1416000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (221.26 seconds)\n", - "Cbc0010I After 1417000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (221.43 seconds)\n", - "Cbc0010I After 1418000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (221.65 seconds)\n", - "Cbc0010I After 1419000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (221.87 seconds)\n", - "Cbc0010I After 1420000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (222.00 seconds)\n", - "Cbc0010I After 1421000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (222.15 seconds)\n", - "Cbc0010I After 1422000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (222.33 seconds)\n", - "Cbc0010I After 1423000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (222.44 seconds)\n", - "Cbc0010I After 1424000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (222.56 seconds)\n", - "Cbc0010I After 1425000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (222.66 seconds)\n", - "Cbc0010I After 1426000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (222.79 seconds)\n", - "Cbc0010I After 1427000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (222.89 seconds)\n", - "Cbc0010I After 1428000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (222.99 seconds)\n", - "Cbc0010I After 1429000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (223.11 seconds)\n", - "Cbc0010I After 1430000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (223.21 seconds)\n", - "Cbc0010I After 1431000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (223.32 seconds)\n", - "Cbc0010I After 1432000 nodes, 17 on tree, 1e+50 best solution, best possible 0 (223.47 seconds)\n", - "Cbc0010I After 1433000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (223.55 seconds)\n", - "Cbc0010I After 1434000 nodes, 155 on tree, 1e+50 best solution, 84 on tree, 1e+50 best solution, best possible 0 (460.83 seconds)\n", - "Cbc0010I After 4430000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (460.98 seconds)\n", - "Cbc0010I After 4431000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (461.13 seconds)\n", - "Cbc0010I After 4432000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (461.25 seconds)\n", - "Cbc0010I After 4433000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (461.35 seconds)\n", - "Cbc0010I After 4434000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (461.57 seconds)\n", - "Cbc0010I After 4435000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (461.79 seconds)\n", - "Cbc0010I After 4436000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (462.01 seconds)\n", - "Cbc0010I After 4437000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (462.30 seconds)\n", - "Cbc0010I After 4438000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (462.42 seconds)\n", - "Cbc0010I After 4439000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (462.48 seconds)\n", - "Cbc0010I After 4440000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (462.56 seconds)\n", - "Cbc0010I After 4441000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (462.63 seconds)\n", - "Cbc0010I After 4442000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (462.69 seconds)\n", - "Cbc0010I After 4443000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (462.76 seconds)\n", - "Cbc0010I After 4444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (462.82 seconds)\n", - "Cbc0010I After 4445000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (462.90 seconds)\n", - "Cbc0010I After 4446000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (463.02 seconds)\n", - "Cbc0010I After 4447000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (463.10 seconds)\n", - "Cbc0010I After 4448000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (463.16 seconds)\n", - "Cbc0010I After 4449000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (463.30 seconds)\n", - "Cbc0010I After 4450000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (463.44 seconds)\n", - "Cbc0010I After 4451000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (463.55 seconds)\n", - "Cbc0010I After 4452000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (463.71 seconds)\n", - "Cbc0010I After 4453000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (463.80 seconds)\n", - "Cbc0010I After 4454000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (463.97 seconds)\n", - "Cbc0010I After 4455000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (464.13 seconds)\n", - "Cbc0010I After 4456000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (464.27 seconds)\n", - "Cbc0010I After 4457000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (464.38 seconds)\n", - "Cbc0010I After 4458000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (464.51 seconds)\n", - "Cbc0010I After 4459000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (464.57 seconds)\n", - "Cbc0010I After 4460000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (464.67 seconds)\n", - "Cbc0010I After 4461000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (464.84 seconds)\n", - "Cbc0010I After 4462000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (464.99 seconds)\n", - "Cbc0010I After 4463000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (465.16 seconds)\n", - "Cbc0010I After 4464000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (465.36 seconds)\n", - "Cbc0010I After 4465000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (465.55 seconds)\n", - "Cbc0010I After 4466000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (465.76 seconds)\n", - "Cbc0010I After 4467000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (465.97 seconds)\n", - "Cbc0010I After 4468000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (466.16 seconds)\n", - "Cbc0010I After 4469000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (466.36 seconds)\n", - "Cbc0010I After 4470000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (466.54 seconds)\n", - "Cbc0010I After 4471000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (466.70 seco best possible 0 (223.66 seconds)\n", - "Cbc0010I After 1435000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (223.76 seconds)\n", - "Cbc0010I After 1436000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (223.83 seconds)\n", - "Cbc0010I After 1437000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (223.91 seconds)\n", - "Cbc0010I After 1438000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (223.99 seconds)\n", - "Cbc0010I After 1439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (224.10 seconds)\n", - "Cbc0010I After 1440000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (224.20 seconds)\n", - "Cbc0010I After 1441000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (224.31 seconds)\n", - "Cbc0010I After 1442000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (224.41 seconds)\n", - "Cbc0010I After 1443000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (224.52 seconds)\n", - "Cbc0010I After 1444000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (224.62 seconds)\n", - "Cbc0010I After 1445000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (224.73 seconds)\n", - "Cbc0010I After 1446000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (224.84 seconds)\n", - "Cbc0010I After 1447000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (224.96 seconds)\n", - "Cbc0010I After 1448000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (225.06 seconds)\n", - "Cbc0010I After 1449000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (225.18 seconds)\n", - "Cbc0010I After 1450000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (225.29 seconds)\n", - "Cbc0010I After 1451000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (225.43 seconds)\n", - "Cbc0010I After 1452000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (225.55 seconds)\n", - "Cbc0010I After 1453000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (225.68 seconds)\n", - "Cbc0010I After 1454000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (225.79 seconds)\n", - "Cbc0010I After 1455000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (225.91 seconds)\n", - "Cbc0010I After 1456000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (226.02 seconds)\n", - "Cbc0010I After 1457000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (226.11 seconds)\n", - "Cbc0010I After 1458000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (226.21 seconds)\n", - "Cbc0010I After 1459000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (226.30 seconds)\n", - "Cbc0010I After 1460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (226.40 seconds)\n", - "Cbc0010I After 1461000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (226.51 seconds)\n", - "Cbc0010I After 1462000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (226.62 seconds)\n", - "Cbc0010I After 1463000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (226.71 seconds)\n", - "Cbc0010I After 1464000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (226.79 seconds)\n", - "Cbc0010I After 1465000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (226.88 seconds)\n", - "Cbc0010I After 1466000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (226.96 seconds)\n", - "Cbc0010I After 1467000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (227.03 seconds)\n", - "Cbc0010I After 1468000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (227.11 seconds)\n", - "Cbc0010I After 1469000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (227.26 seconds)\n", - "Cbc0010I After 1470000 nodes, 13 on tree, 1e+50 best solution, best possible 0 (227.45 seconds)\n", - "Cbc0010I After 1471000 nodes, 238 on tree, 1e+50 best solution, best possible 0 (227.64 seconds)\n", - "Cbc0010I After 1472000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (227.84 seconds)\n", - "Cbc0010I After 1473000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (228.02 seconds)\n", - "Cbc0010I After 1474000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (228.21 seconds)\n", - "Cbc0010I After 1475000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (228.38 seconds)\n", - "Cbc0010I After 1476000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (228.51 seconds)\n", - "Cbc0010I Afternds)\n", - "Cbc0010I After 4472000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (466.87 seconds)\n", - "Cbc0010I After 4473000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (467.07 seconds)\n", - "Cbc0010I After 4474000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (467.22 seconds)\n", - "Cbc0010I After 4475000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (467.36 seconds)\n", - "Cbc0010I After 4476000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (467.49 seconds)\n", - "Cbc0010I After 4477000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (467.62 seconds)\n", - "Cbc0010I After 4478000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (467.77 seconds)\n", - "Cbc0010I After 4479000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (467.98 seconds)\n", - "Cbc0010I After 4480000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (468.23 seconds)\n", - "Cbc0010I After 4481000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (468.44 seconds)\n", - "Cbc0010I After 4482000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (468.66 seconds)\n", - "Cbc0010I After 4483000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (468.85 seconds)\n", - "Cbc0010I After 4484000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (469.00 seconds)\n", - "Cbc0010I After 4485000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (469.16 seconds)\n", - "Cbc0010I After 4486000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (469.30 seconds)\n", - "Cbc0010I After 4487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (469.46 seconds)\n", - "Cbc0010I After 4488000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (469.62 seconds)\n", - "Cbc0010I After 4489000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (469.78 seconds)\n", - "Cbc0010I After 4490000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (469.92 seconds)\n", - "Cbc0010I After 4491000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (470.05 seconds)\n", - "Cbc0010I After 4492000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (470.17 seconds)\n", - "Cbc0010I After 4493000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (470.31 seconds)\n", - "Cbc0010I After 4494000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (470.44 seconds)\n", - "Cbc0010I After 4495000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (470.62 seconds)\n", - "Cbc0010I After 4496000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (470.93 seconds)\n", - "Cbc0010I After 4497000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (471.15 seconds)\n", - "Cbc0010I After 4498000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (471.36 seconds)\n", - "Cbc0010I After 4499000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (471.58 seconds)\n", - "Cbc0010I After 4500000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (471.78 seconds)\n", - "Cbc0010I After 4501000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (471.94 seconds)\n", - "Cbc0010I After 4502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (472.13 seconds)\n", - "Cbc0010I After 4503000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (472.31 seconds)\n", - "Cbc0010I After 4504000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (472.47 seconds)\n", - "Cbc0010I After 4505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (472.66 seconds)\n", - "Cbc0010I After 4506000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (472.87 seconds)\n", - "Cbc0010I After 4507000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (473.08 seconds)\n", - "Cbc0010I After 4508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (473.30 seconds)\n", - "Cbc0010I After 4509000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (473.51 seconds)\n", - "Cbc0010I After 4510000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (473.72 seconds)\n", - "Cbc0010I After 4511000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (473.91 seconds)\n", - "Cbc0010I After 4512000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (474.11 seconds)\n", - "Cbc0010I After 4513000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (474.26 seconds)\n", - "Cbc0010I After 4514000 nodes, 80 on tree, 1e+50 best soluti 1477000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (228.67 seconds)\n", - "Cbc0010I After 1478000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (228.78 seconds)\n", - "Cbc0010I After 1479000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (228.94 seconds)\n", - "Cbc0010I After 1480000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (229.06 seconds)\n", - "Cbc0010I After 1481000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (229.21 seconds)\n", - "Cbc0010I After 1482000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (229.32 seconds)\n", - "Cbc0010I After 1483000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (229.45 seconds)\n", - "Cbc0010I After 1484000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (229.58 seconds)\n", - "Cbc0010I After 1485000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (229.68 seconds)\n", - "Cbc0010I After 1486000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (229.80 seconds)\n", - "Cbc0010I After 1487000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (229.89 seconds)\n", - "Cbc0010I After 1488000 nodes, 243 on tree, 1e+50 best solution, best possible 0 (229.97 seconds)\n", - "Cbc0010I After 1489000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (230.11 seconds)\n", - "Cbc0010I After 1490000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (230.38 seconds)\n", - "Cbc0010I After 1491000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (230.55 seconds)\n", - "Cbc0010I After 1492000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (230.70 seconds)\n", - "Cbc0010I After 1493000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (230.90 seconds)\n", - "Cbc0010I After 1494000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (231.06 seconds)\n", - "Cbc0010I After 1495000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (231.24 seconds)\n", - "Cbc0010I After 1496000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (231.42 seconds)\n", - "Cbc0010I After 1497000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (231.55 seconds)\n", - "Cbc0010I After 1498000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (231.69 seconds)\n", - "Cbc0010I After 1499000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (231.86 seconds)\n", - "Cbc0010I After 1500000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (231.98 seconds)\n", - "Cbc0010I After 1501000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (232.11 seconds)\n", - "Cbc0010I After 1502000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (232.27 seconds)\n", - "Cbc0010I After 1503000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (232.47 seconds)\n", - "Cbc0010I After 1504000 nodes, 18 on tree, 1e+50 best solution, best possible 0 (232.62 seconds)\n", - "Cbc0010I After 1505000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (232.76 seconds)\n", - "Cbc0010I After 1506000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (232.89 seconds)\n", - "Cbc0010I After 1507000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (233.02 seconds)\n", - "Cbc0010I After 1508000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (233.15 seconds)\n", - "Cbc0010I After 1509000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (233.28 seconds)\n", - "Cbc0010I After 1510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (233.40 seconds)\n", - "Cbc0010I After 1511000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (233.52 seconds)\n", - "Cbc0010I After 1512000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (233.62 seconds)\n", - "Cbc0010I After 1513000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (233.71 seconds)\n", - "Cbc0010I After 1514000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (233.79 seconds)\n", - "Cbc0010I After 1515000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (233.87 seconds)\n", - "Cbc0010I After 1516000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (233.97 seconds)\n", - "Cbc0010I After 1517000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (234.06 seconds)\n", - "Cbc0010I After 1518000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (234.16 seconds)\n", - "Cbc0010I After 1519000 nodes, 54 on tree, 1e+50 best solutionon, best possible 0 (474.41 seconds)\n", - "Cbc0010I After 4515000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (474.57 seconds)\n", - "Cbc0010I After 4516000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (474.74 seconds)\n", - "Cbc0010I After 4517000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (474.88 seconds)\n", - "Cbc0010I After 4518000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (475.07 seconds)\n", - "Cbc0010I After 4519000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (475.19 seconds)\n", - "Cbc0010I After 4520000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (475.28 seconds)\n", - "Cbc0010I After 4521000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (475.35 seconds)\n", - "Cbc0010I After 4522000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (475.46 seconds)\n", - "Cbc0010I After 4523000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (475.57 seconds)\n", - "Cbc0010I After 4524000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (475.80 seconds)\n", - "Cbc0010I After 4525000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (476.02 seconds)\n", - "Cbc0010I After 4526000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (476.19 seconds)\n", - "Cbc0010I After 4527000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (476.35 seconds)\n", - "Cbc0010I After 4528000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (476.52 seconds)\n", - "Cbc0010I After 4529000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (476.65 seconds)\n", - "Cbc0010I After 4530000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (476.79 seconds)\n", - "Cbc0010I After 4531000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (476.94 seconds)\n", - "Cbc0010I After 4532000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (477.18 seconds)\n", - "Cbc0010I After 4533000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (477.40 seconds)\n", - "Cbc0010I After 4534000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (477.61 seconds)\n", - "Cbc0010I After 4535000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (477.83 seconds)\n", - "Cbc0010I After 4536000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (477.99 seconds)\n", - "Cbc0010I After 4537000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (478.12 seconds)\n", - "Cbc0010I After 4538000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (478.17 seconds)\n", - "Cbc0010I After 4539000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (478.22 seconds)\n", - "Cbc0010I After 4540000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (478.27 seconds)\n", - "Cbc0010I After 4541000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (478.31 seconds)\n", - "Cbc0010I After 4542000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (478.38 seconds)\n", - "Cbc0010I After 4543000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (478.43 seconds)\n", - "Cbc0010I After 4544000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (478.56 seconds)\n", - "Cbc0010I After 4545000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (478.67 seconds)\n", - "Cbc0010I After 4546000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (478.82 seconds)\n", - "Cbc0010I After 4547000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (479.02 seconds)\n", - "Cbc0010I After 4548000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (479.15 seconds)\n", - "Cbc0010I After 4549000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (479.32 seconds)\n", - "Cbc0010I After 4550000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (479.47 seconds)\n", - "Cbc0010I After 4551000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (479.63 seconds)\n", - "Cbc0010I After 4552000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (479.79 seconds)\n", - "Cbc0010I After 4553000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (479.94 seconds)\n", - "Cbc0010I After 4554000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (480.10 seconds)\n", - "Cbc0010I After 4555000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (480.25 seconds)\n", - "Cbc0010I After 4556000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (480.42 seconds)\n", - "Cbc0010I After 4, best possible 0 (234.25 seconds)\n", - "Cbc0010I After 1520000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (234.33 seconds)\n", - "Cbc0010I After 1521000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (234.51 seconds)\n", - "Cbc0010I After 1522000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (234.68 seconds)\n", - "Cbc0010I After 1523000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (234.82 seconds)\n", - "Cbc0010I After 1524000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (234.96 seconds)\n", - "Cbc0010I After 1525000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (235.15 seconds)\n", - "Cbc0010I After 1526000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (235.29 seconds)\n", - "Cbc0010I After 1527000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (235.42 seconds)\n", - "Cbc0010I After 1528000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (235.54 seconds)\n", - "Cbc0010I After 1529000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (235.64 seconds)\n", - "Cbc0010I After 1530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (235.74 seconds)\n", - "Cbc0010I After 1531000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (235.84 seconds)\n", - "Cbc0010I After 1532000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (235.93 seconds)\n", - "Cbc0010I After 1533000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (236.03 seconds)\n", - "Cbc0010I After 1534000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (236.11 seconds)\n", - "Cbc0010I After 1535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (236.18 seconds)\n", - "Cbc0010I After 1536000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (236.26 seconds)\n", - "Cbc0010I After 1537000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (236.35 seconds)\n", - "Cbc0010I After 1538000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (236.44 seconds)\n", - "Cbc0010I After 1539000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (236.58 seconds)\n", - "Cbc0010I After 1540000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (236.82 seconds)\n", - "Cbc0010I After 1541000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (237.04 seconds)\n", - "Cbc0010I After 1542000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (237.26 seconds)\n", - "Cbc0010I After 1543000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (237.43 seconds)\n", - "Cbc0010I After 1544000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (237.60 seconds)\n", - "Cbc0010I After 1545000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (237.69 seconds)\n", - "Cbc0010I After 1546000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (237.77 seconds)\n", - "Cbc0010I After 1547000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (237.92 seconds)\n", - "Cbc0010I After 1548000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (238.03 seconds)\n", - "Cbc0010I After 1549000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (238.16 seconds)\n", - "Cbc0010I After 1550000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (238.34 seconds)\n", - "Cbc0010I After 1551000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (238.47 seconds)\n", - "Cbc0010I After 1552000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (238.60 seconds)\n", - "Cbc0010I After 1553000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (238.75 seconds)\n", - "Cbc0010I After 1554000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (238.95 seconds)\n", - "Cbc0010I After 1555000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (239.09 seconds)\n", - "Cbc0010I After 1556000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (239.22 seconds)\n", - "Cbc0010I After 1557000 nodes, 229 on tree, 1e+50 best solution, best possible 0 (239.36 seconds)\n", - "Cbc0010I After 1558000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (239.51 seconds)\n", - "Cbc0010I After 1559000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (239.66 seconds)\n", - "Cbc0010I After 1560000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (239.81 seconds)\n", - "Cbc0010I After 1561000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (240.00 seconds)\n", - "Cbc0010I After 1562000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (240.20 seconds)\n", - "Cbc0010I After 1563000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (240.35 seconds)\n", - "Cbc0010I After 1564000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (240.53 seconds)\n", - "Cbc0010I After 1565000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (240.73 seconds)\n", - "Cbc0010I After 1566000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (240.88 seconds)\n", - "Cbc0010I After 1567000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (241.12 seconds)\n", - "Cbc0010I After 1568000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (241.29 seconds)\n", - "Cbc0010I After 1569000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (241.44 seconds)\n", - "Cbc0010I After 1570000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (241.72 seconds)\n", - "Cbc0010I After 1571000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (241.90 seconds)\n", - "Cbc0010I After 1572000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (242.16 seconds)\n", - "Cbc0010I After 1573000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (242.34 seconds)\n", - "Cbc0010I After 1574000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (242.51 seconds)\n", - "Cbc0010I After 1575000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (242.66 seconds)\n", - "Cbc0010I After 1576000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (242.81 seconds)\n", - "Cbc0010I After 1577000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (242.97 seconds)\n", - "Cbc0010I After 1578000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (243.15 seconds)\n", - "Cbc0010I After 1579000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (243.29 seconds)\n", - "Cbc0010I After 1580000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (243.39 seconds)\n", - "Cbc0010I After 1581000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (243.49 seconds)\n", - "Cbc0010I After 1582000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (243.58 seconds)\n", - "Cbc0010I After 1583000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (243.66 seconds)\n", - "Cbc0010I After 1584000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (243.75 seconds)\n", - "Cbc0010I After 1585000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (243.84 seconds)\n", - "Cbc0010I After 1586000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (243.95 seconds)\n", - "Cbc0010I After 1587000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (244.18 seconds)\n", - "Cbc0010I After 1588000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (244.33 seconds)\n", - "Cbc0010I After 1589000 nodes, 246 on tree, 1e+50 best solution, best possible 0 (244.57 seconds)\n", - "Cbc0010I After 1590000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (244.74 seconds)\n", - "Cbc0010I After 1591000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (244.92 seconds)\n", - "Cbc0010I After 1592000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (245.07 seconds)\n", - "Cbc0010I After 1593000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (245.23 seconds)\n", - "Cbc0010I After 1594000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (245.39 seconds)\n", - "Cbc0010I After 1595000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (245.55 seconds)\n", - "Cbc0010I After 1596000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (245.68 seconds)\n", - "Cbc0010I After 1597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (245.85 seconds)\n", - "Cbc0010I After 1598000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (245.99 seconds)\n", - "Cbc0010I After 1599000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (246.21 seconds)\n", - "Cbc0010I After 1600000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (246.37 seconds)\n", - "Cbc0010I After 1601000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (246.60 seconds)\n", - "Cbc0010I After 1602000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (246.80 seconds)\n", - "Cbc0010I After 1603000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (246.93 seconds)\n", - "Cbc0010I After 1604000 nodes, 215 on tree, 1e+50 best so557000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (480.61 seconds)\n", - "Cbc0010I After 4558000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (480.77 seconds)\n", - "Cbc0010I After 4559000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (480.99 seconds)\n", - "Cbc0010I After 4560000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (481.21 seconds)\n", - "Cbc0010I After 4561000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (481.45 seconds)\n", - "Cbc0010I After 4562000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (481.69 seconds)\n", - "Cbc0010I After 4563000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (481.93 seconds)\n", - "Cbc0010I After 4564000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (482.18 seconds)\n", - "Cbc0010I After 4565000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (482.43 seconds)\n", - "Cbc0010I After 4566000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (482.74 seconds)\n", - "Cbc0010I After 4567000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (482.97 seconds)\n", - "Cbc0010I After 4568000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (483.17 seconds)\n", - "Cbc0010I After 4569000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (483.38 seconds)\n", - "Cbc0010I After 4570000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (483.59 seconds)\n", - "Cbc0010I After 4571000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (483.78 seconds)\n", - "Cbc0010I After 4572000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (483.94 seconds)\n", - "Cbc0010I After 4573000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (484.05 seconds)\n", - "Cbc0010I After 4574000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (484.17 seconds)\n", - "Cbc0010I After 4575000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (484.32 seconds)\n", - "Cbc0010I After 4576000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (484.45 seconds)\n", - "Cbc0010I After 4577000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (484.77 seconds)\n", - "Cbc0010I After 4578000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (485.03 seconds)\n", - "Cbc0010I After 4579000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (485.17 seconds)\n", - "Cbc0010I After 4580000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (485.34 seconds)\n", - "Cbc0010I After 4581000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (485.47 seconds)\n", - "Cbc0010I After 4582000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (485.62 seconds)\n", - "Cbc0010I After 4583000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (485.73 seconds)\n", - "Cbc0010I After 4584000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (485.87 seconds)\n", - "Cbc0010I After 4585000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (486.02 seconds)\n", - "Cbc0010I After 4586000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (486.12 seconds)\n", - "Cbc0010I After 4587000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (486.24 seconds)\n", - "Cbc0010I After 4588000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (486.40 seconds)\n", - "Cbc0010I After 4589000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (486.60 seconds)\n", - "Cbc0010I After 4590000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (486.78 seconds)\n", - "Cbc0010I After 4591000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (486.91 seconds)\n", - "Cbc0010I After 4592000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (487.16 seconds)\n", - "Cbc0010I After 4593000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (487.34 seconds)\n", - "Cbc0010I After 4594000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (487.46 seconds)\n", - "Cbc0010I After 4595000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (487.58 seconds)\n", - "Cbc0010I After 4596000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (487.68 seconds)\n", - "Cbc0010I After 4597000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (487.79 seconds)\n", - "Cbc0010I After 4598000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (487.90 seconds)\n", - "Cbc0010I After 4599000 nodes, 99 on tree, 1e+50 best solution, best plution, best possible 0 (247.06 seconds)\n", - "Cbc0010I After 1605000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (247.19 seconds)\n", - "Cbc0010I After 1606000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (247.34 seconds)\n", - "Cbc0010I After 1607000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (247.46 seconds)\n", - "Cbc0010I After 1608000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (247.61 seconds)\n", - "Cbc0010I After 1609000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (247.77 seconds)\n", - "Cbc0010I After 1610000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (247.92 seconds)\n", - "Cbc0010I After 1611000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (248.05 seconds)\n", - "Cbc0010I After 1612000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (248.14 seconds)\n", - "Cbc0010I After 1613000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (248.23 seconds)\n", - "Cbc0010I After 1614000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (248.33 seconds)\n", - "Cbc0010I After 1615000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (248.42 seconds)\n", - "Cbc0010I After 1616000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (248.51 seconds)\n", - "Cbc0010I After 1617000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (248.61 seconds)\n", - "Cbc0010I After 1618000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (248.74 seconds)\n", - "Cbc0010I After 1619000 nodes, 254 on tree, 1e+50 best solution, best possible 0 (248.83 seconds)\n", - "Cbc0010I After 1620000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (248.99 seconds)\n", - "Cbc0010I After 1621000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (249.13 seconds)\n", - "Cbc0010I After 1622000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (249.29 seconds)\n", - "Cbc0010I After 1623000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (249.40 seconds)\n", - "Cbc0010I After 1624000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (249.59 seconds)\n", - "Cbc0010I After 1625000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (249.83 seconds)\n", - "Cbc0010I After 1626000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (250.04 seconds)\n", - "Cbc0010I After 1627000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (250.14 seconds)\n", - "Cbc0010I After 1628000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (250.27 seconds)\n", - "Cbc0010I After 1629000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (250.39 seconds)\n", - "Cbc0010I After 1630000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (250.47 seconds)\n", - "Cbc0010I After 1631000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (250.60 seconds)\n", - "Cbc0010I After 1632000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (250.70 seconds)\n", - "Cbc0010I After 1633000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (250.79 seconds)\n", - "Cbc0010I After 1634000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (250.92 seconds)\n", - "Cbc0010I After 1635000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (251.04 seconds)\n", - "Cbc0010I After 1636000 nodes, 220 on tree, 1e+50 best solution, best possible 0 (251.18 seconds)\n", - "Cbc0010I After 1637000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (251.33 seconds)\n", - "Cbc0010I After 1638000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (251.50 seconds)\n", - "Cbc0010I After 1639000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (251.66 seconds)\n", - "Cbc0010I After 1640000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (251.79 seconds)\n", - "Cbc0010I After 1641000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (251.94 seconds)\n", - "Cbc0010I After 1642000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (252.11 seconds)\n", - "Cbc0010I After 1643000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (252.21 seconds)\n", - "Cbc0010I After 1644000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (252.31 seconds)\n", - "Cbc0010I After 1645000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (252.45 seconds)\n", - "Cbc0010I After 1646000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (252.57 secondsossible 0 (488.02 seconds)\n", - "Cbc0010I After 4600000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (488.20 seconds)\n", - "Cbc0010I After 4601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (488.36 seconds)\n", - "Cbc0010I After 4602000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (488.52 seconds)\n", - "Cbc0010I After 4603000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (488.62 seconds)\n", - "Cbc0010I After 4604000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (488.71 seconds)\n", - "Cbc0010I After 4605000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (488.81 seconds)\n", - "Cbc0010I After 4606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (488.90 seconds)\n", - "Cbc0010I After 4607000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (489.00 seconds)\n", - "Cbc0010I After 4608000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (489.08 seconds)\n", - "Cbc0010I After 4609000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (489.19 seconds)\n", - "Cbc0010I After 4610000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (489.31 seconds)\n", - "Cbc0010I After 4611000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (489.45 seconds)\n", - "Cbc0010I After 4612000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (489.59 seconds)\n", - "Cbc0010I After 4613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (489.73 seconds)\n", - "Cbc0010I After 4614000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (489.84 seconds)\n", - "Cbc0010I After 4615000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (489.93 seconds)\n", - "Cbc0010I After 4616000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (490.08 seconds)\n", - "Cbc0010I After 4617000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (490.31 seconds)\n", - "Cbc0010I After 4618000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (490.47 seconds)\n", - "Cbc0010I After 4619000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (490.61 seconds)\n", - "Cbc0010I After 4620000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (490.71 seconds)\n", - "Cbc0010I After 4621000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (490.77 seconds)\n", - "Cbc0010I After 4622000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (490.91 seconds)\n", - "Cbc0010I After 4623000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (491.04 seconds)\n", - "Cbc0010I After 4624000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (491.10 seconds)\n", - "Cbc0010I After 4625000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (491.15 seconds)\n", - "Cbc0010I After 4626000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (491.24 seconds)\n", - "Cbc0010I After 4627000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (491.38 seconds)\n", - "Cbc0010I After 4628000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (491.50 seconds)\n", - "Cbc0010I After 4629000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (491.64 seconds)\n", - "Cbc0010I After 4630000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (491.81 seconds)\n", - "Cbc0010I After 4631000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (491.96 seconds)\n", - "Cbc0010I After 4632000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (492.10 seconds)\n", - "Cbc0010I After 4633000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (492.23 seconds)\n", - "Cbc0010I After 4634000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (492.36 seconds)\n", - "Cbc0010I After 4635000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (492.51 seconds)\n", - "Cbc0010I After 4636000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (492.64 seconds)\n", - "Cbc0010I After 4637000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (492.73 seconds)\n", - "Cbc0010I After 4638000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (492.85 seconds)\n", - "Cbc0010I After 4639000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (492.96 seconds)\n", - "Cbc0010I After 4640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (493.11 seconds)\n", - "Cbc0010I After 4641000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (493.28 seconds)\n", - "Cbc0010I After 4642000 no)\n", - "Cbc0010I After 1647000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (252.68 seconds)\n", - "Cbc0010I After 1648000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (252.87 seconds)\n", - "Cbc0010I After 1649000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (253.03 seconds)\n", - "Cbc0010I After 1650000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (253.28 seconds)\n", - "Cbc0010I After 1651000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (253.44 seconds)\n", - "Cbc0010I After 1652000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (253.67 seconds)\n", - "Cbc0010I After 1653000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (253.84 seconds)\n", - "Cbc0010I After 1654000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (253.98 seconds)\n", - "Cbc0010I After 1655000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (254.17 seconds)\n", - "Cbc0010I After 1656000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (254.33 seconds)\n", - "Cbc0010I After 1657000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (254.48 seconds)\n", - "Cbc0010I After 1658000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (254.63 seconds)\n", - "Cbc0010I After 1659000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (254.84 seconds)\n", - "Cbc0010I After 1660000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (254.99 seconds)\n", - "Cbc0010I After 1661000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (255.20 seconds)\n", - "Cbc0010I After 1662000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (255.47 seconds)\n", - "Cbc0010I After 1663000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (255.66 seconds)\n", - "Cbc0010I After 1664000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (255.87 seconds)\n", - "Cbc0010I After 1665000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (256.05 seconds)\n", - "Cbc0010I After 1666000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (256.19 seconds)\n", - "Cbc0010I After 1667000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (256.33 seconds)\n", - "Cbc0010I After 1668000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (256.43 seconds)\n", - "Cbc0010I After 1669000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (256.55 seconds)\n", - "Cbc0010I After 1670000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (256.63 seconds)\n", - "Cbc0010I After 1671000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (256.75 seconds)\n", - "Cbc0010I After 1672000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (256.84 seconds)\n", - "Cbc0010I After 1673000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (256.96 seconds)\n", - "Cbc0010I After 1674000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (257.06 seconds)\n", - "Cbc0010I After 1675000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (257.16 seconds)\n", - "Cbc0010I After 1676000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (257.27 seconds)\n", - "Cbc0010I After 1677000 nodes, 213 on tree, 1e+50 best solution, best possible 0 (257.42 seconds)\n", - "Cbc0010I After 1678000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (257.56 seconds)\n", - "Cbc0010I After 1679000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (257.72 seconds)\n", - "Cbc0010I After 1680000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (257.86 seconds)\n", - "Cbc0010I After 1681000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (258.02 seconds)\n", - "Cbc0010I After 1682000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (258.24 seconds)\n", - "Cbc0010I After 1683000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (258.40 seconds)\n", - "Cbc0010I After 1684000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (258.65 seconds)\n", - "Cbc0010I After 1685000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (258.91 seconds)\n", - "Cbc0010I After 1686000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (259.09 seconds)\n", - "Cbc0010I After 1687000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (259.29 seconds)\n", - "Cbc0010I After 1688000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (259.48 seconds)\n", - "Cbc0010I After 1689000 nodes, 34 on tree,des, 107 on tree, 1e+50 best solution, best possible 0 (493.45 seconds)\n", - "Cbc0010I After 4643000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (493.70 seconds)\n", - "Cbc0010I After 4644000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (493.89 seconds)\n", - "Cbc0010I After 4645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (494.10 seconds)\n", - "Cbc0010I After 4646000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (494.27 seconds)\n", - "Cbc0010I After 4647000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (494.47 seconds)\n", - "Cbc0010I After 4648000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (494.65 seconds)\n", - "Cbc0010I After 4649000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (494.88 seconds)\n", - "Cbc0010I After 4650000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (495.05 seconds)\n", - "Cbc0010I After 4651000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (495.19 seconds)\n", - "Cbc0010I After 4652000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (495.37 seconds)\n", - "Cbc0010I After 4653000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (495.60 seconds)\n", - "Cbc0010I After 4654000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (495.82 seconds)\n", - "Cbc0010I After 4655000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (496.01 seconds)\n", - "Cbc0010I After 4656000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (496.23 seconds)\n", - "Cbc0010I After 4657000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (496.41 seconds)\n", - "Cbc0010I After 4658000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (496.56 seconds)\n", - "Cbc0010I After 4659000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (496.71 seconds)\n", - "Cbc0010I After 4660000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (496.85 seconds)\n", - "Cbc0010I After 4661000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (496.99 seconds)\n", - "Cbc0010I After 4662000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (497.09 seconds)\n", - "Cbc0010I After 4663000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (497.21 seconds)\n", - "Cbc0010I After 4664000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (497.32 seconds)\n", - "Cbc0010I After 4665000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (497.44 seconds)\n", - "Cbc0010I After 4666000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (497.58 seconds)\n", - "Cbc0010I After 4667000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (497.66 seconds)\n", - "Cbc0010I After 4668000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (497.79 seconds)\n", - "Cbc0010I After 4669000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (497.93 seconds)\n", - "Cbc0010I After 4670000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (498.06 seconds)\n", - "Cbc0010I After 4671000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (498.17 seconds)\n", - "Cbc0010I After 4672000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (498.30 seconds)\n", - "Cbc0010I After 4673000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (498.47 seconds)\n", - "Cbc0010I After 4674000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (498.67 seconds)\n", - "Cbc0010I After 4675000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (498.85 seconds)\n", - "Cbc0010I After 4676000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (498.99 seconds)\n", - "Cbc0010I After 4677000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (499.27 seconds)\n", - "Cbc0010I After 4678000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (499.53 seconds)\n", - "Cbc0010I After 4679000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (499.68 seconds)\n", - "Cbc0010I After 4680000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (499.81 seconds)\n", - "Cbc0010I After 4681000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (500.02 seconds)\n", - "Cbc0010I After 4682000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (500.17 seconds)\n", - "Cbc0010I After 4683000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (500.30 seconds)\n", - "Cbc0010I After 4684000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (500.43 seconds)\n", - "Cbc0010I After 4685000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (500.59 seconds)\n", - "Cbc0010I After 4686000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (500.71 seconds)\n", - "Cbc0010I After 4687000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (500.80 seconds)\n", - "Cbc0010I After 4688000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (500.90 seconds)\n", - "Cbc0010I After 4689000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (501.00 seconds)\n", - "Cbc0010I After 4690000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (501.12 seconds)\n", - "Cbc0010I After 4691000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (501.25 seconds)\n", - "Cbc0010I After 4692000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (501.34 seconds)\n", - "Cbc0010I After 4693000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (501.47 seconds)\n", - "Cbc0010I After 4694000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (501.56 seconds)\n", - "Cbc0010I After 4695000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (501.65 seconds)\n", - "Cbc0010I After 4696000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (501.75 seconds)\n", - "Cbc0010I After 4697000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (501.85 seconds)\n", - "Cbc0010I After 4698000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (501.98 seconds)\n", - "Cbc0010I After 4699000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (502.08 seconds)\n", - "Cbc0010I After 4700000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (502.18 seconds)\n", - "Cbc0010I After 4701000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (502.32 seconds)\n", - "Cbc0010I After 4702000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (502.45 seconds)\n", - "Cbc0010I After 4703000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (502.57 seconds)\n", - "Cbc0010I After 4704000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (502.78 seconds)\n", - "Cbc0010I After 4705000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (502.95 seconds)\n", - "Cbc0010I After 4706000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (503.15 seconds)\n", - "Cbc0010I After 4707000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (503.45 seconds)\n", - "Cbc0010I After 4708000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (503.57 seconds)\n", - "Cbc0010I After 4709000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (503.72 seconds)\n", - "Cbc0010I After 4710000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (503.86 seconds)\n", - "Cbc0010I After 4711000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (503.98 seconds)\n", - "Cbc0010I After 4712000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (504.11 seconds)\n", - "Cbc0010I After 4713000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (504.23 seconds)\n", - "Cbc0010I After 4714000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (504.39 seconds)\n", - "Cbc0010I After 4715000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (504.54 seconds)\n", - "Cbc0010I After 4716000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (504.78 seconds)\n", - "Cbc0010I After 4717000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (504.97 seconds)\n", - "Cbc0010I After 4718000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (505.08 seconds)\n", - "Cbc0010I After 4719000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (505.26 seconds)\n", - "Cbc0010I After 4720000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (505.42 seconds)\n", - "Cbc0010I After 4721000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (506.07 seconds)\n", - "Cbc0010I After 4722000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (506.36 seconds)\n", - "Cbc0010I After 4723000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (506.58 seconds)\n", - "Cbc0010I After 4724000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (506.84 seconds)\n", - "Cbc0010I After 4725000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (507.05 seconds)\n", - "Cbc0010I After 4726000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (507.33 seconds)\n", - "Cbc0010I After 47 1e+50 best solution, best possible 0 (259.61 seconds)\n", - "Cbc0010I After 1690000 nodes, 230 on tree, 1e+50 best solution, best possible 0 (259.71 seconds)\n", - "Cbc0010I After 1691000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (259.84 seconds)\n", - "Cbc0010I After 1692000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (259.94 seconds)\n", - "Cbc0010I After 1693000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (260.08 seconds)\n", - "Cbc0010I After 1694000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (260.20 seconds)\n", - "Cbc0010I After 1695000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (260.32 seconds)\n", - "Cbc0010I After 1696000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (260.42 seconds)\n", - "Cbc0010I After 1697000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (260.52 seconds)\n", - "Cbc0010I After 1698000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (260.65 seconds)\n", - "Cbc0010I After 1699000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (260.79 seconds)\n", - "Cbc0010I After 1700000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (260.90 seconds)\n", - "Cbc0010I After 1701000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (261.01 seconds)\n", - "Cbc0010I After 1702000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (261.17 seconds)\n", - "Cbc0010I After 1703000 nodes, 207 on tree, 1e+50 best solution, best possible 0 (261.29 seconds)\n", - "Cbc0010I After 1704000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (261.46 seconds)\n", - "Cbc0010I After 1705000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (261.62 seconds)\n", - "Cbc0010I After 1706000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (261.78 seconds)\n", - "Cbc0010I After 1707000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (261.97 seconds)\n", - "Cbc0010I After 1708000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (262.11 seconds)\n", - "Cbc0010I After 1709000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (262.34 seconds)\n", - "Cbc0010I After 1710000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (262.45 seconds)\n", - "Cbc0010I After 1711000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (262.64 seconds)\n", - "Cbc0010I After 1712000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (262.83 seconds)\n", - "Cbc0010I After 1713000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (262.97 seconds)\n", - "Cbc0010I After 1714000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (263.10 seconds)\n", - "Cbc0010I After 1715000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (263.25 seconds)\n", - "Cbc0010I After 1716000 nodes, 221 on tree, 1e+50 best solution, best possible 0 (263.44 seconds)\n", - "Cbc0010I After 1717000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (263.62 seconds)\n", - "Cbc0010I After 1718000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (263.76 seconds)\n", - "Cbc0010I After 1719000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (263.94 seconds)\n", - "Cbc0010I After 1720000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (264.10 seconds)\n", - "Cbc0010I After 1721000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (264.40 seconds)\n", - "Cbc0010I After 1722000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (264.63 seconds)\n", - "Cbc0010I After 1723000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (264.81 seconds)\n", - "Cbc0010I After 1724000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (264.96 seconds)\n", - "Cbc0010I After 1725000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (265.30 seconds)\n", - "Cbc0010I After 1726000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (265.71 seconds)\n", - "Cbc0010I After 1727000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (266.08 seconds)\n", - "Cbc0010I After 1728000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (266.33 seconds)\n", - "Cbc0010I After 1729000 nodes, 227 on tree, 1e+50 best solution, best possible 0 (266.69 seconds)\n", - "Cbc0010I After 1730000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (267.06 seconds)\n", - "Cbc0010I After 1731000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (27000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (507.53 seconds)\n", - "Cbc0010I After 4728000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (507.76 seconds)\n", - "Cbc0010I After 4729000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (507.98 seconds)\n", - "Cbc0010I After 4730000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (508.16 seconds)\n", - "Cbc0010I After 4731000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (508.31 seconds)\n", - "Cbc0010I After 4732000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (508.45 seconds)\n", - "Cbc0010I After 4733000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (508.60 seconds)\n", - "Cbc0010I After 4734000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (508.77 seconds)\n", - "Cbc0010I After 4735000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (508.94 seconds)\n", - "Cbc0010I After 4736000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (509.06 seconds)\n", - "Cbc0010I After 4737000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (509.19 seconds)\n", - "Cbc0010I After 4738000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (509.35 seconds)\n", - "Cbc0010I After 4739000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (509.47 seconds)\n", - "Cbc0010I After 4740000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (509.59 seconds)\n", - "Cbc0010I After 4741000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (509.74 seconds)\n", - "Cbc0010I After 4742000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (509.96 seconds)\n", - "Cbc0010I After 4743000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (510.20 seconds)\n", - "Cbc0010I After 4744000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (510.35 seconds)\n", - "Cbc0010I After 4745000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (510.48 seconds)\n", - "Cbc0010I After 4746000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (510.68 seconds)\n", - "Cbc0010I After 4747000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (510.90 seconds)\n", - "Cbc0010I After 4748000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (511.08 seconds)\n", - "Cbc0010I After 4749000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (511.19 seconds)\n", - "Cbc0010I After 4750000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (511.29 seconds)\n", - "Cbc0010I After 4751000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (511.42 seconds)\n", - "Cbc0010I After 4752000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (511.58 seconds)\n", - "Cbc0010I After 4753000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (512.40 seconds)\n", - "Cbc0010I After 4754000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (512.52 seconds)\n", - "Cbc0010I After 4755000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (512.65 seconds)\n", - "Cbc0010I After 4756000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (512.76 seconds)\n", - "Cbc0010I After 4757000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (512.86 seconds)\n", - "Cbc0010I After 4758000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (512.98 seconds)\n", - "Cbc0010I After 4759000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (513.12 seconds)\n", - "Cbc0010I After 4760000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (513.24 seconds)\n", - "Cbc0010I After 4761000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (513.34 seconds)\n", - "Cbc0010I After 4762000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (513.50 seconds)\n", - "Cbc0010I After 4763000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (513.61 seconds)\n", - "Cbc0010I After 4764000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (513.72 seconds)\n", - "Cbc0010I After 4765000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (513.83 seconds)\n", - "Cbc0010I After 4766000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (513.93 seconds)\n", - "Cbc0010I After 4767000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (514.05 seconds)\n", - "Cbc0010I After 4768000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (514.19 seconds)\n", - "Cbc0010I After 4769000 nodes, 158 on tree,267.44 seconds)\n", - "Cbc0010I After 1732000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (267.68 seconds)\n", - "Cbc0010I After 1733000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (267.90 seconds)\n", - "Cbc0010I After 1734000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (268.08 seconds)\n", - "Cbc0010I After 1735000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (268.32 seconds)\n", - "Cbc0010I After 1736000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (268.54 seconds)\n", - "Cbc0010I After 1737000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (268.73 seconds)\n", - "Cbc0010I After 1738000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (268.87 seconds)\n", - "Cbc0010I After 1739000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (269.03 seconds)\n", - "Cbc0010I After 1740000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (269.19 seconds)\n", - "Cbc0010I After 1741000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (269.35 seconds)\n", - "Cbc0010I After 1742000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (269.59 seconds)\n", - "Cbc0010I After 1743000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (269.85 seconds)\n", - "Cbc0010I After 1744000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (270.04 seconds)\n", - "Cbc0010I After 1745000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (270.30 seconds)\n", - "Cbc0010I After 1746000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (270.51 seconds)\n", - "Cbc0010I After 1747000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (270.68 seconds)\n", - "Cbc0010I After 1748000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (270.85 seconds)\n", - "Cbc0010I After 1749000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (271.07 seconds)\n", - "Cbc0010I After 1750000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (271.19 seconds)\n", - "Cbc0010I After 1751000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (271.32 seconds)\n", - "Cbc0010I After 1752000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (271.44 seconds)\n", - "Cbc0010I After 1753000 nodes, 224 on tree, 1e+50 best solution, best possible 0 (271.59 seconds)\n", - "Cbc0010I After 1754000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (271.78 seconds)\n", - "Cbc0010I After 1755000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (272.00 seconds)\n", - "Cbc0010I After 1756000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (272.17 seconds)\n", - "Cbc0010I After 1757000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (272.36 seconds)\n", - "Cbc0010I After 1758000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (272.54 seconds)\n", - "Cbc0010I After 1759000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (272.71 seconds)\n", - "Cbc0010I After 1760000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (272.84 seconds)\n", - "Cbc0010I After 1761000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (273.07 seconds)\n", - "Cbc0010I After 1762000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (273.23 seconds)\n", - "Cbc0010I After 1763000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (273.42 seconds)\n", - "Cbc0010I After 1764000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (273.54 seconds)\n", - "Cbc0010I After 1765000 nodes, 240 on tree, 1e+50 best solution, best possible 0 (273.68 seconds)\n", - "Cbc0010I After 1766000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (273.91 seconds)\n", - "Cbc0010I After 1767000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (274.17 seconds)\n", - "Cbc0010I After 1768000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (274.37 seconds)\n", - "Cbc0010I After 1769000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (274.55 seconds)\n", - "Cbc0010I After 1770000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (274.78 seconds)\n", - "Cbc0010I After 1771000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (274.93 seconds)\n", - "Cbc0010I After 1772000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (275.12 seconds)\n", - "Cbc0010I After 1773000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (275.26 seconds)\n", - "Cbc0010I After 1774000 1e+50 best solution, best possible 0 (514.37 seconds)\n", - "Cbc0010I After 4770000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (514.56 seconds)\n", - "Cbc0010I After 4771000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (514.67 seconds)\n", - "Cbc0010I After 4772000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (514.80 seconds)\n", - "Cbc0010I After 4773000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (514.95 seconds)\n", - "Cbc0010I After 4774000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (515.13 seconds)\n", - "Cbc0010I After 4775000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (515.25 seconds)\n", - "Cbc0010I After 4776000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (515.39 seconds)\n", - "Cbc0010I After 4777000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (515.51 seconds)\n", - "Cbc0010I After 4778000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (515.64 seconds)\n", - "Cbc0010I After 4779000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (515.78 seconds)\n", - "Cbc0010I After 4780000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (515.92 seconds)\n", - "Cbc0010I After 4781000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (516.13 seconds)\n", - "Cbc0010I After 4782000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (516.26 seconds)\n", - "Cbc0010I After 4783000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (516.36 seconds)\n", - "Cbc0010I After 4784000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (516.55 seconds)\n", - "Cbc0010I After 4785000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (516.69 seconds)\n", - "Cbc0010I After 4786000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (516.86 seconds)\n", - "Cbc0010I After 4787000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (517.07 seconds)\n", - "Cbc0010I After 4788000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (517.28 seconds)\n", - "Cbc0010I After 4789000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (517.49 seconds)\n", - "Cbc0010I After 4790000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (517.76 seconds)\n", - "Cbc0010I After 4791000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (517.99 seconds)\n", - "Cbc0010I After 4792000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (518.20 seconds)\n", - "Cbc0010I After 4793000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (518.39 seconds)\n", - "Cbc0010I After 4794000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (518.66 seconds)\n", - "Cbc0010I After 4795000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (518.81 seconds)\n", - "Cbc0010I After 4796000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (519.02 seconds)\n", - "Cbc0010I After 4797000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (519.33 seconds)\n", - "Cbc0010I After 4798000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (519.52 seconds)\n", - "Cbc0010I After 4799000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (519.75 seconds)\n", - "Cbc0010I After 4800000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (519.83 seconds)\n", - "Cbc0010I After 4801000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (519.89 seconds)\n", - "Cbc0010I After 4802000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (520.00 seconds)\n", - "Cbc0010I After 4803000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (520.12 seconds)\n", - "Cbc0010I After 4804000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (520.30 seconds)\n", - "Cbc0010I After 4805000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (520.38 seconds)\n", - "Cbc0010I After 4806000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (520.56 seconds)\n", - "Cbc0010I After 4807000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (520.71 seconds)\n", - "Cbc0010I After 4808000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (520.80 seconds)\n", - "Cbc0010I After 4809000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (520.91 seconds)\n", - "Cbc0010I After 4810000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (520.97 seconds)\n", - "Cbc0010I After 4811000 nodes, 130 on tree, 1e+50 best solution, besnodes, 66 on tree, 1e+50 best solution, best possible 0 (275.43 seconds)\n", - "Cbc0010I After 1775000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (275.67 seconds)\n", - "Cbc0010I After 1776000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (275.85 seconds)\n", - "Cbc0010I After 1777000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (276.07 seconds)\n", - "Cbc0010I After 1778000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (276.32 seconds)\n", - "Cbc0010I After 1779000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (276.60 seconds)\n", - "Cbc0010I After 1780000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (276.88 seconds)\n", - "Cbc0010I After 1781000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (277.20 seconds)\n", - "Cbc0010I After 1782000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (277.56 seconds)\n", - "Cbc0010I After 1783000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (277.92 seconds)\n", - "Cbc0010I After 1784000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (278.25 seconds)\n", - "Cbc0010I After 1785000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (278.57 seconds)\n", - "Cbc0010I After 1786000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (278.84 seconds)\n", - "Cbc0010I After 1787000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (279.01 seconds)\n", - "Cbc0010I After 1788000 nodes, 216 on tree, 1e+50 best solution, best possible 0 (279.14 seconds)\n", - "Cbc0010I After 1789000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (279.32 seconds)\n", - "Cbc0010I After 1790000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (279.45 seconds)\n", - "Cbc0010I After 1791000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (279.58 seconds)\n", - "Cbc0010I After 1792000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (279.76 seconds)\n", - "Cbc0010I After 1793000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (279.91 seconds)\n", - "Cbc0010I After 1794000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (280.07 seconds)\n", - "Cbc0010I After 1795000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (280.23 seconds)\n", - "Cbc0010I After 1796000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (280.39 seconds)\n", - "Cbc0010I After 1797000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (280.49 seconds)\n", - "Cbc0010I After 1798000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (280.56 seconds)\n", - "Cbc0010I After 1799000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (280.65 seconds)\n", - "Cbc0010I After 1800000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (280.72 seconds)\n", - "Cbc0010I After 1801000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (280.80 seconds)\n", - "Cbc0010I After 1802000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (280.88 seconds)\n", - "Cbc0010I After 1803000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (280.97 seconds)\n", - "Cbc0010I After 1804000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (281.07 seconds)\n", - "Cbc0010I After 1805000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (281.18 seconds)\n", - "Cbc0010I After 1806000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (281.33 seconds)\n", - "Cbc0010I After 1807000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (281.45 seconds)\n", - "Cbc0010I After 1808000 nodes, 196 on tree, 1e+50 best solution, best possible 0 (281.65 seconds)\n", - "Cbc0010I After 1809000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (281.85 seconds)\n", - "Cbc0010I After 1810000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (282.00 seconds)\n", - "Cbc0010I After 1811000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (282.20 seconds)\n", - "Cbc0010I After 1812000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (282.39 seconds)\n", - "Cbc0010I After 1813000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (282.56 seconds)\n", - "Cbc0010I After 1814000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (282.72 seconds)\n", - "Cbc0010I After 1815000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (282.89 seconds)\n", - "Cbc0010I After 1816000 nodes, 87 on tree, 1e+50 best solution, best pt possible 0 (521.03 seconds)\n", - "Cbc0010I After 4812000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (521.08 seconds)\n", - "Cbc0010I After 4813000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (521.17 seconds)\n", - "Cbc0010I After 4814000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (521.22 seconds)\n", - "Cbc0010I After 4815000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (521.29 seconds)\n", - "Cbc0010I After 4816000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (521.35 seconds)\n", - "Cbc0010I After 4817000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (521.42 seconds)\n", - "Cbc0010I After 4818000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (521.49 seconds)\n", - "Cbc0010I After 4819000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (521.59 seconds)\n", - "Cbc0010I After 4820000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (521.72 seconds)\n", - "Cbc0010I After 4821000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (521.82 seconds)\n", - "Cbc0010I After 4822000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (521.92 seconds)\n", - "Cbc0010I After 4823000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (522.12 seconds)\n", - "Cbc0010I After 4824000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (522.27 seconds)\n", - "Cbc0010I After 4825000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (522.38 seconds)\n", - "Cbc0010I After 4826000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (522.53 seconds)\n", - "Cbc0010I After 4827000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (522.68 seconds)\n", - "Cbc0010I After 4828000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (522.81 seconds)\n", - "Cbc0010I After 4829000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (522.91 seconds)\n", - "Cbc0010I After 4830000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (523.06 seconds)\n", - "Cbc0010I After 4831000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (523.19 seconds)\n", - "Cbc0010I After 4832000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (523.30 seconds)\n", - "Cbc0010I After 4833000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (523.38 seconds)\n", - "Cbc0010I After 4834000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (523.57 seconds)\n", - "Cbc0010I After 4835000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (523.70 seconds)\n", - "Cbc0010I After 4836000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (523.86 seconds)\n", - "Cbc0010I After 4837000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (524.05 seconds)\n", - "Cbc0010I After 4838000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (524.27 seconds)\n", - "Cbc0010I After 4839000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (524.44 seconds)\n", - "Cbc0010I After 4840000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (524.61 seconds)\n", - "Cbc0010I After 4841000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (524.87 seconds)\n", - "Cbc0010I After 4842000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (525.04 seconds)\n", - "Cbc0010I After 4843000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (525.21 seconds)\n", - "Cbc0010I After 4844000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (525.35 seconds)\n", - "Cbc0010I After 4845000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (525.50 seconds)\n", - "Cbc0010I After 4846000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (525.61 seconds)\n", - "Cbc0010I After 4847000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (525.73 seconds)\n", - "Cbc0010I After 4848000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (525.91 seconds)\n", - "Cbc0010I After 4849000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (526.02 seconds)\n", - "Cbc0010I After 4850000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (526.10 seconds)\n", - "Cbc0010I After 4851000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (526.36 seconds)\n", - "Cbc0010I After 4852000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (526.70 seconds)\n", - "Cbc0010I After 4853000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (526.88 seconds)ossible 0 (283.05 seconds)\n", - "Cbc0010I After 1817000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (283.29 seconds)\n", - "Cbc0010I After 1818000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (283.49 seconds)\n", - "Cbc0010I After 1819000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (283.80 seconds)\n", - "Cbc0010I After 1820000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (284.01 seconds)\n", - "Cbc0010I After 1821000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (284.35 seconds)\n", - "Cbc0010I After 1822000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (284.65 seconds)\n", - "Cbc0010I After 1823000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (284.93 seconds)\n", - "Cbc0010I After 1824000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (285.21 seconds)\n", - "Cbc0010I After 1825000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (285.44 seconds)\n", - "Cbc0010I After 1826000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (285.67 seconds)\n", - "Cbc0010I After 1827000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (286.07 seconds)\n", - "Cbc0010I After 1828000 nodes, 212 on tree, 1e+50 best solution, best possible 0 (286.36 seconds)\n", - "Cbc0010I After 1829000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (286.56 seconds)\n", - "Cbc0010I After 1830000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (286.78 seconds)\n", - "Cbc0010I After 1831000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (287.01 seconds)\n", - "Cbc0010I After 1832000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (287.27 seconds)\n", - "Cbc0010I After 1833000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (287.47 seconds)\n", - "Cbc0010I After 1834000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (287.66 seconds)\n", - "Cbc0010I After 1835000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (287.79 seconds)\n", - "Cbc0010I After 1836000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (287.92 seconds)\n", - "Cbc0010I After 1837000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (288.05 seconds)\n", - "Cbc0010I After 1838000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (288.19 seconds)\n", - "Cbc0010I After 1839000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (288.34 seconds)\n", - "Cbc0010I After 1840000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (288.45 seconds)\n", - "Cbc0010I After 1841000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (288.60 seconds)\n", - "Cbc0010I After 1842000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (288.73 seconds)\n", - "Cbc0010I After 1843000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (288.84 seconds)\n", - "Cbc0010I After 1844000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (288.95 seconds)\n", - "Cbc0010I After 1845000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (289.04 seconds)\n", - "Cbc0010I After 1846000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (289.13 seconds)\n", - "Cbc0010I After 1847000 nodes, 202 on tree, 1e+50 best solution, best possible 0 (289.25 seconds)\n", - "Cbc0010I After 1848000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (289.43 seconds)\n", - "Cbc0010I After 1849000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (289.60 seconds)\n", - "Cbc0010I After 1850000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (289.75 seconds)\n", - "Cbc0010I After 1851000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (289.89 seconds)\n", - "Cbc0010I After 1852000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (290.05 seconds)\n", - "Cbc0010I After 1853000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (290.18 seconds)\n", - "Cbc0010I After 1854000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (290.31 seconds)\n", - "Cbc0010I After 1855000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (290.42 seconds)\n", - "Cbc0010I After 1856000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (290.54 seconds)\n", - "Cbc0010I After 1857000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (290.67 seconds)\n", - "Cbc0010I After 1858000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (290.77 seconds)\n", - "Cbc0010I \n", - "Cbc0010I After 4854000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (527.06 seconds)\n", - "Cbc0010I After 4855000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (527.19 seconds)\n", - "Cbc0010I After 4856000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (527.37 seconds)\n", - "Cbc0010I After 4857000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (527.54 seconds)\n", - "Cbc0010I After 4858000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (527.73 seconds)\n", - "Cbc0010I After 4859000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (527.88 seconds)\n", - "Cbc0010I After 4860000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (527.98 seconds)\n", - "Cbc0010I After 4861000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.09 seconds)\n", - "Cbc0010I After 4862000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.23 seconds)\n", - "Cbc0010I After 4863000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (528.37 seconds)\n", - "Cbc0010I After 4864000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (528.50 seconds)\n", - "Cbc0010I After 4865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (528.67 seconds)\n", - "Cbc0010I After 4866000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (528.78 seconds)\n", - "Cbc0010I After 4867000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (528.86 seconds)\n", - "Cbc0010I After 4868000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (528.93 seconds)\n", - "Cbc0010I After 4869000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (529.03 seconds)\n", - "Cbc0010I After 4870000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (529.13 seconds)\n", - "Cbc0010I After 4871000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (529.22 seconds)\n", - "Cbc0010I After 4872000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (529.33 seconds)\n", - "Cbc0010I After 4873000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (529.46 seconds)\n", - "Cbc0010I After 4874000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (529.59 seconds)\n", - "Cbc0010I After 4875000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (529.65 seconds)\n", - "Cbc0010I After 4876000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (529.74 seconds)\n", - "Cbc0010I After 4877000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (529.85 seconds)\n", - "Cbc0010I After 4878000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (529.93 seconds)\n", - "Cbc0010I After 4879000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (530.05 seconds)\n", - "Cbc0010I After 4880000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (530.12 seconds)\n", - "Cbc0010I After 4881000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (530.22 seconds)\n", - "Cbc0010I After 4882000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (530.28 seconds)\n", - "Cbc0010I After 4883000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (530.35 seconds)\n", - "Cbc0010I After 4884000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (530.48 seconds)\n", - "Cbc0010I After 4885000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (530.57 seconds)\n", - "Cbc0010I After 4886000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (530.65 seconds)\n", - "Cbc0010I After 4887000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (530.74 seconds)\n", - "Cbc0010I After 4888000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (530.82 seconds)\n", - "Cbc0010I After 4889000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (530.88 seconds)\n", - "Cbc0010I After 4890000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (530.93 seconds)\n", - "Cbc0010I After 4891000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (531.03 seconds)\n", - "Cbc0010I After 4892000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (531.14 seconds)\n", - "Cbc0010I After 4893000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (531.23 seconds)\n", - "Cbc0010I After 4894000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (531.32 seconds)\n", - "Cbc0010I After 4895000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (531.38 seconds)\n", - "Cbc0010I After 4896000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (531.44 seconds)\n", - "Cbc0010I After 4897000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (531.51 seconds)\n", - "Cbc0010I After 4898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (531.63 seconds)\n", - "Cbc0010I After 4899000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (531.74 seconds)\n", - "Cbc0010I After 4900000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (531.83 seconds)\n", - "Cbc0010I After 4901000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (531.93 seconds)\n", - "Cbc0010I After 4902000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (532.00 seconds)\n", - "Cbc0010I After 4903000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (532.07 seconds)\n", - "Cbc0010I After 4904000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (532.17 seconds)\n", - "Cbc0010I After 4905000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (532.27 seconds)\n", - "Cbc0010I After 4906000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (532.37 seconds)\n", - "Cbc0010I After 4907000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (532.44 seconds)\n", - "Cbc0010I After 4908000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (532.51 seconds)\n", - "Cbc0010I After 4909000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (532.59 seconds)\n", - "Cbc0010I After 4910000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (532.67 seconds)\n", - "Cbc0010I After 4911000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (532.76 seconds)\n", - "Cbc0010I After 4912000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (532.86 seconds)\n", - "Cbc0010I After 4913000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (532.93 seconds)\n", - "Cbc0010I After 4914000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (532.99 seconds)\n", - "Cbc0010I After 4915000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (533.04 seconds)\n", - "Cbc0010I After 4916000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (533.11 seconds)\n", - "Cbc0010I After 4917000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (533.20 seconds)\n", - "Cbc0010I After 4918000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (533.30 seconds)\n", - "Cbc0010I After 4919000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (533.40 seconds)\n", - "Cbc0010I After 4920000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (533.53 seconds)\n", - "Cbc0010I After 4921000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (533.60 seconds)\n", - "Cbc0010I After 4922000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (533.66 seconds)\n", - "Cbc0010I After 4923000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (533.77 seconds)\n", - "Cbc0010I After 4924000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (533.84 seconds)\n", - "Cbc0010I After 4925000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (533.95 seconds)\n", - "Cbc0010I After 4926000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (534.05 seconds)\n", - "Cbc0010I After 4927000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (534.18 seconds)\n", - "Cbc0010I After 4928000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (534.30 seconds)\n", - "Cbc0010I After 4929000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (534.51 seconds)\n", - "Cbc0010I After 4930000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (534.64 seconds)\n", - "Cbc0010I After 4931000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (534.72 seconds)\n", - "Cbc0010I After 4932000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (534.81 seconds)\n", - "Cbc0010I After 4933000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (534.93 seconds)\n", - "Cbc0010I After 4934000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (535.04 seconds)\n", - "Cbc0010I After 4935000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (535.16 seconds)\n", - "Cbc0010I After 4936000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (535.27 seconds)\n", - "Cbc0010I After 4937000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (535.36 seconds)\n", - "Cbc0010I After 4938000 nodes, 161 on tree, 1e+50 bestAfter 1859000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (290.86 seconds)\n", - "Cbc0010I After 1860000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (290.96 seconds)\n", - "Cbc0010I After 1861000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (291.09 seconds)\n", - "Cbc0010I After 1862000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (291.21 seconds)\n", - "Cbc0010I After 1863000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (291.31 seconds)\n", - "Cbc0010I After 1864000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (291.41 seconds)\n", - "Cbc0010I After 1865000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (291.51 seconds)\n", - "Cbc0010I After 1866000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (291.61 seconds)\n", - "Cbc0010I After 1867000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (291.72 seconds)\n", - "Cbc0010I After 1868000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (291.81 seconds)\n", - "Cbc0010I After 1869000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (291.92 seconds)\n", - "Cbc0010I After 1870000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (292.00 seconds)\n", - "Cbc0010I After 1871000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (292.14 seconds)\n", - "Cbc0010I After 1872000 nodes, 199 on tree, 1e+50 best solution, best possible 0 (292.24 seconds)\n", - "Cbc0010I After 1873000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (292.36 seconds)\n", - "Cbc0010I After 1874000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (292.47 seconds)\n", - "Cbc0010I After 1875000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (292.57 seconds)\n", - "Cbc0010I After 1876000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (292.69 seconds)\n", - "Cbc0010I After 1877000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (292.83 seconds)\n", - "Cbc0010I After 1878000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (292.95 seconds)\n", - "Cbc0010I After 1879000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (293.08 seconds)\n", - "Cbc0010I After 1880000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (293.18 seconds)\n", - "Cbc0010I After 1881000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (293.33 seconds)\n", - "Cbc0010I After 1882000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (293.48 seconds)\n", - "Cbc0010I After 1883000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (293.63 seconds)\n", - "Cbc0010I After 1884000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (293.78 seconds)\n", - "Cbc0010I After 1885000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (294.04 seconds)\n", - "Cbc0010I After 1886000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (294.22 seconds)\n", - "Cbc0010I After 1887000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (294.36 seconds)\n", - "Cbc0010I After 1888000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (294.49 seconds)\n", - "Cbc0010I After 1889000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (294.64 seconds)\n", - "Cbc0010I After 1890000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (294.73 seconds)\n", - "Cbc0010I After 1891000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (294.88 seconds)\n", - "Cbc0010I After 1892000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (295.01 seconds)\n", - "Cbc0010I After 1893000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (295.14 seconds)\n", - "Cbc0010I After 1894000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (295.31 seconds)\n", - "Cbc0010I After 1895000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (295.48 seconds)\n", - "Cbc0010I After 1896000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (295.66 seconds)\n", - "Cbc0010I After 1897000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (295.80 seconds)\n", - "Cbc0010I After 1898000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (295.94 seconds)\n", - "Cbc0010I After 1899000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (296.11 seconds)\n", - "Cbc0010I After 1900000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (296.28 seconds)\n", - "Cbc0010I After 1901000 nodes, 77 on tree, 1e solution, best possible 0 (535.48 seconds)\n", - "Cbc0010I After 4939000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (535.59 seconds)\n", - "Cbc0010I After 4940000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (535.71 seconds)\n", - "Cbc0010I After 4941000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (535.85 seconds)\n", - "Cbc0010I After 4942000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (535.98 seconds)\n", - "Cbc0010I After 4943000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (536.17 seconds)\n", - "Cbc0010I After 4944000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (536.31 seconds)\n", - "Cbc0010I After 4945000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (536.40 seconds)\n", - "Cbc0010I After 4946000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (536.53 seconds)\n", - "Cbc0010I After 4947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (536.68 seconds)\n", - "Cbc0010I After 4948000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (536.79 seconds)\n", - "Cbc0010I After 4949000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (536.89 seconds)\n", - "Cbc0010I After 4950000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (536.97 seconds)\n", - "Cbc0010I After 4951000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (537.16 seconds)\n", - "Cbc0010I After 4952000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (537.28 seconds)\n", - "Cbc0010I After 4953000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (537.39 seconds)\n", - "Cbc0010I After 4954000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (537.52 seconds)\n", - "Cbc0010I After 4955000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (537.69 seconds)\n", - "Cbc0010I After 4956000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (537.84 seconds)\n", - "Cbc0010I After 4957000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (537.92 seconds)\n", - "Cbc0010I After 4958000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (538.03 seconds)\n", - "Cbc0010I After 4959000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (538.15 seconds)\n", - "Cbc0010I After 4960000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (538.28 seconds)\n", - "Cbc0010I After 4961000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (538.35 seconds)\n", - "Cbc0010I After 4962000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (538.44 seconds)\n", - "Cbc0010I After 4963000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (538.51 seconds)\n", - "Cbc0010I After 4964000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (538.57 seconds)\n", - "Cbc0010I After 4965000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (538.65 seconds)\n", - "Cbc0010I After 4966000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (538.77 seconds)\n", - "Cbc0010I After 4967000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (538.89 seconds)\n", - "Cbc0010I After 4968000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (539.03 seconds)\n", - "Cbc0010I After 4969000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (539.12 seconds)\n", - "Cbc0010I After 4970000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (539.19 seconds)\n", - "Cbc0010I After 4971000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (539.26 seconds)\n", - "Cbc0010I After 4972000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (539.35 seconds)\n", - "Cbc0010I After 4973000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (539.46 seconds)\n", - "Cbc0010I After 4974000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (539.53 seconds)\n", - "Cbc0010I After 4975000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (539.60 seconds)\n", - "Cbc0010I After 4976000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (539.67 seconds)\n", - "Cbc0010I After 4977000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (539.76 seconds)\n", - "Cbc0010I After 4978000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (539.82 seconds)\n", - "Cbc0010I After 4979000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (539.89 seconds)\n", - "Cbc0010I After 4980000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (+50 best solution, best possible 0 (296.49 seconds)\n", - "Cbc0010I After 1902000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (296.62 seconds)\n", - "Cbc0010I After 1903000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (296.82 seconds)\n", - "Cbc0010I After 1904000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (296.99 seconds)\n", - "Cbc0010I After 1905000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (297.16 seconds)\n", - "Cbc0010I After 1906000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (297.31 seconds)\n", - "Cbc0010I After 1907000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (297.48 seconds)\n", - "Cbc0010I After 1908000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (297.67 seconds)\n", - "Cbc0010I After 1909000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (297.81 seconds)\n", - "Cbc0010I After 1910000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (297.92 seconds)\n", - "Cbc0010I After 1911000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (298.03 seconds)\n", - "Cbc0010I After 1912000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (298.13 seconds)\n", - "Cbc0010I After 1913000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (298.24 seconds)\n", - "Cbc0010I After 1914000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (298.33 seconds)\n", - "Cbc0010I After 1915000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (298.42 seconds)\n", - "Cbc0010I After 1916000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (298.51 seconds)\n", - "Cbc0010I After 1917000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (298.62 seconds)\n", - "Cbc0010I After 1918000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (298.74 seconds)\n", - "Cbc0010I After 1919000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (298.83 seconds)\n", - "Cbc0010I After 1920000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (298.95 seconds)\n", - "Cbc0010I After 1921000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (299.05 seconds)\n", - "Cbc0010I After 1922000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (299.17 seconds)\n", - "Cbc0010I After 1923000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (299.31 seconds)\n", - "Cbc0010I After 1924000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (299.44 seconds)\n", - "Cbc0010I After 1925000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (299.57 seconds)\n", - "Cbc0010I After 1926000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (299.76 seconds)\n", - "Cbc0010I After 1927000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (299.96 seconds)\n", - "Cbc0010I After 1928000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (300.16 seconds)\n", - "Cbc0010I After 1929000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (300.30 seconds)\n", - "Cbc0010I After 1930000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (300.41 seconds)\n", - "Cbc0010I After 1931000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (300.52 seconds)\n", - "Cbc0010I After 1932000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (300.58 seconds)\n", - "Cbc0010I After 1933000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (300.67 seconds)\n", - "Cbc0010I After 1934000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (300.75 seconds)\n", - "Cbc0010I After 1935000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (300.87 seconds)\n", - "Cbc0010I After 1936000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (300.98 seconds)\n", - "Cbc0010I After 1937000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (301.10 seconds)\n", - "Cbc0010I After 1938000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (301.20 seconds)\n", - "Cbc0010I After 1939000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (301.30 seconds)\n", - "Cbc0010I After 1940000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (301.40 seconds)\n", - "Cbc0010I After 1941000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (301.50 seconds)\n", - "Cbc0010I After 1942000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (301.59 seconds)\n", - "Cbc0010I After 1943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 539.99 seconds)\n", - "Cbc0010I After 4981000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (540.09 seconds)\n", - "Cbc0010I After 4982000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (540.20 seconds)\n", - "Cbc0010I After 4983000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (540.32 seconds)\n", - "Cbc0010I After 4984000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (540.42 seconds)\n", - "Cbc0010I After 4985000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (540.58 seconds)\n", - "Cbc0010I After 4986000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (540.70 seconds)\n", - "Cbc0010I After 4987000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (540.79 seconds)\n", - "Cbc0010I After 4988000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (540.83 seconds)\n", - "Cbc0010I After 4989000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (540.92 seconds)\n", - "Cbc0010I After 4990000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (540.99 seconds)\n", - "Cbc0010I After 4991000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (541.08 seconds)\n", - "Cbc0010I After 4992000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (541.15 seconds)\n", - "Cbc0010I After 4993000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (541.20 seconds)\n", - "Cbc0010I After 4994000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (541.27 seconds)\n", - "Cbc0010I After 4995000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (541.34 seconds)\n", - "Cbc0010I After 4996000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (541.49 seconds)\n", - "Cbc0010I After 4997000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (541.57 seconds)\n", - "Cbc0010I After 4998000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (541.66 seconds)\n", - "Cbc0010I After 4999000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (541.74 seconds)\n", - "Cbc0010I After 5000000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (541.80 seconds)\n", - "Cbc0010I After 5001000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (541.89 seconds)\n", - "Cbc0010I After 5002000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (541.95 seconds)\n", - "Cbc0010I After 5003000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (542.03 seconds)\n", - "Cbc0010I After 5004000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (542.09 seconds)\n", - "Cbc0010I After 5005000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (542.17 seconds)\n", - "Cbc0010I After 5006000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (542.25 seconds)\n", - "Cbc0010I After 5007000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (542.34 seconds)\n", - "Cbc0010I After 5008000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (542.42 seconds)\n", - "Cbc0010I After 5009000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.50 seconds)\n", - "Cbc0010I After 5010000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.60 seconds)\n", - "Cbc0010I After 5011000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (542.72 seconds)\n", - "Cbc0010I After 5012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (542.83 seconds)\n", - "Cbc0010I After 5013000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (542.93 seconds)\n", - "Cbc0010I After 5014000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (543.00 seconds)\n", - "Cbc0010I After 5015000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (543.10 seconds)\n", - "Cbc0010I After 5016000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (543.16 seconds)\n", - "Cbc0010I After 5017000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (543.22 seconds)\n", - "Cbc0010I After 5018000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (543.29 seconds)\n", - "Cbc0010I After 5019000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (543.34 seconds)\n", - "Cbc0010I After 5020000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (543.41 seconds)\n", - "Cbc0010I After 5021000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (543.52 seconds)\n", - "Cbc0010I After 5022000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (543.68 seconds)\n", - "Cbc0010I After(301.70 seconds)\n", - "Cbc0010I After 1944000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (301.81 seconds)\n", - "Cbc0010I After 1945000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (301.94 seconds)\n", - "Cbc0010I After 1946000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (302.05 seconds)\n", - "Cbc0010I After 1947000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (302.17 seconds)\n", - "Cbc0010I After 1948000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (302.30 seconds)\n", - "Cbc0010I After 1949000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (302.41 seconds)\n", - "Cbc0010I After 1950000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (302.52 seconds)\n", - "Cbc0010I After 1951000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (302.63 seconds)\n", - "Cbc0010I After 1952000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (302.72 seconds)\n", - "Cbc0010I After 1953000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (302.80 seconds)\n", - "Cbc0010I After 1954000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (302.89 seconds)\n", - "Cbc0010I After 1955000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (303.03 seconds)\n", - "Cbc0010I After 1956000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (303.19 seconds)\n", - "Cbc0010I After 1957000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (303.35 seconds)\n", - "Cbc0010I After 1958000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (303.50 seconds)\n", - "Cbc0010I After 1959000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (303.69 seconds)\n", - "Cbc0010I After 1960000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (303.82 seconds)\n", - "Cbc0010I After 1961000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (304.04 seconds)\n", - "Cbc0010I After 1962000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (304.31 seconds)\n", - "Cbc0010I After 1963000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (304.59 seconds)\n", - "Cbc0010I After 1964000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (304.94 seconds)\n", - "Cbc0010I After 1965000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (305.19 seconds)\n", - "Cbc0010I After 1966000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (305.41 seconds)\n", - "Cbc0010I After 1967000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (305.68 seconds)\n", - "Cbc0010I After 1968000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (305.94 seconds)\n", - "Cbc0010I After 1969000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (306.32 seconds)\n", - "Cbc0010I After 1970000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (306.62 seconds)\n", - "Cbc0010I After 1971000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (306.90 seconds)\n", - "Cbc0010I After 1972000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (307.21 seconds)\n", - "Cbc0010I After 1973000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (307.57 seconds)\n", - "Cbc0010I After 1974000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (307.87 seconds)\n", - "Cbc0010I After 1975000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (308.23 seconds)\n", - "Cbc0010I After 1976000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (308.48 seconds)\n", - "Cbc0010I After 1977000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (308.74 seconds)\n", - "Cbc0010I After 1978000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (309.08 seconds)\n", - "Cbc0010I After 1979000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (309.39 seconds)\n", - "Cbc0010I After 1980000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (309.72 seconds)\n", - "Cbc0010I After 1981000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (309.98 seconds)\n", - "Cbc0010I After 1982000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (310.29 seconds)\n", - "Cbc0010I After 1983000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (310.54 seconds)\n", - "Cbc0010I After 1984000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (310.82 seconds)\n", - "Cbc0010I After 1985000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (311.15 seconds)\n", - "Cbc0010I Af 5023000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (543.86 seconds)\n", - "Cbc0010I After 5024000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (543.98 seconds)\n", - "Cbc0010I After 5025000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (544.08 seconds)\n", - "Cbc0010I After 5026000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (544.22 seconds)\n", - "Cbc0010I After 5027000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (544.36 seconds)\n", - "Cbc0010I After 5028000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (544.53 seconds)\n", - "Cbc0010I After 5029000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (544.74 seconds)\n", - "Cbc0010I After 5030000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (545.00 seconds)\n", - "Cbc0010I After 5031000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (545.23 seconds)\n", - "Cbc0010I After 5032000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (545.49 seconds)\n", - "Cbc0010I After 5033000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (545.61 seconds)\n", - "Cbc0010I After 5034000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (545.76 seconds)\n", - "Cbc0010I After 5035000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (545.96 seconds)\n", - "Cbc0010I After 5036000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (546.17 seconds)\n", - "Cbc0010I After 5037000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (546.38 seconds)\n", - "Cbc0010I After 5038000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (546.73 seconds)\n", - "Cbc0010I After 5039000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (546.97 seconds)\n", - "Cbc0010I After 5040000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (547.23 seconds)\n", - "Cbc0010I After 5041000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (547.44 seconds)\n", - "Cbc0010I After 5042000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (547.62 seconds)\n", - "Cbc0010I After 5043000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (547.92 seconds)\n", - "Cbc0010I After 5044000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (548.25 seconds)\n", - "Cbc0010I After 5045000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (548.49 seconds)\n", - "Cbc0010I After 5046000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (548.73 seconds)\n", - "Cbc0010I After 5047000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (548.94 seconds)\n", - "Cbc0010I After 5048000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (549.16 seconds)\n", - "Cbc0010I After 5049000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (549.32 seconds)\n", - "Cbc0010I After 5050000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (549.55 seconds)\n", - "Cbc0010I After 5051000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (549.96 seconds)\n", - "Cbc0010I After 5052000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (550.18 seconds)\n", - "Cbc0010I After 5053000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (550.38 seconds)\n", - "Cbc0010I After 5054000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (550.59 seconds)\n", - "Cbc0010I After 5055000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (550.76 seconds)\n", - "Cbc0010I After 5056000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (550.91 seconds)\n", - "Cbc0010I After 5057000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (551.16 seconds)\n", - "Cbc0010I After 5058000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (551.47 seconds)\n", - "Cbc0010I After 5059000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (551.72 seconds)\n", - "Cbc0010I After 5060000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (552.24 seconds)\n", - "Cbc0010I After 5061000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (552.58 seconds)\n", - "Cbc0010I After 5062000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (552.75 seconds)\n", - "Cbc0010I After 5063000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (552.97 seconds)\n", - "Cbc0010I After 5064000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (553.13 seconds)\n", - "Cbc0010I After 5065000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (553.41 seconds)\n", - "Cbc0010I After 5066000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (553.57 seconds)\n", - "Cbc0010I After 5067000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (553.76 seconds)\n", - "Cbc0010I After 5068000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (553.97 seconds)\n", - "Cbc0010I After 5069000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (554.32 seconds)\n", - "Cbc0010I After 5070000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (554.61 seconds)\n", - "Cbc0010I After 5071000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (554.86 seconds)\n", - "Cbc0010I After 5072000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (555.17 seconds)\n", - "Cbc0010I After 5073000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (555.50 seconds)\n", - "Cbc0010I After 5074000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (555.64 seconds)\n", - "Cbc0010I After 5075000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (555.78 seconds)\n", - "Cbc0010I After 5076000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (555.90 seconds)\n", - "Cbc0010I After 5077000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (556.08 seconds)\n", - "Cbc0010I After 5078000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (556.21 seconds)\n", - "Cbc0010I After 5079000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (556.41 seconds)\n", - "Cbc0010I After 5080000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (556.51 seconds)\n", - "Cbc0010I After 5081000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (556.59 seconds)\n", - "Cbc0010I After 5082000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (556.71 seconds)\n", - "Cbc0010I After 5083000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (556.82 seconds)\n", - "Cbc0010I After 5084000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (556.89 seconds)\n", - "Cbc0010I After 5085000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (557.01 seconds)\n", - "Cbc0010I After 5086000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (557.15 seconds)\n", - "Cbc0010I After 5087000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (557.36 seconds)\n", - "Cbc0010I After 5088000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (557.50 seconds)\n", - "Cbc0010I After 5089000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (557.62 seconds)\n", - "Cbc0010I After 5090000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (557.85 seconds)\n", - "Cbc0010I After 5091000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (557.98 seconds)\n", - "Cbc0010I After 5092000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (558.12 seconds)\n", - "Cbc0010I After 5093000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (558.23 seconds)\n", - "Cbc0010I After 5094000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (558.34 seconds)\n", - "Cbc0010I After 5095000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (558.54 seconds)\n", - "Cbc0010I After 5096000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (558.66 seconds)\n", - "Cbc0010I After 5097000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (558.82 seconds)\n", - "Cbc0010I After 5098000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (558.93 seconds)\n", - "Cbc0010I After 5099000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (559.05 seconds)\n", - "Cbc0010I After 5100000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (559.16 seconds)\n", - "Cbc0010I After 5101000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (559.27 seconds)\n", - "Cbc0010I After 5102000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (559.38 seconds)\n", - "Cbc0010I After 5103000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (559.50 seconds)\n", - "Cbc0010I After 5104000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (559.59 seconds)\n", - "Cbc0010I After 5105000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (559.71 seconds)\n", - "Cbc0010I After 5106000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (559.83 seconds)\n", - "Cbc0010I After 5107000 nodes, 123 on tree, 1e+50 best solution, best pter 1986000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (311.48 seconds)\n", - "Cbc0010I After 1987000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (311.83 seconds)\n", - "Cbc0010I After 1988000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (312.16 seconds)\n", - "Cbc0010I After 1989000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (312.51 seconds)\n", - "Cbc0010I After 1990000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (312.75 seconds)\n", - "Cbc0010I After 1991000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (313.06 seconds)\n", - "Cbc0010I After 1992000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (313.28 seconds)\n", - "Cbc0010I After 1993000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (313.50 seconds)\n", - "Cbc0010I After 1994000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (313.75 seconds)\n", - "Cbc0010I After 1995000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (314.00 seconds)\n", - "Cbc0010I After 1996000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (314.21 seconds)\n", - "Cbc0010I After 1997000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (314.39 seconds)\n", - "Cbc0010I After 1998000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (314.68 seconds)\n", - "Cbc0010I After 1999000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (314.94 seconds)\n", - "Cbc0010I After 2000000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (315.14 seconds)\n", - "Cbc0010I After 2001000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (315.42 seconds)\n", - "Cbc0010I After 2002000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (315.64 seconds)\n", - "Cbc0010I After 2003000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (315.82 seconds)\n", - "Cbc0010I After 2004000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (316.02 seconds)\n", - "Cbc0010I After 2005000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (316.14 seconds)\n", - "Cbc0010I After 2006000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (316.27 seconds)\n", - "Cbc0010I After 2007000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (316.45 seconds)\n", - "Cbc0010I After 2008000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (316.62 seconds)\n", - "Cbc0010I After 2009000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (316.78 seconds)\n", - "Cbc0010I After 2010000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (317.01 seconds)\n", - "Cbc0010I After 2011000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (317.22 seconds)\n", - "Cbc0010I After 2012000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (317.50 seconds)\n", - "Cbc0010I After 2013000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (317.72 seconds)\n", - "Cbc0010I After 2014000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (317.85 seconds)\n", - "Cbc0010I After 2015000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (318.04 seconds)\n", - "Cbc0010I After 2016000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (318.21 seconds)\n", - "Cbc0010I After 2017000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (318.45 seconds)\n", - "Cbc0010I After 2018000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (318.69 seconds)\n", - "Cbc0010I After 2019000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (318.90 seconds)\n", - "Cbc0010I After 2020000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (319.08 seconds)\n", - "Cbc0010I After 2021000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (319.22 seconds)\n", - "Cbc0010I After 2022000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (319.40 seconds)\n", - "Cbc0010I After 2023000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (319.57 seconds)\n", - "Cbc0010I After 2024000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (319.75 seconds)\n", - "Cbc0010I After 2025000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (319.90 seconds)\n", - "Cbc0010I After 2026000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (320.03 seconds)\n", - "Cbc0010I After 2027000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (320.17 seconds)\n", - "Cbc0010I After 2028000 nodes, 78 on tree, 1e+50 best solossible 0 (559.96 seconds)\n", - "Cbc0010I After 5108000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (560.10 seconds)\n", - "Cbc0010I After 5109000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (560.23 seconds)\n", - "Cbc0010I After 5110000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (560.38 seconds)\n", - "Cbc0010I After 5111000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (560.46 seconds)\n", - "Cbc0010I After 5112000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (560.58 seconds)\n", - "Cbc0010I After 5113000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (560.70 seconds)\n", - "Cbc0010I After 5114000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (560.78 seconds)\n", - "Cbc0010I After 5115000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (560.87 seconds)\n", - "Cbc0010I After 5116000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (560.94 seconds)\n", - "Cbc0010I After 5117000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (561.06 seconds)\n", - "Cbc0010I After 5118000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (561.14 seconds)\n", - "Cbc0010I After 5119000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (561.23 seconds)\n", - "Cbc0010I After 5120000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (561.33 seconds)\n", - "Cbc0010I After 5121000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (561.44 seconds)\n", - "Cbc0010I After 5122000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (561.56 seconds)\n", - "Cbc0010I After 5123000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (561.76 seconds)\n", - "Cbc0010I After 5124000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (561.95 seconds)\n", - "Cbc0010I After 5125000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (562.06 seconds)\n", - "Cbc0010I After 5126000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (562.27 seconds)\n", - "Cbc0010I After 5127000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (562.41 seconds)\n", - "Cbc0010I After 5128000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (562.55 seconds)\n", - "Cbc0010I After 5129000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (562.65 seconds)\n", - "Cbc0010I After 5130000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (562.76 seconds)\n", - "Cbc0010I After 5131000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (562.89 seconds)\n", - "Cbc0010I After 5132000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (562.97 seconds)\n", - "Cbc0010I After 5133000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (563.06 seconds)\n", - "Cbc0010I After 5134000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (563.15 seconds)\n", - "Cbc0010I After 5135000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (563.23 seconds)\n", - "Cbc0010I After 5136000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (563.32 seconds)\n", - "Cbc0010I After 5137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (563.40 seconds)\n", - "Cbc0010I After 5138000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (563.46 seconds)\n", - "Cbc0010I After 5139000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (563.52 seconds)\n", - "Cbc0010I After 5140000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (563.59 seconds)\n", - "Cbc0010I After 5141000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (563.68 seconds)\n", - "Cbc0010I After 5142000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (563.80 seconds)\n", - "Cbc0010I After 5143000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (563.93 seconds)\n", - "Cbc0010I After 5144000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (564.01 seconds)\n", - "Cbc0010I After 5145000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (564.08 seconds)\n", - "Cbc0010I After 5146000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (564.15 seconds)\n", - "Cbc0010I After 5147000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (564.21 seconds)\n", - "Cbc0010I After 5148000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (564.31 seconds)\n", - "Cbc0010I After 5149000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (564.40 seconds)\n", - "Cbc0ution, best possible 0 (320.27 seconds)\n", - "Cbc0010I After 2029000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (320.43 seconds)\n", - "Cbc0010I After 2030000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (320.59 seconds)\n", - "Cbc0010I After 2031000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (320.73 seconds)\n", - "Cbc0010I After 2032000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (320.86 seconds)\n", - "Cbc0010I After 2033000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (321.04 seconds)\n", - "Cbc0010I After 2034000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (321.35 seconds)\n", - "Cbc0010I After 2035000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (321.70 seconds)\n", - "Cbc0010I After 2036000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (321.99 seconds)\n", - "Cbc0010I After 2037000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (322.24 seconds)\n", - "Cbc0010I After 2038000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (322.41 seconds)\n", - "Cbc0010I After 2039000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (322.51 seconds)\n", - "Cbc0010I After 2040000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (322.60 seconds)\n", - "Cbc0010I After 2041000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (322.69 seconds)\n", - "Cbc0010I After 2042000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (322.82 seconds)\n", - "Cbc0010I After 2043000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (322.97 seconds)\n", - "Cbc0010I After 2044000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (323.12 seconds)\n", - "Cbc0010I After 2045000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (323.35 seconds)\n", - "Cbc0010I After 2046000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (323.53 seconds)\n", - "Cbc0010I After 2047000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (323.67 seconds)\n", - "Cbc0010I After 2048000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (323.75 seconds)\n", - "Cbc0010I After 2049000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (323.83 seconds)\n", - "Cbc0010I After 2050000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (323.90 seconds)\n", - "Cbc0010I After 2051000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (324.00 seconds)\n", - "Cbc0010I After 2052000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (324.09 seconds)\n", - "Cbc0010I After 2053000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (324.16 seconds)\n", - "Cbc0010I After 2054000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (324.26 seconds)\n", - "Cbc0010I After 2055000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (324.36 seconds)\n", - "Cbc0010I After 2056000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (324.51 seconds)\n", - "Cbc0010I After 2057000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (324.67 seconds)\n", - "Cbc0010I After 2058000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (324.81 seconds)\n", - "Cbc0010I After 2059000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (324.95 seconds)\n", - "Cbc0010I After 2060000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (325.11 seconds)\n", - "Cbc0010I After 2061000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (325.25 seconds)\n", - "Cbc0010I After 2062000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (325.36 seconds)\n", - "Cbc0010I After 2063000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (325.45 seconds)\n", - "Cbc0010I After 2064000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (325.52 seconds)\n", - "Cbc0010I After 2065000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (325.60 seconds)\n", - "Cbc0010I After 2066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (325.69 seconds)\n", - "Cbc0010I After 2067000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (325.81 seconds)\n", - "Cbc0010I After 2068000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (325.93 seconds)\n", - "Cbc0010I After 2069000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (326.07 seconds)\n", - "Cbc0010I After 2070000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (326.25 seconds)\n", - "Cbc0010I After 2071000 n010I After 5150000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (564.48 seconds)\n", - "Cbc0010I After 5151000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (564.55 seconds)\n", - "Cbc0010I After 5152000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (564.62 seconds)\n", - "Cbc0010I After 5153000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (564.70 seconds)\n", - "Cbc0010I After 5154000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (564.79 seconds)\n", - "Cbc0010I After 5155000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (564.85 seconds)\n", - "Cbc0010I After 5156000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (564.90 seconds)\n", - "Cbc0010I After 5157000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (564.97 seconds)\n", - "Cbc0010I After 5158000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (565.06 seconds)\n", - "Cbc0010I After 5159000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (565.15 seconds)\n", - "Cbc0010I After 5160000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (565.22 seconds)\n", - "Cbc0010I After 5161000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (565.28 seconds)\n", - "Cbc0010I After 5162000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (565.35 seconds)\n", - "Cbc0010I After 5163000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (565.41 seconds)\n", - "Cbc0010I After 5164000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (565.48 seconds)\n", - "Cbc0010I After 5165000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (565.57 seconds)\n", - "Cbc0010I After 5166000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (565.66 seconds)\n", - "Cbc0010I After 5167000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (565.74 seconds)\n", - "Cbc0010I After 5168000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (565.82 seconds)\n", - "Cbc0010I After 5169000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (565.89 seconds)\n", - "Cbc0010I After 5170000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (565.99 seconds)\n", - "Cbc0010I After 5171000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (566.05 seconds)\n", - "Cbc0010I After 5172000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (566.14 seconds)\n", - "Cbc0010I After 5173000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (566.22 seconds)\n", - "Cbc0010I After 5174000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (566.31 seconds)\n", - "Cbc0010I After 5175000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (566.39 seconds)\n", - "Cbc0010I After 5176000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (566.46 seconds)\n", - "Cbc0010I After 5177000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (566.52 seconds)\n", - "Cbc0010I After 5178000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (566.59 seconds)\n", - "Cbc0010I After 5179000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (566.67 seconds)\n", - "Cbc0010I After 5180000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (566.78 seconds)\n", - "Cbc0010I After 5181000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (566.90 seconds)\n", - "Cbc0010I After 5182000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (566.97 seconds)\n", - "Cbc0010I After 5183000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (567.03 seconds)\n", - "Cbc0010I After 5184000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (567.11 seconds)\n", - "Cbc0010I After 5185000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (567.21 seconds)\n", - "Cbc0010I After 5186000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (567.28 seconds)\n", - "Cbc0010I After 5187000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (567.33 seconds)\n", - "Cbc0010I After 5188000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (567.38 seconds)\n", - "Cbc0010I After 5189000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (567.46 seconds)\n", - "Cbc0010I After 5190000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (567.51 seconds)\n", - "Cbc0010I After 5191000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (567.56 seconds)\n", - "Cbc0010I After 5192000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (567.62 seconds)\n", - "Cbc0010I After 5193000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (567.68 seconds)\n", - "Cbc0010I After 5194000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (567.74 seconds)\n", - "Cbc0010I After 5195000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (567.80 seconds)\n", - "Cbc0010I After 5196000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (567.89 seconds)\n", - "Cbc0010I After 5197000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (567.99 seconds)\n", - "Cbc0010I After 5198000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (568.06 seconds)\n", - "Cbc0010I After 5199000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (568.13 seconds)\n", - "Cbc0010I After 5200000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (568.20 seconds)\n", - "Cbc0010I After 5201000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (568.26 seconds)\n", - "Cbc0010I After 5202000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (568.33 seconds)\n", - "Cbc0010I After 5203000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (568.40 seconds)\n", - "Cbc0010I After 5204000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (568.52 seconds)\n", - "Cbc0010I After 5205000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (568.70 seconds)\n", - "Cbc0010I After 5206000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (568.82 seconds)\n", - "Cbc0010I After 5207000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (569.08 seconds)\n", - "Cbc0010I After 5208000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (569.38 seconds)\n", - "Cbc0010I After 5209000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (569.52 seconds)\n", - "Cbc0010I After 5210000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (569.65 seconds)\n", - "Cbc0010I After 5211000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (569.87 seconds)\n", - "Cbc0010I After 5212000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (570.01 seconds)\n", - "Cbc0010I After 5213000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (570.10 seconds)\n", - "Cbc0010I After 5214000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (570.18 seconds)\n", - "Cbc0010I After 5215000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (570.32 seconds)\n", - "Cbc0010I After 5216000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (570.46 seconds)\n", - "Cbc0010I After 5217000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (570.60 seconds)\n", - "Cbc0010I After 5218000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (570.77 seconds)\n", - "Cbc0010I After 5219000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (570.89 seconds)\n", - "Cbc0010I After 5220000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (571.03 seconds)\n", - "Cbc0010I After 5221000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (571.10 seconds)\n", - "Cbc0010I After 5222000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (571.16 seconds)\n", - "Cbc0010I After 5223000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (571.21 seconds)\n", - "Cbc0010I After 5224000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (571.28 seconds)\n", - "Cbc0010I After 5225000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (571.38 seconds)\n", - "Cbc0010I After 5226000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (571.46 seconds)\n", - "Cbc0010I After 5227000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (571.54 seconds)\n", - "Cbc0010I After 5228000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (571.60 seconds)\n", - "Cbc0010I After 5229000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (571.67 seconds)\n", - "Cbc0010I After 5230000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (571.75 seconds)\n", - "Cbc0010I After 5231000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (571.84 seconds)\n", - "Cbc0010I After 5232000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (571.92 seconds)\n", - "Cbc0010I After 5233000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (572.00 seconds)\n", - "Cbc0010I After 5234000 nodes, 164 on tree, 1e+50 best solution, odes, 57 on tree, 1e+50 best solution, best possible 0 (326.46 seconds)\n", - "Cbc0010I After 2072000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (326.63 seconds)\n", - "Cbc0010I After 2073000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (326.80 seconds)\n", - "Cbc0010I After 2074000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (326.95 seconds)\n", - "Cbc0010I After 2075000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (327.08 seconds)\n", - "Cbc0010I After 2076000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (327.20 seconds)\n", - "Cbc0010I After 2077000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (327.28 seconds)\n", - "Cbc0010I After 2078000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (327.36 seconds)\n", - "Cbc0010I After 2079000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (327.49 seconds)\n", - "Cbc0010I After 2080000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (327.58 seconds)\n", - "Cbc0010I After 2081000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (327.65 seconds)\n", - "Cbc0010I After 2082000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (327.73 seconds)\n", - "Cbc0010I After 2083000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (327.83 seconds)\n", - "Cbc0010I After 2084000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (328.00 seconds)\n", - "Cbc0010I After 2085000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (328.24 seconds)\n", - "Cbc0010I After 2086000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (328.46 seconds)\n", - "Cbc0010I After 2087000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (328.79 seconds)\n", - "Cbc0010I After 2088000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (329.12 seconds)\n", - "Cbc0010I After 2089000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (329.41 seconds)\n", - "Cbc0010I After 2090000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (329.63 seconds)\n", - "Cbc0010I After 2091000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (329.84 seconds)\n", - "Cbc0010I After 2092000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (329.96 seconds)\n", - "Cbc0010I After 2093000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (330.04 seconds)\n", - "Cbc0010I After 2094000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (330.14 seconds)\n", - "Cbc0010I After 2095000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (330.28 seconds)\n", - "Cbc0010I After 2096000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (330.39 seconds)\n", - "Cbc0010I After 2097000 nodes, 20 on tree, 1e+50 best solution, best possible 0 (330.50 seconds)\n", - "Cbc0010I After 2098000 nodes, 20 on tree, 1e+50 best solution, best possible 0 (330.63 seconds)\n", - "Cbc0010I After 2099000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (330.70 seconds)\n", - "Cbc0010I After 2100000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (330.79 seconds)\n", - "Cbc0010I After 2101000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (330.88 seconds)\n", - "Cbc0010I After 2102000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (330.98 seconds)\n", - "Cbc0010I After 2103000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (331.08 seconds)\n", - "Cbc0010I After 2104000 nodes, 11 on tree, 1e+50 best solution, best possible 0 (331.15 seconds)\n", - "Cbc0010I After 2105000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (331.23 seconds)\n", - "Cbc0010I After 2106000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (331.32 seconds)\n", - "Cbc0010I After 2107000 nodes, 10 on tree, 1e+50 best solution, best possible 0 (331.40 seconds)\n", - "Cbc0010I After 2108000 nodes, 16 on tree, 1e+50 best solution, best possible 0 (331.55 seconds)\n", - "Cbc0010I After 2109000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (331.72 seconds)\n", - "Cbc0010I After 2110000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (332.00 seconds)\n", - "Cbc0010I After 2111000 nodes, 9 on tree, 1e+50 best solution, best possible 0 (332.19 seconds)\n", - "Cbc0010I After 2112000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (332.35 seconds)\n", - "Cbc0010I After 2113000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (332.48 seconds)\n", - "Cbc0010I After 2114000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (332.61 seconds)\n", - "Cbc0010I After 2115000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (332.78 seconds)\n", - "Cbc0010I After 2116000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (332.96 seconds)\n", - "Cbc0010I After 2117000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (333.18 seconds)\n", - "Cbc0010I After 2118000 nodes, 8 on tree, 1e+50 best solution, best possible 0 (333.39 seconds)\n", - "Cbc0010I After 2119000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (333.55 seconds)\n", - "Cbc0010I After 2120000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (333.73 seconds)\n", - "Cbc0010I After 2121000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (333.83 seconds)\n", - "Cbc0010I After 2122000 nodes, 27 on tree, 1e+50 best solution, best possible 0 (333.94 seconds)\n", - "Cbc0010I After 2123000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (334.04 seconds)\n", - "Cbc0010I After 2124000 nodes, 14 on tree, 1e+50 best solution, best possible 0 (334.15 seconds)\n", - "Cbc0010I After 2125000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (334.26 seconds)\n", - "Cbc0010I After 2126000 nodes, 21 on tree, 1e+50 best solution, best possible 0 (334.39 seconds)\n", - "Cbc0010I After 2127000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (334.59 seconds)\n", - "Cbc0010I After 2128000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (334.75 seconds)\n", - "Cbc0010I After 2129000 nodes, 9 on tree, 1e+50 best solution, best possible 0 (334.93 seconds)\n", - "Cbc0010I After 2130000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (335.13 seconds)\n", - "Cbc0001I Search completed - best objective 1e+50, took 9555165 iterations and 3650102 nodes (335.33 seconds)\n", - "Cbc0032I Strong branching done 3028270 times (3779559 iterations), fathomed 496152 nodes and fixed 312940 variables\n", - "Cbc0041I Maximum depth 428, 0 variables fixed on reduced cost (complete fathoming 894 times, 1519270 nodes taking 1947066 iterations)\n", - "Cuts at root node changed objective from 0 to 0\n", - "Probing was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Gomory was tried 26 times and created 42 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)\n", - "Knapsack was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "Clique was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "MixedIntegerRounding2 was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "FlowCover was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "TwoMirCuts was tried 26 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)\n", - "\n", - "Result - Problem proven infeasible\n", - "\n", - "No feasible solution found\n", - "Enumerated nodes: 3650102\n", - "Total iterations: 9555165\n", - "Time (CPU seconds): 335.04\n", - "Time (Wallclock seconds): 335.33\n", - "\n", - "Option for printingOptions changed from normal to all\n", - "Total time (CPU seconds): 335.04 (Wallclock seconds): 335.33\n", - "\n", - "best possible 0 (572.06 seconds)\n", - "Cbc0010I After 5235000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (572.17 seconds)\n", - "Cbc0010I After 5236000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (572.24 seconds)\n", - "Cbc0010I After 5237000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (572.34 seconds)\n", - "Cbc0010I After 5238000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (572.51 seconds)\n", - "Cbc0010I After 5239000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (572.59 seconds)\n", - "Cbc0010I After 5240000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (572.69 seconds)\n", - "Cbc0010I After 5241000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (572.77 seconds)\n", - "Cbc0010I After 5242000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (572.86 seconds)\n", - "Cbc0010I After 5243000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (572.95 seconds)\n", - "Cbc0010I After 5244000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (573.01 seconds)\n", - "Cbc0010I After 5245000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (573.07 seconds)\n", - "Cbc0010I After 5246000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (573.14 seconds)\n", - "Cbc0010I After 5247000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (573.21 seconds)\n", - "Cbc0010I After 5248000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (573.30 seconds)\n", - "Cbc0010I After 5249000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (573.44 seconds)\n", - "Cbc0010I After 5250000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (573.53 seconds)\n", - "Cbc0010I After 5251000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (573.64 seconds)\n", - "Cbc0010I After 5252000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (573.75 seconds)\n", - "Cbc0010I After 5253000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (573.85 seconds)\n", - "Cbc0010I After 5254000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (573.95 seconds)\n", - "Cbc0010I After 5255000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (574.06 seconds)\n", - "Cbc0010I After 5256000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (574.19 seconds)\n", - "Cbc0010I After 5257000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (574.30 seconds)\n", - "Cbc0010I After 5258000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (574.41 seconds)\n", - "Cbc0010I After 5259000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (574.49 seconds)\n", - "Cbc0010I After 5260000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (574.60 seconds)\n", - "Cbc0010I After 5261000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (574.67 seconds)\n", - "Cbc0010I After 5262000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (574.79 seconds)\n", - "Cbc0010I After 5263000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (574.91 seconds)\n", - "Cbc0010I After 5264000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (575.06 seconds)\n", - "Cbc0010I After 5265000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (575.19 seconds)\n", - "Cbc0010I After 5266000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (575.32 seconds)\n", - "Cbc0010I After 5267000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (575.44 seconds)\n", - "Cbc0010I After 5268000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (575.55 seconds)\n", - "Cbc0010I After 5269000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (575.68 seconds)\n", - "Cbc0010I After 5270000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (575.79 seconds)\n", - "Cbc0010I After 5271000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (575.89 seconds)\n", - "Cbc0010I After 5272000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (576.02 seconds)\n", - "Cbc0010I After 5273000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (576.16 seconds)\n", - "Cbc0010I After 5274000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (576.24 seconds)\n", - "Cbc0010I After 5275000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (576.38 seconds)\n", - "Cbc0010I After 5276000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (576.53 seconds)\n", - "Cbc0010I After 5277000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (576.67 seconds)\n", - "Cbc0010I After 5278000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (576.79 seconds)\n", - "Cbc0010I After 5279000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (577.02 seconds)\n", - "Cbc0010I After 5280000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (577.14 seconds)\n", - "Cbc0010I After 5281000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (577.22 seconds)\n", - "Cbc0010I After 5282000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (577.30 seconds)\n", - "Cbc0010I After 5283000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (577.36 seconds)\n", - "Cbc0010I After 5284000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (577.44 seconds)\n", - "Cbc0010I After 5285000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (577.50 seconds)\n", - "Cbc0010I After 5286000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (577.56 seconds)\n", - "Cbc0010I After 5287000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (577.62 seconds)\n", - "Cbc0010I After 5288000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (577.67 seconds)\n", - "Cbc0010I After 5289000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (577.71 seconds)\n", - "Cbc0010I After 5290000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (577.77 seconds)\n", - "Cbc0010I After 5291000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (577.82 seconds)\n", - "Cbc0010I After 5292000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (577.86 seconds)\n", - "Cbc0010I After 5293000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (577.93 seconds)\n", - "Cbc0010I After 5294000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (577.99 seconds)\n", - "Cbc0010I After 5295000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (578.05 seconds)\n", - "Cbc0010I After 5296000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (578.11 seconds)\n", - "Cbc0010I After 5297000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (578.17 seconds)\n", - "Cbc0010I After 5298000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (578.24 seconds)\n", - "Cbc0010I After 5299000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (578.31 seconds)\n", - "Cbc0010I After 5300000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (578.37 seconds)\n", - "Cbc0010I After 5301000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (578.44 seconds)\n", - "Cbc0010I After 5302000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (578.52 seconds)\n", - "Cbc0010I After 5303000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (578.57 seconds)\n", - "Cbc0010I After 5304000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (578.62 seconds)\n", - "Cbc0010I After 5305000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (578.69 seconds)\n", - "Cbc0010I After 5306000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (578.75 seconds)\n", - "Cbc0010I After 5307000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (578.80 seconds)\n", - "Cbc0010I After 5308000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (578.87 seconds)\n", - "Cbc0010I After 5309000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (578.94 seconds)\n", - "Cbc0010I After 5310000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (579.02 seconds)\n", - "Cbc0010I After 5311000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (579.09 seconds)\n", - "Cbc0010I After 5312000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (579.18 seconds)\n", - "Cbc0010I After 5313000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (579.25 seconds)\n", - "Cbc0010I After 5314000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (579.34 seconds)\n", - "Cbc0010I After 5315000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (579.45 seconds)\n", - "Cbc0010I After 5316000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (579.56 seconds)\n", - "Cbc0010I After 5317000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (579.63 seconds)\n", - "Cbc0010I After 5318000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (579.68 seconds)\n", - "Cbc0010I After 5319000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (579.73 seconds)\n", - "Cbc0010I After 5320000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (579.81 seconds)\n", - "Cbc0010I After 5321000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (579.87 seconds)\n", - "Cbc0010I After 5322000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (579.92 seconds)\n", - "Cbc0010I After 5323000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (579.99 seconds)\n", - "Cbc0010I After 5324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (580.06 seconds)\n", - "Cbc0010I After 5325000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (580.14 seconds)\n", - "Cbc0010I After 5326000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (580.24 seconds)\n", - "Cbc0010I After 5327000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (580.31 seconds)\n", - "Cbc0010I After 5328000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (580.40 seconds)\n", - "Cbc0010I After 5329000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (580.54 seconds)\n", - "Cbc0010I After 5330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (580.70 seconds)\n", - "Cbc0010I After 5331000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (580.86 seconds)\n", - "Cbc0010I After 5332000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (581.00 seconds)\n", - "Cbc0010I After 5333000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (581.17 seconds)\n", - "Cbc0010I After 5334000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (581.29 seconds)\n", - "Cbc0010I After 5335000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (581.42 seconds)\n", - "Cbc0010I After 5336000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (581.55 seconds)\n", - "Cbc0010I After 5337000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (581.66 seconds)\n", - "Cbc0010I After 5338000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (581.75 seconds)\n", - "Cbc0010I After 5339000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (581.86 seconds)\n", - "Cbc0010I After 5340000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (581.97 seconds)\n", - "Cbc0010I After 5341000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (582.08 seconds)\n", - "Cbc0010I After 5342000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (582.17 seconds)\n", - "Cbc0010I After 5343000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (582.28 seconds)\n", - "Cbc0010I After 5344000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (582.39 seconds)\n", - "Cbc0010I After 5345000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (582.50 seconds)\n", - "Cbc0010I After 5346000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (582.62 seconds)\n", - "Cbc0010I After 5347000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (582.72 seconds)\n", - "Cbc0010I After 5348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (582.83 seconds)\n", - "Cbc0010I After 5349000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (583.00 seconds)\n", - "Cbc0010I After 5350000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (583.12 seconds)\n", - "Cbc0010I After 5351000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (583.19 seconds)\n", - "Cbc0010I After 5352000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (583.24 seconds)\n", - "Cbc0010I After 5353000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (583.29 seconds)\n", - "Cbc0010I After 5354000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (583.37 seconds)\n", - "Cbc0010I After 5355000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (583.46 seconds)\n", - "Cbc0010I After 5356000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (583.56 seconds)\n", - "Cbc0010I After 5357000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (583.64 seconds)\n", - "Cbc0010I After 5358000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (583.72 seconds)\n", - "Cbc0010I After 5359000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (583.80 seconds)\n", - "Cbc0010I After 5360000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (583.90 seconds)\n", - "Cbc0010I After 5361000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (584.00 seconds)\n", - "Cbc0010I After 5362000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (584.08 seconds)\n", - "Cbc0010I After 5363000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (584.16 seconds)\n", - "Cbc0010I After 5364000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (584.27 seconds)\n", - "Cbc0010I After 5365000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (584.36 seconds)\n", - "Cbc0010I After 5366000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (584.43 seconds)\n", - "Cbc0010I After 5367000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (584.52 seconds)\n", - "Cbc0010I After 5368000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (584.61 seconds)\n", - "Cbc0010I After 5369000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (584.69 seconds)\n", - "Cbc0010I After 5370000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (584.77 seconds)\n", - "Cbc0010I After 5371000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (584.84 seconds)\n", - "Cbc0010I After 5372000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (584.91 seconds)\n", - "Cbc0010I After 5373000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (585.01 seconds)\n", - "Cbc0010I After 5374000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (585.12 seconds)\n", - "Cbc0010I After 5375000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (585.19 seconds)\n", - "Cbc0010I After 5376000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (585.30 seconds)\n", - "Cbc0010I After 5377000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (585.37 seconds)\n", - "Cbc0010I After 5378000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (585.45 seconds)\n", - "Cbc0010I After 5379000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (585.53 seconds)\n", - "Cbc0010I After 5380000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (585.60 seconds)\n", - "Cbc0010I After 5381000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (585.66 seconds)\n", - "Cbc0010I After 5382000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (585.72 seconds)\n", - "Cbc0010I After 5383000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (585.79 seconds)\n", - "Cbc0010I After 5384000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (585.84 seconds)\n", - "Cbc0010I After 5385000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (585.88 seconds)\n", - "Cbc0010I After 5386000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (585.96 seconds)\n", - "Cbc0010I After 5387000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (586.03 seconds)\n", - "Cbc0010I After 5388000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (586.11 seconds)\n", - "Cbc0010I After 5389000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (586.19 seconds)\n", - "Cbc0010I After 5390000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (586.25 seconds)\n", - "Cbc0010I After 5391000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (586.31 seconds)\n", - "Cbc0010I After 5392000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (586.36 seconds)\n", - "Cbc0010I After 5393000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (586.41 seconds)\n", - "Cbc0010I After 5394000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (586.44 seconds)\n", - "Cbc0010I After 5395000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (586.51 seconds)\n", - "Cbc0010I After 5396000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (586.56 seconds)\n", - "Cbc0010I After 5397000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (586.61 seconds)\n", - "Cbc0010I After 5398000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (586.69 seconds)\n", - "Cbc0010I After 5399000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (586.76 seconds)\n", - "Cbc0010I After 5400000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (586.79 seconds)\n", - "Cbc0010I After 5401000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (586.83 seconds)\n", - "Cbc0010I After 5402000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (586.87 seconds)\n", - "Cbc0010I After 5403000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (586.91 seconds)\n", - "Cbc0010I After 5404000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (586.96 seconds)\n", - "Cbc0010I After 5405000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (587.02 seconds)\n", - "Cbc0010I After 5406000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (587.09 seconds)\n", - "Cbc0010I After 5407000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (587.15 seconds)\n", - "Cbc0010I After 5408000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (587.31 seconds)\n", - "Cbc0010I After 5409000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (587.40 seconds)\n", - "Cbc0010I After 5410000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (587.50 seconds)\n", - "Cbc0010I After 5411000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (587.55 seconds)\n", - "Cbc0010I After 5412000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (587.61 seconds)\n", - "Cbc0010I After 5413000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (587.71 seconds)\n", - "Cbc0010I After 5414000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (587.80 seconds)\n", - "Cbc0010I After 5415000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (587.86 seconds)\n", - "Cbc0010I After 5416000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (587.90 seconds)\n", - "Cbc0010I After 5417000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (587.94 seconds)\n", - "Cbc0010I After 5418000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (587.98 seconds)\n", - "Cbc0010I After 5419000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (588.02 seconds)\n", - "Cbc0010I After 5420000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (588.07 seconds)\n", - "Cbc0010I After 5421000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (588.14 seconds)\n", - "Cbc0010I After 5422000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (588.19 seconds)\n", - "Cbc0010I After 5423000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (588.24 seconds)\n", - "Cbc0010I After 5424000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (588.30 seconds)\n", - "Cbc0010I After 5425000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (588.35 seconds)\n", - "Cbc0010I After 5426000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (588.42 seconds)\n", - "Cbc0010I After 5427000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (588.50 seconds)\n", - "Cbc0010I After 5428000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (588.56 seconds)\n", - "Cbc0010I After 5429000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (588.65 seconds)\n", - "Cbc0010I After 5430000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (588.75 seconds)\n", - "Cbc0010I After 5431000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (588.82 seconds)\n", - "Cbc0010I After 5432000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (588.87 seconds)\n", - "Cbc0010I After 5433000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (588.93 seconds)\n", - "Cbc0010I After 5434000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (588.97 seconds)\n", - "Cbc0010I After 5435000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (589.02 seconds)\n", - "Cbc0010I After 5436000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (589.06 seconds)\n", - "Cbc0010I After 5437000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (589.12 seconds)\n", - "Cbc0010I After 5438000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (589.17 seconds)\n", - "Cbc0010I After 5439000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (589.22 seconds)\n", - "Cbc0010I After 5440000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (589.27 seconds)\n", - "Cbc0010I After 5441000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (589.32 seconds)\n", - "Cbc0010I After 5442000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (589.37 seconds)\n", - "Cbc0010I After 5443000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (589.43 seconds)\n", - "Cbc0010I After 5444000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (589.49 seconds)\n", - "Cbc0010I After 5445000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (589.55 seconds)\n", - "Cbc0010I After 5446000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (589.61 seconds)\n", - "Cbc0010I After 5447000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (589.66 seconds)\n", - "Cbc0010I After 5448000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (589.70 seconds)\n", - "Cbc0010I After 5449000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (589.75 seconds)\n", - "Cbc0010I After 5450000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (589.79 seconds)\n", - "Cbc0010I After 5451000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (589.83 seconds)\n", - "Cbc0010I After 5452000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (589.87 seconds)\n", - "Cbc0010I After 5453000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (589.93 seconds)\n", - "Cbc0010I After 5454000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (589.96 seconds)\n", - "Cbc0010I After 5455000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (590.00 seconds)\n", - "Cbc0010I After 5456000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (590.05 seconds)\n", - "Cbc0010I After 5457000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (590.11 seconds)\n", - "Cbc0010I After 5458000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (590.17 seconds)\n", - "Cbc0010I After 5459000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (590.22 seconds)\n", - "Cbc0010I After 5460000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (590.27 seconds)\n", - "Cbc0010I After 5461000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (590.32 seconds)\n", - "Cbc0010I After 5462000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (590.36 seconds)\n", - "Cbc0010I After 5463000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (590.41 seconds)\n", - "Cbc0010I After 5464000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (590.46 seconds)\n", - "Cbc0010I After 5465000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (590.52 seconds)\n", - "Cbc0010I After 5466000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (590.56 seconds)\n", - "Cbc0010I After 5467000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (590.60 seconds)\n", - "Cbc0010I After 5468000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (590.65 seconds)\n", - "Cbc0010I After 5469000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (590.70 seconds)\n", - "Cbc0010I After 5470000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (590.75 seconds)\n", - "Cbc0010I After 5471000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (590.82 seconds)\n", - "Cbc0010I After 5472000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (590.89 seconds)\n", - "Cbc0010I After 5473000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (590.94 seconds)\n", - "Cbc0010I After 5474000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (590.98 seconds)\n", - "Cbc0010I After 5475000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (591.02 seconds)\n", - "Cbc0010I After 5476000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (591.09 seconds)\n", - "Cbc0010I After 5477000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (591.15 seconds)\n", - "Cbc0010I After 5478000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (591.20 seconds)\n", - "Cbc0010I After 5479000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (591.24 seconds)\n", - "Cbc0010I After 5480000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (591.29 seconds)\n", - "Cbc0010I After 5481000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (591.35 seconds)\n", - "Cbc0010I After 5482000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (591.39 seconds)\n", - "Cbc0010I After 5483000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (591.43 seconds)\n", - "Cbc0010I After 5484000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (591.49 seconds)\n", - "Cbc0010I After 5485000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (591.53 seconds)\n", - "Cbc0010I After 5486000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (591.58 seconds)\n", - "Cbc0010I After 5487000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (591.65 seconds)\n", - "Cbc0010I After 5488000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (591.70 seconds)\n", - "Cbc0010I After 5489000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (591.75 seconds)\n", - "Cbc0010I After 5490000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (591.80 seconds)\n", - "Cbc0010I After 5491000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (591.87 seconds)\n", - "Cbc0010I After 5492000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (591.95 seconds)\n", - "Cbc0010I After 5493000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (592.03 seconds)\n", - "Cbc0010I After 5494000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (592.09 seconds)\n", - "Cbc0010I After 5495000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (592.14 seconds)\n", - "Cbc0010I After 5496000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (592.18 seconds)\n", - "Cbc0010I After 5497000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (592.27 seconds)\n", - "Cbc0010I After 5498000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (592.32 seconds)\n", - "Cbc0010I After 5499000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (592.36 seconds)\n", - "Cbc0010I After 5500000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (592.41 seconds)\n", - "Cbc0010I After 5501000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (592.45 seconds)\n", - "Cbc0010I After 5502000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (592.49 seconds)\n", - "Cbc0010I After 5503000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (592.54 seconds)\n", - "Cbc0010I After 5504000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (592.60 seconds)\n", - "Cbc0010I After 5505000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (592.63 seconds)\n", - "Cbc0010I After 5506000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (592.66 seconds)\n", - "Cbc0010I After 5507000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (592.70 seconds)\n", - "Cbc0010I After 5508000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (592.76 seconds)\n", - "Cbc0010I After 5509000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (592.80 seconds)\n", - "Cbc0010I After 5510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (592.84 seconds)\n", - "Cbc0010I After 5511000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (592.89 seconds)\n", - "Cbc0010I After 5512000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (592.94 seconds)\n", - "Cbc0010I After 5513000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (592.99 seconds)\n", - "Cbc0010I After 5514000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (593.04 seconds)\n", - "Cbc0010I After 5515000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (593.12 seconds)\n", - "Cbc0010I After 5516000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (593.17 seconds)\n", - "Cbc0010I After 5517000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (593.25 seconds)\n", - "Cbc0010I After 5518000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (593.31 seconds)\n", - "Cbc0010I After 5519000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (593.40 seconds)\n", - "Cbc0010I After 5520000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (593.51 seconds)\n", - "Cbc0010I After 5521000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (593.60 seconds)\n", - "Cbc0010I After 5522000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (593.70 seconds)\n", - "Cbc0010I After 5523000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (593.77 seconds)\n", - "Cbc0010I After 5524000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (593.82 seconds)\n", - "Cbc0010I After 5525000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (593.91 seconds)\n", - "Cbc0010I After 5526000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (593.99 seconds)\n", - "Cbc0010I After 5527000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (594.07 seconds)\n", - "Cbc0010I After 5528000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (594.12 seconds)\n", - "Cbc0010I After 5529000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (594.20 seconds)\n", - "Cbc0010I After 5530000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (594.27 seconds)\n", - "Cbc0010I After 5531000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (594.32 seconds)\n", - "Cbc0010I After 5532000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (594.40 seconds)\n", - "Cbc0010I After 5533000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (594.47 seconds)\n", - "Cbc0010I After 5534000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (594.53 seconds)\n", - "Cbc0010I After 5535000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (594.59 seconds)\n", - "Cbc0010I After 5536000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (594.65 seconds)\n", - "Cbc0010I After 5537000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (594.70 seconds)\n", - "Cbc0010I After 5538000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (594.77 seconds)\n", - "Cbc0010I After 5539000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (594.86 seconds)\n", - "Cbc0010I After 5540000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (594.95 seconds)\n", - "Cbc0010I After 5541000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (595.02 seconds)\n", - "Cbc0010I After 5542000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (595.12 seconds)\n", - "Cbc0010I After 5543000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (595.19 seconds)\n", - "Cbc0010I After 5544000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (595.28 seconds)\n", - "Cbc0010I After 5545000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (595.36 seconds)\n", - "Cbc0010I After 5546000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (595.42 seconds)\n", - "Cbc0010I After 5547000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (595.51 seconds)\n", - "Cbc0010I After 5548000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (595.66 seconds)\n", - "Cbc0010I After 5549000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (595.89 seconds)\n", - "Cbc0010I After 5550000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (596.04 seconds)\n", - "Cbc0010I After 5551000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (596.14 seconds)\n", - "Cbc0010I After 5552000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (596.24 seconds)\n", - "Cbc0010I After 5553000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (596.31 seconds)\n", - "Cbc0010I After 5554000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (596.39 seconds)\n", - "Cbc0010I After 5555000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (596.55 seconds)\n", - "Cbc0010I After 5556000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (596.84 seconds)\n", - "Cbc0010I After 5557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (596.98 seconds)\n", - "Cbc0010I After 5558000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (597.06 seconds)\n", - "Cbc0010I After 5559000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (597.18 seconds)\n", - "Cbc0010I After 5560000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (597.32 seconds)\n", - "Cbc0010I After 5561000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (597.39 seconds)\n", - "Cbc0010I After 5562000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (597.48 seconds)\n", - "Cbc0010I After 5563000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (597.55 seconds)\n", - "Cbc0010I After 5564000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (597.63 seconds)\n", - "Cbc0010I After 5565000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (597.69 seconds)\n", - "Cbc0010I After 5566000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (597.76 seconds)\n", - "Cbc0010I After 5567000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (597.82 seconds)\n", - "Cbc0010I After 5568000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (597.90 seconds)\n", - "Cbc0010I After 5569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (597.97 seconds)\n", - "Cbc0010I After 5570000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (598.05 seconds)\n", - "Cbc0010I After 5571000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (598.10 seconds)\n", - "Cbc0010I After 5572000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (598.21 seconds)\n", - "Cbc0010I After 5573000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (598.33 seconds)\n", - "Cbc0010I After 5574000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (598.41 seconds)\n", - "Cbc0010I After 5575000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (598.48 seconds)\n", - "Cbc0010I After 5576000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (598.56 seconds)\n", - "Cbc0010I After 5577000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (598.65 seconds)\n", - "Cbc0010I After 5578000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (598.74 seconds)\n", - "Cbc0010I After 5579000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (598.84 seconds)\n", - "Cbc0010I After 5580000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (598.92 seconds)\n", - "Cbc0010I After 5581000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (599.00 seconds)\n", - "Cbc0010I After 5582000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (599.11 seconds)\n", - "Cbc0010I After 5583000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (599.23 seconds)\n", - "Cbc0010I After 5584000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (599.29 seconds)\n", - "Cbc0010I After 5585000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (599.38 seconds)\n", - "Cbc0010I After 5586000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (599.43 seconds)\n", - "Cbc0010I After 5587000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (599.53 seconds)\n", - "Cbc0010I After 5588000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (599.58 seconds)\n", - "Cbc0010I After 5589000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (599.63 seconds)\n", - "Cbc0010I After 5590000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (599.67 seconds)\n", - "Cbc0010I After 5591000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (599.74 seconds)\n", - "Cbc0010I After 5592000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (599.79 seconds)\n", - "Cbc0010I After 5593000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (599.83 seconds)\n", - "Cbc0010I After 5594000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (599.90 seconds)\n", - "Cbc0010I After 5595000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (599.94 seconds)\n", - "Cbc0010I After 5596000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (600.04 seconds)\n", - "Cbc0010I After 5597000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (600.14 seconds)\n", - "Cbc0010I After 5598000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (600.22 seconds)\n", - "Cbc0010I After 5599000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (600.31 seconds)\n", - "Cbc0010I After 5600000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (600.41 seconds)\n", - "Cbc0010I After 5601000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (600.48 seconds)\n", - "Cbc0010I After 5602000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (600.55 seconds)\n", - "Cbc0010I After 5603000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (600.63 seconds)\n", - "Cbc0010I After 5604000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (600.69 seconds)\n", - "Cbc0010I After 5605000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (600.75 seconds)\n", - "Cbc0010I After 5606000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (600.84 seconds)\n", - "Cbc0010I After 5607000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (600.90 seconds)\n", - "Cbc0010I After 5608000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (600.98 seconds)\n", - "Cbc0010I After 5609000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (601.04 seconds)\n", - "Cbc0010I After 5610000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (601.11 seconds)\n", - "Cbc0010I After 5611000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (601.19 seconds)\n", - "Cbc0010I After 5612000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (601.27 seconds)\n", - "Cbc0010I After 5613000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (601.35 seconds)\n", - "Cbc0010I After 5614000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (601.42 seconds)\n", - "Cbc0010I After 5615000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (601.53 seconds)\n", - "Cbc0010I After 5616000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (601.63 seconds)\n", - "Cbc0010I After 5617000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (601.68 seconds)\n", - "Cbc0010I After 5618000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (601.73 seconds)\n", - "Cbc0010I After 5619000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (601.81 seconds)\n", - "Cbc0010I After 5620000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (601.86 seconds)\n", - "Cbc0010I After 5621000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (601.94 seconds)\n", - "Cbc0010I After 5622000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (602.03 seconds)\n", - "Cbc0010I After 5623000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (602.08 seconds)\n", - "Cbc0010I After 5624000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (602.14 seconds)\n", - "Cbc0010I After 5625000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (602.19 seconds)\n", - "Cbc0010I After 5626000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (602.25 seconds)\n", - "Cbc0010I After 5627000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (602.35 seconds)\n", - "Cbc0010I After 5628000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (602.41 seconds)\n", - "Cbc0010I After 5629000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (602.48 seconds)\n", - "Cbc0010I After 5630000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (602.58 seconds)\n", - "Cbc0010I After 5631000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (602.67 seconds)\n", - "Cbc0010I After 5632000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (602.79 seconds)\n", - "Cbc0010I After 5633000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (602.87 seconds)\n", - "Cbc0010I After 5634000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (602.91 seconds)\n", - "Cbc0010I After 5635000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (602.95 seconds)\n", - "Cbc0010I After 5636000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (603.01 seconds)\n", - "Cbc0010I After 5637000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (603.05 seconds)\n", - "Cbc0010I After 5638000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (603.09 seconds)\n", - "Cbc0010I After 5639000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (603.15 seconds)\n", - "Cbc0010I After 5640000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.20 seconds)\n", - "Cbc0010I After 5641000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (603.25 seconds)\n", - "Cbc0010I After 5642000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (603.29 seconds)\n", - "Cbc0010I After 5643000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.36 seconds)\n", - "Cbc0010I After 5644000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (603.40 seconds)\n", - "Cbc0010I After 5645000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (603.44 seconds)\n", - "Cbc0010I After 5646000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (603.48 seconds)\n", - "Cbc0010I After 5647000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (603.55 seconds)\n", - "Cbc0010I After 5648000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (603.59 seconds)\n", - "Cbc0010I After 5649000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (603.67 seconds)\n", - "Cbc0010I After 5650000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (603.75 seconds)\n", - "Cbc0010I After 5651000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (603.82 seconds)\n", - "Cbc0010I After 5652000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (603.90 seconds)\n", - "Cbc0010I After 5653000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (603.97 seconds)\n", - "Cbc0010I After 5654000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (604.04 seconds)\n", - "Cbc0010I After 5655000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (604.19 seconds)\n", - "Cbc0010I After 5656000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (604.24 seconds)\n", - "Cbc0010I After 5657000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (604.29 seconds)\n", - "Cbc0010I After 5658000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (604.33 seconds)\n", - "Cbc0010I After 5659000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (604.37 seconds)\n", - "Cbc0010I After 5660000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (604.42 seconds)\n", - "Cbc0010I After 5661000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (604.47 seconds)\n", - "Cbc0010I After 5662000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (604.52 seconds)\n", - "Cbc0010I After 5663000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (604.56 seconds)\n", - "Cbc0010I After 5664000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (604.60 seconds)\n", - "Cbc0010I After 5665000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (604.63 seconds)\n", - "Cbc0010I After 5666000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.68 seconds)\n", - "Cbc0010I After 5667000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.72 seconds)\n", - "Cbc0010I After 5668000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (604.77 seconds)\n", - "Cbc0010I After 5669000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (604.81 seconds)\n", - "Cbc0010I After 5670000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (604.85 seconds)\n", - "Cbc0010I After 5671000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (604.90 seconds)\n", - "Cbc0010I After 5672000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (604.94 seconds)\n", - "Cbc0010I After 5673000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (604.98 seconds)\n", - "Cbc0010I After 5674000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (605.02 seconds)\n", - "Cbc0010I After 5675000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (605.06 seconds)\n", - "Cbc0010I After 5676000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (605.10 seconds)\n", - "Cbc0010I After 5677000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (605.15 seconds)\n", - "Cbc0010I After 5678000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (605.20 seconds)\n", - "Cbc0010I After 5679000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (605.24 seconds)\n", - "Cbc0010I After 5680000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (605.29 seconds)\n", - "Cbc0010I After 5681000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (605.34 seconds)\n", - "Cbc0010I After 5682000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (605.38 seconds)\n", - "Cbc0010I After 5683000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (605.43 seconds)\n", - "Cbc0010I After 5684000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (605.49 seconds)\n", - "Cbc0010I After 5685000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (605.53 seconds)\n", - "Cbc0010I After 5686000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (605.57 seconds)\n", - "Cbc0010I After 5687000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (605.64 seconds)\n", - "Cbc0010I After 5688000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (605.73 seconds)\n", - "Cbc0010I After 5689000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (605.78 seconds)\n", - "Cbc0010I After 5690000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (605.84 seconds)\n", - "Cbc0010I After 5691000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (605.89 seconds)\n", - "Cbc0010I After 5692000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (605.92 seconds)\n", - "Cbc0010I After 5693000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (605.97 seconds)\n", - "Cbc0010I After 5694000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (606.02 seconds)\n", - "Cbc0010I After 5695000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (606.08 seconds)\n", - "Cbc0010I After 5696000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (606.14 seconds)\n", - "Cbc0010I After 5697000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.20 seconds)\n", - "Cbc0010I After 5698000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (606.26 seconds)\n", - "Cbc0010I After 5699000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (606.32 seconds)\n", - "Cbc0010I After 5700000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (606.38 seconds)\n", - "Cbc0010I After 5701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.44 seconds)\n", - "Cbc0010I After 5702000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (606.51 seconds)\n", - "Cbc0010I After 5703000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (606.56 seconds)\n", - "Cbc0010I After 5704000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (606.60 seconds)\n", - "Cbc0010I After 5705000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (606.65 seconds)\n", - "Cbc0010I After 5706000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (606.68 seconds)\n", - "Cbc0010I After 5707000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (606.74 seconds)\n", - "Cbc0010I After 5708000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (606.78 seconds)\n", - "Cbc0010I After 5709000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (606.85 seconds)\n", - "Cbc0010I After 5710000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (606.90 seconds)\n", - "Cbc0010I After 5711000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (606.95 seconds)\n", - "Cbc0010I After 5712000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (607.01 seconds)\n", - "Cbc0010I After 5713000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (607.06 seconds)\n", - "Cbc0010I After 5714000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (607.13 seconds)\n", - "Cbc0010I After 5715000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (607.20 seconds)\n", - "Cbc0010I After 5716000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (607.26 seconds)\n", - "Cbc0010I After 5717000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (607.32 seconds)\n", - "Cbc0010I After 5718000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (607.37 seconds)\n", - "Cbc0010I After 5719000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (607.42 seconds)\n", - "Cbc0010I After 5720000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (607.47 seconds)\n", - "Cbc0010I After 5721000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (607.53 seconds)\n", - "Cbc0010I After 5722000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (607.58 seconds)\n", - "Cbc0010I After 5723000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (607.63 seconds)\n", - "Cbc0010I After 5724000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (607.71 seconds)\n", - "Cbc0010I After 5725000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (607.79 seconds)\n", - "Cbc0010I After 5726000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (607.88 seconds)\n", - "Cbc0010I After 5727000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (607.98 seconds)\n", - "Cbc0010I After 5728000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (608.08 seconds)\n", - "Cbc0010I After 5729000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (608.18 seconds)\n", - "Cbc0010I After 5730000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (608.23 seconds)\n", - "Cbc0010I After 5731000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (608.30 seconds)\n", - "Cbc0010I After 5732000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (608.41 seconds)\n", - "Cbc0010I After 5733000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (608.54 seconds)\n", - "Cbc0010I After 5734000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (608.66 seconds)\n", - "Cbc0010I After 5735000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (608.73 seconds)\n", - "Cbc0010I After 5736000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (608.78 seconds)\n", - "Cbc0010I After 5737000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (608.83 seconds)\n", - "Cbc0010I After 5738000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (608.88 seconds)\n", - "Cbc0010I After 5739000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (608.96 seconds)\n", - "Cbc0010I After 5740000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (609.02 seconds)\n", - "Cbc0010I After 5741000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (609.08 seconds)\n", - "Cbc0010I After 5742000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (609.14 seconds)\n", - "Cbc0010I After 5743000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (609.20 seconds)\n", - "Cbc0010I After 5744000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (609.26 seconds)\n", - "Cbc0010I After 5745000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (609.34 seconds)\n", - "Cbc0010I After 5746000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (609.43 seconds)\n", - "Cbc0010I After 5747000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (609.49 seconds)\n", - "Cbc0010I After 5748000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (609.58 seconds)\n", - "Cbc0010I After 5749000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (609.64 seconds)\n", - "Cbc0010I After 5750000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (609.68 seconds)\n", - "Cbc0010I After 5751000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (609.74 seconds)\n", - "Cbc0010I After 5752000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (609.79 seconds)\n", - "Cbc0010I After 5753000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (609.87 seconds)\n", - "Cbc0010I After 5754000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (609.91 seconds)\n", - "Cbc0010I After 5755000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (609.97 seconds)\n", - "Cbc0010I After 5756000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (610.01 seconds)\n", - "Cbc0010I After 5757000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (610.05 seconds)\n", - "Cbc0010I After 5758000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (610.11 seconds)\n", - "Cbc0010I After 5759000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (610.16 seconds)\n", - "Cbc0010I After 5760000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (610.22 seconds)\n", - "Cbc0010I After 5761000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (610.27 seconds)\n", - "Cbc0010I After 5762000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (610.34 seconds)\n", - "Cbc0010I After 5763000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (610.41 seconds)\n", - "Cbc0010I After 5764000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (610.49 seconds)\n", - "Cbc0010I After 5765000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (610.59 seconds)\n", - "Cbc0010I After 5766000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (610.69 seconds)\n", - "Cbc0010I After 5767000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (610.77 seconds)\n", - "Cbc0010I After 5768000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (610.86 seconds)\n", - "Cbc0010I After 5769000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (610.92 seconds)\n", - "Cbc0010I After 5770000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (610.99 seconds)\n", - "Cbc0010I After 5771000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (611.04 seconds)\n", - "Cbc0010I After 5772000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (611.10 seconds)\n", - "Cbc0010I After 5773000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (611.18 seconds)\n", - "Cbc0010I After 5774000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (611.23 seconds)\n", - "Cbc0010I After 5775000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (611.28 seconds)\n", - "Cbc0010I After 5776000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (611.33 seconds)\n", - "Cbc0010I After 5777000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (611.39 seconds)\n", - "Cbc0010I After 5778000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (611.45 seconds)\n", - "Cbc0010I After 5779000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (611.49 seconds)\n", - "Cbc0010I After 5780000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (611.59 seconds)\n", - "Cbc0010I After 5781000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (611.64 seconds)\n", - "Cbc0010I After 5782000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (611.71 seconds)\n", - "Cbc0010I After 5783000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (611.77 seconds)\n", - "Cbc0010I After 5784000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (611.86 seconds)\n", - "Cbc0010I After 5785000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (611.97 seconds)\n", - "Cbc0010I After 5786000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (612.07 seconds)\n", - "Cbc0010I After 5787000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (612.15 seconds)\n", - "Cbc0010I After 5788000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (612.21 seconds)\n", - "Cbc0010I After 5789000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (612.28 seconds)\n", - "Cbc0010I After 5790000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (612.39 seconds)\n", - "Cbc0010I After 5791000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (612.55 seconds)\n", - "Cbc0010I After 5792000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (612.71 seconds)\n", - "Cbc0010I After 5793000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (612.87 seconds)\n", - "Cbc0010I After 5794000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (613.06 seconds)\n", - "Cbc0010I After 5795000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (613.23 seconds)\n", - "Cbc0010I After 5796000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (613.33 seconds)\n", - "Cbc0010I After 5797000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (613.45 seconds)\n", - "Cbc0010I After 5798000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (613.56 seconds)\n", - "Cbc0010I After 5799000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (613.62 seconds)\n", - "Cbc0010I After 5800000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (613.70 seconds)\n", - "Cbc0010I After 5801000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (613.77 seconds)\n", - "Cbc0010I After 5802000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (613.84 seconds)\n", - "Cbc0010I After 5803000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (613.89 seconds)\n", - "Cbc0010I After 5804000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (613.94 seconds)\n", - "Cbc0010I After 5805000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (614.00 seconds)\n", - "Cbc0010I After 5806000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (614.09 seconds)\n", - "Cbc0010I After 5807000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (614.23 seconds)\n", - "Cbc0010I After 5808000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (614.37 seconds)\n", - "Cbc0010I After 5809000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (614.51 seconds)\n", - "Cbc0010I After 5810000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (614.81 seconds)\n", - "Cbc0010I After 5811000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (614.93 seconds)\n", - "Cbc0010I After 5812000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (615.05 seconds)\n", - "Cbc0010I After 5813000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (615.16 seconds)\n", - "Cbc0010I After 5814000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (615.26 seconds)\n", - "Cbc0010I After 5815000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (615.35 seconds)\n", - "Cbc0010I After 5816000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (615.44 seconds)\n", - "Cbc0010I After 5817000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (615.56 seconds)\n", - "Cbc0010I After 5818000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (615.65 seconds)\n", - "Cbc0010I After 5819000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (615.75 seconds)\n", - "Cbc0010I After 5820000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (615.83 seconds)\n", - "Cbc0010I After 5821000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (615.90 seconds)\n", - "Cbc0010I After 5822000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (615.98 seconds)\n", - "Cbc0010I After 5823000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (616.10 seconds)\n", - "Cbc0010I After 5824000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (616.29 seconds)\n", - "Cbc0010I After 5825000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (616.42 seconds)\n", - "Cbc0010I After 5826000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (616.49 seconds)\n", - "Cbc0010I After 5827000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (616.55 seconds)\n", - "Cbc0010I After 5828000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (616.62 seconds)\n", - "Cbc0010I After 5829000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (616.69 seconds)\n", - "Cbc0010I After 5830000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (616.75 seconds)\n", - "Cbc0010I After 5831000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (616.80 seconds)\n", - "Cbc0010I After 5832000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (616.85 seconds)\n", - "Cbc0010I After 5833000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (616.90 seconds)\n", - "Cbc0010I After 5834000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (616.95 seconds)\n", - "Cbc0010I After 5835000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (617.05 seconds)\n", - "Cbc0010I After 5836000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (617.10 seconds)\n", - "Cbc0010I After 5837000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (617.16 seconds)\n", - "Cbc0010I After 5838000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (617.21 seconds)\n", - "Cbc0010I After 5839000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (617.27 seconds)\n", - "Cbc0010I After 5840000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (617.31 seconds)\n", - "Cbc0010I After 5841000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (617.36 seconds)\n", - "Cbc0010I After 5842000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (617.42 seconds)\n", - "Cbc0010I After 5843000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (617.47 seconds)\n", - "Cbc0010I After 5844000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (617.51 seconds)\n", - "Cbc0010I After 5845000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (617.56 seconds)\n", - "Cbc0010I After 5846000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (617.60 seconds)\n", - "Cbc0010I After 5847000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (617.67 seconds)\n", - "Cbc0010I After 5848000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (617.71 seconds)\n", - "Cbc0010I After 5849000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (617.77 seconds)\n", - "Cbc0010I After 5850000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (617.81 seconds)\n", - "Cbc0010I After 5851000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (617.85 seconds)\n", - "Cbc0010I After 5852000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (617.90 seconds)\n", - "Cbc0010I After 5853000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (617.95 seconds)\n", - "Cbc0010I After 5854000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (618.03 seconds)\n", - "Cbc0010I After 5855000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (618.07 seconds)\n", - "Cbc0010I After 5856000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (618.10 seconds)\n", - "Cbc0010I After 5857000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (618.13 seconds)\n", - "Cbc0010I After 5858000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (618.18 seconds)\n", - "Cbc0010I After 5859000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (618.25 seconds)\n", - "Cbc0010I After 5860000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (618.33 seconds)\n", - "Cbc0010I After 5861000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (618.44 seconds)\n", - "Cbc0010I After 5862000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (618.53 seconds)\n", - "Cbc0010I After 5863000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (618.64 seconds)\n", - "Cbc0010I After 5864000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (618.71 seconds)\n", - "Cbc0010I After 5865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (618.77 seconds)\n", - "Cbc0010I After 5866000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (618.82 seconds)\n", - "Cbc0010I After 5867000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (618.87 seconds)\n", - "Cbc0010I After 5868000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (618.91 seconds)\n", - "Cbc0010I After 5869000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (618.98 seconds)\n", - "Cbc0010I After 5870000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (619.03 seconds)\n", - "Cbc0010I After 5871000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (619.09 seconds)\n", - "Cbc0010I After 5872000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (619.17 seconds)\n", - "Cbc0010I After 5873000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (619.21 seconds)\n", - "Cbc0010I After 5874000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (619.24 seconds)\n", - "Cbc0010I After 5875000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (619.28 seconds)\n", - "Cbc0010I After 5876000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (619.31 seconds)\n", - "Cbc0010I After 5877000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (619.37 seconds)\n", - "Cbc0010I After 5878000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (619.41 seconds)\n", - "Cbc0010I After 5879000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (619.49 seconds)\n", - "Cbc0010I After 5880000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (619.57 seconds)\n", - "Cbc0010I After 5881000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (619.65 seconds)\n", - "Cbc0010I After 5882000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (619.73 seconds)\n", - "Cbc0010I After 5883000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (619.80 seconds)\n", - "Cbc0010I After 5884000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (619.88 seconds)\n", - "Cbc0010I After 5885000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (619.96 seconds)\n", - "Cbc0010I After 5886000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (620.05 seconds)\n", - "Cbc0010I After 5887000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (620.15 seconds)\n", - "Cbc0010I After 5888000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (620.24 seconds)\n", - "Cbc0010I After 5889000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (620.32 seconds)\n", - "Cbc0010I After 5890000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (620.44 seconds)\n", - "Cbc0010I After 5891000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (620.49 seconds)\n", - "Cbc0010I After 5892000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (620.53 seconds)\n", - "Cbc0010I After 5893000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (620.57 seconds)\n", - "Cbc0010I After 5894000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (620.62 seconds)\n", - "Cbc0010I After 5895000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (620.67 seconds)\n", - "Cbc0010I After 5896000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (620.71 seconds)\n", - "Cbc0010I After 5897000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (620.75 seconds)\n", - "Cbc0010I After 5898000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (620.80 seconds)\n", - "Cbc0010I After 5899000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (620.85 seconds)\n", - "Cbc0010I After 5900000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (620.89 seconds)\n", - "Cbc0010I After 5901000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (620.94 seconds)\n", - "Cbc0010I After 5902000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (620.99 seconds)\n", - "Cbc0010I After 5903000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (621.06 seconds)\n", - "Cbc0010I After 5904000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (621.11 seconds)\n", - "Cbc0010I After 5905000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (621.19 seconds)\n", - "Cbc0010I After 5906000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (621.26 seconds)\n", - "Cbc0010I After 5907000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (621.31 seconds)\n", - "Cbc0010I After 5908000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (621.37 seconds)\n", - "Cbc0010I After 5909000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (621.41 seconds)\n", - "Cbc0010I After 5910000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (621.48 seconds)\n", - "Cbc0010I After 5911000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (621.55 seconds)\n", - "Cbc0010I After 5912000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (621.62 seconds)\n", - "Cbc0010I After 5913000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (621.73 seconds)\n", - "Cbc0010I After 5914000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (621.83 seconds)\n", - "Cbc0010I After 5915000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (621.92 seconds)\n", - "Cbc0010I After 5916000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (622.05 seconds)\n", - "Cbc0010I After 5917000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (622.18 seconds)\n", - "Cbc0010I After 5918000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (622.29 seconds)\n", - "Cbc0010I After 5919000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (622.47 seconds)\n", - "Cbc0010I After 5920000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (622.56 seconds)\n", - "Cbc0010I After 5921000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (622.66 seconds)\n", - "Cbc0010I After 5922000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (622.74 seconds)\n", - "Cbc0010I After 5923000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (622.78 seconds)\n", - "Cbc0010I After 5924000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (622.83 seconds)\n", - "Cbc0010I After 5925000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (622.88 seconds)\n", - "Cbc0010I After 5926000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (622.94 seconds)\n", - "Cbc0010I After 5927000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.00 seconds)\n", - "Cbc0010I After 5928000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (623.06 seconds)\n", - "Cbc0010I After 5929000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (623.11 seconds)\n", - "Cbc0010I After 5930000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.17 seconds)\n", - "Cbc0010I After 5931000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (623.23 seconds)\n", - "Cbc0010I After 5932000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (623.28 seconds)\n", - "Cbc0010I After 5933000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (623.34 seconds)\n", - "Cbc0010I After 5934000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (623.39 seconds)\n", - "Cbc0010I After 5935000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (623.46 seconds)\n", - "Cbc0010I After 5936000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (623.51 seconds)\n", - "Cbc0010I After 5937000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (623.58 seconds)\n", - "Cbc0010I After 5938000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (623.64 seconds)\n", - "Cbc0010I After 5939000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (623.71 seconds)\n", - "Cbc0010I After 5940000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (623.79 seconds)\n", - "Cbc0010I After 5941000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (623.87 seconds)\n", - "Cbc0010I After 5942000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (623.92 seconds)\n", - "Cbc0010I After 5943000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (623.98 seconds)\n", - "Cbc0010I After 5944000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (624.09 seconds)\n", - "Cbc0010I After 5945000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.15 seconds)\n", - "Cbc0010I After 5946000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (624.20 seconds)\n", - "Cbc0010I After 5947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (624.25 seconds)\n", - "Cbc0010I After 5948000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (624.34 seconds)\n", - "Cbc0010I After 5949000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.41 seconds)\n", - "Cbc0010I After 5950000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.51 seconds)\n", - "Cbc0010I After 5951000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (624.58 seconds)\n", - "Cbc0010I After 5952000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.65 seconds)\n", - "Cbc0010I After 5953000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (624.71 seconds)\n", - "Cbc0010I After 5954000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (624.75 seconds)\n", - "Cbc0010I After 5955000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (624.80 seconds)\n", - "Cbc0010I After 5956000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (624.84 seconds)\n", - "Cbc0010I After 5957000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (624.88 seconds)\n", - "Cbc0010I After 5958000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (624.92 seconds)\n", - "Cbc0010I After 5959000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (624.98 seconds)\n", - "Cbc0010I After 5960000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (625.01 seconds)\n", - "Cbc0010I After 5961000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (625.06 seconds)\n", - "Cbc0010I After 5962000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (625.09 seconds)\n", - "Cbc0010I After 5963000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (625.12 seconds)\n", - "Cbc0010I After 5964000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (625.17 seconds)\n", - "Cbc0010I After 5965000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (625.22 seconds)\n", - "Cbc0010I After 5966000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (625.27 seconds)\n", - "Cbc0010I After 5967000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (625.32 seconds)\n", - "Cbc0010I After 5968000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (625.41 seconds)\n", - "Cbc0010I After 5969000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (625.51 seconds)\n", - "Cbc0010I After 5970000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (625.61 seconds)\n", - "Cbc0010I After 5971000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (625.70 seconds)\n", - "Cbc0010I After 5972000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (625.81 seconds)\n", - "Cbc0010I After 5973000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (625.90 seconds)\n", - "Cbc0010I After 5974000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (625.99 seconds)\n", - "Cbc0010I After 5975000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (626.08 seconds)\n", - "Cbc0010I After 5976000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (626.14 seconds)\n", - "Cbc0010I After 5977000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (626.23 seconds)\n", - "Cbc0010I After 5978000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (626.31 seconds)\n", - "Cbc0010I After 5979000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (626.40 seconds)\n", - "Cbc0010I After 5980000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (626.50 seconds)\n", - "Cbc0010I After 5981000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (626.61 seconds)\n", - "Cbc0010I After 5982000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (626.79 seconds)\n", - "Cbc0010I After 5983000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (626.92 seconds)\n", - "Cbc0010I After 5984000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (626.99 seconds)\n", - "Cbc0010I After 5985000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.06 seconds)\n", - "Cbc0010I After 5986000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (627.15 seconds)\n", - "Cbc0010I After 5987000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.22 seconds)\n", - "Cbc0010I After 5988000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.29 seconds)\n", - "Cbc0010I After 5989000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (627.34 seconds)\n", - "Cbc0010I After 5990000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (627.39 seconds)\n", - "Cbc0010I After 5991000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (627.45 seconds)\n", - "Cbc0010I After 5992000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (627.53 seconds)\n", - "Cbc0010I After 5993000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (627.57 seconds)\n", - "Cbc0010I After 5994000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (627.62 seconds)\n", - "Cbc0010I After 5995000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.67 seconds)\n", - "Cbc0010I After 5996000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (627.74 seconds)\n", - "Cbc0010I After 5997000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (627.79 seconds)\n", - "Cbc0010I After 5998000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (627.82 seconds)\n", - "Cbc0010I After 5999000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (627.87 seconds)\n", - "Cbc0010I After 6000000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (627.92 seconds)\n", - "Cbc0010I After 6001000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (627.99 seconds)\n", - "Cbc0010I After 6002000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (628.03 seconds)\n", - "Cbc0010I After 6003000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.08 seconds)\n", - "Cbc0010I After 6004000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (628.12 seconds)\n", - "Cbc0010I After 6005000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (628.16 seconds)\n", - "Cbc0010I After 6006000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (628.20 seconds)\n", - "Cbc0010I After 6007000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (628.26 seconds)\n", - "Cbc0010I After 6008000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (628.32 seconds)\n", - "Cbc0010I After 6009000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (628.38 seconds)\n", - "Cbc0010I After 6010000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (628.43 seconds)\n", - "Cbc0010I After 6011000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (628.48 seconds)\n", - "Cbc0010I After 6012000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (628.52 seconds)\n", - "Cbc0010I After 6013000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (628.56 seconds)\n", - "Cbc0010I After 6014000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (628.60 seconds)\n", - "Cbc0010I After 6015000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (628.65 seconds)\n", - "Cbc0010I After 6016000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (628.71 seconds)\n", - "Cbc0010I After 6017000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.76 seconds)\n", - "Cbc0010I After 6018000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (628.81 seconds)\n", - "Cbc0010I After 6019000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (628.85 seconds)\n", - "Cbc0010I After 6020000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (628.89 seconds)\n", - "Cbc0010I After 6021000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (628.94 seconds)\n", - "Cbc0010I After 6022000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (628.98 seconds)\n", - "Cbc0010I After 6023000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (629.03 seconds)\n", - "Cbc0010I After 6024000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (629.08 seconds)\n", - "Cbc0010I After 6025000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (629.15 seconds)\n", - "Cbc0010I After 6026000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (629.23 seconds)\n", - "Cbc0010I After 6027000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (629.33 seconds)\n", - "Cbc0010I After 6028000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (629.37 seconds)\n", - "Cbc0010I After 6029000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (629.41 seconds)\n", - "Cbc0010I After 6030000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (629.45 seconds)\n", - "Cbc0010I After 6031000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (629.51 seconds)\n", - "Cbc0010I After 6032000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (629.57 seconds)\n", - "Cbc0010I After 6033000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (629.66 seconds)\n", - "Cbc0010I After 6034000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (629.72 seconds)\n", - "Cbc0010I After 6035000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (629.76 seconds)\n", - "Cbc0010I After 6036000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (629.82 seconds)\n", - "Cbc0010I After 6037000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (629.87 seconds)\n", - "Cbc0010I After 6038000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (629.91 seconds)\n", - "Cbc0010I After 6039000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (629.95 seconds)\n", - "Cbc0010I After 6040000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (629.99 seconds)\n", - "Cbc0010I After 6041000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (630.04 seconds)\n", - "Cbc0010I After 6042000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (630.08 seconds)\n", - "Cbc0010I After 6043000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (630.13 seconds)\n", - "Cbc0010I After 6044000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (630.18 seconds)\n", - "Cbc0010I After 6045000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (630.23 seconds)\n", - "Cbc0010I After 6046000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.27 seconds)\n", - "Cbc0010I After 6047000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (630.31 seconds)\n", - "Cbc0010I After 6048000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (630.36 seconds)\n", - "Cbc0010I After 6049000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (630.41 seconds)\n", - "Cbc0010I After 6050000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.47 seconds)\n", - "Cbc0010I After 6051000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (630.52 seconds)\n", - "Cbc0010I After 6052000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (630.57 seconds)\n", - "Cbc0010I After 6053000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (630.62 seconds)\n", - "Cbc0010I After 6054000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (630.66 seconds)\n", - "Cbc0010I After 6055000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (630.70 seconds)\n", - "Cbc0010I After 6056000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (630.74 seconds)\n", - "Cbc0010I After 6057000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (630.79 seconds)\n", - "Cbc0010I After 6058000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (630.85 seconds)\n", - "Cbc0010I After 6059000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.90 seconds)\n", - "Cbc0010I After 6060000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (630.96 seconds)\n", - "Cbc0010I After 6061000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (631.00 seconds)\n", - "Cbc0010I After 6062000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (631.06 seconds)\n", - "Cbc0010I After 6063000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (631.16 seconds)\n", - "Cbc0010I After 6064000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (631.24 seconds)\n", - "Cbc0010I After 6065000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (631.32 seconds)\n", - "Cbc0010I After 6066000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (631.40 seconds)\n", - "Cbc0010I After 6067000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (631.44 seconds)\n", - "Cbc0010I After 6068000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (631.48 seconds)\n", - "Cbc0010I After 6069000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (631.54 seconds)\n", - "Cbc0010I After 6070000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (631.58 seconds)\n", - "Cbc0010I After 6071000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (631.62 seconds)\n", - "Cbc0010I After 6072000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (631.66 seconds)\n", - "Cbc0010I After 6073000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (631.72 seconds)\n", - "Cbc0010I After 6074000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (631.81 seconds)\n", - "Cbc0010I After 6075000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (631.86 seconds)\n", - "Cbc0010I After 6076000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (631.91 seconds)\n", - "Cbc0010I After 6077000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (631.99 seconds)\n", - "Cbc0010I After 6078000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (632.09 seconds)\n", - "Cbc0010I After 6079000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (632.15 seconds)\n", - "Cbc0010I After 6080000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (632.22 seconds)\n", - "Cbc0010I After 6081000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (632.32 seconds)\n", - "Cbc0010I After 6082000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (632.38 seconds)\n", - "Cbc0010I After 6083000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (632.44 seconds)\n", - "Cbc0010I After 6084000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (632.51 seconds)\n", - "Cbc0010I After 6085000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (632.58 seconds)\n", - "Cbc0010I After 6086000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (632.66 seconds)\n", - "Cbc0010I After 6087000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (632.73 seconds)\n", - "Cbc0010I After 6088000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (632.80 seconds)\n", - "Cbc0010I After 6089000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (632.86 seconds)\n", - "Cbc0010I After 6090000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (632.93 seconds)\n", - "Cbc0010I After 6091000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (632.99 seconds)\n", - "Cbc0010I After 6092000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (633.05 seconds)\n", - "Cbc0010I After 6093000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (633.12 seconds)\n", - "Cbc0010I After 6094000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (633.19 seconds)\n", - "Cbc0010I After 6095000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (633.27 seconds)\n", - "Cbc0010I After 6096000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (633.36 seconds)\n", - "Cbc0010I After 6097000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (633.45 seconds)\n", - "Cbc0010I After 6098000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (633.57 seconds)\n", - "Cbc0010I After 6099000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (633.68 seconds)\n", - "Cbc0010I After 6100000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (633.77 seconds)\n", - "Cbc0010I After 6101000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (633.85 seconds)\n", - "Cbc0010I After 6102000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (633.95 seconds)\n", - "Cbc0010I After 6103000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (634.12 seconds)\n", - "Cbc0010I After 6104000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (634.34 seconds)\n", - "Cbc0010I After 6105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (634.50 seconds)\n", - "Cbc0010I After 6106000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (634.65 seconds)\n", - "Cbc0010I After 6107000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (634.78 seconds)\n", - "Cbc0010I After 6108000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (634.91 seconds)\n", - "Cbc0010I After 6109000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (634.96 seconds)\n", - "Cbc0010I After 6110000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (635.01 seconds)\n", - "Cbc0010I After 6111000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (635.07 seconds)\n", - "Cbc0010I After 6112000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (635.16 seconds)\n", - "Cbc0010I After 6113000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (635.27 seconds)\n", - "Cbc0010I After 6114000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (635.34 seconds)\n", - "Cbc0010I After 6115000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (635.40 seconds)\n", - "Cbc0010I After 6116000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (635.45 seconds)\n", - "Cbc0010I After 6117000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (635.51 seconds)\n", - "Cbc0010I After 6118000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (635.57 seconds)\n", - "Cbc0010I After 6119000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (635.64 seconds)\n", - "Cbc0010I After 6120000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (635.74 seconds)\n", - "Cbc0010I After 6121000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (635.83 seconds)\n", - "Cbc0010I After 6122000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (635.98 seconds)\n", - "Cbc0010I After 6123000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (636.11 seconds)\n", - "Cbc0010I After 6124000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (636.34 seconds)\n", - "Cbc0010I After 6125000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (636.56 seconds)\n", - "Cbc0010I After 6126000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (636.73 seconds)\n", - "Cbc0010I After 6127000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (636.96 seconds)\n", - "Cbc0010I After 6128000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (637.13 seconds)\n", - "Cbc0010I After 6129000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (637.28 seconds)\n", - "Cbc0010I After 6130000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (637.40 seconds)\n", - "Cbc0010I After 6131000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (637.52 seconds)\n", - "Cbc0010I After 6132000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (637.62 seconds)\n", - "Cbc0010I After 6133000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (637.71 seconds)\n", - "Cbc0010I After 6134000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (637.77 seconds)\n", - "Cbc0010I After 6135000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (637.83 seconds)\n", - "Cbc0010I After 6136000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (637.94 seconds)\n", - "Cbc0010I After 6137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (638.02 seconds)\n", - "Cbc0010I After 6138000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (638.11 seconds)\n", - "Cbc0010I After 6139000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (638.18 seconds)\n", - "Cbc0010I After 6140000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.25 seconds)\n", - "Cbc0010I After 6141000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (638.33 seconds)\n", - "Cbc0010I After 6142000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (638.41 seconds)\n", - "Cbc0010I After 6143000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (638.47 seconds)\n", - "Cbc0010I After 6144000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (638.53 seconds)\n", - "Cbc0010I After 6145000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.63 seconds)\n", - "Cbc0010I After 6146000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (638.73 seconds)\n", - "Cbc0010I After 6147000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (638.78 seconds)\n", - "Cbc0010I After 6148000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.83 seconds)\n", - "Cbc0010I After 6149000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (638.88 seconds)\n", - "Cbc0010I After 6150000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (638.98 seconds)\n", - "Cbc0010I After 6151000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (639.04 seconds)\n", - "Cbc0010I After 6152000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (639.10 seconds)\n", - "Cbc0010I After 6153000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (639.19 seconds)\n", - "Cbc0010I After 6154000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.28 seconds)\n", - "Cbc0010I After 6155000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (639.37 seconds)\n", - "Cbc0010I After 6156000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (639.48 seconds)\n", - "Cbc0010I After 6157000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.58 seconds)\n", - "Cbc0010I After 6158000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (639.68 seconds)\n", - "Cbc0010I After 6159000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (639.78 seconds)\n", - "Cbc0010I After 6160000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (639.90 seconds)\n", - "Cbc0010I After 6161000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (639.98 seconds)\n", - "Cbc0010I After 6162000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (640.07 seconds)\n", - "Cbc0010I After 6163000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (640.15 seconds)\n", - "Cbc0010I After 6164000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (640.23 seconds)\n", - "Cbc0010I After 6165000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (640.36 seconds)\n", - "Cbc0010I After 6166000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (640.51 seconds)\n", - "Cbc0010I After 6167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (640.64 seconds)\n", - "Cbc0010I After 6168000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (640.79 seconds)\n", - "Cbc0010I After 6169000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (640.90 seconds)\n", - "Cbc0010I After 6170000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (641.00 seconds)\n", - "Cbc0010I After 6171000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (641.13 seconds)\n", - "Cbc0010I After 6172000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (641.30 seconds)\n", - "Cbc0010I After 6173000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (641.40 seconds)\n", - "Cbc0010I After 6174000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (641.54 seconds)\n", - "Cbc0010I After 6175000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (641.74 seconds)\n", - "Cbc0010I After 6176000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (641.88 seconds)\n", - "Cbc0010I After 6177000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (641.95 seconds)\n", - "Cbc0010I After 6178000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (642.04 seconds)\n", - "Cbc0010I After 6179000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (642.11 seconds)\n", - "Cbc0010I After 6180000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (642.18 seconds)\n", - "Cbc0010I After 6181000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (642.29 seconds)\n", - "Cbc0010I After 6182000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (642.39 seconds)\n", - "Cbc0010I After 6183000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (642.48 seconds)\n", - "Cbc0010I After 6184000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (642.58 seconds)\n", - "Cbc0010I After 6185000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (642.66 seconds)\n", - "Cbc0010I After 6186000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (642.75 seconds)\n", - "Cbc0010I After 6187000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (642.81 seconds)\n", - "Cbc0010I After 6188000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (642.88 seconds)\n", - "Cbc0010I After 6189000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (642.99 seconds)\n", - "Cbc0010I After 6190000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (643.10 seconds)\n", - "Cbc0010I After 6191000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (643.15 seconds)\n", - "Cbc0010I After 6192000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (643.21 seconds)\n", - "Cbc0010I After 6193000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (643.28 seconds)\n", - "Cbc0010I After 6194000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (643.33 seconds)\n", - "Cbc0010I After 6195000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (643.38 seconds)\n", - "Cbc0010I After 6196000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (643.45 seconds)\n", - "Cbc0010I After 6197000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (643.52 seconds)\n", - "Cbc0010I After 6198000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (643.58 seconds)\n", - "Cbc0010I After 6199000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (643.64 seconds)\n", - "Cbc0010I After 6200000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (643.70 seconds)\n", - "Cbc0010I After 6201000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (643.77 seconds)\n", - "Cbc0010I After 6202000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (643.83 seconds)\n", - "Cbc0010I After 6203000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (643.89 seconds)\n", - "Cbc0010I After 6204000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (643.95 seconds)\n", - "Cbc0010I After 6205000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (644.02 seconds)\n", - "Cbc0010I After 6206000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (644.08 seconds)\n", - "Cbc0010I After 6207000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (644.13 seconds)\n", - "Cbc0010I After 6208000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (644.19 seconds)\n", - "Cbc0010I After 6209000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (644.25 seconds)\n", - "Cbc0010I After 6210000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (644.31 seconds)\n", - "Cbc0010I After 6211000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (644.39 seconds)\n", - "Cbc0010I After 6212000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (644.46 seconds)\n", - "Cbc0010I After 6213000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (644.51 seconds)\n", - "Cbc0010I After 6214000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (644.57 seconds)\n", - "Cbc0010I After 6215000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (644.63 seconds)\n", - "Cbc0010I After 6216000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (644.71 seconds)\n", - "Cbc0010I After 6217000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (644.78 seconds)\n", - "Cbc0010I After 6218000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (644.85 seconds)\n", - "Cbc0010I After 6219000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (644.93 seconds)\n", - "Cbc0010I After 6220000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (645.00 seconds)\n", - "Cbc0010I After 6221000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (645.09 seconds)\n", - "Cbc0010I After 6222000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (645.17 seconds)\n", - "Cbc0010I After 6223000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (645.26 seconds)\n", - "Cbc0010I After 6224000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (645.34 seconds)\n", - "Cbc0010I After 6225000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (645.44 seconds)\n", - "Cbc0010I After 6226000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (645.58 seconds)\n", - "Cbc0010I After 6227000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (645.67 seconds)\n", - "Cbc0010I After 6228000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (645.76 seconds)\n", - "Cbc0010I After 6229000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (645.84 seconds)\n", - "Cbc0010I After 6230000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (645.95 seconds)\n", - "Cbc0010I After 6231000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (646.02 seconds)\n", - "Cbc0010I After 6232000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (646.10 seconds)\n", - "Cbc0010I After 6233000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (646.20 seconds)\n", - "Cbc0010I After 6234000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (646.30 seconds)\n", - "Cbc0010I After 6235000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (646.41 seconds)\n", - "Cbc0010I After 6236000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (646.52 seconds)\n", - "Cbc0010I After 6237000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (646.64 seconds)\n", - "Cbc0010I After 6238000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (646.71 seconds)\n", - "Cbc0010I After 6239000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (646.77 seconds)\n", - "Cbc0010I After 6240000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (646.83 seconds)\n", - "Cbc0010I After 6241000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (646.90 seconds)\n", - "Cbc0010I After 6242000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (646.96 seconds)\n", - "Cbc0010I After 6243000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (647.01 seconds)\n", - "Cbc0010I After 6244000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (647.07 seconds)\n", - "Cbc0010I After 6245000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (647.15 seconds)\n", - "Cbc0010I After 6246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (647.24 seconds)\n", - "Cbc0010I After 6247000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (647.31 seconds)\n", - "Cbc0010I After 6248000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (647.38 seconds)\n", - "Cbc0010I After 6249000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (647.45 seconds)\n", - "Cbc0010I After 6250000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (647.53 seconds)\n", - "Cbc0010I After 6251000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (647.60 seconds)\n", - "Cbc0010I After 6252000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (647.67 seconds)\n", - "Cbc0010I After 6253000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (647.75 seconds)\n", - "Cbc0010I After 6254000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (647.84 seconds)\n", - "Cbc0010I After 6255000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (647.92 seconds)\n", - "Cbc0010I After 6256000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (648.02 seconds)\n", - "Cbc0010I After 6257000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (648.08 seconds)\n", - "Cbc0010I After 6258000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (648.15 seconds)\n", - "Cbc0010I After 6259000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (648.26 seconds)\n", - "Cbc0010I After 6260000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (648.35 seconds)\n", - "Cbc0010I After 6261000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (648.45 seconds)\n", - "Cbc0010I After 6262000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (648.56 seconds)\n", - "Cbc0010I After 6263000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (648.63 seconds)\n", - "Cbc0010I After 6264000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (648.70 seconds)\n", - "Cbc0010I After 6265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (648.78 seconds)\n", - "Cbc0010I After 6266000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (648.85 seconds)\n", - "Cbc0010I After 6267000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (648.92 seconds)\n", - "Cbc0010I After 6268000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (648.99 seconds)\n", - "Cbc0010I After 6269000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (649.08 seconds)\n", - "Cbc0010I After 6270000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (649.15 seconds)\n", - "Cbc0010I After 6271000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (649.22 seconds)\n", - "Cbc0010I After 6272000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (649.32 seconds)\n", - "Cbc0010I After 6273000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (649.38 seconds)\n", - "Cbc0010I After 6274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (649.44 seconds)\n", - "Cbc0010I After 6275000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (649.51 seconds)\n", - "Cbc0010I After 6276000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (649.56 seconds)\n", - "Cbc0010I After 6277000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (649.64 seconds)\n", - "Cbc0010I After 6278000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (649.72 seconds)\n", - "Cbc0010I After 6279000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (649.80 seconds)\n", - "Cbc0010I After 6280000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (649.86 seconds)\n", - "Cbc0010I After 6281000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (649.92 seconds)\n", - "Cbc0010I After 6282000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (649.99 seconds)\n", - "Cbc0010I After 6283000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (650.04 seconds)\n", - "Cbc0010I After 6284000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (650.09 seconds)\n", - "Cbc0010I After 6285000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (650.14 seconds)\n", - "Cbc0010I After 6286000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (650.20 seconds)\n", - "Cbc0010I After 6287000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (650.27 seconds)\n", - "Cbc0010I After 6288000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (650.35 seconds)\n", - "Cbc0010I After 6289000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (650.44 seconds)\n", - "Cbc0010I After 6290000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (650.54 seconds)\n", - "Cbc0010I After 6291000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (650.64 seconds)\n", - "Cbc0010I After 6292000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (650.72 seconds)\n", - "Cbc0010I After 6293000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (650.80 seconds)\n", - "Cbc0010I After 6294000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (650.90 seconds)\n", - "Cbc0010I After 6295000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (651.01 seconds)\n", - "Cbc0010I After 6296000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (651.10 seconds)\n", - "Cbc0010I After 6297000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (651.18 seconds)\n", - "Cbc0010I After 6298000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (651.25 seconds)\n", - "Cbc0010I After 6299000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (651.33 seconds)\n", - "Cbc0010I After 6300000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (651.46 seconds)\n", - "Cbc0010I After 6301000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (651.58 seconds)\n", - "Cbc0010I After 6302000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (651.68 seconds)\n", - "Cbc0010I After 6303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (651.79 seconds)\n", - "Cbc0010I After 6304000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (651.88 seconds)\n", - "Cbc0010I After 6305000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (651.99 seconds)\n", - "Cbc0010I After 6306000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (652.08 seconds)\n", - "Cbc0010I After 6307000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (652.19 seconds)\n", - "Cbc0010I After 6308000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (652.28 seconds)\n", - "Cbc0010I After 6309000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (652.40 seconds)\n", - "Cbc0010I After 6310000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (652.52 seconds)\n", - "Cbc0010I After 6311000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (652.61 seconds)\n", - "Cbc0010I After 6312000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (652.70 seconds)\n", - "Cbc0010I After 6313000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (652.81 seconds)\n", - "Cbc0010I After 6314000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (652.90 seconds)\n", - "Cbc0010I After 6315000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (653.01 seconds)\n", - "Cbc0010I After 6316000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (653.07 seconds)\n", - "Cbc0010I After 6317000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (653.12 seconds)\n", - "Cbc0010I After 6318000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (653.18 seconds)\n", - "Cbc0010I After 6319000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (653.23 seconds)\n", - "Cbc0010I After 6320000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (653.30 seconds)\n", - "Cbc0010I After 6321000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (653.35 seconds)\n", - "Cbc0010I After 6322000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (653.42 seconds)\n", - "Cbc0010I After 6323000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (653.48 seconds)\n", - "Cbc0010I After 6324000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (653.54 seconds)\n", - "Cbc0010I After 6325000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (653.59 seconds)\n", - "Cbc0010I After 6326000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (653.65 seconds)\n", - "Cbc0010I After 6327000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (653.70 seconds)\n", - "Cbc0010I After 6328000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (653.77 seconds)\n", - "Cbc0010I After 6329000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (653.81 seconds)\n", - "Cbc0010I After 6330000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (653.86 seconds)\n", - "Cbc0010I After 6331000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (653.93 seconds)\n", - "Cbc0010I After 6332000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (653.98 seconds)\n", - "Cbc0010I After 6333000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (654.06 seconds)\n", - "Cbc0010I After 6334000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (654.12 seconds)\n", - "Cbc0010I After 6335000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (654.20 seconds)\n", - "Cbc0010I After 6336000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (654.31 seconds)\n", - "Cbc0010I After 6337000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (654.44 seconds)\n", - "Cbc0010I After 6338000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (654.59 seconds)\n", - "Cbc0010I After 6339000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (654.74 seconds)\n", - "Cbc0010I After 6340000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (654.83 seconds)\n", - "Cbc0010I After 6341000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (654.90 seconds)\n", - "Cbc0010I After 6342000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (654.96 seconds)\n", - "Cbc0010I After 6343000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (655.01 seconds)\n", - "Cbc0010I After 6344000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (655.07 seconds)\n", - "Cbc0010I After 6345000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (655.15 seconds)\n", - "Cbc0010I After 6346000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (655.20 seconds)\n", - "Cbc0010I After 6347000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (655.25 seconds)\n", - "Cbc0010I After 6348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (655.31 seconds)\n", - "Cbc0010I After 6349000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (655.37 seconds)\n", - "Cbc0010I After 6350000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (655.48 seconds)\n", - "Cbc0010I After 6351000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (655.58 seconds)\n", - "Cbc0010I After 6352000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (655.68 seconds)\n", - "Cbc0010I After 6353000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (655.79 seconds)\n", - "Cbc0010I After 6354000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (655.91 seconds)\n", - "Cbc0010I After 6355000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (655.98 seconds)\n", - "Cbc0010I After 6356000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (656.06 seconds)\n", - "Cbc0010I After 6357000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (656.15 seconds)\n", - "Cbc0010I After 6358000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (656.27 seconds)\n", - "Cbc0010I After 6359000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (656.36 seconds)\n", - "Cbc0010I After 6360000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (656.45 seconds)\n", - "Cbc0010I After 6361000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (656.56 seconds)\n", - "Cbc0010I After 6362000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (656.63 seconds)\n", - "Cbc0010I After 6363000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (656.69 seconds)\n", - "Cbc0010I After 6364000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (656.75 seconds)\n", - "Cbc0010I After 6365000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (656.83 seconds)\n", - "Cbc0010I After 6366000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (656.88 seconds)\n", - "Cbc0010I After 6367000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (656.93 seconds)\n", - "Cbc0010I After 6368000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (656.98 seconds)\n", - "Cbc0010I After 6369000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (657.02 seconds)\n", - "Cbc0010I After 6370000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (657.07 seconds)\n", - "Cbc0010I After 6371000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (657.13 seconds)\n", - "Cbc0010I After 6372000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (657.20 seconds)\n", - "Cbc0010I After 6373000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (657.29 seconds)\n", - "Cbc0010I After 6374000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (657.36 seconds)\n", - "Cbc0010I After 6375000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (657.44 seconds)\n", - "Cbc0010I After 6376000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (657.51 seconds)\n", - "Cbc0010I After 6377000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (657.56 seconds)\n", - "Cbc0010I After 6378000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (657.62 seconds)\n", - "Cbc0010I After 6379000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (657.68 seconds)\n", - "Cbc0010I After 6380000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (657.75 seconds)\n", - "Cbc0010I After 6381000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (657.84 seconds)\n", - "Cbc0010I After 6382000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (657.95 seconds)\n", - "Cbc0010I After 6383000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (658.05 seconds)\n", - "Cbc0010I After 6384000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (658.13 seconds)\n", - "Cbc0010I After 6385000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (658.22 seconds)\n", - "Cbc0010I After 6386000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (658.34 seconds)\n", - "Cbc0010I After 6387000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (658.50 seconds)\n", - "Cbc0010I After 6388000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (658.62 seconds)\n", - "Cbc0010I After 6389000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (658.70 seconds)\n", - "Cbc0010I After 6390000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (658.80 seconds)\n", - "Cbc0010I After 6391000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (658.89 seconds)\n", - "Cbc0010I After 6392000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (658.96 seconds)\n", - "Cbc0010I After 6393000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (659.11 seconds)\n", - "Cbc0010I After 6394000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (659.25 seconds)\n", - "Cbc0010I After 6395000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (659.31 seconds)\n", - "Cbc0010I After 6396000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (659.37 seconds)\n", - "Cbc0010I After 6397000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (659.45 seconds)\n", - "Cbc0010I After 6398000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (659.51 seconds)\n", - "Cbc0010I After 6399000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (659.56 seconds)\n", - "Cbc0010I After 6400000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (659.61 seconds)\n", - "Cbc0010I After 6401000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (659.69 seconds)\n", - "Cbc0010I After 6402000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (659.78 seconds)\n", - "Cbc0010I After 6403000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (659.90 seconds)\n", - "Cbc0010I After 6404000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (660.01 seconds)\n", - "Cbc0010I After 6405000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (660.15 seconds)\n", - "Cbc0010I After 6406000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (660.27 seconds)\n", - "Cbc0010I After 6407000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (660.40 seconds)\n", - "Cbc0010I After 6408000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (660.51 seconds)\n", - "Cbc0010I After 6409000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (660.61 seconds)\n", - "Cbc0010I After 6410000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (660.69 seconds)\n", - "Cbc0010I After 6411000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (660.76 seconds)\n", - "Cbc0010I After 6412000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (660.82 seconds)\n", - "Cbc0010I After 6413000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (660.91 seconds)\n", - "Cbc0010I After 6414000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (661.01 seconds)\n", - "Cbc0010I After 6415000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (661.16 seconds)\n", - "Cbc0010I After 6416000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (661.25 seconds)\n", - "Cbc0010I After 6417000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (661.30 seconds)\n", - "Cbc0010I After 6418000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (661.36 seconds)\n", - "Cbc0010I After 6419000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (661.42 seconds)\n", - "Cbc0010I After 6420000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (661.50 seconds)\n", - "Cbc0010I After 6421000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (661.58 seconds)\n", - "Cbc0010I After 6422000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (661.68 seconds)\n", - "Cbc0010I After 6423000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (661.81 seconds)\n", - "Cbc0010I After 6424000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (661.91 seconds)\n", - "Cbc0010I After 6425000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (662.08 seconds)\n", - "Cbc0010I After 6426000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (662.23 seconds)\n", - "Cbc0010I After 6427000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (662.32 seconds)\n", - "Cbc0010I After 6428000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (662.40 seconds)\n", - "Cbc0010I After 6429000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (662.48 seconds)\n", - "Cbc0010I After 6430000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (662.56 seconds)\n", - "Cbc0010I After 6431000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (662.62 seconds)\n", - "Cbc0010I After 6432000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (662.69 seconds)\n", - "Cbc0010I After 6433000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (662.79 seconds)\n", - "Cbc0010I After 6434000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (662.88 seconds)\n", - "Cbc0010I After 6435000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (662.92 seconds)\n", - "Cbc0010I After 6436000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (662.98 seconds)\n", - "Cbc0010I After 6437000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (663.02 seconds)\n", - "Cbc0010I After 6438000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (663.09 seconds)\n", - "Cbc0010I After 6439000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (663.16 seconds)\n", - "Cbc0010I After 6440000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (663.23 seconds)\n", - "Cbc0010I After 6441000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (663.34 seconds)\n", - "Cbc0010I After 6442000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (663.44 seconds)\n", - "Cbc0010I After 6443000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (663.60 seconds)\n", - "Cbc0010I After 6444000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (663.84 seconds)\n", - "Cbc0010I After 6445000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (663.95 seconds)\n", - "Cbc0010I After 6446000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (664.07 seconds)\n", - "Cbc0010I After 6447000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (664.17 seconds)\n", - "Cbc0010I After 6448000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (664.26 seconds)\n", - "Cbc0010I After 6449000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (664.34 seconds)\n", - "Cbc0010I After 6450000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (664.41 seconds)\n", - "Cbc0010I After 6451000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (664.48 seconds)\n", - "Cbc0010I After 6452000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (664.55 seconds)\n", - "Cbc0010I After 6453000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (664.65 seconds)\n", - "Cbc0010I After 6454000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (664.73 seconds)\n", - "Cbc0010I After 6455000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (664.80 seconds)\n", - "Cbc0010I After 6456000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (664.87 seconds)\n", - "Cbc0010I After 6457000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (664.96 seconds)\n", - "Cbc0010I After 6458000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (665.07 seconds)\n", - "Cbc0010I After 6459000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (665.17 seconds)\n", - "Cbc0010I After 6460000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (665.30 seconds)\n", - "Cbc0010I After 6461000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (665.38 seconds)\n", - "Cbc0010I After 6462000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (665.44 seconds)\n", - "Cbc0010I After 6463000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (665.49 seconds)\n", - "Cbc0010I After 6464000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (665.56 seconds)\n", - "Cbc0010I After 6465000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (665.65 seconds)\n", - "Cbc0010I After 6466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (665.72 seconds)\n", - "Cbc0010I After 6467000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (665.80 seconds)\n", - "Cbc0010I After 6468000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (665.85 seconds)\n", - "Cbc0010I After 6469000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (665.94 seconds)\n", - "Cbc0010I After 6470000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (666.01 seconds)\n", - "Cbc0010I After 6471000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (666.11 seconds)\n", - "Cbc0010I After 6472000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (666.25 seconds)\n", - "Cbc0010I After 6473000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (666.34 seconds)\n", - "Cbc0010I After 6474000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (666.40 seconds)\n", - "Cbc0010I After 6475000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (666.47 seconds)\n", - "Cbc0010I After 6476000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (666.56 seconds)\n", - "Cbc0010I After 6477000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (666.63 seconds)\n", - "Cbc0010I After 6478000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (666.70 seconds)\n", - "Cbc0010I After 6479000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (666.77 seconds)\n", - "Cbc0010I After 6480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (666.85 seconds)\n", - "Cbc0010I After 6481000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (666.91 seconds)\n", - "Cbc0010I After 6482000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (666.99 seconds)\n", - "Cbc0010I After 6483000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (667.06 seconds)\n", - "Cbc0010I After 6484000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (667.11 seconds)\n", - "Cbc0010I After 6485000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (667.16 seconds)\n", - "Cbc0010I After 6486000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (667.22 seconds)\n", - "Cbc0010I After 6487000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (667.30 seconds)\n", - "Cbc0010I After 6488000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (667.40 seconds)\n", - "Cbc0010I After 6489000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (667.50 seconds)\n", - "Cbc0010I After 6490000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (667.60 seconds)\n", - "Cbc0010I After 6491000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (667.71 seconds)\n", - "Cbc0010I After 6492000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (667.83 seconds)\n", - "Cbc0010I After 6493000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (667.95 seconds)\n", - "Cbc0010I After 6494000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (668.08 seconds)\n", - "Cbc0010I After 6495000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (668.14 seconds)\n", - "Cbc0010I After 6496000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (668.24 seconds)\n", - "Cbc0010I After 6497000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (668.31 seconds)\n", - "Cbc0010I After 6498000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (668.35 seconds)\n", - "Cbc0010I After 6499000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (668.40 seconds)\n", - "Cbc0010I After 6500000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (668.45 seconds)\n", - "Cbc0010I After 6501000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (668.49 seconds)\n", - "Cbc0010I After 6502000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (668.57 seconds)\n", - "Cbc0010I After 6503000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (668.63 seconds)\n", - "Cbc0010I After 6504000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (668.67 seconds)\n", - "Cbc0010I After 6505000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (668.74 seconds)\n", - "Cbc0010I After 6506000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (668.80 seconds)\n", - "Cbc0010I After 6507000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (668.92 seconds)\n", - "Cbc0010I After 6508000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (669.03 seconds)\n", - "Cbc0010I After 6509000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (669.15 seconds)\n", - "Cbc0010I After 6510000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (669.22 seconds)\n", - "Cbc0010I After 6511000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (669.29 seconds)\n", - "Cbc0010I After 6512000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (669.41 seconds)\n", - "Cbc0010I After 6513000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (669.51 seconds)\n", - "Cbc0010I After 6514000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (669.63 seconds)\n", - "Cbc0010I After 6515000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (669.71 seconds)\n", - "Cbc0010I After 6516000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (669.79 seconds)\n", - "Cbc0010I After 6517000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (669.84 seconds)\n", - "Cbc0010I After 6518000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (669.90 seconds)\n", - "Cbc0010I After 6519000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (669.95 seconds)\n", - "Cbc0010I After 6520000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (670.00 seconds)\n", - "Cbc0010I After 6521000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (670.06 seconds)\n", - "Cbc0010I After 6522000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.11 seconds)\n", - "Cbc0010I After 6523000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (670.18 seconds)\n", - "Cbc0010I After 6524000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (670.25 seconds)\n", - "Cbc0010I After 6525000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (670.36 seconds)\n", - "Cbc0010I After 6526000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (670.43 seconds)\n", - "Cbc0010I After 6527000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (670.56 seconds)\n", - "Cbc0010I After 6528000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.65 seconds)\n", - "Cbc0010I After 6529000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (670.73 seconds)\n", - "Cbc0010I After 6530000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (670.80 seconds)\n", - "Cbc0010I After 6531000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (670.90 seconds)\n", - "Cbc0010I After 6532000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (670.99 seconds)\n", - "Cbc0010I After 6533000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (671.07 seconds)\n", - "Cbc0010I After 6534000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (671.21 seconds)\n", - "Cbc0010I After 6535000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (671.32 seconds)\n", - "Cbc0010I After 6536000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (671.39 seconds)\n", - "Cbc0010I After 6537000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (671.48 seconds)\n", - "Cbc0010I After 6538000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (671.59 seconds)\n", - "Cbc0010I After 6539000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (671.68 seconds)\n", - "Cbc0010I After 6540000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (671.76 seconds)\n", - "Cbc0010I After 6541000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (671.82 seconds)\n", - "Cbc0010I After 6542000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (671.93 seconds)\n", - "Cbc0010I After 6543000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (672.01 seconds)\n", - "Cbc0010I After 6544000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (672.10 seconds)\n", - "Cbc0010I After 6545000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (672.18 seconds)\n", - "Cbc0010I After 6546000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (672.28 seconds)\n", - "Cbc0010I After 6547000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (672.36 seconds)\n", - "Cbc0010I After 6548000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (672.44 seconds)\n", - "Cbc0010I After 6549000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (672.52 seconds)\n", - "Cbc0010I After 6550000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (672.61 seconds)\n", - "Cbc0010I After 6551000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (672.68 seconds)\n", - "Cbc0010I After 6552000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (672.77 seconds)\n", - "Cbc0010I After 6553000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (672.82 seconds)\n", - "Cbc0010I After 6554000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (672.87 seconds)\n", - "Cbc0010I After 6555000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (672.94 seconds)\n", - "Cbc0010I After 6556000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (672.98 seconds)\n", - "Cbc0010I After 6557000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (673.07 seconds)\n", - "Cbc0010I After 6558000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (673.14 seconds)\n", - "Cbc0010I After 6559000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (673.22 seconds)\n", - "Cbc0010I After 6560000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (673.30 seconds)\n", - "Cbc0010I After 6561000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (673.38 seconds)\n", - "Cbc0010I After 6562000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (673.46 seconds)\n", - "Cbc0010I After 6563000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (673.55 seconds)\n", - "Cbc0010I After 6564000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (673.64 seconds)\n", - "Cbc0010I After 6565000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (673.77 seconds)\n", - "Cbc0010I After 6566000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (673.91 seconds)\n", - "Cbc0010I After 6567000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (674.02 seconds)\n", - "Cbc0010I After 6568000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (674.12 seconds)\n", - "Cbc0010I After 6569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (674.19 seconds)\n", - "Cbc0010I After 6570000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (674.31 seconds)\n", - "Cbc0010I After 6571000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (674.42 seconds)\n", - "Cbc0010I After 6572000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (674.52 seconds)\n", - "Cbc0010I After 6573000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (674.59 seconds)\n", - "Cbc0010I After 6574000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (674.66 seconds)\n", - "Cbc0010I After 6575000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (674.74 seconds)\n", - "Cbc0010I After 6576000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (674.82 seconds)\n", - "Cbc0010I After 6577000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (674.93 seconds)\n", - "Cbc0010I After 6578000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (674.99 seconds)\n", - "Cbc0010I After 6579000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (675.09 seconds)\n", - "Cbc0010I After 6580000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (675.18 seconds)\n", - "Cbc0010I After 6581000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (675.23 seconds)\n", - "Cbc0010I After 6582000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (675.32 seconds)\n", - "Cbc0010I After 6583000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (675.41 seconds)\n", - "Cbc0010I After 6584000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (675.49 seconds)\n", - "Cbc0010I After 6585000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (675.57 seconds)\n", - "Cbc0010I After 6586000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (675.65 seconds)\n", - "Cbc0010I After 6587000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (675.73 seconds)\n", - "Cbc0010I After 6588000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (675.82 seconds)\n", - "Cbc0010I After 6589000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (675.96 seconds)\n", - "Cbc0010I After 6590000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (676.08 seconds)\n", - "Cbc0010I After 6591000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (676.21 seconds)\n", - "Cbc0010I After 6592000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (676.37 seconds)\n", - "Cbc0010I After 6593000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (676.49 seconds)\n", - "Cbc0010I After 6594000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (676.58 seconds)\n", - "Cbc0010I After 6595000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (676.70 seconds)\n", - "Cbc0010I After 6596000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (676.80 seconds)\n", - "Cbc0010I After 6597000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (676.89 seconds)\n", - "Cbc0010I After 6598000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (677.03 seconds)\n", - "Cbc0010I After 6599000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (677.13 seconds)\n", - "Cbc0010I After 6600000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (677.22 seconds)\n", - "Cbc0010I After 6601000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (677.35 seconds)\n", - "Cbc0010I After 6602000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (677.47 seconds)\n", - "Cbc0010I After 6603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (677.54 seconds)\n", - "Cbc0010I After 6604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (677.61 seconds)\n", - "Cbc0010I After 6605000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (677.68 seconds)\n", - "Cbc0010I After 6606000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (677.76 seconds)\n", - "Cbc0010I After 6607000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (677.85 seconds)\n", - "Cbc0010I After 6608000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (677.91 seconds)\n", - "Cbc0010I After 6609000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (677.98 seconds)\n", - "Cbc0010I After 6610000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (678.05 seconds)\n", - "Cbc0010I After 6611000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (678.12 seconds)\n", - "Cbc0010I After 6612000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (678.19 seconds)\n", - "Cbc0010I After 6613000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (678.24 seconds)\n", - "Cbc0010I After 6614000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (678.30 seconds)\n", - "Cbc0010I After 6615000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (678.39 seconds)\n", - "Cbc0010I After 6616000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (678.46 seconds)\n", - "Cbc0010I After 6617000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (678.52 seconds)\n", - "Cbc0010I After 6618000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (678.59 seconds)\n", - "Cbc0010I After 6619000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (678.63 seconds)\n", - "Cbc0010I After 6620000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (678.67 seconds)\n", - "Cbc0010I After 6621000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (678.71 seconds)\n", - "Cbc0010I After 6622000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (678.75 seconds)\n", - "Cbc0010I After 6623000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (678.80 seconds)\n", - "Cbc0010I After 6624000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (678.85 seconds)\n", - "Cbc0010I After 6625000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (678.89 seconds)\n", - "Cbc0010I After 6626000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (678.94 seconds)\n", - "Cbc0010I After 6627000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (678.98 seconds)\n", - "Cbc0010I After 6628000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (679.02 seconds)\n", - "Cbc0010I After 6629000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (679.07 seconds)\n", - "Cbc0010I After 6630000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (679.12 seconds)\n", - "Cbc0010I After 6631000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (679.17 seconds)\n", - "Cbc0010I After 6632000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (679.21 seconds)\n", - "Cbc0010I After 6633000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (679.26 seconds)\n", - "Cbc0010I After 6634000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (679.31 seconds)\n", - "Cbc0010I After 6635000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.35 seconds)\n", - "Cbc0010I After 6636000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (679.39 seconds)\n", - "Cbc0010I After 6637000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (679.43 seconds)\n", - "Cbc0010I After 6638000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (679.47 seconds)\n", - "Cbc0010I After 6639000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (679.52 seconds)\n", - "Cbc0010I After 6640000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.58 seconds)\n", - "Cbc0010I After 6641000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (679.67 seconds)\n", - "Cbc0010I After 6642000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (679.72 seconds)\n", - "Cbc0010I After 6643000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (679.81 seconds)\n", - "Cbc0010I After 6644000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (679.94 seconds)\n", - "Cbc0010I After 6645000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (680.10 seconds)\n", - "Cbc0010I After 6646000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (680.26 seconds)\n", - "Cbc0010I After 6647000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (680.35 seconds)\n", - "Cbc0010I After 6648000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (680.45 seconds)\n", - "Cbc0010I After 6649000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (680.54 seconds)\n", - "Cbc0010I After 6650000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (680.61 seconds)\n", - "Cbc0010I After 6651000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (680.70 seconds)\n", - "Cbc0010I After 6652000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (680.77 seconds)\n", - "Cbc0010I After 6653000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (680.87 seconds)\n", - "Cbc0010I After 6654000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (681.09 seconds)\n", - "Cbc0010I After 6655000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (681.23 seconds)\n", - "Cbc0010I After 6656000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (681.40 seconds)\n", - "Cbc0010I After 6657000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (681.61 seconds)\n", - "Cbc0010I After 6658000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (681.80 seconds)\n", - "Cbc0010I After 6659000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (681.94 seconds)\n", - "Cbc0010I After 6660000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (682.04 seconds)\n", - "Cbc0010I After 6661000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (682.13 seconds)\n", - "Cbc0010I After 6662000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (682.25 seconds)\n", - "Cbc0010I After 6663000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (682.37 seconds)\n", - "Cbc0010I After 6664000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (682.49 seconds)\n", - "Cbc0010I After 6665000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (682.60 seconds)\n", - "Cbc0010I After 6666000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (682.70 seconds)\n", - "Cbc0010I After 6667000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (682.93 seconds)\n", - "Cbc0010I After 6668000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (683.12 seconds)\n", - "Cbc0010I After 6669000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (683.20 seconds)\n", - "Cbc0010I After 6670000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (683.27 seconds)\n", - "Cbc0010I After 6671000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (683.35 seconds)\n", - "Cbc0010I After 6672000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (683.45 seconds)\n", - "Cbc0010I After 6673000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (683.53 seconds)\n", - "Cbc0010I After 6674000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (683.62 seconds)\n", - "Cbc0010I After 6675000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (683.72 seconds)\n", - "Cbc0010I After 6676000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (683.80 seconds)\n", - "Cbc0010I After 6677000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (683.91 seconds)\n", - "Cbc0010I After 6678000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (684.00 seconds)\n", - "Cbc0010I After 6679000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (684.08 seconds)\n", - "Cbc0010I After 6680000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (684.18 seconds)\n", - "Cbc0010I After 6681000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (684.30 seconds)\n", - "Cbc0010I After 6682000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (684.38 seconds)\n", - "Cbc0010I After 6683000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (684.46 seconds)\n", - "Cbc0010I After 6684000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (684.52 seconds)\n", - "Cbc0010I After 6685000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (684.63 seconds)\n", - "Cbc0010I After 6686000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (684.69 seconds)\n", - "Cbc0010I After 6687000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (684.77 seconds)\n", - "Cbc0010I After 6688000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (684.85 seconds)\n", - "Cbc0010I After 6689000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (684.95 seconds)\n", - "Cbc0010I After 6690000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (685.03 seconds)\n", - "Cbc0010I After 6691000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (685.10 seconds)\n", - "Cbc0010I After 6692000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (685.21 seconds)\n", - "Cbc0010I After 6693000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (685.37 seconds)\n", - "Cbc0010I After 6694000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (685.54 seconds)\n", - "Cbc0010I After 6695000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (685.74 seconds)\n", - "Cbc0010I After 6696000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (685.93 seconds)\n", - "Cbc0010I After 6697000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (686.08 seconds)\n", - "Cbc0010I After 6698000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (686.15 seconds)\n", - "Cbc0010I After 6699000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (686.23 seconds)\n", - "Cbc0010I After 6700000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (686.32 seconds)\n", - "Cbc0010I After 6701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (686.41 seconds)\n", - "Cbc0010I After 6702000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (686.50 seconds)\n", - "Cbc0010I After 6703000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (686.69 seconds)\n", - "Cbc0010I After 6704000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (686.83 seconds)\n", - "Cbc0010I After 6705000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (687.03 seconds)\n", - "Cbc0010I After 6706000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (687.14 seconds)\n", - "Cbc0010I After 6707000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (687.23 seconds)\n", - "Cbc0010I After 6708000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (687.35 seconds)\n", - "Cbc0010I After 6709000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (687.49 seconds)\n", - "Cbc0010I After 6710000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (687.70 seconds)\n", - "Cbc0010I After 6711000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (687.89 seconds)\n", - "Cbc0010I After 6712000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (687.96 seconds)\n", - "Cbc0010I After 6713000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (688.02 seconds)\n", - "Cbc0010I After 6714000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (688.08 seconds)\n", - "Cbc0010I After 6715000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (688.17 seconds)\n", - "Cbc0010I After 6716000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (688.24 seconds)\n", - "Cbc0010I After 6717000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (688.32 seconds)\n", - "Cbc0010I After 6718000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (688.42 seconds)\n", - "Cbc0010I After 6719000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (688.53 seconds)\n", - "Cbc0010I After 6720000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (688.71 seconds)\n", - "Cbc0010I After 6721000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (688.84 seconds)\n", - "Cbc0010I After 6722000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (688.91 seconds)\n", - "Cbc0010I After 6723000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (688.98 seconds)\n", - "Cbc0010I After 6724000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (689.10 seconds)\n", - "Cbc0010I After 6725000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (689.19 seconds)\n", - "Cbc0010I After 6726000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (689.27 seconds)\n", - "Cbc0010I After 6727000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (689.34 seconds)\n", - "Cbc0010I After 6728000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (689.44 seconds)\n", - "Cbc0010I After 6729000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (689.52 seconds)\n", - "Cbc0010I After 6730000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (689.61 seconds)\n", - "Cbc0010I After 6731000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (689.73 seconds)\n", - "Cbc0010I After 6732000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (689.95 seconds)\n", - "Cbc0010I After 6733000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (690.16 seconds)\n", - "Cbc0010I After 6734000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (690.36 seconds)\n", - "Cbc0010I After 6735000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (690.45 seconds)\n", - "Cbc0010I After 6736000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (690.56 seconds)\n", - "Cbc0010I After 6737000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (690.67 seconds)\n", - "Cbc0010I After 6738000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (690.74 seconds)\n", - "Cbc0010I After 6739000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (690.79 seconds)\n", - "Cbc0010I After 6740000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (690.84 seconds)\n", - "Cbc0010I After 6741000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (690.90 seconds)\n", - "Cbc0010I After 6742000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (691.01 seconds)\n", - "Cbc0010I After 6743000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (691.11 seconds)\n", - "Cbc0010I After 6744000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (691.22 seconds)\n", - "Cbc0010I After 6745000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (691.29 seconds)\n", - "Cbc0010I After 6746000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (691.36 seconds)\n", - "Cbc0010I After 6747000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (691.41 seconds)\n", - "Cbc0010I After 6748000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (691.49 seconds)\n", - "Cbc0010I After 6749000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (691.57 seconds)\n", - "Cbc0010I After 6750000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (691.68 seconds)\n", - "Cbc0010I After 6751000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (691.77 seconds)\n", - "Cbc0010I After 6752000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (691.93 seconds)\n", - "Cbc0010I After 6753000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (692.03 seconds)\n", - "Cbc0010I After 6754000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (692.15 seconds)\n", - "Cbc0010I After 6755000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (692.22 seconds)\n", - "Cbc0010I After 6756000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (692.29 seconds)\n", - "Cbc0010I After 6757000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (692.43 seconds)\n", - "Cbc0010I After 6758000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (692.53 seconds)\n", - "Cbc0010I After 6759000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (692.60 seconds)\n", - "Cbc0010I After 6760000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (692.66 seconds)\n", - "Cbc0010I After 6761000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (692.74 seconds)\n", - "Cbc0010I After 6762000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (692.86 seconds)\n", - "Cbc0010I After 6763000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (692.99 seconds)\n", - "Cbc0010I After 6764000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (693.05 seconds)\n", - "Cbc0010I After 6765000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (693.09 seconds)\n", - "Cbc0010I After 6766000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (693.14 seconds)\n", - "Cbc0010I After 6767000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (693.20 seconds)\n", - "Cbc0010I After 6768000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (693.27 seconds)\n", - "Cbc0010I After 6769000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (693.34 seconds)\n", - "Cbc0010I After 6770000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (693.42 seconds)\n", - "Cbc0010I After 6771000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (693.56 seconds)\n", - "Cbc0010I After 6772000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (693.74 seconds)\n", - "Cbc0010I After 6773000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (693.81 seconds)\n", - "Cbc0010I After 6774000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (693.88 seconds)\n", - "Cbc0010I After 6775000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (693.94 seconds)\n", - "Cbc0010I After 6776000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (693.99 seconds)\n", - "Cbc0010I After 6777000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (694.04 seconds)\n", - "Cbc0010I After 6778000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (694.09 seconds)\n", - "Cbc0010I After 6779000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (694.14 seconds)\n", - "Cbc0010I After 6780000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (694.18 seconds)\n", - "Cbc0010I After 6781000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (694.23 seconds)\n", - "Cbc0010I After 6782000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (694.27 seconds)\n", - "Cbc0010I After 6783000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (694.35 seconds)\n", - "Cbc0010I After 6784000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (694.48 seconds)\n", - "Cbc0010I After 6785000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (694.58 seconds)\n", - "Cbc0010I After 6786000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (694.69 seconds)\n", - "Cbc0010I After 6787000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (694.74 seconds)\n", - "Cbc0010I After 6788000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (694.83 seconds)\n", - "Cbc0010I After 6789000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (694.87 seconds)\n", - "Cbc0010I After 6790000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (694.92 seconds)\n", - "Cbc0010I After 6791000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (694.97 seconds)\n", - "Cbc0010I After 6792000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (695.06 seconds)\n", - "Cbc0010I After 6793000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (695.18 seconds)\n", - "Cbc0010I After 6794000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (695.27 seconds)\n", - "Cbc0010I After 6795000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (695.36 seconds)\n", - "Cbc0010I After 6796000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (695.46 seconds)\n", - "Cbc0010I After 6797000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (695.55 seconds)\n", - "Cbc0010I After 6798000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (695.59 seconds)\n", - "Cbc0010I After 6799000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (695.63 seconds)\n", - "Cbc0010I After 6800000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (695.69 seconds)\n", - "Cbc0010I After 6801000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (695.74 seconds)\n", - "Cbc0010I After 6802000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (695.79 seconds)\n", - "Cbc0010I After 6803000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (695.84 seconds)\n", - "Cbc0010I After 6804000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (695.90 seconds)\n", - "Cbc0010I After 6805000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (695.96 seconds)\n", - "Cbc0010I After 6806000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (696.05 seconds)\n", - "Cbc0010I After 6807000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (696.14 seconds)\n", - "Cbc0010I After 6808000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (696.23 seconds)\n", - "Cbc0010I After 6809000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (696.29 seconds)\n", - "Cbc0010I After 6810000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (696.34 seconds)\n", - "Cbc0010I After 6811000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (696.42 seconds)\n", - "Cbc0010I After 6812000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (696.45 seconds)\n", - "Cbc0010I After 6813000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (696.50 seconds)\n", - "Cbc0010I After 6814000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (696.54 seconds)\n", - "Cbc0010I After 6815000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (696.59 seconds)\n", - "Cbc0010I After 6816000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (696.66 seconds)\n", - "Cbc0010I After 6817000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (696.71 seconds)\n", - "Cbc0010I After 6818000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (696.77 seconds)\n", - "Cbc0010I After 6819000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (696.84 seconds)\n", - "Cbc0010I After 6820000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (696.91 seconds)\n", - "Cbc0010I After 6821000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (696.98 seconds)\n", - "Cbc0010I After 6822000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (697.05 seconds)\n", - "Cbc0010I After 6823000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (697.09 seconds)\n", - "Cbc0010I After 6824000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (697.14 seconds)\n", - "Cbc0010I After 6825000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (697.20 seconds)\n", - "Cbc0010I After 6826000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (697.25 seconds)\n", - "Cbc0010I After 6827000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (697.31 seconds)\n", - "Cbc0010I After 6828000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (697.36 seconds)\n", - "Cbc0010I After 6829000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (697.44 seconds)\n", - "Cbc0010I After 6830000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (697.51 seconds)\n", - "Cbc0010I After 6831000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (697.58 seconds)\n", - "Cbc0010I After 6832000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (697.67 seconds)\n", - "Cbc0010I After 6833000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (697.75 seconds)\n", - "Cbc0010I After 6834000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (697.80 seconds)\n", - "Cbc0010I After 6835000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (697.83 seconds)\n", - "Cbc0010I After 6836000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (697.87 seconds)\n", - "Cbc0010I After 6837000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (697.94 seconds)\n", - "Cbc0010I After 6838000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (698.00 seconds)\n", - "Cbc0010I After 6839000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (698.06 seconds)\n", - "Cbc0010I After 6840000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (698.11 seconds)\n", - "Cbc0010I After 6841000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (698.15 seconds)\n", - "Cbc0010I After 6842000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (698.20 seconds)\n", - "Cbc0010I After 6843000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (698.27 seconds)\n", - "Cbc0010I After 6844000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (698.34 seconds)\n", - "Cbc0010I After 6845000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (698.40 seconds)\n", - "Cbc0010I After 6846000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (698.47 seconds)\n", - "Cbc0010I After 6847000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (698.56 seconds)\n", - "Cbc0010I After 6848000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (698.64 seconds)\n", - "Cbc0010I After 6849000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (698.73 seconds)\n", - "Cbc0010I After 6850000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (698.81 seconds)\n", - "Cbc0010I After 6851000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (698.91 seconds)\n", - "Cbc0010I After 6852000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (698.98 seconds)\n", - "Cbc0010I After 6853000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (699.06 seconds)\n", - "Cbc0010I After 6854000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (699.17 seconds)\n", - "Cbc0010I After 6855000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (699.25 seconds)\n", - "Cbc0010I After 6856000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (699.33 seconds)\n", - "Cbc0010I After 6857000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (699.40 seconds)\n", - "Cbc0010I After 6858000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (699.45 seconds)\n", - "Cbc0010I After 6859000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (699.51 seconds)\n", - "Cbc0010I After 6860000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (699.58 seconds)\n", - "Cbc0010I After 6861000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (699.63 seconds)\n", - "Cbc0010I After 6862000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (699.69 seconds)\n", - "Cbc0010I After 6863000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (699.75 seconds)\n", - "Cbc0010I After 6864000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (699.81 seconds)\n", - "Cbc0010I After 6865000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (699.87 seconds)\n", - "Cbc0010I After 6866000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (699.93 seconds)\n", - "Cbc0010I After 6867000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (699.97 seconds)\n", - "Cbc0010I After 6868000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (700.02 seconds)\n", - "Cbc0010I After 6869000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.08 seconds)\n", - "Cbc0010I After 6870000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (700.13 seconds)\n", - "Cbc0010I After 6871000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (700.18 seconds)\n", - "Cbc0010I After 6872000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (700.23 seconds)\n", - "Cbc0010I After 6873000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (700.29 seconds)\n", - "Cbc0010I After 6874000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (700.33 seconds)\n", - "Cbc0010I After 6875000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (700.38 seconds)\n", - "Cbc0010I After 6876000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (700.43 seconds)\n", - "Cbc0010I After 6877000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (700.48 seconds)\n", - "Cbc0010I After 6878000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.51 seconds)\n", - "Cbc0010I After 6879000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (700.55 seconds)\n", - "Cbc0010I After 6880000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (700.60 seconds)\n", - "Cbc0010I After 6881000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (700.64 seconds)\n", - "Cbc0010I After 6882000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (700.70 seconds)\n", - "Cbc0010I After 6883000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (700.77 seconds)\n", - "Cbc0010I After 6884000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (700.87 seconds)\n", - "Cbc0010I After 6885000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (700.96 seconds)\n", - "Cbc0010I After 6886000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (701.08 seconds)\n", - "Cbc0010I After 6887000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (701.18 seconds)\n", - "Cbc0010I After 6888000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (701.28 seconds)\n", - "Cbc0010I After 6889000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (701.38 seconds)\n", - "Cbc0010I After 6890000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (701.47 seconds)\n", - "Cbc0010I After 6891000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (701.56 seconds)\n", - "Cbc0010I After 6892000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (701.62 seconds)\n", - "Cbc0010I After 6893000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (701.70 seconds)\n", - "Cbc0010I After 6894000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (701.80 seconds)\n", - "Cbc0010I After 6895000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (701.93 seconds)\n", - "Cbc0010I After 6896000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (702.01 seconds)\n", - "Cbc0010I After 6897000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (702.10 seconds)\n", - "Cbc0010I After 6898000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (702.19 seconds)\n", - "Cbc0010I After 6899000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (702.28 seconds)\n", - "Cbc0010I After 6900000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (702.37 seconds)\n", - "Cbc0010I After 6901000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (702.45 seconds)\n", - "Cbc0010I After 6902000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (702.52 seconds)\n", - "Cbc0010I After 6903000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (702.60 seconds)\n", - "Cbc0010I After 6904000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (702.66 seconds)\n", - "Cbc0010I After 6905000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (702.72 seconds)\n", - "Cbc0010I After 6906000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (702.79 seconds)\n", - "Cbc0010I After 6907000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (702.89 seconds)\n", - "Cbc0010I After 6908000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (702.97 seconds)\n", - "Cbc0010I After 6909000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (703.06 seconds)\n", - "Cbc0010I After 6910000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (703.16 seconds)\n", - "Cbc0010I After 6911000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (703.27 seconds)\n", - "Cbc0010I After 6912000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (703.56 seconds)\n", - "Cbc0010I After 6913000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (703.70 seconds)\n", - "Cbc0010I After 6914000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (703.95 seconds)\n", - "Cbc0010I After 6915000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (704.04 seconds)\n", - "Cbc0010I After 6916000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (704.12 seconds)\n", - "Cbc0010I After 6917000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (704.20 seconds)\n", - "Cbc0010I After 6918000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (704.27 seconds)\n", - "Cbc0010I After 6919000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (704.34 seconds)\n", - "Cbc0010I After 6920000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (704.46 seconds)\n", - "Cbc0010I After 6921000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (704.60 seconds)\n", - "Cbc0010I After 6922000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (704.72 seconds)\n", - "Cbc0010I After 6923000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (704.81 seconds)\n", - "Cbc0010I After 6924000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (704.91 seconds)\n", - "Cbc0010I After 6925000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (704.98 seconds)\n", - "Cbc0010I After 6926000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (705.05 seconds)\n", - "Cbc0010I After 6927000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (705.15 seconds)\n", - "Cbc0010I After 6928000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (705.25 seconds)\n", - "Cbc0010I After 6929000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (705.30 seconds)\n", - "Cbc0010I After 6930000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (705.41 seconds)\n", - "Cbc0010I After 6931000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (705.48 seconds)\n", - "Cbc0010I After 6932000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (705.55 seconds)\n", - "Cbc0010I After 6933000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (705.60 seconds)\n", - "Cbc0010I After 6934000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (705.65 seconds)\n", - "Cbc0010I After 6935000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (705.73 seconds)\n", - "Cbc0010I After 6936000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (705.79 seconds)\n", - "Cbc0010I After 6937000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (705.86 seconds)\n", - "Cbc0010I After 6938000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (705.99 seconds)\n", - "Cbc0010I After 6939000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (706.10 seconds)\n", - "Cbc0010I After 6940000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (706.22 seconds)\n", - "Cbc0010I After 6941000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (706.36 seconds)\n", - "Cbc0010I After 6942000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (706.54 seconds)\n", - "Cbc0010I After 6943000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (706.63 seconds)\n", - "Cbc0010I After 6944000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (706.71 seconds)\n", - "Cbc0010I After 6945000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (706.85 seconds)\n", - "Cbc0010I After 6946000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (706.93 seconds)\n", - "Cbc0010I After 6947000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (707.02 seconds)\n", - "Cbc0010I After 6948000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (707.08 seconds)\n", - "Cbc0010I After 6949000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (707.21 seconds)\n", - "Cbc0010I After 6950000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (707.34 seconds)\n", - "Cbc0010I After 6951000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (707.42 seconds)\n", - "Cbc0010I After 6952000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (707.51 seconds)\n", - "Cbc0010I After 6953000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (707.58 seconds)\n", - "Cbc0010I After 6954000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (707.67 seconds)\n", - "Cbc0010I After 6955000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (707.76 seconds)\n", - "Cbc0010I After 6956000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (707.91 seconds)\n", - "Cbc0010I After 6957000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (708.14 seconds)\n", - "Cbc0010I After 6958000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (708.32 seconds)\n", - "Cbc0010I After 6959000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (708.48 seconds)\n", - "Cbc0010I After 6960000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (708.65 seconds)\n", - "Cbc0010I After 6961000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (708.77 seconds)\n", - "Cbc0010I After 6962000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (708.89 seconds)\n", - "Cbc0010I After 6963000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (709.01 seconds)\n", - "Cbc0010I After 6964000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (709.10 seconds)\n", - "Cbc0010I After 6965000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (709.20 seconds)\n", - "Cbc0010I After 6966000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.29 seconds)\n", - "Cbc0010I After 6967000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (709.41 seconds)\n", - "Cbc0010I After 6968000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.55 seconds)\n", - "Cbc0010I After 6969000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (709.72 seconds)\n", - "Cbc0010I After 6970000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (709.87 seconds)\n", - "Cbc0010I After 6971000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (710.00 seconds)\n", - "Cbc0010I After 6972000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (710.14 seconds)\n", - "Cbc0010I After 6973000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (710.23 seconds)\n", - "Cbc0010I After 6974000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (710.35 seconds)\n", - "Cbc0010I After 6975000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (710.45 seconds)\n", - "Cbc0010I After 6976000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (710.53 seconds)\n", - "Cbc0010I After 6977000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (710.61 seconds)\n", - "Cbc0010I After 6978000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (710.69 seconds)\n", - "Cbc0010I After 6979000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (710.76 seconds)\n", - "Cbc0010I After 6980000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (710.84 seconds)\n", - "Cbc0010I After 6981000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (710.91 seconds)\n", - "Cbc0010I After 6982000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (710.97 seconds)\n", - "Cbc0010I After 6983000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (711.05 seconds)\n", - "Cbc0010I After 6984000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (711.12 seconds)\n", - "Cbc0010I After 6985000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (711.21 seconds)\n", - "Cbc0010I After 6986000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (711.29 seconds)\n", - "Cbc0010I After 6987000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (711.38 seconds)\n", - "Cbc0010I After 6988000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (711.51 seconds)\n", - "Cbc0010I After 6989000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (711.68 seconds)\n", - "Cbc0010I After 6990000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (711.85 seconds)\n", - "Cbc0010I After 6991000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (712.09 seconds)\n", - "Cbc0010I After 6992000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (712.38 seconds)\n", - "Cbc0010I After 6993000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (712.70 seconds)\n", - "Cbc0010I After 6994000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (712.88 seconds)\n", - "Cbc0010I After 6995000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (713.01 seconds)\n", - "Cbc0010I After 6996000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (713.18 seconds)\n", - "Cbc0010I After 6997000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (713.34 seconds)\n", - "Cbc0010I After 6998000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (713.47 seconds)\n", - "Cbc0010I After 6999000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (713.58 seconds)\n", - "Cbc0010I After 7000000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (713.65 seconds)\n", - "Cbc0010I After 7001000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (713.75 seconds)\n", - "Cbc0010I After 7002000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (713.84 seconds)\n", - "Cbc0010I After 7003000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (713.93 seconds)\n", - "Cbc0010I After 7004000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (714.03 seconds)\n", - "Cbc0010I After 7005000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (714.12 seconds)\n", - "Cbc0010I After 7006000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (714.19 seconds)\n", - "Cbc0010I After 7007000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (714.30 seconds)\n", - "Cbc0010I After 7008000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (714.42 seconds)\n", - "Cbc0010I After 7009000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (714.52 seconds)\n", - "Cbc0010I After 7010000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (714.60 seconds)\n", - "Cbc0010I After 7011000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (714.69 seconds)\n", - "Cbc0010I After 7012000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (714.77 seconds)\n", - "Cbc0010I After 7013000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (714.86 seconds)\n", - "Cbc0010I After 7014000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (714.95 seconds)\n", - "Cbc0010I After 7015000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (715.03 seconds)\n", - "Cbc0010I After 7016000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (715.13 seconds)\n", - "Cbc0010I After 7017000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (715.20 seconds)\n", - "Cbc0010I After 7018000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (715.27 seconds)\n", - "Cbc0010I After 7019000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (715.34 seconds)\n", - "Cbc0010I After 7020000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (715.42 seconds)\n", - "Cbc0010I After 7021000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (715.49 seconds)\n", - "Cbc0010I After 7022000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (715.57 seconds)\n", - "Cbc0010I After 7023000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (715.64 seconds)\n", - "Cbc0010I After 7024000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (715.72 seconds)\n", - "Cbc0010I After 7025000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (715.80 seconds)\n", - "Cbc0010I After 7026000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (715.89 seconds)\n", - "Cbc0010I After 7027000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (715.97 seconds)\n", - "Cbc0010I After 7028000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (716.04 seconds)\n", - "Cbc0010I After 7029000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (716.10 seconds)\n", - "Cbc0010I After 7030000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (716.16 seconds)\n", - "Cbc0010I After 7031000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (716.21 seconds)\n", - "Cbc0010I After 7032000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (716.27 seconds)\n", - "Cbc0010I After 7033000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (716.36 seconds)\n", - "Cbc0010I After 7034000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (716.44 seconds)\n", - "Cbc0010I After 7035000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (716.52 seconds)\n", - "Cbc0010I After 7036000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (716.65 seconds)\n", - "Cbc0010I After 7037000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (716.83 seconds)\n", - "Cbc0010I After 7038000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (716.96 seconds)\n", - "Cbc0010I After 7039000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (717.10 seconds)\n", - "Cbc0010I After 7040000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (717.20 seconds)\n", - "Cbc0010I After 7041000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (717.30 seconds)\n", - "Cbc0010I After 7042000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (717.40 seconds)\n", - "Cbc0010I After 7043000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (717.48 seconds)\n", - "Cbc0010I After 7044000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (717.55 seconds)\n", - "Cbc0010I After 7045000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (717.65 seconds)\n", - "Cbc0010I After 7046000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (717.73 seconds)\n", - "Cbc0010I After 7047000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (717.82 seconds)\n", - "Cbc0010I After 7048000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (717.90 seconds)\n", - "Cbc0010I After 7049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (718.06 seconds)\n", - "Cbc0010I After 7050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (718.20 seconds)\n", - "Cbc0010I After 7051000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (718.32 seconds)\n", - "Cbc0010I After 7052000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (718.42 seconds)\n", - "Cbc0010I After 7053000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (718.50 seconds)\n", - "Cbc0010I After 7054000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (718.56 seconds)\n", - "Cbc0010I After 7055000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (718.62 seconds)\n", - "Cbc0010I After 7056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (718.68 seconds)\n", - "Cbc0010I After 7057000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (718.74 seconds)\n", - "Cbc0010I After 7058000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (718.78 seconds)\n", - "Cbc0010I After 7059000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (718.83 seconds)\n", - "Cbc0010I After 7060000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (718.89 seconds)\n", - "Cbc0010I After 7061000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (718.97 seconds)\n", - "Cbc0010I After 7062000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (719.05 seconds)\n", - "Cbc0010I After 7063000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (719.11 seconds)\n", - "Cbc0010I After 7064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (719.18 seconds)\n", - "Cbc0010I After 7065000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (719.26 seconds)\n", - "Cbc0010I After 7066000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (719.35 seconds)\n", - "Cbc0010I After 7067000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (719.43 seconds)\n", - "Cbc0010I After 7068000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (719.50 seconds)\n", - "Cbc0010I After 7069000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (719.55 seconds)\n", - "Cbc0010I After 7070000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (719.58 seconds)\n", - "Cbc0010I After 7071000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (719.62 seconds)\n", - "Cbc0010I After 7072000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (719.66 seconds)\n", - "Cbc0010I After 7073000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (719.72 seconds)\n", - "Cbc0010I After 7074000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (719.76 seconds)\n", - "Cbc0010I After 7075000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (719.81 seconds)\n", - "Cbc0010I After 7076000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (719.86 seconds)\n", - "Cbc0010I After 7077000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (719.92 seconds)\n", - "Cbc0010I After 7078000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (719.97 seconds)\n", - "Cbc0010I After 7079000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (720.02 seconds)\n", - "Cbc0010I After 7080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (720.07 seconds)\n", - "Cbc0010I After 7081000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (720.14 seconds)\n", - "Cbc0010I After 7082000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (720.22 seconds)\n", - "Cbc0010I After 7083000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (720.29 seconds)\n", - "Cbc0010I After 7084000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (720.37 seconds)\n", - "Cbc0010I After 7085000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (720.44 seconds)\n", - "Cbc0010I After 7086000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (720.51 seconds)\n", - "Cbc0010I After 7087000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (720.58 seconds)\n", - "Cbc0010I After 7088000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (720.65 seconds)\n", - "Cbc0010I After 7089000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (720.75 seconds)\n", - "Cbc0010I After 7090000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (720.86 seconds)\n", - "Cbc0010I After 7091000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (720.96 seconds)\n", - "Cbc0010I After 7092000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (721.00 seconds)\n", - "Cbc0010I After 7093000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (721.05 seconds)\n", - "Cbc0010I After 7094000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (721.14 seconds)\n", - "Cbc0010I After 7095000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (721.25 seconds)\n", - "Cbc0010I After 7096000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (721.41 seconds)\n", - "Cbc0010I After 7097000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (721.48 seconds)\n", - "Cbc0010I After 7098000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (721.55 seconds)\n", - "Cbc0010I After 7099000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (721.64 seconds)\n", - "Cbc0010I After 7100000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (721.69 seconds)\n", - "Cbc0010I After 7101000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (721.77 seconds)\n", - "Cbc0010I After 7102000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (721.88 seconds)\n", - "Cbc0010I After 7103000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (721.98 seconds)\n", - "Cbc0010I After 7104000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (722.05 seconds)\n", - "Cbc0010I After 7105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (722.09 seconds)\n", - "Cbc0010I After 7106000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (722.14 seconds)\n", - "Cbc0010I After 7107000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (722.19 seconds)\n", - "Cbc0010I After 7108000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (722.23 seconds)\n", - "Cbc0010I After 7109000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (722.27 seconds)\n", - "Cbc0010I After 7110000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (722.33 seconds)\n", - "Cbc0010I After 7111000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (722.41 seconds)\n", - "Cbc0010I After 7112000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (722.49 seconds)\n", - "Cbc0010I After 7113000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (722.58 seconds)\n", - "Cbc0010I After 7114000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (722.64 seconds)\n", - "Cbc0010I After 7115000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (722.69 seconds)\n", - "Cbc0010I After 7116000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (722.73 seconds)\n", - "Cbc0010I After 7117000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (722.79 seconds)\n", - "Cbc0010I After 7118000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (722.86 seconds)\n", - "Cbc0010I After 7119000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (722.94 seconds)\n", - "Cbc0010I After 7120000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (723.00 seconds)\n", - "Cbc0010I After 7121000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (723.07 seconds)\n", - "Cbc0010I After 7122000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (723.18 seconds)\n", - "Cbc0010I After 7123000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (723.23 seconds)\n", - "Cbc0010I After 7124000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (723.29 seconds)\n", - "Cbc0010I After 7125000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (723.38 seconds)\n", - "Cbc0010I After 7126000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (723.44 seconds)\n", - "Cbc0010I After 7127000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (723.50 seconds)\n", - "Cbc0010I After 7128000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (723.57 seconds)\n", - "Cbc0010I After 7129000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (723.66 seconds)\n", - "Cbc0010I After 7130000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (723.78 seconds)\n", - "Cbc0010I After 7131000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (723.84 seconds)\n", - "Cbc0010I After 7132000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (723.92 seconds)\n", - "Cbc0010I After 7133000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (724.00 seconds)\n", - "Cbc0010I After 7134000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (724.08 seconds)\n", - "Cbc0010I After 7135000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (724.14 seconds)\n", - "Cbc0010I After 7136000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (724.22 seconds)\n", - "Cbc0010I After 7137000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (724.31 seconds)\n", - "Cbc0010I After 7138000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (724.38 seconds)\n", - "Cbc0010I After 7139000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (724.57 seconds)\n", - "Cbc0010I After 7140000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (724.64 seconds)\n", - "Cbc0010I After 7141000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (724.73 seconds)\n", - "Cbc0010I After 7142000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (724.84 seconds)\n", - "Cbc0010I After 7143000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (724.90 seconds)\n", - "Cbc0010I After 7144000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (724.95 seconds)\n", - "Cbc0010I After 7145000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (725.01 seconds)\n", - "Cbc0010I After 7146000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (725.06 seconds)\n", - "Cbc0010I After 7147000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (725.12 seconds)\n", - "Cbc0010I After 7148000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (725.25 seconds)\n", - "Cbc0010I After 7149000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (725.31 seconds)\n", - "Cbc0010I After 7150000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (725.36 seconds)\n", - "Cbc0010I After 7151000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (725.50 seconds)\n", - "Cbc0010I After 7152000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (725.60 seconds)\n", - "Cbc0010I After 7153000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (725.69 seconds)\n", - "Cbc0010I After 7154000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (725.74 seconds)\n", - "Cbc0010I After 7155000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (725.84 seconds)\n", - "Cbc0010I After 7156000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (725.90 seconds)\n", - "Cbc0010I After 7157000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (726.00 seconds)\n", - "Cbc0010I After 7158000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (726.07 seconds)\n", - "Cbc0010I After 7159000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (726.13 seconds)\n", - "Cbc0010I After 7160000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (726.18 seconds)\n", - "Cbc0010I After 7161000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.24 seconds)\n", - "Cbc0010I After 7162000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (726.35 seconds)\n", - "Cbc0010I After 7163000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (726.46 seconds)\n", - "Cbc0010I After 7164000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.55 seconds)\n", - "Cbc0010I After 7165000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (726.65 seconds)\n", - "Cbc0010I After 7166000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (726.75 seconds)\n", - "Cbc0010I After 7167000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (726.85 seconds)\n", - "Cbc0010I After 7168000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (726.96 seconds)\n", - "Cbc0010I After 7169000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (727.08 seconds)\n", - "Cbc0010I After 7170000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (727.13 seconds)\n", - "Cbc0010I After 7171000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (727.18 seconds)\n", - "Cbc0010I After 7172000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (727.25 seconds)\n", - "Cbc0010I After 7173000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (727.33 seconds)\n", - "Cbc0010I After 7174000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (727.43 seconds)\n", - "Cbc0010I After 7175000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (727.48 seconds)\n", - "Cbc0010I After 7176000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (727.52 seconds)\n", - "Cbc0010I After 7177000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (727.56 seconds)\n", - "Cbc0010I After 7178000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (727.62 seconds)\n", - "Cbc0010I After 7179000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (727.74 seconds)\n", - "Cbc0010I After 7180000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (727.81 seconds)\n", - "Cbc0010I After 7181000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (727.91 seconds)\n", - "Cbc0010I After 7182000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (727.96 seconds)\n", - "Cbc0010I After 7183000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (728.07 seconds)\n", - "Cbc0010I After 7184000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (728.12 seconds)\n", - "Cbc0010I After 7185000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (728.17 seconds)\n", - "Cbc0010I After 7186000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (728.23 seconds)\n", - "Cbc0010I After 7187000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (728.30 seconds)\n", - "Cbc0010I After 7188000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (728.38 seconds)\n", - "Cbc0010I After 7189000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (728.52 seconds)\n", - "Cbc0010I After 7190000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (728.67 seconds)\n", - "Cbc0010I After 7191000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (728.76 seconds)\n", - "Cbc0010I After 7192000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (728.86 seconds)\n", - "Cbc0010I After 7193000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (728.97 seconds)\n", - "Cbc0010I After 7194000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (729.13 seconds)\n", - "Cbc0010I After 7195000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (729.29 seconds)\n", - "Cbc0010I After 7196000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (729.38 seconds)\n", - "Cbc0010I After 7197000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (729.46 seconds)\n", - "Cbc0010I After 7198000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (729.51 seconds)\n", - "Cbc0010I After 7199000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (729.58 seconds)\n", - "Cbc0010I After 7200000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (729.66 seconds)\n", - "Cbc0010I After 7201000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (729.74 seconds)\n", - "Cbc0010I After 7202000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (729.86 seconds)\n", - "Cbc0010I After 7203000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (729.93 seconds)\n", - "Cbc0010I After 7204000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (730.00 seconds)\n", - "Cbc0010I After 7205000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (730.06 seconds)\n", - "Cbc0010I After 7206000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (730.11 seconds)\n", - "Cbc0010I After 7207000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (730.17 seconds)\n", - "Cbc0010I After 7208000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (730.23 seconds)\n", - "Cbc0010I After 7209000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (730.29 seconds)\n", - "Cbc0010I After 7210000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (730.35 seconds)\n", - "Cbc0010I After 7211000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (730.40 seconds)\n", - "Cbc0010I After 7212000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (730.46 seconds)\n", - "Cbc0010I After 7213000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (730.53 seconds)\n", - "Cbc0010I After 7214000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (730.64 seconds)\n", - "Cbc0010I After 7215000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (730.69 seconds)\n", - "Cbc0010I After 7216000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (730.75 seconds)\n", - "Cbc0010I After 7217000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (730.81 seconds)\n", - "Cbc0010I After 7218000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (730.88 seconds)\n", - "Cbc0010I After 7219000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (731.00 seconds)\n", - "Cbc0010I After 7220000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (731.11 seconds)\n", - "Cbc0010I After 7221000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (731.19 seconds)\n", - "Cbc0010I After 7222000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (731.28 seconds)\n", - "Cbc0010I After 7223000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (731.36 seconds)\n", - "Cbc0010I After 7224000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (731.41 seconds)\n", - "Cbc0010I After 7225000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (731.46 seconds)\n", - "Cbc0010I After 7226000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (731.52 seconds)\n", - "Cbc0010I After 7227000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (731.61 seconds)\n", - "Cbc0010I After 7228000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (731.66 seconds)\n", - "Cbc0010I After 7229000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (731.74 seconds)\n", - "Cbc0010I After 7230000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (731.86 seconds)\n", - "Cbc0010I After 7231000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (732.02 seconds)\n", - "Cbc0010I After 7232000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (732.15 seconds)\n", - "Cbc0010I After 7233000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (732.23 seconds)\n", - "Cbc0010I After 7234000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (732.34 seconds)\n", - "Cbc0010I After 7235000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (732.57 seconds)\n", - "Cbc0010I After 7236000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (732.73 seconds)\n", - "Cbc0010I After 7237000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (732.85 seconds)\n", - "Cbc0010I After 7238000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (732.98 seconds)\n", - "Cbc0010I After 7239000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (733.08 seconds)\n", - "Cbc0010I After 7240000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (733.19 seconds)\n", - "Cbc0010I After 7241000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (733.31 seconds)\n", - "Cbc0010I After 7242000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (733.39 seconds)\n", - "Cbc0010I After 7243000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (733.51 seconds)\n", - "Cbc0010I After 7244000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (733.67 seconds)\n", - "Cbc0010I After 7245000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (733.83 seconds)\n", - "Cbc0010I After 7246000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (733.94 seconds)\n", - "Cbc0010I After 7247000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (734.08 seconds)\n", - "Cbc0010I After 7248000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (734.26 seconds)\n", - "Cbc0010I After 7249000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (734.41 seconds)\n", - "Cbc0010I After 7250000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (734.55 seconds)\n", - "Cbc0010I After 7251000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (734.71 seconds)\n", - "Cbc0010I After 7252000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (734.84 seconds)\n", - "Cbc0010I After 7253000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (734.94 seconds)\n", - "Cbc0010I After 7254000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (735.06 seconds)\n", - "Cbc0010I After 7255000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (735.20 seconds)\n", - "Cbc0010I After 7256000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (735.33 seconds)\n", - "Cbc0010I After 7257000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (735.39 seconds)\n", - "Cbc0010I After 7258000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (735.45 seconds)\n", - "Cbc0010I After 7259000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (735.50 seconds)\n", - "Cbc0010I After 7260000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (735.58 seconds)\n", - "Cbc0010I After 7261000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (735.67 seconds)\n", - "Cbc0010I After 7262000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (735.75 seconds)\n", - "Cbc0010I After 7263000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (735.82 seconds)\n", - "Cbc0010I After 7264000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (735.91 seconds)\n", - "Cbc0010I After 7265000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (735.99 seconds)\n", - "Cbc0010I After 7266000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (736.07 seconds)\n", - "Cbc0010I After 7267000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (736.17 seconds)\n", - "Cbc0010I After 7268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (736.24 seconds)\n", - "Cbc0010I After 7269000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (736.30 seconds)\n", - "Cbc0010I After 7270000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (736.39 seconds)\n", - "Cbc0010I After 7271000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (736.55 seconds)\n", - "Cbc0010I After 7272000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (736.66 seconds)\n", - "Cbc0010I After 7273000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (736.80 seconds)\n", - "Cbc0010I After 7274000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (736.95 seconds)\n", - "Cbc0010I After 7275000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (737.07 seconds)\n", - "Cbc0010I After 7276000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (737.23 seconds)\n", - "Cbc0010I After 7277000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (737.38 seconds)\n", - "Cbc0010I After 7278000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (737.65 seconds)\n", - "Cbc0010I After 7279000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (738.03 seconds)\n", - "Cbc0010I After 7280000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (738.36 seconds)\n", - "Cbc0010I After 7281000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (738.71 seconds)\n", - "Cbc0010I After 7282000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (739.03 seconds)\n", - "Cbc0010I After 7283000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (739.37 seconds)\n", - "Cbc0010I After 7284000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (739.82 seconds)\n", - "Cbc0010I After 7285000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (740.11 seconds)\n", - "Cbc0010I After 7286000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (740.43 seconds)\n", - "Cbc0010I After 7287000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (740.76 seconds)\n", - "Cbc0010I After 7288000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (741.03 seconds)\n", - "Cbc0010I After 7289000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (741.23 seconds)\n", - "Cbc0010I After 7290000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (741.41 seconds)\n", - "Cbc0010I After 7291000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (741.57 seconds)\n", - "Cbc0010I After 7292000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (741.70 seconds)\n", - "Cbc0010I After 7293000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (741.84 seconds)\n", - "Cbc0010I After 7294000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (741.93 seconds)\n", - "Cbc0010I After 7295000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (742.03 seconds)\n", - "Cbc0010I After 7296000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (742.12 seconds)\n", - "Cbc0010I After 7297000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (742.20 seconds)\n", - "Cbc0010I After 7298000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (742.31 seconds)\n", - "Cbc0010I After 7299000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (742.43 seconds)\n", - "Cbc0010I After 7300000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (742.55 seconds)\n", - "Cbc0010I After 7301000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (742.65 seconds)\n", - "Cbc0010I After 7302000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (742.78 seconds)\n", - "Cbc0010I After 7303000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (742.88 seconds)\n", - "Cbc0010I After 7304000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (742.99 seconds)\n", - "Cbc0010I After 7305000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (743.14 seconds)\n", - "Cbc0010I After 7306000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (743.22 seconds)\n", - "Cbc0010I After 7307000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (743.33 seconds)\n", - "Cbc0010I After 7308000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (743.42 seconds)\n", - "Cbc0010I After 7309000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (743.53 seconds)\n", - "Cbc0010I After 7310000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (743.62 seconds)\n", - "Cbc0010I After 7311000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (743.72 seconds)\n", - "Cbc0010I After 7312000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (743.83 seconds)\n", - "Cbc0010I After 7313000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (743.96 seconds)\n", - "Cbc0010I After 7314000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (744.08 seconds)\n", - "Cbc0010I After 7315000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (744.20 seconds)\n", - "Cbc0010I After 7316000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (744.30 seconds)\n", - "Cbc0010I After 7317000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (744.36 seconds)\n", - "Cbc0010I After 7318000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (744.43 seconds)\n", - "Cbc0010I After 7319000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (744.53 seconds)\n", - "Cbc0010I After 7320000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (744.59 seconds)\n", - "Cbc0010I After 7321000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (744.69 seconds)\n", - "Cbc0010I After 7322000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (744.81 seconds)\n", - "Cbc0010I After 7323000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (744.93 seconds)\n", - "Cbc0010I After 7324000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (745.04 seconds)\n", - "Cbc0010I After 7325000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (745.12 seconds)\n", - "Cbc0010I After 7326000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (745.21 seconds)\n", - "Cbc0010I After 7327000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (745.29 seconds)\n", - "Cbc0010I After 7328000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (745.33 seconds)\n", - "Cbc0010I After 7329000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (745.40 seconds)\n", - "Cbc0010I After 7330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (745.45 seconds)\n", - "Cbc0010I After 7331000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (745.50 seconds)\n", - "Cbc0010I After 7332000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (745.55 seconds)\n", - "Cbc0010I After 7333000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (745.61 seconds)\n", - "Cbc0010I After 7334000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (745.71 seconds)\n", - "Cbc0010I After 7335000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (745.79 seconds)\n", - "Cbc0010I After 7336000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (745.87 seconds)\n", - "Cbc0010I After 7337000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (745.93 seconds)\n", - "Cbc0010I After 7338000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (746.02 seconds)\n", - "Cbc0010I After 7339000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (746.06 seconds)\n", - "Cbc0010I After 7340000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (746.14 seconds)\n", - "Cbc0010I After 7341000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (746.19 seconds)\n", - "Cbc0010I After 7342000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (746.24 seconds)\n", - "Cbc0010I After 7343000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (746.31 seconds)\n", - "Cbc0010I After 7344000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (746.37 seconds)\n", - "Cbc0010I After 7345000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (746.40 seconds)\n", - "Cbc0010I After 7346000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (746.44 seconds)\n", - "Cbc0010I After 7347000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (746.48 seconds)\n", - "Cbc0010I After 7348000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (746.53 seconds)\n", - "Cbc0010I After 7349000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (746.57 seconds)\n", - "Cbc0010I After 7350000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (746.60 seconds)\n", - "Cbc0010I After 7351000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (746.65 seconds)\n", - "Cbc0010I After 7352000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (746.69 seconds)\n", - "Cbc0010I After 7353000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (746.72 seconds)\n", - "Cbc0010I After 7354000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (746.78 seconds)\n", - "Cbc0010I After 7355000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (746.84 seconds)\n", - "Cbc0010I After 7356000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (746.88 seconds)\n", - "Cbc0010I After 7357000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (746.92 seconds)\n", - "Cbc0010I After 7358000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (746.99 seconds)\n", - "Cbc0010I After 7359000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (747.04 seconds)\n", - "Cbc0010I After 7360000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (747.10 seconds)\n", - "Cbc0010I After 7361000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (747.23 seconds)\n", - "Cbc0010I After 7362000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.30 seconds)\n", - "Cbc0010I After 7363000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (747.39 seconds)\n", - "Cbc0010I After 7364000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (747.47 seconds)\n", - "Cbc0010I After 7365000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (747.54 seconds)\n", - "Cbc0010I After 7366000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.62 seconds)\n", - "Cbc0010I After 7367000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (747.69 seconds)\n", - "Cbc0010I After 7368000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (747.76 seconds)\n", - "Cbc0010I After 7369000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (747.84 seconds)\n", - "Cbc0010I After 7370000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (747.92 seconds)\n", - "Cbc0010I After 7371000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (748.01 seconds)\n", - "Cbc0010I After 7372000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (748.09 seconds)\n", - "Cbc0010I After 7373000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (748.18 seconds)\n", - "Cbc0010I After 7374000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (748.25 seconds)\n", - "Cbc0010I After 7375000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (748.32 seconds)\n", - "Cbc0010I After 7376000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.37 seconds)\n", - "Cbc0010I After 7377000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (748.43 seconds)\n", - "Cbc0010I After 7378000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (748.48 seconds)\n", - "Cbc0010I After 7379000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.54 seconds)\n", - "Cbc0010I After 7380000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (748.60 seconds)\n", - "Cbc0010I After 7381000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (748.66 seconds)\n", - "Cbc0010I After 7382000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (748.70 seconds)\n", - "Cbc0010I After 7383000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (748.76 seconds)\n", - "Cbc0010I After 7384000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (748.81 seconds)\n", - "Cbc0010I After 7385000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (748.86 seconds)\n", - "Cbc0010I After 7386000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (748.90 seconds)\n", - "Cbc0010I After 7387000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (748.95 seconds)\n", - "Cbc0010I After 7388000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (749.01 seconds)\n", - "Cbc0010I After 7389000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.05 seconds)\n", - "Cbc0010I After 7390000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.11 seconds)\n", - "Cbc0010I After 7391000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (749.16 seconds)\n", - "Cbc0010I After 7392000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (749.20 seconds)\n", - "Cbc0010I After 7393000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (749.26 seconds)\n", - "Cbc0010I After 7394000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (749.30 seconds)\n", - "Cbc0010I After 7395000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (749.36 seconds)\n", - "Cbc0010I After 7396000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (749.40 seconds)\n", - "Cbc0010I After 7397000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (749.45 seconds)\n", - "Cbc0010I After 7398000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (749.49 seconds)\n", - "Cbc0010I After 7399000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (749.53 seconds)\n", - "Cbc0010I After 7400000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (749.58 seconds)\n", - "Cbc0010I After 7401000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (749.64 seconds)\n", - "Cbc0010I After 7402000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (749.71 seconds)\n", - "Cbc0010I After 7403000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (749.76 seconds)\n", - "Cbc0010I After 7404000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (749.82 seconds)\n", - "Cbc0010I After 7405000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (749.87 seconds)\n", - "Cbc0010I After 7406000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (749.92 seconds)\n", - "Cbc0010I After 7407000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (749.98 seconds)\n", - "Cbc0010I After 7408000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (750.02 seconds)\n", - "Cbc0010I After 7409000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (750.08 seconds)\n", - "Cbc0010I After 7410000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (750.14 seconds)\n", - "Cbc0010I After 7411000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (750.20 seconds)\n", - "Cbc0010I After 7412000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (750.25 seconds)\n", - "Cbc0010I After 7413000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (750.32 seconds)\n", - "Cbc0010I After 7414000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (750.37 seconds)\n", - "Cbc0010I After 7415000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (750.44 seconds)\n", - "Cbc0010I After 7416000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (750.52 seconds)\n", - "Cbc0010I After 7417000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (750.62 seconds)\n", - "Cbc0010I After 7418000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (750.71 seconds)\n", - "Cbc0010I After 7419000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (750.84 seconds)\n", - "Cbc0010I After 7420000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (750.99 seconds)\n", - "Cbc0010I After 7421000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (751.08 seconds)\n", - "Cbc0010I After 7422000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (751.15 seconds)\n", - "Cbc0010I After 7423000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (751.30 seconds)\n", - "Cbc0010I After 7424000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (751.40 seconds)\n", - "Cbc0010I After 7425000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.50 seconds)\n", - "Cbc0010I After 7426000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.61 seconds)\n", - "Cbc0010I After 7427000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (751.71 seconds)\n", - "Cbc0010I After 7428000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (751.80 seconds)\n", - "Cbc0010I After 7429000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (751.92 seconds)\n", - "Cbc0010I After 7430000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (752.05 seconds)\n", - "Cbc0010I After 7431000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (752.13 seconds)\n", - "Cbc0010I After 7432000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (752.19 seconds)\n", - "Cbc0010I After 7433000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (752.27 seconds)\n", - "Cbc0010I After 7434000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (752.38 seconds)\n", - "Cbc0010I After 7435000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (752.52 seconds)\n", - "Cbc0010I After 7436000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (752.64 seconds)\n", - "Cbc0010I After 7437000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (752.81 seconds)\n", - "Cbc0010I After 7438000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (752.98 seconds)\n", - "Cbc0010I After 7439000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (753.14 seconds)\n", - "Cbc0010I After 7440000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (753.24 seconds)\n", - "Cbc0010I After 7441000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (753.35 seconds)\n", - "Cbc0010I After 7442000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (753.46 seconds)\n", - "Cbc0010I After 7443000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (753.57 seconds)\n", - "Cbc0010I After 7444000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (753.66 seconds)\n", - "Cbc0010I After 7445000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (753.77 seconds)\n", - "Cbc0010I After 7446000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (753.85 seconds)\n", - "Cbc0010I After 7447000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (753.91 seconds)\n", - "Cbc0010I After 7448000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (753.97 seconds)\n", - "Cbc0010I After 7449000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (754.05 seconds)\n", - "Cbc0010I After 7450000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (754.09 seconds)\n", - "Cbc0010I After 7451000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (754.13 seconds)\n", - "Cbc0010I After 7452000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (754.17 seconds)\n", - "Cbc0010I After 7453000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (754.22 seconds)\n", - "Cbc0010I After 7454000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (754.25 seconds)\n", - "Cbc0010I After 7455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (754.28 seconds)\n", - "Cbc0010I After 7456000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (754.33 seconds)\n", - "Cbc0010I After 7457000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (754.38 seconds)\n", - "Cbc0010I After 7458000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (754.43 seconds)\n", - "Cbc0010I After 7459000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (754.49 seconds)\n", - "Cbc0010I After 7460000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (754.54 seconds)\n", - "Cbc0010I After 7461000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (754.58 seconds)\n", - "Cbc0010I After 7462000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (754.62 seconds)\n", - "Cbc0010I After 7463000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (754.67 seconds)\n", - "Cbc0010I After 7464000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (754.73 seconds)\n", - "Cbc0010I After 7465000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (754.77 seconds)\n", - "Cbc0010I After 7466000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (754.80 seconds)\n", - "Cbc0010I After 7467000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (754.85 seconds)\n", - "Cbc0010I After 7468000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (754.91 seconds)\n", - "Cbc0010I After 7469000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (754.99 seconds)\n", - "Cbc0010I After 7470000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (755.04 seconds)\n", - "Cbc0010I After 7471000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (755.09 seconds)\n", - "Cbc0010I After 7472000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (755.14 seconds)\n", - "Cbc0010I After 7473000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (755.19 seconds)\n", - "Cbc0010I After 7474000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (755.23 seconds)\n", - "Cbc0010I After 7475000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (755.26 seconds)\n", - "Cbc0010I After 7476000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (755.29 seconds)\n", - "Cbc0010I After 7477000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (755.34 seconds)\n", - "Cbc0010I After 7478000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (755.39 seconds)\n", - "Cbc0010I After 7479000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (755.44 seconds)\n", - "Cbc0010I After 7480000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (755.52 seconds)\n", - "Cbc0010I After 7481000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (755.58 seconds)\n", - "Cbc0010I After 7482000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (755.64 seconds)\n", - "Cbc0010I After 7483000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (755.69 seconds)\n", - "Cbc0010I After 7484000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (755.75 seconds)\n", - "Cbc0010I After 7485000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (755.81 seconds)\n", - "Cbc0010I After 7486000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (755.88 seconds)\n", - "Cbc0010I After 7487000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (755.95 seconds)\n", - "Cbc0010I After 7488000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (756.01 seconds)\n", - "Cbc0010I After 7489000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (756.06 seconds)\n", - "Cbc0010I After 7490000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (756.11 seconds)\n", - "Cbc0010I After 7491000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (756.17 seconds)\n", - "Cbc0010I After 7492000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (756.22 seconds)\n", - "Cbc0010I After 7493000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (756.28 seconds)\n", - "Cbc0010I After 7494000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (756.33 seconds)\n", - "Cbc0010I After 7495000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (756.38 seconds)\n", - "Cbc0010I After 7496000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (756.44 seconds)\n", - "Cbc0010I After 7497000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (756.50 seconds)\n", - "Cbc0010I After 7498000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (756.57 seconds)\n", - "Cbc0010I After 7499000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (756.63 seconds)\n", - "Cbc0010I After 7500000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (756.68 seconds)\n", - "Cbc0010I After 7501000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (756.75 seconds)\n", - "Cbc0010I After 7502000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (756.82 seconds)\n", - "Cbc0010I After 7503000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (756.88 seconds)\n", - "Cbc0010I After 7504000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (756.94 seconds)\n", - "Cbc0010I After 7505000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (757.00 seconds)\n", - "Cbc0010I After 7506000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (757.06 seconds)\n", - "Cbc0010I After 7507000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (757.12 seconds)\n", - "Cbc0010I After 7508000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (757.18 seconds)\n", - "Cbc0010I After 7509000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (757.24 seconds)\n", - "Cbc0010I After 7510000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (757.30 seconds)\n", - "Cbc0010I After 7511000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (757.36 seconds)\n", - "Cbc0010I After 7512000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (757.42 seconds)\n", - "Cbc0010I After 7513000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (757.48 seconds)\n", - "Cbc0010I After 7514000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (757.53 seconds)\n", - "Cbc0010I After 7515000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (757.59 seconds)\n", - "Cbc0010I After 7516000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (757.65 seconds)\n", - "Cbc0010I After 7517000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (757.71 seconds)\n", - "Cbc0010I After 7518000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (757.76 seconds)\n", - "Cbc0010I After 7519000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (757.82 seconds)\n", - "Cbc0010I After 7520000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (757.90 seconds)\n", - "Cbc0010I After 7521000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (757.98 seconds)\n", - "Cbc0010I After 7522000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (758.04 seconds)\n", - "Cbc0010I After 7523000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (758.10 seconds)\n", - "Cbc0010I After 7524000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (758.16 seconds)\n", - "Cbc0010I After 7525000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (758.25 seconds)\n", - "Cbc0010I After 7526000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.29 seconds)\n", - "Cbc0010I After 7527000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (758.35 seconds)\n", - "Cbc0010I After 7528000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (758.42 seconds)\n", - "Cbc0010I After 7529000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (758.46 seconds)\n", - "Cbc0010I After 7530000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.49 seconds)\n", - "Cbc0010I After 7531000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (758.53 seconds)\n", - "Cbc0010I After 7532000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (758.59 seconds)\n", - "Cbc0010I After 7533000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (758.63 seconds)\n", - "Cbc0010I After 7534000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (758.67 seconds)\n", - "Cbc0010I After 7535000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (758.71 seconds)\n", - "Cbc0010I After 7536000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (758.74 seconds)\n", - "Cbc0010I After 7537000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (758.78 seconds)\n", - "Cbc0010I After 7538000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (758.82 seconds)\n", - "Cbc0010I After 7539000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (758.86 seconds)\n", - "Cbc0010I After 7540000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (758.90 seconds)\n", - "Cbc0010I After 7541000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (758.94 seconds)\n", - "Cbc0010I After 7542000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (758.98 seconds)\n", - "Cbc0010I After 7543000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.02 seconds)\n", - "Cbc0010I After 7544000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (759.08 seconds)\n", - "Cbc0010I After 7545000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.14 seconds)\n", - "Cbc0010I After 7546000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (759.21 seconds)\n", - "Cbc0010I After 7547000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (759.24 seconds)\n", - "Cbc0010I After 7548000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (759.28 seconds)\n", - "Cbc0010I After 7549000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (759.32 seconds)\n", - "Cbc0010I After 7550000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (759.35 seconds)\n", - "Cbc0010I After 7551000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (759.39 seconds)\n", - "Cbc0010I After 7552000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (759.43 seconds)\n", - "Cbc0010I After 7553000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (759.47 seconds)\n", - "Cbc0010I After 7554000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (759.50 seconds)\n", - "Cbc0010I After 7555000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (759.54 seconds)\n", - "Cbc0010I After 7556000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (759.62 seconds)\n", - "Cbc0010I After 7557000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (759.66 seconds)\n", - "Cbc0010I After 7558000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (759.73 seconds)\n", - "Cbc0010I After 7559000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (759.78 seconds)\n", - "Cbc0010I After 7560000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (759.86 seconds)\n", - "Cbc0010I After 7561000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (759.91 seconds)\n", - "Cbc0010I After 7562000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (759.98 seconds)\n", - "Cbc0010I After 7563000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (760.04 seconds)\n", - "Cbc0010I After 7564000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (760.10 seconds)\n", - "Cbc0010I After 7565000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (760.17 seconds)\n", - "Cbc0010I After 7566000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (760.29 seconds)\n", - "Cbc0010I After 7567000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (760.39 seconds)\n", - "Cbc0010I After 7568000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (760.49 seconds)\n", - "Cbc0010I After 7569000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (760.57 seconds)\n", - "Cbc0010I After 7570000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (760.66 seconds)\n", - "Cbc0010I After 7571000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (760.85 seconds)\n", - "Cbc0010I After 7572000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (760.95 seconds)\n", - "Cbc0010I After 7573000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (761.01 seconds)\n", - "Cbc0010I After 7574000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (761.09 seconds)\n", - "Cbc0010I After 7575000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (761.19 seconds)\n", - "Cbc0010I After 7576000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (761.30 seconds)\n", - "Cbc0010I After 7577000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (761.39 seconds)\n", - "Cbc0010I After 7578000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (761.44 seconds)\n", - "Cbc0010I After 7579000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (761.49 seconds)\n", - "Cbc0010I After 7580000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (761.53 seconds)\n", - "Cbc0010I After 7581000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (761.58 seconds)\n", - "Cbc0010I After 7582000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (761.63 seconds)\n", - "Cbc0010I After 7583000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (761.71 seconds)\n", - "Cbc0010I After 7584000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (761.76 seconds)\n", - "Cbc0010I After 7585000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (761.79 seconds)\n", - "Cbc0010I After 7586000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (761.83 seconds)\n", - "Cbc0010I After 7587000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (761.87 seconds)\n", - "Cbc0010I After 7588000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (761.91 seconds)\n", - "Cbc0010I After 7589000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (761.98 seconds)\n", - "Cbc0010I After 7590000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (762.02 seconds)\n", - "Cbc0010I After 7591000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (762.06 seconds)\n", - "Cbc0010I After 7592000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.10 seconds)\n", - "Cbc0010I After 7593000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (762.16 seconds)\n", - "Cbc0010I After 7594000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (762.24 seconds)\n", - "Cbc0010I After 7595000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (762.28 seconds)\n", - "Cbc0010I After 7596000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (762.32 seconds)\n", - "Cbc0010I After 7597000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (762.36 seconds)\n", - "Cbc0010I After 7598000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (762.39 seconds)\n", - "Cbc0010I After 7599000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (762.42 seconds)\n", - "Cbc0010I After 7600000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (762.46 seconds)\n", - "Cbc0010I After 7601000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (762.49 seconds)\n", - "Cbc0010I After 7602000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (762.53 seconds)\n", - "Cbc0010I After 7603000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (762.57 seconds)\n", - "Cbc0010I After 7604000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (762.61 seconds)\n", - "Cbc0010I After 7605000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.65 seconds)\n", - "Cbc0010I After 7606000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (762.69 seconds)\n", - "Cbc0010I After 7607000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (762.73 seconds)\n", - "Cbc0010I After 7608000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (762.76 seconds)\n", - "Cbc0010I After 7609000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (762.80 seconds)\n", - "Cbc0010I After 7610000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (762.83 seconds)\n", - "Cbc0010I After 7611000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (762.87 seconds)\n", - "Cbc0010I After 7612000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (762.91 seconds)\n", - "Cbc0010I After 7613000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (763.00 seconds)\n", - "Cbc0010I After 7614000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (763.07 seconds)\n", - "Cbc0010I After 7615000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.12 seconds)\n", - "Cbc0010I After 7616000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (763.15 seconds)\n", - "Cbc0010I After 7617000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (763.19 seconds)\n", - "Cbc0010I After 7618000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (763.22 seconds)\n", - "Cbc0010I After 7619000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (763.27 seconds)\n", - "Cbc0010I After 7620000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (763.31 seconds)\n", - "Cbc0010I After 7621000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (763.35 seconds)\n", - "Cbc0010I After 7622000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (763.40 seconds)\n", - "Cbc0010I After 7623000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (763.44 seconds)\n", - "Cbc0010I After 7624000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (763.48 seconds)\n", - "Cbc0010I After 7625000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.52 seconds)\n", - "Cbc0010I After 7626000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (763.55 seconds)\n", - "Cbc0010I After 7627000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (763.59 seconds)\n", - "Cbc0010I After 7628000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (763.63 seconds)\n", - "Cbc0010I After 7629000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (763.67 seconds)\n", - "Cbc0010I After 7630000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (763.71 seconds)\n", - "Cbc0010I After 7631000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (763.74 seconds)\n", - "Cbc0010I After 7632000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (763.78 seconds)\n", - "Cbc0010I After 7633000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (763.81 seconds)\n", - "Cbc0010I After 7634000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (763.85 seconds)\n", - "Cbc0010I After 7635000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (763.91 seconds)\n", - "Cbc0010I After 7636000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (763.98 seconds)\n", - "Cbc0010I After 7637000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (764.04 seconds)\n", - "Cbc0010I After 7638000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (764.12 seconds)\n", - "Cbc0010I After 7639000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (764.18 seconds)\n", - "Cbc0010I After 7640000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (764.22 seconds)\n", - "Cbc0010I After 7641000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (764.25 seconds)\n", - "Cbc0010I After 7642000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (764.30 seconds)\n", - "Cbc0010I After 7643000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (764.35 seconds)\n", - "Cbc0010I After 7644000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (764.41 seconds)\n", - "Cbc0010I After 7645000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (764.45 seconds)\n", - "Cbc0010I After 7646000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (764.48 seconds)\n", - "Cbc0010I After 7647000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (764.51 seconds)\n", - "Cbc0010I After 7648000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (764.55 seconds)\n", - "Cbc0010I After 7649000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (764.59 seconds)\n", - "Cbc0010I After 7650000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (764.63 seconds)\n", - "Cbc0010I After 7651000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (764.69 seconds)\n", - "Cbc0010I After 7652000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (764.73 seconds)\n", - "Cbc0010I After 7653000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (764.81 seconds)\n", - "Cbc0010I After 7654000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (764.93 seconds)\n", - "Cbc0010I After 7655000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (764.99 seconds)\n", - "Cbc0010I After 7656000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (765.08 seconds)\n", - "Cbc0010I After 7657000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (765.20 seconds)\n", - "Cbc0010I After 7658000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (765.30 seconds)\n", - "Cbc0010I After 7659000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (765.35 seconds)\n", - "Cbc0010I After 7660000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (765.39 seconds)\n", - "Cbc0010I After 7661000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (765.46 seconds)\n", - "Cbc0010I After 7662000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (765.54 seconds)\n", - "Cbc0010I After 7663000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (765.62 seconds)\n", - "Cbc0010I After 7664000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (765.67 seconds)\n", - "Cbc0010I After 7665000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (765.70 seconds)\n", - "Cbc0010I After 7666000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (765.74 seconds)\n", - "Cbc0010I After 7667000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (765.78 seconds)\n", - "Cbc0010I After 7668000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (765.82 seconds)\n", - "Cbc0010I After 7669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (765.86 seconds)\n", - "Cbc0010I After 7670000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (765.90 seconds)\n", - "Cbc0010I After 7671000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (765.95 seconds)\n", - "Cbc0010I After 7672000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (765.98 seconds)\n", - "Cbc0010I After 7673000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (766.02 seconds)\n", - "Cbc0010I After 7674000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (766.06 seconds)\n", - "Cbc0010I After 7675000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (766.11 seconds)\n", - "Cbc0010I After 7676000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (766.15 seconds)\n", - "Cbc0010I After 7677000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (766.18 seconds)\n", - "Cbc0010I After 7678000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (766.22 seconds)\n", - "Cbc0010I After 7679000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (766.26 seconds)\n", - "Cbc0010I After 7680000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (766.33 seconds)\n", - "Cbc0010I After 7681000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (766.37 seconds)\n", - "Cbc0010I After 7682000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (766.41 seconds)\n", - "Cbc0010I After 7683000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (766.44 seconds)\n", - "Cbc0010I After 7684000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (766.52 seconds)\n", - "Cbc0010I After 7685000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (766.58 seconds)\n", - "Cbc0010I After 7686000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (766.62 seconds)\n", - "Cbc0010I After 7687000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (766.66 seconds)\n", - "Cbc0010I After 7688000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (766.70 seconds)\n", - "Cbc0010I After 7689000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (766.75 seconds)\n", - "Cbc0010I After 7690000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (766.84 seconds)\n", - "Cbc0010I After 7691000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (766.92 seconds)\n", - "Cbc0010I After 7692000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (767.00 seconds)\n", - "Cbc0010I After 7693000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (767.08 seconds)\n", - "Cbc0010I After 7694000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (767.16 seconds)\n", - "Cbc0010I After 7695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (767.25 seconds)\n", - "Cbc0010I After 7696000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (767.34 seconds)\n", - "Cbc0010I After 7697000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (767.43 seconds)\n", - "Cbc0010I After 7698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (767.53 seconds)\n", - "Cbc0010I After 7699000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (767.65 seconds)\n", - "Cbc0010I After 7700000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (767.77 seconds)\n", - "Cbc0010I After 7701000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (767.88 seconds)\n", - "Cbc0010I After 7702000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (767.99 seconds)\n", - "Cbc0010I After 7703000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (768.12 seconds)\n", - "Cbc0010I After 7704000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (768.19 seconds)\n", - "Cbc0010I After 7705000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (768.24 seconds)\n", - "Cbc0010I After 7706000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (768.29 seconds)\n", - "Cbc0010I After 7707000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (768.35 seconds)\n", - "Cbc0010I After 7708000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (768.40 seconds)\n", - "Cbc0010I After 7709000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (768.45 seconds)\n", - "Cbc0010I After 7710000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (768.50 seconds)\n", - "Cbc0010I After 7711000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (768.55 seconds)\n", - "Cbc0010I After 7712000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (768.64 seconds)\n", - "Cbc0010I After 7713000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (768.72 seconds)\n", - "Cbc0010I After 7714000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (768.76 seconds)\n", - "Cbc0010I After 7715000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (768.79 seconds)\n", - "Cbc0010I After 7716000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (768.86 seconds)\n", - "Cbc0010I After 7717000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (768.90 seconds)\n", - "Cbc0010I After 7718000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (768.95 seconds)\n", - "Cbc0010I After 7719000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (769.03 seconds)\n", - "Cbc0010I After 7720000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.08 seconds)\n", - "Cbc0010I After 7721000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (769.12 seconds)\n", - "Cbc0010I After 7722000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (769.15 seconds)\n", - "Cbc0010I After 7723000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.19 seconds)\n", - "Cbc0010I After 7724000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (769.25 seconds)\n", - "Cbc0010I After 7725000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (769.31 seconds)\n", - "Cbc0010I After 7726000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (769.41 seconds)\n", - "Cbc0010I After 7727000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (769.54 seconds)\n", - "Cbc0010I After 7728000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (769.66 seconds)\n", - "Cbc0010I After 7729000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (769.79 seconds)\n", - "Cbc0010I After 7730000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (769.90 seconds)\n", - "Cbc0010I After 7731000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (770.02 seconds)\n", - "Cbc0010I After 7732000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.12 seconds)\n", - "Cbc0010I After 7733000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (770.22 seconds)\n", - "Cbc0010I After 7734000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (770.31 seconds)\n", - "Cbc0010I After 7735000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (770.38 seconds)\n", - "Cbc0010I After 7736000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (770.47 seconds)\n", - "Cbc0010I After 7737000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (770.57 seconds)\n", - "Cbc0010I After 7738000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.69 seconds)\n", - "Cbc0010I After 7739000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (770.78 seconds)\n", - "Cbc0010I After 7740000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (770.88 seconds)\n", - "Cbc0010I After 7741000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (770.96 seconds)\n", - "Cbc0010I After 7742000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (771.05 seconds)\n", - "Cbc0010I After 7743000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (771.13 seconds)\n", - "Cbc0010I After 7744000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (771.20 seconds)\n", - "Cbc0010I After 7745000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (771.25 seconds)\n", - "Cbc0010I After 7746000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (771.29 seconds)\n", - "Cbc0010I After 7747000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (771.33 seconds)\n", - "Cbc0010I After 7748000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.40 seconds)\n", - "Cbc0010I After 7749000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (771.44 seconds)\n", - "Cbc0010I After 7750000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (771.48 seconds)\n", - "Cbc0010I After 7751000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.52 seconds)\n", - "Cbc0010I After 7752000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (771.56 seconds)\n", - "Cbc0010I After 7753000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (771.61 seconds)\n", - "Cbc0010I After 7754000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (771.65 seconds)\n", - "Cbc0010I After 7755000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (771.69 seconds)\n", - "Cbc0010I After 7756000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (771.73 seconds)\n", - "Cbc0010I After 7757000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (771.76 seconds)\n", - "Cbc0010I After 7758000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (771.81 seconds)\n", - "Cbc0010I After 7759000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (771.89 seconds)\n", - "Cbc0010I After 7760000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (771.92 seconds)\n", - "Cbc0010I After 7761000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (771.95 seconds)\n", - "Cbc0010I After 7762000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (771.99 seconds)\n", - "Cbc0010I After 7763000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (772.03 seconds)\n", - "Cbc0010I After 7764000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (772.06 seconds)\n", - "Cbc0010I After 7765000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (772.10 seconds)\n", - "Cbc0010I After 7766000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (772.14 seconds)\n", - "Cbc0010I After 7767000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (772.19 seconds)\n", - "Cbc0010I After 7768000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (772.22 seconds)\n", - "Cbc0010I After 7769000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (772.27 seconds)\n", - "Cbc0010I After 7770000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (772.32 seconds)\n", - "Cbc0010I After 7771000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (772.39 seconds)\n", - "Cbc0010I After 7772000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (772.46 seconds)\n", - "Cbc0010I After 7773000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (772.53 seconds)\n", - "Cbc0010I After 7774000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (772.60 seconds)\n", - "Cbc0010I After 7775000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (772.64 seconds)\n", - "Cbc0010I After 7776000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (772.68 seconds)\n", - "Cbc0010I After 7777000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (772.74 seconds)\n", - "Cbc0010I After 7778000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (772.80 seconds)\n", - "Cbc0010I After 7779000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (772.85 seconds)\n", - "Cbc0010I After 7780000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (772.91 seconds)\n", - "Cbc0010I After 7781000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (772.97 seconds)\n", - "Cbc0010I After 7782000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (773.04 seconds)\n", - "Cbc0010I After 7783000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (773.10 seconds)\n", - "Cbc0010I After 7784000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (773.17 seconds)\n", - "Cbc0010I After 7785000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (773.23 seconds)\n", - "Cbc0010I After 7786000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (773.29 seconds)\n", - "Cbc0010I After 7787000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (773.35 seconds)\n", - "Cbc0010I After 7788000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (773.39 seconds)\n", - "Cbc0010I After 7789000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (773.43 seconds)\n", - "Cbc0010I After 7790000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (773.46 seconds)\n", - "Cbc0010I After 7791000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (773.50 seconds)\n", - "Cbc0010I After 7792000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (773.54 seconds)\n", - "Cbc0010I After 7793000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (773.58 seconds)\n", - "Cbc0010I After 7794000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (773.63 seconds)\n", - "Cbc0010I After 7795000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (773.68 seconds)\n", - "Cbc0010I After 7796000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (773.75 seconds)\n", - "Cbc0010I After 7797000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (773.79 seconds)\n", - "Cbc0010I After 7798000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (773.83 seconds)\n", - "Cbc0010I After 7799000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (773.86 seconds)\n", - "Cbc0010I After 7800000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (773.89 seconds)\n", - "Cbc0010I After 7801000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (773.93 seconds)\n", - "Cbc0010I After 7802000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (773.96 seconds)\n", - "Cbc0010I After 7803000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (774.00 seconds)\n", - "Cbc0010I After 7804000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (774.03 seconds)\n", - "Cbc0010I After 7805000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (774.08 seconds)\n", - "Cbc0010I After 7806000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (774.14 seconds)\n", - "Cbc0010I After 7807000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (774.18 seconds)\n", - "Cbc0010I After 7808000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (774.24 seconds)\n", - "Cbc0010I After 7809000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (774.28 seconds)\n", - "Cbc0010I After 7810000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (774.33 seconds)\n", - "Cbc0010I After 7811000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (774.39 seconds)\n", - "Cbc0010I After 7812000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (774.45 seconds)\n", - "Cbc0010I After 7813000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (774.50 seconds)\n", - "Cbc0010I After 7814000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (774.53 seconds)\n", - "Cbc0010I After 7815000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (774.56 seconds)\n", - "Cbc0010I After 7816000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (774.60 seconds)\n", - "Cbc0010I After 7817000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (774.63 seconds)\n", - "Cbc0010I After 7818000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (774.67 seconds)\n", - "Cbc0010I After 7819000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (774.70 seconds)\n", - "Cbc0010I After 7820000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (774.75 seconds)\n", - "Cbc0010I After 7821000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (774.81 seconds)\n", - "Cbc0010I After 7822000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (774.87 seconds)\n", - "Cbc0010I After 7823000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (774.92 seconds)\n", - "Cbc0010I After 7824000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (774.95 seconds)\n", - "Cbc0010I After 7825000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (774.99 seconds)\n", - "Cbc0010I After 7826000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (775.03 seconds)\n", - "Cbc0010I After 7827000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (775.07 seconds)\n", - "Cbc0010I After 7828000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (775.13 seconds)\n", - "Cbc0010I After 7829000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (775.18 seconds)\n", - "Cbc0010I After 7830000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (775.23 seconds)\n", - "Cbc0010I After 7831000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (775.28 seconds)\n", - "Cbc0010I After 7832000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (775.32 seconds)\n", - "Cbc0010I After 7833000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (775.36 seconds)\n", - "Cbc0010I After 7834000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (775.39 seconds)\n", - "Cbc0010I After 7835000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (775.43 seconds)\n", - "Cbc0010I After 7836000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (775.47 seconds)\n", - "Cbc0010I After 7837000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (775.51 seconds)\n", - "Cbc0010I After 7838000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (775.58 seconds)\n", - "Cbc0010I After 7839000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (775.64 seconds)\n", - "Cbc0010I After 7840000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (775.69 seconds)\n", - "Cbc0010I After 7841000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (775.73 seconds)\n", - "Cbc0010I After 7842000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (775.78 seconds)\n", - "Cbc0010I After 7843000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (775.83 seconds)\n", - "Cbc0010I After 7844000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (775.88 seconds)\n", - "Cbc0010I After 7845000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (775.94 seconds)\n", - "Cbc0010I After 7846000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (775.97 seconds)\n", - "Cbc0010I After 7847000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (776.01 seconds)\n", - "Cbc0010I After 7848000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (776.06 seconds)\n", - "Cbc0010I After 7849000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (776.09 seconds)\n", - "Cbc0010I After 7850000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (776.14 seconds)\n", - "Cbc0010I After 7851000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (776.18 seconds)\n", - "Cbc0010I After 7852000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (776.24 seconds)\n", - "Cbc0010I After 7853000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (776.38 seconds)\n", - "Cbc0010I After 7854000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (776.46 seconds)\n", - "Cbc0010I After 7855000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (776.52 seconds)\n", - "Cbc0010I After 7856000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (776.58 seconds)\n", - "Cbc0010I After 7857000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (776.64 seconds)\n", - "Cbc0010I After 7858000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (776.69 seconds)\n", - "Cbc0010I After 7859000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (776.73 seconds)\n", - "Cbc0010I After 7860000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (776.79 seconds)\n", - "Cbc0010I After 7861000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (776.83 seconds)\n", - "Cbc0010I After 7862000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (776.88 seconds)\n", - "Cbc0010I After 7863000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (776.93 seconds)\n", - "Cbc0010I After 7864000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (776.97 seconds)\n", - "Cbc0010I After 7865000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (777.02 seconds)\n", - "Cbc0010I After 7866000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (777.07 seconds)\n", - "Cbc0010I After 7867000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (777.12 seconds)\n", - "Cbc0010I After 7868000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (777.17 seconds)\n", - "Cbc0010I After 7869000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (777.22 seconds)\n", - "Cbc0010I After 7870000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (777.26 seconds)\n", - "Cbc0010I After 7871000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (777.31 seconds)\n", - "Cbc0010I After 7872000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (777.35 seconds)\n", - "Cbc0010I After 7873000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (777.39 seconds)\n", - "Cbc0010I After 7874000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (777.43 seconds)\n", - "Cbc0010I After 7875000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.48 seconds)\n", - "Cbc0010I After 7876000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.54 seconds)\n", - "Cbc0010I After 7877000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (777.58 seconds)\n", - "Cbc0010I After 7878000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (777.64 seconds)\n", - "Cbc0010I After 7879000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (777.73 seconds)\n", - "Cbc0010I After 7880000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (777.80 seconds)\n", - "Cbc0010I After 7881000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (777.86 seconds)\n", - "Cbc0010I After 7882000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (777.94 seconds)\n", - "Cbc0010I After 7883000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (778.02 seconds)\n", - "Cbc0010I After 7884000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (778.07 seconds)\n", - "Cbc0010I After 7885000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (778.12 seconds)\n", - "Cbc0010I After 7886000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (778.17 seconds)\n", - "Cbc0010I After 7887000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (778.22 seconds)\n", - "Cbc0010I After 7888000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (778.28 seconds)\n", - "Cbc0010I After 7889000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (778.32 seconds)\n", - "Cbc0010I After 7890000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (778.37 seconds)\n", - "Cbc0010I After 7891000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.42 seconds)\n", - "Cbc0010I After 7892000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.47 seconds)\n", - "Cbc0010I After 7893000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (778.52 seconds)\n", - "Cbc0010I After 7894000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (778.56 seconds)\n", - "Cbc0010I After 7895000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (778.61 seconds)\n", - "Cbc0010I After 7896000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (778.66 seconds)\n", - "Cbc0010I After 7897000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (778.71 seconds)\n", - "Cbc0010I After 7898000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (778.76 seconds)\n", - "Cbc0010I After 7899000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (778.80 seconds)\n", - "Cbc0010I After 7900000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (778.84 seconds)\n", - "Cbc0010I After 7901000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (778.89 seconds)\n", - "Cbc0010I After 7902000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (778.95 seconds)\n", - "Cbc0010I After 7903000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (778.99 seconds)\n", - "Cbc0010I After 7904000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.03 seconds)\n", - "Cbc0010I After 7905000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (779.09 seconds)\n", - "Cbc0010I After 7906000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (779.13 seconds)\n", - "Cbc0010I After 7907000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.18 seconds)\n", - "Cbc0010I After 7908000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (779.23 seconds)\n", - "Cbc0010I After 7909000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (779.28 seconds)\n", - "Cbc0010I After 7910000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (779.35 seconds)\n", - "Cbc0010I After 7911000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (779.39 seconds)\n", - "Cbc0010I After 7912000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (779.44 seconds)\n", - "Cbc0010I After 7913000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (779.50 seconds)\n", - "Cbc0010I After 7914000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (779.54 seconds)\n", - "Cbc0010I After 7915000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (779.58 seconds)\n", - "Cbc0010I After 7916000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.61 seconds)\n", - "Cbc0010I After 7917000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (779.65 seconds)\n", - "Cbc0010I After 7918000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (779.68 seconds)\n", - "Cbc0010I After 7919000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.73 seconds)\n", - "Cbc0010I After 7920000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (779.77 seconds)\n", - "Cbc0010I After 7921000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (779.82 seconds)\n", - "Cbc0010I After 7922000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (779.88 seconds)\n", - "Cbc0010I After 7923000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (779.93 seconds)\n", - "Cbc0010I After 7924000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (779.98 seconds)\n", - "Cbc0010I After 7925000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (780.04 seconds)\n", - "Cbc0010I After 7926000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (780.09 seconds)\n", - "Cbc0010I After 7927000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (780.13 seconds)\n", - "Cbc0010I After 7928000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (780.18 seconds)\n", - "Cbc0010I After 7929000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (780.23 seconds)\n", - "Cbc0010I After 7930000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (780.27 seconds)\n", - "Cbc0010I After 7931000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.31 seconds)\n", - "Cbc0010I After 7932000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.38 seconds)\n", - "Cbc0010I After 7933000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (780.44 seconds)\n", - "Cbc0010I After 7934000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (780.48 seconds)\n", - "Cbc0010I After 7935000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (780.52 seconds)\n", - "Cbc0010I After 7936000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.56 seconds)\n", - "Cbc0010I After 7937000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.60 seconds)\n", - "Cbc0010I After 7938000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (780.64 seconds)\n", - "Cbc0010I After 7939000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (780.68 seconds)\n", - "Cbc0010I After 7940000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (780.72 seconds)\n", - "Cbc0010I After 7941000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (780.77 seconds)\n", - "Cbc0010I After 7942000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (780.82 seconds)\n", - "Cbc0010I After 7943000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (780.86 seconds)\n", - "Cbc0010I After 7944000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (780.90 seconds)\n", - "Cbc0010I After 7945000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (780.96 seconds)\n", - "Cbc0010I After 7946000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (781.01 seconds)\n", - "Cbc0010I After 7947000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (781.05 seconds)\n", - "Cbc0010I After 7948000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (781.10 seconds)\n", - "Cbc0010I After 7949000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (781.15 seconds)\n", - "Cbc0010I After 7950000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (781.21 seconds)\n", - "Cbc0010I After 7951000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (781.26 seconds)\n", - "Cbc0010I After 7952000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (781.30 seconds)\n", - "Cbc0010I After 7953000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (781.35 seconds)\n", - "Cbc0010I After 7954000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (781.42 seconds)\n", - "Cbc0010I After 7955000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (781.46 seconds)\n", - "Cbc0010I After 7956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (781.51 seconds)\n", - "Cbc0010I After 7957000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (781.55 seconds)\n", - "Cbc0010I After 7958000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (781.61 seconds)\n", - "Cbc0010I After 7959000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (781.68 seconds)\n", - "Cbc0010I After 7960000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (781.73 seconds)\n", - "Cbc0010I After 7961000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (781.77 seconds)\n", - "Cbc0010I After 7962000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (781.81 seconds)\n", - "Cbc0010I After 7963000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (781.85 seconds)\n", - "Cbc0010I After 7964000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (781.88 seconds)\n", - "Cbc0010I After 7965000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (781.96 seconds)\n", - "Cbc0010I After 7966000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (782.01 seconds)\n", - "Cbc0010I After 7967000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (782.05 seconds)\n", - "Cbc0010I After 7968000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (782.09 seconds)\n", - "Cbc0010I After 7969000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (782.14 seconds)\n", - "Cbc0010I After 7970000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (782.20 seconds)\n", - "Cbc0010I After 7971000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (782.24 seconds)\n", - "Cbc0010I After 7972000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (782.28 seconds)\n", - "Cbc0010I After 7973000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (782.32 seconds)\n", - "Cbc0010I After 7974000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (782.38 seconds)\n", - "Cbc0010I After 7975000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (782.43 seconds)\n", - "Cbc0010I After 7976000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (782.48 seconds)\n", - "Cbc0010I After 7977000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (782.51 seconds)\n", - "Cbc0010I After 7978000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (782.56 seconds)\n", - "Cbc0010I After 7979000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (782.62 seconds)\n", - "Cbc0010I After 7980000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (782.67 seconds)\n", - "Cbc0010I After 7981000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (782.73 seconds)\n", - "Cbc0010I After 7982000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (782.78 seconds)\n", - "Cbc0010I After 7983000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (782.83 seconds)\n", - "Cbc0010I After 7984000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (782.87 seconds)\n", - "Cbc0010I After 7985000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (782.91 seconds)\n", - "Cbc0010I After 7986000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (782.94 seconds)\n", - "Cbc0010I After 7987000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (782.97 seconds)\n", - "Cbc0010I After 7988000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (783.01 seconds)\n", - "Cbc0010I After 7989000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (783.05 seconds)\n", - "Cbc0010I After 7990000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (783.09 seconds)\n", - "Cbc0010I After 7991000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (783.14 seconds)\n", - "Cbc0010I After 7992000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (783.18 seconds)\n", - "Cbc0010I After 7993000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (783.21 seconds)\n", - "Cbc0010I After 7994000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (783.26 seconds)\n", - "Cbc0010I After 7995000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (783.31 seconds)\n", - "Cbc0010I After 7996000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (783.35 seconds)\n", - "Cbc0010I After 7997000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (783.38 seconds)\n", - "Cbc0010I After 7998000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (783.41 seconds)\n", - "Cbc0010I After 7999000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (783.44 seconds)\n", - "Cbc0010I After 8000000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (783.49 seconds)\n", - "Cbc0010I After 8001000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (783.54 seconds)\n", - "Cbc0010I After 8002000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (783.58 seconds)\n", - "Cbc0010I After 8003000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (783.63 seconds)\n", - "Cbc0010I After 8004000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (783.69 seconds)\n", - "Cbc0010I After 8005000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (783.74 seconds)\n", - "Cbc0010I After 8006000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (783.82 seconds)\n", - "Cbc0010I After 8007000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (783.90 seconds)\n", - "Cbc0010I After 8008000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (784.00 seconds)\n", - "Cbc0010I After 8009000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (784.04 seconds)\n", - "Cbc0010I After 8010000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (784.10 seconds)\n", - "Cbc0010I After 8011000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (784.15 seconds)\n", - "Cbc0010I After 8012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (784.18 seconds)\n", - "Cbc0010I After 8013000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (784.24 seconds)\n", - "Cbc0010I After 8014000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (784.30 seconds)\n", - "Cbc0010I After 8015000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (784.37 seconds)\n", - "Cbc0010I After 8016000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (784.43 seconds)\n", - "Cbc0010I After 8017000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (784.47 seconds)\n", - "Cbc0010I After 8018000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (784.50 seconds)\n", - "Cbc0010I After 8019000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (784.54 seconds)\n", - "Cbc0010I After 8020000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (784.60 seconds)\n", - "Cbc0010I After 8021000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (784.65 seconds)\n", - "Cbc0010I After 8022000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (784.70 seconds)\n", - "Cbc0010I After 8023000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (784.73 seconds)\n", - "Cbc0010I After 8024000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (784.80 seconds)\n", - "Cbc0010I After 8025000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (784.86 seconds)\n", - "Cbc0010I After 8026000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (784.92 seconds)\n", - "Cbc0010I After 8027000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (784.96 seconds)\n", - "Cbc0010I After 8028000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (785.00 seconds)\n", - "Cbc0010I After 8029000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (785.04 seconds)\n", - "Cbc0010I After 8030000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (785.07 seconds)\n", - "Cbc0010I After 8031000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.11 seconds)\n", - "Cbc0010I After 8032000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.15 seconds)\n", - "Cbc0010I After 8033000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (785.21 seconds)\n", - "Cbc0010I After 8034000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (785.25 seconds)\n", - "Cbc0010I After 8035000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (785.36 seconds)\n", - "Cbc0010I After 8036000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (785.42 seconds)\n", - "Cbc0010I After 8037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (785.46 seconds)\n", - "Cbc0010I After 8038000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (785.57 seconds)\n", - "Cbc0010I After 8039000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (785.66 seconds)\n", - "Cbc0010I After 8040000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (785.75 seconds)\n", - "Cbc0010I After 8041000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (785.85 seconds)\n", - "Cbc0010I After 8042000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (785.88 seconds)\n", - "Cbc0010I After 8043000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (785.96 seconds)\n", - "Cbc0010I After 8044000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (786.00 seconds)\n", - "Cbc0010I After 8045000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (786.03 seconds)\n", - "Cbc0010I After 8046000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (786.08 seconds)\n", - "Cbc0010I After 8047000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (786.11 seconds)\n", - "Cbc0010I After 8048000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (786.16 seconds)\n", - "Cbc0010I After 8049000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (786.20 seconds)\n", - "Cbc0010I After 8050000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (786.24 seconds)\n", - "Cbc0010I After 8051000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (786.28 seconds)\n", - "Cbc0010I After 8052000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (786.31 seconds)\n", - "Cbc0010I After 8053000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (786.38 seconds)\n", - "Cbc0010I After 8054000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (786.42 seconds)\n", - "Cbc0010I After 8055000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (786.45 seconds)\n", - "Cbc0010I After 8056000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (786.52 seconds)\n", - "Cbc0010I After 8057000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (786.57 seconds)\n", - "Cbc0010I After 8058000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (786.60 seconds)\n", - "Cbc0010I After 8059000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (786.63 seconds)\n", - "Cbc0010I After 8060000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (786.67 seconds)\n", - "Cbc0010I After 8061000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (786.71 seconds)\n", - "Cbc0010I After 8062000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (786.75 seconds)\n", - "Cbc0010I After 8063000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (786.81 seconds)\n", - "Cbc0010I After 8064000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (786.85 seconds)\n", - "Cbc0010I After 8065000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (786.89 seconds)\n", - "Cbc0010I After 8066000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (786.96 seconds)\n", - "Cbc0010I After 8067000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (787.00 seconds)\n", - "Cbc0010I After 8068000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (787.03 seconds)\n", - "Cbc0010I After 8069000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (787.07 seconds)\n", - "Cbc0010I After 8070000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (787.11 seconds)\n", - "Cbc0010I After 8071000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (787.15 seconds)\n", - "Cbc0010I After 8072000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (787.22 seconds)\n", - "Cbc0010I After 8073000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (787.27 seconds)\n", - "Cbc0010I After 8074000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (787.32 seconds)\n", - "Cbc0010I After 8075000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (787.40 seconds)\n", - "Cbc0010I After 8076000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (787.45 seconds)\n", - "Cbc0010I After 8077000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (787.52 seconds)\n", - "Cbc0010I After 8078000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (787.63 seconds)\n", - "Cbc0010I After 8079000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (787.72 seconds)\n", - "Cbc0010I After 8080000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (787.80 seconds)\n", - "Cbc0010I After 8081000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (787.88 seconds)\n", - "Cbc0010I After 8082000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (787.93 seconds)\n", - "Cbc0010I After 8083000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (787.97 seconds)\n", - "Cbc0010I After 8084000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (788.06 seconds)\n", - "Cbc0010I After 8085000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (788.14 seconds)\n", - "Cbc0010I After 8086000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (788.24 seconds)\n", - "Cbc0010I After 8087000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (788.29 seconds)\n", - "Cbc0010I After 8088000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (788.33 seconds)\n", - "Cbc0010I After 8089000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (788.38 seconds)\n", - "Cbc0010I After 8090000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (788.44 seconds)\n", - "Cbc0010I After 8091000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (788.49 seconds)\n", - "Cbc0010I After 8092000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (788.53 seconds)\n", - "Cbc0010I After 8093000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (788.59 seconds)\n", - "Cbc0010I After 8094000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (788.65 seconds)\n", - "Cbc0010I After 8095000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (788.72 seconds)\n", - "Cbc0010I After 8096000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (788.78 seconds)\n", - "Cbc0010I After 8097000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (788.83 seconds)\n", - "Cbc0010I After 8098000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (788.88 seconds)\n", - "Cbc0010I After 8099000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (788.92 seconds)\n", - "Cbc0010I After 8100000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (788.97 seconds)\n", - "Cbc0010I After 8101000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (789.05 seconds)\n", - "Cbc0010I After 8102000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (789.08 seconds)\n", - "Cbc0010I After 8103000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (789.12 seconds)\n", - "Cbc0010I After 8104000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (789.15 seconds)\n", - "Cbc0010I After 8105000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (789.20 seconds)\n", - "Cbc0010I After 8106000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (789.23 seconds)\n", - "Cbc0010I After 8107000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (789.27 seconds)\n", - "Cbc0010I After 8108000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (789.30 seconds)\n", - "Cbc0010I After 8109000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (789.36 seconds)\n", - "Cbc0010I After 8110000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (789.41 seconds)\n", - "Cbc0010I After 8111000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (789.44 seconds)\n", - "Cbc0010I After 8112000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (789.48 seconds)\n", - "Cbc0010I After 8113000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (789.51 seconds)\n", - "Cbc0010I After 8114000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (789.55 seconds)\n", - "Cbc0010I After 8115000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (789.58 seconds)\n", - "Cbc0010I After 8116000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (789.62 seconds)\n", - "Cbc0010I After 8117000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (789.67 seconds)\n", - "Cbc0010I After 8118000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (789.71 seconds)\n", - "Cbc0010I After 8119000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (789.74 seconds)\n", - "Cbc0010I After 8120000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (789.78 seconds)\n", - "Cbc0010I After 8121000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (789.83 seconds)\n", - "Cbc0010I After 8122000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (789.88 seconds)\n", - "Cbc0010I After 8123000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (789.92 seconds)\n", - "Cbc0010I After 8124000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (789.98 seconds)\n", - "Cbc0010I After 8125000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (790.03 seconds)\n", - "Cbc0010I After 8126000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (790.08 seconds)\n", - "Cbc0010I After 8127000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (790.13 seconds)\n", - "Cbc0010I After 8128000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (790.18 seconds)\n", - "Cbc0010I After 8129000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (790.22 seconds)\n", - "Cbc0010I After 8130000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (790.29 seconds)\n", - "Cbc0010I After 8131000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (790.35 seconds)\n", - "Cbc0010I After 8132000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (790.42 seconds)\n", - "Cbc0010I After 8133000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (790.47 seconds)\n", - "Cbc0010I After 8134000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (790.54 seconds)\n", - "Cbc0010I After 8135000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (790.58 seconds)\n", - "Cbc0010I After 8136000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (790.63 seconds)\n", - "Cbc0010I After 8137000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (790.66 seconds)\n", - "Cbc0010I After 8138000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (790.69 seconds)\n", - "Cbc0010I After 8139000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (790.73 seconds)\n", - "Cbc0010I After 8140000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (790.80 seconds)\n", - "Cbc0010I After 8141000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (790.85 seconds)\n", - "Cbc0010I After 8142000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (790.89 seconds)\n", - "Cbc0010I After 8143000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (790.93 seconds)\n", - "Cbc0010I After 8144000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (790.98 seconds)\n", - "Cbc0010I After 8145000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (791.01 seconds)\n", - "Cbc0010I After 8146000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (791.05 seconds)\n", - "Cbc0010I After 8147000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (791.08 seconds)\n", - "Cbc0010I After 8148000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (791.11 seconds)\n", - "Cbc0010I After 8149000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (791.15 seconds)\n", - "Cbc0010I After 8150000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (791.19 seconds)\n", - "Cbc0010I After 8151000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (791.22 seconds)\n", - "Cbc0010I After 8152000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (791.28 seconds)\n", - "Cbc0010I After 8153000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (791.37 seconds)\n", - "Cbc0010I After 8154000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (791.42 seconds)\n", - "Cbc0010I After 8155000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (791.48 seconds)\n", - "Cbc0010I After 8156000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (791.56 seconds)\n", - "Cbc0010I After 8157000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (791.64 seconds)\n", - "Cbc0010I After 8158000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (791.71 seconds)\n", - "Cbc0010I After 8159000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (791.77 seconds)\n", - "Cbc0010I After 8160000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (791.81 seconds)\n", - "Cbc0010I After 8161000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (791.85 seconds)\n", - "Cbc0010I After 8162000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (791.89 seconds)\n", - "Cbc0010I After 8163000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (791.92 seconds)\n", - "Cbc0010I After 8164000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (791.96 seconds)\n", - "Cbc0010I After 8165000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (792.00 seconds)\n", - "Cbc0010I After 8166000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (792.05 seconds)\n", - "Cbc0010I After 8167000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (792.09 seconds)\n", - "Cbc0010I After 8168000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (792.14 seconds)\n", - "Cbc0010I After 8169000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (792.18 seconds)\n", - "Cbc0010I After 8170000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (792.23 seconds)\n", - "Cbc0010I After 8171000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (792.31 seconds)\n", - "Cbc0010I After 8172000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (792.37 seconds)\n", - "Cbc0010I After 8173000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (792.41 seconds)\n", - "Cbc0010I After 8174000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (792.45 seconds)\n", - "Cbc0010I After 8175000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (792.51 seconds)\n", - "Cbc0010I After 8176000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (792.55 seconds)\n", - "Cbc0010I After 8177000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (792.59 seconds)\n", - "Cbc0010I After 8178000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (792.62 seconds)\n", - "Cbc0010I After 8179000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (792.69 seconds)\n", - "Cbc0010I After 8180000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (792.76 seconds)\n", - "Cbc0010I After 8181000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (792.80 seconds)\n", - "Cbc0010I After 8182000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (792.84 seconds)\n", - "Cbc0010I After 8183000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (792.89 seconds)\n", - "Cbc0010I After 8184000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (792.97 seconds)\n", - "Cbc0010I After 8185000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (793.04 seconds)\n", - "Cbc0010I After 8186000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (793.11 seconds)\n", - "Cbc0010I After 8187000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (793.18 seconds)\n", - "Cbc0010I After 8188000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (793.25 seconds)\n", - "Cbc0010I After 8189000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (793.28 seconds)\n", - "Cbc0010I After 8190000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (793.31 seconds)\n", - "Cbc0010I After 8191000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (793.35 seconds)\n", - "Cbc0010I After 8192000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (793.38 seconds)\n", - "Cbc0010I After 8193000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (793.42 seconds)\n", - "Cbc0010I After 8194000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (793.46 seconds)\n", - "Cbc0010I After 8195000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (793.55 seconds)\n", - "Cbc0010I After 8196000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (793.61 seconds)\n", - "Cbc0010I After 8197000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (793.66 seconds)\n", - "Cbc0010I After 8198000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (793.69 seconds)\n", - "Cbc0010I After 8199000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (793.75 seconds)\n", - "Cbc0010I After 8200000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (793.79 seconds)\n", - "Cbc0010I After 8201000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (793.82 seconds)\n", - "Cbc0010I After 8202000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (793.86 seconds)\n", - "Cbc0010I After 8203000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (793.90 seconds)\n", - "Cbc0010I After 8204000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (793.93 seconds)\n", - "Cbc0010I After 8205000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (793.97 seconds)\n", - "Cbc0010I After 8206000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (794.00 seconds)\n", - "Cbc0010I After 8207000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (794.04 seconds)\n", - "Cbc0010I After 8208000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (794.09 seconds)\n", - "Cbc0010I After 8209000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (794.14 seconds)\n", - "Cbc0010I After 8210000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (794.21 seconds)\n", - "Cbc0010I After 8211000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (794.26 seconds)\n", - "Cbc0010I After 8212000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (794.31 seconds)\n", - "Cbc0010I After 8213000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (794.34 seconds)\n", - "Cbc0010I After 8214000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (794.38 seconds)\n", - "Cbc0010I After 8215000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (794.41 seconds)\n", - "Cbc0010I After 8216000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (794.45 seconds)\n", - "Cbc0010I After 8217000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (794.49 seconds)\n", - "Cbc0010I After 8218000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (794.52 seconds)\n", - "Cbc0010I After 8219000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (794.56 seconds)\n", - "Cbc0010I After 8220000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (794.60 seconds)\n", - "Cbc0010I After 8221000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (794.63 seconds)\n", - "Cbc0010I After 8222000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (794.67 seconds)\n", - "Cbc0010I After 8223000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (794.71 seconds)\n", - "Cbc0010I After 8224000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (794.76 seconds)\n", - "Cbc0010I After 8225000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (794.84 seconds)\n", - "Cbc0010I After 8226000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (794.89 seconds)\n", - "Cbc0010I After 8227000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (794.93 seconds)\n", - "Cbc0010I After 8228000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (794.97 seconds)\n", - "Cbc0010I After 8229000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (795.01 seconds)\n", - "Cbc0010I After 8230000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (795.06 seconds)\n", - "Cbc0010I After 8231000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (795.09 seconds)\n", - "Cbc0010I After 8232000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (795.13 seconds)\n", - "Cbc0010I After 8233000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (795.17 seconds)\n", - "Cbc0010I After 8234000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (795.21 seconds)\n", - "Cbc0010I After 8235000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (795.25 seconds)\n", - "Cbc0010I After 8236000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.29 seconds)\n", - "Cbc0010I After 8237000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (795.33 seconds)\n", - "Cbc0010I After 8238000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (795.36 seconds)\n", - "Cbc0010I After 8239000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.42 seconds)\n", - "Cbc0010I After 8240000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (795.50 seconds)\n", - "Cbc0010I After 8241000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (795.57 seconds)\n", - "Cbc0010I After 8242000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (795.64 seconds)\n", - "Cbc0010I After 8243000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (795.72 seconds)\n", - "Cbc0010I After 8244000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (795.79 seconds)\n", - "Cbc0010I After 8245000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (795.87 seconds)\n", - "Cbc0010I After 8246000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (795.95 seconds)\n", - "Cbc0010I After 8247000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (796.03 seconds)\n", - "Cbc0010I After 8248000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (796.12 seconds)\n", - "Cbc0010I After 8249000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (796.19 seconds)\n", - "Cbc0010I After 8250000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (796.23 seconds)\n", - "Cbc0010I After 8251000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (796.27 seconds)\n", - "Cbc0010I After 8252000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (796.30 seconds)\n", - "Cbc0010I After 8253000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (796.33 seconds)\n", - "Cbc0010I After 8254000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (796.39 seconds)\n", - "Cbc0010I After 8255000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (796.43 seconds)\n", - "Cbc0010I After 8256000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (796.47 seconds)\n", - "Cbc0010I After 8257000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (796.50 seconds)\n", - "Cbc0010I After 8258000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (796.55 seconds)\n", - "Cbc0010I After 8259000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (796.58 seconds)\n", - "Cbc0010I After 8260000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (796.62 seconds)\n", - "Cbc0010I After 8261000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (796.66 seconds)\n", - "Cbc0010I After 8262000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (796.70 seconds)\n", - "Cbc0010I After 8263000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (796.75 seconds)\n", - "Cbc0010I After 8264000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (796.86 seconds)\n", - "Cbc0010I After 8265000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (796.93 seconds)\n", - "Cbc0010I After 8266000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (796.99 seconds)\n", - "Cbc0010I After 8267000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (797.05 seconds)\n", - "Cbc0010I After 8268000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (797.12 seconds)\n", - "Cbc0010I After 8269000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (797.17 seconds)\n", - "Cbc0010I After 8270000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (797.23 seconds)\n", - "Cbc0010I After 8271000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (797.30 seconds)\n", - "Cbc0010I After 8272000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (797.36 seconds)\n", - "Cbc0010I After 8273000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (797.44 seconds)\n", - "Cbc0010I After 8274000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (797.50 seconds)\n", - "Cbc0010I After 8275000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (797.56 seconds)\n", - "Cbc0010I After 8276000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (797.62 seconds)\n", - "Cbc0010I After 8277000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (797.67 seconds)\n", - "Cbc0010I After 8278000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (797.70 seconds)\n", - "Cbc0010I After 8279000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (797.75 seconds)\n", - "Cbc0010I After 8280000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (797.79 seconds)\n", - "Cbc0010I After 8281000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (797.84 seconds)\n", - "Cbc0010I After 8282000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (797.87 seconds)\n", - "Cbc0010I After 8283000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (797.92 seconds)\n", - "Cbc0010I After 8284000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (797.98 seconds)\n", - "Cbc0010I After 8285000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (798.05 seconds)\n", - "Cbc0010I After 8286000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (798.11 seconds)\n", - "Cbc0010I After 8287000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (798.17 seconds)\n", - "Cbc0010I After 8288000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (798.21 seconds)\n", - "Cbc0010I After 8289000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (798.27 seconds)\n", - "Cbc0010I After 8290000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (798.33 seconds)\n", - "Cbc0010I After 8291000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (798.41 seconds)\n", - "Cbc0010I After 8292000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (798.47 seconds)\n", - "Cbc0010I After 8293000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (798.53 seconds)\n", - "Cbc0010I After 8294000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (798.59 seconds)\n", - "Cbc0010I After 8295000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (798.62 seconds)\n", - "Cbc0010I After 8296000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (798.66 seconds)\n", - "Cbc0010I After 8297000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (798.70 seconds)\n", - "Cbc0010I After 8298000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (798.73 seconds)\n", - "Cbc0010I After 8299000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (798.77 seconds)\n", - "Cbc0010I After 8300000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (798.80 seconds)\n", - "Cbc0010I After 8301000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (798.86 seconds)\n", - "Cbc0010I After 8302000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (798.91 seconds)\n", - "Cbc0010I After 8303000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (798.96 seconds)\n", - "Cbc0010I After 8304000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (799.02 seconds)\n", - "Cbc0010I After 8305000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (799.08 seconds)\n", - "Cbc0010I After 8306000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (799.12 seconds)\n", - "Cbc0010I After 8307000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (799.15 seconds)\n", - "Cbc0010I After 8308000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (799.19 seconds)\n", - "Cbc0010I After 8309000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (799.23 seconds)\n", - "Cbc0010I After 8310000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (799.27 seconds)\n", - "Cbc0010I After 8311000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (799.32 seconds)\n", - "Cbc0010I After 8312000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (799.35 seconds)\n", - "Cbc0010I After 8313000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (799.40 seconds)\n", - "Cbc0010I After 8314000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (799.46 seconds)\n", - "Cbc0010I After 8315000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (799.51 seconds)\n", - "Cbc0010I After 8316000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (799.56 seconds)\n", - "Cbc0010I After 8317000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (799.60 seconds)\n", - "Cbc0010I After 8318000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (799.63 seconds)\n", - "Cbc0010I After 8319000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (799.66 seconds)\n", - "Cbc0010I After 8320000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (799.70 seconds)\n", - "Cbc0010I After 8321000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (799.74 seconds)\n", - "Cbc0010I After 8322000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (799.78 seconds)\n", - "Cbc0010I After 8323000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (799.83 seconds)\n", - "Cbc0010I After 8324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (799.86 seconds)\n", - "Cbc0010I After 8325000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (799.90 seconds)\n", - "Cbc0010I After 8326000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (799.94 seconds)\n", - "Cbc0010I After 8327000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.00 seconds)\n", - "Cbc0010I After 8328000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (800.04 seconds)\n", - "Cbc0010I After 8329000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.07 seconds)\n", - "Cbc0010I After 8330000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.11 seconds)\n", - "Cbc0010I After 8331000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (800.16 seconds)\n", - "Cbc0010I After 8332000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (800.22 seconds)\n", - "Cbc0010I After 8333000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (800.29 seconds)\n", - "Cbc0010I After 8334000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (800.34 seconds)\n", - "Cbc0010I After 8335000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (800.38 seconds)\n", - "Cbc0010I After 8336000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (800.43 seconds)\n", - "Cbc0010I After 8337000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (800.46 seconds)\n", - "Cbc0010I After 8338000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (800.52 seconds)\n", - "Cbc0010I After 8339000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (800.57 seconds)\n", - "Cbc0010I After 8340000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (800.64 seconds)\n", - "Cbc0010I After 8341000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (800.67 seconds)\n", - "Cbc0010I After 8342000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (800.72 seconds)\n", - "Cbc0010I After 8343000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (800.76 seconds)\n", - "Cbc0010I After 8344000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.80 seconds)\n", - "Cbc0010I After 8345000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (800.84 seconds)\n", - "Cbc0010I After 8346000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (800.91 seconds)\n", - "Cbc0010I After 8347000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (800.97 seconds)\n", - "Cbc0010I After 8348000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (801.04 seconds)\n", - "Cbc0010I After 8349000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (801.08 seconds)\n", - "Cbc0010I After 8350000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (801.13 seconds)\n", - "Cbc0010I After 8351000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (801.17 seconds)\n", - "Cbc0010I After 8352000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (801.22 seconds)\n", - "Cbc0010I After 8353000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (801.26 seconds)\n", - "Cbc0010I After 8354000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (801.30 seconds)\n", - "Cbc0010I After 8355000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (801.34 seconds)\n", - "Cbc0010I After 8356000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (801.39 seconds)\n", - "Cbc0010I After 8357000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (801.43 seconds)\n", - "Cbc0010I After 8358000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (801.47 seconds)\n", - "Cbc0010I After 8359000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (801.51 seconds)\n", - "Cbc0010I After 8360000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (801.55 seconds)\n", - "Cbc0010I After 8361000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (801.60 seconds)\n", - "Cbc0010I After 8362000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (801.64 seconds)\n", - "Cbc0010I After 8363000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (801.69 seconds)\n", - "Cbc0010I After 8364000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (801.74 seconds)\n", - "Cbc0010I After 8365000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (801.79 seconds)\n", - "Cbc0010I After 8366000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (801.83 seconds)\n", - "Cbc0010I After 8367000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (801.88 seconds)\n", - "Cbc0010I After 8368000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (801.92 seconds)\n", - "Cbc0010I After 8369000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (801.96 seconds)\n", - "Cbc0010I After 8370000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (802.01 seconds)\n", - "Cbc0010I After 8371000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.05 seconds)\n", - "Cbc0010I After 8372000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (802.10 seconds)\n", - "Cbc0010I After 8373000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (802.15 seconds)\n", - "Cbc0010I After 8374000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (802.19 seconds)\n", - "Cbc0010I After 8375000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (802.23 seconds)\n", - "Cbc0010I After 8376000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (802.28 seconds)\n", - "Cbc0010I After 8377000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (802.33 seconds)\n", - "Cbc0010I After 8378000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (802.37 seconds)\n", - "Cbc0010I After 8379000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (802.43 seconds)\n", - "Cbc0010I After 8380000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.48 seconds)\n", - "Cbc0010I After 8381000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (802.53 seconds)\n", - "Cbc0010I After 8382000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (802.57 seconds)\n", - "Cbc0010I After 8383000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.62 seconds)\n", - "Cbc0010I After 8384000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (802.67 seconds)\n", - "Cbc0010I After 8385000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (802.73 seconds)\n", - "Cbc0010I After 8386000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (802.78 seconds)\n", - "Cbc0010I After 8387000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (802.82 seconds)\n", - "Cbc0010I After 8388000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (802.86 seconds)\n", - "Cbc0010I After 8389000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (802.91 seconds)\n", - "Cbc0010I After 8390000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (802.95 seconds)\n", - "Cbc0010I After 8391000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (803.01 seconds)\n", - "Cbc0010I After 8392000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (803.05 seconds)\n", - "Cbc0010I After 8393000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (803.10 seconds)\n", - "Cbc0010I After 8394000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (803.14 seconds)\n", - "Cbc0010I After 8395000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (803.20 seconds)\n", - "Cbc0010I After 8396000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (803.24 seconds)\n", - "Cbc0010I After 8397000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (803.29 seconds)\n", - "Cbc0010I After 8398000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (803.34 seconds)\n", - "Cbc0010I After 8399000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (803.38 seconds)\n", - "Cbc0010I After 8400000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (803.42 seconds)\n", - "Cbc0010I After 8401000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (803.46 seconds)\n", - "Cbc0010I After 8402000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.51 seconds)\n", - "Cbc0010I After 8403000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (803.54 seconds)\n", - "Cbc0010I After 8404000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (803.59 seconds)\n", - "Cbc0010I After 8405000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.65 seconds)\n", - "Cbc0010I After 8406000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (803.69 seconds)\n", - "Cbc0010I After 8407000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (803.73 seconds)\n", - "Cbc0010I After 8408000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (803.79 seconds)\n", - "Cbc0010I After 8409000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (803.84 seconds)\n", - "Cbc0010I After 8410000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (803.88 seconds)\n", - "Cbc0010I After 8411000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (803.93 seconds)\n", - "Cbc0010I After 8412000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (803.98 seconds)\n", - "Cbc0010I After 8413000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (804.03 seconds)\n", - "Cbc0010I After 8414000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (804.08 seconds)\n", - "Cbc0010I After 8415000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.12 seconds)\n", - "Cbc0010I After 8416000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (804.17 seconds)\n", - "Cbc0010I After 8417000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (804.21 seconds)\n", - "Cbc0010I After 8418000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (804.25 seconds)\n", - "Cbc0010I After 8419000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.30 seconds)\n", - "Cbc0010I After 8420000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (804.34 seconds)\n", - "Cbc0010I After 8421000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (804.38 seconds)\n", - "Cbc0010I After 8422000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (804.43 seconds)\n", - "Cbc0010I After 8423000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (804.47 seconds)\n", - "Cbc0010I After 8424000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (804.52 seconds)\n", - "Cbc0010I After 8425000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (804.59 seconds)\n", - "Cbc0010I After 8426000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (804.64 seconds)\n", - "Cbc0010I After 8427000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (804.68 seconds)\n", - "Cbc0010I After 8428000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (804.73 seconds)\n", - "Cbc0010I After 8429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (804.79 seconds)\n", - "Cbc0010I After 8430000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (804.83 seconds)\n", - "Cbc0010I After 8431000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (804.87 seconds)\n", - "Cbc0010I After 8432000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (804.93 seconds)\n", - "Cbc0010I After 8433000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (804.98 seconds)\n", - "Cbc0010I After 8434000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (805.02 seconds)\n", - "Cbc0010I After 8435000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.06 seconds)\n", - "Cbc0010I After 8436000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (805.13 seconds)\n", - "Cbc0010I After 8437000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (805.19 seconds)\n", - "Cbc0010I After 8438000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (805.24 seconds)\n", - "Cbc0010I After 8439000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (805.31 seconds)\n", - "Cbc0010I After 8440000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (805.34 seconds)\n", - "Cbc0010I After 8441000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (805.39 seconds)\n", - "Cbc0010I After 8442000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (805.45 seconds)\n", - "Cbc0010I After 8443000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (805.50 seconds)\n", - "Cbc0010I After 8444000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (805.54 seconds)\n", - "Cbc0010I After 8445000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.58 seconds)\n", - "Cbc0010I After 8446000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (805.64 seconds)\n", - "Cbc0010I After 8447000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (805.68 seconds)\n", - "Cbc0010I After 8448000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (805.72 seconds)\n", - "Cbc0010I After 8449000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (805.76 seconds)\n", - "Cbc0010I After 8450000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (805.82 seconds)\n", - "Cbc0010I After 8451000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (805.88 seconds)\n", - "Cbc0010I After 8452000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (805.94 seconds)\n", - "Cbc0010I After 8453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (805.98 seconds)\n", - "Cbc0010I After 8454000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (806.02 seconds)\n", - "Cbc0010I After 8455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (806.07 seconds)\n", - "Cbc0010I After 8456000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (806.09 seconds)\n", - "Cbc0010I After 8457000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (806.13 seconds)\n", - "Cbc0010I After 8458000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (806.16 seconds)\n", - "Cbc0010I After 8459000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (806.22 seconds)\n", - "Cbc0010I After 8460000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (806.26 seconds)\n", - "Cbc0010I After 8461000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (806.30 seconds)\n", - "Cbc0010I After 8462000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (806.35 seconds)\n", - "Cbc0010I After 8463000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (806.43 seconds)\n", - "Cbc0010I After 8464000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (806.48 seconds)\n", - "Cbc0010I After 8465000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (806.52 seconds)\n", - "Cbc0010I After 8466000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (806.57 seconds)\n", - "Cbc0010I After 8467000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (806.61 seconds)\n", - "Cbc0010I After 8468000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (806.69 seconds)\n", - "Cbc0010I After 8469000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (806.74 seconds)\n", - "Cbc0010I After 8470000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (806.79 seconds)\n", - "Cbc0010I After 8471000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (806.84 seconds)\n", - "Cbc0010I After 8472000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (806.92 seconds)\n", - "Cbc0010I After 8473000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (806.99 seconds)\n", - "Cbc0010I After 8474000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (807.07 seconds)\n", - "Cbc0010I After 8475000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (807.12 seconds)\n", - "Cbc0010I After 8476000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (807.16 seconds)\n", - "Cbc0010I After 8477000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (807.21 seconds)\n", - "Cbc0010I After 8478000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (807.25 seconds)\n", - "Cbc0010I After 8479000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (807.30 seconds)\n", - "Cbc0010I After 8480000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (807.33 seconds)\n", - "Cbc0010I After 8481000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (807.38 seconds)\n", - "Cbc0010I After 8482000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (807.41 seconds)\n", - "Cbc0010I After 8483000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (807.44 seconds)\n", - "Cbc0010I After 8484000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (807.48 seconds)\n", - "Cbc0010I After 8485000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (807.52 seconds)\n", - "Cbc0010I After 8486000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (807.59 seconds)\n", - "Cbc0010I After 8487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (807.67 seconds)\n", - "Cbc0010I After 8488000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (807.75 seconds)\n", - "Cbc0010I After 8489000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (807.82 seconds)\n", - "Cbc0010I After 8490000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (807.90 seconds)\n", - "Cbc0010I After 8491000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (807.97 seconds)\n", - "Cbc0010I After 8492000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (808.04 seconds)\n", - "Cbc0010I After 8493000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (808.12 seconds)\n", - "Cbc0010I After 8494000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.20 seconds)\n", - "Cbc0010I After 8495000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (808.27 seconds)\n", - "Cbc0010I After 8496000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.35 seconds)\n", - "Cbc0010I After 8497000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (808.42 seconds)\n", - "Cbc0010I After 8498000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (808.51 seconds)\n", - "Cbc0010I After 8499000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (808.60 seconds)\n", - "Cbc0010I After 8500000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (808.68 seconds)\n", - "Cbc0010I After 8501000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (808.75 seconds)\n", - "Cbc0010I After 8502000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (808.82 seconds)\n", - "Cbc0010I After 8503000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (808.86 seconds)\n", - "Cbc0010I After 8504000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (808.92 seconds)\n", - "Cbc0010I After 8505000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (809.00 seconds)\n", - "Cbc0010I After 8506000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (809.06 seconds)\n", - "Cbc0010I After 8507000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (809.12 seconds)\n", - "Cbc0010I After 8508000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (809.18 seconds)\n", - "Cbc0010I After 8509000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.23 seconds)\n", - "Cbc0010I After 8510000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (809.28 seconds)\n", - "Cbc0010I After 8511000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.36 seconds)\n", - "Cbc0010I After 8512000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (809.43 seconds)\n", - "Cbc0010I After 8513000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (809.50 seconds)\n", - "Cbc0010I After 8514000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (809.55 seconds)\n", - "Cbc0010I After 8515000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (809.60 seconds)\n", - "Cbc0010I After 8516000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (809.66 seconds)\n", - "Cbc0010I After 8517000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (809.71 seconds)\n", - "Cbc0010I After 8518000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (809.76 seconds)\n", - "Cbc0010I After 8519000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (809.82 seconds)\n", - "Cbc0010I After 8520000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (809.89 seconds)\n", - "Cbc0010I After 8521000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (809.95 seconds)\n", - "Cbc0010I After 8522000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (810.02 seconds)\n", - "Cbc0010I After 8523000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (810.08 seconds)\n", - "Cbc0010I After 8524000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (810.13 seconds)\n", - "Cbc0010I After 8525000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.18 seconds)\n", - "Cbc0010I After 8526000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (810.24 seconds)\n", - "Cbc0010I After 8527000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (810.30 seconds)\n", - "Cbc0010I After 8528000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (810.36 seconds)\n", - "Cbc0010I After 8529000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (810.42 seconds)\n", - "Cbc0010I After 8530000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.48 seconds)\n", - "Cbc0010I After 8531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (810.54 seconds)\n", - "Cbc0010I After 8532000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (810.60 seconds)\n", - "Cbc0010I After 8533000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (810.65 seconds)\n", - "Cbc0010I After 8534000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (810.71 seconds)\n", - "Cbc0010I After 8535000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (810.77 seconds)\n", - "Cbc0010I After 8536000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (810.83 seconds)\n", - "Cbc0010I After 8537000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (810.88 seconds)\n", - "Cbc0010I After 8538000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (810.94 seconds)\n", - "Cbc0010I After 8539000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (811.00 seconds)\n", - "Cbc0010I After 8540000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (811.06 seconds)\n", - "Cbc0010I After 8541000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (811.11 seconds)\n", - "Cbc0010I After 8542000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (811.17 seconds)\n", - "Cbc0010I After 8543000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (811.22 seconds)\n", - "Cbc0010I After 8544000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (811.28 seconds)\n", - "Cbc0010I After 8545000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (811.33 seconds)\n", - "Cbc0010I After 8546000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (811.40 seconds)\n", - "Cbc0010I After 8547000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (811.46 seconds)\n", - "Cbc0010I After 8548000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (811.53 seconds)\n", - "Cbc0010I After 8549000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (811.58 seconds)\n", - "Cbc0010I After 8550000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (811.65 seconds)\n", - "Cbc0010I After 8551000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (811.71 seconds)\n", - "Cbc0010I After 8552000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (811.79 seconds)\n", - "Cbc0010I After 8553000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (811.88 seconds)\n", - "Cbc0010I After 8554000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (811.96 seconds)\n", - "Cbc0010I After 8555000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (812.04 seconds)\n", - "Cbc0010I After 8556000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.12 seconds)\n", - "Cbc0010I After 8557000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.21 seconds)\n", - "Cbc0010I After 8558000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (812.28 seconds)\n", - "Cbc0010I After 8559000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (812.36 seconds)\n", - "Cbc0010I After 8560000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (812.44 seconds)\n", - "Cbc0010I After 8561000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (812.52 seconds)\n", - "Cbc0010I After 8562000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (812.60 seconds)\n", - "Cbc0010I After 8563000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (812.67 seconds)\n", - "Cbc0010I After 8564000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (812.74 seconds)\n", - "Cbc0010I After 8565000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (812.81 seconds)\n", - "Cbc0010I After 8566000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (812.88 seconds)\n", - "Cbc0010I After 8567000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (812.96 seconds)\n", - "Cbc0010I After 8568000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (813.02 seconds)\n", - "Cbc0010I After 8569000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (813.09 seconds)\n", - "Cbc0010I After 8570000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (813.15 seconds)\n", - "Cbc0010I After 8571000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (813.22 seconds)\n", - "Cbc0010I After 8572000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (813.29 seconds)\n", - "Cbc0010I After 8573000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (813.36 seconds)\n", - "Cbc0010I After 8574000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (813.41 seconds)\n", - "Cbc0010I After 8575000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (813.48 seconds)\n", - "Cbc0010I After 8576000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (813.54 seconds)\n", - "Cbc0010I After 8577000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (813.59 seconds)\n", - "Cbc0010I After 8578000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (813.64 seconds)\n", - "Cbc0010I After 8579000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (813.69 seconds)\n", - "Cbc0010I After 8580000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (813.75 seconds)\n", - "Cbc0010I After 8581000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (813.82 seconds)\n", - "Cbc0010I After 8582000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (813.88 seconds)\n", - "Cbc0010I After 8583000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (813.94 seconds)\n", - "Cbc0010I After 8584000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (814.01 seconds)\n", - "Cbc0010I After 8585000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (814.08 seconds)\n", - "Cbc0010I After 8586000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (814.14 seconds)\n", - "Cbc0010I After 8587000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (814.21 seconds)\n", - "Cbc0010I After 8588000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (814.28 seconds)\n", - "Cbc0010I After 8589000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (814.34 seconds)\n", - "Cbc0010I After 8590000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (814.40 seconds)\n", - "Cbc0010I After 8591000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (814.45 seconds)\n", - "Cbc0010I After 8592000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (814.51 seconds)\n", - "Cbc0010I After 8593000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (814.57 seconds)\n", - "Cbc0010I After 8594000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (814.62 seconds)\n", - "Cbc0010I After 8595000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (814.67 seconds)\n", - "Cbc0010I After 8596000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (814.73 seconds)\n", - "Cbc0010I After 8597000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (814.78 seconds)\n", - "Cbc0010I After 8598000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (814.84 seconds)\n", - "Cbc0010I After 8599000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (814.90 seconds)\n", - "Cbc0010I After 8600000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (814.95 seconds)\n", - "Cbc0010I After 8601000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (815.02 seconds)\n", - "Cbc0010I After 8602000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (815.07 seconds)\n", - "Cbc0010I After 8603000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.13 seconds)\n", - "Cbc0010I After 8604000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (815.20 seconds)\n", - "Cbc0010I After 8605000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (815.25 seconds)\n", - "Cbc0010I After 8606000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.30 seconds)\n", - "Cbc0010I After 8607000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (815.37 seconds)\n", - "Cbc0010I After 8608000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (815.43 seconds)\n", - "Cbc0010I After 8609000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (815.48 seconds)\n", - "Cbc0010I After 8610000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (815.55 seconds)\n", - "Cbc0010I After 8611000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (815.61 seconds)\n", - "Cbc0010I After 8612000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (815.67 seconds)\n", - "Cbc0010I After 8613000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (815.73 seconds)\n", - "Cbc0010I After 8614000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (815.78 seconds)\n", - "Cbc0010I After 8615000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (815.84 seconds)\n", - "Cbc0010I After 8616000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (815.91 seconds)\n", - "Cbc0010I After 8617000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (815.99 seconds)\n", - "Cbc0010I After 8618000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (816.04 seconds)\n", - "Cbc0010I After 8619000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (816.09 seconds)\n", - "Cbc0010I After 8620000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (816.15 seconds)\n", - "Cbc0010I After 8621000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (816.19 seconds)\n", - "Cbc0010I After 8622000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (816.23 seconds)\n", - "Cbc0010I After 8623000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (816.27 seconds)\n", - "Cbc0010I After 8624000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (816.30 seconds)\n", - "Cbc0010I After 8625000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (816.33 seconds)\n", - "Cbc0010I After 8626000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (816.38 seconds)\n", - "Cbc0010I After 8627000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (816.43 seconds)\n", - "Cbc0010I After 8628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (816.48 seconds)\n", - "Cbc0010I After 8629000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (816.53 seconds)\n", - "Cbc0010I After 8630000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (816.56 seconds)\n", - "Cbc0010I After 8631000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (816.61 seconds)\n", - "Cbc0010I After 8632000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (816.71 seconds)\n", - "Cbc0010I After 8633000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.76 seconds)\n", - "Cbc0010I After 8634000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (816.81 seconds)\n", - "Cbc0010I After 8635000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.87 seconds)\n", - "Cbc0010I After 8636000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (816.92 seconds)\n", - "Cbc0010I After 8637000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (816.97 seconds)\n", - "Cbc0010I After 8638000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (817.03 seconds)\n", - "Cbc0010I After 8639000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (817.08 seconds)\n", - "Cbc0010I After 8640000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (817.13 seconds)\n", - "Cbc0010I After 8641000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (817.21 seconds)\n", - "Cbc0010I After 8642000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (817.25 seconds)\n", - "Cbc0010I After 8643000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (817.27 seconds)\n", - "Cbc0010I After 8644000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (817.30 seconds)\n", - "Cbc0010I After 8645000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (817.33 seconds)\n", - "Cbc0010I After 8646000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.36 seconds)\n", - "Cbc0010I After 8647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (817.40 seconds)\n", - "Cbc0010I After 8648000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (817.43 seconds)\n", - "Cbc0010I After 8649000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (817.48 seconds)\n", - "Cbc0010I After 8650000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (817.54 seconds)\n", - "Cbc0010I After 8651000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (817.57 seconds)\n", - "Cbc0010I After 8652000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (817.60 seconds)\n", - "Cbc0010I After 8653000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (817.63 seconds)\n", - "Cbc0010I After 8654000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (817.67 seconds)\n", - "Cbc0010I After 8655000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.71 seconds)\n", - "Cbc0010I After 8656000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (817.75 seconds)\n", - "Cbc0010I After 8657000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (817.79 seconds)\n", - "Cbc0010I After 8658000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (817.83 seconds)\n", - "Cbc0010I After 8659000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (817.89 seconds)\n", - "Cbc0010I After 8660000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (817.94 seconds)\n", - "Cbc0010I After 8661000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (817.99 seconds)\n", - "Cbc0010I After 8662000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (818.04 seconds)\n", - "Cbc0010I After 8663000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (818.09 seconds)\n", - "Cbc0010I After 8664000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (818.14 seconds)\n", - "Cbc0010I After 8665000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (818.19 seconds)\n", - "Cbc0010I After 8666000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (818.24 seconds)\n", - "Cbc0010I After 8667000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (818.28 seconds)\n", - "Cbc0010I After 8668000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (818.33 seconds)\n", - "Cbc0010I After 8669000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (818.37 seconds)\n", - "Cbc0010I After 8670000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (818.41 seconds)\n", - "Cbc0010I After 8671000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (818.45 seconds)\n", - "Cbc0010I After 8672000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (818.50 seconds)\n", - "Cbc0010I After 8673000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (818.54 seconds)\n", - "Cbc0010I After 8674000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (818.58 seconds)\n", - "Cbc0010I After 8675000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (818.63 seconds)\n", - "Cbc0010I After 8676000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (818.67 seconds)\n", - "Cbc0010I After 8677000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (818.72 seconds)\n", - "Cbc0010I After 8678000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (818.76 seconds)\n", - "Cbc0010I After 8679000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (818.80 seconds)\n", - "Cbc0010I After 8680000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (818.87 seconds)\n", - "Cbc0010I After 8681000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (818.95 seconds)\n", - "Cbc0010I After 8682000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (819.02 seconds)\n", - "Cbc0010I After 8683000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (819.10 seconds)\n", - "Cbc0010I After 8684000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (819.13 seconds)\n", - "Cbc0010I After 8685000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (819.17 seconds)\n", - "Cbc0010I After 8686000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (819.22 seconds)\n", - "Cbc0010I After 8687000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (819.27 seconds)\n", - "Cbc0010I After 8688000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (819.31 seconds)\n", - "Cbc0010I After 8689000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (819.34 seconds)\n", - "Cbc0010I After 8690000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (819.40 seconds)\n", - "Cbc0010I After 8691000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (819.46 seconds)\n", - "Cbc0010I After 8692000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (819.52 seconds)\n", - "Cbc0010I After 8693000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (819.58 seconds)\n", - "Cbc0010I After 8694000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (819.62 seconds)\n", - "Cbc0010I After 8695000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (819.65 seconds)\n", - "Cbc0010I After 8696000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (819.70 seconds)\n", - "Cbc0010I After 8697000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (819.74 seconds)\n", - "Cbc0010I After 8698000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (819.77 seconds)\n", - "Cbc0010I After 8699000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (819.84 seconds)\n", - "Cbc0010I After 8700000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (819.89 seconds)\n", - "Cbc0010I After 8701000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (819.92 seconds)\n", - "Cbc0010I After 8702000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (819.96 seconds)\n", - "Cbc0010I After 8703000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (820.00 seconds)\n", - "Cbc0010I After 8704000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (820.03 seconds)\n", - "Cbc0010I After 8705000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (820.07 seconds)\n", - "Cbc0010I After 8706000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (820.11 seconds)\n", - "Cbc0010I After 8707000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (820.14 seconds)\n", - "Cbc0010I After 8708000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (820.18 seconds)\n", - "Cbc0010I After 8709000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (820.21 seconds)\n", - "Cbc0010I After 8710000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (820.25 seconds)\n", - "Cbc0010I After 8711000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (820.30 seconds)\n", - "Cbc0010I After 8712000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (820.39 seconds)\n", - "Cbc0010I After 8713000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (820.43 seconds)\n", - "Cbc0010I After 8714000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (820.47 seconds)\n", - "Cbc0010I After 8715000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (820.50 seconds)\n", - "Cbc0010I After 8716000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (820.56 seconds)\n", - "Cbc0010I After 8717000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (820.64 seconds)\n", - "Cbc0010I After 8718000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (820.70 seconds)\n", - "Cbc0010I After 8719000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (820.77 seconds)\n", - "Cbc0010I After 8720000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (820.84 seconds)\n", - "Cbc0010I After 8721000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (820.93 seconds)\n", - "Cbc0010I After 8722000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (820.96 seconds)\n", - "Cbc0010I After 8723000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (821.00 seconds)\n", - "Cbc0010I After 8724000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (821.04 seconds)\n", - "Cbc0010I After 8725000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (821.07 seconds)\n", - "Cbc0010I After 8726000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.11 seconds)\n", - "Cbc0010I After 8727000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (821.15 seconds)\n", - "Cbc0010I After 8728000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (821.20 seconds)\n", - "Cbc0010I After 8729000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (821.26 seconds)\n", - "Cbc0010I After 8730000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (821.30 seconds)\n", - "Cbc0010I After 8731000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.34 seconds)\n", - "Cbc0010I After 8732000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (821.40 seconds)\n", - "Cbc0010I After 8733000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.48 seconds)\n", - "Cbc0010I After 8734000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (821.51 seconds)\n", - "Cbc0010I After 8735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (821.55 seconds)\n", - "Cbc0010I After 8736000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (821.62 seconds)\n", - "Cbc0010I After 8737000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (821.66 seconds)\n", - "Cbc0010I After 8738000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (821.69 seconds)\n", - "Cbc0010I After 8739000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.72 seconds)\n", - "Cbc0010I After 8740000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (821.76 seconds)\n", - "Cbc0010I After 8741000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (821.81 seconds)\n", - "Cbc0010I After 8742000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (821.85 seconds)\n", - "Cbc0010I After 8743000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (821.91 seconds)\n", - "Cbc0010I After 8744000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (821.94 seconds)\n", - "Cbc0010I After 8745000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (821.98 seconds)\n", - "Cbc0010I After 8746000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (822.02 seconds)\n", - "Cbc0010I After 8747000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (822.05 seconds)\n", - "Cbc0010I After 8748000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (822.10 seconds)\n", - "Cbc0010I After 8749000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (822.14 seconds)\n", - "Cbc0010I After 8750000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (822.18 seconds)\n", - "Cbc0010I After 8751000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (822.21 seconds)\n", - "Cbc0010I After 8752000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (822.25 seconds)\n", - "Cbc0010I After 8753000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (822.30 seconds)\n", - "Cbc0010I After 8754000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (822.35 seconds)\n", - "Cbc0010I After 8755000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (822.39 seconds)\n", - "Cbc0010I After 8756000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (822.46 seconds)\n", - "Cbc0010I After 8757000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (822.54 seconds)\n", - "Cbc0010I After 8758000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (822.60 seconds)\n", - "Cbc0010I After 8759000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (822.64 seconds)\n", - "Cbc0010I After 8760000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (822.68 seconds)\n", - "Cbc0010I After 8761000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (822.73 seconds)\n", - "Cbc0010I After 8762000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (822.78 seconds)\n", - "Cbc0010I After 8763000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (822.83 seconds)\n", - "Cbc0010I After 8764000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (822.88 seconds)\n", - "Cbc0010I After 8765000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (822.95 seconds)\n", - "Cbc0010I After 8766000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (823.02 seconds)\n", - "Cbc0010I After 8767000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (823.06 seconds)\n", - "Cbc0010I After 8768000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (823.10 seconds)\n", - "Cbc0010I After 8769000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (823.13 seconds)\n", - "Cbc0010I After 8770000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (823.17 seconds)\n", - "Cbc0010I After 8771000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (823.21 seconds)\n", - "Cbc0010I After 8772000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (823.27 seconds)\n", - "Cbc0010I After 8773000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (823.35 seconds)\n", - "Cbc0010I After 8774000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (823.40 seconds)\n", - "Cbc0010I After 8775000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (823.43 seconds)\n", - "Cbc0010I After 8776000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (823.48 seconds)\n", - "Cbc0010I After 8777000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (823.51 seconds)\n", - "Cbc0010I After 8778000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (823.58 seconds)\n", - "Cbc0010I After 8779000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (823.66 seconds)\n", - "Cbc0010I After 8780000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (823.74 seconds)\n", - "Cbc0010I After 8781000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (823.82 seconds)\n", - "Cbc0010I After 8782000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (823.89 seconds)\n", - "Cbc0010I After 8783000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (823.97 seconds)\n", - "Cbc0010I After 8784000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (824.05 seconds)\n", - "Cbc0010I After 8785000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (824.13 seconds)\n", - "Cbc0010I After 8786000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (824.20 seconds)\n", - "Cbc0010I After 8787000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (824.28 seconds)\n", - "Cbc0010I After 8788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (824.34 seconds)\n", - "Cbc0010I After 8789000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.37 seconds)\n", - "Cbc0010I After 8790000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (824.41 seconds)\n", - "Cbc0010I After 8791000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (824.45 seconds)\n", - "Cbc0010I After 8792000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (824.51 seconds)\n", - "Cbc0010I After 8793000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (824.54 seconds)\n", - "Cbc0010I After 8794000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (824.58 seconds)\n", - "Cbc0010I After 8795000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.61 seconds)\n", - "Cbc0010I After 8796000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (824.67 seconds)\n", - "Cbc0010I After 8797000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (824.70 seconds)\n", - "Cbc0010I After 8798000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (824.74 seconds)\n", - "Cbc0010I After 8799000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (824.77 seconds)\n", - "Cbc0010I After 8800000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (824.80 seconds)\n", - "Cbc0010I After 8801000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (824.87 seconds)\n", - "Cbc0010I After 8802000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (824.95 seconds)\n", - "Cbc0010I After 8803000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (824.99 seconds)\n", - "Cbc0010I After 8804000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (825.02 seconds)\n", - "Cbc0010I After 8805000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (825.07 seconds)\n", - "Cbc0010I After 8806000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (825.22 seconds)\n", - "Cbc0010I After 8807000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (825.36 seconds)\n", - "Cbc0010I After 8808000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (825.54 seconds)\n", - "Cbc0010I After 8809000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (825.70 seconds)\n", - "Cbc0010I After 8810000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (825.78 seconds)\n", - "Cbc0010I After 8811000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (825.86 seconds)\n", - "Cbc0010I After 8812000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (826.01 seconds)\n", - "Cbc0010I After 8813000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (826.09 seconds)\n", - "Cbc0010I After 8814000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (826.17 seconds)\n", - "Cbc0010I After 8815000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (826.24 seconds)\n", - "Cbc0010I After 8816000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.32 seconds)\n", - "Cbc0010I After 8817000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (826.36 seconds)\n", - "Cbc0010I After 8818000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (826.41 seconds)\n", - "Cbc0010I After 8819000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.45 seconds)\n", - "Cbc0010I After 8820000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (826.52 seconds)\n", - "Cbc0010I After 8821000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (826.59 seconds)\n", - "Cbc0010I After 8822000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (826.62 seconds)\n", - "Cbc0010I After 8823000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (826.66 seconds)\n", - "Cbc0010I After 8824000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (826.71 seconds)\n", - "Cbc0010I After 8825000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (826.78 seconds)\n", - "Cbc0010I After 8826000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (826.83 seconds)\n", - "Cbc0010I After 8827000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (826.86 seconds)\n", - "Cbc0010I After 8828000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (826.91 seconds)\n", - "Cbc0010I After 8829000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (826.98 seconds)\n", - "Cbc0010I After 8830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (827.06 seconds)\n", - "Cbc0010I After 8831000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (827.13 seconds)\n", - "Cbc0010I After 8832000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (827.20 seconds)\n", - "Cbc0010I After 8833000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (827.28 seconds)\n", - "Cbc0010I After 8834000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (827.33 seconds)\n", - "Cbc0010I After 8835000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (827.37 seconds)\n", - "Cbc0010I After 8836000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (827.40 seconds)\n", - "Cbc0010I After 8837000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (827.43 seconds)\n", - "Cbc0010I After 8838000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (827.47 seconds)\n", - "Cbc0010I After 8839000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.50 seconds)\n", - "Cbc0010I After 8840000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (827.53 seconds)\n", - "Cbc0010I After 8841000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (827.57 seconds)\n", - "Cbc0010I After 8842000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (827.61 seconds)\n", - "Cbc0010I After 8843000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (827.64 seconds)\n", - "Cbc0010I After 8844000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (827.68 seconds)\n", - "Cbc0010I After 8845000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.74 seconds)\n", - "Cbc0010I After 8846000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (827.81 seconds)\n", - "Cbc0010I After 8847000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (827.87 seconds)\n", - "Cbc0010I After 8848000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (827.92 seconds)\n", - "Cbc0010I After 8849000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (827.98 seconds)\n", - "Cbc0010I After 8850000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (828.03 seconds)\n", - "Cbc0010I After 8851000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (828.08 seconds)\n", - "Cbc0010I After 8852000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (828.13 seconds)\n", - "Cbc0010I After 8853000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (828.18 seconds)\n", - "Cbc0010I After 8854000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (828.26 seconds)\n", - "Cbc0010I After 8855000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (828.31 seconds)\n", - "Cbc0010I After 8856000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (828.39 seconds)\n", - "Cbc0010I After 8857000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (828.50 seconds)\n", - "Cbc0010I After 8858000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (828.55 seconds)\n", - "Cbc0010I After 8859000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (828.60 seconds)\n", - "Cbc0010I After 8860000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (828.69 seconds)\n", - "Cbc0010I After 8861000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (828.77 seconds)\n", - "Cbc0010I After 8862000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (828.85 seconds)\n", - "Cbc0010I After 8863000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (828.92 seconds)\n", - "Cbc0010I After 8864000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (828.99 seconds)\n", - "Cbc0010I After 8865000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (829.07 seconds)\n", - "Cbc0010I After 8866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (829.12 seconds)\n", - "Cbc0010I After 8867000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (829.15 seconds)\n", - "Cbc0010I After 8868000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (829.19 seconds)\n", - "Cbc0010I After 8869000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (829.22 seconds)\n", - "Cbc0010I After 8870000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (829.25 seconds)\n", - "Cbc0010I After 8871000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (829.28 seconds)\n", - "Cbc0010I After 8872000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (829.33 seconds)\n", - "Cbc0010I After 8873000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (829.36 seconds)\n", - "Cbc0010I After 8874000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (829.41 seconds)\n", - "Cbc0010I After 8875000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (829.44 seconds)\n", - "Cbc0010I After 8876000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (829.47 seconds)\n", - "Cbc0010I After 8877000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (829.51 seconds)\n", - "Cbc0010I After 8878000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (829.57 seconds)\n", - "Cbc0010I After 8879000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (829.62 seconds)\n", - "Cbc0010I After 8880000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (829.66 seconds)\n", - "Cbc0010I After 8881000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (829.70 seconds)\n", - "Cbc0010I After 8882000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (829.73 seconds)\n", - "Cbc0010I After 8883000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (829.77 seconds)\n", - "Cbc0010I After 8884000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (829.82 seconds)\n", - "Cbc0010I After 8885000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (829.87 seconds)\n", - "Cbc0010I After 8886000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (829.91 seconds)\n", - "Cbc0010I After 8887000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (829.96 seconds)\n", - "Cbc0010I After 8888000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (830.04 seconds)\n", - "Cbc0010I After 8889000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (830.11 seconds)\n", - "Cbc0010I After 8890000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (830.14 seconds)\n", - "Cbc0010I After 8891000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (830.18 seconds)\n", - "Cbc0010I After 8892000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (830.22 seconds)\n", - "Cbc0010I After 8893000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (830.29 seconds)\n", - "Cbc0010I After 8894000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (830.34 seconds)\n", - "Cbc0010I After 8895000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (830.37 seconds)\n", - "Cbc0010I After 8896000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (830.43 seconds)\n", - "Cbc0010I After 8897000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (830.51 seconds)\n", - "Cbc0010I After 8898000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.58 seconds)\n", - "Cbc0010I After 8899000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (830.66 seconds)\n", - "Cbc0010I After 8900000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (830.71 seconds)\n", - "Cbc0010I After 8901000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (830.75 seconds)\n", - "Cbc0010I After 8902000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (830.78 seconds)\n", - "Cbc0010I After 8903000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (830.82 seconds)\n", - "Cbc0010I After 8904000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.85 seconds)\n", - "Cbc0010I After 8905000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (830.88 seconds)\n", - "Cbc0010I After 8906000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (830.92 seconds)\n", - "Cbc0010I After 8907000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (831.00 seconds)\n", - "Cbc0010I After 8908000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (831.06 seconds)\n", - "Cbc0010I After 8909000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (831.09 seconds)\n", - "Cbc0010I After 8910000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.13 seconds)\n", - "Cbc0010I After 8911000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (831.19 seconds)\n", - "Cbc0010I After 8912000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.26 seconds)\n", - "Cbc0010I After 8913000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (831.30 seconds)\n", - "Cbc0010I After 8914000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (831.34 seconds)\n", - "Cbc0010I After 8915000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (831.40 seconds)\n", - "Cbc0010I After 8916000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (831.43 seconds)\n", - "Cbc0010I After 8917000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (831.49 seconds)\n", - "Cbc0010I After 8918000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (831.57 seconds)\n", - "Cbc0010I After 8919000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (831.60 seconds)\n", - "Cbc0010I After 8920000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (831.63 seconds)\n", - "Cbc0010I After 8921000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (831.67 seconds)\n", - "Cbc0010I After 8922000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (831.70 seconds)\n", - "Cbc0010I After 8923000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (831.75 seconds)\n", - "Cbc0010I After 8924000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (831.78 seconds)\n", - "Cbc0010I After 8925000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (831.84 seconds)\n", - "Cbc0010I After 8926000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (831.87 seconds)\n", - "Cbc0010I After 8927000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (831.90 seconds)\n", - "Cbc0010I After 8928000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (831.94 seconds)\n", - "Cbc0010I After 8929000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (831.98 seconds)\n", - "Cbc0010I After 8930000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (832.05 seconds)\n", - "Cbc0010I After 8931000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (832.12 seconds)\n", - "Cbc0010I After 8932000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (832.15 seconds)\n", - "Cbc0010I After 8933000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (832.20 seconds)\n", - "Cbc0010I After 8934000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (832.27 seconds)\n", - "Cbc0010I After 8935000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (832.35 seconds)\n", - "Cbc0010I After 8936000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (832.42 seconds)\n", - "Cbc0010I After 8937000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (832.50 seconds)\n", - "Cbc0010I After 8938000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (832.56 seconds)\n", - "Cbc0010I After 8939000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (832.59 seconds)\n", - "Cbc0010I After 8940000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (832.62 seconds)\n", - "Cbc0010I After 8941000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (832.66 seconds)\n", - "Cbc0010I After 8942000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (832.69 seconds)\n", - "Cbc0010I After 8943000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (832.73 seconds)\n", - "Cbc0010I After 8944000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (832.78 seconds)\n", - "Cbc0010I After 8945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (832.81 seconds)\n", - "Cbc0010I After 8946000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (832.87 seconds)\n", - "Cbc0010I After 8947000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (832.92 seconds)\n", - "Cbc0010I After 8948000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (832.95 seconds)\n", - "Cbc0010I After 8949000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (833.00 seconds)\n", - "Cbc0010I After 8950000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (833.05 seconds)\n", - "Cbc0010I After 8951000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (833.08 seconds)\n", - "Cbc0010I After 8952000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (833.16 seconds)\n", - "Cbc0010I After 8953000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (833.21 seconds)\n", - "Cbc0010I After 8954000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (833.25 seconds)\n", - "Cbc0010I After 8955000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (833.28 seconds)\n", - "Cbc0010I After 8956000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (833.32 seconds)\n", - "Cbc0010I After 8957000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (833.39 seconds)\n", - "Cbc0010I After 8958000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (833.44 seconds)\n", - "Cbc0010I After 8959000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (833.52 seconds)\n", - "Cbc0010I After 8960000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (833.58 seconds)\n", - "Cbc0010I After 8961000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (833.62 seconds)\n", - "Cbc0010I After 8962000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (833.65 seconds)\n", - "Cbc0010I After 8963000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (833.68 seconds)\n", - "Cbc0010I After 8964000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (833.73 seconds)\n", - "Cbc0010I After 8965000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (833.81 seconds)\n", - "Cbc0010I After 8966000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (833.86 seconds)\n", - "Cbc0010I After 8967000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (833.90 seconds)\n", - "Cbc0010I After 8968000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (833.95 seconds)\n", - "Cbc0010I After 8969000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (833.99 seconds)\n", - "Cbc0010I After 8970000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (834.02 seconds)\n", - "Cbc0010I After 8971000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (834.06 seconds)\n", - "Cbc0010I After 8972000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (834.09 seconds)\n", - "Cbc0010I After 8973000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (834.14 seconds)\n", - "Cbc0010I After 8974000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (834.22 seconds)\n", - "Cbc0010I After 8975000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (834.30 seconds)\n", - "Cbc0010I After 8976000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (834.38 seconds)\n", - "Cbc0010I After 8977000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (834.46 seconds)\n", - "Cbc0010I After 8978000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (834.54 seconds)\n", - "Cbc0010I After 8979000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (834.67 seconds)\n", - "Cbc0010I After 8980000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (834.76 seconds)\n", - "Cbc0010I After 8981000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (834.83 seconds)\n", - "Cbc0010I After 8982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (834.91 seconds)\n", - "Cbc0010I After 8983000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (834.99 seconds)\n", - "Cbc0010I After 8984000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (835.06 seconds)\n", - "Cbc0010I After 8985000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (835.14 seconds)\n", - "Cbc0010I After 8986000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (835.22 seconds)\n", - "Cbc0010I After 8987000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (835.29 seconds)\n", - "Cbc0010I After 8988000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (835.36 seconds)\n", - "Cbc0010I After 8989000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (835.43 seconds)\n", - "Cbc0010I After 8990000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (835.50 seconds)\n", - "Cbc0010I After 8991000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (835.59 seconds)\n", - "Cbc0010I After 8992000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (835.64 seconds)\n", - "Cbc0010I After 8993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (835.69 seconds)\n", - "Cbc0010I After 8994000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (835.75 seconds)\n", - "Cbc0010I After 8995000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (835.80 seconds)\n", - "Cbc0010I After 8996000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (835.86 seconds)\n", - "Cbc0010I After 8997000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (835.93 seconds)\n", - "Cbc0010I After 8998000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (835.98 seconds)\n", - "Cbc0010I After 8999000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (836.04 seconds)\n", - "Cbc0010I After 9000000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (836.09 seconds)\n", - "Cbc0010I After 9001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (836.15 seconds)\n", - "Cbc0010I After 9002000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (836.20 seconds)\n", - "Cbc0010I After 9003000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (836.25 seconds)\n", - "Cbc0010I After 9004000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (836.30 seconds)\n", - "Cbc0010I After 9005000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (836.36 seconds)\n", - "Cbc0010I After 9006000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.42 seconds)\n", - "Cbc0010I After 9007000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (836.47 seconds)\n", - "Cbc0010I After 9008000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (836.52 seconds)\n", - "Cbc0010I After 9009000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (836.56 seconds)\n", - "Cbc0010I After 9010000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (836.59 seconds)\n", - "Cbc0010I After 9011000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (836.62 seconds)\n", - "Cbc0010I After 9012000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (836.65 seconds)\n", - "Cbc0010I After 9013000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (836.68 seconds)\n", - "Cbc0010I After 9014000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (836.71 seconds)\n", - "Cbc0010I After 9015000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (836.75 seconds)\n", - "Cbc0010I After 9016000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (836.83 seconds)\n", - "Cbc0010I After 9017000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.86 seconds)\n", - "Cbc0010I After 9018000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (836.90 seconds)\n", - "Cbc0010I After 9019000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (836.94 seconds)\n", - "Cbc0010I After 9020000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (836.97 seconds)\n", - "Cbc0010I After 9021000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (837.03 seconds)\n", - "Cbc0010I After 9022000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (837.06 seconds)\n", - "Cbc0010I After 9023000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (837.09 seconds)\n", - "Cbc0010I After 9024000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (837.12 seconds)\n", - "Cbc0010I After 9025000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (837.15 seconds)\n", - "Cbc0010I After 9026000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (837.19 seconds)\n", - "Cbc0010I After 9027000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (837.22 seconds)\n", - "Cbc0010I After 9028000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (837.28 seconds)\n", - "Cbc0010I After 9029000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (837.34 seconds)\n", - "Cbc0010I After 9030000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (837.40 seconds)\n", - "Cbc0010I After 9031000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (837.46 seconds)\n", - "Cbc0010I After 9032000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (837.52 seconds)\n", - "Cbc0010I After 9033000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (837.57 seconds)\n", - "Cbc0010I After 9034000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (837.62 seconds)\n", - "Cbc0010I After 9035000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (837.66 seconds)\n", - "Cbc0010I After 9036000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (837.71 seconds)\n", - "Cbc0010I After 9037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (837.74 seconds)\n", - "Cbc0010I After 9038000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (837.80 seconds)\n", - "Cbc0010I After 9039000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (837.84 seconds)\n", - "Cbc0010I After 9040000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (837.87 seconds)\n", - "Cbc0010I After 9041000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (837.93 seconds)\n", - "Cbc0010I After 9042000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (837.97 seconds)\n", - "Cbc0010I After 9043000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (838.03 seconds)\n", - "Cbc0010I After 9044000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (838.08 seconds)\n", - "Cbc0010I After 9045000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (838.14 seconds)\n", - "Cbc0010I After 9046000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (838.20 seconds)\n", - "Cbc0010I After 9047000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (838.25 seconds)\n", - "Cbc0010I After 9048000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (838.28 seconds)\n", - "Cbc0010I After 9049000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (838.33 seconds)\n", - "Cbc0010I After 9050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (838.36 seconds)\n", - "Cbc0010I After 9051000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (838.39 seconds)\n", - "Cbc0010I After 9052000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (838.42 seconds)\n", - "Cbc0010I After 9053000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (838.45 seconds)\n", - "Cbc0010I After 9054000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (838.51 seconds)\n", - "Cbc0010I After 9055000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (838.55 seconds)\n", - "Cbc0010I After 9056000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (838.59 seconds)\n", - "Cbc0010I After 9057000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (838.63 seconds)\n", - "Cbc0010I After 9058000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (838.69 seconds)\n", - "Cbc0010I After 9059000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (838.73 seconds)\n", - "Cbc0010I After 9060000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (838.76 seconds)\n", - "Cbc0010I After 9061000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (838.83 seconds)\n", - "Cbc0010I After 9062000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (838.89 seconds)\n", - "Cbc0010I After 9063000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (838.93 seconds)\n", - "Cbc0010I After 9064000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (838.97 seconds)\n", - "Cbc0010I After 9065000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (839.00 seconds)\n", - "Cbc0010I After 9066000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.05 seconds)\n", - "Cbc0010I After 9067000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (839.08 seconds)\n", - "Cbc0010I After 9068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (839.14 seconds)\n", - "Cbc0010I After 9069000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (839.20 seconds)\n", - "Cbc0010I After 9070000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (839.25 seconds)\n", - "Cbc0010I After 9071000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (839.32 seconds)\n", - "Cbc0010I After 9072000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (839.35 seconds)\n", - "Cbc0010I After 9073000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (839.39 seconds)\n", - "Cbc0010I After 9074000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (839.44 seconds)\n", - "Cbc0010I After 9075000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (839.48 seconds)\n", - "Cbc0010I After 9076000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (839.52 seconds)\n", - "Cbc0010I After 9077000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (839.56 seconds)\n", - "Cbc0010I After 9078000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (839.61 seconds)\n", - "Cbc0010I After 9079000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (839.66 seconds)\n", - "Cbc0010I After 9080000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.71 seconds)\n", - "Cbc0010I After 9081000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (839.75 seconds)\n", - "Cbc0010I After 9082000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (839.78 seconds)\n", - "Cbc0010I After 9083000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (839.81 seconds)\n", - "Cbc0010I After 9084000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (839.85 seconds)\n", - "Cbc0010I After 9085000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (839.89 seconds)\n", - "Cbc0010I After 9086000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (839.93 seconds)\n", - "Cbc0010I After 9087000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (839.97 seconds)\n", - "Cbc0010I After 9088000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (840.01 seconds)\n", - "Cbc0010I After 9089000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (840.06 seconds)\n", - "Cbc0010I After 9090000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (840.10 seconds)\n", - "Cbc0010I After 9091000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (840.15 seconds)\n", - "Cbc0010I After 9092000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (840.21 seconds)\n", - "Cbc0010I After 9093000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (840.27 seconds)\n", - "Cbc0010I After 9094000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (840.31 seconds)\n", - "Cbc0010I After 9095000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (840.35 seconds)\n", - "Cbc0010I After 9096000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (840.40 seconds)\n", - "Cbc0010I After 9097000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (840.45 seconds)\n", - "Cbc0010I After 9098000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (840.51 seconds)\n", - "Cbc0010I After 9099000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (840.58 seconds)\n", - "Cbc0010I After 9100000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (840.64 seconds)\n", - "Cbc0010I After 9101000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (840.70 seconds)\n", - "Cbc0010I After 9102000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (840.81 seconds)\n", - "Cbc0010I After 9103000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (840.87 seconds)\n", - "Cbc0010I After 9104000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (840.92 seconds)\n", - "Cbc0010I After 9105000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (840.97 seconds)\n", - "Cbc0010I After 9106000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (841.02 seconds)\n", - "Cbc0010I After 9107000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (841.07 seconds)\n", - "Cbc0010I After 9108000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (841.11 seconds)\n", - "Cbc0010I After 9109000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (841.16 seconds)\n", - "Cbc0010I After 9110000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (841.20 seconds)\n", - "Cbc0010I After 9111000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (841.25 seconds)\n", - "Cbc0010I After 9112000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (841.32 seconds)\n", - "Cbc0010I After 9113000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (841.36 seconds)\n", - "Cbc0010I After 9114000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (841.41 seconds)\n", - "Cbc0010I After 9115000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (841.46 seconds)\n", - "Cbc0010I After 9116000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (841.50 seconds)\n", - "Cbc0010I After 9117000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (841.55 seconds)\n", - "Cbc0010I After 9118000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (841.59 seconds)\n", - "Cbc0010I After 9119000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (841.65 seconds)\n", - "Cbc0010I After 9120000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (841.70 seconds)\n", - "Cbc0010I After 9121000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (841.75 seconds)\n", - "Cbc0010I After 9122000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (841.79 seconds)\n", - "Cbc0010I After 9123000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (841.84 seconds)\n", - "Cbc0010I After 9124000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (841.88 seconds)\n", - "Cbc0010I After 9125000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (841.93 seconds)\n", - "Cbc0010I After 9126000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (841.98 seconds)\n", - "Cbc0010I After 9127000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (842.02 seconds)\n", - "Cbc0010I After 9128000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (842.07 seconds)\n", - "Cbc0010I After 9129000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (842.13 seconds)\n", - "Cbc0010I After 9130000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (842.17 seconds)\n", - "Cbc0010I After 9131000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (842.21 seconds)\n", - "Cbc0010I After 9132000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (842.24 seconds)\n", - "Cbc0010I After 9133000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (842.29 seconds)\n", - "Cbc0010I After 9134000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (842.33 seconds)\n", - "Cbc0010I After 9135000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.37 seconds)\n", - "Cbc0010I After 9136000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (842.42 seconds)\n", - "Cbc0010I After 9137000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.46 seconds)\n", - "Cbc0010I After 9138000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (842.53 seconds)\n", - "Cbc0010I After 9139000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.58 seconds)\n", - "Cbc0010I After 9140000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (842.64 seconds)\n", - "Cbc0010I After 9141000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (842.68 seconds)\n", - "Cbc0010I After 9142000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (842.74 seconds)\n", - "Cbc0010I After 9143000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (842.78 seconds)\n", - "Cbc0010I After 9144000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (842.83 seconds)\n", - "Cbc0010I After 9145000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (842.87 seconds)\n", - "Cbc0010I After 9146000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (842.91 seconds)\n", - "Cbc0010I After 9147000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (842.95 seconds)\n", - "Cbc0010I After 9148000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (842.98 seconds)\n", - "Cbc0010I After 9149000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (843.03 seconds)\n", - "Cbc0010I After 9150000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (843.07 seconds)\n", - "Cbc0010I After 9151000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (843.12 seconds)\n", - "Cbc0010I After 9152000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.20 seconds)\n", - "Cbc0010I After 9153000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (843.24 seconds)\n", - "Cbc0010I After 9154000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.28 seconds)\n", - "Cbc0010I After 9155000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (843.34 seconds)\n", - "Cbc0010I After 9156000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (843.38 seconds)\n", - "Cbc0010I After 9157000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (843.42 seconds)\n", - "Cbc0010I After 9158000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (843.48 seconds)\n", - "Cbc0010I After 9159000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (843.52 seconds)\n", - "Cbc0010I After 9160000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (843.57 seconds)\n", - "Cbc0010I After 9161000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (843.62 seconds)\n", - "Cbc0010I After 9162000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.68 seconds)\n", - "Cbc0010I After 9163000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (843.72 seconds)\n", - "Cbc0010I After 9164000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (843.75 seconds)\n", - "Cbc0010I After 9165000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.79 seconds)\n", - "Cbc0010I After 9166000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (843.84 seconds)\n", - "Cbc0010I After 9167000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (843.88 seconds)\n", - "Cbc0010I After 9168000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (843.92 seconds)\n", - "Cbc0010I After 9169000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (843.96 seconds)\n", - "Cbc0010I After 9170000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (844.02 seconds)\n", - "Cbc0010I After 9171000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (844.05 seconds)\n", - "Cbc0010I After 9172000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (844.09 seconds)\n", - "Cbc0010I After 9173000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (844.15 seconds)\n", - "Cbc0010I After 9174000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (844.19 seconds)\n", - "Cbc0010I After 9175000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.23 seconds)\n", - "Cbc0010I After 9176000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (844.28 seconds)\n", - "Cbc0010I After 9177000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (844.33 seconds)\n", - "Cbc0010I After 9178000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.36 seconds)\n", - "Cbc0010I After 9179000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.41 seconds)\n", - "Cbc0010I After 9180000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (844.46 seconds)\n", - "Cbc0010I After 9181000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (844.49 seconds)\n", - "Cbc0010I After 9182000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (844.54 seconds)\n", - "Cbc0010I After 9183000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (844.58 seconds)\n", - "Cbc0010I After 9184000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (844.63 seconds)\n", - "Cbc0010I After 9185000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (844.68 seconds)\n", - "Cbc0010I After 9186000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (844.71 seconds)\n", - "Cbc0010I After 9187000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (844.75 seconds)\n", - "Cbc0010I After 9188000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (844.79 seconds)\n", - "Cbc0010I After 9189000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (844.85 seconds)\n", - "Cbc0010I After 9190000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (844.90 seconds)\n", - "Cbc0010I After 9191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (844.94 seconds)\n", - "Cbc0010I After 9192000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (844.98 seconds)\n", - "Cbc0010I After 9193000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (845.04 seconds)\n", - "Cbc0010I After 9194000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (845.09 seconds)\n", - "Cbc0010I After 9195000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (845.13 seconds)\n", - "Cbc0010I After 9196000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (845.17 seconds)\n", - "Cbc0010I After 9197000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.22 seconds)\n", - "Cbc0010I After 9198000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (845.28 seconds)\n", - "Cbc0010I After 9199000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (845.32 seconds)\n", - "Cbc0010I After 9200000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (845.36 seconds)\n", - "Cbc0010I After 9201000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (845.41 seconds)\n", - "Cbc0010I After 9202000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.47 seconds)\n", - "Cbc0010I After 9203000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (845.51 seconds)\n", - "Cbc0010I After 9204000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (845.55 seconds)\n", - "Cbc0010I After 9205000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (845.60 seconds)\n", - "Cbc0010I After 9206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (845.66 seconds)\n", - "Cbc0010I After 9207000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (845.69 seconds)\n", - "Cbc0010I After 9208000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (845.73 seconds)\n", - "Cbc0010I After 9209000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (845.76 seconds)\n", - "Cbc0010I After 9210000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (845.80 seconds)\n", - "Cbc0010I After 9211000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (845.84 seconds)\n", - "Cbc0010I After 9212000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (845.87 seconds)\n", - "Cbc0010I After 9213000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (845.91 seconds)\n", - "Cbc0010I After 9214000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (845.95 seconds)\n", - "Cbc0010I After 9215000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (845.99 seconds)\n", - "Cbc0010I After 9216000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.05 seconds)\n", - "Cbc0010I After 9217000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (846.10 seconds)\n", - "Cbc0010I After 9218000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (846.14 seconds)\n", - "Cbc0010I After 9219000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (846.18 seconds)\n", - "Cbc0010I After 9220000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (846.22 seconds)\n", - "Cbc0010I After 9221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (846.29 seconds)\n", - "Cbc0010I After 9222000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (846.33 seconds)\n", - "Cbc0010I After 9223000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (846.37 seconds)\n", - "Cbc0010I After 9224000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (846.41 seconds)\n", - "Cbc0010I After 9225000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (846.46 seconds)\n", - "Cbc0010I After 9226000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (846.53 seconds)\n", - "Cbc0010I After 9227000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (846.59 seconds)\n", - "Cbc0010I After 9228000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (846.65 seconds)\n", - "Cbc0010I After 9229000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (846.71 seconds)\n", - "Cbc0010I After 9230000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (846.77 seconds)\n", - "Cbc0010I After 9231000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.80 seconds)\n", - "Cbc0010I After 9232000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (846.83 seconds)\n", - "Cbc0010I After 9233000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (846.87 seconds)\n", - "Cbc0010I After 9234000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (846.90 seconds)\n", - "Cbc0010I After 9235000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (846.94 seconds)\n", - "Cbc0010I After 9236000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (846.97 seconds)\n", - "Cbc0010I After 9237000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (847.01 seconds)\n", - "Cbc0010I After 9238000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (847.05 seconds)\n", - "Cbc0010I After 9239000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (847.12 seconds)\n", - "Cbc0010I After 9240000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (847.17 seconds)\n", - "Cbc0010I After 9241000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.24 seconds)\n", - "Cbc0010I After 9242000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (847.29 seconds)\n", - "Cbc0010I After 9243000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.35 seconds)\n", - "Cbc0010I After 9244000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (847.40 seconds)\n", - "Cbc0010I After 9245000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (847.43 seconds)\n", - "Cbc0010I After 9246000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (847.47 seconds)\n", - "Cbc0010I After 9247000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (847.51 seconds)\n", - "Cbc0010I After 9248000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.54 seconds)\n", - "Cbc0010I After 9249000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.56 seconds)\n", - "Cbc0010I After 9250000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (847.59 seconds)\n", - "Cbc0010I After 9251000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (847.62 seconds)\n", - "Cbc0010I After 9252000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.65 seconds)\n", - "Cbc0010I After 9253000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (847.69 seconds)\n", - "Cbc0010I After 9254000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (847.73 seconds)\n", - "Cbc0010I After 9255000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (847.76 seconds)\n", - "Cbc0010I After 9256000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (847.79 seconds)\n", - "Cbc0010I After 9257000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (847.83 seconds)\n", - "Cbc0010I After 9258000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (847.86 seconds)\n", - "Cbc0010I After 9259000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (847.89 seconds)\n", - "Cbc0010I After 9260000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (847.93 seconds)\n", - "Cbc0010I After 9261000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (847.96 seconds)\n", - "Cbc0010I After 9262000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (847.99 seconds)\n", - "Cbc0010I After 9263000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (848.02 seconds)\n", - "Cbc0010I After 9264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (848.05 seconds)\n", - "Cbc0010I After 9265000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (848.10 seconds)\n", - "Cbc0010I After 9266000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (848.14 seconds)\n", - "Cbc0010I After 9267000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (848.18 seconds)\n", - "Cbc0010I After 9268000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (848.23 seconds)\n", - "Cbc0010I After 9269000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (848.27 seconds)\n", - "Cbc0010I After 9270000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (848.32 seconds)\n", - "Cbc0010I After 9271000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (848.36 seconds)\n", - "Cbc0010I After 9272000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (848.41 seconds)\n", - "Cbc0010I After 9273000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (848.46 seconds)\n", - "Cbc0010I After 9274000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (848.51 seconds)\n", - "Cbc0010I After 9275000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (848.56 seconds)\n", - "Cbc0010I After 9276000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (848.60 seconds)\n", - "Cbc0010I After 9277000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (848.65 seconds)\n", - "Cbc0010I After 9278000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (848.69 seconds)\n", - "Cbc0010I After 9279000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (848.74 seconds)\n", - "Cbc0010I After 9280000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (848.79 seconds)\n", - "Cbc0010I After 9281000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (848.85 seconds)\n", - "Cbc0010I After 9282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (848.91 seconds)\n", - "Cbc0010I After 9283000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (848.96 seconds)\n", - "Cbc0010I After 9284000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (849.02 seconds)\n", - "Cbc0010I After 9285000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (849.07 seconds)\n", - "Cbc0010I After 9286000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (849.13 seconds)\n", - "Cbc0010I After 9287000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (849.18 seconds)\n", - "Cbc0010I After 9288000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (849.23 seconds)\n", - "Cbc0010I After 9289000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (849.29 seconds)\n", - "Cbc0010I After 9290000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.34 seconds)\n", - "Cbc0010I After 9291000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (849.40 seconds)\n", - "Cbc0010I After 9292000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (849.45 seconds)\n", - "Cbc0010I After 9293000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.52 seconds)\n", - "Cbc0010I After 9294000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (849.57 seconds)\n", - "Cbc0010I After 9295000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (849.62 seconds)\n", - "Cbc0010I After 9296000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.67 seconds)\n", - "Cbc0010I After 9297000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (849.73 seconds)\n", - "Cbc0010I After 9298000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (849.78 seconds)\n", - "Cbc0010I After 9299000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (849.83 seconds)\n", - "Cbc0010I After 9300000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (849.89 seconds)\n", - "Cbc0010I After 9301000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (849.95 seconds)\n", - "Cbc0010I After 9302000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (850.01 seconds)\n", - "Cbc0010I After 9303000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (850.07 seconds)\n", - "Cbc0010I After 9304000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (850.12 seconds)\n", - "Cbc0010I After 9305000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (850.18 seconds)\n", - "Cbc0010I After 9306000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (850.23 seconds)\n", - "Cbc0010I After 9307000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (850.30 seconds)\n", - "Cbc0010I After 9308000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (850.35 seconds)\n", - "Cbc0010I After 9309000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (850.40 seconds)\n", - "Cbc0010I After 9310000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (850.46 seconds)\n", - "Cbc0010I After 9311000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (850.52 seconds)\n", - "Cbc0010I After 9312000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (850.57 seconds)\n", - "Cbc0010I After 9313000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (850.64 seconds)\n", - "Cbc0010I After 9314000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (850.70 seconds)\n", - "Cbc0010I After 9315000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (850.76 seconds)\n", - "Cbc0010I After 9316000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (850.83 seconds)\n", - "Cbc0010I After 9317000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (850.91 seconds)\n", - "Cbc0010I After 9318000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (850.97 seconds)\n", - "Cbc0010I After 9319000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (851.03 seconds)\n", - "Cbc0010I After 9320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (851.09 seconds)\n", - "Cbc0010I After 9321000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (851.16 seconds)\n", - "Cbc0010I After 9322000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (851.23 seconds)\n", - "Cbc0010I After 9323000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.30 seconds)\n", - "Cbc0010I After 9324000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (851.37 seconds)\n", - "Cbc0010I After 9325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (851.44 seconds)\n", - "Cbc0010I After 9326000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.50 seconds)\n", - "Cbc0010I After 9327000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (851.58 seconds)\n", - "Cbc0010I After 9328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (851.65 seconds)\n", - "Cbc0010I After 9329000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (851.72 seconds)\n", - "Cbc0010I After 9330000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (851.77 seconds)\n", - "Cbc0010I After 9331000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (851.81 seconds)\n", - "Cbc0010I After 9332000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (851.84 seconds)\n", - "Cbc0010I After 9333000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (851.90 seconds)\n", - "Cbc0010I After 9334000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (851.94 seconds)\n", - "Cbc0010I After 9335000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (852.01 seconds)\n", - "Cbc0010I After 9336000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (852.04 seconds)\n", - "Cbc0010I After 9337000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (852.08 seconds)\n", - "Cbc0010I After 9338000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (852.11 seconds)\n", - "Cbc0010I After 9339000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (852.15 seconds)\n", - "Cbc0010I After 9340000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (852.20 seconds)\n", - "Cbc0010I After 9341000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (852.27 seconds)\n", - "Cbc0010I After 9342000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (852.34 seconds)\n", - "Cbc0010I After 9343000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (852.41 seconds)\n", - "Cbc0010I After 9344000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (852.47 seconds)\n", - "Cbc0010I After 9345000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (852.51 seconds)\n", - "Cbc0010I After 9346000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (852.57 seconds)\n", - "Cbc0010I After 9347000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (852.62 seconds)\n", - "Cbc0010I After 9348000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (852.66 seconds)\n", - "Cbc0010I After 9349000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (852.70 seconds)\n", - "Cbc0010I After 9350000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (852.74 seconds)\n", - "Cbc0010I After 9351000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (852.79 seconds)\n", - "Cbc0010I After 9352000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (852.82 seconds)\n", - "Cbc0010I After 9353000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (852.88 seconds)\n", - "Cbc0010I After 9354000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (852.93 seconds)\n", - "Cbc0010I After 9355000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (852.96 seconds)\n", - "Cbc0010I After 9356000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (852.99 seconds)\n", - "Cbc0010I After 9357000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (853.04 seconds)\n", - "Cbc0010I After 9358000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (853.12 seconds)\n", - "Cbc0010I After 9359000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (853.20 seconds)\n", - "Cbc0010I After 9360000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (853.28 seconds)\n", - "Cbc0010I After 9361000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (853.36 seconds)\n", - "Cbc0010I After 9362000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (853.44 seconds)\n", - "Cbc0010I After 9363000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (853.52 seconds)\n", - "Cbc0010I After 9364000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (853.59 seconds)\n", - "Cbc0010I After 9365000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (853.67 seconds)\n", - "Cbc0010I After 9366000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (853.75 seconds)\n", - "Cbc0010I After 9367000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (853.83 seconds)\n", - "Cbc0010I After 9368000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (853.89 seconds)\n", - "Cbc0010I After 9369000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (853.93 seconds)\n", - "Cbc0010I After 9370000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (853.99 seconds)\n", - "Cbc0010I After 9371000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (854.05 seconds)\n", - "Cbc0010I After 9372000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (854.10 seconds)\n", - "Cbc0010I After 9373000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (854.15 seconds)\n", - "Cbc0010I After 9374000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (854.18 seconds)\n", - "Cbc0010I After 9375000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (854.21 seconds)\n", - "Cbc0010I After 9376000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (854.24 seconds)\n", - "Cbc0010I After 9377000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (854.28 seconds)\n", - "Cbc0010I After 9378000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (854.32 seconds)\n", - "Cbc0010I After 9379000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (854.35 seconds)\n", - "Cbc0010I After 9380000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (854.39 seconds)\n", - "Cbc0010I After 9381000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (854.45 seconds)\n", - "Cbc0010I After 9382000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (854.50 seconds)\n", - "Cbc0010I After 9383000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (854.54 seconds)\n", - "Cbc0010I After 9384000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (854.60 seconds)\n", - "Cbc0010I After 9385000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (854.64 seconds)\n", - "Cbc0010I After 9386000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (854.68 seconds)\n", - "Cbc0010I After 9387000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (854.71 seconds)\n", - "Cbc0010I After 9388000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (854.75 seconds)\n", - "Cbc0010I After 9389000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (854.79 seconds)\n", - "Cbc0010I After 9390000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (854.83 seconds)\n", - "Cbc0010I After 9391000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (854.86 seconds)\n", - "Cbc0010I After 9392000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (854.90 seconds)\n", - "Cbc0010I After 9393000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (854.96 seconds)\n", - "Cbc0010I After 9394000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (855.00 seconds)\n", - "Cbc0010I After 9395000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (855.07 seconds)\n", - "Cbc0010I After 9396000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (855.16 seconds)\n", - "Cbc0010I After 9397000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (855.21 seconds)\n", - "Cbc0010I After 9398000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (855.25 seconds)\n", - "Cbc0010I After 9399000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (855.31 seconds)\n", - "Cbc0010I After 9400000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (855.40 seconds)\n", - "Cbc0010I After 9401000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (855.48 seconds)\n", - "Cbc0010I After 9402000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (855.53 seconds)\n", - "Cbc0010I After 9403000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (855.59 seconds)\n", - "Cbc0010I After 9404000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (855.63 seconds)\n", - "Cbc0010I After 9405000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (855.71 seconds)\n", - "Cbc0010I After 9406000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (855.76 seconds)\n", - "Cbc0010I After 9407000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (855.80 seconds)\n", - "Cbc0010I After 9408000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (855.87 seconds)\n", - "Cbc0010I After 9409000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (855.91 seconds)\n", - "Cbc0010I After 9410000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (855.96 seconds)\n", - "Cbc0010I After 9411000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (856.03 seconds)\n", - "Cbc0010I After 9412000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (856.11 seconds)\n", - "Cbc0010I After 9413000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (856.18 seconds)\n", - "Cbc0010I After 9414000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (856.25 seconds)\n", - "Cbc0010I After 9415000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (856.33 seconds)\n", - "Cbc0010I After 9416000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (856.39 seconds)\n", - "Cbc0010I After 9417000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (856.43 seconds)\n", - "Cbc0010I After 9418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (856.46 seconds)\n", - "Cbc0010I After 9419000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (856.50 seconds)\n", - "Cbc0010I After 9420000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (856.55 seconds)\n", - "Cbc0010I After 9421000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (856.59 seconds)\n", - "Cbc0010I After 9422000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (856.64 seconds)\n", - "Cbc0010I After 9423000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (856.70 seconds)\n", - "Cbc0010I After 9424000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (856.78 seconds)\n", - "Cbc0010I After 9425000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (856.84 seconds)\n", - "Cbc0010I After 9426000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (856.91 seconds)\n", - "Cbc0010I After 9427000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (856.96 seconds)\n", - "Cbc0010I After 9428000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (856.99 seconds)\n", - "Cbc0010I After 9429000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (857.03 seconds)\n", - "Cbc0010I After 9430000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.08 seconds)\n", - "Cbc0010I After 9431000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (857.13 seconds)\n", - "Cbc0010I After 9432000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (857.20 seconds)\n", - "Cbc0010I After 9433000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (857.31 seconds)\n", - "Cbc0010I After 9434000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (857.39 seconds)\n", - "Cbc0010I After 9435000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.43 seconds)\n", - "Cbc0010I After 9436000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (857.47 seconds)\n", - "Cbc0010I After 9437000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (857.51 seconds)\n", - "Cbc0010I After 9438000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (857.55 seconds)\n", - "Cbc0010I After 9439000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (857.60 seconds)\n", - "Cbc0010I After 9440000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (857.68 seconds)\n", - "Cbc0010I After 9441000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (857.75 seconds)\n", - "Cbc0010I After 9442000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (857.81 seconds)\n", - "Cbc0010I After 9443000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (857.88 seconds)\n", - "Cbc0010I After 9444000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (857.93 seconds)\n", - "Cbc0010I After 9445000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (857.96 seconds)\n", - "Cbc0010I After 9446000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (858.01 seconds)\n", - "Cbc0010I After 9447000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (858.08 seconds)\n", - "Cbc0010I After 9448000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (858.14 seconds)\n", - "Cbc0010I After 9449000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (858.21 seconds)\n", - "Cbc0010I After 9450000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (858.29 seconds)\n", - "Cbc0010I After 9451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (858.33 seconds)\n", - "Cbc0010I After 9452000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (858.38 seconds)\n", - "Cbc0010I After 9453000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (858.44 seconds)\n", - "Cbc0010I After 9454000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (858.50 seconds)\n", - "Cbc0010I After 9455000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (858.58 seconds)\n", - "Cbc0010I After 9456000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (858.65 seconds)\n", - "Cbc0010I After 9457000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (858.73 seconds)\n", - "Cbc0010I After 9458000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (858.81 seconds)\n", - "Cbc0010I After 9459000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (858.89 seconds)\n", - "Cbc0010I After 9460000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (858.96 seconds)\n", - "Cbc0010I After 9461000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (859.04 seconds)\n", - "Cbc0010I After 9462000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (859.12 seconds)\n", - "Cbc0010I After 9463000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (859.20 seconds)\n", - "Cbc0010I After 9464000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (859.27 seconds)\n", - "Cbc0010I After 9465000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (859.32 seconds)\n", - "Cbc0010I After 9466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (859.39 seconds)\n", - "Cbc0010I After 9467000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (859.47 seconds)\n", - "Cbc0010I After 9468000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (859.53 seconds)\n", - "Cbc0010I After 9469000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (859.60 seconds)\n", - "Cbc0010I After 9470000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (859.67 seconds)\n", - "Cbc0010I After 9471000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (859.73 seconds)\n", - "Cbc0010I After 9472000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (859.80 seconds)\n", - "Cbc0010I After 9473000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (859.86 seconds)\n", - "Cbc0010I After 9474000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (859.93 seconds)\n", - "Cbc0010I After 9475000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (860.00 seconds)\n", - "Cbc0010I After 9476000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (860.05 seconds)\n", - "Cbc0010I After 9477000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (860.11 seconds)\n", - "Cbc0010I After 9478000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (860.16 seconds)\n", - "Cbc0010I After 9479000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (860.23 seconds)\n", - "Cbc0010I After 9480000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.29 seconds)\n", - "Cbc0010I After 9481000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (860.36 seconds)\n", - "Cbc0010I After 9482000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.44 seconds)\n", - "Cbc0010I After 9483000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.53 seconds)\n", - "Cbc0010I After 9484000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.62 seconds)\n", - "Cbc0010I After 9485000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (860.68 seconds)\n", - "Cbc0010I After 9486000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (860.74 seconds)\n", - "Cbc0010I After 9487000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (860.82 seconds)\n", - "Cbc0010I After 9488000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (860.89 seconds)\n", - "Cbc0010I After 9489000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (860.97 seconds)\n", - "Cbc0010I After 9490000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (861.04 seconds)\n", - "Cbc0010I After 9491000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (861.11 seconds)\n", - "Cbc0010I After 9492000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (861.18 seconds)\n", - "Cbc0010I After 9493000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (861.22 seconds)\n", - "Cbc0010I After 9494000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (861.25 seconds)\n", - "Cbc0010I After 9495000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (861.28 seconds)\n", - "Cbc0010I After 9496000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (861.31 seconds)\n", - "Cbc0010I After 9497000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (861.34 seconds)\n", - "Cbc0010I After 9498000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (861.37 seconds)\n", - "Cbc0010I After 9499000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (861.42 seconds)\n", - "Cbc0010I After 9500000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (861.48 seconds)\n", - "Cbc0010I After 9501000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (861.53 seconds)\n", - "Cbc0010I After 9502000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (861.58 seconds)\n", - "Cbc0010I After 9503000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (861.64 seconds)\n", - "Cbc0010I After 9504000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (861.69 seconds)\n", - "Cbc0010I After 9505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (861.74 seconds)\n", - "Cbc0010I After 9506000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (861.79 seconds)\n", - "Cbc0010I After 9507000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (861.82 seconds)\n", - "Cbc0010I After 9508000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (861.85 seconds)\n", - "Cbc0010I After 9509000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (861.89 seconds)\n", - "Cbc0010I After 9510000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (861.93 seconds)\n", - "Cbc0010I After 9511000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (861.99 seconds)\n", - "Cbc0010I After 9512000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.06 seconds)\n", - "Cbc0010I After 9513000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (862.10 seconds)\n", - "Cbc0010I After 9514000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (862.13 seconds)\n", - "Cbc0010I After 9515000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (862.19 seconds)\n", - "Cbc0010I After 9516000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (862.27 seconds)\n", - "Cbc0010I After 9517000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (862.35 seconds)\n", - "Cbc0010I After 9518000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (862.43 seconds)\n", - "Cbc0010I After 9519000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (862.51 seconds)\n", - "Cbc0010I After 9520000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.58 seconds)\n", - "Cbc0010I After 9521000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (862.65 seconds)\n", - "Cbc0010I After 9522000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (862.68 seconds)\n", - "Cbc0010I After 9523000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (862.72 seconds)\n", - "Cbc0010I After 9524000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (862.78 seconds)\n", - "Cbc0010I After 9525000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (862.81 seconds)\n", - "Cbc0010I After 9526000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (862.84 seconds)\n", - "Cbc0010I After 9527000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (862.89 seconds)\n", - "Cbc0010I After 9528000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (862.94 seconds)\n", - "Cbc0010I After 9529000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (862.99 seconds)\n", - "Cbc0010I After 9530000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (863.05 seconds)\n", - "Cbc0010I After 9531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (863.11 seconds)\n", - "Cbc0010I After 9532000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (863.15 seconds)\n", - "Cbc0010I After 9533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (863.19 seconds)\n", - "Cbc0010I After 9534000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (863.23 seconds)\n", - "Cbc0010I After 9535000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (863.27 seconds)\n", - "Cbc0010I After 9536000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (863.32 seconds)\n", - "Cbc0010I After 9537000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (863.38 seconds)\n", - "Cbc0010I After 9538000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (863.44 seconds)\n", - "Cbc0010I After 9539000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (863.48 seconds)\n", - "Cbc0010I After 9540000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (863.54 seconds)\n", - "Cbc0010I After 9541000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (863.58 seconds)\n", - "Cbc0010I After 9542000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (863.62 seconds)\n", - "Cbc0010I After 9543000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (863.66 seconds)\n", - "Cbc0010I After 9544000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (863.71 seconds)\n", - "Cbc0010I After 9545000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (863.75 seconds)\n", - "Cbc0010I After 9546000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (863.80 seconds)\n", - "Cbc0010I After 9547000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (863.83 seconds)\n", - "Cbc0010I After 9548000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (863.87 seconds)\n", - "Cbc0010I After 9549000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (863.91 seconds)\n", - "Cbc0010I After 9550000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (863.94 seconds)\n", - "Cbc0010I After 9551000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (863.97 seconds)\n", - "Cbc0010I After 9552000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (864.01 seconds)\n", - "Cbc0010I After 9553000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (864.06 seconds)\n", - "Cbc0010I After 9554000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (864.11 seconds)\n", - "Cbc0010I After 9555000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (864.15 seconds)\n", - "Cbc0010I After 9556000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (864.19 seconds)\n", - "Cbc0010I After 9557000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (864.24 seconds)\n", - "Cbc0010I After 9558000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (864.27 seconds)\n", - "Cbc0010I After 9559000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (864.33 seconds)\n", - "Cbc0010I After 9560000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (864.36 seconds)\n", - "Cbc0010I After 9561000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (864.41 seconds)\n", - "Cbc0010I After 9562000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (864.45 seconds)\n", - "Cbc0010I After 9563000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (864.48 seconds)\n", - "Cbc0010I After 9564000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (864.52 seconds)\n", - "Cbc0010I After 9565000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (864.57 seconds)\n", - "Cbc0010I After 9566000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (864.64 seconds)\n", - "Cbc0010I After 9567000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (864.69 seconds)\n", - "Cbc0010I After 9568000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (864.72 seconds)\n", - "Cbc0010I After 9569000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (864.76 seconds)\n", - "Cbc0010I After 9570000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (864.80 seconds)\n", - "Cbc0010I After 9571000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (864.84 seconds)\n", - "Cbc0010I After 9572000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (864.87 seconds)\n", - "Cbc0010I After 9573000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (864.91 seconds)\n", - "Cbc0010I After 9574000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (864.95 seconds)\n", - "Cbc0010I After 9575000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (865.01 seconds)\n", - "Cbc0010I After 9576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (865.05 seconds)\n", - "Cbc0010I After 9577000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (865.10 seconds)\n", - "Cbc0010I After 9578000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (865.13 seconds)\n", - "Cbc0010I After 9579000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (865.17 seconds)\n", - "Cbc0010I After 9580000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (865.21 seconds)\n", - "Cbc0010I After 9581000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (865.25 seconds)\n", - "Cbc0010I After 9582000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (865.30 seconds)\n", - "Cbc0010I After 9583000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (865.36 seconds)\n", - "Cbc0010I After 9584000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (865.44 seconds)\n", - "Cbc0010I After 9585000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (865.50 seconds)\n", - "Cbc0010I After 9586000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (865.57 seconds)\n", - "Cbc0010I After 9587000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (865.61 seconds)\n", - "Cbc0010I After 9588000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (865.64 seconds)\n", - "Cbc0010I After 9589000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (865.70 seconds)\n", - "Cbc0010I After 9590000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (865.73 seconds)\n", - "Cbc0010I After 9591000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (865.78 seconds)\n", - "Cbc0010I After 9592000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (865.83 seconds)\n", - "Cbc0010I After 9593000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (865.86 seconds)\n", - "Cbc0010I After 9594000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (865.90 seconds)\n", - "Cbc0010I After 9595000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (865.93 seconds)\n", - "Cbc0010I After 9596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (865.96 seconds)\n", - "Cbc0010I After 9597000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (866.00 seconds)\n", - "Cbc0010I After 9598000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (866.04 seconds)\n", - "Cbc0010I After 9599000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (866.08 seconds)\n", - "Cbc0010I After 9600000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.13 seconds)\n", - "Cbc0010I After 9601000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (866.19 seconds)\n", - "Cbc0010I After 9602000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.23 seconds)\n", - "Cbc0010I After 9603000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (866.26 seconds)\n", - "Cbc0010I After 9604000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (866.31 seconds)\n", - "Cbc0010I After 9605000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.34 seconds)\n", - "Cbc0010I After 9606000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (866.38 seconds)\n", - "Cbc0010I After 9607000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (866.44 seconds)\n", - "Cbc0010I After 9608000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (866.47 seconds)\n", - "Cbc0010I After 9609000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (866.52 seconds)\n", - "Cbc0010I After 9610000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (866.57 seconds)\n", - "Cbc0010I After 9611000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.62 seconds)\n", - "Cbc0010I After 9612000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (866.67 seconds)\n", - "Cbc0010I After 9613000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (866.72 seconds)\n", - "Cbc0010I After 9614000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (866.79 seconds)\n", - "Cbc0010I After 9615000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (866.83 seconds)\n", - "Cbc0010I After 9616000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (866.86 seconds)\n", - "Cbc0010I After 9617000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (866.89 seconds)\n", - "Cbc0010I After 9618000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (866.93 seconds)\n", - "Cbc0010I After 9619000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (866.97 seconds)\n", - "Cbc0010I After 9620000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (867.00 seconds)\n", - "Cbc0010I After 9621000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (867.04 seconds)\n", - "Cbc0010I After 9622000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (867.08 seconds)\n", - "Cbc0010I After 9623000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (867.12 seconds)\n", - "Cbc0010I After 9624000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (867.16 seconds)\n", - "Cbc0010I After 9625000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (867.20 seconds)\n", - "Cbc0010I After 9626000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (867.25 seconds)\n", - "Cbc0010I After 9627000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (867.30 seconds)\n", - "Cbc0010I After 9628000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (867.34 seconds)\n", - "Cbc0010I After 9629000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (867.38 seconds)\n", - "Cbc0010I After 9630000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (867.45 seconds)\n", - "Cbc0010I After 9631000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (867.49 seconds)\n", - "Cbc0010I After 9632000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (867.55 seconds)\n", - "Cbc0010I After 9633000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (867.59 seconds)\n", - "Cbc0010I After 9634000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (867.64 seconds)\n", - "Cbc0010I After 9635000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (867.69 seconds)\n", - "Cbc0010I After 9636000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (867.74 seconds)\n", - "Cbc0010I After 9637000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (867.80 seconds)\n", - "Cbc0010I After 9638000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (867.85 seconds)\n", - "Cbc0010I After 9639000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (867.90 seconds)\n", - "Cbc0010I After 9640000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (867.95 seconds)\n", - "Cbc0010I After 9641000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (867.99 seconds)\n", - "Cbc0010I After 9642000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (868.04 seconds)\n", - "Cbc0010I After 9643000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (868.09 seconds)\n", - "Cbc0010I After 9644000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (868.14 seconds)\n", - "Cbc0010I After 9645000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (868.19 seconds)\n", - "Cbc0010I After 9646000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (868.22 seconds)\n", - "Cbc0010I After 9647000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (868.27 seconds)\n", - "Cbc0010I After 9648000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (868.31 seconds)\n", - "Cbc0010I After 9649000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (868.37 seconds)\n", - "Cbc0010I After 9650000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (868.42 seconds)\n", - "Cbc0010I After 9651000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (868.47 seconds)\n", - "Cbc0010I After 9652000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (868.53 seconds)\n", - "Cbc0010I After 9653000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (868.58 seconds)\n", - "Cbc0010I After 9654000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (868.64 seconds)\n", - "Cbc0010I After 9655000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (868.70 seconds)\n", - "Cbc0010I After 9656000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (868.76 seconds)\n", - "Cbc0010I After 9657000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (868.81 seconds)\n", - "Cbc0010I After 9658000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (868.87 seconds)\n", - "Cbc0010I After 9659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (868.92 seconds)\n", - "Cbc0010I After 9660000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (868.98 seconds)\n", - "Cbc0010I After 9661000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (869.03 seconds)\n", - "Cbc0010I After 9662000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (869.09 seconds)\n", - "Cbc0010I After 9663000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (869.15 seconds)\n", - "Cbc0010I After 9664000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (869.21 seconds)\n", - "Cbc0010I After 9665000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (869.26 seconds)\n", - "Cbc0010I After 9666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (869.32 seconds)\n", - "Cbc0010I After 9667000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (869.37 seconds)\n", - "Cbc0010I After 9668000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (869.43 seconds)\n", - "Cbc0010I After 9669000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (869.48 seconds)\n", - "Cbc0010I After 9670000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (869.55 seconds)\n", - "Cbc0010I After 9671000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (869.61 seconds)\n", - "Cbc0010I After 9672000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (869.67 seconds)\n", - "Cbc0010I After 9673000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (869.74 seconds)\n", - "Cbc0010I After 9674000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (869.79 seconds)\n", - "Cbc0010I After 9675000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (869.85 seconds)\n", - "Cbc0010I After 9676000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (869.91 seconds)\n", - "Cbc0010I After 9677000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (869.97 seconds)\n", - "Cbc0010I After 9678000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (870.02 seconds)\n", - "Cbc0010I After 9679000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (870.06 seconds)\n", - "Cbc0010I After 9680000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.12 seconds)\n", - "Cbc0010I After 9681000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (870.17 seconds)\n", - "Cbc0010I After 9682000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (870.21 seconds)\n", - "Cbc0010I After 9683000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (870.26 seconds)\n", - "Cbc0010I After 9684000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.31 seconds)\n", - "Cbc0010I After 9685000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (870.37 seconds)\n", - "Cbc0010I After 9686000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.42 seconds)\n", - "Cbc0010I After 9687000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (870.47 seconds)\n", - "Cbc0010I After 9688000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (870.52 seconds)\n", - "Cbc0010I After 9689000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (870.58 seconds)\n", - "Cbc0010I After 9690000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (870.63 seconds)\n", - "Cbc0010I After 9691000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.66 seconds)\n", - "Cbc0010I After 9692000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.71 seconds)\n", - "Cbc0010I After 9693000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (870.76 seconds)\n", - "Cbc0010I After 9694000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (870.81 seconds)\n", - "Cbc0010I After 9695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (870.88 seconds)\n", - "Cbc0010I After 9696000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (870.94 seconds)\n", - "Cbc0010I After 9697000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (870.99 seconds)\n", - "Cbc0010I After 9698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (871.04 seconds)\n", - "Cbc0010I After 9699000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (871.10 seconds)\n", - "Cbc0010I After 9700000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (871.15 seconds)\n", - "Cbc0010I After 9701000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (871.20 seconds)\n", - "Cbc0010I After 9702000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (871.26 seconds)\n", - "Cbc0010I After 9703000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (871.31 seconds)\n", - "Cbc0010I After 9704000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (871.37 seconds)\n", - "Cbc0010I After 9705000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (871.43 seconds)\n", - "Cbc0010I After 9706000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.48 seconds)\n", - "Cbc0010I After 9707000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (871.53 seconds)\n", - "Cbc0010I After 9708000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (871.58 seconds)\n", - "Cbc0010I After 9709000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.63 seconds)\n", - "Cbc0010I After 9710000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (871.69 seconds)\n", - "Cbc0010I After 9711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (871.74 seconds)\n", - "Cbc0010I After 9712000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (871.80 seconds)\n", - "Cbc0010I After 9713000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (871.85 seconds)\n", - "Cbc0010I After 9714000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (871.91 seconds)\n", - "Cbc0010I After 9715000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (871.97 seconds)\n", - "Cbc0010I After 9716000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (872.02 seconds)\n", - "Cbc0010I After 9717000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (872.08 seconds)\n", - "Cbc0010I After 9718000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (872.13 seconds)\n", - "Cbc0010I After 9719000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (872.18 seconds)\n", - "Cbc0010I After 9720000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (872.23 seconds)\n", - "Cbc0010I After 9721000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (872.30 seconds)\n", - "Cbc0010I After 9722000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (872.35 seconds)\n", - "Cbc0010I After 9723000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (872.41 seconds)\n", - "Cbc0010I After 9724000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (872.45 seconds)\n", - "Cbc0010I After 9725000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (872.50 seconds)\n", - "Cbc0010I After 9726000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (872.55 seconds)\n", - "Cbc0010I After 9727000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (872.60 seconds)\n", - "Cbc0010I After 9728000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (872.66 seconds)\n", - "Cbc0010I After 9729000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (872.71 seconds)\n", - "Cbc0010I After 9730000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (872.78 seconds)\n", - "Cbc0010I After 9731000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (872.84 seconds)\n", - "Cbc0010I After 9732000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (872.91 seconds)\n", - "Cbc0010I After 9733000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (872.96 seconds)\n", - "Cbc0010I After 9734000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (873.02 seconds)\n", - "Cbc0010I After 9735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (873.08 seconds)\n", - "Cbc0010I After 9736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.15 seconds)\n", - "Cbc0010I After 9737000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (873.25 seconds)\n", - "Cbc0010I After 9738000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.32 seconds)\n", - "Cbc0010I After 9739000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (873.38 seconds)\n", - "Cbc0010I After 9740000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (873.44 seconds)\n", - "Cbc0010I After 9741000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (873.50 seconds)\n", - "Cbc0010I After 9742000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (873.56 seconds)\n", - "Cbc0010I After 9743000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (873.62 seconds)\n", - "Cbc0010I After 9744000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (873.70 seconds)\n", - "Cbc0010I After 9745000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (873.77 seconds)\n", - "Cbc0010I After 9746000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (873.84 seconds)\n", - "Cbc0010I After 9747000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (873.92 seconds)\n", - "Cbc0010I After 9748000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (874.00 seconds)\n", - "Cbc0010I After 9749000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (874.07 seconds)\n", - "Cbc0010I After 9750000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.14 seconds)\n", - "Cbc0010I After 9751000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (874.22 seconds)\n", - "Cbc0010I After 9752000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.29 seconds)\n", - "Cbc0010I After 9753000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.36 seconds)\n", - "Cbc0010I After 9754000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.41 seconds)\n", - "Cbc0010I After 9755000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (874.47 seconds)\n", - "Cbc0010I After 9756000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (874.53 seconds)\n", - "Cbc0010I After 9757000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (874.60 seconds)\n", - "Cbc0010I After 9758000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (874.65 seconds)\n", - "Cbc0010I After 9759000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (874.70 seconds)\n", - "Cbc0010I After 9760000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (874.75 seconds)\n", - "Cbc0010I After 9761000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (874.80 seconds)\n", - "Cbc0010I After 9762000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (874.86 seconds)\n", - "Cbc0010I After 9763000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (874.93 seconds)\n", - "Cbc0010I After 9764000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.00 seconds)\n", - "Cbc0010I After 9765000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (875.08 seconds)\n", - "Cbc0010I After 9766000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (875.15 seconds)\n", - "Cbc0010I After 9767000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (875.22 seconds)\n", - "Cbc0010I After 9768000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (875.30 seconds)\n", - "Cbc0010I After 9769000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.38 seconds)\n", - "Cbc0010I After 9770000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (875.45 seconds)\n", - "Cbc0010I After 9771000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (875.52 seconds)\n", - "Cbc0010I After 9772000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (875.58 seconds)\n", - "Cbc0010I After 9773000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (875.63 seconds)\n", - "Cbc0010I After 9774000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.68 seconds)\n", - "Cbc0010I After 9775000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (875.72 seconds)\n", - "Cbc0010I After 9776000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.77 seconds)\n", - "Cbc0010I After 9777000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (875.83 seconds)\n", - "Cbc0010I After 9778000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (875.88 seconds)\n", - "Cbc0010I After 9779000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (875.93 seconds)\n", - "Cbc0010I After 9780000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (875.99 seconds)\n", - "Cbc0010I After 9781000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (876.05 seconds)\n", - "Cbc0010I After 9782000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (876.11 seconds)\n", - "Cbc0010I After 9783000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (876.17 seconds)\n", - "Cbc0010I After 9784000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (876.24 seconds)\n", - "Cbc0010I After 9785000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (876.30 seconds)\n", - "Cbc0010I After 9786000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (876.36 seconds)\n", - "Cbc0010I After 9787000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (876.43 seconds)\n", - "Cbc0010I After 9788000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (876.49 seconds)\n", - "Cbc0010I After 9789000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (876.56 seconds)\n", - "Cbc0010I After 9790000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (876.61 seconds)\n", - "Cbc0010I After 9791000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (876.67 seconds)\n", - "Cbc0010I After 9792000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (876.73 seconds)\n", - "Cbc0010I After 9793000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (876.79 seconds)\n", - "Cbc0010I After 9794000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (876.85 seconds)\n", - "Cbc0010I After 9795000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (876.91 seconds)\n", - "Cbc0010I After 9796000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (876.97 seconds)\n", - "Cbc0010I After 9797000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (877.02 seconds)\n", - "Cbc0010I After 9798000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (877.07 seconds)\n", - "Cbc0010I After 9799000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.13 seconds)\n", - "Cbc0010I After 9800000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (877.19 seconds)\n", - "Cbc0010I After 9801000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (877.26 seconds)\n", - "Cbc0010I After 9802000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.31 seconds)\n", - "Cbc0010I After 9803000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (877.37 seconds)\n", - "Cbc0010I After 9804000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (877.43 seconds)\n", - "Cbc0010I After 9805000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (877.49 seconds)\n", - "Cbc0010I After 9806000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (877.56 seconds)\n", - "Cbc0010I After 9807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (877.60 seconds)\n", - "Cbc0010I After 9808000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (877.67 seconds)\n", - "Cbc0010I After 9809000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (877.73 seconds)\n", - "Cbc0010I After 9810000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (877.78 seconds)\n", - "Cbc0010I After 9811000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (877.83 seconds)\n", - "Cbc0010I After 9812000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (877.86 seconds)\n", - "Cbc0010I After 9813000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (877.90 seconds)\n", - "Cbc0010I After 9814000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (877.94 seconds)\n", - "Cbc0010I After 9815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (878.02 seconds)\n", - "Cbc0010I After 9816000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (878.08 seconds)\n", - "Cbc0010I After 9817000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (878.15 seconds)\n", - "Cbc0010I After 9818000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (878.21 seconds)\n", - "Cbc0010I After 9819000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (878.28 seconds)\n", - "Cbc0010I After 9820000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (878.33 seconds)\n", - "Cbc0010I After 9821000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (878.39 seconds)\n", - "Cbc0010I After 9822000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (878.45 seconds)\n", - "Cbc0010I After 9823000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (878.52 seconds)\n", - "Cbc0010I After 9824000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (878.58 seconds)\n", - "Cbc0010I After 9825000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (878.63 seconds)\n", - "Cbc0010I After 9826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (878.70 seconds)\n", - "Cbc0010I After 9827000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (878.75 seconds)\n", - "Cbc0010I After 9828000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (878.82 seconds)\n", - "Cbc0010I After 9829000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (878.88 seconds)\n", - "Cbc0010I After 9830000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (878.93 seconds)\n", - "Cbc0010I After 9831000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (879.00 seconds)\n", - "Cbc0010I After 9832000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (879.05 seconds)\n", - "Cbc0010I After 9833000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (879.10 seconds)\n", - "Cbc0010I After 9834000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (879.15 seconds)\n", - "Cbc0010I After 9835000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (879.21 seconds)\n", - "Cbc0010I After 9836000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (879.25 seconds)\n", - "Cbc0010I After 9837000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (879.31 seconds)\n", - "Cbc0010I After 9838000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (879.36 seconds)\n", - "Cbc0010I After 9839000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (879.40 seconds)\n", - "Cbc0010I After 9840000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (879.46 seconds)\n", - "Cbc0010I After 9841000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (879.51 seconds)\n", - "Cbc0010I After 9842000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (879.55 seconds)\n", - "Cbc0010I After 9843000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (879.60 seconds)\n", - "Cbc0010I After 9844000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (879.66 seconds)\n", - "Cbc0010I After 9845000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (879.70 seconds)\n", - "Cbc0010I After 9846000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (879.76 seconds)\n", - "Cbc0010I After 9847000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (879.82 seconds)\n", - "Cbc0010I After 9848000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (879.87 seconds)\n", - "Cbc0010I After 9849000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (879.92 seconds)\n", - "Cbc0010I After 9850000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (879.98 seconds)\n", - "Cbc0010I After 9851000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (880.05 seconds)\n", - "Cbc0010I After 9852000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (880.11 seconds)\n", - "Cbc0010I After 9853000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (880.17 seconds)\n", - "Cbc0010I After 9854000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (880.23 seconds)\n", - "Cbc0010I After 9855000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (880.29 seconds)\n", - "Cbc0010I After 9856000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (880.35 seconds)\n", - "Cbc0010I After 9857000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (880.41 seconds)\n", - "Cbc0010I After 9858000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (880.47 seconds)\n", - "Cbc0010I After 9859000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (880.53 seconds)\n", - "Cbc0010I After 9860000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (880.59 seconds)\n", - "Cbc0010I After 9861000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (880.66 seconds)\n", - "Cbc0010I After 9862000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (880.72 seconds)\n", - "Cbc0010I After 9863000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (880.77 seconds)\n", - "Cbc0010I After 9864000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (880.84 seconds)\n", - "Cbc0010I After 9865000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (880.89 seconds)\n", - "Cbc0010I After 9866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (880.96 seconds)\n", - "Cbc0010I After 9867000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (881.04 seconds)\n", - "Cbc0010I After 9868000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (881.10 seconds)\n", - "Cbc0010I After 9869000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (881.16 seconds)\n", - "Cbc0010I After 9870000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (881.21 seconds)\n", - "Cbc0010I After 9871000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (881.26 seconds)\n", - "Cbc0010I After 9872000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (881.33 seconds)\n", - "Cbc0010I After 9873000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (881.40 seconds)\n", - "Cbc0010I After 9874000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (881.45 seconds)\n", - "Cbc0010I After 9875000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (881.52 seconds)\n", - "Cbc0010I After 9876000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (881.59 seconds)\n", - "Cbc0010I After 9877000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (881.67 seconds)\n", - "Cbc0010I After 9878000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (881.74 seconds)\n", - "Cbc0010I After 9879000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (881.82 seconds)\n", - "Cbc0010I After 9880000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (881.88 seconds)\n", - "Cbc0010I After 9881000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (881.96 seconds)\n", - "Cbc0010I After 9882000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (882.02 seconds)\n", - "Cbc0010I After 9883000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (882.09 seconds)\n", - "Cbc0010I After 9884000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.16 seconds)\n", - "Cbc0010I After 9885000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (882.24 seconds)\n", - "Cbc0010I After 9886000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.30 seconds)\n", - "Cbc0010I After 9887000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (882.37 seconds)\n", - "Cbc0010I After 9888000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (882.44 seconds)\n", - "Cbc0010I After 9889000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (882.51 seconds)\n", - "Cbc0010I After 9890000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (882.58 seconds)\n", - "Cbc0010I After 9891000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (882.66 seconds)\n", - "Cbc0010I After 9892000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (882.72 seconds)\n", - "Cbc0010I After 9893000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (882.78 seconds)\n", - "Cbc0010I After 9894000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (882.86 seconds)\n", - "Cbc0010I After 9895000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (882.93 seconds)\n", - "Cbc0010I After 9896000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (882.98 seconds)\n", - "Cbc0010I After 9897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (883.04 seconds)\n", - "Cbc0010I After 9898000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (883.09 seconds)\n", - "Cbc0010I After 9899000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (883.15 seconds)\n", - "Cbc0010I After 9900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (883.21 seconds)\n", - "Cbc0010I After 9901000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (883.27 seconds)\n", - "Cbc0010I After 9902000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (883.33 seconds)\n", - "Cbc0010I After 9903000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (883.40 seconds)\n", - "Cbc0010I After 9904000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (883.45 seconds)\n", - "Cbc0010I After 9905000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (883.51 seconds)\n", - "Cbc0010I After 9906000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (883.57 seconds)\n", - "Cbc0010I After 9907000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (883.63 seconds)\n", - "Cbc0010I After 9908000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (883.69 seconds)\n", - "Cbc0010I After 9909000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (883.76 seconds)\n", - "Cbc0010I After 9910000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (883.84 seconds)\n", - "Cbc0010I After 9911000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (883.92 seconds)\n", - "Cbc0010I After 9912000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (884.00 seconds)\n", - "Cbc0010I After 9913000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (884.08 seconds)\n", - "Cbc0010I After 9914000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (884.15 seconds)\n", - "Cbc0010I After 9915000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (884.22 seconds)\n", - "Cbc0010I After 9916000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (884.30 seconds)\n", - "Cbc0010I After 9917000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (884.37 seconds)\n", - "Cbc0010I After 9918000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (884.45 seconds)\n", - "Cbc0010I After 9919000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (884.52 seconds)\n", - "Cbc0010I After 9920000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (884.58 seconds)\n", - "Cbc0010I After 9921000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (884.65 seconds)\n", - "Cbc0010I After 9922000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (884.72 seconds)\n", - "Cbc0010I After 9923000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (884.80 seconds)\n", - "Cbc0010I After 9924000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (884.86 seconds)\n", - "Cbc0010I After 9925000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (884.93 seconds)\n", - "Cbc0010I After 9926000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (884.99 seconds)\n", - "Cbc0010I After 9927000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (885.06 seconds)\n", - "Cbc0010I After 9928000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (885.12 seconds)\n", - "Cbc0010I After 9929000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (885.19 seconds)\n", - "Cbc0010I After 9930000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (885.25 seconds)\n", - "Cbc0010I After 9931000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (885.30 seconds)\n", - "Cbc0010I After 9932000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (885.36 seconds)\n", - "Cbc0010I After 9933000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (885.42 seconds)\n", - "Cbc0010I After 9934000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (885.47 seconds)\n", - "Cbc0010I After 9935000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (885.53 seconds)\n", - "Cbc0010I After 9936000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (885.60 seconds)\n", - "Cbc0010I After 9937000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (885.65 seconds)\n", - "Cbc0010I After 9938000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (885.72 seconds)\n", - "Cbc0010I After 9939000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (885.79 seconds)\n", - "Cbc0010I After 9940000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (885.84 seconds)\n", - "Cbc0010I After 9941000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (885.92 seconds)\n", - "Cbc0010I After 9942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (885.97 seconds)\n", - "Cbc0010I After 9943000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (886.05 seconds)\n", - "Cbc0010I After 9944000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (886.12 seconds)\n", - "Cbc0010I After 9945000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (886.19 seconds)\n", - "Cbc0010I After 9946000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (886.25 seconds)\n", - "Cbc0010I After 9947000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (886.33 seconds)\n", - "Cbc0010I After 9948000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (886.40 seconds)\n", - "Cbc0010I After 9949000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (886.48 seconds)\n", - "Cbc0010I After 9950000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (886.58 seconds)\n", - "Cbc0010I After 9951000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (886.67 seconds)\n", - "Cbc0010I After 9952000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (886.76 seconds)\n", - "Cbc0010I After 9953000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (886.84 seconds)\n", - "Cbc0010I After 9954000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (886.91 seconds)\n", - "Cbc0010I After 9955000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (886.98 seconds)\n", - "Cbc0010I After 9956000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (887.05 seconds)\n", - "Cbc0010I After 9957000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (887.13 seconds)\n", - "Cbc0010I After 9958000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (887.21 seconds)\n", - "Cbc0010I After 9959000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (887.28 seconds)\n", - "Cbc0010I After 9960000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (887.36 seconds)\n", - "Cbc0010I After 9961000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (887.43 seconds)\n", - "Cbc0010I After 9962000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (887.49 seconds)\n", - "Cbc0010I After 9963000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (887.55 seconds)\n", - "Cbc0010I After 9964000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (887.60 seconds)\n", - "Cbc0010I After 9965000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (887.66 seconds)\n", - "Cbc0010I After 9966000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (887.72 seconds)\n", - "Cbc0010I After 9967000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (887.79 seconds)\n", - "Cbc0010I After 9968000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (887.85 seconds)\n", - "Cbc0010I After 9969000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (887.91 seconds)\n", - "Cbc0010I After 9970000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (887.97 seconds)\n", - "Cbc0010I After 9971000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (888.02 seconds)\n", - "Cbc0010I After 9972000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (888.06 seconds)\n", - "Cbc0010I After 9973000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (888.11 seconds)\n", - "Cbc0010I After 9974000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (888.16 seconds)\n", - "Cbc0010I After 9975000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (888.22 seconds)\n", - "Cbc0010I After 9976000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (888.29 seconds)\n", - "Cbc0010I After 9977000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (888.34 seconds)\n", - "Cbc0010I After 9978000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (888.40 seconds)\n", - "Cbc0010I After 9979000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (888.48 seconds)\n", - "Cbc0010I After 9980000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (888.56 seconds)\n", - "Cbc0010I After 9981000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (888.63 seconds)\n", - "Cbc0010I After 9982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (888.71 seconds)\n", - "Cbc0010I After 9983000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (888.77 seconds)\n", - "Cbc0010I After 9984000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (888.84 seconds)\n", - "Cbc0010I After 9985000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (888.92 seconds)\n", - "Cbc0010I After 9986000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (889.00 seconds)\n", - "Cbc0010I After 9987000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.07 seconds)\n", - "Cbc0010I After 9988000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (889.15 seconds)\n", - "Cbc0010I After 9989000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.23 seconds)\n", - "Cbc0010I After 9990000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (889.31 seconds)\n", - "Cbc0010I After 9991000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (889.39 seconds)\n", - "Cbc0010I After 9992000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (889.46 seconds)\n", - "Cbc0010I After 9993000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (889.53 seconds)\n", - "Cbc0010I After 9994000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (889.60 seconds)\n", - "Cbc0010I After 9995000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (889.65 seconds)\n", - "Cbc0010I After 9996000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (889.71 seconds)\n", - "Cbc0010I After 9997000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (889.77 seconds)\n", - "Cbc0010I After 9998000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (889.82 seconds)\n", - "Cbc0010I After 9999000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (889.88 seconds)\n", - "Cbc0010I After 10000000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (889.92 seconds)\n", - "Cbc0010I After 10001000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (889.97 seconds)\n", - "Cbc0010I After 10002000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (890.01 seconds)\n", - "Cbc0010I After 10003000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (890.06 seconds)\n", - "Cbc0010I After 10004000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (890.11 seconds)\n", - "Cbc0010I After 10005000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (890.17 seconds)\n", - "Cbc0010I After 10006000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (890.22 seconds)\n", - "Cbc0010I After 10007000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (890.29 seconds)\n", - "Cbc0010I After 10008000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (890.35 seconds)\n", - "Cbc0010I After 10009000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (890.41 seconds)\n", - "Cbc0010I After 10010000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (890.48 seconds)\n", - "Cbc0010I After 10011000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (890.54 seconds)\n", - "Cbc0010I After 10012000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (890.60 seconds)\n", - "Cbc0010I After 10013000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (890.65 seconds)\n", - "Cbc0010I After 10014000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (890.71 seconds)\n", - "Cbc0010I After 10015000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (890.77 seconds)\n", - "Cbc0010I After 10016000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (890.83 seconds)\n", - "Cbc0010I After 10017000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (890.89 seconds)\n", - "Cbc0010I After 10018000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (890.94 seconds)\n", - "Cbc0010I After 10019000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (890.99 seconds)\n", - "Cbc0010I After 10020000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (891.03 seconds)\n", - "Cbc0010I After 10021000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (891.09 seconds)\n", - "Cbc0010I After 10022000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (891.14 seconds)\n", - "Cbc0010I After 10023000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (891.18 seconds)\n", - "Cbc0010I After 10024000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (891.23 seconds)\n", - "Cbc0010I After 10025000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (891.31 seconds)\n", - "Cbc0010I After 10026000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (891.36 seconds)\n", - "Cbc0010I After 10027000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (891.40 seconds)\n", - "Cbc0010I After 10028000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (891.45 seconds)\n", - "Cbc0010I After 10029000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (891.48 seconds)\n", - "Cbc0010I After 10030000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (891.51 seconds)\n", - "Cbc0010I After 10031000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (891.54 seconds)\n", - "Cbc0010I After 10032000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (891.60 seconds)\n", - "Cbc0010I After 10033000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (891.68 seconds)\n", - "Cbc0010I After 10034000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (891.72 seconds)\n", - "Cbc0010I After 10035000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (891.76 seconds)\n", - "Cbc0010I After 10036000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (891.82 seconds)\n", - "Cbc0010I After 10037000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (891.88 seconds)\n", - "Cbc0010I After 10038000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (891.93 seconds)\n", - "Cbc0010I After 10039000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (891.97 seconds)\n", - "Cbc0010I After 10040000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (892.01 seconds)\n", - "Cbc0010I After 10041000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (892.06 seconds)\n", - "Cbc0010I After 10042000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (892.11 seconds)\n", - "Cbc0010I After 10043000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (892.18 seconds)\n", - "Cbc0010I After 10044000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (892.26 seconds)\n", - "Cbc0010I After 10045000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (892.34 seconds)\n", - "Cbc0010I After 10046000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (892.41 seconds)\n", - "Cbc0010I After 10047000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (892.45 seconds)\n", - "Cbc0010I After 10048000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (892.49 seconds)\n", - "Cbc0010I After 10049000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (892.52 seconds)\n", - "Cbc0010I After 10050000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (892.56 seconds)\n", - "Cbc0010I After 10051000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (892.59 seconds)\n", - "Cbc0010I After 10052000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (892.63 seconds)\n", - "Cbc0010I After 10053000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (892.66 seconds)\n", - "Cbc0010I After 10054000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (892.70 seconds)\n", - "Cbc0010I After 10055000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (892.73 seconds)\n", - "Cbc0010I After 10056000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (892.77 seconds)\n", - "Cbc0010I After 10057000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (892.81 seconds)\n", - "Cbc0010I After 10058000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (892.86 seconds)\n", - "Cbc0010I After 10059000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (892.93 seconds)\n", - "Cbc0010I After 10060000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (892.98 seconds)\n", - "Cbc0010I After 10061000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (893.05 seconds)\n", - "Cbc0010I After 10062000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (893.11 seconds)\n", - "Cbc0010I After 10063000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (893.14 seconds)\n", - "Cbc0010I After 10064000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (893.18 seconds)\n", - "Cbc0010I After 10065000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (893.22 seconds)\n", - "Cbc0010I After 10066000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (893.25 seconds)\n", - "Cbc0010I After 10067000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (893.30 seconds)\n", - "Cbc0010I After 10068000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (893.34 seconds)\n", - "Cbc0010I After 10069000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (893.37 seconds)\n", - "Cbc0010I After 10070000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (893.41 seconds)\n", - "Cbc0010I After 10071000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.46 seconds)\n", - "Cbc0010I After 10072000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (893.52 seconds)\n", - "Cbc0010I After 10073000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (893.56 seconds)\n", - "Cbc0010I After 10074000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (893.61 seconds)\n", - "Cbc0010I After 10075000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (893.66 seconds)\n", - "Cbc0010I After 10076000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (893.72 seconds)\n", - "Cbc0010I After 10077000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (893.75 seconds)\n", - "Cbc0010I After 10078000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.80 seconds)\n", - "Cbc0010I After 10079000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (893.87 seconds)\n", - "Cbc0010I After 10080000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (893.93 seconds)\n", - "Cbc0010I After 10081000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (893.97 seconds)\n", - "Cbc0010I After 10082000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (894.01 seconds)\n", - "Cbc0010I After 10083000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (894.06 seconds)\n", - "Cbc0010I After 10084000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (894.09 seconds)\n", - "Cbc0010I After 10085000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (894.14 seconds)\n", - "Cbc0010I After 10086000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (894.20 seconds)\n", - "Cbc0010I After 10087000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (894.28 seconds)\n", - "Cbc0010I After 10088000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (894.35 seconds)\n", - "Cbc0010I After 10089000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (894.42 seconds)\n", - "Cbc0010I After 10090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (894.49 seconds)\n", - "Cbc0010I After 10091000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (894.55 seconds)\n", - "Cbc0010I After 10092000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (894.62 seconds)\n", - "Cbc0010I After 10093000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (894.68 seconds)\n", - "Cbc0010I After 10094000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (894.72 seconds)\n", - "Cbc0010I After 10095000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (894.75 seconds)\n", - "Cbc0010I After 10096000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (894.80 seconds)\n", - "Cbc0010I After 10097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (894.86 seconds)\n", - "Cbc0010I After 10098000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (894.90 seconds)\n", - "Cbc0010I After 10099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (894.97 seconds)\n", - "Cbc0010I After 10100000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (895.03 seconds)\n", - "Cbc0010I After 10101000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (895.07 seconds)\n", - "Cbc0010I After 10102000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (895.11 seconds)\n", - "Cbc0010I After 10103000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (895.14 seconds)\n", - "Cbc0010I After 10104000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (895.19 seconds)\n", - "Cbc0010I After 10105000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (895.22 seconds)\n", - "Cbc0010I After 10106000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (895.26 seconds)\n", - "Cbc0010I After 10107000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (895.32 seconds)\n", - "Cbc0010I After 10108000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (895.38 seconds)\n", - "Cbc0010I After 10109000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (895.44 seconds)\n", - "Cbc0010I After 10110000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (895.50 seconds)\n", - "Cbc0010I After 10111000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (895.56 seconds)\n", - "Cbc0010I After 10112000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (895.61 seconds)\n", - "Cbc0010I After 10113000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (895.66 seconds)\n", - "Cbc0010I After 10114000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (895.73 seconds)\n", - "Cbc0010I After 10115000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (895.77 seconds)\n", - "Cbc0010I After 10116000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (895.81 seconds)\n", - "Cbc0010I After 10117000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (895.84 seconds)\n", - "Cbc0010I After 10118000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (895.87 seconds)\n", - "Cbc0010I After 10119000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (895.90 seconds)\n", - "Cbc0010I After 10120000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (895.93 seconds)\n", - "Cbc0010I After 10121000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (895.99 seconds)\n", - "Cbc0010I After 10122000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.05 seconds)\n", - "Cbc0010I After 10123000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (896.10 seconds)\n", - "Cbc0010I After 10124000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (896.17 seconds)\n", - "Cbc0010I After 10125000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (896.24 seconds)\n", - "Cbc0010I After 10126000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (896.28 seconds)\n", - "Cbc0010I After 10127000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (896.32 seconds)\n", - "Cbc0010I After 10128000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.36 seconds)\n", - "Cbc0010I After 10129000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (896.40 seconds)\n", - "Cbc0010I After 10130000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (896.43 seconds)\n", - "Cbc0010I After 10131000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (896.49 seconds)\n", - "Cbc0010I After 10132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (896.52 seconds)\n", - "Cbc0010I After 10133000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (896.56 seconds)\n", - "Cbc0010I After 10134000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (896.60 seconds)\n", - "Cbc0010I After 10135000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (896.64 seconds)\n", - "Cbc0010I After 10136000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (896.69 seconds)\n", - "Cbc0010I After 10137000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (896.77 seconds)\n", - "Cbc0010I After 10138000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (896.84 seconds)\n", - "Cbc0010I After 10139000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (896.92 seconds)\n", - "Cbc0010I After 10140000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (897.00 seconds)\n", - "Cbc0010I After 10141000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (897.07 seconds)\n", - "Cbc0010I After 10142000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (897.15 seconds)\n", - "Cbc0010I After 10143000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (897.21 seconds)\n", - "Cbc0010I After 10144000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (897.28 seconds)\n", - "Cbc0010I After 10145000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (897.35 seconds)\n", - "Cbc0010I After 10146000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (897.43 seconds)\n", - "Cbc0010I After 10147000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (897.49 seconds)\n", - "Cbc0010I After 10148000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (897.58 seconds)\n", - "Cbc0010I After 10149000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (897.66 seconds)\n", - "Cbc0010I After 10150000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (897.75 seconds)\n", - "Cbc0010I After 10151000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (897.83 seconds)\n", - "Cbc0010I After 10152000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (897.89 seconds)\n", - "Cbc0010I After 10153000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (897.95 seconds)\n", - "Cbc0010I After 10154000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (898.02 seconds)\n", - "Cbc0010I After 10155000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (898.07 seconds)\n", - "Cbc0010I After 10156000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (898.12 seconds)\n", - "Cbc0010I After 10157000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (898.17 seconds)\n", - "Cbc0010I After 10158000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (898.21 seconds)\n", - "Cbc0010I After 10159000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (898.25 seconds)\n", - "Cbc0010I After 10160000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (898.30 seconds)\n", - "Cbc0010I After 10161000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (898.37 seconds)\n", - "Cbc0010I After 10162000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (898.41 seconds)\n", - "Cbc0010I After 10163000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (898.44 seconds)\n", - "Cbc0010I After 10164000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (898.49 seconds)\n", - "Cbc0010I After 10165000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (898.55 seconds)\n", - "Cbc0010I After 10166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (898.60 seconds)\n", - "Cbc0010I After 10167000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (898.64 seconds)\n", - "Cbc0010I After 10168000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (898.68 seconds)\n", - "Cbc0010I After 10169000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (898.71 seconds)\n", - "Cbc0010I After 10170000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (898.75 seconds)\n", - "Cbc0010I After 10171000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (898.79 seconds)\n", - "Cbc0010I After 10172000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (898.82 seconds)\n", - "Cbc0010I After 10173000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (898.85 seconds)\n", - "Cbc0010I After 10174000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (898.89 seconds)\n", - "Cbc0010I After 10175000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (898.94 seconds)\n", - "Cbc0010I After 10176000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (898.98 seconds)\n", - "Cbc0010I After 10177000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (899.01 seconds)\n", - "Cbc0010I After 10178000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (899.04 seconds)\n", - "Cbc0010I After 10179000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (899.09 seconds)\n", - "Cbc0010I After 10180000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (899.14 seconds)\n", - "Cbc0010I After 10181000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (899.17 seconds)\n", - "Cbc0010I After 10182000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (899.23 seconds)\n", - "Cbc0010I After 10183000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (899.27 seconds)\n", - "Cbc0010I After 10184000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (899.30 seconds)\n", - "Cbc0010I After 10185000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (899.36 seconds)\n", - "Cbc0010I After 10186000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (899.40 seconds)\n", - "Cbc0010I After 10187000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (899.46 seconds)\n", - "Cbc0010I After 10188000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (899.51 seconds)\n", - "Cbc0010I After 10189000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (899.55 seconds)\n", - "Cbc0010I After 10190000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (899.60 seconds)\n", - "Cbc0010I After 10191000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (899.67 seconds)\n", - "Cbc0010I After 10192000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (899.75 seconds)\n", - "Cbc0010I After 10193000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (899.83 seconds)\n", - "Cbc0010I After 10194000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (899.91 seconds)\n", - "Cbc0010I After 10195000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (899.97 seconds)\n", - "Cbc0010I After 10196000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.01 seconds)\n", - "Cbc0010I After 10197000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.05 seconds)\n", - "Cbc0010I After 10198000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (900.08 seconds)\n", - "Cbc0010I After 10199000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (900.12 seconds)\n", - "Cbc0010I After 10200000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (900.15 seconds)\n", - "Cbc0010I After 10201000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (900.19 seconds)\n", - "Cbc0010I After 10202000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (900.23 seconds)\n", - "Cbc0010I After 10203000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.31 seconds)\n", - "Cbc0010I After 10204000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (900.40 seconds)\n", - "Cbc0010I After 10205000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (900.47 seconds)\n", - "Cbc0010I After 10206000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (900.51 seconds)\n", - "Cbc0010I After 10207000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.56 seconds)\n", - "Cbc0010I After 10208000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.59 seconds)\n", - "Cbc0010I After 10209000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (900.66 seconds)\n", - "Cbc0010I After 10210000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (900.73 seconds)\n", - "Cbc0010I After 10211000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (900.76 seconds)\n", - "Cbc0010I After 10212000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (900.80 seconds)\n", - "Cbc0010I After 10213000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (900.85 seconds)\n", - "Cbc0010I After 10214000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (900.88 seconds)\n", - "Cbc0010I After 10215000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.91 seconds)\n", - "Cbc0010I After 10216000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (900.94 seconds)\n", - "Cbc0010I After 10217000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (900.97 seconds)\n", - "Cbc0010I After 10218000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (901.02 seconds)\n", - "Cbc0010I After 10219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (901.07 seconds)\n", - "Cbc0010I After 10220000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (901.12 seconds)\n", - "Cbc0010I After 10221000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (901.16 seconds)\n", - "Cbc0010I After 10222000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (901.21 seconds)\n", - "Cbc0010I After 10223000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (901.25 seconds)\n", - "Cbc0010I After 10224000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (901.30 seconds)\n", - "Cbc0010I After 10225000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (901.35 seconds)\n", - "Cbc0010I After 10226000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (901.42 seconds)\n", - "Cbc0010I After 10227000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (901.50 seconds)\n", - "Cbc0010I After 10228000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (901.57 seconds)\n", - "Cbc0010I After 10229000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (901.64 seconds)\n", - "Cbc0010I After 10230000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (901.67 seconds)\n", - "Cbc0010I After 10231000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (901.74 seconds)\n", - "Cbc0010I After 10232000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (901.77 seconds)\n", - "Cbc0010I After 10233000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (901.80 seconds)\n", - "Cbc0010I After 10234000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (901.83 seconds)\n", - "Cbc0010I After 10235000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (901.86 seconds)\n", - "Cbc0010I After 10236000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (901.90 seconds)\n", - "Cbc0010I After 10237000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (901.94 seconds)\n", - "Cbc0010I After 10238000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (901.97 seconds)\n", - "Cbc0010I After 10239000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.01 seconds)\n", - "Cbc0010I After 10240000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.06 seconds)\n", - "Cbc0010I After 10241000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (902.10 seconds)\n", - "Cbc0010I After 10242000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (902.13 seconds)\n", - "Cbc0010I After 10243000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (902.18 seconds)\n", - "Cbc0010I After 10244000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (902.23 seconds)\n", - "Cbc0010I After 10245000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.27 seconds)\n", - "Cbc0010I After 10246000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (902.33 seconds)\n", - "Cbc0010I After 10247000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.37 seconds)\n", - "Cbc0010I After 10248000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (902.40 seconds)\n", - "Cbc0010I After 10249000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.46 seconds)\n", - "Cbc0010I After 10250000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (902.49 seconds)\n", - "Cbc0010I After 10251000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.53 seconds)\n", - "Cbc0010I After 10252000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (902.57 seconds)\n", - "Cbc0010I After 10253000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (902.63 seconds)\n", - "Cbc0010I After 10254000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (902.67 seconds)\n", - "Cbc0010I After 10255000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (902.70 seconds)\n", - "Cbc0010I After 10256000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (902.75 seconds)\n", - "Cbc0010I After 10257000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (902.79 seconds)\n", - "Cbc0010I After 10258000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (902.82 seconds)\n", - "Cbc0010I After 10259000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (902.86 seconds)\n", - "Cbc0010I After 10260000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (902.89 seconds)\n", - "Cbc0010I After 10261000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (902.93 seconds)\n", - "Cbc0010I After 10262000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (902.97 seconds)\n", - "Cbc0010I After 10263000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (903.04 seconds)\n", - "Cbc0010I After 10264000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (903.07 seconds)\n", - "Cbc0010I After 10265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (903.10 seconds)\n", - "Cbc0010I After 10266000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (903.16 seconds)\n", - "Cbc0010I After 10267000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (903.20 seconds)\n", - "Cbc0010I After 10268000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (903.24 seconds)\n", - "Cbc0010I After 10269000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (903.29 seconds)\n", - "Cbc0010I After 10270000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (903.33 seconds)\n", - "Cbc0010I After 10271000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.36 seconds)\n", - "Cbc0010I After 10272000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (903.42 seconds)\n", - "Cbc0010I After 10273000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.47 seconds)\n", - "Cbc0010I After 10274000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (903.52 seconds)\n", - "Cbc0010I After 10275000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.57 seconds)\n", - "Cbc0010I After 10276000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (903.61 seconds)\n", - "Cbc0010I After 10277000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (903.67 seconds)\n", - "Cbc0010I After 10278000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (903.72 seconds)\n", - "Cbc0010I After 10279000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (903.77 seconds)\n", - "Cbc0010I After 10280000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (903.81 seconds)\n", - "Cbc0010I After 10281000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (903.86 seconds)\n", - "Cbc0010I After 10282000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (903.91 seconds)\n", - "Cbc0010I After 10283000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (903.96 seconds)\n", - "Cbc0010I After 10284000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (904.02 seconds)\n", - "Cbc0010I After 10285000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (904.06 seconds)\n", - "Cbc0010I After 10286000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (904.12 seconds)\n", - "Cbc0010I After 10287000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (904.17 seconds)\n", - "Cbc0010I After 10288000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (904.23 seconds)\n", - "Cbc0010I After 10289000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (904.29 seconds)\n", - "Cbc0010I After 10290000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (904.35 seconds)\n", - "Cbc0010I After 10291000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (904.40 seconds)\n", - "Cbc0010I After 10292000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (904.46 seconds)\n", - "Cbc0010I After 10293000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (904.50 seconds)\n", - "Cbc0010I After 10294000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (904.55 seconds)\n", - "Cbc0010I After 10295000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (904.61 seconds)\n", - "Cbc0010I After 10296000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (904.67 seconds)\n", - "Cbc0010I After 10297000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (904.73 seconds)\n", - "Cbc0010I After 10298000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (904.79 seconds)\n", - "Cbc0010I After 10299000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (904.84 seconds)\n", - "Cbc0010I After 10300000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (904.90 seconds)\n", - "Cbc0010I After 10301000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (904.95 seconds)\n", - "Cbc0010I After 10302000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.01 seconds)\n", - "Cbc0010I After 10303000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (905.08 seconds)\n", - "Cbc0010I After 10304000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.13 seconds)\n", - "Cbc0010I After 10305000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (905.20 seconds)\n", - "Cbc0010I After 10306000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (905.26 seconds)\n", - "Cbc0010I After 10307000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (905.31 seconds)\n", - "Cbc0010I After 10308000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (905.37 seconds)\n", - "Cbc0010I After 10309000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.42 seconds)\n", - "Cbc0010I After 10310000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (905.48 seconds)\n", - "Cbc0010I After 10311000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.53 seconds)\n", - "Cbc0010I After 10312000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (905.58 seconds)\n", - "Cbc0010I After 10313000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (905.63 seconds)\n", - "Cbc0010I After 10314000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (905.68 seconds)\n", - "Cbc0010I After 10315000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (905.72 seconds)\n", - "Cbc0010I After 10316000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (905.78 seconds)\n", - "Cbc0010I After 10317000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (905.83 seconds)\n", - "Cbc0010I After 10318000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (905.89 seconds)\n", - "Cbc0010I After 10319000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (905.94 seconds)\n", - "Cbc0010I After 10320000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (905.99 seconds)\n", - "Cbc0010I After 10321000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (906.05 seconds)\n", - "Cbc0010I After 10322000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.10 seconds)\n", - "Cbc0010I After 10323000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (906.15 seconds)\n", - "Cbc0010I After 10324000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (906.23 seconds)\n", - "Cbc0010I After 10325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (906.30 seconds)\n", - "Cbc0010I After 10326000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (906.36 seconds)\n", - "Cbc0010I After 10327000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.42 seconds)\n", - "Cbc0010I After 10328000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (906.47 seconds)\n", - "Cbc0010I After 10329000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (906.53 seconds)\n", - "Cbc0010I After 10330000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (906.59 seconds)\n", - "Cbc0010I After 10331000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (906.67 seconds)\n", - "Cbc0010I After 10332000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (906.74 seconds)\n", - "Cbc0010I After 10333000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (906.79 seconds)\n", - "Cbc0010I After 10334000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (906.84 seconds)\n", - "Cbc0010I After 10335000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (906.89 seconds)\n", - "Cbc0010I After 10336000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (906.95 seconds)\n", - "Cbc0010I After 10337000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (907.00 seconds)\n", - "Cbc0010I After 10338000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (907.04 seconds)\n", - "Cbc0010I After 10339000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (907.09 seconds)\n", - "Cbc0010I After 10340000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (907.14 seconds)\n", - "Cbc0010I After 10341000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (907.18 seconds)\n", - "Cbc0010I After 10342000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (907.23 seconds)\n", - "Cbc0010I After 10343000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (907.29 seconds)\n", - "Cbc0010I After 10344000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (907.34 seconds)\n", - "Cbc0010I After 10345000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (907.40 seconds)\n", - "Cbc0010I After 10346000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (907.45 seconds)\n", - "Cbc0010I After 10347000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (907.50 seconds)\n", - "Cbc0010I After 10348000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (907.55 seconds)\n", - "Cbc0010I After 10349000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (907.59 seconds)\n", - "Cbc0010I After 10350000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (907.65 seconds)\n", - "Cbc0010I After 10351000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (907.70 seconds)\n", - "Cbc0010I After 10352000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (907.75 seconds)\n", - "Cbc0010I After 10353000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (907.80 seconds)\n", - "Cbc0010I After 10354000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (907.85 seconds)\n", - "Cbc0010I After 10355000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (907.90 seconds)\n", - "Cbc0010I After 10356000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (907.96 seconds)\n", - "Cbc0010I After 10357000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (908.01 seconds)\n", - "Cbc0010I After 10358000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (908.07 seconds)\n", - "Cbc0010I After 10359000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.12 seconds)\n", - "Cbc0010I After 10360000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.17 seconds)\n", - "Cbc0010I After 10361000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (908.23 seconds)\n", - "Cbc0010I After 10362000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (908.28 seconds)\n", - "Cbc0010I After 10363000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.33 seconds)\n", - "Cbc0010I After 10364000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (908.38 seconds)\n", - "Cbc0010I After 10365000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (908.44 seconds)\n", - "Cbc0010I After 10366000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (908.50 seconds)\n", - "Cbc0010I After 10367000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.59 seconds)\n", - "Cbc0010I After 10368000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (908.73 seconds)\n", - "Cbc0010I After 10369000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (908.80 seconds)\n", - "Cbc0010I After 10370000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (908.85 seconds)\n", - "Cbc0010I After 10371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (908.91 seconds)\n", - "Cbc0010I After 10372000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (908.97 seconds)\n", - "Cbc0010I After 10373000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (909.01 seconds)\n", - "Cbc0010I After 10374000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.06 seconds)\n", - "Cbc0010I After 10375000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (909.12 seconds)\n", - "Cbc0010I After 10376000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (909.17 seconds)\n", - "Cbc0010I After 10377000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (909.23 seconds)\n", - "Cbc0010I After 10378000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.30 seconds)\n", - "Cbc0010I After 10379000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.37 seconds)\n", - "Cbc0010I After 10380000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (909.45 seconds)\n", - "Cbc0010I After 10381000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (909.50 seconds)\n", - "Cbc0010I After 10382000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (909.56 seconds)\n", - "Cbc0010I After 10383000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (909.62 seconds)\n", - "Cbc0010I After 10384000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (909.67 seconds)\n", - "Cbc0010I After 10385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (909.73 seconds)\n", - "Cbc0010I After 10386000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (909.78 seconds)\n", - "Cbc0010I After 10387000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (909.83 seconds)\n", - "Cbc0010I After 10388000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (909.88 seconds)\n", - "Cbc0010I After 10389000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (909.95 seconds)\n", - "Cbc0010I After 10390000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (910.02 seconds)\n", - "Cbc0010I After 10391000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (910.09 seconds)\n", - "Cbc0010I After 10392000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (910.16 seconds)\n", - "Cbc0010I After 10393000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (910.23 seconds)\n", - "Cbc0010I After 10394000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (910.27 seconds)\n", - "Cbc0010I After 10395000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (910.32 seconds)\n", - "Cbc0010I After 10396000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (910.36 seconds)\n", - "Cbc0010I After 10397000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (910.41 seconds)\n", - "Cbc0010I After 10398000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.46 seconds)\n", - "Cbc0010I After 10399000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.51 seconds)\n", - "Cbc0010I After 10400000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (910.56 seconds)\n", - "Cbc0010I After 10401000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (910.61 seconds)\n", - "Cbc0010I After 10402000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (910.67 seconds)\n", - "Cbc0010I After 10403000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (910.72 seconds)\n", - "Cbc0010I After 10404000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (910.78 seconds)\n", - "Cbc0010I After 10405000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (910.84 seconds)\n", - "Cbc0010I After 10406000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (910.92 seconds)\n", - "Cbc0010I After 10407000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (910.99 seconds)\n", - "Cbc0010I After 10408000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (911.06 seconds)\n", - "Cbc0010I After 10409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (911.12 seconds)\n", - "Cbc0010I After 10410000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (911.19 seconds)\n", - "Cbc0010I After 10411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (911.25 seconds)\n", - "Cbc0010I After 10412000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (911.31 seconds)\n", - "Cbc0010I After 10413000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (911.36 seconds)\n", - "Cbc0010I After 10414000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (911.42 seconds)\n", - "Cbc0010I After 10415000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (911.48 seconds)\n", - "Cbc0010I After 10416000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (911.54 seconds)\n", - "Cbc0010I After 10417000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (911.61 seconds)\n", - "Cbc0010I After 10418000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (911.68 seconds)\n", - "Cbc0010I After 10419000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (911.75 seconds)\n", - "Cbc0010I After 10420000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (911.83 seconds)\n", - "Cbc0010I After 10421000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (911.90 seconds)\n", - "Cbc0010I After 10422000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (911.97 seconds)\n", - "Cbc0010I After 10423000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (912.03 seconds)\n", - "Cbc0010I After 10424000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (912.10 seconds)\n", - "Cbc0010I After 10425000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (912.17 seconds)\n", - "Cbc0010I After 10426000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (912.24 seconds)\n", - "Cbc0010I After 10427000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (912.30 seconds)\n", - "Cbc0010I After 10428000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (912.36 seconds)\n", - "Cbc0010I After 10429000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (912.42 seconds)\n", - "Cbc0010I After 10430000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (912.48 seconds)\n", - "Cbc0010I After 10431000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (912.53 seconds)\n", - "Cbc0010I After 10432000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (912.58 seconds)\n", - "Cbc0010I After 10433000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (912.62 seconds)\n", - "Cbc0010I After 10434000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (912.66 seconds)\n", - "Cbc0010I After 10435000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (912.72 seconds)\n", - "Cbc0010I After 10436000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (912.76 seconds)\n", - "Cbc0010I After 10437000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (912.81 seconds)\n", - "Cbc0010I After 10438000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (912.87 seconds)\n", - "Cbc0010I After 10439000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (912.91 seconds)\n", - "Cbc0010I After 10440000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (912.97 seconds)\n", - "Cbc0010I After 10441000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (913.02 seconds)\n", - "Cbc0010I After 10442000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (913.09 seconds)\n", - "Cbc0010I After 10443000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (913.15 seconds)\n", - "Cbc0010I After 10444000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (913.21 seconds)\n", - "Cbc0010I After 10445000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (913.27 seconds)\n", - "Cbc0010I After 10446000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (913.33 seconds)\n", - "Cbc0010I After 10447000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (913.38 seconds)\n", - "Cbc0010I After 10448000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.43 seconds)\n", - "Cbc0010I After 10449000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (913.50 seconds)\n", - "Cbc0010I After 10450000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (913.55 seconds)\n", - "Cbc0010I After 10451000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (913.61 seconds)\n", - "Cbc0010I After 10452000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.66 seconds)\n", - "Cbc0010I After 10453000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (913.72 seconds)\n", - "Cbc0010I After 10454000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (913.77 seconds)\n", - "Cbc0010I After 10455000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (913.83 seconds)\n", - "Cbc0010I After 10456000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (913.89 seconds)\n", - "Cbc0010I After 10457000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (913.95 seconds)\n", - "Cbc0010I After 10458000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (914.00 seconds)\n", - "Cbc0010I After 10459000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (914.05 seconds)\n", - "Cbc0010I After 10460000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (914.11 seconds)\n", - "Cbc0010I After 10461000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (914.17 seconds)\n", - "Cbc0010I After 10462000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (914.22 seconds)\n", - "Cbc0010I After 10463000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (914.27 seconds)\n", - "Cbc0010I After 10464000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (914.33 seconds)\n", - "Cbc0010I After 10465000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (914.39 seconds)\n", - "Cbc0010I After 10466000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (914.45 seconds)\n", - "Cbc0010I After 10467000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (914.51 seconds)\n", - "Cbc0010I After 10468000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.57 seconds)\n", - "Cbc0010I After 10469000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (914.63 seconds)\n", - "Cbc0010I After 10470000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.69 seconds)\n", - "Cbc0010I After 10471000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (914.75 seconds)\n", - "Cbc0010I After 10472000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (914.81 seconds)\n", - "Cbc0010I After 10473000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (914.87 seconds)\n", - "Cbc0010I After 10474000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (914.93 seconds)\n", - "Cbc0010I After 10475000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (914.99 seconds)\n", - "Cbc0010I After 10476000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (915.04 seconds)\n", - "Cbc0010I After 10477000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (915.10 seconds)\n", - "Cbc0010I After 10478000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (915.17 seconds)\n", - "Cbc0010I After 10479000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (915.22 seconds)\n", - "Cbc0010I After 10480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (915.27 seconds)\n", - "Cbc0010I After 10481000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (915.34 seconds)\n", - "Cbc0010I After 10482000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (915.39 seconds)\n", - "Cbc0010I After 10483000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (915.45 seconds)\n", - "Cbc0010I After 10484000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.51 seconds)\n", - "Cbc0010I After 10485000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.55 seconds)\n", - "Cbc0010I After 10486000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (915.62 seconds)\n", - "Cbc0010I After 10487000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (915.66 seconds)\n", - "Cbc0010I After 10488000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (915.73 seconds)\n", - "Cbc0010I After 10489000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (915.77 seconds)\n", - "Cbc0010I After 10490000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (915.84 seconds)\n", - "Cbc0010I After 10491000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (915.92 seconds)\n", - "Cbc0010I After 10492000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (915.98 seconds)\n", - "Cbc0010I After 10493000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (916.04 seconds)\n", - "Cbc0010I After 10494000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (916.10 seconds)\n", - "Cbc0010I After 10495000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (916.16 seconds)\n", - "Cbc0010I After 10496000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (916.22 seconds)\n", - "Cbc0010I After 10497000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (916.28 seconds)\n", - "Cbc0010I After 10498000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (916.35 seconds)\n", - "Cbc0010I After 10499000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (916.41 seconds)\n", - "Cbc0010I After 10500000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (916.46 seconds)\n", - "Cbc0010I After 10501000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (916.50 seconds)\n", - "Cbc0010I After 10502000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (916.56 seconds)\n", - "Cbc0010I After 10503000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (916.62 seconds)\n", - "Cbc0010I After 10504000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (916.67 seconds)\n", - "Cbc0010I After 10505000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (916.72 seconds)\n", - "Cbc0010I After 10506000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (916.78 seconds)\n", - "Cbc0010I After 10507000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (916.83 seconds)\n", - "Cbc0010I After 10508000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (916.89 seconds)\n", - "Cbc0010I After 10509000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (916.94 seconds)\n", - "Cbc0010I After 10510000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (917.00 seconds)\n", - "Cbc0010I After 10511000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (917.05 seconds)\n", - "Cbc0010I After 10512000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (917.11 seconds)\n", - "Cbc0010I After 10513000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (917.17 seconds)\n", - "Cbc0010I After 10514000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.22 seconds)\n", - "Cbc0010I After 10515000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (917.27 seconds)\n", - "Cbc0010I After 10516000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (917.32 seconds)\n", - "Cbc0010I After 10517000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (917.38 seconds)\n", - "Cbc0010I After 10518000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (917.45 seconds)\n", - "Cbc0010I After 10519000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (917.49 seconds)\n", - "Cbc0010I After 10520000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (917.55 seconds)\n", - "Cbc0010I After 10521000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (917.60 seconds)\n", - "Cbc0010I After 10522000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (917.65 seconds)\n", - "Cbc0010I After 10523000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (917.71 seconds)\n", - "Cbc0010I After 10524000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (917.76 seconds)\n", - "Cbc0010I After 10525000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (917.83 seconds)\n", - "Cbc0010I After 10526000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (917.87 seconds)\n", - "Cbc0010I After 10527000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.93 seconds)\n", - "Cbc0010I After 10528000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (917.99 seconds)\n", - "Cbc0010I After 10529000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (918.05 seconds)\n", - "Cbc0010I After 10530000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (918.11 seconds)\n", - "Cbc0010I After 10531000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (918.15 seconds)\n", - "Cbc0010I After 10532000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (918.19 seconds)\n", - "Cbc0010I After 10533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (918.24 seconds)\n", - "Cbc0010I After 10534000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (918.29 seconds)\n", - "Cbc0010I After 10535000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (918.34 seconds)\n", - "Cbc0010I After 10536000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (918.40 seconds)\n", - "Cbc0010I After 10537000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (918.43 seconds)\n", - "Cbc0010I After 10538000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.49 seconds)\n", - "Cbc0010I After 10539000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (918.54 seconds)\n", - "Cbc0010I After 10540000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (918.59 seconds)\n", - "Cbc0010I After 10541000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (918.64 seconds)\n", - "Cbc0010I After 10542000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.74 seconds)\n", - "Cbc0010I After 10543000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (918.82 seconds)\n", - "Cbc0010I After 10544000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (918.89 seconds)\n", - "Cbc0010I After 10545000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (918.95 seconds)\n", - "Cbc0010I After 10546000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (918.99 seconds)\n", - "Cbc0010I After 10547000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (919.04 seconds)\n", - "Cbc0010I After 10548000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (919.09 seconds)\n", - "Cbc0010I After 10549000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (919.12 seconds)\n", - "Cbc0010I After 10550000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (919.16 seconds)\n", - "Cbc0010I After 10551000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (919.19 seconds)\n", - "Cbc0010I After 10552000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (919.24 seconds)\n", - "Cbc0010I After 10553000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (919.29 seconds)\n", - "Cbc0010I After 10554000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (919.36 seconds)\n", - "Cbc0010I After 10555000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (919.45 seconds)\n", - "Cbc0010I After 10556000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (919.52 seconds)\n", - "Cbc0010I After 10557000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (919.60 seconds)\n", - "Cbc0010I After 10558000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (919.68 seconds)\n", - "Cbc0010I After 10559000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (919.76 seconds)\n", - "Cbc0010I After 10560000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (919.83 seconds)\n", - "Cbc0010I After 10561000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (919.91 seconds)\n", - "Cbc0010I After 10562000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (919.98 seconds)\n", - "Cbc0010I After 10563000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (920.08 seconds)\n", - "Cbc0010I After 10564000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (920.15 seconds)\n", - "Cbc0010I After 10565000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (920.18 seconds)\n", - "Cbc0010I After 10566000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (920.21 seconds)\n", - "Cbc0010I After 10567000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.24 seconds)\n", - "Cbc0010I After 10568000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (920.27 seconds)\n", - "Cbc0010I After 10569000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (920.30 seconds)\n", - "Cbc0010I After 10570000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (920.35 seconds)\n", - "Cbc0010I After 10571000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (920.41 seconds)\n", - "Cbc0010I After 10572000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (920.47 seconds)\n", - "Cbc0010I After 10573000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.54 seconds)\n", - "Cbc0010I After 10574000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.57 seconds)\n", - "Cbc0010I After 10575000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.60 seconds)\n", - "Cbc0010I After 10576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (920.65 seconds)\n", - "Cbc0010I After 10577000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.68 seconds)\n", - "Cbc0010I After 10578000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (920.74 seconds)\n", - "Cbc0010I After 10579000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (920.78 seconds)\n", - "Cbc0010I After 10580000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (920.83 seconds)\n", - "Cbc0010I After 10581000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (920.87 seconds)\n", - "Cbc0010I After 10582000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (920.90 seconds)\n", - "Cbc0010I After 10583000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (920.95 seconds)\n", - "Cbc0010I After 10584000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (921.00 seconds)\n", - "Cbc0010I After 10585000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (921.08 seconds)\n", - "Cbc0010I After 10586000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (921.13 seconds)\n", - "Cbc0010I After 10587000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (921.19 seconds)\n", - "Cbc0010I After 10588000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (921.24 seconds)\n", - "Cbc0010I After 10589000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (921.28 seconds)\n", - "Cbc0010I After 10590000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (921.32 seconds)\n", - "Cbc0010I After 10591000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (921.37 seconds)\n", - "Cbc0010I After 10592000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (921.40 seconds)\n", - "Cbc0010I After 10593000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (921.44 seconds)\n", - "Cbc0010I After 10594000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (921.50 seconds)\n", - "Cbc0010I After 10595000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (921.54 seconds)\n", - "Cbc0010I After 10596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (921.61 seconds)\n", - "Cbc0010I After 10597000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (921.69 seconds)\n", - "Cbc0010I After 10598000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (921.76 seconds)\n", - "Cbc0010I After 10599000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (921.84 seconds)\n", - "Cbc0010I After 10600000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (921.91 seconds)\n", - "Cbc0010I After 10601000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (921.99 seconds)\n", - "Cbc0010I After 10602000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (922.07 seconds)\n", - "Cbc0010I After 10603000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (922.14 seconds)\n", - "Cbc0010I After 10604000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (922.19 seconds)\n", - "Cbc0010I After 10605000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (922.25 seconds)\n", - "Cbc0010I After 10606000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (922.31 seconds)\n", - "Cbc0010I After 10607000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (922.38 seconds)\n", - "Cbc0010I After 10608000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (922.43 seconds)\n", - "Cbc0010I After 10609000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (922.49 seconds)\n", - "Cbc0010I After 10610000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (922.54 seconds)\n", - "Cbc0010I After 10611000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (922.57 seconds)\n", - "Cbc0010I After 10612000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (922.63 seconds)\n", - "Cbc0010I After 10613000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (922.69 seconds)\n", - "Cbc0010I After 10614000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (922.74 seconds)\n", - "Cbc0010I After 10615000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (922.79 seconds)\n", - "Cbc0010I After 10616000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (922.83 seconds)\n", - "Cbc0010I After 10617000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (922.86 seconds)\n", - "Cbc0010I After 10618000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (922.89 seconds)\n", - "Cbc0010I After 10619000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (922.92 seconds)\n", - "Cbc0010I After 10620000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (922.95 seconds)\n", - "Cbc0010I After 10621000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (923.00 seconds)\n", - "Cbc0010I After 10622000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (923.05 seconds)\n", - "Cbc0010I After 10623000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (923.12 seconds)\n", - "Cbc0010I After 10624000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (923.16 seconds)\n", - "Cbc0010I After 10625000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.21 seconds)\n", - "Cbc0010I After 10626000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (923.28 seconds)\n", - "Cbc0010I After 10627000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (923.40 seconds)\n", - "Cbc0010I After 10628000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (923.50 seconds)\n", - "Cbc0010I After 10629000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (923.60 seconds)\n", - "Cbc0010I After 10630000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (923.69 seconds)\n", - "Cbc0010I After 10631000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (923.76 seconds)\n", - "Cbc0010I After 10632000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (923.79 seconds)\n", - "Cbc0010I After 10633000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (923.82 seconds)\n", - "Cbc0010I After 10634000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (923.87 seconds)\n", - "Cbc0010I After 10635000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.91 seconds)\n", - "Cbc0010I After 10636000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (923.94 seconds)\n", - "Cbc0010I After 10637000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (923.98 seconds)\n", - "Cbc0010I After 10638000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (924.01 seconds)\n", - "Cbc0010I After 10639000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (924.05 seconds)\n", - "Cbc0010I After 10640000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (924.09 seconds)\n", - "Cbc0010I After 10641000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (924.14 seconds)\n", - "Cbc0010I After 10642000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (924.19 seconds)\n", - "Cbc0010I After 10643000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (924.25 seconds)\n", - "Cbc0010I After 10644000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (924.31 seconds)\n", - "Cbc0010I After 10645000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (924.35 seconds)\n", - "Cbc0010I After 10646000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (924.39 seconds)\n", - "Cbc0010I After 10647000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (924.44 seconds)\n", - "Cbc0010I After 10648000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (924.51 seconds)\n", - "Cbc0010I After 10649000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (924.59 seconds)\n", - "Cbc0010I After 10650000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (924.64 seconds)\n", - "Cbc0010I After 10651000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (924.67 seconds)\n", - "Cbc0010I After 10652000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (924.70 seconds)\n", - "Cbc0010I After 10653000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (924.75 seconds)\n", - "Cbc0010I After 10654000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (924.81 seconds)\n", - "Cbc0010I After 10655000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (924.88 seconds)\n", - "Cbc0010I After 10656000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (924.92 seconds)\n", - "Cbc0010I After 10657000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (924.95 seconds)\n", - "Cbc0010I After 10658000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (925.02 seconds)\n", - "Cbc0010I After 10659000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (925.07 seconds)\n", - "Cbc0010I After 10660000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (925.13 seconds)\n", - "Cbc0010I After 10661000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (925.18 seconds)\n", - "Cbc0010I After 10662000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.22 seconds)\n", - "Cbc0010I After 10663000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (925.27 seconds)\n", - "Cbc0010I After 10664000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (925.34 seconds)\n", - "Cbc0010I After 10665000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.38 seconds)\n", - "Cbc0010I After 10666000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (925.43 seconds)\n", - "Cbc0010I After 10667000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (925.48 seconds)\n", - "Cbc0010I After 10668000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (925.55 seconds)\n", - "Cbc0010I After 10669000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (925.63 seconds)\n", - "Cbc0010I After 10670000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (925.71 seconds)\n", - "Cbc0010I After 10671000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (925.79 seconds)\n", - "Cbc0010I After 10672000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (925.85 seconds)\n", - "Cbc0010I After 10673000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (925.92 seconds)\n", - "Cbc0010I After 10674000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (925.98 seconds)\n", - "Cbc0010I After 10675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (926.04 seconds)\n", - "Cbc0010I After 10676000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (926.10 seconds)\n", - "Cbc0010I After 10677000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (926.16 seconds)\n", - "Cbc0010I After 10678000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (926.20 seconds)\n", - "Cbc0010I After 10679000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (926.27 seconds)\n", - "Cbc0010I After 10680000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (926.30 seconds)\n", - "Cbc0010I After 10681000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (926.33 seconds)\n", - "Cbc0010I After 10682000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (926.36 seconds)\n", - "Cbc0010I After 10683000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (926.39 seconds)\n", - "Cbc0010I After 10684000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (926.43 seconds)\n", - "Cbc0010I After 10685000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (926.48 seconds)\n", - "Cbc0010I After 10686000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.52 seconds)\n", - "Cbc0010I After 10687000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (926.56 seconds)\n", - "Cbc0010I After 10688000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (926.60 seconds)\n", - "Cbc0010I After 10689000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (926.66 seconds)\n", - "Cbc0010I After 10690000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (926.71 seconds)\n", - "Cbc0010I After 10691000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (926.74 seconds)\n", - "Cbc0010I After 10692000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (926.78 seconds)\n", - "Cbc0010I After 10693000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.81 seconds)\n", - "Cbc0010I After 10694000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (926.86 seconds)\n", - "Cbc0010I After 10695000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (926.89 seconds)\n", - "Cbc0010I After 10696000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (926.94 seconds)\n", - "Cbc0010I After 10697000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (926.97 seconds)\n", - "Cbc0010I After 10698000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (927.00 seconds)\n", - "Cbc0010I After 10699000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (927.04 seconds)\n", - "Cbc0010I After 10700000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (927.07 seconds)\n", - "Cbc0010I After 10701000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (927.10 seconds)\n", - "Cbc0010I After 10702000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (927.13 seconds)\n", - "Cbc0010I After 10703000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (927.17 seconds)\n", - "Cbc0010I After 10704000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (927.20 seconds)\n", - "Cbc0010I After 10705000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (927.24 seconds)\n", - "Cbc0010I After 10706000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (927.27 seconds)\n", - "Cbc0010I After 10707000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (927.33 seconds)\n", - "Cbc0010I After 10708000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (927.38 seconds)\n", - "Cbc0010I After 10709000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (927.43 seconds)\n", - "Cbc0010I After 10710000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (927.48 seconds)\n", - "Cbc0010I After 10711000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (927.54 seconds)\n", - "Cbc0010I After 10712000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (927.59 seconds)\n", - "Cbc0010I After 10713000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (927.64 seconds)\n", - "Cbc0010I After 10714000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (927.69 seconds)\n", - "Cbc0010I After 10715000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (927.74 seconds)\n", - "Cbc0010I After 10716000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (927.80 seconds)\n", - "Cbc0010I After 10717000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (927.85 seconds)\n", - "Cbc0010I After 10718000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (927.89 seconds)\n", - "Cbc0010I After 10719000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (927.94 seconds)\n", - "Cbc0010I After 10720000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (927.98 seconds)\n", - "Cbc0010I After 10721000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (928.03 seconds)\n", - "Cbc0010I After 10722000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (928.08 seconds)\n", - "Cbc0010I After 10723000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (928.13 seconds)\n", - "Cbc0010I After 10724000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (928.18 seconds)\n", - "Cbc0010I After 10725000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (928.22 seconds)\n", - "Cbc0010I After 10726000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (928.27 seconds)\n", - "Cbc0010I After 10727000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (928.34 seconds)\n", - "Cbc0010I After 10728000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (928.41 seconds)\n", - "Cbc0010I After 10729000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (928.47 seconds)\n", - "Cbc0010I After 10730000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (928.53 seconds)\n", - "Cbc0010I After 10731000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (928.58 seconds)\n", - "Cbc0010I After 10732000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (928.63 seconds)\n", - "Cbc0010I After 10733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (928.69 seconds)\n", - "Cbc0010I After 10734000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (928.74 seconds)\n", - "Cbc0010I After 10735000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (928.79 seconds)\n", - "Cbc0010I After 10736000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (928.85 seconds)\n", - "Cbc0010I After 10737000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (928.90 seconds)\n", - "Cbc0010I After 10738000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (928.96 seconds)\n", - "Cbc0010I After 10739000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (929.02 seconds)\n", - "Cbc0010I After 10740000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (929.07 seconds)\n", - "Cbc0010I After 10741000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (929.12 seconds)\n", - "Cbc0010I After 10742000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (929.17 seconds)\n", - "Cbc0010I After 10743000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (929.23 seconds)\n", - "Cbc0010I After 10744000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (929.28 seconds)\n", - "Cbc0010I After 10745000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (929.33 seconds)\n", - "Cbc0010I After 10746000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (929.38 seconds)\n", - "Cbc0010I After 10747000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (929.43 seconds)\n", - "Cbc0010I After 10748000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (929.49 seconds)\n", - "Cbc0010I After 10749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (929.55 seconds)\n", - "Cbc0010I After 10750000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (929.60 seconds)\n", - "Cbc0010I After 10751000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (929.66 seconds)\n", - "Cbc0010I After 10752000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (929.73 seconds)\n", - "Cbc0010I After 10753000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (929.79 seconds)\n", - "Cbc0010I After 10754000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (929.86 seconds)\n", - "Cbc0010I After 10755000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (929.92 seconds)\n", - "Cbc0010I After 10756000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (929.98 seconds)\n", - "Cbc0010I After 10757000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (930.04 seconds)\n", - "Cbc0010I After 10758000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (930.08 seconds)\n", - "Cbc0010I After 10759000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (930.14 seconds)\n", - "Cbc0010I After 10760000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (930.20 seconds)\n", - "Cbc0010I After 10761000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (930.28 seconds)\n", - "Cbc0010I After 10762000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (930.35 seconds)\n", - "Cbc0010I After 10763000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (930.40 seconds)\n", - "Cbc0010I After 10764000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (930.46 seconds)\n", - "Cbc0010I After 10765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (930.52 seconds)\n", - "Cbc0010I After 10766000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (930.58 seconds)\n", - "Cbc0010I After 10767000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (930.64 seconds)\n", - "Cbc0010I After 10768000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (930.70 seconds)\n", - "Cbc0010I After 10769000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (930.76 seconds)\n", - "Cbc0010I After 10770000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (930.83 seconds)\n", - "Cbc0010I After 10771000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (930.90 seconds)\n", - "Cbc0010I After 10772000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (930.96 seconds)\n", - "Cbc0010I After 10773000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (931.02 seconds)\n", - "Cbc0010I After 10774000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (931.08 seconds)\n", - "Cbc0010I After 10775000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (931.14 seconds)\n", - "Cbc0010I After 10776000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (931.20 seconds)\n", - "Cbc0010I After 10777000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (931.25 seconds)\n", - "Cbc0010I After 10778000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (931.31 seconds)\n", - "Cbc0010I After 10779000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (931.34 seconds)\n", - "Cbc0010I After 10780000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (931.38 seconds)\n", - "Cbc0010I After 10781000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.44 seconds)\n", - "Cbc0010I After 10782000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (931.49 seconds)\n", - "Cbc0010I After 10783000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (931.55 seconds)\n", - "Cbc0010I After 10784000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (931.60 seconds)\n", - "Cbc0010I After 10785000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (931.65 seconds)\n", - "Cbc0010I After 10786000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.70 seconds)\n", - "Cbc0010I After 10787000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (931.75 seconds)\n", - "Cbc0010I After 10788000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (931.81 seconds)\n", - "Cbc0010I After 10789000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (931.87 seconds)\n", - "Cbc0010I After 10790000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (931.92 seconds)\n", - "Cbc0010I After 10791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (931.99 seconds)\n", - "Cbc0010I After 10792000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (932.06 seconds)\n", - "Cbc0010I After 10793000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (932.11 seconds)\n", - "Cbc0010I After 10794000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (932.17 seconds)\n", - "Cbc0010I After 10795000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (932.21 seconds)\n", - "Cbc0010I After 10796000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (932.27 seconds)\n", - "Cbc0010I After 10797000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (932.31 seconds)\n", - "Cbc0010I After 10798000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (932.36 seconds)\n", - "Cbc0010I After 10799000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (932.42 seconds)\n", - "Cbc0010I After 10800000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (932.48 seconds)\n", - "Cbc0010I After 10801000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (932.53 seconds)\n", - "Cbc0010I After 10802000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (932.60 seconds)\n", - "Cbc0010I After 10803000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (932.65 seconds)\n", - "Cbc0010I After 10804000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (932.70 seconds)\n", - "Cbc0010I After 10805000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (932.76 seconds)\n", - "Cbc0010I After 10806000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (932.82 seconds)\n", - "Cbc0010I After 10807000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (932.88 seconds)\n", - "Cbc0010I After 10808000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (932.93 seconds)\n", - "Cbc0010I After 10809000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (932.99 seconds)\n", - "Cbc0010I After 10810000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (933.04 seconds)\n", - "Cbc0010I After 10811000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (933.09 seconds)\n", - "Cbc0010I After 10812000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (933.16 seconds)\n", - "Cbc0010I After 10813000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (933.21 seconds)\n", - "Cbc0010I After 10814000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (933.27 seconds)\n", - "Cbc0010I After 10815000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.35 seconds)\n", - "Cbc0010I After 10816000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.42 seconds)\n", - "Cbc0010I After 10817000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (933.50 seconds)\n", - "Cbc0010I After 10818000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (933.57 seconds)\n", - "Cbc0010I After 10819000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (933.63 seconds)\n", - "Cbc0010I After 10820000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (933.70 seconds)\n", - "Cbc0010I After 10821000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (933.75 seconds)\n", - "Cbc0010I After 10822000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (933.81 seconds)\n", - "Cbc0010I After 10823000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (933.87 seconds)\n", - "Cbc0010I After 10824000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (933.92 seconds)\n", - "Cbc0010I After 10825000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (933.98 seconds)\n", - "Cbc0010I After 10826000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (934.04 seconds)\n", - "Cbc0010I After 10827000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (934.10 seconds)\n", - "Cbc0010I After 10828000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (934.18 seconds)\n", - "Cbc0010I After 10829000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (934.25 seconds)\n", - "Cbc0010I After 10830000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (934.31 seconds)\n", - "Cbc0010I After 10831000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (934.39 seconds)\n", - "Cbc0010I After 10832000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (934.45 seconds)\n", - "Cbc0010I After 10833000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (934.52 seconds)\n", - "Cbc0010I After 10834000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (934.58 seconds)\n", - "Cbc0010I After 10835000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (934.64 seconds)\n", - "Cbc0010I After 10836000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (934.69 seconds)\n", - "Cbc0010I After 10837000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (934.76 seconds)\n", - "Cbc0010I After 10838000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (934.83 seconds)\n", - "Cbc0010I After 10839000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (934.90 seconds)\n", - "Cbc0010I After 10840000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (934.95 seconds)\n", - "Cbc0010I After 10841000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (935.01 seconds)\n", - "Cbc0010I After 10842000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (935.07 seconds)\n", - "Cbc0010I After 10843000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (935.12 seconds)\n", - "Cbc0010I After 10844000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.18 seconds)\n", - "Cbc0010I After 10845000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (935.24 seconds)\n", - "Cbc0010I After 10846000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (935.29 seconds)\n", - "Cbc0010I After 10847000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (935.36 seconds)\n", - "Cbc0010I After 10848000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (935.42 seconds)\n", - "Cbc0010I After 10849000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.47 seconds)\n", - "Cbc0010I After 10850000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (935.53 seconds)\n", - "Cbc0010I After 10851000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (935.59 seconds)\n", - "Cbc0010I After 10852000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (935.65 seconds)\n", - "Cbc0010I After 10853000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (935.70 seconds)\n", - "Cbc0010I After 10854000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (935.76 seconds)\n", - "Cbc0010I After 10855000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (935.82 seconds)\n", - "Cbc0010I After 10856000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (935.88 seconds)\n", - "Cbc0010I After 10857000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (935.94 seconds)\n", - "Cbc0010I After 10858000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (935.99 seconds)\n", - "Cbc0010I After 10859000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (936.06 seconds)\n", - "Cbc0010I After 10860000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (936.12 seconds)\n", - "Cbc0010I After 10861000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (936.19 seconds)\n", - "Cbc0010I After 10862000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (936.23 seconds)\n", - "Cbc0010I After 10863000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (936.29 seconds)\n", - "Cbc0010I After 10864000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (936.35 seconds)\n", - "Cbc0010I After 10865000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (936.40 seconds)\n", - "Cbc0010I After 10866000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (936.45 seconds)\n", - "Cbc0010I After 10867000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (936.52 seconds)\n", - "Cbc0010I After 10868000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (936.57 seconds)\n", - "Cbc0010I After 10869000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (936.64 seconds)\n", - "Cbc0010I After 10870000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (936.70 seconds)\n", - "Cbc0010I After 10871000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (936.77 seconds)\n", - "Cbc0010I After 10872000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (936.82 seconds)\n", - "Cbc0010I After 10873000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (936.88 seconds)\n", - "Cbc0010I After 10874000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (936.94 seconds)\n", - "Cbc0010I After 10875000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (937.00 seconds)\n", - "Cbc0010I After 10876000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (937.06 seconds)\n", - "Cbc0010I After 10877000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (937.13 seconds)\n", - "Cbc0010I After 10878000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (937.18 seconds)\n", - "Cbc0010I After 10879000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (937.25 seconds)\n", - "Cbc0010I After 10880000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.31 seconds)\n", - "Cbc0010I After 10881000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.38 seconds)\n", - "Cbc0010I After 10882000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (937.43 seconds)\n", - "Cbc0010I After 10883000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (937.50 seconds)\n", - "Cbc0010I After 10884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (937.56 seconds)\n", - "Cbc0010I After 10885000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (937.62 seconds)\n", - "Cbc0010I After 10886000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (937.67 seconds)\n", - "Cbc0010I After 10887000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (937.73 seconds)\n", - "Cbc0010I After 10888000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (937.80 seconds)\n", - "Cbc0010I After 10889000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (937.85 seconds)\n", - "Cbc0010I After 10890000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (937.90 seconds)\n", - "Cbc0010I After 10891000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (937.96 seconds)\n", - "Cbc0010I After 10892000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (938.03 seconds)\n", - "Cbc0010I After 10893000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (938.09 seconds)\n", - "Cbc0010I After 10894000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (938.12 seconds)\n", - "Cbc0010I After 10895000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (938.16 seconds)\n", - "Cbc0010I After 10896000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (938.20 seconds)\n", - "Cbc0010I After 10897000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (938.24 seconds)\n", - "Cbc0010I After 10898000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (938.29 seconds)\n", - "Cbc0010I After 10899000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (938.33 seconds)\n", - "Cbc0010I After 10900000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (938.38 seconds)\n", - "Cbc0010I After 10901000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (938.43 seconds)\n", - "Cbc0010I After 10902000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (938.49 seconds)\n", - "Cbc0010I After 10903000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (938.52 seconds)\n", - "Cbc0010I After 10904000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (938.56 seconds)\n", - "Cbc0010I After 10905000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (938.59 seconds)\n", - "Cbc0010I After 10906000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (938.64 seconds)\n", - "Cbc0010I After 10907000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (938.67 seconds)\n", - "Cbc0010I After 10908000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (938.72 seconds)\n", - "Cbc0010I After 10909000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (938.76 seconds)\n", - "Cbc0010I After 10910000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (938.80 seconds)\n", - "Cbc0010I After 10911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (938.85 seconds)\n", - "Cbc0010I After 10912000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (938.93 seconds)\n", - "Cbc0010I After 10913000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (939.00 seconds)\n", - "Cbc0010I After 10914000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (939.08 seconds)\n", - "Cbc0010I After 10915000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (939.15 seconds)\n", - "Cbc0010I After 10916000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (939.22 seconds)\n", - "Cbc0010I After 10917000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (939.28 seconds)\n", - "Cbc0010I After 10918000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (939.31 seconds)\n", - "Cbc0010I After 10919000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (939.37 seconds)\n", - "Cbc0010I After 10920000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (939.41 seconds)\n", - "Cbc0010I After 10921000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (939.47 seconds)\n", - "Cbc0010I After 10922000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (939.55 seconds)\n", - "Cbc0010I After 10923000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (939.64 seconds)\n", - "Cbc0010I After 10924000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (939.69 seconds)\n", - "Cbc0010I After 10925000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (939.74 seconds)\n", - "Cbc0010I After 10926000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (939.80 seconds)\n", - "Cbc0010I After 10927000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (939.86 seconds)\n", - "Cbc0010I After 10928000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (939.92 seconds)\n", - "Cbc0010I After 10929000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (939.97 seconds)\n", - "Cbc0010I After 10930000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (940.04 seconds)\n", - "Cbc0010I After 10931000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (940.10 seconds)\n", - "Cbc0010I After 10932000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (940.16 seconds)\n", - "Cbc0010I After 10933000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (940.23 seconds)\n", - "Cbc0010I After 10934000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (940.28 seconds)\n", - "Cbc0010I After 10935000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.34 seconds)\n", - "Cbc0010I After 10936000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (940.40 seconds)\n", - "Cbc0010I After 10937000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (940.43 seconds)\n", - "Cbc0010I After 10938000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (940.46 seconds)\n", - "Cbc0010I After 10939000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (940.50 seconds)\n", - "Cbc0010I After 10940000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.53 seconds)\n", - "Cbc0010I After 10941000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (940.57 seconds)\n", - "Cbc0010I After 10942000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (940.60 seconds)\n", - "Cbc0010I After 10943000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (940.65 seconds)\n", - "Cbc0010I After 10944000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (940.68 seconds)\n", - "Cbc0010I After 10945000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (940.73 seconds)\n", - "Cbc0010I After 10946000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (940.76 seconds)\n", - "Cbc0010I After 10947000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (940.83 seconds)\n", - "Cbc0010I After 10948000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (940.88 seconds)\n", - "Cbc0010I After 10949000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (940.91 seconds)\n", - "Cbc0010I After 10950000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (940.96 seconds)\n", - "Cbc0010I After 10951000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (941.00 seconds)\n", - "Cbc0010I After 10952000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (941.04 seconds)\n", - "Cbc0010I After 10953000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (941.08 seconds)\n", - "Cbc0010I After 10954000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (941.12 seconds)\n", - "Cbc0010I After 10955000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (941.16 seconds)\n", - "Cbc0010I After 10956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (941.21 seconds)\n", - "Cbc0010I After 10957000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (941.26 seconds)\n", - "Cbc0010I After 10958000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (941.30 seconds)\n", - "Cbc0010I After 10959000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (941.34 seconds)\n", - "Cbc0010I After 10960000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (941.38 seconds)\n", - "Cbc0010I After 10961000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (941.41 seconds)\n", - "Cbc0010I After 10962000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (941.47 seconds)\n", - "Cbc0010I After 10963000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (941.51 seconds)\n", - "Cbc0010I After 10964000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (941.54 seconds)\n", - "Cbc0010I After 10965000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (941.59 seconds)\n", - "Cbc0010I After 10966000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (941.63 seconds)\n", - "Cbc0010I After 10967000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (941.67 seconds)\n", - "Cbc0010I After 10968000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (941.72 seconds)\n", - "Cbc0010I After 10969000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (941.77 seconds)\n", - "Cbc0010I After 10970000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (941.81 seconds)\n", - "Cbc0010I After 10971000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (941.85 seconds)\n", - "Cbc0010I After 10972000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (941.88 seconds)\n", - "Cbc0010I After 10973000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (941.94 seconds)\n", - "Cbc0010I After 10974000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (941.97 seconds)\n", - "Cbc0010I After 10975000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (942.03 seconds)\n", - "Cbc0010I After 10976000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (942.09 seconds)\n", - "Cbc0010I After 10977000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (942.13 seconds)\n", - "Cbc0010I After 10978000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (942.19 seconds)\n", - "Cbc0010I After 10979000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.23 seconds)\n", - "Cbc0010I After 10980000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (942.27 seconds)\n", - "Cbc0010I After 10981000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (942.30 seconds)\n", - "Cbc0010I After 10982000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.33 seconds)\n", - "Cbc0010I After 10983000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (942.37 seconds)\n", - "Cbc0010I After 10984000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (942.41 seconds)\n", - "Cbc0010I After 10985000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (942.46 seconds)\n", - "Cbc0010I After 10986000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (942.51 seconds)\n", - "Cbc0010I After 10987000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (942.54 seconds)\n", - "Cbc0010I After 10988000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (942.57 seconds)\n", - "Cbc0010I After 10989000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (942.61 seconds)\n", - "Cbc0010I After 10990000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (942.66 seconds)\n", - "Cbc0010I After 10991000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (942.73 seconds)\n", - "Cbc0010I After 10992000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (942.80 seconds)\n", - "Cbc0010I After 10993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (942.87 seconds)\n", - "Cbc0010I After 10994000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (942.92 seconds)\n", - "Cbc0010I After 10995000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (942.95 seconds)\n", - "Cbc0010I After 10996000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (943.00 seconds)\n", - "Cbc0010I After 10997000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (943.04 seconds)\n", - "Cbc0010I After 10998000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (943.07 seconds)\n", - "Cbc0010I After 10999000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (943.12 seconds)\n", - "Cbc0010I After 11000000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (943.15 seconds)\n", - "Cbc0010I After 11001000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (943.19 seconds)\n", - "Cbc0010I After 11002000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (943.25 seconds)\n", - "Cbc0010I After 11003000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (943.29 seconds)\n", - "Cbc0010I After 11004000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.33 seconds)\n", - "Cbc0010I After 11005000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (943.39 seconds)\n", - "Cbc0010I After 11006000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (943.43 seconds)\n", - "Cbc0010I After 11007000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (943.47 seconds)\n", - "Cbc0010I After 11008000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (943.51 seconds)\n", - "Cbc0010I After 11009000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (943.55 seconds)\n", - "Cbc0010I After 11010000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (943.58 seconds)\n", - "Cbc0010I After 11011000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.63 seconds)\n", - "Cbc0010I After 11012000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (943.68 seconds)\n", - "Cbc0010I After 11013000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (943.72 seconds)\n", - "Cbc0010I After 11014000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (943.76 seconds)\n", - "Cbc0010I After 11015000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (943.80 seconds)\n", - "Cbc0010I After 11016000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (943.84 seconds)\n", - "Cbc0010I After 11017000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (943.88 seconds)\n", - "Cbc0010I After 11018000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (943.92 seconds)\n", - "Cbc0010I After 11019000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (943.96 seconds)\n", - "Cbc0010I After 11020000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (943.99 seconds)\n", - "Cbc0010I After 11021000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (944.03 seconds)\n", - "Cbc0010I After 11022000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (944.08 seconds)\n", - "Cbc0010I After 11023000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (944.13 seconds)\n", - "Cbc0010I After 11024000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (944.17 seconds)\n", - "Cbc0010I After 11025000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (944.22 seconds)\n", - "Cbc0010I After 11026000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (944.27 seconds)\n", - "Cbc0010I After 11027000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (944.35 seconds)\n", - "Cbc0010I After 11028000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (944.41 seconds)\n", - "Cbc0010I After 11029000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (944.48 seconds)\n", - "Cbc0010I After 11030000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (944.54 seconds)\n", - "Cbc0010I After 11031000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (944.59 seconds)\n", - "Cbc0010I After 11032000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (944.65 seconds)\n", - "Cbc0010I After 11033000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (944.70 seconds)\n", - "Cbc0010I After 11034000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (944.76 seconds)\n", - "Cbc0010I After 11035000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (944.80 seconds)\n", - "Cbc0010I After 11036000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (944.85 seconds)\n", - "Cbc0010I After 11037000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (944.89 seconds)\n", - "Cbc0010I After 11038000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (944.95 seconds)\n", - "Cbc0010I After 11039000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (945.00 seconds)\n", - "Cbc0010I After 11040000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (945.06 seconds)\n", - "Cbc0010I After 11041000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (945.10 seconds)\n", - "Cbc0010I After 11042000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (945.16 seconds)\n", - "Cbc0010I After 11043000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (945.21 seconds)\n", - "Cbc0010I After 11044000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (945.26 seconds)\n", - "Cbc0010I After 11045000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (945.31 seconds)\n", - "Cbc0010I After 11046000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (945.36 seconds)\n", - "Cbc0010I After 11047000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (945.42 seconds)\n", - "Cbc0010I After 11048000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (945.49 seconds)\n", - "Cbc0010I After 11049000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (945.55 seconds)\n", - "Cbc0010I After 11050000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (945.61 seconds)\n", - "Cbc0010I After 11051000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (945.67 seconds)\n", - "Cbc0010I After 11052000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (945.73 seconds)\n", - "Cbc0010I After 11053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (945.79 seconds)\n", - "Cbc0010I After 11054000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (945.84 seconds)\n", - "Cbc0010I After 11055000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (945.90 seconds)\n", - "Cbc0010I After 11056000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (945.94 seconds)\n", - "Cbc0010I After 11057000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (946.00 seconds)\n", - "Cbc0010I After 11058000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (946.05 seconds)\n", - "Cbc0010I After 11059000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (946.11 seconds)\n", - "Cbc0010I After 11060000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.17 seconds)\n", - "Cbc0010I After 11061000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.23 seconds)\n", - "Cbc0010I After 11062000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (946.28 seconds)\n", - "Cbc0010I After 11063000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (946.34 seconds)\n", - "Cbc0010I After 11064000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.40 seconds)\n", - "Cbc0010I After 11065000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.46 seconds)\n", - "Cbc0010I After 11066000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (946.53 seconds)\n", - "Cbc0010I After 11067000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (946.59 seconds)\n", - "Cbc0010I After 11068000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (946.65 seconds)\n", - "Cbc0010I After 11069000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (946.71 seconds)\n", - "Cbc0010I After 11070000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (946.77 seconds)\n", - "Cbc0010I After 11071000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (946.81 seconds)\n", - "Cbc0010I After 11072000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (946.87 seconds)\n", - "Cbc0010I After 11073000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (946.91 seconds)\n", - "Cbc0010I After 11074000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (946.96 seconds)\n", - "Cbc0010I After 11075000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (947.01 seconds)\n", - "Cbc0010I After 11076000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (947.06 seconds)\n", - "Cbc0010I After 11077000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (947.12 seconds)\n", - "Cbc0010I After 11078000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (947.17 seconds)\n", - "Cbc0010I After 11079000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (947.22 seconds)\n", - "Cbc0010I After 11080000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.28 seconds)\n", - "Cbc0010I After 11081000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (947.33 seconds)\n", - "Cbc0010I After 11082000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.38 seconds)\n", - "Cbc0010I After 11083000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (947.43 seconds)\n", - "Cbc0010I After 11084000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (947.48 seconds)\n", - "Cbc0010I After 11085000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (947.54 seconds)\n", - "Cbc0010I After 11086000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (947.60 seconds)\n", - "Cbc0010I After 11087000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (947.66 seconds)\n", - "Cbc0010I After 11088000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (947.72 seconds)\n", - "Cbc0010I After 11089000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (947.78 seconds)\n", - "Cbc0010I After 11090000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (947.86 seconds)\n", - "Cbc0010I After 11091000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (947.93 seconds)\n", - "Cbc0010I After 11092000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (947.99 seconds)\n", - "Cbc0010I After 11093000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (948.04 seconds)\n", - "Cbc0010I After 11094000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (948.09 seconds)\n", - "Cbc0010I After 11095000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (948.16 seconds)\n", - "Cbc0010I After 11096000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (948.22 seconds)\n", - "Cbc0010I After 11097000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (948.27 seconds)\n", - "Cbc0010I After 11098000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (948.33 seconds)\n", - "Cbc0010I After 11099000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (948.39 seconds)\n", - "Cbc0010I After 11100000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.45 seconds)\n", - "Cbc0010I After 11101000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.51 seconds)\n", - "Cbc0010I After 11102000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (948.58 seconds)\n", - "Cbc0010I After 11103000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.64 seconds)\n", - "Cbc0010I After 11104000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (948.70 seconds)\n", - "Cbc0010I After 11105000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (948.75 seconds)\n", - "Cbc0010I After 11106000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (948.81 seconds)\n", - "Cbc0010I After 11107000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (948.86 seconds)\n", - "Cbc0010I After 11108000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (948.90 seconds)\n", - "Cbc0010I After 11109000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (948.94 seconds)\n", - "Cbc0010I After 11110000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (948.98 seconds)\n", - "Cbc0010I After 11111000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.03 seconds)\n", - "Cbc0010I After 11112000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (949.09 seconds)\n", - "Cbc0010I After 11113000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (949.15 seconds)\n", - "Cbc0010I After 11114000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (949.20 seconds)\n", - "Cbc0010I After 11115000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (949.26 seconds)\n", - "Cbc0010I After 11116000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (949.32 seconds)\n", - "Cbc0010I After 11117000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.38 seconds)\n", - "Cbc0010I After 11118000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (949.43 seconds)\n", - "Cbc0010I After 11119000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.49 seconds)\n", - "Cbc0010I After 11120000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (949.55 seconds)\n", - "Cbc0010I After 11121000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (949.61 seconds)\n", - "Cbc0010I After 11122000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (949.67 seconds)\n", - "Cbc0010I After 11123000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (949.73 seconds)\n", - "Cbc0010I After 11124000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (949.78 seconds)\n", - "Cbc0010I After 11125000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (949.83 seconds)\n", - "Cbc0010I After 11126000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (949.89 seconds)\n", - "Cbc0010I After 11127000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (949.94 seconds)\n", - "Cbc0010I After 11128000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (950.00 seconds)\n", - "Cbc0010I After 11129000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (950.07 seconds)\n", - "Cbc0010I After 11130000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (950.13 seconds)\n", - "Cbc0010I After 11131000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (950.21 seconds)\n", - "Cbc0010I After 11132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (950.30 seconds)\n", - "Cbc0010I After 11133000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (950.38 seconds)\n", - "Cbc0010I After 11134000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (950.43 seconds)\n", - "Cbc0010I After 11135000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (950.49 seconds)\n", - "Cbc0010I After 11136000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (950.55 seconds)\n", - "Cbc0010I After 11137000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (950.61 seconds)\n", - "Cbc0010I After 11138000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (950.67 seconds)\n", - "Cbc0010I After 11139000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (950.73 seconds)\n", - "Cbc0010I After 11140000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (950.79 seconds)\n", - "Cbc0010I After 11141000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (950.86 seconds)\n", - "Cbc0010I After 11142000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (950.93 seconds)\n", - "Cbc0010I After 11143000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (950.99 seconds)\n", - "Cbc0010I After 11144000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (951.05 seconds)\n", - "Cbc0010I After 11145000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (951.11 seconds)\n", - "Cbc0010I After 11146000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (951.15 seconds)\n", - "Cbc0010I After 11147000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (951.20 seconds)\n", - "Cbc0010I After 11148000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.25 seconds)\n", - "Cbc0010I After 11149000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (951.29 seconds)\n", - "Cbc0010I After 11150000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.35 seconds)\n", - "Cbc0010I After 11151000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (951.42 seconds)\n", - "Cbc0010I After 11152000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (951.48 seconds)\n", - "Cbc0010I After 11153000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (951.56 seconds)\n", - "Cbc0010I After 11154000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (951.63 seconds)\n", - "Cbc0010I After 11155000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (951.70 seconds)\n", - "Cbc0010I After 11156000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (951.76 seconds)\n", - "Cbc0010I After 11157000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (951.82 seconds)\n", - "Cbc0010I After 11158000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (951.89 seconds)\n", - "Cbc0010I After 11159000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (951.95 seconds)\n", - "Cbc0010I After 11160000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (952.00 seconds)\n", - "Cbc0010I After 11161000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (952.06 seconds)\n", - "Cbc0010I After 11162000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (952.11 seconds)\n", - "Cbc0010I After 11163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (952.16 seconds)\n", - "Cbc0010I After 11164000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (952.22 seconds)\n", - "Cbc0010I After 11165000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (952.26 seconds)\n", - "Cbc0010I After 11166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (952.29 seconds)\n", - "Cbc0010I After 11167000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (952.33 seconds)\n", - "Cbc0010I After 11168000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (952.36 seconds)\n", - "Cbc0010I After 11169000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (952.40 seconds)\n", - "Cbc0010I After 11170000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (952.45 seconds)\n", - "Cbc0010I After 11171000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (952.50 seconds)\n", - "Cbc0010I After 11172000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (952.55 seconds)\n", - "Cbc0010I After 11173000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (952.60 seconds)\n", - "Cbc0010I After 11174000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (952.66 seconds)\n", - "Cbc0010I After 11175000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (952.71 seconds)\n", - "Cbc0010I After 11176000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (952.77 seconds)\n", - "Cbc0010I After 11177000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (952.83 seconds)\n", - "Cbc0010I After 11178000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (952.88 seconds)\n", - "Cbc0010I After 11179000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (952.93 seconds)\n", - "Cbc0010I After 11180000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (952.99 seconds)\n", - "Cbc0010I After 11181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (953.05 seconds)\n", - "Cbc0010I After 11182000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (953.11 seconds)\n", - "Cbc0010I After 11183000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (953.16 seconds)\n", - "Cbc0010I After 11184000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (953.22 seconds)\n", - "Cbc0010I After 11185000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (953.28 seconds)\n", - "Cbc0010I After 11186000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (953.33 seconds)\n", - "Cbc0010I After 11187000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (953.39 seconds)\n", - "Cbc0010I After 11188000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (953.44 seconds)\n", - "Cbc0010I After 11189000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (953.50 seconds)\n", - "Cbc0010I After 11190000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (953.55 seconds)\n", - "Cbc0010I After 11191000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (953.61 seconds)\n", - "Cbc0010I After 11192000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (953.65 seconds)\n", - "Cbc0010I After 11193000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (953.71 seconds)\n", - "Cbc0010I After 11194000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (953.77 seconds)\n", - "Cbc0010I After 11195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (953.85 seconds)\n", - "Cbc0010I After 11196000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (953.93 seconds)\n", - "Cbc0010I After 11197000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.00 seconds)\n", - "Cbc0010I After 11198000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (954.07 seconds)\n", - "Cbc0010I After 11199000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (954.12 seconds)\n", - "Cbc0010I After 11200000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (954.18 seconds)\n", - "Cbc0010I After 11201000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.23 seconds)\n", - "Cbc0010I After 11202000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (954.29 seconds)\n", - "Cbc0010I After 11203000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (954.32 seconds)\n", - "Cbc0010I After 11204000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (954.37 seconds)\n", - "Cbc0010I After 11205000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.41 seconds)\n", - "Cbc0010I After 11206000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (954.46 seconds)\n", - "Cbc0010I After 11207000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (954.49 seconds)\n", - "Cbc0010I After 11208000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (954.53 seconds)\n", - "Cbc0010I After 11209000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.56 seconds)\n", - "Cbc0010I After 11210000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (954.60 seconds)\n", - "Cbc0010I After 11211000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.63 seconds)\n", - "Cbc0010I After 11212000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (954.66 seconds)\n", - "Cbc0010I After 11213000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.69 seconds)\n", - "Cbc0010I After 11214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (954.74 seconds)\n", - "Cbc0010I After 11215000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (954.78 seconds)\n", - "Cbc0010I After 11216000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (954.81 seconds)\n", - "Cbc0010I After 11217000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (954.84 seconds)\n", - "Cbc0010I After 11218000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (954.87 seconds)\n", - "Cbc0010I After 11219000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (954.93 seconds)\n", - "Cbc0010I After 11220000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (954.96 seconds)\n", - "Cbc0010I After 11221000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (955.02 seconds)\n", - "Cbc0010I After 11222000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (955.07 seconds)\n", - "Cbc0010I After 11223000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (955.12 seconds)\n", - "Cbc0010I After 11224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.17 seconds)\n", - "Cbc0010I After 11225000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.25 seconds)\n", - "Cbc0010I After 11226000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (955.32 seconds)\n", - "Cbc0010I After 11227000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (955.39 seconds)\n", - "Cbc0010I After 11228000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (955.43 seconds)\n", - "Cbc0010I After 11229000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (955.47 seconds)\n", - "Cbc0010I After 11230000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (955.51 seconds)\n", - "Cbc0010I After 11231000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (955.55 seconds)\n", - "Cbc0010I After 11232000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.60 seconds)\n", - "Cbc0010I After 11233000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (955.64 seconds)\n", - "Cbc0010I After 11234000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (955.70 seconds)\n", - "Cbc0010I After 11235000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (955.77 seconds)\n", - "Cbc0010I After 11236000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (955.83 seconds)\n", - "Cbc0010I After 11237000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (955.88 seconds)\n", - "Cbc0010I After 11238000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (955.92 seconds)\n", - "Cbc0010I After 11239000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (955.96 seconds)\n", - "Cbc0010I After 11240000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (956.00 seconds)\n", - "Cbc0010I After 11241000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (956.03 seconds)\n", - "Cbc0010I After 11242000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (956.06 seconds)\n", - "Cbc0010I After 11243000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (956.11 seconds)\n", - "Cbc0010I After 11244000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (956.17 seconds)\n", - "Cbc0010I After 11245000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (956.22 seconds)\n", - "Cbc0010I After 11246000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.26 seconds)\n", - "Cbc0010I After 11247000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (956.31 seconds)\n", - "Cbc0010I After 11248000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (956.35 seconds)\n", - "Cbc0010I After 11249000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (956.40 seconds)\n", - "Cbc0010I After 11250000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (956.46 seconds)\n", - "Cbc0010I After 11251000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (956.52 seconds)\n", - "Cbc0010I After 11252000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (956.56 seconds)\n", - "Cbc0010I After 11253000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (956.59 seconds)\n", - "Cbc0010I After 11254000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (956.63 seconds)\n", - "Cbc0010I After 11255000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (956.67 seconds)\n", - "Cbc0010I After 11256000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (956.70 seconds)\n", - "Cbc0010I After 11257000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (956.74 seconds)\n", - "Cbc0010I After 11258000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (956.79 seconds)\n", - "Cbc0010I After 11259000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (956.83 seconds)\n", - "Cbc0010I After 11260000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.86 seconds)\n", - "Cbc0010I After 11261000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (956.91 seconds)\n", - "Cbc0010I After 11262000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (956.95 seconds)\n", - "Cbc0010I After 11263000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (956.99 seconds)\n", - "Cbc0010I After 11264000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (957.04 seconds)\n", - "Cbc0010I After 11265000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (957.08 seconds)\n", - "Cbc0010I After 11266000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (957.12 seconds)\n", - "Cbc0010I After 11267000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (957.15 seconds)\n", - "Cbc0010I After 11268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (957.18 seconds)\n", - "Cbc0010I After 11269000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.23 seconds)\n", - "Cbc0010I After 11270000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (957.27 seconds)\n", - "Cbc0010I After 11271000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (957.31 seconds)\n", - "Cbc0010I After 11272000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (957.36 seconds)\n", - "Cbc0010I After 11273000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (957.40 seconds)\n", - "Cbc0010I After 11274000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (957.46 seconds)\n", - "Cbc0010I After 11275000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (957.50 seconds)\n", - "Cbc0010I After 11276000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (957.56 seconds)\n", - "Cbc0010I After 11277000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (957.62 seconds)\n", - "Cbc0010I After 11278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (957.67 seconds)\n", - "Cbc0010I After 11279000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (957.73 seconds)\n", - "Cbc0010I After 11280000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.77 seconds)\n", - "Cbc0010I After 11281000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (957.83 seconds)\n", - "Cbc0010I After 11282000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (957.90 seconds)\n", - "Cbc0010I After 11283000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (957.96 seconds)\n", - "Cbc0010I After 11284000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (958.02 seconds)\n", - "Cbc0010I After 11285000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (958.07 seconds)\n", - "Cbc0010I After 11286000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.13 seconds)\n", - "Cbc0010I After 11287000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (958.18 seconds)\n", - "Cbc0010I After 11288000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (958.24 seconds)\n", - "Cbc0010I After 11289000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (958.30 seconds)\n", - "Cbc0010I After 11290000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (958.36 seconds)\n", - "Cbc0010I After 11291000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (958.41 seconds)\n", - "Cbc0010I After 11292000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (958.47 seconds)\n", - "Cbc0010I After 11293000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (958.52 seconds)\n", - "Cbc0010I After 11294000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.58 seconds)\n", - "Cbc0010I After 11295000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (958.63 seconds)\n", - "Cbc0010I After 11296000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (958.68 seconds)\n", - "Cbc0010I After 11297000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (958.73 seconds)\n", - "Cbc0010I After 11298000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (958.78 seconds)\n", - "Cbc0010I After 11299000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (958.84 seconds)\n", - "Cbc0010I After 11300000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (958.89 seconds)\n", - "Cbc0010I After 11301000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (958.95 seconds)\n", - "Cbc0010I After 11302000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (959.01 seconds)\n", - "Cbc0010I After 11303000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (959.07 seconds)\n", - "Cbc0010I After 11304000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (959.13 seconds)\n", - "Cbc0010I After 11305000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (959.19 seconds)\n", - "Cbc0010I After 11306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (959.26 seconds)\n", - "Cbc0010I After 11307000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (959.33 seconds)\n", - "Cbc0010I After 11308000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (959.38 seconds)\n", - "Cbc0010I After 11309000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (959.45 seconds)\n", - "Cbc0010I After 11310000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (959.51 seconds)\n", - "Cbc0010I After 11311000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (959.57 seconds)\n", - "Cbc0010I After 11312000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (959.62 seconds)\n", - "Cbc0010I After 11313000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (959.68 seconds)\n", - "Cbc0010I After 11314000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (959.73 seconds)\n", - "Cbc0010I After 11315000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (959.77 seconds)\n", - "Cbc0010I After 11316000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (959.86 seconds)\n", - "Cbc0010I After 11317000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (959.91 seconds)\n", - "Cbc0010I After 11318000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (959.97 seconds)\n", - "Cbc0010I After 11319000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (960.03 seconds)\n", - "Cbc0010I After 11320000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (960.08 seconds)\n", - "Cbc0010I After 11321000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.14 seconds)\n", - "Cbc0010I After 11322000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (960.20 seconds)\n", - "Cbc0010I After 11323000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (960.25 seconds)\n", - "Cbc0010I After 11324000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (960.30 seconds)\n", - "Cbc0010I After 11325000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (960.36 seconds)\n", - "Cbc0010I After 11326000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (960.42 seconds)\n", - "Cbc0010I After 11327000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.47 seconds)\n", - "Cbc0010I After 11328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (960.52 seconds)\n", - "Cbc0010I After 11329000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (960.58 seconds)\n", - "Cbc0010I After 11330000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (960.64 seconds)\n", - "Cbc0010I After 11331000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (960.69 seconds)\n", - "Cbc0010I After 11332000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (960.75 seconds)\n", - "Cbc0010I After 11333000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (960.81 seconds)\n", - "Cbc0010I After 11334000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (960.87 seconds)\n", - "Cbc0010I After 11335000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (960.93 seconds)\n", - "Cbc0010I After 11336000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (960.98 seconds)\n", - "Cbc0010I After 11337000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (961.04 seconds)\n", - "Cbc0010I After 11338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (961.10 seconds)\n", - "Cbc0010I After 11339000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (961.15 seconds)\n", - "Cbc0010I After 11340000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (961.21 seconds)\n", - "Cbc0010I After 11341000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (961.27 seconds)\n", - "Cbc0010I After 11342000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (961.32 seconds)\n", - "Cbc0010I After 11343000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (961.37 seconds)\n", - "Cbc0010I After 11344000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (961.45 seconds)\n", - "Cbc0010I After 11345000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (961.51 seconds)\n", - "Cbc0010I After 11346000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (961.57 seconds)\n", - "Cbc0010I After 11347000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (961.64 seconds)\n", - "Cbc0010I After 11348000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (961.70 seconds)\n", - "Cbc0010I After 11349000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (961.75 seconds)\n", - "Cbc0010I After 11350000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (961.82 seconds)\n", - "Cbc0010I After 11351000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (961.87 seconds)\n", - "Cbc0010I After 11352000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (961.93 seconds)\n", - "Cbc0010I After 11353000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (961.99 seconds)\n", - "Cbc0010I After 11354000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (962.05 seconds)\n", - "Cbc0010I After 11355000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (962.11 seconds)\n", - "Cbc0010I After 11356000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (962.16 seconds)\n", - "Cbc0010I After 11357000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (962.21 seconds)\n", - "Cbc0010I After 11358000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (962.27 seconds)\n", - "Cbc0010I After 11359000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (962.35 seconds)\n", - "Cbc0010I After 11360000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (962.43 seconds)\n", - "Cbc0010I After 11361000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (962.51 seconds)\n", - "Cbc0010I After 11362000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (962.58 seconds)\n", - "Cbc0010I After 11363000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (962.63 seconds)\n", - "Cbc0010I After 11364000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (962.68 seconds)\n", - "Cbc0010I After 11365000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (962.74 seconds)\n", - "Cbc0010I After 11366000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (962.79 seconds)\n", - "Cbc0010I After 11367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (962.84 seconds)\n", - "Cbc0010I After 11368000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (962.90 seconds)\n", - "Cbc0010I After 11369000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (962.95 seconds)\n", - "Cbc0010I After 11370000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (963.01 seconds)\n", - "Cbc0010I After 11371000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (963.07 seconds)\n", - "Cbc0010I After 11372000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (963.15 seconds)\n", - "Cbc0010I After 11373000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (963.22 seconds)\n", - "Cbc0010I After 11374000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.29 seconds)\n", - "Cbc0010I After 11375000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.35 seconds)\n", - "Cbc0010I After 11376000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (963.41 seconds)\n", - "Cbc0010I After 11377000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (963.48 seconds)\n", - "Cbc0010I After 11378000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.53 seconds)\n", - "Cbc0010I After 11379000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (963.60 seconds)\n", - "Cbc0010I After 11380000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (963.66 seconds)\n", - "Cbc0010I After 11381000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (963.73 seconds)\n", - "Cbc0010I After 11382000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (963.80 seconds)\n", - "Cbc0010I After 11383000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (963.87 seconds)\n", - "Cbc0010I After 11384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (963.93 seconds)\n", - "Cbc0010I After 11385000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.00 seconds)\n", - "Cbc0010I After 11386000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (964.07 seconds)\n", - "Cbc0010I After 11387000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (964.13 seconds)\n", - "Cbc0010I After 11388000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.19 seconds)\n", - "Cbc0010I After 11389000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (964.25 seconds)\n", - "Cbc0010I After 11390000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (964.30 seconds)\n", - "Cbc0010I After 11391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (964.36 seconds)\n", - "Cbc0010I After 11392000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (964.43 seconds)\n", - "Cbc0010I After 11393000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (964.49 seconds)\n", - "Cbc0010I After 11394000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (964.56 seconds)\n", - "Cbc0010I After 11395000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (964.63 seconds)\n", - "Cbc0010I After 11396000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (964.69 seconds)\n", - "Cbc0010I After 11397000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (964.74 seconds)\n", - "Cbc0010I After 11398000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (964.80 seconds)\n", - "Cbc0010I After 11399000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (964.86 seconds)\n", - "Cbc0010I After 11400000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (964.91 seconds)\n", - "Cbc0010I After 11401000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (964.98 seconds)\n", - "Cbc0010I After 11402000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.04 seconds)\n", - "Cbc0010I After 11403000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.12 seconds)\n", - "Cbc0010I After 11404000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (965.19 seconds)\n", - "Cbc0010I After 11405000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (965.25 seconds)\n", - "Cbc0010I After 11406000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (965.31 seconds)\n", - "Cbc0010I After 11407000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.36 seconds)\n", - "Cbc0010I After 11408000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.41 seconds)\n", - "Cbc0010I After 11409000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (965.46 seconds)\n", - "Cbc0010I After 11410000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (965.52 seconds)\n", - "Cbc0010I After 11411000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (965.57 seconds)\n", - "Cbc0010I After 11412000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (965.63 seconds)\n", - "Cbc0010I After 11413000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (965.69 seconds)\n", - "Cbc0010I After 11414000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (965.75 seconds)\n", - "Cbc0010I After 11415000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (965.80 seconds)\n", - "Cbc0010I After 11416000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (965.84 seconds)\n", - "Cbc0010I After 11417000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (965.89 seconds)\n", - "Cbc0010I After 11418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (965.94 seconds)\n", - "Cbc0010I After 11419000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (966.00 seconds)\n", - "Cbc0010I After 11420000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (966.07 seconds)\n", - "Cbc0010I After 11421000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (966.13 seconds)\n", - "Cbc0010I After 11422000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (966.16 seconds)\n", - "Cbc0010I After 11423000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (966.19 seconds)\n", - "Cbc0010I After 11424000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (966.25 seconds)\n", - "Cbc0010I After 11425000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (966.33 seconds)\n", - "Cbc0010I After 11426000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (966.40 seconds)\n", - "Cbc0010I After 11427000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (966.48 seconds)\n", - "Cbc0010I After 11428000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (966.54 seconds)\n", - "Cbc0010I After 11429000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (966.57 seconds)\n", - "Cbc0010I After 11430000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (966.60 seconds)\n", - "Cbc0010I After 11431000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (966.64 seconds)\n", - "Cbc0010I After 11432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (966.67 seconds)\n", - "Cbc0010I After 11433000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (966.74 seconds)\n", - "Cbc0010I After 11434000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (966.79 seconds)\n", - "Cbc0010I After 11435000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (966.84 seconds)\n", - "Cbc0010I After 11436000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (966.89 seconds)\n", - "Cbc0010I After 11437000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (966.93 seconds)\n", - "Cbc0010I After 11438000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (966.98 seconds)\n", - "Cbc0010I After 11439000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (967.07 seconds)\n", - "Cbc0010I After 11440000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (967.16 seconds)\n", - "Cbc0010I After 11441000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (967.20 seconds)\n", - "Cbc0010I After 11442000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (967.25 seconds)\n", - "Cbc0010I After 11443000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (967.31 seconds)\n", - "Cbc0010I After 11444000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (967.37 seconds)\n", - "Cbc0010I After 11445000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (967.45 seconds)\n", - "Cbc0010I After 11446000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (967.51 seconds)\n", - "Cbc0010I After 11447000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (967.57 seconds)\n", - "Cbc0010I After 11448000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (967.63 seconds)\n", - "Cbc0010I After 11449000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (967.68 seconds)\n", - "Cbc0010I After 11450000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (967.73 seconds)\n", - "Cbc0010I After 11451000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (967.76 seconds)\n", - "Cbc0010I After 11452000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (967.81 seconds)\n", - "Cbc0010I After 11453000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (967.85 seconds)\n", - "Cbc0010I After 11454000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (967.89 seconds)\n", - "Cbc0010I After 11455000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (967.96 seconds)\n", - "Cbc0010I After 11456000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.01 seconds)\n", - "Cbc0010I After 11457000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.05 seconds)\n", - "Cbc0010I After 11458000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (968.09 seconds)\n", - "Cbc0010I After 11459000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (968.12 seconds)\n", - "Cbc0010I After 11460000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.16 seconds)\n", - "Cbc0010I After 11461000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.20 seconds)\n", - "Cbc0010I After 11462000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.24 seconds)\n", - "Cbc0010I After 11463000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (968.28 seconds)\n", - "Cbc0010I After 11464000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.32 seconds)\n", - "Cbc0010I After 11465000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.35 seconds)\n", - "Cbc0010I After 11466000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.40 seconds)\n", - "Cbc0010I After 11467000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.44 seconds)\n", - "Cbc0010I After 11468000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (968.48 seconds)\n", - "Cbc0010I After 11469000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (968.52 seconds)\n", - "Cbc0010I After 11470000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.56 seconds)\n", - "Cbc0010I After 11471000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.61 seconds)\n", - "Cbc0010I After 11472000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.67 seconds)\n", - "Cbc0010I After 11473000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (968.72 seconds)\n", - "Cbc0010I After 11474000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (968.77 seconds)\n", - "Cbc0010I After 11475000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (968.83 seconds)\n", - "Cbc0010I After 11476000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (968.88 seconds)\n", - "Cbc0010I After 11477000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (968.93 seconds)\n", - "Cbc0010I After 11478000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (968.99 seconds)\n", - "Cbc0010I After 11479000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (969.04 seconds)\n", - "Cbc0010I After 11480000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (969.10 seconds)\n", - "Cbc0010I After 11481000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (969.15 seconds)\n", - "Cbc0010I After 11482000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (969.19 seconds)\n", - "Cbc0010I After 11483000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (969.23 seconds)\n", - "Cbc0010I After 11484000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (969.29 seconds)\n", - "Cbc0010I After 11485000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (969.34 seconds)\n", - "Cbc0010I After 11486000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (969.40 seconds)\n", - "Cbc0010I After 11487000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (969.45 seconds)\n", - "Cbc0010I After 11488000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (969.51 seconds)\n", - "Cbc0010I After 11489000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (969.57 seconds)\n", - "Cbc0010I After 11490000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (969.62 seconds)\n", - "Cbc0010I After 11491000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (969.67 seconds)\n", - "Cbc0010I After 11492000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (969.72 seconds)\n", - "Cbc0010I After 11493000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (969.77 seconds)\n", - "Cbc0010I After 11494000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (969.83 seconds)\n", - "Cbc0010I After 11495000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (969.88 seconds)\n", - "Cbc0010I After 11496000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (969.93 seconds)\n", - "Cbc0010I After 11497000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (969.99 seconds)\n", - "Cbc0010I After 11498000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (970.04 seconds)\n", - "Cbc0010I After 11499000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (970.10 seconds)\n", - "Cbc0010I After 11500000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (970.15 seconds)\n", - "Cbc0010I After 11501000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (970.21 seconds)\n", - "Cbc0010I After 11502000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.26 seconds)\n", - "Cbc0010I After 11503000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (970.32 seconds)\n", - "Cbc0010I After 11504000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (970.38 seconds)\n", - "Cbc0010I After 11505000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (970.44 seconds)\n", - "Cbc0010I After 11506000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (970.50 seconds)\n", - "Cbc0010I After 11507000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (970.57 seconds)\n", - "Cbc0010I After 11508000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.62 seconds)\n", - "Cbc0010I After 11509000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (970.67 seconds)\n", - "Cbc0010I After 11510000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (970.73 seconds)\n", - "Cbc0010I After 11511000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (970.78 seconds)\n", - "Cbc0010I After 11512000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (970.83 seconds)\n", - "Cbc0010I After 11513000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (970.89 seconds)\n", - "Cbc0010I After 11514000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (970.95 seconds)\n", - "Cbc0010I After 11515000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (971.00 seconds)\n", - "Cbc0010I After 11516000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (971.06 seconds)\n", - "Cbc0010I After 11517000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (971.11 seconds)\n", - "Cbc0010I After 11518000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (971.16 seconds)\n", - "Cbc0010I After 11519000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (971.22 seconds)\n", - "Cbc0010I After 11520000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (971.27 seconds)\n", - "Cbc0010I After 11521000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (971.34 seconds)\n", - "Cbc0010I After 11522000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (971.40 seconds)\n", - "Cbc0010I After 11523000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (971.46 seconds)\n", - "Cbc0010I After 11524000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (971.51 seconds)\n", - "Cbc0010I After 11525000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (971.55 seconds)\n", - "Cbc0010I After 11526000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (971.60 seconds)\n", - "Cbc0010I After 11527000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (971.65 seconds)\n", - "Cbc0010I After 11528000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (971.69 seconds)\n", - "Cbc0010I After 11529000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (971.75 seconds)\n", - "Cbc0010I After 11530000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (971.80 seconds)\n", - "Cbc0010I After 11531000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (971.85 seconds)\n", - "Cbc0010I After 11532000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (971.90 seconds)\n", - "Cbc0010I After 11533000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (971.95 seconds)\n", - "Cbc0010I After 11534000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (972.00 seconds)\n", - "Cbc0010I After 11535000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (972.05 seconds)\n", - "Cbc0010I After 11536000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.10 seconds)\n", - "Cbc0010I After 11537000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (972.15 seconds)\n", - "Cbc0010I After 11538000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.20 seconds)\n", - "Cbc0010I After 11539000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (972.25 seconds)\n", - "Cbc0010I After 11540000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (972.30 seconds)\n", - "Cbc0010I After 11541000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (972.35 seconds)\n", - "Cbc0010I After 11542000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (972.41 seconds)\n", - "Cbc0010I After 11543000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (972.46 seconds)\n", - "Cbc0010I After 11544000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (972.51 seconds)\n", - "Cbc0010I After 11545000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (972.57 seconds)\n", - "Cbc0010I After 11546000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (972.62 seconds)\n", - "Cbc0010I After 11547000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (972.67 seconds)\n", - "Cbc0010I After 11548000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (972.72 seconds)\n", - "Cbc0010I After 11549000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (972.77 seconds)\n", - "Cbc0010I After 11550000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (972.81 seconds)\n", - "Cbc0010I After 11551000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (972.85 seconds)\n", - "Cbc0010I After 11552000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (972.88 seconds)\n", - "Cbc0010I After 11553000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (972.92 seconds)\n", - "Cbc0010I After 11554000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (972.95 seconds)\n", - "Cbc0010I After 11555000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (972.99 seconds)\n", - "Cbc0010I After 11556000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.02 seconds)\n", - "Cbc0010I After 11557000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (973.10 seconds)\n", - "Cbc0010I After 11558000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (973.17 seconds)\n", - "Cbc0010I After 11559000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.22 seconds)\n", - "Cbc0010I After 11560000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.27 seconds)\n", - "Cbc0010I After 11561000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (973.31 seconds)\n", - "Cbc0010I After 11562000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (973.36 seconds)\n", - "Cbc0010I After 11563000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.40 seconds)\n", - "Cbc0010I After 11564000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (973.44 seconds)\n", - "Cbc0010I After 11565000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (973.49 seconds)\n", - "Cbc0010I After 11566000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (973.54 seconds)\n", - "Cbc0010I After 11567000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (973.58 seconds)\n", - "Cbc0010I After 11568000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (973.62 seconds)\n", - "Cbc0010I After 11569000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (973.66 seconds)\n", - "Cbc0010I After 11570000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (973.70 seconds)\n", - "Cbc0010I After 11571000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (973.74 seconds)\n", - "Cbc0010I After 11572000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (973.78 seconds)\n", - "Cbc0010I After 11573000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (973.81 seconds)\n", - "Cbc0010I After 11574000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (973.85 seconds)\n", - "Cbc0010I After 11575000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (973.89 seconds)\n", - "Cbc0010I After 11576000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (973.92 seconds)\n", - "Cbc0010I After 11577000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (973.95 seconds)\n", - "Cbc0010I After 11578000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (973.99 seconds)\n", - "Cbc0010I After 11579000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (974.03 seconds)\n", - "Cbc0010I After 11580000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (974.07 seconds)\n", - "Cbc0010I After 11581000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.11 seconds)\n", - "Cbc0010I After 11582000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (974.15 seconds)\n", - "Cbc0010I After 11583000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (974.19 seconds)\n", - "Cbc0010I After 11584000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (974.23 seconds)\n", - "Cbc0010I After 11585000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (974.27 seconds)\n", - "Cbc0010I After 11586000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (974.30 seconds)\n", - "Cbc0010I After 11587000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (974.34 seconds)\n", - "Cbc0010I After 11588000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (974.37 seconds)\n", - "Cbc0010I After 11589000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.41 seconds)\n", - "Cbc0010I After 11590000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (974.45 seconds)\n", - "Cbc0010I After 11591000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (974.50 seconds)\n", - "Cbc0010I After 11592000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (974.56 seconds)\n", - "Cbc0010I After 11593000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (974.60 seconds)\n", - "Cbc0010I After 11594000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (974.65 seconds)\n", - "Cbc0010I After 11595000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (974.69 seconds)\n", - "Cbc0010I After 11596000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (974.74 seconds)\n", - "Cbc0010I After 11597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (974.79 seconds)\n", - "Cbc0010I After 11598000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (974.85 seconds)\n", - "Cbc0010I After 11599000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (974.94 seconds)\n", - "Cbc0010I After 11600000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (974.99 seconds)\n", - "Cbc0010I After 11601000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (975.04 seconds)\n", - "Cbc0010I After 11602000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (975.08 seconds)\n", - "Cbc0010I After 11603000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (975.13 seconds)\n", - "Cbc0010I After 11604000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (975.18 seconds)\n", - "Cbc0010I After 11605000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (975.23 seconds)\n", - "Cbc0010I After 11606000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.26 seconds)\n", - "Cbc0010I After 11607000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (975.30 seconds)\n", - "Cbc0010I After 11608000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.33 seconds)\n", - "Cbc0010I After 11609000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (975.36 seconds)\n", - "Cbc0010I After 11610000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.42 seconds)\n", - "Cbc0010I After 11611000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (975.46 seconds)\n", - "Cbc0010I After 11612000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (975.50 seconds)\n", - "Cbc0010I After 11613000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (975.54 seconds)\n", - "Cbc0010I After 11614000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (975.57 seconds)\n", - "Cbc0010I After 11615000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (975.62 seconds)\n", - "Cbc0010I After 11616000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.65 seconds)\n", - "Cbc0010I After 11617000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (975.70 seconds)\n", - "Cbc0010I After 11618000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (975.74 seconds)\n", - "Cbc0010I After 11619000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (975.77 seconds)\n", - "Cbc0010I After 11620000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (975.82 seconds)\n", - "Cbc0010I After 11621000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (975.87 seconds)\n", - "Cbc0010I After 11622000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (975.92 seconds)\n", - "Cbc0010I After 11623000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (975.97 seconds)\n", - "Cbc0010I After 11624000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (976.01 seconds)\n", - "Cbc0010I After 11625000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (976.06 seconds)\n", - "Cbc0010I After 11626000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (976.10 seconds)\n", - "Cbc0010I After 11627000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (976.15 seconds)\n", - "Cbc0010I After 11628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.19 seconds)\n", - "Cbc0010I After 11629000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (976.24 seconds)\n", - "Cbc0010I After 11630000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.28 seconds)\n", - "Cbc0010I After 11631000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (976.34 seconds)\n", - "Cbc0010I After 11632000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (976.40 seconds)\n", - "Cbc0010I After 11633000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (976.45 seconds)\n", - "Cbc0010I After 11634000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (976.50 seconds)\n", - "Cbc0010I After 11635000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (976.54 seconds)\n", - "Cbc0010I After 11636000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (976.59 seconds)\n", - "Cbc0010I After 11637000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (976.64 seconds)\n", - "Cbc0010I After 11638000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (976.69 seconds)\n", - "Cbc0010I After 11639000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.74 seconds)\n", - "Cbc0010I After 11640000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (976.78 seconds)\n", - "Cbc0010I After 11641000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (976.82 seconds)\n", - "Cbc0010I After 11642000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (976.86 seconds)\n", - "Cbc0010I After 11643000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (976.90 seconds)\n", - "Cbc0010I After 11644000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (976.95 seconds)\n", - "Cbc0010I After 11645000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (976.99 seconds)\n", - "Cbc0010I After 11646000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (977.03 seconds)\n", - "Cbc0010I After 11647000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (977.07 seconds)\n", - "Cbc0010I After 11648000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (977.13 seconds)\n", - "Cbc0010I After 11649000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (977.19 seconds)\n", - "Cbc0010I After 11650000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (977.25 seconds)\n", - "Cbc0010I After 11651000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (977.30 seconds)\n", - "Cbc0010I After 11652000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (977.35 seconds)\n", - "Cbc0010I After 11653000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (977.40 seconds)\n", - "Cbc0010I After 11654000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (977.45 seconds)\n", - "Cbc0010I After 11655000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.50 seconds)\n", - "Cbc0010I After 11656000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (977.55 seconds)\n", - "Cbc0010I After 11657000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.61 seconds)\n", - "Cbc0010I After 11658000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (977.67 seconds)\n", - "Cbc0010I After 11659000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (977.73 seconds)\n", - "Cbc0010I After 11660000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (977.78 seconds)\n", - "Cbc0010I After 11661000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (977.84 seconds)\n", - "Cbc0010I After 11662000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (977.89 seconds)\n", - "Cbc0010I After 11663000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (977.94 seconds)\n", - "Cbc0010I After 11664000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (978.00 seconds)\n", - "Cbc0010I After 11665000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (978.05 seconds)\n", - "Cbc0010I After 11666000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (978.09 seconds)\n", - "Cbc0010I After 11667000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (978.13 seconds)\n", - "Cbc0010I After 11668000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (978.18 seconds)\n", - "Cbc0010I After 11669000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (978.22 seconds)\n", - "Cbc0010I After 11670000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (978.27 seconds)\n", - "Cbc0010I After 11671000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (978.31 seconds)\n", - "Cbc0010I After 11672000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (978.36 seconds)\n", - "Cbc0010I After 11673000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (978.42 seconds)\n", - "Cbc0010I After 11674000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (978.46 seconds)\n", - "Cbc0010I After 11675000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (978.52 seconds)\n", - "Cbc0010I After 11676000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (978.57 seconds)\n", - "Cbc0010I After 11677000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (978.62 seconds)\n", - "Cbc0010I After 11678000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (978.67 seconds)\n", - "Cbc0010I After 11679000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (978.73 seconds)\n", - "Cbc0010I After 11680000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (978.78 seconds)\n", - "Cbc0010I After 11681000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (978.84 seconds)\n", - "Cbc0010I After 11682000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (978.90 seconds)\n", - "Cbc0010I After 11683000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (978.96 seconds)\n", - "Cbc0010I After 11684000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (979.01 seconds)\n", - "Cbc0010I After 11685000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (979.07 seconds)\n", - "Cbc0010I After 11686000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.13 seconds)\n", - "Cbc0010I After 11687000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (979.19 seconds)\n", - "Cbc0010I After 11688000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (979.24 seconds)\n", - "Cbc0010I After 11689000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (979.30 seconds)\n", - "Cbc0010I After 11690000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (979.35 seconds)\n", - "Cbc0010I After 11691000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (979.41 seconds)\n", - "Cbc0010I After 11692000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (979.47 seconds)\n", - "Cbc0010I After 11693000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (979.53 seconds)\n", - "Cbc0010I After 11694000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (979.58 seconds)\n", - "Cbc0010I After 11695000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (979.63 seconds)\n", - "Cbc0010I After 11696000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (979.69 seconds)\n", - "Cbc0010I After 11697000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (979.74 seconds)\n", - "Cbc0010I After 11698000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (979.79 seconds)\n", - "Cbc0010I After 11699000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.84 seconds)\n", - "Cbc0010I After 11700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (979.89 seconds)\n", - "Cbc0010I After 11701000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (979.93 seconds)\n", - "Cbc0010I After 11702000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (979.99 seconds)\n", - "Cbc0010I After 11703000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (980.05 seconds)\n", - "Cbc0010I After 11704000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (980.11 seconds)\n", - "Cbc0010I After 11705000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (980.17 seconds)\n", - "Cbc0010I After 11706000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.23 seconds)\n", - "Cbc0010I After 11707000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.29 seconds)\n", - "Cbc0010I After 11708000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (980.37 seconds)\n", - "Cbc0010I After 11709000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (980.42 seconds)\n", - "Cbc0010I After 11710000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (980.49 seconds)\n", - "Cbc0010I After 11711000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.55 seconds)\n", - "Cbc0010I After 11712000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (980.60 seconds)\n", - "Cbc0010I After 11713000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (980.66 seconds)\n", - "Cbc0010I After 11714000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (980.72 seconds)\n", - "Cbc0010I After 11715000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.78 seconds)\n", - "Cbc0010I After 11716000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (980.83 seconds)\n", - "Cbc0010I After 11717000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (980.88 seconds)\n", - "Cbc0010I After 11718000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (980.94 seconds)\n", - "Cbc0010I After 11719000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (980.99 seconds)\n", - "Cbc0010I After 11720000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.04 seconds)\n", - "Cbc0010I After 11721000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.09 seconds)\n", - "Cbc0010I After 11722000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (981.14 seconds)\n", - "Cbc0010I After 11723000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (981.19 seconds)\n", - "Cbc0010I After 11724000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (981.26 seconds)\n", - "Cbc0010I After 11725000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.32 seconds)\n", - "Cbc0010I After 11726000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.38 seconds)\n", - "Cbc0010I After 11727000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (981.43 seconds)\n", - "Cbc0010I After 11728000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.49 seconds)\n", - "Cbc0010I After 11729000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (981.55 seconds)\n", - "Cbc0010I After 11730000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.60 seconds)\n", - "Cbc0010I After 11731000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (981.64 seconds)\n", - "Cbc0010I After 11732000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (981.70 seconds)\n", - "Cbc0010I After 11733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.76 seconds)\n", - "Cbc0010I After 11734000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (981.82 seconds)\n", - "Cbc0010I After 11735000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (981.87 seconds)\n", - "Cbc0010I After 11736000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.93 seconds)\n", - "Cbc0010I After 11737000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (981.99 seconds)\n", - "Cbc0010I After 11738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (982.05 seconds)\n", - "Cbc0010I After 11739000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (982.12 seconds)\n", - "Cbc0010I After 11740000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (982.18 seconds)\n", - "Cbc0010I After 11741000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (982.23 seconds)\n", - "Cbc0010I After 11742000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (982.31 seconds)\n", - "Cbc0010I After 11743000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (982.36 seconds)\n", - "Cbc0010I After 11744000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.42 seconds)\n", - "Cbc0010I After 11745000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (982.48 seconds)\n", - "Cbc0010I After 11746000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (982.54 seconds)\n", - "Cbc0010I After 11747000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (982.60 seconds)\n", - "Cbc0010I After 11748000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.66 seconds)\n", - "Cbc0010I After 11749000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (982.73 seconds)\n", - "Cbc0010I After 11750000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (982.79 seconds)\n", - "Cbc0010I After 11751000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (982.85 seconds)\n", - "Cbc0010I After 11752000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (982.91 seconds)\n", - "Cbc0010I After 11753000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (982.98 seconds)\n", - "Cbc0010I After 11754000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (983.03 seconds)\n", - "Cbc0010I After 11755000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.09 seconds)\n", - "Cbc0010I After 11756000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (983.15 seconds)\n", - "Cbc0010I After 11757000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (983.21 seconds)\n", - "Cbc0010I After 11758000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (983.26 seconds)\n", - "Cbc0010I After 11759000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (983.32 seconds)\n", - "Cbc0010I After 11760000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (983.37 seconds)\n", - "Cbc0010I After 11761000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (983.42 seconds)\n", - "Cbc0010I After 11762000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.47 seconds)\n", - "Cbc0010I After 11763000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (983.52 seconds)\n", - "Cbc0010I After 11764000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (983.57 seconds)\n", - "Cbc0010I After 11765000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (983.62 seconds)\n", - "Cbc0010I After 11766000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (983.66 seconds)\n", - "Cbc0010I After 11767000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (983.71 seconds)\n", - "Cbc0010I After 11768000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (983.77 seconds)\n", - "Cbc0010I After 11769000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (983.83 seconds)\n", - "Cbc0010I After 11770000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (983.89 seconds)\n", - "Cbc0010I After 11771000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (983.94 seconds)\n", - "Cbc0010I After 11772000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (984.01 seconds)\n", - "Cbc0010I After 11773000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (984.10 seconds)\n", - "Cbc0010I After 11774000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (984.18 seconds)\n", - "Cbc0010I After 11775000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (984.25 seconds)\n", - "Cbc0010I After 11776000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (984.31 seconds)\n", - "Cbc0010I After 11777000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (984.37 seconds)\n", - "Cbc0010I After 11778000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (984.44 seconds)\n", - "Cbc0010I After 11779000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (984.49 seconds)\n", - "Cbc0010I After 11780000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (984.55 seconds)\n", - "Cbc0010I After 11781000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (984.60 seconds)\n", - "Cbc0010I After 11782000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (984.66 seconds)\n", - "Cbc0010I After 11783000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (984.72 seconds)\n", - "Cbc0010I After 11784000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (984.77 seconds)\n", - "Cbc0010I After 11785000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (984.83 seconds)\n", - "Cbc0010I After 11786000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (984.89 seconds)\n", - "Cbc0010I After 11787000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (984.94 seconds)\n", - "Cbc0010I After 11788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (985.00 seconds)\n", - "Cbc0010I After 11789000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.05 seconds)\n", - "Cbc0010I After 11790000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (985.11 seconds)\n", - "Cbc0010I After 11791000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.17 seconds)\n", - "Cbc0010I After 11792000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (985.22 seconds)\n", - "Cbc0010I After 11793000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (985.28 seconds)\n", - "Cbc0010I After 11794000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (985.34 seconds)\n", - "Cbc0010I After 11795000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (985.40 seconds)\n", - "Cbc0010I After 11796000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (985.46 seconds)\n", - "Cbc0010I After 11797000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (985.51 seconds)\n", - "Cbc0010I After 11798000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (985.57 seconds)\n", - "Cbc0010I After 11799000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (985.64 seconds)\n", - "Cbc0010I After 11800000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (985.70 seconds)\n", - "Cbc0010I After 11801000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (985.76 seconds)\n", - "Cbc0010I After 11802000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (985.81 seconds)\n", - "Cbc0010I After 11803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (985.88 seconds)\n", - "Cbc0010I After 11804000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (985.93 seconds)\n", - "Cbc0010I After 11805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (985.99 seconds)\n", - "Cbc0010I After 11806000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (986.05 seconds)\n", - "Cbc0010I After 11807000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.11 seconds)\n", - "Cbc0010I After 11808000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.17 seconds)\n", - "Cbc0010I After 11809000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.23 seconds)\n", - "Cbc0010I After 11810000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (986.28 seconds)\n", - "Cbc0010I After 11811000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (986.33 seconds)\n", - "Cbc0010I After 11812000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (986.38 seconds)\n", - "Cbc0010I After 11813000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.43 seconds)\n", - "Cbc0010I After 11814000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (986.50 seconds)\n", - "Cbc0010I After 11815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (986.55 seconds)\n", - "Cbc0010I After 11816000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (986.60 seconds)\n", - "Cbc0010I After 11817000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (986.67 seconds)\n", - "Cbc0010I After 11818000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (986.73 seconds)\n", - "Cbc0010I After 11819000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (986.78 seconds)\n", - "Cbc0010I After 11820000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (986.85 seconds)\n", - "Cbc0010I After 11821000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (986.91 seconds)\n", - "Cbc0010I After 11822000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (986.96 seconds)\n", - "Cbc0010I After 11823000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (987.02 seconds)\n", - "Cbc0010I After 11824000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (987.07 seconds)\n", - "Cbc0010I After 11825000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (987.13 seconds)\n", - "Cbc0010I After 11826000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (987.19 seconds)\n", - "Cbc0010I After 11827000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (987.26 seconds)\n", - "Cbc0010I After 11828000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (987.32 seconds)\n", - "Cbc0010I After 11829000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.38 seconds)\n", - "Cbc0010I After 11830000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (987.44 seconds)\n", - "Cbc0010I After 11831000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (987.51 seconds)\n", - "Cbc0010I After 11832000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (987.56 seconds)\n", - "Cbc0010I After 11833000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (987.62 seconds)\n", - "Cbc0010I After 11834000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.68 seconds)\n", - "Cbc0010I After 11835000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (987.74 seconds)\n", - "Cbc0010I After 11836000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (987.80 seconds)\n", - "Cbc0010I After 11837000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (987.88 seconds)\n", - "Cbc0010I After 11838000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (987.93 seconds)\n", - "Cbc0010I After 11839000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (987.99 seconds)\n", - "Cbc0010I After 11840000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (988.06 seconds)\n", - "Cbc0010I After 11841000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (988.13 seconds)\n", - "Cbc0010I After 11842000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.19 seconds)\n", - "Cbc0010I After 11843000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (988.26 seconds)\n", - "Cbc0010I After 11844000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (988.32 seconds)\n", - "Cbc0010I After 11845000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (988.38 seconds)\n", - "Cbc0010I After 11846000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.44 seconds)\n", - "Cbc0010I After 11847000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (988.50 seconds)\n", - "Cbc0010I After 11848000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (988.56 seconds)\n", - "Cbc0010I After 11849000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (988.62 seconds)\n", - "Cbc0010I After 11850000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (988.70 seconds)\n", - "Cbc0010I After 11851000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (988.79 seconds)\n", - "Cbc0010I After 11852000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (988.88 seconds)\n", - "Cbc0010I After 11853000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (988.97 seconds)\n", - "Cbc0010I After 11854000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (989.04 seconds)\n", - "Cbc0010I After 11855000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (989.11 seconds)\n", - "Cbc0010I After 11856000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (989.18 seconds)\n", - "Cbc0010I After 11857000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (989.24 seconds)\n", - "Cbc0010I After 11858000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (989.31 seconds)\n", - "Cbc0010I After 11859000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (989.37 seconds)\n", - "Cbc0010I After 11860000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (989.43 seconds)\n", - "Cbc0010I After 11861000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (989.49 seconds)\n", - "Cbc0010I After 11862000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (989.55 seconds)\n", - "Cbc0010I After 11863000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.61 seconds)\n", - "Cbc0010I After 11864000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (989.66 seconds)\n", - "Cbc0010I After 11865000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (989.72 seconds)\n", - "Cbc0010I After 11866000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (989.77 seconds)\n", - "Cbc0010I After 11867000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.83 seconds)\n", - "Cbc0010I After 11868000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (989.88 seconds)\n", - "Cbc0010I After 11869000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (989.94 seconds)\n", - "Cbc0010I After 11870000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (990.00 seconds)\n", - "Cbc0010I After 11871000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (990.07 seconds)\n", - "Cbc0010I After 11872000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (990.13 seconds)\n", - "Cbc0010I After 11873000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (990.20 seconds)\n", - "Cbc0010I After 11874000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (990.26 seconds)\n", - "Cbc0010I After 11875000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (990.33 seconds)\n", - "Cbc0010I After 11876000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (990.39 seconds)\n", - "Cbc0010I After 11877000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (990.45 seconds)\n", - "Cbc0010I After 11878000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (990.51 seconds)\n", - "Cbc0010I After 11879000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (990.56 seconds)\n", - "Cbc0010I After 11880000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (990.62 seconds)\n", - "Cbc0010I After 11881000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (990.68 seconds)\n", - "Cbc0010I After 11882000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (990.74 seconds)\n", - "Cbc0010I After 11883000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (990.80 seconds)\n", - "Cbc0010I After 11884000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (990.86 seconds)\n", - "Cbc0010I After 11885000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (990.92 seconds)\n", - "Cbc0010I After 11886000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (990.97 seconds)\n", - "Cbc0010I After 11887000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (991.05 seconds)\n", - "Cbc0010I After 11888000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (991.11 seconds)\n", - "Cbc0010I After 11889000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (991.16 seconds)\n", - "Cbc0010I After 11890000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (991.23 seconds)\n", - "Cbc0010I After 11891000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (991.29 seconds)\n", - "Cbc0010I After 11892000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (991.34 seconds)\n", - "Cbc0010I After 11893000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (991.48 seconds)\n", - "Cbc0010I After 11894000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (991.55 seconds)\n", - "Cbc0010I After 11895000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (991.61 seconds)\n", - "Cbc0010I After 11896000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (991.67 seconds)\n", - "Cbc0010I After 11897000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (991.73 seconds)\n", - "Cbc0010I After 11898000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (991.79 seconds)\n", - "Cbc0010I After 11899000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (991.86 seconds)\n", - "Cbc0010I After 11900000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (991.92 seconds)\n", - "Cbc0010I After 11901000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (991.98 seconds)\n", - "Cbc0010I After 11902000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.04 seconds)\n", - "Cbc0010I After 11903000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (992.10 seconds)\n", - "Cbc0010I After 11904000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (992.16 seconds)\n", - "Cbc0010I After 11905000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.22 seconds)\n", - "Cbc0010I After 11906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (992.28 seconds)\n", - "Cbc0010I After 11907000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (992.34 seconds)\n", - "Cbc0010I After 11908000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (992.40 seconds)\n", - "Cbc0010I After 11909000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.46 seconds)\n", - "Cbc0010I After 11910000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (992.51 seconds)\n", - "Cbc0010I After 11911000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (992.57 seconds)\n", - "Cbc0010I After 11912000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (992.63 seconds)\n", - "Cbc0010I After 11913000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (992.69 seconds)\n", - "Cbc0010I After 11914000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (992.75 seconds)\n", - "Cbc0010I After 11915000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (992.80 seconds)\n", - "Cbc0010I After 11916000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (992.87 seconds)\n", - "Cbc0010I After 11917000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (992.92 seconds)\n", - "Cbc0010I After 11918000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (992.98 seconds)\n", - "Cbc0010I After 11919000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.03 seconds)\n", - "Cbc0010I After 11920000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (993.09 seconds)\n", - "Cbc0010I After 11921000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (993.15 seconds)\n", - "Cbc0010I After 11922000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (993.20 seconds)\n", - "Cbc0010I After 11923000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (993.25 seconds)\n", - "Cbc0010I After 11924000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (993.31 seconds)\n", - "Cbc0010I After 11925000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.37 seconds)\n", - "Cbc0010I After 11926000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (993.43 seconds)\n", - "Cbc0010I After 11927000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (993.49 seconds)\n", - "Cbc0010I After 11928000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (993.54 seconds)\n", - "Cbc0010I After 11929000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (993.59 seconds)\n", - "Cbc0010I After 11930000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (993.64 seconds)\n", - "Cbc0010I After 11931000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (993.69 seconds)\n", - "Cbc0010I After 11932000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (993.74 seconds)\n", - "Cbc0010I After 11933000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (993.79 seconds)\n", - "Cbc0010I After 11934000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (993.84 seconds)\n", - "Cbc0010I After 11935000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (993.88 seconds)\n", - "Cbc0010I After 11936000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (993.92 seconds)\n", - "Cbc0010I After 11937000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (993.96 seconds)\n", - "Cbc0010I After 11938000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (994.03 seconds)\n", - "Cbc0010I After 11939000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (994.08 seconds)\n", - "Cbc0010I After 11940000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (994.15 seconds)\n", - "Cbc0010I After 11941000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (994.21 seconds)\n", - "Cbc0010I After 11942000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (994.28 seconds)\n", - "Cbc0010I After 11943000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (994.33 seconds)\n", - "Cbc0010I After 11944000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (994.40 seconds)\n", - "Cbc0010I After 11945000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (994.46 seconds)\n", - "Cbc0010I After 11946000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (994.53 seconds)\n", - "Cbc0010I After 11947000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (994.59 seconds)\n", - "Cbc0010I After 11948000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (994.65 seconds)\n", - "Cbc0010I After 11949000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (994.71 seconds)\n", - "Cbc0010I After 11950000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (994.76 seconds)\n", - "Cbc0010I After 11951000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (994.82 seconds)\n", - "Cbc0010I After 11952000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (994.89 seconds)\n", - "Cbc0010I After 11953000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (994.94 seconds)\n", - "Cbc0010I After 11954000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (995.01 seconds)\n", - "Cbc0010I After 11955000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (995.06 seconds)\n", - "Cbc0010I After 11956000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (995.12 seconds)\n", - "Cbc0010I After 11957000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (995.18 seconds)\n", - "Cbc0010I After 11958000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (995.23 seconds)\n", - "Cbc0010I After 11959000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (995.29 seconds)\n", - "Cbc0010I After 11960000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.34 seconds)\n", - "Cbc0010I After 11961000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (995.40 seconds)\n", - "Cbc0010I After 11962000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (995.46 seconds)\n", - "Cbc0010I After 11963000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (995.52 seconds)\n", - "Cbc0010I After 11964000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (995.57 seconds)\n", - "Cbc0010I After 11965000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (995.64 seconds)\n", - "Cbc0010I After 11966000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (995.71 seconds)\n", - "Cbc0010I After 11967000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (995.77 seconds)\n", - "Cbc0010I After 11968000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.83 seconds)\n", - "Cbc0010I After 11969000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (995.90 seconds)\n", - "Cbc0010I After 11970000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (995.96 seconds)\n", - "Cbc0010I After 11971000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (996.01 seconds)\n", - "Cbc0010I After 11972000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (996.07 seconds)\n", - "Cbc0010I After 11973000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (996.13 seconds)\n", - "Cbc0010I After 11974000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (996.18 seconds)\n", - "Cbc0010I After 11975000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (996.24 seconds)\n", - "Cbc0010I After 11976000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (996.29 seconds)\n", - "Cbc0010I After 11977000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (996.36 seconds)\n", - "Cbc0010I After 11978000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (996.42 seconds)\n", - "Cbc0010I After 11979000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (996.48 seconds)\n", - "Cbc0010I After 11980000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (996.54 seconds)\n", - "Cbc0010I After 11981000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (996.60 seconds)\n", - "Cbc0010I After 11982000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (996.66 seconds)\n", - "Cbc0010I After 11983000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (996.72 seconds)\n", - "Cbc0010I After 11984000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (996.78 seconds)\n", - "Cbc0010I After 11985000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (996.82 seconds)\n", - "Cbc0010I After 11986000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (996.88 seconds)\n", - "Cbc0010I After 11987000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (996.94 seconds)\n", - "Cbc0010I After 11988000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (997.00 seconds)\n", - "Cbc0010I After 11989000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (997.06 seconds)\n", - "Cbc0010I After 11990000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (997.13 seconds)\n", - "Cbc0010I After 11991000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.19 seconds)\n", - "Cbc0010I After 11992000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (997.25 seconds)\n", - "Cbc0010I After 11993000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (997.31 seconds)\n", - "Cbc0010I After 11994000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (997.37 seconds)\n", - "Cbc0010I After 11995000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.43 seconds)\n", - "Cbc0010I After 11996000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (997.48 seconds)\n", - "Cbc0010I After 11997000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (997.55 seconds)\n", - "Cbc0010I After 11998000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.60 seconds)\n", - "Cbc0010I After 11999000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (997.65 seconds)\n", - "Cbc0010I After 12000000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (997.71 seconds)\n", - "Cbc0010I After 12001000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (997.77 seconds)\n", - "Cbc0010I After 12002000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (997.83 seconds)\n", - "Cbc0010I After 12003000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (997.91 seconds)\n", - "Cbc0010I After 12004000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (997.98 seconds)\n", - "Cbc0010I After 12005000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (998.05 seconds)\n", - "Cbc0010I After 12006000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (998.13 seconds)\n", - "Cbc0010I After 12007000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (998.19 seconds)\n", - "Cbc0010I After 12008000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (998.26 seconds)\n", - "Cbc0010I After 12009000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.32 seconds)\n", - "Cbc0010I After 12010000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.37 seconds)\n", - "Cbc0010I After 12011000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (998.43 seconds)\n", - "Cbc0010I After 12012000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (998.49 seconds)\n", - "Cbc0010I After 12013000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (998.54 seconds)\n", - "Cbc0010I After 12014000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (998.59 seconds)\n", - "Cbc0010I After 12015000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.64 seconds)\n", - "Cbc0010I After 12016000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (998.70 seconds)\n", - "Cbc0010I After 12017000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (998.75 seconds)\n", - "Cbc0010I After 12018000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (998.79 seconds)\n", - "Cbc0010I After 12019000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (998.86 seconds)\n", - "Cbc0010I After 12020000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (998.92 seconds)\n", - "Cbc0010I After 12021000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (998.98 seconds)\n", - "Cbc0010I After 12022000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (999.06 seconds)\n", - "Cbc0010I After 12023000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (999.11 seconds)\n", - "Cbc0010I After 12024000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (999.18 seconds)\n", - "Cbc0010I After 12025000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (999.24 seconds)\n", - "Cbc0010I After 12026000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (999.30 seconds)\n", - "Cbc0010I After 12027000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (999.36 seconds)\n", - "Cbc0010I After 12028000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (999.43 seconds)\n", - "Cbc0010I After 12029000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (999.49 seconds)\n", - "Cbc0010I After 12030000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (999.56 seconds)\n", - "Cbc0010I After 12031000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (999.61 seconds)\n", - "Cbc0010I After 12032000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (999.69 seconds)\n", - "Cbc0010I After 12033000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (999.73 seconds)\n", - "Cbc0010I After 12034000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (999.81 seconds)\n", - "Cbc0010I After 12035000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (999.86 seconds)\n", - "Cbc0010I After 12036000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (999.93 seconds)\n", - "Cbc0010I After 12037000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (999.98 seconds)\n", - "Cbc0010I After 12038000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1000.05 seconds)\n", - "Cbc0010I After 12039000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1000.11 seconds)\n", - "Cbc0010I After 12040000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1000.17 seconds)\n", - "Cbc0010I After 12041000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1000.24 seconds)\n", - "Cbc0010I After 12042000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1000.30 seconds)\n", - "Cbc0010I After 12043000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1000.36 seconds)\n", - "Cbc0010I After 12044000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1000.41 seconds)\n", - "Cbc0010I After 12045000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1000.48 seconds)\n", - "Cbc0010I After 12046000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1000.53 seconds)\n", - "Cbc0010I After 12047000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1000.59 seconds)\n", - "Cbc0010I After 12048000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1000.65 seconds)\n", - "Cbc0010I After 12049000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1000.70 seconds)\n", - "Cbc0010I After 12050000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1000.77 seconds)\n", - "Cbc0010I After 12051000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1000.81 seconds)\n", - "Cbc0010I After 12052000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1000.88 seconds)\n", - "Cbc0010I After 12053000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1000.93 seconds)\n", - "Cbc0010I After 12054000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1001.00 seconds)\n", - "Cbc0010I After 12055000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1001.06 seconds)\n", - "Cbc0010I After 12056000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1001.13 seconds)\n", - "Cbc0010I After 12057000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1001.20 seconds)\n", - "Cbc0010I After 12058000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1001.25 seconds)\n", - "Cbc0010I After 12059000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1001.31 seconds)\n", - "Cbc0010I After 12060000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1001.37 seconds)\n", - "Cbc0010I After 12061000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1001.44 seconds)\n", - "Cbc0010I After 12062000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1001.50 seconds)\n", - "Cbc0010I After 12063000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1001.55 seconds)\n", - "Cbc0010I After 12064000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1001.62 seconds)\n", - "Cbc0010I After 12065000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1001.68 seconds)\n", - "Cbc0010I After 12066000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.76 seconds)\n", - "Cbc0010I After 12067000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.81 seconds)\n", - "Cbc0010I After 12068000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1001.88 seconds)\n", - "Cbc0010I After 12069000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1001.94 seconds)\n", - "Cbc0010I After 12070000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1002.01 seconds)\n", - "Cbc0010I After 12071000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1002.08 seconds)\n", - "Cbc0010I After 12072000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1002.16 seconds)\n", - "Cbc0010I After 12073000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1002.22 seconds)\n", - "Cbc0010I After 12074000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1002.29 seconds)\n", - "Cbc0010I After 12075000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1002.34 seconds)\n", - "Cbc0010I After 12076000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1002.40 seconds)\n", - "Cbc0010I After 12077000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1002.45 seconds)\n", - "Cbc0010I After 12078000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1002.51 seconds)\n", - "Cbc0010I After 12079000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1002.57 seconds)\n", - "Cbc0010I After 12080000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1002.64 seconds)\n", - "Cbc0010I After 12081000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1002.69 seconds)\n", - "Cbc0010I After 12082000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1002.76 seconds)\n", - "Cbc0010I After 12083000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1002.81 seconds)\n", - "Cbc0010I After 12084000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1002.88 seconds)\n", - "Cbc0010I After 12085000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1002.94 seconds)\n", - "Cbc0010I After 12086000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1003.00 seconds)\n", - "Cbc0010I After 12087000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1003.06 seconds)\n", - "Cbc0010I After 12088000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.11 seconds)\n", - "Cbc0010I After 12089000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1003.18 seconds)\n", - "Cbc0010I After 12090000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1003.23 seconds)\n", - "Cbc0010I After 12091000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1003.30 seconds)\n", - "Cbc0010I After 12092000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.35 seconds)\n", - "Cbc0010I After 12093000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.41 seconds)\n", - "Cbc0010I After 12094000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1003.47 seconds)\n", - "Cbc0010I After 12095000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1003.53 seconds)\n", - "Cbc0010I After 12096000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1003.58 seconds)\n", - "Cbc0010I After 12097000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.64 seconds)\n", - "Cbc0010I After 12098000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1003.70 seconds)\n", - "Cbc0010I After 12099000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1003.75 seconds)\n", - "Cbc0010I After 12100000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1003.81 seconds)\n", - "Cbc0010I After 12101000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1003.87 seconds)\n", - "Cbc0010I After 12102000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1003.92 seconds)\n", - "Cbc0010I After 12103000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1003.99 seconds)\n", - "Cbc0010I After 12104000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1004.05 seconds)\n", - "Cbc0010I After 12105000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1004.11 seconds)\n", - "Cbc0010I After 12106000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1004.16 seconds)\n", - "Cbc0010I After 12107000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1004.21 seconds)\n", - "Cbc0010I After 12108000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1004.27 seconds)\n", - "Cbc0010I After 12109000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1004.33 seconds)\n", - "Cbc0010I After 12110000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1004.39 seconds)\n", - "Cbc0010I After 12111000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1004.44 seconds)\n", - "Cbc0010I After 12112000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1004.50 seconds)\n", - "Cbc0010I After 12113000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1004.55 seconds)\n", - "Cbc0010I After 12114000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1004.60 seconds)\n", - "Cbc0010I After 12115000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1004.65 seconds)\n", - "Cbc0010I After 12116000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1004.71 seconds)\n", - "Cbc0010I After 12117000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1004.76 seconds)\n", - "Cbc0010I After 12118000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1004.82 seconds)\n", - "Cbc0010I After 12119000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1004.87 seconds)\n", - "Cbc0010I After 12120000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1004.93 seconds)\n", - "Cbc0010I After 12121000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1004.97 seconds)\n", - "Cbc0010I After 12122000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1005.00 seconds)\n", - "Cbc0010I After 12123000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1005.04 seconds)\n", - "Cbc0010I After 12124000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1005.08 seconds)\n", - "Cbc0010I After 12125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1005.11 seconds)\n", - "Cbc0010I After 12126000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1005.15 seconds)\n", - "Cbc0010I After 12127000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1005.20 seconds)\n", - "Cbc0010I After 12128000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1005.23 seconds)\n", - "Cbc0010I After 12129000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1005.26 seconds)\n", - "Cbc0010I After 12130000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1005.32 seconds)\n", - "Cbc0010I After 12131000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1005.38 seconds)\n", - "Cbc0010I After 12132000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1005.45 seconds)\n", - "Cbc0010I After 12133000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1005.50 seconds)\n", - "Cbc0010I After 12134000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1005.57 seconds)\n", - "Cbc0010I After 12135000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1005.62 seconds)\n", - "Cbc0010I After 12136000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1005.68 seconds)\n", - "Cbc0010I After 12137000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1005.71 seconds)\n", - "Cbc0010I After 12138000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1005.74 seconds)\n", - "Cbc0010I After 12139000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1005.78 seconds)\n", - "Cbc0010I After 12140000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1005.82 seconds)\n", - "Cbc0010I After 12141000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1005.85 seconds)\n", - "Cbc0010I After 12142000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1005.88 seconds)\n", - "Cbc0010I After 12143000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1005.91 seconds)\n", - "Cbc0010I After 12144000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1005.95 seconds)\n", - "Cbc0010I After 12145000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1005.98 seconds)\n", - "Cbc0010I After 12146000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1006.01 seconds)\n", - "Cbc0010I After 12147000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1006.09 seconds)\n", - "Cbc0010I After 12148000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1006.15 seconds)\n", - "Cbc0010I After 12149000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1006.20 seconds)\n", - "Cbc0010I After 12150000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1006.25 seconds)\n", - "Cbc0010I After 12151000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1006.30 seconds)\n", - "Cbc0010I After 12152000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1006.34 seconds)\n", - "Cbc0010I After 12153000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1006.38 seconds)\n", - "Cbc0010I After 12154000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1006.41 seconds)\n", - "Cbc0010I After 12155000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1006.44 seconds)\n", - "Cbc0010I After 12156000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1006.48 seconds)\n", - "Cbc0010I After 12157000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1006.51 seconds)\n", - "Cbc0010I After 12158000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1006.56 seconds)\n", - "Cbc0010I After 12159000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1006.61 seconds)\n", - "Cbc0010I After 12160000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1006.66 seconds)\n", - "Cbc0010I After 12161000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1006.71 seconds)\n", - "Cbc0010I After 12162000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1006.77 seconds)\n", - "Cbc0010I After 12163000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1006.82 seconds)\n", - "Cbc0010I After 12164000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1006.88 seconds)\n", - "Cbc0010I After 12165000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1006.92 seconds)\n", - "Cbc0010I After 12166000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1006.96 seconds)\n", - "Cbc0010I After 12167000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1007.00 seconds)\n", - "Cbc0010I After 12168000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1007.03 seconds)\n", - "Cbc0010I After 12169000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1007.08 seconds)\n", - "Cbc0010I After 12170000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1007.13 seconds)\n", - "Cbc0010I After 12171000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1007.19 seconds)\n", - "Cbc0010I After 12172000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1007.24 seconds)\n", - "Cbc0010I After 12173000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1007.30 seconds)\n", - "Cbc0010I After 12174000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1007.36 seconds)\n", - "Cbc0010I After 12175000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1007.42 seconds)\n", - "Cbc0010I After 12176000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1007.48 seconds)\n", - "Cbc0010I After 12177000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1007.53 seconds)\n", - "Cbc0010I After 12178000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1007.59 seconds)\n", - "Cbc0010I After 12179000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1007.62 seconds)\n", - "Cbc0010I After 12180000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1007.65 seconds)\n", - "Cbc0010I After 12181000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1007.68 seconds)\n", - "Cbc0010I After 12182000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1007.72 seconds)\n", - "Cbc0010I After 12183000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1007.77 seconds)\n", - "Cbc0010I After 12184000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1007.81 seconds)\n", - "Cbc0010I After 12185000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1007.86 seconds)\n", - "Cbc0010I After 12186000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1007.91 seconds)\n", - "Cbc0010I After 12187000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1008.00 seconds)\n", - "Cbc0010I After 12188000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1008.08 seconds)\n", - "Cbc0010I After 12189000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1008.16 seconds)\n", - "Cbc0010I After 12190000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1008.20 seconds)\n", - "Cbc0010I After 12191000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1008.24 seconds)\n", - "Cbc0010I After 12192000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1008.28 seconds)\n", - "Cbc0010I After 12193000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1008.32 seconds)\n", - "Cbc0010I After 12194000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1008.36 seconds)\n", - "Cbc0010I After 12195000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1008.42 seconds)\n", - "Cbc0010I After 12196000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1008.50 seconds)\n", - "Cbc0010I After 12197000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1008.57 seconds)\n", - "Cbc0010I After 12198000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1008.64 seconds)\n", - "Cbc0010I After 12199000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1008.70 seconds)\n", - "Cbc0010I After 12200000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1008.78 seconds)\n", - "Cbc0010I After 12201000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1008.89 seconds)\n", - "Cbc0010I After 12202000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.01 seconds)\n", - "Cbc0010I After 12203000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1009.13 seconds)\n", - "Cbc0010I After 12204000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1009.22 seconds)\n", - "Cbc0010I After 12205000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.28 seconds)\n", - "Cbc0010I After 12206000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1009.34 seconds)\n", - "Cbc0010I After 12207000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1009.42 seconds)\n", - "Cbc0010I After 12208000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1009.50 seconds)\n", - "Cbc0010I After 12209000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.58 seconds)\n", - "Cbc0010I After 12210000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1009.63 seconds)\n", - "Cbc0010I After 12211000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1009.67 seconds)\n", - "Cbc0010I After 12212000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.71 seconds)\n", - "Cbc0010I After 12213000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1009.77 seconds)\n", - "Cbc0010I After 12214000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1009.82 seconds)\n", - "Cbc0010I After 12215000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1009.86 seconds)\n", - "Cbc0010I After 12216000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1009.92 seconds)\n", - "Cbc0010I After 12217000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1009.99 seconds)\n", - "Cbc0010I After 12218000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1010.29 seconds)\n", - "Cbc0010I After 12219000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1010.36 seconds)\n", - "Cbc0010I After 12220000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1010.42 seconds)\n", - "Cbc0010I After 12221000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1010.46 seconds)\n", - "Cbc0010I After 12222000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1010.52 seconds)\n", - "Cbc0010I After 12223000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1010.57 seconds)\n", - "Cbc0010I After 12224000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1010.62 seconds)\n", - "Cbc0010I After 12225000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1010.65 seconds)\n", - "Cbc0010I After 12226000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1010.70 seconds)\n", - "Cbc0010I After 12227000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1010.75 seconds)\n", - "Cbc0010I After 12228000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1010.80 seconds)\n", - "Cbc0010I After 12229000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1010.85 seconds)\n", - "Cbc0010I After 12230000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1010.90 seconds)\n", - "Cbc0010I After 12231000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1010.94 seconds)\n", - "Cbc0010I After 12232000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1010.98 seconds)\n", - "Cbc0010I After 12233000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1011.03 seconds)\n", - "Cbc0010I After 12234000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1011.08 seconds)\n", - "Cbc0010I After 12235000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1011.13 seconds)\n", - "Cbc0010I After 12236000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1011.18 seconds)\n", - "Cbc0010I After 12237000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1011.24 seconds)\n", - "Cbc0010I After 12238000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1011.28 seconds)\n", - "Cbc0010I After 12239000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1011.32 seconds)\n", - "Cbc0010I After 12240000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1011.36 seconds)\n", - "Cbc0010I After 12241000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1011.41 seconds)\n", - "Cbc0010I After 12242000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1011.44 seconds)\n", - "Cbc0010I After 12243000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1011.49 seconds)\n", - "Cbc0010I After 12244000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1011.53 seconds)\n", - "Cbc0010I After 12245000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1011.58 seconds)\n", - "Cbc0010I After 12246000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1011.62 seconds)\n", - "Cbc0010I After 12247000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1011.66 seconds)\n", - "Cbc0010I After 12248000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1011.71 seconds)\n", - "Cbc0010I After 12249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1011.75 seconds)\n", - "Cbc0010I After 12250000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1011.81 seconds)\n", - "Cbc0010I After 12251000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1011.85 seconds)\n", - "Cbc0010I After 12252000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1011.89 seconds)\n", - "Cbc0010I After 12253000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1011.95 seconds)\n", - "Cbc0010I After 12254000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1011.99 seconds)\n", - "Cbc0010I After 12255000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1012.04 seconds)\n", - "Cbc0010I After 12256000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1012.08 seconds)\n", - "Cbc0010I After 12257000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1012.12 seconds)\n", - "Cbc0010I After 12258000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1012.18 seconds)\n", - "Cbc0010I After 12259000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1012.22 seconds)\n", - "Cbc0010I After 12260000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1012.27 seconds)\n", - "Cbc0010I After 12261000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1012.30 seconds)\n", - "Cbc0010I After 12262000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1012.34 seconds)\n", - "Cbc0010I After 12263000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1012.38 seconds)\n", - "Cbc0010I After 12264000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1012.42 seconds)\n", - "Cbc0010I After 12265000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1012.47 seconds)\n", - "Cbc0010I After 12266000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.52 seconds)\n", - "Cbc0010I After 12267000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1012.56 seconds)\n", - "Cbc0010I After 12268000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1012.61 seconds)\n", - "Cbc0010I After 12269000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1012.66 seconds)\n", - "Cbc0010I After 12270000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1012.70 seconds)\n", - "Cbc0010I After 12271000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1012.75 seconds)\n", - "Cbc0010I After 12272000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.81 seconds)\n", - "Cbc0010I After 12273000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1012.85 seconds)\n", - "Cbc0010I After 12274000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1012.90 seconds)\n", - "Cbc0010I After 12275000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1012.96 seconds)\n", - "Cbc0010I After 12276000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1013.02 seconds)\n", - "Cbc0010I After 12277000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1013.06 seconds)\n", - "Cbc0010I After 12278000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1013.10 seconds)\n", - "Cbc0010I After 12279000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1013.14 seconds)\n", - "Cbc0010I After 12280000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1013.19 seconds)\n", - "Cbc0010I After 12281000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1013.25 seconds)\n", - "Cbc0010I After 12282000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1013.29 seconds)\n", - "Cbc0010I After 12283000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1013.33 seconds)\n", - "Cbc0010I After 12284000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1013.39 seconds)\n", - "Cbc0010I After 12285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1013.45 seconds)\n", - "Cbc0010I After 12286000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1013.51 seconds)\n", - "Cbc0010I After 12287000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1013.57 seconds)\n", - "Cbc0010I After 12288000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1013.62 seconds)\n", - "Cbc0010I After 12289000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1013.68 seconds)\n", - "Cbc0010I After 12290000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1013.71 seconds)\n", - "Cbc0010I After 12291000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1013.74 seconds)\n", - "Cbc0010I After 12292000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1013.79 seconds)\n", - "Cbc0010I After 12293000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1013.83 seconds)\n", - "Cbc0010I After 12294000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1013.89 seconds)\n", - "Cbc0010I After 12295000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1013.94 seconds)\n", - "Cbc0010I After 12296000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1013.98 seconds)\n", - "Cbc0010I After 12297000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1014.02 seconds)\n", - "Cbc0010I After 12298000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.07 seconds)\n", - "Cbc0010I After 12299000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1014.14 seconds)\n", - "Cbc0010I After 12300000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1014.19 seconds)\n", - "Cbc0010I After 12301000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1014.23 seconds)\n", - "Cbc0010I After 12302000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1014.27 seconds)\n", - "Cbc0010I After 12303000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1014.34 seconds)\n", - "Cbc0010I After 12304000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1014.39 seconds)\n", - "Cbc0010I After 12305000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1014.43 seconds)\n", - "Cbc0010I After 12306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1014.47 seconds)\n", - "Cbc0010I After 12307000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.52 seconds)\n", - "Cbc0010I After 12308000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1014.59 seconds)\n", - "Cbc0010I After 12309000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1014.64 seconds)\n", - "Cbc0010I After 12310000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1014.68 seconds)\n", - "Cbc0010I After 12311000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1014.71 seconds)\n", - "Cbc0010I After 12312000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1014.76 seconds)\n", - "Cbc0010I After 12313000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1014.83 seconds)\n", - "Cbc0010I After 12314000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1014.89 seconds)\n", - "Cbc0010I After 12315000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1014.93 seconds)\n", - "Cbc0010I After 12316000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1014.97 seconds)\n", - "Cbc0010I After 12317000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1015.01 seconds)\n", - "Cbc0010I After 12318000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1015.08 seconds)\n", - "Cbc0010I After 12319000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1015.13 seconds)\n", - "Cbc0010I After 12320000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1015.17 seconds)\n", - "Cbc0010I After 12321000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1015.21 seconds)\n", - "Cbc0010I After 12322000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1015.25 seconds)\n", - "Cbc0010I After 12323000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1015.33 seconds)\n", - "Cbc0010I After 12324000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1015.40 seconds)\n", - "Cbc0010I After 12325000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1015.44 seconds)\n", - "Cbc0010I After 12326000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1015.48 seconds)\n", - "Cbc0010I After 12327000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1015.52 seconds)\n", - "Cbc0010I After 12328000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1015.59 seconds)\n", - "Cbc0010I After 12329000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1015.65 seconds)\n", - "Cbc0010I After 12330000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1015.69 seconds)\n", - "Cbc0010I After 12331000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1015.73 seconds)\n", - "Cbc0010I After 12332000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1015.77 seconds)\n", - "Cbc0010I After 12333000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1015.83 seconds)\n", - "Cbc0010I After 12334000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1015.88 seconds)\n", - "Cbc0010I After 12335000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1015.91 seconds)\n", - "Cbc0010I After 12336000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1015.94 seconds)\n", - "Cbc0010I After 12337000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1015.99 seconds)\n", - "Cbc0010I After 12338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1016.02 seconds)\n", - "Cbc0010I After 12339000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1016.06 seconds)\n", - "Cbc0010I After 12340000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.09 seconds)\n", - "Cbc0010I After 12341000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1016.13 seconds)\n", - "Cbc0010I After 12342000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1016.21 seconds)\n", - "Cbc0010I After 12343000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1016.26 seconds)\n", - "Cbc0010I After 12344000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1016.30 seconds)\n", - "Cbc0010I After 12345000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.33 seconds)\n", - "Cbc0010I After 12346000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1016.37 seconds)\n", - "Cbc0010I After 12347000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1016.43 seconds)\n", - "Cbc0010I After 12348000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1016.50 seconds)\n", - "Cbc0010I After 12349000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1016.54 seconds)\n", - "Cbc0010I After 12350000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1016.58 seconds)\n", - "Cbc0010I After 12351000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1016.62 seconds)\n", - "Cbc0010I After 12352000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1016.65 seconds)\n", - "Cbc0010I After 12353000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1016.72 seconds)\n", - "Cbc0010I After 12354000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1016.77 seconds)\n", - "Cbc0010I After 12355000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1016.83 seconds)\n", - "Cbc0010I After 12356000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1016.89 seconds)\n", - "Cbc0010I After 12357000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1016.94 seconds)\n", - "Cbc0010I After 12358000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1016.99 seconds)\n", - "Cbc0010I After 12359000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1017.03 seconds)\n", - "Cbc0010I After 12360000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1017.07 seconds)\n", - "Cbc0010I After 12361000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1017.11 seconds)\n", - "Cbc0010I After 12362000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1017.15 seconds)\n", - "Cbc0010I After 12363000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1017.18 seconds)\n", - "Cbc0010I After 12364000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1017.22 seconds)\n", - "Cbc0010I After 12365000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1017.25 seconds)\n", - "Cbc0010I After 12366000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1017.28 seconds)\n", - "Cbc0010I After 12367000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1017.31 seconds)\n", - "Cbc0010I After 12368000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1017.34 seconds)\n", - "Cbc0010I After 12369000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1017.38 seconds)\n", - "Cbc0010I After 12370000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1017.42 seconds)\n", - "Cbc0010I After 12371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1017.46 seconds)\n", - "Cbc0010I After 12372000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1017.50 seconds)\n", - "Cbc0010I After 12373000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1017.55 seconds)\n", - "Cbc0010I After 12374000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1017.60 seconds)\n", - "Cbc0010I After 12375000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1017.65 seconds)\n", - "Cbc0010I After 12376000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1017.69 seconds)\n", - "Cbc0010I After 12377000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1017.74 seconds)\n", - "Cbc0010I After 12378000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1017.79 seconds)\n", - "Cbc0010I After 12379000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1017.86 seconds)\n", - "Cbc0010I After 12380000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1017.91 seconds)\n", - "Cbc0010I After 12381000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1017.98 seconds)\n", - "Cbc0010I After 12382000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1018.04 seconds)\n", - "Cbc0010I After 12383000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1018.11 seconds)\n", - "Cbc0010I After 12384000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1018.17 seconds)\n", - "Cbc0010I After 12385000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1018.23 seconds)\n", - "Cbc0010I After 12386000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1018.30 seconds)\n", - "Cbc0010I After 12387000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1018.36 seconds)\n", - "Cbc0010I After 12388000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1018.42 seconds)\n", - "Cbc0010I After 12389000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1018.48 seconds)\n", - "Cbc0010I After 12390000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.54 seconds)\n", - "Cbc0010I After 12391000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.59 seconds)\n", - "Cbc0010I After 12392000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1018.66 seconds)\n", - "Cbc0010I After 12393000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1018.72 seconds)\n", - "Cbc0010I After 12394000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1018.80 seconds)\n", - "Cbc0010I After 12395000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1018.86 seconds)\n", - "Cbc0010I After 12396000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1018.92 seconds)\n", - "Cbc0010I After 12397000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1018.99 seconds)\n", - "Cbc0010I After 12398000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1019.05 seconds)\n", - "Cbc0010I After 12399000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1019.11 seconds)\n", - "Cbc0010I After 12400000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1019.18 seconds)\n", - "Cbc0010I After 12401000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1019.24 seconds)\n", - "Cbc0010I After 12402000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1019.31 seconds)\n", - "Cbc0010I After 12403000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1019.37 seconds)\n", - "Cbc0010I After 12404000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1019.43 seconds)\n", - "Cbc0010I After 12405000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1019.49 seconds)\n", - "Cbc0010I After 12406000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1019.56 seconds)\n", - "Cbc0010I After 12407000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1019.62 seconds)\n", - "Cbc0010I After 12408000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1019.68 seconds)\n", - "Cbc0010I After 12409000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1019.75 seconds)\n", - "Cbc0010I After 12410000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1019.81 seconds)\n", - "Cbc0010I After 12411000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1019.87 seconds)\n", - "Cbc0010I After 12412000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1019.93 seconds)\n", - "Cbc0010I After 12413000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1019.99 seconds)\n", - "Cbc0010I After 12414000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1020.06 seconds)\n", - "Cbc0010I After 12415000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1020.12 seconds)\n", - "Cbc0010I After 12416000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1020.18 seconds)\n", - "Cbc0010I After 12417000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1020.25 seconds)\n", - "Cbc0010I After 12418000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1020.30 seconds)\n", - "Cbc0010I After 12419000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.37 seconds)\n", - "Cbc0010I After 12420000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1020.42 seconds)\n", - "Cbc0010I After 12421000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1020.49 seconds)\n", - "Cbc0010I After 12422000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1020.56 seconds)\n", - "Cbc0010I After 12423000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.63 seconds)\n", - "Cbc0010I After 12424000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1020.69 seconds)\n", - "Cbc0010I After 12425000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1020.75 seconds)\n", - "Cbc0010I After 12426000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1020.81 seconds)\n", - "Cbc0010I After 12427000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1020.87 seconds)\n", - "Cbc0010I After 12428000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1020.94 seconds)\n", - "Cbc0010I After 12429000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1021.01 seconds)\n", - "Cbc0010I After 12430000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1021.07 seconds)\n", - "Cbc0010I After 12431000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1021.13 seconds)\n", - "Cbc0010I After 12432000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.19 seconds)\n", - "Cbc0010I After 12433000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1021.25 seconds)\n", - "Cbc0010I After 12434000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1021.31 seconds)\n", - "Cbc0010I After 12435000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.37 seconds)\n", - "Cbc0010I After 12436000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1021.43 seconds)\n", - "Cbc0010I After 12437000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1021.49 seconds)\n", - "Cbc0010I After 12438000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1021.56 seconds)\n", - "Cbc0010I After 12439000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1021.62 seconds)\n", - "Cbc0010I After 12440000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1021.67 seconds)\n", - "Cbc0010I After 12441000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1021.73 seconds)\n", - "Cbc0010I After 12442000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1021.80 seconds)\n", - "Cbc0010I After 12443000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1021.85 seconds)\n", - "Cbc0010I After 12444000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1021.92 seconds)\n", - "Cbc0010I After 12445000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1021.97 seconds)\n", - "Cbc0010I After 12446000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1022.04 seconds)\n", - "Cbc0010I After 12447000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1022.10 seconds)\n", - "Cbc0010I After 12448000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1022.15 seconds)\n", - "Cbc0010I After 12449000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1022.22 seconds)\n", - "Cbc0010I After 12450000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1022.28 seconds)\n", - "Cbc0010I After 12451000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1022.33 seconds)\n", - "Cbc0010I After 12452000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1022.38 seconds)\n", - "Cbc0010I After 12453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1022.44 seconds)\n", - "Cbc0010I After 12454000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1022.49 seconds)\n", - "Cbc0010I After 12455000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1022.55 seconds)\n", - "Cbc0010I After 12456000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1022.61 seconds)\n", - "Cbc0010I After 12457000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1022.67 seconds)\n", - "Cbc0010I After 12458000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1022.73 seconds)\n", - "Cbc0010I After 12459000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1022.79 seconds)\n", - "Cbc0010I After 12460000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1022.85 seconds)\n", - "Cbc0010I After 12461000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1022.91 seconds)\n", - "Cbc0010I After 12462000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1022.97 seconds)\n", - "Cbc0010I After 12463000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1023.04 seconds)\n", - "Cbc0010I After 12464000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.10 seconds)\n", - "Cbc0010I After 12465000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1023.16 seconds)\n", - "Cbc0010I After 12466000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.21 seconds)\n", - "Cbc0010I After 12467000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.28 seconds)\n", - "Cbc0010I After 12468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1023.34 seconds)\n", - "Cbc0010I After 12469000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1023.41 seconds)\n", - "Cbc0010I After 12470000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1023.46 seconds)\n", - "Cbc0010I After 12471000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1023.51 seconds)\n", - "Cbc0010I After 12472000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.57 seconds)\n", - "Cbc0010I After 12473000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.63 seconds)\n", - "Cbc0010I After 12474000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.69 seconds)\n", - "Cbc0010I After 12475000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1023.75 seconds)\n", - "Cbc0010I After 12476000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1023.81 seconds)\n", - "Cbc0010I After 12477000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1023.87 seconds)\n", - "Cbc0010I After 12478000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1023.94 seconds)\n", - "Cbc0010I After 12479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1024.00 seconds)\n", - "Cbc0010I After 12480000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1024.06 seconds)\n", - "Cbc0010I After 12481000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1024.12 seconds)\n", - "Cbc0010I After 12482000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.18 seconds)\n", - "Cbc0010I After 12483000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1024.23 seconds)\n", - "Cbc0010I After 12484000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1024.30 seconds)\n", - "Cbc0010I After 12485000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1024.36 seconds)\n", - "Cbc0010I After 12486000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1024.43 seconds)\n", - "Cbc0010I After 12487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1024.49 seconds)\n", - "Cbc0010I After 12488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1024.54 seconds)\n", - "Cbc0010I After 12489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.60 seconds)\n", - "Cbc0010I After 12490000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1024.66 seconds)\n", - "Cbc0010I After 12491000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1024.71 seconds)\n", - "Cbc0010I After 12492000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.76 seconds)\n", - "Cbc0010I After 12493000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1024.81 seconds)\n", - "Cbc0010I After 12494000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1024.86 seconds)\n", - "Cbc0010I After 12495000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1024.91 seconds)\n", - "Cbc0010I After 12496000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1024.96 seconds)\n", - "Cbc0010I After 12497000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1025.02 seconds)\n", - "Cbc0010I After 12498000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1025.07 seconds)\n", - "Cbc0010I After 12499000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1025.13 seconds)\n", - "Cbc0010I After 12500000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1025.19 seconds)\n", - "Cbc0010I After 12501000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1025.25 seconds)\n", - "Cbc0010I After 12502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1025.30 seconds)\n", - "Cbc0010I After 12503000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1025.34 seconds)\n", - "Cbc0010I After 12504000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1025.39 seconds)\n", - "Cbc0010I After 12505000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1025.42 seconds)\n", - "Cbc0010I After 12506000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1025.46 seconds)\n", - "Cbc0010I After 12507000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1025.50 seconds)\n", - "Cbc0010I After 12508000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1025.53 seconds)\n", - "Cbc0010I After 12509000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1025.58 seconds)\n", - "Cbc0010I After 12510000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1025.64 seconds)\n", - "Cbc0010I After 12511000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1025.70 seconds)\n", - "Cbc0010I After 12512000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1025.73 seconds)\n", - "Cbc0010I After 12513000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1025.76 seconds)\n", - "Cbc0010I After 12514000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1025.79 seconds)\n", - "Cbc0010I After 12515000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1025.82 seconds)\n", - "Cbc0010I After 12516000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1025.85 seconds)\n", - "Cbc0010I After 12517000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1025.88 seconds)\n", - "Cbc0010I After 12518000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1025.93 seconds)\n", - "Cbc0010I After 12519000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1025.96 seconds)\n", - "Cbc0010I After 12520000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1026.00 seconds)\n", - "Cbc0010I After 12521000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1026.03 seconds)\n", - "Cbc0010I After 12522000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1026.10 seconds)\n", - "Cbc0010I After 12523000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1026.18 seconds)\n", - "Cbc0010I After 12524000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1026.24 seconds)\n", - "Cbc0010I After 12525000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1026.30 seconds)\n", - "Cbc0010I After 12526000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1026.36 seconds)\n", - "Cbc0010I After 12527000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1026.41 seconds)\n", - "Cbc0010I After 12528000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1026.46 seconds)\n", - "Cbc0010I After 12529000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1026.49 seconds)\n", - "Cbc0010I After 12530000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1026.53 seconds)\n", - "Cbc0010I After 12531000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1026.56 seconds)\n", - "Cbc0010I After 12532000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1026.59 seconds)\n", - "Cbc0010I After 12533000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1026.62 seconds)\n", - "Cbc0010I After 12534000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1026.65 seconds)\n", - "Cbc0010I After 12535000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1026.69 seconds)\n", - "Cbc0010I After 12536000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1026.75 seconds)\n", - "Cbc0010I After 12537000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1026.80 seconds)\n", - "Cbc0010I After 12538000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1026.85 seconds)\n", - "Cbc0010I After 12539000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1026.88 seconds)\n", - "Cbc0010I After 12540000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1026.91 seconds)\n", - "Cbc0010I After 12541000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1026.95 seconds)\n", - "Cbc0010I After 12542000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1026.98 seconds)\n", - "Cbc0010I After 12543000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1027.03 seconds)\n", - "Cbc0010I After 12544000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1027.08 seconds)\n", - "Cbc0010I After 12545000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1027.13 seconds)\n", - "Cbc0010I After 12546000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.18 seconds)\n", - "Cbc0010I After 12547000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1027.24 seconds)\n", - "Cbc0010I After 12548000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1027.28 seconds)\n", - "Cbc0010I After 12549000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1027.32 seconds)\n", - "Cbc0010I After 12550000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1027.36 seconds)\n", - "Cbc0010I After 12551000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1027.40 seconds)\n", - "Cbc0010I After 12552000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1027.46 seconds)\n", - "Cbc0010I After 12553000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1027.51 seconds)\n", - "Cbc0010I After 12554000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.57 seconds)\n", - "Cbc0010I After 12555000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1027.62 seconds)\n", - "Cbc0010I After 12556000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1027.65 seconds)\n", - "Cbc0010I After 12557000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1027.69 seconds)\n", - "Cbc0010I After 12558000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1027.74 seconds)\n", - "Cbc0010I After 12559000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1027.78 seconds)\n", - "Cbc0010I After 12560000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1027.84 seconds)\n", - "Cbc0010I After 12561000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1027.89 seconds)\n", - "Cbc0010I After 12562000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1027.94 seconds)\n", - "Cbc0010I After 12563000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1028.00 seconds)\n", - "Cbc0010I After 12564000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1028.06 seconds)\n", - "Cbc0010I After 12565000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1028.11 seconds)\n", - "Cbc0010I After 12566000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1028.15 seconds)\n", - "Cbc0010I After 12567000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1028.20 seconds)\n", - "Cbc0010I After 12568000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1028.26 seconds)\n", - "Cbc0010I After 12569000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1028.31 seconds)\n", - "Cbc0010I After 12570000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1028.36 seconds)\n", - "Cbc0010I After 12571000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1028.42 seconds)\n", - "Cbc0010I After 12572000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1028.47 seconds)\n", - "Cbc0010I After 12573000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1028.52 seconds)\n", - "Cbc0010I After 12574000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1028.57 seconds)\n", - "Cbc0010I After 12575000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1028.62 seconds)\n", - "Cbc0010I After 12576000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1028.67 seconds)\n", - "Cbc0010I After 12577000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1028.93 seconds)\n", - "Cbc0010I After 12578000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1028.98 seconds)\n", - "Cbc0010I After 12579000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1029.03 seconds)\n", - "Cbc0010I After 12580000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1029.09 seconds)\n", - "Cbc0010I After 12581000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1029.14 seconds)\n", - "Cbc0010I After 12582000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1029.18 seconds)\n", - "Cbc0010I After 12583000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1029.23 seconds)\n", - "Cbc0010I After 12584000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1029.28 seconds)\n", - "Cbc0010I After 12585000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1029.33 seconds)\n", - "Cbc0010I After 12586000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1029.38 seconds)\n", - "Cbc0010I After 12587000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1029.43 seconds)\n", - "Cbc0010I After 12588000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1029.49 seconds)\n", - "Cbc0010I After 12589000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1029.54 seconds)\n", - "Cbc0010I After 12590000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1029.58 seconds)\n", - "Cbc0010I After 12591000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1029.63 seconds)\n", - "Cbc0010I After 12592000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1029.69 seconds)\n", - "Cbc0010I After 12593000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1029.74 seconds)\n", - "Cbc0010I After 12594000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1029.79 seconds)\n", - "Cbc0010I After 12595000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1029.84 seconds)\n", - "Cbc0010I After 12596000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1029.89 seconds)\n", - "Cbc0010I After 12597000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1029.94 seconds)\n", - "Cbc0010I After 12598000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1030.00 seconds)\n", - "Cbc0010I After 12599000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1030.04 seconds)\n", - "Cbc0010I After 12600000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1030.10 seconds)\n", - "Cbc0010I After 12601000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1030.14 seconds)\n", - "Cbc0010I After 12602000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1030.17 seconds)\n", - "Cbc0010I After 12603000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1030.24 seconds)\n", - "Cbc0010I After 12604000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1030.29 seconds)\n", - "Cbc0010I After 12605000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1030.36 seconds)\n", - "Cbc0010I After 12606000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.40 seconds)\n", - "Cbc0010I After 12607000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.46 seconds)\n", - "Cbc0010I After 12608000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1030.50 seconds)\n", - "Cbc0010I After 12609000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1030.57 seconds)\n", - "Cbc0010I After 12610000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1030.61 seconds)\n", - "Cbc0010I After 12611000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1030.66 seconds)\n", - "Cbc0010I After 12612000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1030.71 seconds)\n", - "Cbc0010I After 12613000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1030.75 seconds)\n", - "Cbc0010I After 12614000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1030.79 seconds)\n", - "Cbc0010I After 12615000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1030.86 seconds)\n", - "Cbc0010I After 12616000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1030.90 seconds)\n", - "Cbc0010I After 12617000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1030.95 seconds)\n", - "Cbc0010I After 12618000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1031.01 seconds)\n", - "Cbc0010I After 12619000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1031.05 seconds)\n", - "Cbc0010I After 12620000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1031.11 seconds)\n", - "Cbc0010I After 12621000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1031.18 seconds)\n", - "Cbc0010I After 12622000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1031.22 seconds)\n", - "Cbc0010I After 12623000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1031.26 seconds)\n", - "Cbc0010I After 12624000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1031.30 seconds)\n", - "Cbc0010I After 12625000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1031.37 seconds)\n", - "Cbc0010I After 12626000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1031.41 seconds)\n", - "Cbc0010I After 12627000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1031.46 seconds)\n", - "Cbc0010I After 12628000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1031.52 seconds)\n", - "Cbc0010I After 12629000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1031.57 seconds)\n", - "Cbc0010I After 12630000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1031.62 seconds)\n", - "Cbc0010I After 12631000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1031.68 seconds)\n", - "Cbc0010I After 12632000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1031.73 seconds)\n", - "Cbc0010I After 12633000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1031.78 seconds)\n", - "Cbc0010I After 12634000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1031.82 seconds)\n", - "Cbc0010I After 12635000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1031.89 seconds)\n", - "Cbc0010I After 12636000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1031.94 seconds)\n", - "Cbc0010I After 12637000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1031.97 seconds)\n", - "Cbc0010I After 12638000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1032.05 seconds)\n", - "Cbc0010I After 12639000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1032.10 seconds)\n", - "Cbc0010I After 12640000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1032.14 seconds)\n", - "Cbc0010I After 12641000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1032.19 seconds)\n", - "Cbc0010I After 12642000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.25 seconds)\n", - "Cbc0010I After 12643000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1032.30 seconds)\n", - "Cbc0010I After 12644000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1032.34 seconds)\n", - "Cbc0010I After 12645000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.41 seconds)\n", - "Cbc0010I After 12646000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.47 seconds)\n", - "Cbc0010I After 12647000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1032.51 seconds)\n", - "Cbc0010I After 12648000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1032.56 seconds)\n", - "Cbc0010I After 12649000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1032.62 seconds)\n", - "Cbc0010I After 12650000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1032.68 seconds)\n", - "Cbc0010I After 12651000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1032.73 seconds)\n", - "Cbc0010I After 12652000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1032.77 seconds)\n", - "Cbc0010I After 12653000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1032.83 seconds)\n", - "Cbc0010I After 12654000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.89 seconds)\n", - "Cbc0010I After 12655000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1032.92 seconds)\n", - "Cbc0010I After 12656000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1032.96 seconds)\n", - "Cbc0010I After 12657000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1033.00 seconds)\n", - "Cbc0010I After 12658000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.05 seconds)\n", - "Cbc0010I After 12659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1033.12 seconds)\n", - "Cbc0010I After 12660000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1033.16 seconds)\n", - "Cbc0010I After 12661000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1033.21 seconds)\n", - "Cbc0010I After 12662000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.25 seconds)\n", - "Cbc0010I After 12663000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1033.31 seconds)\n", - "Cbc0010I After 12664000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.38 seconds)\n", - "Cbc0010I After 12665000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1033.42 seconds)\n", - "Cbc0010I After 12666000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1033.46 seconds)\n", - "Cbc0010I After 12667000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1033.52 seconds)\n", - "Cbc0010I After 12668000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1033.58 seconds)\n", - "Cbc0010I After 12669000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1033.63 seconds)\n", - "Cbc0010I After 12670000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1033.67 seconds)\n", - "Cbc0010I After 12671000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1033.72 seconds)\n", - "Cbc0010I After 12672000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1033.78 seconds)\n", - "Cbc0010I After 12673000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1033.84 seconds)\n", - "Cbc0010I After 12674000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1033.88 seconds)\n", - "Cbc0010I After 12675000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1033.91 seconds)\n", - "Cbc0010I After 12676000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1033.95 seconds)\n", - "Cbc0010I After 12677000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1033.99 seconds)\n", - "Cbc0010I After 12678000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1034.04 seconds)\n", - "Cbc0010I After 12679000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1034.11 seconds)\n", - "Cbc0010I After 12680000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1034.15 seconds)\n", - "Cbc0010I After 12681000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1034.19 seconds)\n", - "Cbc0010I After 12682000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1034.23 seconds)\n", - "Cbc0010I After 12683000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1034.28 seconds)\n", - "Cbc0010I After 12684000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.36 seconds)\n", - "Cbc0010I After 12685000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1034.42 seconds)\n", - "Cbc0010I After 12686000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1034.46 seconds)\n", - "Cbc0010I After 12687000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1034.50 seconds)\n", - "Cbc0010I After 12688000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1034.55 seconds)\n", - "Cbc0010I After 12689000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1034.62 seconds)\n", - "Cbc0010I After 12690000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1034.68 seconds)\n", - "Cbc0010I After 12691000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1034.72 seconds)\n", - "Cbc0010I After 12692000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.76 seconds)\n", - "Cbc0010I After 12693000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1034.80 seconds)\n", - "Cbc0010I After 12694000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1034.88 seconds)\n", - "Cbc0010I After 12695000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1034.94 seconds)\n", - "Cbc0010I After 12696000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1034.98 seconds)\n", - "Cbc0010I After 12697000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1035.02 seconds)\n", - "Cbc0010I After 12698000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1035.06 seconds)\n", - "Cbc0010I After 12699000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1035.12 seconds)\n", - "Cbc0010I After 12700000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1035.19 seconds)\n", - "Cbc0010I After 12701000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1035.25 seconds)\n", - "Cbc0010I After 12702000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1035.28 seconds)\n", - "Cbc0010I After 12703000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1035.32 seconds)\n", - "Cbc0010I After 12704000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1035.36 seconds)\n", - "Cbc0010I After 12705000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1035.44 seconds)\n", - "Cbc0010I After 12706000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1035.50 seconds)\n", - "Cbc0010I After 12707000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1035.54 seconds)\n", - "Cbc0010I After 12708000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1035.58 seconds)\n", - "Cbc0010I After 12709000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1035.63 seconds)\n", - "Cbc0010I After 12710000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1035.69 seconds)\n", - "Cbc0010I After 12711000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1035.77 seconds)\n", - "Cbc0010I After 12712000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1035.84 seconds)\n", - "Cbc0010I After 12713000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1035.90 seconds)\n", - "Cbc0010I After 12714000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1035.95 seconds)\n", - "Cbc0010I After 12715000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1036.00 seconds)\n", - "Cbc0010I After 12716000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1036.07 seconds)\n", - "Cbc0010I After 12717000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1036.14 seconds)\n", - "Cbc0010I After 12718000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1036.19 seconds)\n", - "Cbc0010I After 12719000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1036.26 seconds)\n", - "Cbc0010I After 12720000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1036.32 seconds)\n", - "Cbc0010I After 12721000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1036.36 seconds)\n", - "Cbc0010I After 12722000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1036.41 seconds)\n", - "Cbc0010I After 12723000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1036.45 seconds)\n", - "Cbc0010I After 12724000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1036.48 seconds)\n", - "Cbc0010I After 12725000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1036.51 seconds)\n", - "Cbc0010I After 12726000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1036.55 seconds)\n", - "Cbc0010I After 12727000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1036.58 seconds)\n", - "Cbc0010I After 12728000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1036.63 seconds)\n", - "Cbc0010I After 12729000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1036.68 seconds)\n", - "Cbc0010I After 12730000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1036.76 seconds)\n", - "Cbc0010I After 12731000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1036.84 seconds)\n", - "Cbc0010I After 12732000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1036.92 seconds)\n", - "Cbc0010I After 12733000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1036.99 seconds)\n", - "Cbc0010I After 12734000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1037.12 seconds)\n", - "Cbc0010I After 12735000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1037.30 seconds)\n", - "Cbc0010I After 12736000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1037.41 seconds)\n", - "Cbc0010I After 12737000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1037.51 seconds)\n", - "Cbc0010I After 12738000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1037.59 seconds)\n", - "Cbc0010I After 12739000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1037.68 seconds)\n", - "Cbc0010I After 12740000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1037.77 seconds)\n", - "Cbc0010I After 12741000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1037.87 seconds)\n", - "Cbc0010I After 12742000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1037.95 seconds)\n", - "Cbc0010I After 12743000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1038.03 seconds)\n", - "Cbc0010I After 12744000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1038.09 seconds)\n", - "Cbc0010I After 12745000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1038.16 seconds)\n", - "Cbc0010I After 12746000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1038.21 seconds)\n", - "Cbc0010I After 12747000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1038.30 seconds)\n", - "Cbc0010I After 12748000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1038.35 seconds)\n", - "Cbc0010I After 12749000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1038.43 seconds)\n", - "Cbc0010I After 12750000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1038.49 seconds)\n", - "Cbc0010I After 12751000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1038.56 seconds)\n", - "Cbc0010I After 12752000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1038.62 seconds)\n", - "Cbc0010I After 12753000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1038.68 seconds)\n", - "Cbc0010I After 12754000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1038.75 seconds)\n", - "Cbc0010I After 12755000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1038.81 seconds)\n", - "Cbc0010I After 12756000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1038.88 seconds)\n", - "Cbc0010I After 12757000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1038.93 seconds)\n", - "Cbc0010I After 12758000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1039.00 seconds)\n", - "Cbc0010I After 12759000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1039.08 seconds)\n", - "Cbc0010I After 12760000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1039.14 seconds)\n", - "Cbc0010I After 12761000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1039.20 seconds)\n", - "Cbc0010I After 12762000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1039.26 seconds)\n", - "Cbc0010I After 12763000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1039.33 seconds)\n", - "Cbc0010I After 12764000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1039.39 seconds)\n", - "Cbc0010I After 12765000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1039.47 seconds)\n", - "Cbc0010I After 12766000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1039.53 seconds)\n", - "Cbc0010I After 12767000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1039.60 seconds)\n", - "Cbc0010I After 12768000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1039.66 seconds)\n", - "Cbc0010I After 12769000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1039.73 seconds)\n", - "Cbc0010I After 12770000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1039.80 seconds)\n", - "Cbc0010I After 12771000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1039.87 seconds)\n", - "Cbc0010I After 12772000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1039.92 seconds)\n", - "Cbc0010I After 12773000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.00 seconds)\n", - "Cbc0010I After 12774000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1040.05 seconds)\n", - "Cbc0010I After 12775000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.12 seconds)\n", - "Cbc0010I After 12776000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1040.19 seconds)\n", - "Cbc0010I After 12777000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.26 seconds)\n", - "Cbc0010I After 12778000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1040.31 seconds)\n", - "Cbc0010I After 12779000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1040.38 seconds)\n", - "Cbc0010I After 12780000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1040.43 seconds)\n", - "Cbc0010I After 12781000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1040.49 seconds)\n", - "Cbc0010I After 12782000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1040.54 seconds)\n", - "Cbc0010I After 12783000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1040.59 seconds)\n", - "Cbc0010I After 12784000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1040.65 seconds)\n", - "Cbc0010I After 12785000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1040.72 seconds)\n", - "Cbc0010I After 12786000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.76 seconds)\n", - "Cbc0010I After 12787000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1040.83 seconds)\n", - "Cbc0010I After 12788000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1040.89 seconds)\n", - "Cbc0010I After 12789000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1040.96 seconds)\n", - "Cbc0010I After 12790000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1041.02 seconds)\n", - "Cbc0010I After 12791000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1041.07 seconds)\n", - "Cbc0010I After 12792000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1041.13 seconds)\n", - "Cbc0010I After 12793000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.19 seconds)\n", - "Cbc0010I After 12794000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1041.26 seconds)\n", - "Cbc0010I After 12795000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1041.32 seconds)\n", - "Cbc0010I After 12796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.39 seconds)\n", - "Cbc0010I After 12797000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.45 seconds)\n", - "Cbc0010I After 12798000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1041.50 seconds)\n", - "Cbc0010I After 12799000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1041.55 seconds)\n", - "Cbc0010I After 12800000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.62 seconds)\n", - "Cbc0010I After 12801000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.68 seconds)\n", - "Cbc0010I After 12802000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1041.74 seconds)\n", - "Cbc0010I After 12803000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1041.82 seconds)\n", - "Cbc0010I After 12804000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1041.88 seconds)\n", - "Cbc0010I After 12805000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1041.96 seconds)\n", - "Cbc0010I After 12806000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.02 seconds)\n", - "Cbc0010I After 12807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.08 seconds)\n", - "Cbc0010I After 12808000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1042.14 seconds)\n", - "Cbc0010I After 12809000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1042.21 seconds)\n", - "Cbc0010I After 12810000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1042.26 seconds)\n", - "Cbc0010I After 12811000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1042.37 seconds)\n", - "Cbc0010I After 12812000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1042.45 seconds)\n", - "Cbc0010I After 12813000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1042.51 seconds)\n", - "Cbc0010I After 12814000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1042.57 seconds)\n", - "Cbc0010I After 12815000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1042.63 seconds)\n", - "Cbc0010I After 12816000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1042.68 seconds)\n", - "Cbc0010I After 12817000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1042.74 seconds)\n", - "Cbc0010I After 12818000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1042.80 seconds)\n", - "Cbc0010I After 12819000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1042.86 seconds)\n", - "Cbc0010I After 12820000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1042.93 seconds)\n", - "Cbc0010I After 12821000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1043.00 seconds)\n", - "Cbc0010I After 12822000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1043.05 seconds)\n", - "Cbc0010I After 12823000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1043.12 seconds)\n", - "Cbc0010I After 12824000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1043.18 seconds)\n", - "Cbc0010I After 12825000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1043.24 seconds)\n", - "Cbc0010I After 12826000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1043.29 seconds)\n", - "Cbc0010I After 12827000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1043.35 seconds)\n", - "Cbc0010I After 12828000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1043.41 seconds)\n", - "Cbc0010I After 12829000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1043.48 seconds)\n", - "Cbc0010I After 12830000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1043.54 seconds)\n", - "Cbc0010I After 12831000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1043.61 seconds)\n", - "Cbc0010I After 12832000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1043.68 seconds)\n", - "Cbc0010I After 12833000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1043.75 seconds)\n", - "Cbc0010I After 12834000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1043.81 seconds)\n", - "Cbc0010I After 12835000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1043.86 seconds)\n", - "Cbc0010I After 12836000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1043.93 seconds)\n", - "Cbc0010I After 12837000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1043.99 seconds)\n", - "Cbc0010I After 12838000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1044.06 seconds)\n", - "Cbc0010I After 12839000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.12 seconds)\n", - "Cbc0010I After 12840000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.19 seconds)\n", - "Cbc0010I After 12841000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.26 seconds)\n", - "Cbc0010I After 12842000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1044.32 seconds)\n", - "Cbc0010I After 12843000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1044.38 seconds)\n", - "Cbc0010I After 12844000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.44 seconds)\n", - "Cbc0010I After 12845000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.50 seconds)\n", - "Cbc0010I After 12846000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1044.56 seconds)\n", - "Cbc0010I After 12847000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1044.62 seconds)\n", - "Cbc0010I After 12848000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.68 seconds)\n", - "Cbc0010I After 12849000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1044.74 seconds)\n", - "Cbc0010I After 12850000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1044.80 seconds)\n", - "Cbc0010I After 12851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1044.86 seconds)\n", - "Cbc0010I After 12852000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1044.92 seconds)\n", - "Cbc0010I After 12853000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1044.98 seconds)\n", - "Cbc0010I After 12854000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.06 seconds)\n", - "Cbc0010I After 12855000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.12 seconds)\n", - "Cbc0010I After 12856000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1045.18 seconds)\n", - "Cbc0010I After 12857000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1045.24 seconds)\n", - "Cbc0010I After 12858000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1045.29 seconds)\n", - "Cbc0010I After 12859000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.36 seconds)\n", - "Cbc0010I After 12860000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1045.43 seconds)\n", - "Cbc0010I After 12861000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1045.48 seconds)\n", - "Cbc0010I After 12862000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1045.53 seconds)\n", - "Cbc0010I After 12863000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1045.59 seconds)\n", - "Cbc0010I After 12864000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1045.64 seconds)\n", - "Cbc0010I After 12865000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1045.68 seconds)\n", - "Cbc0010I After 12866000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1045.73 seconds)\n", - "Cbc0010I After 12867000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1045.77 seconds)\n", - "Cbc0010I After 12868000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1045.81 seconds)\n", - "Cbc0010I After 12869000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1045.84 seconds)\n", - "Cbc0010I After 12870000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1045.89 seconds)\n", - "Cbc0010I After 12871000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1045.92 seconds)\n", - "Cbc0010I After 12872000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1045.98 seconds)\n", - "Cbc0010I After 12873000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1046.02 seconds)\n", - "Cbc0010I After 12874000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1046.05 seconds)\n", - "Cbc0010I After 12875000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1046.09 seconds)\n", - "Cbc0010I After 12876000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1046.13 seconds)\n", - "Cbc0010I After 12877000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1046.19 seconds)\n", - "Cbc0010I After 12878000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1046.25 seconds)\n", - "Cbc0010I After 12879000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1046.30 seconds)\n", - "Cbc0010I After 12880000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1046.36 seconds)\n", - "Cbc0010I After 12881000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1046.40 seconds)\n", - "Cbc0010I After 12882000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1046.43 seconds)\n", - "Cbc0010I After 12883000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1046.46 seconds)\n", - "Cbc0010I After 12884000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1046.49 seconds)\n", - "Cbc0010I After 12885000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1046.53 seconds)\n", - "Cbc0010I After 12886000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1046.56 seconds)\n", - "Cbc0010I After 12887000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1046.60 seconds)\n", - "Cbc0010I After 12888000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1046.66 seconds)\n", - "Cbc0010I After 12889000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1046.72 seconds)\n", - "Cbc0010I After 12890000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1046.76 seconds)\n", - "Cbc0010I After 12891000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1046.80 seconds)\n", - "Cbc0010I After 12892000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1046.84 seconds)\n", - "Cbc0010I After 12893000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1046.88 seconds)\n", - "Cbc0010I After 12894000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1046.93 seconds)\n", - "Cbc0010I After 12895000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1046.99 seconds)\n", - "Cbc0010I After 12896000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1047.05 seconds)\n", - "Cbc0010I After 12897000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1047.12 seconds)\n", - "Cbc0010I After 12898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1047.16 seconds)\n", - "Cbc0010I After 12899000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1047.19 seconds)\n", - "Cbc0010I After 12900000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1047.24 seconds)\n", - "Cbc0010I After 12901000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1047.30 seconds)\n", - "Cbc0010I After 12902000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1047.33 seconds)\n", - "Cbc0010I After 12903000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1047.39 seconds)\n", - "Cbc0010I After 12904000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1047.45 seconds)\n", - "Cbc0010I After 12905000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1047.48 seconds)\n", - "Cbc0010I After 12906000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1047.52 seconds)\n", - "Cbc0010I After 12907000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1047.56 seconds)\n", - "Cbc0010I After 12908000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1047.60 seconds)\n", - "Cbc0010I After 12909000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1047.65 seconds)\n", - "Cbc0010I After 12910000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1047.68 seconds)\n", - "Cbc0010I After 12911000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1047.73 seconds)\n", - "Cbc0010I After 12912000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1047.77 seconds)\n", - "Cbc0010I After 12913000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1047.82 seconds)\n", - "Cbc0010I After 12914000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1047.87 seconds)\n", - "Cbc0010I After 12915000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1047.93 seconds)\n", - "Cbc0010I After 12916000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1047.97 seconds)\n", - "Cbc0010I After 12917000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1048.01 seconds)\n", - "Cbc0010I After 12918000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1048.05 seconds)\n", - "Cbc0010I After 12919000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1048.11 seconds)\n", - "Cbc0010I After 12920000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1048.16 seconds)\n", - "Cbc0010I After 12921000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1048.20 seconds)\n", - "Cbc0010I After 12922000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1048.24 seconds)\n", - "Cbc0010I After 12923000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1048.28 seconds)\n", - "Cbc0010I After 12924000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1048.35 seconds)\n", - "Cbc0010I After 12925000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1048.40 seconds)\n", - "Cbc0010I After 12926000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1048.44 seconds)\n", - "Cbc0010I After 12927000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1048.50 seconds)\n", - "Cbc0010I After 12928000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1048.55 seconds)\n", - "Cbc0010I After 12929000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1048.60 seconds)\n", - "Cbc0010I After 12930000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1048.66 seconds)\n", - "Cbc0010I After 12931000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1048.71 seconds)\n", - "Cbc0010I After 12932000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1048.76 seconds)\n", - "Cbc0010I After 12933000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1048.82 seconds)\n", - "Cbc0010I After 12934000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1048.87 seconds)\n", - "Cbc0010I After 12935000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1048.92 seconds)\n", - "Cbc0010I After 12936000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1048.97 seconds)\n", - "Cbc0010I After 12937000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1049.03 seconds)\n", - "Cbc0010I After 12938000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1049.09 seconds)\n", - "Cbc0010I After 12939000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1049.15 seconds)\n", - "Cbc0010I After 12940000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1049.20 seconds)\n", - "Cbc0010I After 12941000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1049.25 seconds)\n", - "Cbc0010I After 12942000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1049.30 seconds)\n", - "Cbc0010I After 12943000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1049.34 seconds)\n", - "Cbc0010I After 12944000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1049.39 seconds)\n", - "Cbc0010I After 12945000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1049.45 seconds)\n", - "Cbc0010I After 12946000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1049.51 seconds)\n", - "Cbc0010I After 12947000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1049.56 seconds)\n", - "Cbc0010I After 12948000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1049.61 seconds)\n", - "Cbc0010I After 12949000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1049.66 seconds)\n", - "Cbc0010I After 12950000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1049.72 seconds)\n", - "Cbc0010I After 12951000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1049.78 seconds)\n", - "Cbc0010I After 12952000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1049.82 seconds)\n", - "Cbc0010I After 12953000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1049.88 seconds)\n", - "Cbc0010I After 12954000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1049.92 seconds)\n", - "Cbc0010I After 12955000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1049.98 seconds)\n", - "Cbc0010I After 12956000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1050.03 seconds)\n", - "Cbc0010I After 12957000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.08 seconds)\n", - "Cbc0010I After 12958000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1050.13 seconds)\n", - "Cbc0010I After 12959000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.18 seconds)\n", - "Cbc0010I After 12960000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.24 seconds)\n", - "Cbc0010I After 12961000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1050.29 seconds)\n", - "Cbc0010I After 12962000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1050.35 seconds)\n", - "Cbc0010I After 12963000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1050.40 seconds)\n", - "Cbc0010I After 12964000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1050.45 seconds)\n", - "Cbc0010I After 12965000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.50 seconds)\n", - "Cbc0010I After 12966000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1050.55 seconds)\n", - "Cbc0010I After 12967000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1050.60 seconds)\n", - "Cbc0010I After 12968000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1050.65 seconds)\n", - "Cbc0010I After 12969000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.69 seconds)\n", - "Cbc0010I After 12970000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1050.75 seconds)\n", - "Cbc0010I After 12971000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1050.80 seconds)\n", - "Cbc0010I After 12972000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1050.84 seconds)\n", - "Cbc0010I After 12973000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1050.91 seconds)\n", - "Cbc0010I After 12974000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1050.97 seconds)\n", - "Cbc0010I After 12975000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1051.02 seconds)\n", - "Cbc0010I After 12976000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1051.10 seconds)\n", - "Cbc0010I After 12977000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1051.14 seconds)\n", - "Cbc0010I After 12978000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1051.19 seconds)\n", - "Cbc0010I After 12979000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1051.26 seconds)\n", - "Cbc0010I After 12980000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1051.31 seconds)\n", - "Cbc0010I After 12981000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1051.35 seconds)\n", - "Cbc0010I After 12982000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1051.40 seconds)\n", - "Cbc0010I After 12983000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1051.46 seconds)\n", - "Cbc0010I After 12984000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1051.50 seconds)\n", - "Cbc0010I After 12985000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1051.55 seconds)\n", - "Cbc0010I After 12986000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1051.62 seconds)\n", - "Cbc0010I After 12987000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1051.66 seconds)\n", - "Cbc0010I After 12988000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1051.70 seconds)\n", - "Cbc0010I After 12989000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1051.78 seconds)\n", - "Cbc0010I After 12990000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1051.83 seconds)\n", - "Cbc0010I After 12991000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1051.87 seconds)\n", - "Cbc0010I After 12992000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1051.93 seconds)\n", - "Cbc0010I After 12993000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1052.00 seconds)\n", - "Cbc0010I After 12994000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1052.05 seconds)\n", - "Cbc0010I After 12995000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1052.10 seconds)\n", - "Cbc0010I After 12996000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1052.15 seconds)\n", - "Cbc0010I After 12997000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1052.22 seconds)\n", - "Cbc0010I After 12998000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1052.26 seconds)\n", - "Cbc0010I After 12999000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1052.31 seconds)\n", - "Cbc0010I After 13000000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1052.35 seconds)\n", - "Cbc0010I After 13001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1052.42 seconds)\n", - "Cbc0010I After 13002000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1052.47 seconds)\n", - "Cbc0010I After 13003000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1052.51 seconds)\n", - "Cbc0010I After 13004000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1052.58 seconds)\n", - "Cbc0010I After 13005000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1052.63 seconds)\n", - "Cbc0010I After 13006000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1052.68 seconds)\n", - "Cbc0010I After 13007000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1052.72 seconds)\n", - "Cbc0010I After 13008000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1052.79 seconds)\n", - "Cbc0010I After 13009000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1052.85 seconds)\n", - "Cbc0010I After 13010000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1052.89 seconds)\n", - "Cbc0010I After 13011000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1052.93 seconds)\n", - "Cbc0010I After 13012000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1052.99 seconds)\n", - "Cbc0010I After 13013000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1053.06 seconds)\n", - "Cbc0010I After 13014000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1053.11 seconds)\n", - "Cbc0010I After 13015000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1053.15 seconds)\n", - "Cbc0010I After 13016000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1053.21 seconds)\n", - "Cbc0010I After 13017000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1053.28 seconds)\n", - "Cbc0010I After 13018000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1053.33 seconds)\n", - "Cbc0010I After 13019000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1053.38 seconds)\n", - "Cbc0010I After 13020000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1053.42 seconds)\n", - "Cbc0010I After 13021000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1053.49 seconds)\n", - "Cbc0010I After 13022000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.55 seconds)\n", - "Cbc0010I After 13023000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1053.58 seconds)\n", - "Cbc0010I After 13024000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1053.61 seconds)\n", - "Cbc0010I After 13025000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.68 seconds)\n", - "Cbc0010I After 13026000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1053.74 seconds)\n", - "Cbc0010I After 13027000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1053.78 seconds)\n", - "Cbc0010I After 13028000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1053.82 seconds)\n", - "Cbc0010I After 13029000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1053.86 seconds)\n", - "Cbc0010I After 13030000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1053.93 seconds)\n", - "Cbc0010I After 13031000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1053.99 seconds)\n", - "Cbc0010I After 13032000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1054.03 seconds)\n", - "Cbc0010I After 13033000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1054.08 seconds)\n", - "Cbc0010I After 13034000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1054.12 seconds)\n", - "Cbc0010I After 13035000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1054.18 seconds)\n", - "Cbc0010I After 13036000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1054.24 seconds)\n", - "Cbc0010I After 13037000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1054.28 seconds)\n", - "Cbc0010I After 13038000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1054.32 seconds)\n", - "Cbc0010I After 13039000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1054.36 seconds)\n", - "Cbc0010I After 13040000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1054.42 seconds)\n", - "Cbc0010I After 13041000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1054.49 seconds)\n", - "Cbc0010I After 13042000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1054.54 seconds)\n", - "Cbc0010I After 13043000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1054.59 seconds)\n", - "Cbc0010I After 13044000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1054.63 seconds)\n", - "Cbc0010I After 13045000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1054.68 seconds)\n", - "Cbc0010I After 13046000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1054.75 seconds)\n", - "Cbc0010I After 13047000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1054.80 seconds)\n", - "Cbc0010I After 13048000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1054.84 seconds)\n", - "Cbc0010I After 13049000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1054.87 seconds)\n", - "Cbc0010I After 13050000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1054.91 seconds)\n", - "Cbc0010I After 13051000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1054.97 seconds)\n", - "Cbc0010I After 13052000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1055.04 seconds)\n", - "Cbc0010I After 13053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1055.08 seconds)\n", - "Cbc0010I After 13054000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1055.15 seconds)\n", - "Cbc0010I After 13055000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1055.20 seconds)\n", - "Cbc0010I After 13056000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1055.28 seconds)\n", - "Cbc0010I After 13057000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1055.34 seconds)\n", - "Cbc0010I After 13058000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1055.40 seconds)\n", - "Cbc0010I After 13059000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1055.47 seconds)\n", - "Cbc0010I After 13060000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1055.52 seconds)\n", - "Cbc0010I After 13061000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1055.59 seconds)\n", - "Cbc0010I After 13062000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1055.66 seconds)\n", - "Cbc0010I After 13063000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1055.71 seconds)\n", - "Cbc0010I After 13064000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1055.78 seconds)\n", - "Cbc0010I After 13065000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1055.84 seconds)\n", - "Cbc0010I After 13066000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1055.89 seconds)\n", - "Cbc0010I After 13067000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1055.97 seconds)\n", - "Cbc0010I After 13068000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1056.03 seconds)\n", - "Cbc0010I After 13069000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1056.09 seconds)\n", - "Cbc0010I After 13070000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1056.16 seconds)\n", - "Cbc0010I After 13071000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1056.21 seconds)\n", - "Cbc0010I After 13072000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1056.28 seconds)\n", - "Cbc0010I After 13073000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1056.35 seconds)\n", - "Cbc0010I After 13074000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1056.40 seconds)\n", - "Cbc0010I After 13075000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1056.47 seconds)\n", - "Cbc0010I After 13076000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1056.53 seconds)\n", - "Cbc0010I After 13077000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1056.59 seconds)\n", - "Cbc0010I After 13078000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1056.67 seconds)\n", - "Cbc0010I After 13079000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1056.72 seconds)\n", - "Cbc0010I After 13080000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1056.79 seconds)\n", - "Cbc0010I After 13081000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1056.86 seconds)\n", - "Cbc0010I After 13082000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1056.92 seconds)\n", - "Cbc0010I After 13083000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1056.98 seconds)\n", - "Cbc0010I After 13084000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1057.05 seconds)\n", - "Cbc0010I After 13085000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.12 seconds)\n", - "Cbc0010I After 13086000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1057.18 seconds)\n", - "Cbc0010I After 13087000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1057.24 seconds)\n", - "Cbc0010I After 13088000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1057.31 seconds)\n", - "Cbc0010I After 13089000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1057.38 seconds)\n", - "Cbc0010I After 13090000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.44 seconds)\n", - "Cbc0010I After 13091000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1057.50 seconds)\n", - "Cbc0010I After 13092000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1057.55 seconds)\n", - "Cbc0010I After 13093000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1057.60 seconds)\n", - "Cbc0010I After 13094000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1057.66 seconds)\n", - "Cbc0010I After 13095000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1057.73 seconds)\n", - "Cbc0010I After 13096000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1057.79 seconds)\n", - "Cbc0010I After 13097000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1057.87 seconds)\n", - "Cbc0010I After 13098000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1057.93 seconds)\n", - "Cbc0010I After 13099000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1057.99 seconds)\n", - "Cbc0010I After 13100000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1058.06 seconds)\n", - "Cbc0010I After 13101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1058.13 seconds)\n", - "Cbc0010I After 13102000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1058.18 seconds)\n", - "Cbc0010I After 13103000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1058.31 seconds)\n", - "Cbc0010I After 13104000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1058.37 seconds)\n", - "Cbc0010I After 13105000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1058.47 seconds)\n", - "Cbc0010I After 13106000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1058.54 seconds)\n", - "Cbc0010I After 13107000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1058.60 seconds)\n", - "Cbc0010I After 13108000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1058.67 seconds)\n", - "Cbc0010I After 13109000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1058.73 seconds)\n", - "Cbc0010I After 13110000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1058.78 seconds)\n", - "Cbc0010I After 13111000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1058.85 seconds)\n", - "Cbc0010I After 13112000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1058.91 seconds)\n", - "Cbc0010I After 13113000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1058.97 seconds)\n", - "Cbc0010I After 13114000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1059.03 seconds)\n", - "Cbc0010I After 13115000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1059.09 seconds)\n", - "Cbc0010I After 13116000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1059.15 seconds)\n", - "Cbc0010I After 13117000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.21 seconds)\n", - "Cbc0010I After 13118000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1059.27 seconds)\n", - "Cbc0010I After 13119000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1059.33 seconds)\n", - "Cbc0010I After 13120000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1059.40 seconds)\n", - "Cbc0010I After 13121000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1059.47 seconds)\n", - "Cbc0010I After 13122000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1059.53 seconds)\n", - "Cbc0010I After 13123000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1059.59 seconds)\n", - "Cbc0010I After 13124000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1059.64 seconds)\n", - "Cbc0010I After 13125000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1059.71 seconds)\n", - "Cbc0010I After 13126000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1059.76 seconds)\n", - "Cbc0010I After 13127000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1059.82 seconds)\n", - "Cbc0010I After 13128000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.88 seconds)\n", - "Cbc0010I After 13129000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1059.93 seconds)\n", - "Cbc0010I After 13130000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1060.00 seconds)\n", - "Cbc0010I After 13131000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.06 seconds)\n", - "Cbc0010I After 13132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1060.12 seconds)\n", - "Cbc0010I After 13133000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1060.19 seconds)\n", - "Cbc0010I After 13134000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1060.24 seconds)\n", - "Cbc0010I After 13135000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1060.30 seconds)\n", - "Cbc0010I After 13136000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1060.34 seconds)\n", - "Cbc0010I After 13137000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1060.40 seconds)\n", - "Cbc0010I After 13138000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1060.45 seconds)\n", - "Cbc0010I After 13139000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1060.51 seconds)\n", - "Cbc0010I After 13140000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1060.56 seconds)\n", - "Cbc0010I After 13141000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1060.62 seconds)\n", - "Cbc0010I After 13142000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.67 seconds)\n", - "Cbc0010I After 13143000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1060.72 seconds)\n", - "Cbc0010I After 13144000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1060.78 seconds)\n", - "Cbc0010I After 13145000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1060.84 seconds)\n", - "Cbc0010I After 13146000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1060.93 seconds)\n", - "Cbc0010I After 13147000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1060.99 seconds)\n", - "Cbc0010I After 13148000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1061.06 seconds)\n", - "Cbc0010I After 13149000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1061.12 seconds)\n", - "Cbc0010I After 13150000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1061.17 seconds)\n", - "Cbc0010I After 13151000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1061.24 seconds)\n", - "Cbc0010I After 13152000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1061.31 seconds)\n", - "Cbc0010I After 13153000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1061.37 seconds)\n", - "Cbc0010I After 13154000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1061.42 seconds)\n", - "Cbc0010I After 13155000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1061.49 seconds)\n", - "Cbc0010I After 13156000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1061.55 seconds)\n", - "Cbc0010I After 13157000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.61 seconds)\n", - "Cbc0010I After 13158000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1061.67 seconds)\n", - "Cbc0010I After 13159000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1061.72 seconds)\n", - "Cbc0010I After 13160000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.79 seconds)\n", - "Cbc0010I After 13161000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1061.85 seconds)\n", - "Cbc0010I After 13162000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1061.91 seconds)\n", - "Cbc0010I After 13163000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1061.97 seconds)\n", - "Cbc0010I After 13164000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1062.02 seconds)\n", - "Cbc0010I After 13165000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.07 seconds)\n", - "Cbc0010I After 13166000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1062.13 seconds)\n", - "Cbc0010I After 13167000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1062.19 seconds)\n", - "Cbc0010I After 13168000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1062.25 seconds)\n", - "Cbc0010I After 13169000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1062.31 seconds)\n", - "Cbc0010I After 13170000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1062.37 seconds)\n", - "Cbc0010I After 13171000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1062.43 seconds)\n", - "Cbc0010I After 13172000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.49 seconds)\n", - "Cbc0010I After 13173000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1062.54 seconds)\n", - "Cbc0010I After 13174000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1062.59 seconds)\n", - "Cbc0010I After 13175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1062.64 seconds)\n", - "Cbc0010I After 13176000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1062.70 seconds)\n", - "Cbc0010I After 13177000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1062.76 seconds)\n", - "Cbc0010I After 13178000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1062.82 seconds)\n", - "Cbc0010I After 13179000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1062.87 seconds)\n", - "Cbc0010I After 13180000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1062.92 seconds)\n", - "Cbc0010I After 13181000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1062.97 seconds)\n", - "Cbc0010I After 13182000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1063.02 seconds)\n", - "Cbc0010I After 13183000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1063.08 seconds)\n", - "Cbc0010I After 13184000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1063.13 seconds)\n", - "Cbc0010I After 13185000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1063.18 seconds)\n", - "Cbc0010I After 13186000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1063.24 seconds)\n", - "Cbc0010I After 13187000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1063.29 seconds)\n", - "Cbc0010I After 13188000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1063.36 seconds)\n", - "Cbc0010I After 13189000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1063.42 seconds)\n", - "Cbc0010I After 13190000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1063.47 seconds)\n", - "Cbc0010I After 13191000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.55 seconds)\n", - "Cbc0010I After 13192000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.62 seconds)\n", - "Cbc0010I After 13193000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.69 seconds)\n", - "Cbc0010I After 13194000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.74 seconds)\n", - "Cbc0010I After 13195000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1063.80 seconds)\n", - "Cbc0010I After 13196000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1063.85 seconds)\n", - "Cbc0010I After 13197000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1063.90 seconds)\n", - "Cbc0010I After 13198000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1063.95 seconds)\n", - "Cbc0010I After 13199000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1063.99 seconds)\n", - "Cbc0010I After 13200000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1064.03 seconds)\n", - "Cbc0010I After 13201000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1064.06 seconds)\n", - "Cbc0010I After 13202000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1064.09 seconds)\n", - "Cbc0010I After 13203000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1064.14 seconds)\n", - "Cbc0010I After 13204000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1064.17 seconds)\n", - "Cbc0010I After 13205000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1064.21 seconds)\n", - "Cbc0010I After 13206000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1064.25 seconds)\n", - "Cbc0010I After 13207000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1064.28 seconds)\n", - "Cbc0010I After 13208000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1064.33 seconds)\n", - "Cbc0010I After 13209000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1064.40 seconds)\n", - "Cbc0010I After 13210000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1064.45 seconds)\n", - "Cbc0010I After 13211000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1064.51 seconds)\n", - "Cbc0010I After 13212000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1064.57 seconds)\n", - "Cbc0010I After 13213000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1064.62 seconds)\n", - "Cbc0010I After 13214000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1064.69 seconds)\n", - "Cbc0010I After 13215000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1064.73 seconds)\n", - "Cbc0010I After 13216000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1064.77 seconds)\n", - "Cbc0010I After 13217000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1064.81 seconds)\n", - "Cbc0010I After 13218000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1064.85 seconds)\n", - "Cbc0010I After 13219000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1064.92 seconds)\n", - "Cbc0010I After 13220000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1064.95 seconds)\n", - "Cbc0010I After 13221000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1065.01 seconds)\n", - "Cbc0010I After 13222000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1065.07 seconds)\n", - "Cbc0010I After 13223000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1065.10 seconds)\n", - "Cbc0010I After 13224000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1065.14 seconds)\n", - "Cbc0010I After 13225000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1065.16 seconds)\n", - "Cbc0010I After 13226000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1065.20 seconds)\n", - "Cbc0010I After 13227000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1065.23 seconds)\n", - "Cbc0010I After 13228000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1065.28 seconds)\n", - "Cbc0010I After 13229000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1065.32 seconds)\n", - "Cbc0010I After 13230000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1065.38 seconds)\n", - "Cbc0010I After 13231000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1065.44 seconds)\n", - "Cbc0010I After 13232000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1065.48 seconds)\n", - "Cbc0010I After 13233000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1065.53 seconds)\n", - "Cbc0010I After 13234000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1065.58 seconds)\n", - "Cbc0010I After 13235000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1065.64 seconds)\n", - "Cbc0010I After 13236000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1065.69 seconds)\n", - "Cbc0010I After 13237000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1065.74 seconds)\n", - "Cbc0010I After 13238000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1065.80 seconds)\n", - "Cbc0010I After 13239000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1065.84 seconds)\n", - "Cbc0010I After 13240000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1065.88 seconds)\n", - "Cbc0010I After 13241000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1065.94 seconds)\n", - "Cbc0010I After 13242000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1066.00 seconds)\n", - "Cbc0010I After 13243000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1066.07 seconds)\n", - "Cbc0010I After 13244000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1066.12 seconds)\n", - "Cbc0010I After 13245000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1066.23 seconds)\n", - "Cbc0010I After 13246000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1066.38 seconds)\n", - "Cbc0010I After 13247000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1066.49 seconds)\n", - "Cbc0010I After 13248000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1066.56 seconds)\n", - "Cbc0010I After 13249000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1066.68 seconds)\n", - "Cbc0010I After 13250000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1066.84 seconds)\n", - "Cbc0010I After 13251000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1067.06 seconds)\n", - "Cbc0010I After 13252000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1067.29 seconds)\n", - "Cbc0010I After 13253000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1067.50 seconds)\n", - "Cbc0010I After 13254000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1067.69 seconds)\n", - "Cbc0010I After 13255000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1067.87 seconds)\n", - "Cbc0010I After 13256000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1068.03 seconds)\n", - "Cbc0010I After 13257000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1068.24 seconds)\n", - "Cbc0010I After 13258000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1068.53 seconds)\n", - "Cbc0010I After 13259000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1068.76 seconds)\n", - "Cbc0010I After 13260000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1068.99 seconds)\n", - "Cbc0010I After 13261000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1069.18 seconds)\n", - "Cbc0010I After 13262000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1069.36 seconds)\n", - "Cbc0010I After 13263000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1069.48 seconds)\n", - "Cbc0010I After 13264000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1069.64 seconds)\n", - "Cbc0010I After 13265000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1069.80 seconds)\n", - "Cbc0010I After 13266000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1069.95 seconds)\n", - "Cbc0010I After 13267000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1070.09 seconds)\n", - "Cbc0010I After 13268000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1070.20 seconds)\n", - "Cbc0010I After 13269000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1070.35 seconds)\n", - "Cbc0010I After 13270000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1070.48 seconds)\n", - "Cbc0010I After 13271000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1070.59 seconds)\n", - "Cbc0010I After 13272000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1070.73 seconds)\n", - "Cbc0010I After 13273000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1070.83 seconds)\n", - "Cbc0010I After 13274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1070.94 seconds)\n", - "Cbc0010I After 13275000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1071.04 seconds)\n", - "Cbc0010I After 13276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1071.14 seconds)\n", - "Cbc0010I After 13277000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1071.26 seconds)\n", - "Cbc0010I After 13278000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1071.36 seconds)\n", - "Cbc0010I After 13279000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1071.45 seconds)\n", - "Cbc0010I After 13280000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1071.53 seconds)\n", - "Cbc0010I After 13281000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1071.62 seconds)\n", - "Cbc0010I After 13282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1071.68 seconds)\n", - "Cbc0010I After 13283000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1071.75 seconds)\n", - "Cbc0010I After 13284000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1071.81 seconds)\n", - "Cbc0010I After 13285000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1071.90 seconds)\n", - "Cbc0010I After 13286000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1072.01 seconds)\n", - "Cbc0010I After 13287000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1072.08 seconds)\n", - "Cbc0010I After 13288000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1072.18 seconds)\n", - "Cbc0010I After 13289000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1072.27 seconds)\n", - "Cbc0010I After 13290000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1072.33 seconds)\n", - "Cbc0010I After 13291000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1072.40 seconds)\n", - "Cbc0010I After 13292000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1072.48 seconds)\n", - "Cbc0010I After 13293000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1072.53 seconds)\n", - "Cbc0010I After 13294000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1072.58 seconds)\n", - "Cbc0010I After 13295000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1072.67 seconds)\n", - "Cbc0010I After 13296000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1072.74 seconds)\n", - "Cbc0010I After 13297000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1072.79 seconds)\n", - "Cbc0010I After 13298000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1072.85 seconds)\n", - "Cbc0010I After 13299000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1072.93 seconds)\n", - "Cbc0010I After 13300000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1072.99 seconds)\n", - "Cbc0010I After 13301000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1073.05 seconds)\n", - "Cbc0010I After 13302000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1073.10 seconds)\n", - "Cbc0010I After 13303000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1073.18 seconds)\n", - "Cbc0010I After 13304000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1073.24 seconds)\n", - "Cbc0010I After 13305000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1073.28 seconds)\n", - "Cbc0010I After 13306000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1073.32 seconds)\n", - "Cbc0010I After 13307000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1073.40 seconds)\n", - "Cbc0010I After 13308000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1073.45 seconds)\n", - "Cbc0010I After 13309000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1073.50 seconds)\n", - "Cbc0010I After 13310000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1073.55 seconds)\n", - "Cbc0010I After 13311000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1073.61 seconds)\n", - "Cbc0010I After 13312000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1073.67 seconds)\n", - "Cbc0010I After 13313000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1073.74 seconds)\n", - "Cbc0010I After 13314000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1073.82 seconds)\n", - "Cbc0010I After 13315000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1073.88 seconds)\n", - "Cbc0010I After 13316000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1073.98 seconds)\n", - "Cbc0010I After 13317000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1074.06 seconds)\n", - "Cbc0010I After 13318000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1074.12 seconds)\n", - "Cbc0010I After 13319000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1074.21 seconds)\n", - "Cbc0010I After 13320000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1074.31 seconds)\n", - "Cbc0010I After 13321000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1074.37 seconds)\n", - "Cbc0010I After 13322000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1074.42 seconds)\n", - "Cbc0010I After 13323000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1074.47 seconds)\n", - "Cbc0010I After 13324000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1074.55 seconds)\n", - "Cbc0010I After 13325000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1074.63 seconds)\n", - "Cbc0010I After 13326000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1074.70 seconds)\n", - "Cbc0010I After 13327000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1074.79 seconds)\n", - "Cbc0010I After 13328000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1074.85 seconds)\n", - "Cbc0010I After 13329000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1074.90 seconds)\n", - "Cbc0010I After 13330000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1074.97 seconds)\n", - "Cbc0010I After 13331000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1075.04 seconds)\n", - "Cbc0010I After 13332000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1075.09 seconds)\n", - "Cbc0010I After 13333000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1075.14 seconds)\n", - "Cbc0010I After 13334000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1075.20 seconds)\n", - "Cbc0010I After 13335000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1075.27 seconds)\n", - "Cbc0010I After 13336000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1075.34 seconds)\n", - "Cbc0010I After 13337000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1075.40 seconds)\n", - "Cbc0010I After 13338000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1075.51 seconds)\n", - "Cbc0010I After 13339000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1075.59 seconds)\n", - "Cbc0010I After 13340000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1075.65 seconds)\n", - "Cbc0010I After 13341000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1075.74 seconds)\n", - "Cbc0010I After 13342000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1075.83 seconds)\n", - "Cbc0010I After 13343000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1075.89 seconds)\n", - "Cbc0010I After 13344000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1075.98 seconds)\n", - "Cbc0010I After 13345000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1076.07 seconds)\n", - "Cbc0010I After 13346000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1076.13 seconds)\n", - "Cbc0010I After 13347000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1076.23 seconds)\n", - "Cbc0010I After 13348000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1076.33 seconds)\n", - "Cbc0010I After 13349000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1076.44 seconds)\n", - "Cbc0010I After 13350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1076.56 seconds)\n", - "Cbc0010I After 13351000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1076.70 seconds)\n", - "Cbc0010I After 13352000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1076.78 seconds)\n", - "Cbc0010I After 13353000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1076.89 seconds)\n", - "Cbc0010I After 13354000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.00 seconds)\n", - "Cbc0010I After 13355000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1077.09 seconds)\n", - "Cbc0010I After 13356000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1077.19 seconds)\n", - "Cbc0010I After 13357000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1077.28 seconds)\n", - "Cbc0010I After 13358000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1077.34 seconds)\n", - "Cbc0010I After 13359000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1077.41 seconds)\n", - "Cbc0010I After 13360000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1077.49 seconds)\n", - "Cbc0010I After 13361000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1077.57 seconds)\n", - "Cbc0010I After 13362000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1077.64 seconds)\n", - "Cbc0010I After 13363000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.71 seconds)\n", - "Cbc0010I After 13364000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1077.78 seconds)\n", - "Cbc0010I After 13365000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.85 seconds)\n", - "Cbc0010I After 13366000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1077.91 seconds)\n", - "Cbc0010I After 13367000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1077.97 seconds)\n", - "Cbc0010I After 13368000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1078.04 seconds)\n", - "Cbc0010I After 13369000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1078.10 seconds)\n", - "Cbc0010I After 13370000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1078.16 seconds)\n", - "Cbc0010I After 13371000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1078.22 seconds)\n", - "Cbc0010I After 13372000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1078.29 seconds)\n", - "Cbc0010I After 13373000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1078.36 seconds)\n", - "Cbc0010I After 13374000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1078.42 seconds)\n", - "Cbc0010I After 13375000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1078.47 seconds)\n", - "Cbc0010I After 13376000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1078.56 seconds)\n", - "Cbc0010I After 13377000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1078.63 seconds)\n", - "Cbc0010I After 13378000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1078.70 seconds)\n", - "Cbc0010I After 13379000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1078.77 seconds)\n", - "Cbc0010I After 13380000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1078.83 seconds)\n", - "Cbc0010I After 13381000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1078.89 seconds)\n", - "Cbc0010I After 13382000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1078.95 seconds)\n", - "Cbc0010I After 13383000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.02 seconds)\n", - "Cbc0010I After 13384000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1079.10 seconds)\n", - "Cbc0010I After 13385000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1079.17 seconds)\n", - "Cbc0010I After 13386000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1079.25 seconds)\n", - "Cbc0010I After 13387000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.32 seconds)\n", - "Cbc0010I After 13388000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1079.40 seconds)\n", - "Cbc0010I After 13389000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1079.49 seconds)\n", - "Cbc0010I After 13390000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1079.57 seconds)\n", - "Cbc0010I After 13391000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1079.64 seconds)\n", - "Cbc0010I After 13392000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1079.72 seconds)\n", - "Cbc0010I After 13393000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1079.81 seconds)\n", - "Cbc0010I After 13394000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1079.88 seconds)\n", - "Cbc0010I After 13395000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1080.08 seconds)\n", - "Cbc0010I After 13396000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1080.20 seconds)\n", - "Cbc0010I After 13397000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1080.32 seconds)\n", - "Cbc0010I After 13398000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1080.42 seconds)\n", - "Cbc0010I After 13399000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1080.51 seconds)\n", - "Cbc0010I After 13400000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1080.60 seconds)\n", - "Cbc0010I After 13401000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1080.68 seconds)\n", - "Cbc0010I After 13402000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1080.79 seconds)\n", - "Cbc0010I After 13403000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1080.87 seconds)\n", - "Cbc0010I After 13404000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1080.96 seconds)\n", - "Cbc0010I After 13405000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1081.04 seconds)\n", - "Cbc0010I After 13406000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1081.13 seconds)\n", - "Cbc0010I After 13407000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1081.23 seconds)\n", - "Cbc0010I After 13408000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1081.33 seconds)\n", - "Cbc0010I After 13409000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1081.42 seconds)\n", - "Cbc0010I After 13410000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1081.52 seconds)\n", - "Cbc0010I After 13411000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1081.58 seconds)\n", - "Cbc0010I After 13412000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1081.65 seconds)\n", - "Cbc0010I After 13413000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1081.72 seconds)\n", - "Cbc0010I After 13414000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1081.79 seconds)\n", - "Cbc0010I After 13415000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1081.85 seconds)\n", - "Cbc0010I After 13416000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1081.92 seconds)\n", - "Cbc0010I After 13417000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.00 seconds)\n", - "Cbc0010I After 13418000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1082.06 seconds)\n", - "Cbc0010I After 13419000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.15 seconds)\n", - "Cbc0010I After 13420000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1082.23 seconds)\n", - "Cbc0010I After 13421000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1082.31 seconds)\n", - "Cbc0010I After 13422000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1082.37 seconds)\n", - "Cbc0010I After 13423000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1082.44 seconds)\n", - "Cbc0010I After 13424000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1082.50 seconds)\n", - "Cbc0010I After 13425000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1082.56 seconds)\n", - "Cbc0010I After 13426000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1082.62 seconds)\n", - "Cbc0010I After 13427000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1082.69 seconds)\n", - "Cbc0010I After 13428000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1082.76 seconds)\n", - "Cbc0010I After 13429000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1082.83 seconds)\n", - "Cbc0010I After 13430000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1082.90 seconds)\n", - "Cbc0010I After 13431000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1082.96 seconds)\n", - "Cbc0010I After 13432000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1083.02 seconds)\n", - "Cbc0010I After 13433000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1083.09 seconds)\n", - "Cbc0010I After 13434000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1083.14 seconds)\n", - "Cbc0010I After 13435000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1083.21 seconds)\n", - "Cbc0010I After 13436000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1083.28 seconds)\n", - "Cbc0010I After 13437000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1083.37 seconds)\n", - "Cbc0010I After 13438000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1083.46 seconds)\n", - "Cbc0010I After 13439000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1083.53 seconds)\n", - "Cbc0010I After 13440000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1083.61 seconds)\n", - "Cbc0010I After 13441000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1083.67 seconds)\n", - "Cbc0010I After 13442000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1083.74 seconds)\n", - "Cbc0010I After 13443000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1083.81 seconds)\n", - "Cbc0010I After 13444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1083.87 seconds)\n", - "Cbc0010I After 13445000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1083.94 seconds)\n", - "Cbc0010I After 13446000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1084.00 seconds)\n", - "Cbc0010I After 13447000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1084.06 seconds)\n", - "Cbc0010I After 13448000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1084.14 seconds)\n", - "Cbc0010I After 13449000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1084.20 seconds)\n", - "Cbc0010I After 13450000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.26 seconds)\n", - "Cbc0010I After 13451000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1084.33 seconds)\n", - "Cbc0010I After 13452000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1084.39 seconds)\n", - "Cbc0010I After 13453000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.46 seconds)\n", - "Cbc0010I After 13454000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1084.52 seconds)\n", - "Cbc0010I After 13455000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1084.58 seconds)\n", - "Cbc0010I After 13456000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1084.64 seconds)\n", - "Cbc0010I After 13457000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1084.70 seconds)\n", - "Cbc0010I After 13458000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1084.76 seconds)\n", - "Cbc0010I After 13459000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1084.81 seconds)\n", - "Cbc0010I After 13460000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1084.87 seconds)\n", - "Cbc0010I After 13461000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1084.93 seconds)\n", - "Cbc0010I After 13462000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1084.99 seconds)\n", - "Cbc0010I After 13463000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1085.06 seconds)\n", - "Cbc0010I After 13464000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1085.12 seconds)\n", - "Cbc0010I After 13465000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1085.18 seconds)\n", - "Cbc0010I After 13466000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1085.24 seconds)\n", - "Cbc0010I After 13467000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1085.30 seconds)\n", - "Cbc0010I After 13468000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1085.37 seconds)\n", - "Cbc0010I After 13469000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1085.43 seconds)\n", - "Cbc0010I After 13470000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1085.49 seconds)\n", - "Cbc0010I After 13471000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1085.56 seconds)\n", - "Cbc0010I After 13472000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1085.62 seconds)\n", - "Cbc0010I After 13473000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1085.68 seconds)\n", - "Cbc0010I After 13474000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1085.74 seconds)\n", - "Cbc0010I After 13475000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1085.80 seconds)\n", - "Cbc0010I After 13476000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1085.88 seconds)\n", - "Cbc0010I After 13477000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1085.94 seconds)\n", - "Cbc0010I After 13478000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.01 seconds)\n", - "Cbc0010I After 13479000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1086.07 seconds)\n", - "Cbc0010I After 13480000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1086.13 seconds)\n", - "Cbc0010I After 13481000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.20 seconds)\n", - "Cbc0010I After 13482000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.26 seconds)\n", - "Cbc0010I After 13483000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1086.32 seconds)\n", - "Cbc0010I After 13484000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.38 seconds)\n", - "Cbc0010I After 13485000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1086.44 seconds)\n", - "Cbc0010I After 13486000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1086.51 seconds)\n", - "Cbc0010I After 13487000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1086.56 seconds)\n", - "Cbc0010I After 13488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1086.62 seconds)\n", - "Cbc0010I After 13489000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1086.68 seconds)\n", - "Cbc0010I After 13490000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.75 seconds)\n", - "Cbc0010I After 13491000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1086.81 seconds)\n", - "Cbc0010I After 13492000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1086.87 seconds)\n", - "Cbc0010I After 13493000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1086.92 seconds)\n", - "Cbc0010I After 13494000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1086.98 seconds)\n", - "Cbc0010I After 13495000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1087.04 seconds)\n", - "Cbc0010I After 13496000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1087.10 seconds)\n", - "Cbc0010I After 13497000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1087.15 seconds)\n", - "Cbc0010I After 13498000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1087.21 seconds)\n", - "Cbc0010I After 13499000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1087.27 seconds)\n", - "Cbc0010I After 13500000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1087.33 seconds)\n", - "Cbc0010I After 13501000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1087.39 seconds)\n", - "Cbc0010I After 13502000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1087.45 seconds)\n", - "Cbc0010I After 13503000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1087.51 seconds)\n", - "Cbc0010I After 13504000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1087.56 seconds)\n", - "Cbc0010I After 13505000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1087.63 seconds)\n", - "Cbc0010I After 13506000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1087.68 seconds)\n", - "Cbc0010I After 13507000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1087.73 seconds)\n", - "Cbc0010I After 13508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1087.79 seconds)\n", - "Cbc0010I After 13509000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1087.86 seconds)\n", - "Cbc0010I After 13510000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1087.92 seconds)\n", - "Cbc0010I After 13511000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1087.97 seconds)\n", - "Cbc0010I After 13512000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1088.04 seconds)\n", - "Cbc0010I After 13513000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1088.10 seconds)\n", - "Cbc0010I After 13514000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1088.16 seconds)\n", - "Cbc0010I After 13515000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1088.22 seconds)\n", - "Cbc0010I After 13516000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1088.29 seconds)\n", - "Cbc0010I After 13517000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1088.35 seconds)\n", - "Cbc0010I After 13518000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1088.41 seconds)\n", - "Cbc0010I After 13519000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1088.47 seconds)\n", - "Cbc0010I After 13520000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1088.54 seconds)\n", - "Cbc0010I After 13521000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1088.63 seconds)\n", - "Cbc0010I After 13522000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1088.70 seconds)\n", - "Cbc0010I After 13523000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1088.77 seconds)\n", - "Cbc0010I After 13524000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1088.84 seconds)\n", - "Cbc0010I After 13525000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1088.90 seconds)\n", - "Cbc0010I After 13526000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1088.95 seconds)\n", - "Cbc0010I After 13527000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1089.02 seconds)\n", - "Cbc0010I After 13528000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1089.10 seconds)\n", - "Cbc0010I After 13529000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1089.16 seconds)\n", - "Cbc0010I After 13530000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1089.22 seconds)\n", - "Cbc0010I After 13531000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1089.29 seconds)\n", - "Cbc0010I After 13532000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1089.35 seconds)\n", - "Cbc0010I After 13533000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1089.40 seconds)\n", - "Cbc0010I After 13534000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1089.48 seconds)\n", - "Cbc0010I After 13535000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1089.54 seconds)\n", - "Cbc0010I After 13536000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1089.61 seconds)\n", - "Cbc0010I After 13537000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1089.68 seconds)\n", - "Cbc0010I After 13538000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1089.73 seconds)\n", - "Cbc0010I After 13539000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1089.79 seconds)\n", - "Cbc0010I After 13540000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1089.86 seconds)\n", - "Cbc0010I After 13541000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1089.90 seconds)\n", - "Cbc0010I After 13542000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1089.97 seconds)\n", - "Cbc0010I After 13543000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1090.02 seconds)\n", - "Cbc0010I After 13544000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1090.08 seconds)\n", - "Cbc0010I After 13545000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1090.15 seconds)\n", - "Cbc0010I After 13546000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1090.20 seconds)\n", - "Cbc0010I After 13547000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1090.25 seconds)\n", - "Cbc0010I After 13548000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1090.32 seconds)\n", - "Cbc0010I After 13549000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1090.37 seconds)\n", - "Cbc0010I After 13550000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1090.42 seconds)\n", - "Cbc0010I After 13551000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1090.48 seconds)\n", - "Cbc0010I After 13552000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1090.55 seconds)\n", - "Cbc0010I After 13553000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1090.60 seconds)\n", - "Cbc0010I After 13554000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1090.66 seconds)\n", - "Cbc0010I After 13555000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1090.73 seconds)\n", - "Cbc0010I After 13556000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1090.79 seconds)\n", - "Cbc0010I After 13557000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1090.86 seconds)\n", - "Cbc0010I After 13558000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1090.92 seconds)\n", - "Cbc0010I After 13559000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1090.97 seconds)\n", - "Cbc0010I After 13560000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1091.03 seconds)\n", - "Cbc0010I After 13561000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1091.10 seconds)\n", - "Cbc0010I After 13562000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1091.18 seconds)\n", - "Cbc0010I After 13563000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1091.23 seconds)\n", - "Cbc0010I After 13564000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1091.29 seconds)\n", - "Cbc0010I After 13565000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1091.37 seconds)\n", - "Cbc0010I After 13566000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1091.42 seconds)\n", - "Cbc0010I After 13567000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1091.48 seconds)\n", - "Cbc0010I After 13568000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1091.55 seconds)\n", - "Cbc0010I After 13569000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1091.61 seconds)\n", - "Cbc0010I After 13570000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1091.66 seconds)\n", - "Cbc0010I After 13571000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1091.74 seconds)\n", - "Cbc0010I After 13572000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1091.81 seconds)\n", - "Cbc0010I After 13573000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1091.86 seconds)\n", - "Cbc0010I After 13574000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1091.90 seconds)\n", - "Cbc0010I After 13575000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1091.97 seconds)\n", - "Cbc0010I After 13576000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1092.04 seconds)\n", - "Cbc0010I After 13577000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1092.09 seconds)\n", - "Cbc0010I After 13578000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1092.15 seconds)\n", - "Cbc0010I After 13579000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1092.24 seconds)\n", - "Cbc0010I After 13580000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1092.30 seconds)\n", - "Cbc0010I After 13581000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1092.35 seconds)\n", - "Cbc0010I After 13582000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1092.42 seconds)\n", - "Cbc0010I After 13583000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1092.50 seconds)\n", - "Cbc0010I After 13584000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1092.55 seconds)\n", - "Cbc0010I After 13585000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1092.60 seconds)\n", - "Cbc0010I After 13586000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1092.67 seconds)\n", - "Cbc0010I After 13587000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1092.74 seconds)\n", - "Cbc0010I After 13588000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1092.79 seconds)\n", - "Cbc0010I After 13589000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1092.85 seconds)\n", - "Cbc0010I After 13590000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1092.92 seconds)\n", - "Cbc0010I After 13591000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1092.98 seconds)\n", - "Cbc0010I After 13592000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1093.02 seconds)\n", - "Cbc0010I After 13593000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1093.09 seconds)\n", - "Cbc0010I After 13594000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1093.15 seconds)\n", - "Cbc0010I After 13595000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1093.20 seconds)\n", - "Cbc0010I After 13596000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1093.27 seconds)\n", - "Cbc0010I After 13597000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1093.34 seconds)\n", - "Cbc0010I After 13598000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1093.41 seconds)\n", - "Cbc0010I After 13599000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1093.46 seconds)\n", - "Cbc0010I After 13600000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1093.52 seconds)\n", - "Cbc0010I After 13601000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1093.59 seconds)\n", - "Cbc0010I After 13602000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1093.64 seconds)\n", - "Cbc0010I After 13603000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1093.70 seconds)\n", - "Cbc0010I After 13604000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1093.78 seconds)\n", - "Cbc0010I After 13605000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1093.83 seconds)\n", - "Cbc0010I After 13606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1093.90 seconds)\n", - "Cbc0010I After 13607000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1093.97 seconds)\n", - "Cbc0010I After 13608000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1094.01 seconds)\n", - "Cbc0010I After 13609000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1094.09 seconds)\n", - "Cbc0010I After 13610000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1094.16 seconds)\n", - "Cbc0010I After 13611000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1094.21 seconds)\n", - "Cbc0010I After 13612000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1094.28 seconds)\n", - "Cbc0010I After 13613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1094.34 seconds)\n", - "Cbc0010I After 13614000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1094.40 seconds)\n", - "Cbc0010I After 13615000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1094.46 seconds)\n", - "Cbc0010I After 13616000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1094.54 seconds)\n", - "Cbc0010I After 13617000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1094.59 seconds)\n", - "Cbc0010I After 13618000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1094.64 seconds)\n", - "Cbc0010I After 13619000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1094.71 seconds)\n", - "Cbc0010I After 13620000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1094.78 seconds)\n", - "Cbc0010I After 13621000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1094.86 seconds)\n", - "Cbc0010I After 13622000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1094.94 seconds)\n", - "Cbc0010I After 13623000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1095.00 seconds)\n", - "Cbc0010I After 13624000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1095.06 seconds)\n", - "Cbc0010I After 13625000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1095.13 seconds)\n", - "Cbc0010I After 13626000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1095.18 seconds)\n", - "Cbc0010I After 13627000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1095.23 seconds)\n", - "Cbc0010I After 13628000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1095.31 seconds)\n", - "Cbc0010I After 13629000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1095.37 seconds)\n", - "Cbc0010I After 13630000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1095.42 seconds)\n", - "Cbc0010I After 13631000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1095.50 seconds)\n", - "Cbc0010I After 13632000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1095.56 seconds)\n", - "Cbc0010I After 13633000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1095.62 seconds)\n", - "Cbc0010I After 13634000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1095.70 seconds)\n", - "Cbc0010I After 13635000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1095.76 seconds)\n", - "Cbc0010I After 13636000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1095.81 seconds)\n", - "Cbc0010I After 13637000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1095.89 seconds)\n", - "Cbc0010I After 13638000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1095.95 seconds)\n", - "Cbc0010I After 13639000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1096.01 seconds)\n", - "Cbc0010I After 13640000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1096.08 seconds)\n", - "Cbc0010I After 13641000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1096.14 seconds)\n", - "Cbc0010I After 13642000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.21 seconds)\n", - "Cbc0010I After 13643000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.28 seconds)\n", - "Cbc0010I After 13644000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1096.32 seconds)\n", - "Cbc0010I After 13645000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1096.40 seconds)\n", - "Cbc0010I After 13646000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1096.47 seconds)\n", - "Cbc0010I After 13647000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1096.54 seconds)\n", - "Cbc0010I After 13648000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1096.61 seconds)\n", - "Cbc0010I After 13649000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1096.67 seconds)\n", - "Cbc0010I After 13650000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1096.74 seconds)\n", - "Cbc0010I After 13651000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1096.81 seconds)\n", - "Cbc0010I After 13652000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1096.87 seconds)\n", - "Cbc0010I After 13653000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1096.94 seconds)\n", - "Cbc0010I After 13654000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1097.02 seconds)\n", - "Cbc0010I After 13655000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1097.07 seconds)\n", - "Cbc0010I After 13656000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1097.13 seconds)\n", - "Cbc0010I After 13657000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.19 seconds)\n", - "Cbc0010I After 13658000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1097.26 seconds)\n", - "Cbc0010I After 13659000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.32 seconds)\n", - "Cbc0010I After 13660000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1097.38 seconds)\n", - "Cbc0010I After 13661000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1097.45 seconds)\n", - "Cbc0010I After 13662000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1097.51 seconds)\n", - "Cbc0010I After 13663000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1097.59 seconds)\n", - "Cbc0010I After 13664000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1097.64 seconds)\n", - "Cbc0010I After 13665000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1097.72 seconds)\n", - "Cbc0010I After 13666000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1097.79 seconds)\n", - "Cbc0010I After 13667000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1097.85 seconds)\n", - "Cbc0010I After 13668000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1097.92 seconds)\n", - "Cbc0010I After 13669000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1097.97 seconds)\n", - "Cbc0010I After 13670000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1098.05 seconds)\n", - "Cbc0010I After 13671000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1098.11 seconds)\n", - "Cbc0010I After 13672000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1098.19 seconds)\n", - "Cbc0010I After 13673000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1098.25 seconds)\n", - "Cbc0010I After 13674000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1098.32 seconds)\n", - "Cbc0010I After 13675000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1098.37 seconds)\n", - "Cbc0010I After 13676000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1098.43 seconds)\n", - "Cbc0010I After 13677000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1098.50 seconds)\n", - "Cbc0010I After 13678000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.56 seconds)\n", - "Cbc0010I After 13679000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.64 seconds)\n", - "Cbc0010I After 13680000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1098.70 seconds)\n", - "Cbc0010I After 13681000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1098.78 seconds)\n", - "Cbc0010I After 13682000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1098.85 seconds)\n", - "Cbc0010I After 13683000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1098.91 seconds)\n", - "Cbc0010I After 13684000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1098.98 seconds)\n", - "Cbc0010I After 13685000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1099.04 seconds)\n", - "Cbc0010I After 13686000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.10 seconds)\n", - "Cbc0010I After 13687000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1099.15 seconds)\n", - "Cbc0010I After 13688000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1099.25 seconds)\n", - "Cbc0010I After 13689000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1099.34 seconds)\n", - "Cbc0010I After 13690000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1099.42 seconds)\n", - "Cbc0010I After 13691000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1099.48 seconds)\n", - "Cbc0010I After 13692000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1099.57 seconds)\n", - "Cbc0010I After 13693000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.64 seconds)\n", - "Cbc0010I After 13694000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1099.72 seconds)\n", - "Cbc0010I After 13695000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1099.79 seconds)\n", - "Cbc0010I After 13696000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1099.86 seconds)\n", - "Cbc0010I After 13697000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1099.91 seconds)\n", - "Cbc0010I After 13698000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1099.98 seconds)\n", - "Cbc0010I After 13699000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1100.03 seconds)\n", - "Cbc0010I After 13700000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1100.09 seconds)\n", - "Cbc0010I After 13701000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1100.14 seconds)\n", - "Cbc0010I After 13702000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1100.21 seconds)\n", - "Cbc0010I After 13703000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1100.26 seconds)\n", - "Cbc0010I After 13704000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1100.33 seconds)\n", - "Cbc0010I After 13705000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1100.38 seconds)\n", - "Cbc0010I After 13706000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1100.44 seconds)\n", - "Cbc0010I After 13707000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1100.49 seconds)\n", - "Cbc0010I After 13708000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1100.55 seconds)\n", - "Cbc0010I After 13709000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1100.60 seconds)\n", - "Cbc0010I After 13710000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1100.67 seconds)\n", - "Cbc0010I After 13711000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1100.73 seconds)\n", - "Cbc0010I After 13712000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1100.79 seconds)\n", - "Cbc0010I After 13713000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1100.85 seconds)\n", - "Cbc0010I After 13714000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1100.92 seconds)\n", - "Cbc0010I After 13715000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1100.99 seconds)\n", - "Cbc0010I After 13716000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1101.04 seconds)\n", - "Cbc0010I After 13717000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1101.11 seconds)\n", - "Cbc0010I After 13718000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1101.17 seconds)\n", - "Cbc0010I After 13719000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1101.24 seconds)\n", - "Cbc0010I After 13720000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1101.30 seconds)\n", - "Cbc0010I After 13721000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1101.35 seconds)\n", - "Cbc0010I After 13722000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1101.42 seconds)\n", - "Cbc0010I After 13723000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1101.48 seconds)\n", - "Cbc0010I After 13724000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1101.55 seconds)\n", - "Cbc0010I After 13725000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1101.60 seconds)\n", - "Cbc0010I After 13726000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1101.66 seconds)\n", - "Cbc0010I After 13727000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1101.72 seconds)\n", - "Cbc0010I After 13728000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1101.79 seconds)\n", - "Cbc0010I After 13729000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1101.84 seconds)\n", - "Cbc0010I After 13730000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1101.91 seconds)\n", - "Cbc0010I After 13731000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1101.97 seconds)\n", - "Cbc0010I After 13732000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1102.03 seconds)\n", - "Cbc0010I After 13733000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.09 seconds)\n", - "Cbc0010I After 13734000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1102.15 seconds)\n", - "Cbc0010I After 13735000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1102.20 seconds)\n", - "Cbc0010I After 13736000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.27 seconds)\n", - "Cbc0010I After 13737000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1102.32 seconds)\n", - "Cbc0010I After 13738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1102.38 seconds)\n", - "Cbc0010I After 13739000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1102.45 seconds)\n", - "Cbc0010I After 13740000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1102.52 seconds)\n", - "Cbc0010I After 13741000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1102.57 seconds)\n", - "Cbc0010I After 13742000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1102.63 seconds)\n", - "Cbc0010I After 13743000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1102.70 seconds)\n", - "Cbc0010I After 13744000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1102.76 seconds)\n", - "Cbc0010I After 13745000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1102.81 seconds)\n", - "Cbc0010I After 13746000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1102.88 seconds)\n", - "Cbc0010I After 13747000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1102.94 seconds)\n", - "Cbc0010I After 13748000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.00 seconds)\n", - "Cbc0010I After 13749000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1103.07 seconds)\n", - "Cbc0010I After 13750000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1103.12 seconds)\n", - "Cbc0010I After 13751000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.19 seconds)\n", - "Cbc0010I After 13752000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1103.25 seconds)\n", - "Cbc0010I After 13753000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1103.31 seconds)\n", - "Cbc0010I After 13754000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.37 seconds)\n", - "Cbc0010I After 13755000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1103.43 seconds)\n", - "Cbc0010I After 13756000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1103.50 seconds)\n", - "Cbc0010I After 13757000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1103.56 seconds)\n", - "Cbc0010I After 13758000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1103.62 seconds)\n", - "Cbc0010I After 13759000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1103.68 seconds)\n", - "Cbc0010I After 13760000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1103.74 seconds)\n", - "Cbc0010I After 13761000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1103.80 seconds)\n", - "Cbc0010I After 13762000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1103.87 seconds)\n", - "Cbc0010I After 13763000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1103.94 seconds)\n", - "Cbc0010I After 13764000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1104.01 seconds)\n", - "Cbc0010I After 13765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1104.07 seconds)\n", - "Cbc0010I After 13766000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.14 seconds)\n", - "Cbc0010I After 13767000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1104.19 seconds)\n", - "Cbc0010I After 13768000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1104.26 seconds)\n", - "Cbc0010I After 13769000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1104.32 seconds)\n", - "Cbc0010I After 13770000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1104.37 seconds)\n", - "Cbc0010I After 13771000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1104.43 seconds)\n", - "Cbc0010I After 13772000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1104.49 seconds)\n", - "Cbc0010I After 13773000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1104.55 seconds)\n", - "Cbc0010I After 13774000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1104.60 seconds)\n", - "Cbc0010I After 13775000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1104.67 seconds)\n", - "Cbc0010I After 13776000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.73 seconds)\n", - "Cbc0010I After 13777000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1104.79 seconds)\n", - "Cbc0010I After 13778000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1104.86 seconds)\n", - "Cbc0010I After 13779000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1104.92 seconds)\n", - "Cbc0010I After 13780000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1104.97 seconds)\n", - "Cbc0010I After 13781000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1105.03 seconds)\n", - "Cbc0010I After 13782000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1105.08 seconds)\n", - "Cbc0010I After 13783000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1105.13 seconds)\n", - "Cbc0010I After 13784000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1105.18 seconds)\n", - "Cbc0010I After 13785000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1105.23 seconds)\n", - "Cbc0010I After 13786000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1105.28 seconds)\n", - "Cbc0010I After 13787000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1105.33 seconds)\n", - "Cbc0010I After 13788000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1105.41 seconds)\n", - "Cbc0010I After 13789000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1105.48 seconds)\n", - "Cbc0010I After 13790000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1105.53 seconds)\n", - "Cbc0010I After 13791000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1105.59 seconds)\n", - "Cbc0010I After 13792000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1105.67 seconds)\n", - "Cbc0010I After 13793000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1105.72 seconds)\n", - "Cbc0010I After 13794000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1105.81 seconds)\n", - "Cbc0010I After 13795000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1105.88 seconds)\n", - "Cbc0010I After 13796000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1105.93 seconds)\n", - "Cbc0010I After 13797000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1106.01 seconds)\n", - "Cbc0010I After 13798000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1106.08 seconds)\n", - "Cbc0010I After 13799000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1106.16 seconds)\n", - "Cbc0010I After 13800000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1106.21 seconds)\n", - "Cbc0010I After 13801000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1106.29 seconds)\n", - "Cbc0010I After 13802000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1106.34 seconds)\n", - "Cbc0010I After 13803000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1106.40 seconds)\n", - "Cbc0010I After 13804000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1106.47 seconds)\n", - "Cbc0010I After 13805000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1106.53 seconds)\n", - "Cbc0010I After 13806000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1106.59 seconds)\n", - "Cbc0010I After 13807000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1106.66 seconds)\n", - "Cbc0010I After 13808000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1106.72 seconds)\n", - "Cbc0010I After 13809000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1106.77 seconds)\n", - "Cbc0010I After 13810000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1106.85 seconds)\n", - "Cbc0010I After 13811000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1106.90 seconds)\n", - "Cbc0010I After 13812000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1106.96 seconds)\n", - "Cbc0010I After 13813000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1107.07 seconds)\n", - "Cbc0010I After 13814000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.14 seconds)\n", - "Cbc0010I After 13815000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1107.21 seconds)\n", - "Cbc0010I After 13816000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1107.28 seconds)\n", - "Cbc0010I After 13817000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1107.34 seconds)\n", - "Cbc0010I After 13818000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1107.41 seconds)\n", - "Cbc0010I After 13819000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1107.47 seconds)\n", - "Cbc0010I After 13820000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1107.54 seconds)\n", - "Cbc0010I After 13821000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.60 seconds)\n", - "Cbc0010I After 13822000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1107.66 seconds)\n", - "Cbc0010I After 13823000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1107.72 seconds)\n", - "Cbc0010I After 13824000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1107.80 seconds)\n", - "Cbc0010I After 13825000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1107.88 seconds)\n", - "Cbc0010I After 13826000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1107.94 seconds)\n", - "Cbc0010I After 13827000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1108.01 seconds)\n", - "Cbc0010I After 13828000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.09 seconds)\n", - "Cbc0010I After 13829000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1108.17 seconds)\n", - "Cbc0010I After 13830000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.24 seconds)\n", - "Cbc0010I After 13831000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1108.30 seconds)\n", - "Cbc0010I After 13832000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1108.36 seconds)\n", - "Cbc0010I After 13833000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1108.43 seconds)\n", - "Cbc0010I After 13834000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.49 seconds)\n", - "Cbc0010I After 13835000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.55 seconds)\n", - "Cbc0010I After 13836000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1108.61 seconds)\n", - "Cbc0010I After 13837000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1108.69 seconds)\n", - "Cbc0010I After 13838000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1108.77 seconds)\n", - "Cbc0010I After 13839000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1108.83 seconds)\n", - "Cbc0010I After 13840000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1108.90 seconds)\n", - "Cbc0010I After 13841000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1108.97 seconds)\n", - "Cbc0010I After 13842000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1109.04 seconds)\n", - "Cbc0010I After 13843000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1109.10 seconds)\n", - "Cbc0010I After 13844000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1109.17 seconds)\n", - "Cbc0010I After 13845000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1109.23 seconds)\n", - "Cbc0010I After 13846000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1109.29 seconds)\n", - "Cbc0010I After 13847000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1109.36 seconds)\n", - "Cbc0010I After 13848000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1109.42 seconds)\n", - "Cbc0010I After 13849000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1109.49 seconds)\n", - "Cbc0010I After 13850000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1109.55 seconds)\n", - "Cbc0010I After 13851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1109.61 seconds)\n", - "Cbc0010I After 13852000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1109.68 seconds)\n", - "Cbc0010I After 13853000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1109.75 seconds)\n", - "Cbc0010I After 13854000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1109.81 seconds)\n", - "Cbc0010I After 13855000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1109.88 seconds)\n", - "Cbc0010I After 13856000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1109.94 seconds)\n", - "Cbc0010I After 13857000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1110.01 seconds)\n", - "Cbc0010I After 13858000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1110.08 seconds)\n", - "Cbc0010I After 13859000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1110.14 seconds)\n", - "Cbc0010I After 13860000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1110.20 seconds)\n", - "Cbc0010I After 13861000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1110.25 seconds)\n", - "Cbc0010I After 13862000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1110.32 seconds)\n", - "Cbc0010I After 13863000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1110.39 seconds)\n", - "Cbc0010I After 13864000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1110.46 seconds)\n", - "Cbc0010I After 13865000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1110.52 seconds)\n", - "Cbc0010I After 13866000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1110.58 seconds)\n", - "Cbc0010I After 13867000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1110.65 seconds)\n", - "Cbc0010I After 13868000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1110.71 seconds)\n", - "Cbc0010I After 13869000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1110.78 seconds)\n", - "Cbc0010I After 13870000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1110.85 seconds)\n", - "Cbc0010I After 13871000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1110.90 seconds)\n", - "Cbc0010I After 13872000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1110.98 seconds)\n", - "Cbc0010I After 13873000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1111.04 seconds)\n", - "Cbc0010I After 13874000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1111.11 seconds)\n", - "Cbc0010I After 13875000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1111.18 seconds)\n", - "Cbc0010I After 13876000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1111.25 seconds)\n", - "Cbc0010I After 13877000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1111.32 seconds)\n", - "Cbc0010I After 13878000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1111.39 seconds)\n", - "Cbc0010I After 13879000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1111.46 seconds)\n", - "Cbc0010I After 13880000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1111.52 seconds)\n", - "Cbc0010I After 13881000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1111.59 seconds)\n", - "Cbc0010I After 13882000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1111.65 seconds)\n", - "Cbc0010I After 13883000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1111.72 seconds)\n", - "Cbc0010I After 13884000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1111.79 seconds)\n", - "Cbc0010I After 13885000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1111.85 seconds)\n", - "Cbc0010I After 13886000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1111.91 seconds)\n", - "Cbc0010I After 13887000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1111.99 seconds)\n", - "Cbc0010I After 13888000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1112.05 seconds)\n", - "Cbc0010I After 13889000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1112.11 seconds)\n", - "Cbc0010I After 13890000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1112.18 seconds)\n", - "Cbc0010I After 13891000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1112.24 seconds)\n", - "Cbc0010I After 13892000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1112.31 seconds)\n", - "Cbc0010I After 13893000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1112.40 seconds)\n", - "Cbc0010I After 13894000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1112.47 seconds)\n", - "Cbc0010I After 13895000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1112.54 seconds)\n", - "Cbc0010I After 13896000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1112.61 seconds)\n", - "Cbc0010I After 13897000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1112.69 seconds)\n", - "Cbc0010I After 13898000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1112.76 seconds)\n", - "Cbc0010I After 13899000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1112.82 seconds)\n", - "Cbc0010I After 13900000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1112.90 seconds)\n", - "Cbc0010I After 13901000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1112.96 seconds)\n", - "Cbc0010I After 13902000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1113.02 seconds)\n", - "Cbc0010I After 13903000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1113.08 seconds)\n", - "Cbc0010I After 13904000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1113.15 seconds)\n", - "Cbc0010I After 13905000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1113.21 seconds)\n", - "Cbc0010I After 13906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.26 seconds)\n", - "Cbc0010I After 13907000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1113.32 seconds)\n", - "Cbc0010I After 13908000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1113.39 seconds)\n", - "Cbc0010I After 13909000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1113.44 seconds)\n", - "Cbc0010I After 13910000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1113.50 seconds)\n", - "Cbc0010I After 13911000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1113.56 seconds)\n", - "Cbc0010I After 13912000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1113.63 seconds)\n", - "Cbc0010I After 13913000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.69 seconds)\n", - "Cbc0010I After 13914000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1113.76 seconds)\n", - "Cbc0010I After 13915000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1113.82 seconds)\n", - "Cbc0010I After 13916000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1113.87 seconds)\n", - "Cbc0010I After 13917000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1113.93 seconds)\n", - "Cbc0010I After 13918000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1113.99 seconds)\n", - "Cbc0010I After 13919000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1114.06 seconds)\n", - "Cbc0010I After 13920000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1114.12 seconds)\n", - "Cbc0010I After 13921000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1114.18 seconds)\n", - "Cbc0010I After 13922000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1114.24 seconds)\n", - "Cbc0010I After 13923000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1114.30 seconds)\n", - "Cbc0010I After 13924000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1114.36 seconds)\n", - "Cbc0010I After 13925000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1114.42 seconds)\n", - "Cbc0010I After 13926000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1114.48 seconds)\n", - "Cbc0010I After 13927000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1114.55 seconds)\n", - "Cbc0010I After 13928000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1114.61 seconds)\n", - "Cbc0010I After 13929000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1114.67 seconds)\n", - "Cbc0010I After 13930000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1114.73 seconds)\n", - "Cbc0010I After 13931000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1114.79 seconds)\n", - "Cbc0010I After 13932000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1114.86 seconds)\n", - "Cbc0010I After 13933000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1114.92 seconds)\n", - "Cbc0010I After 13934000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1114.99 seconds)\n", - "Cbc0010I After 13935000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1115.05 seconds)\n", - "Cbc0010I After 13936000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1115.12 seconds)\n", - "Cbc0010I After 13937000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1115.17 seconds)\n", - "Cbc0010I After 13938000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1115.24 seconds)\n", - "Cbc0010I After 13939000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1115.30 seconds)\n", - "Cbc0010I After 13940000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1115.37 seconds)\n", - "Cbc0010I After 13941000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1115.44 seconds)\n", - "Cbc0010I After 13942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1115.51 seconds)\n", - "Cbc0010I After 13943000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1115.58 seconds)\n", - "Cbc0010I After 13944000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1115.64 seconds)\n", - "Cbc0010I After 13945000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1115.69 seconds)\n", - "Cbc0010I After 13946000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1115.76 seconds)\n", - "Cbc0010I After 13947000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1115.82 seconds)\n", - "Cbc0010I After 13948000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1115.88 seconds)\n", - "Cbc0010I After 13949000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1115.94 seconds)\n", - "Cbc0010I After 13950000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1116.00 seconds)\n", - "Cbc0010I After 13951000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1116.06 seconds)\n", - "Cbc0010I After 13952000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1116.11 seconds)\n", - "Cbc0010I After 13953000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1116.21 seconds)\n", - "Cbc0010I After 13954000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1116.28 seconds)\n", - "Cbc0010I After 13955000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1116.35 seconds)\n", - "Cbc0010I After 13956000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1116.41 seconds)\n", - "Cbc0010I After 13957000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1116.47 seconds)\n", - "Cbc0010I After 13958000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1116.54 seconds)\n", - "Cbc0010I After 13959000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1116.61 seconds)\n", - "Cbc0010I After 13960000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1116.68 seconds)\n", - "Cbc0010I After 13961000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1116.74 seconds)\n", - "Cbc0010I After 13962000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1116.79 seconds)\n", - "Cbc0010I After 13963000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1116.84 seconds)\n", - "Cbc0010I After 13964000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1116.89 seconds)\n", - "Cbc0010I After 13965000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1116.94 seconds)\n", - "Cbc0010I After 13966000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1116.98 seconds)\n", - "Cbc0010I After 13967000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.01 seconds)\n", - "Cbc0010I After 13968000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1117.04 seconds)\n", - "Cbc0010I After 13969000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1117.07 seconds)\n", - "Cbc0010I After 13970000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1117.10 seconds)\n", - "Cbc0010I After 13971000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1117.13 seconds)\n", - "Cbc0010I After 13972000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.16 seconds)\n", - "Cbc0010I After 13973000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1117.19 seconds)\n", - "Cbc0010I After 13974000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1117.22 seconds)\n", - "Cbc0010I After 13975000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.25 seconds)\n", - "Cbc0010I After 13976000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1117.28 seconds)\n", - "Cbc0010I After 13977000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1117.31 seconds)\n", - "Cbc0010I After 13978000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1117.34 seconds)\n", - "Cbc0010I After 13979000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1117.38 seconds)\n", - "Cbc0010I After 13980000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1117.41 seconds)\n", - "Cbc0010I After 13981000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1117.44 seconds)\n", - "Cbc0010I After 13982000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1117.47 seconds)\n", - "Cbc0010I After 13983000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1117.52 seconds)\n", - "Cbc0010I After 13984000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1117.54 seconds)\n", - "Cbc0010I After 13985000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1117.58 seconds)\n", - "Cbc0010I After 13986000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1117.60 seconds)\n", - "Cbc0010I After 13987000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1117.63 seconds)\n", - "Cbc0010I After 13988000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1117.66 seconds)\n", - "Cbc0010I After 13989000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.69 seconds)\n", - "Cbc0010I After 13990000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1117.72 seconds)\n", - "Cbc0010I After 13991000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1117.75 seconds)\n", - "Cbc0010I After 13992000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1117.78 seconds)\n", - "Cbc0010I After 13993000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1117.81 seconds)\n", - "Cbc0010I After 13994000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1117.84 seconds)\n", - "Cbc0010I After 13995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1117.87 seconds)\n", - "Cbc0010I After 13996000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1117.90 seconds)\n", - "Cbc0010I After 13997000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1117.93 seconds)\n", - "Cbc0010I After 13998000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1117.96 seconds)\n", - "Cbc0010I After 13999000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1117.99 seconds)\n", - "Cbc0010I After 14000000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.02 seconds)\n", - "Cbc0010I After 14001000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1118.05 seconds)\n", - "Cbc0010I After 14002000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.08 seconds)\n", - "Cbc0010I After 14003000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1118.11 seconds)\n", - "Cbc0010I After 14004000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1118.14 seconds)\n", - "Cbc0010I After 14005000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1118.17 seconds)\n", - "Cbc0010I After 14006000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1118.20 seconds)\n", - "Cbc0010I After 14007000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1118.23 seconds)\n", - "Cbc0010I After 14008000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1118.26 seconds)\n", - "Cbc0010I After 14009000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1118.30 seconds)\n", - "Cbc0010I After 14010000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1118.33 seconds)\n", - "Cbc0010I After 14011000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1118.36 seconds)\n", - "Cbc0010I After 14012000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1118.39 seconds)\n", - "Cbc0010I After 14013000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1118.42 seconds)\n", - "Cbc0010I After 14014000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1118.44 seconds)\n", - "Cbc0010I After 14015000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1118.47 seconds)\n", - "Cbc0010I After 14016000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1118.50 seconds)\n", - "Cbc0010I After 14017000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1118.53 seconds)\n", - "Cbc0010I After 14018000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1118.56 seconds)\n", - "Cbc0010I After 14019000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1118.59 seconds)\n", - "Cbc0010I After 14020000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1118.62 seconds)\n", - "Cbc0010I After 14021000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1118.65 seconds)\n", - "Cbc0010I After 14022000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1118.68 seconds)\n", - "Cbc0010I After 14023000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1118.71 seconds)\n", - "Cbc0010I After 14024000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1118.74 seconds)\n", - "Cbc0010I After 14025000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.77 seconds)\n", - "Cbc0010I After 14026000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.80 seconds)\n", - "Cbc0010I After 14027000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1118.83 seconds)\n", - "Cbc0010I After 14028000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1118.87 seconds)\n", - "Cbc0010I After 14029000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1118.91 seconds)\n", - "Cbc0010I After 14030000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1118.94 seconds)\n", - "Cbc0010I After 14031000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1118.98 seconds)\n", - "Cbc0010I After 14032000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.01 seconds)\n", - "Cbc0010I After 14033000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1119.04 seconds)\n", - "Cbc0010I After 14034000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.07 seconds)\n", - "Cbc0010I After 14035000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1119.10 seconds)\n", - "Cbc0010I After 14036000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1119.13 seconds)\n", - "Cbc0010I After 14037000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1119.16 seconds)\n", - "Cbc0010I After 14038000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1119.19 seconds)\n", - "Cbc0010I After 14039000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1119.22 seconds)\n", - "Cbc0010I After 14040000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1119.25 seconds)\n", - "Cbc0010I After 14041000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1119.29 seconds)\n", - "Cbc0010I After 14042000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1119.32 seconds)\n", - "Cbc0010I After 14043000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1119.35 seconds)\n", - "Cbc0010I After 14044000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1119.39 seconds)\n", - "Cbc0010I After 14045000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1119.42 seconds)\n", - "Cbc0010I After 14046000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1119.45 seconds)\n", - "Cbc0010I After 14047000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1119.48 seconds)\n", - "Cbc0010I After 14048000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1119.51 seconds)\n", - "Cbc0010I After 14049000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1119.55 seconds)\n", - "Cbc0010I After 14050000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1119.58 seconds)\n", - "Cbc0010I After 14051000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1119.61 seconds)\n", - "Cbc0010I After 14052000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1119.64 seconds)\n", - "Cbc0010I After 14053000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1119.68 seconds)\n", - "Cbc0010I After 14054000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1119.71 seconds)\n", - "Cbc0010I After 14055000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1119.75 seconds)\n", - "Cbc0010I After 14056000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1119.78 seconds)\n", - "Cbc0010I After 14057000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1119.81 seconds)\n", - "Cbc0010I After 14058000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1119.84 seconds)\n", - "Cbc0010I After 14059000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1119.87 seconds)\n", - "Cbc0010I After 14060000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1119.91 seconds)\n", - "Cbc0010I After 14061000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1119.95 seconds)\n", - "Cbc0010I After 14062000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1119.97 seconds)\n", - "Cbc0010I After 14063000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1120.01 seconds)\n", - "Cbc0010I After 14064000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1120.04 seconds)\n", - "Cbc0010I After 14065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1120.07 seconds)\n", - "Cbc0010I After 14066000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1120.11 seconds)\n", - "Cbc0010I After 14067000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1120.15 seconds)\n", - "Cbc0010I After 14068000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1120.18 seconds)\n", - "Cbc0010I After 14069000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1120.22 seconds)\n", - "Cbc0010I After 14070000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1120.25 seconds)\n", - "Cbc0010I After 14071000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1120.28 seconds)\n", - "Cbc0010I After 14072000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1120.31 seconds)\n", - "Cbc0010I After 14073000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1120.35 seconds)\n", - "Cbc0010I After 14074000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1120.38 seconds)\n", - "Cbc0010I After 14075000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1120.42 seconds)\n", - "Cbc0010I After 14076000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1120.45 seconds)\n", - "Cbc0010I After 14077000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1120.48 seconds)\n", - "Cbc0010I After 14078000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1120.52 seconds)\n", - "Cbc0010I After 14079000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1120.55 seconds)\n", - "Cbc0010I After 14080000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1120.59 seconds)\n", - "Cbc0010I After 14081000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1120.62 seconds)\n", - "Cbc0010I After 14082000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1120.65 seconds)\n", - "Cbc0010I After 14083000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1120.69 seconds)\n", - "Cbc0010I After 14084000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1120.72 seconds)\n", - "Cbc0010I After 14085000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1120.76 seconds)\n", - "Cbc0010I After 14086000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1120.80 seconds)\n", - "Cbc0010I After 14087000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1120.83 seconds)\n", - "Cbc0010I After 14088000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1120.87 seconds)\n", - "Cbc0010I After 14089000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1120.91 seconds)\n", - "Cbc0010I After 14090000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1120.94 seconds)\n", - "Cbc0010I After 14091000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1120.98 seconds)\n", - "Cbc0010I After 14092000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1121.02 seconds)\n", - "Cbc0010I After 14093000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1121.05 seconds)\n", - "Cbc0010I After 14094000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1121.08 seconds)\n", - "Cbc0010I After 14095000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1121.10 seconds)\n", - "Cbc0010I After 14096000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1121.13 seconds)\n", - "Cbc0010I After 14097000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.16 seconds)\n", - "Cbc0010I After 14098000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1121.19 seconds)\n", - "Cbc0010I After 14099000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.22 seconds)\n", - "Cbc0010I After 14100000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1121.25 seconds)\n", - "Cbc0010I After 14101000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1121.28 seconds)\n", - "Cbc0010I After 14102000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1121.31 seconds)\n", - "Cbc0010I After 14103000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1121.34 seconds)\n", - "Cbc0010I After 14104000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1121.37 seconds)\n", - "Cbc0010I After 14105000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1121.40 seconds)\n", - "Cbc0010I After 14106000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1121.43 seconds)\n", - "Cbc0010I After 14107000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1121.46 seconds)\n", - "Cbc0010I After 14108000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1121.49 seconds)\n", - "Cbc0010I After 14109000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1121.52 seconds)\n", - "Cbc0010I After 14110000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1121.56 seconds)\n", - "Cbc0010I After 14111000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1121.59 seconds)\n", - "Cbc0010I After 14112000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1121.63 seconds)\n", - "Cbc0010I After 14113000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1121.68 seconds)\n", - "Cbc0010I After 14114000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1121.73 seconds)\n", - "Cbc0010I After 14115000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1121.77 seconds)\n", - "Cbc0010I After 14116000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1121.81 seconds)\n", - "Cbc0010I After 14117000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1121.84 seconds)\n", - "Cbc0010I After 14118000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1121.88 seconds)\n", - "Cbc0010I After 14119000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1121.91 seconds)\n", - "Cbc0010I After 14120000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1121.95 seconds)\n", - "Cbc0010I After 14121000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1121.98 seconds)\n", - "Cbc0010I After 14122000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1122.01 seconds)\n", - "Cbc0010I After 14123000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1122.04 seconds)\n", - "Cbc0010I After 14124000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1122.07 seconds)\n", - "Cbc0010I After 14125000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1122.11 seconds)\n", - "Cbc0010I After 14126000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1122.14 seconds)\n", - "Cbc0010I After 14127000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1122.17 seconds)\n", - "Cbc0010I After 14128000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1122.20 seconds)\n", - "Cbc0010I After 14129000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.23 seconds)\n", - "Cbc0010I After 14130000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1122.25 seconds)\n", - "Cbc0010I After 14131000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.28 seconds)\n", - "Cbc0010I After 14132000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1122.32 seconds)\n", - "Cbc0010I After 14133000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.34 seconds)\n", - "Cbc0010I After 14134000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1122.38 seconds)\n", - "Cbc0010I After 14135000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1122.41 seconds)\n", - "Cbc0010I After 14136000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1122.45 seconds)\n", - "Cbc0010I After 14137000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1122.48 seconds)\n", - "Cbc0010I After 14138000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1122.51 seconds)\n", - "Cbc0010I After 14139000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1122.54 seconds)\n", - "Cbc0010I After 14140000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.57 seconds)\n", - "Cbc0010I After 14141000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1122.61 seconds)\n", - "Cbc0010I After 14142000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1122.65 seconds)\n", - "Cbc0010I After 14143000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1122.68 seconds)\n", - "Cbc0010I After 14144000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1122.72 seconds)\n", - "Cbc0010I After 14145000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1122.75 seconds)\n", - "Cbc0010I After 14146000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1122.78 seconds)\n", - "Cbc0010I After 14147000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.81 seconds)\n", - "Cbc0010I After 14148000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1122.84 seconds)\n", - "Cbc0010I After 14149000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1122.87 seconds)\n", - "Cbc0010I After 14150000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1122.90 seconds)\n", - "Cbc0010I After 14151000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1122.93 seconds)\n", - "Cbc0010I After 14152000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1122.97 seconds)\n", - "Cbc0010I After 14153000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1123.00 seconds)\n", - "Cbc0010I After 14154000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1123.04 seconds)\n", - "Cbc0010I After 14155000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1123.07 seconds)\n", - "Cbc0010I After 14156000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1123.10 seconds)\n", - "Cbc0010I After 14157000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1123.14 seconds)\n", - "Cbc0010I After 14158000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1123.17 seconds)\n", - "Cbc0010I After 14159000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1123.21 seconds)\n", - "Cbc0010I After 14160000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1123.24 seconds)\n", - "Cbc0010I After 14161000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1123.27 seconds)\n", - "Cbc0010I After 14162000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1123.30 seconds)\n", - "Cbc0010I After 14163000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1123.33 seconds)\n", - "Cbc0010I After 14164000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1123.37 seconds)\n", - "Cbc0010I After 14165000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1123.41 seconds)\n", - "Cbc0010I After 14166000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1123.44 seconds)\n", - "Cbc0010I After 14167000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1123.48 seconds)\n", - "Cbc0010I After 14168000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1123.52 seconds)\n", - "Cbc0010I After 14169000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1123.55 seconds)\n", - "Cbc0010I After 14170000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1123.58 seconds)\n", - "Cbc0010I After 14171000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1123.62 seconds)\n", - "Cbc0010I After 14172000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1123.65 seconds)\n", - "Cbc0010I After 14173000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1123.69 seconds)\n", - "Cbc0010I After 14174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1123.72 seconds)\n", - "Cbc0010I After 14175000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1123.76 seconds)\n", - "Cbc0010I After 14176000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1123.79 seconds)\n", - "Cbc0010I After 14177000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1123.82 seconds)\n", - "Cbc0010I After 14178000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1123.86 seconds)\n", - "Cbc0010I After 14179000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1123.90 seconds)\n", - "Cbc0010I After 14180000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1123.94 seconds)\n", - "Cbc0010I After 14181000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1123.97 seconds)\n", - "Cbc0010I After 14182000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1124.01 seconds)\n", - "Cbc0010I After 14183000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1124.04 seconds)\n", - "Cbc0010I After 14184000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1124.08 seconds)\n", - "Cbc0010I After 14185000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1124.12 seconds)\n", - "Cbc0010I After 14186000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1124.16 seconds)\n", - "Cbc0010I After 14187000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1124.20 seconds)\n", - "Cbc0010I After 14188000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1124.23 seconds)\n", - "Cbc0010I After 14189000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1124.26 seconds)\n", - "Cbc0010I After 14190000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1124.31 seconds)\n", - "Cbc0010I After 14191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1124.34 seconds)\n", - "Cbc0010I After 14192000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1124.40 seconds)\n", - "Cbc0010I After 14193000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1124.46 seconds)\n", - "Cbc0010I After 14194000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1124.52 seconds)\n", - "Cbc0010I After 14195000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.56 seconds)\n", - "Cbc0010I After 14196000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1124.61 seconds)\n", - "Cbc0010I After 14197000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1124.66 seconds)\n", - "Cbc0010I After 14198000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1124.70 seconds)\n", - "Cbc0010I After 14199000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1124.73 seconds)\n", - "Cbc0010I After 14200000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1124.76 seconds)\n", - "Cbc0010I After 14201000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.79 seconds)\n", - "Cbc0010I After 14202000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1124.83 seconds)\n", - "Cbc0010I After 14203000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1124.86 seconds)\n", - "Cbc0010I After 14204000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1124.89 seconds)\n", - "Cbc0010I After 14205000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1124.93 seconds)\n", - "Cbc0010I After 14206000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1124.96 seconds)\n", - "Cbc0010I After 14207000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1125.00 seconds)\n", - "Cbc0010I After 14208000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1125.03 seconds)\n", - "Cbc0010I After 14209000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1125.06 seconds)\n", - "Cbc0010I After 14210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1125.09 seconds)\n", - "Cbc0010I After 14211000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1125.13 seconds)\n", - "Cbc0010I After 14212000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1125.16 seconds)\n", - "Cbc0010I After 14213000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1125.19 seconds)\n", - "Cbc0010I After 14214000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1125.22 seconds)\n", - "Cbc0010I After 14215000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1125.25 seconds)\n", - "Cbc0010I After 14216000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1125.29 seconds)\n", - "Cbc0010I After 14217000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1125.33 seconds)\n", - "Cbc0010I After 14218000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1125.36 seconds)\n", - "Cbc0010I After 14219000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1125.39 seconds)\n", - "Cbc0010I After 14220000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1125.43 seconds)\n", - "Cbc0010I After 14221000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1125.47 seconds)\n", - "Cbc0010I After 14222000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1125.50 seconds)\n", - "Cbc0010I After 14223000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1125.53 seconds)\n", - "Cbc0010I After 14224000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1125.57 seconds)\n", - "Cbc0010I After 14225000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1125.61 seconds)\n", - "Cbc0010I After 14226000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1125.64 seconds)\n", - "Cbc0010I After 14227000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1125.67 seconds)\n", - "Cbc0010I After 14228000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1125.71 seconds)\n", - "Cbc0010I After 14229000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1125.74 seconds)\n", - "Cbc0010I After 14230000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1125.77 seconds)\n", - "Cbc0010I After 14231000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1125.81 seconds)\n", - "Cbc0010I After 14232000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1125.84 seconds)\n", - "Cbc0010I After 14233000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1125.87 seconds)\n", - "Cbc0010I After 14234000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1125.90 seconds)\n", - "Cbc0010I After 14235000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1125.94 seconds)\n", - "Cbc0010I After 14236000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1125.98 seconds)\n", - "Cbc0010I After 14237000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1126.01 seconds)\n", - "Cbc0010I After 14238000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1126.05 seconds)\n", - "Cbc0010I After 14239000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1126.08 seconds)\n", - "Cbc0010I After 14240000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1126.12 seconds)\n", - "Cbc0010I After 14241000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1126.16 seconds)\n", - "Cbc0010I After 14242000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1126.20 seconds)\n", - "Cbc0010I After 14243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1126.24 seconds)\n", - "Cbc0010I After 14244000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1126.27 seconds)\n", - "Cbc0010I After 14245000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1126.31 seconds)\n", - "Cbc0010I After 14246000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1126.34 seconds)\n", - "Cbc0010I After 14247000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.38 seconds)\n", - "Cbc0010I After 14248000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1126.41 seconds)\n", - "Cbc0010I After 14249000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1126.45 seconds)\n", - "Cbc0010I After 14250000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1126.48 seconds)\n", - "Cbc0010I After 14251000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1126.51 seconds)\n", - "Cbc0010I After 14252000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1126.54 seconds)\n", - "Cbc0010I After 14253000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1126.58 seconds)\n", - "Cbc0010I After 14254000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1126.62 seconds)\n", - "Cbc0010I After 14255000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1126.65 seconds)\n", - "Cbc0010I After 14256000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1126.70 seconds)\n", - "Cbc0010I After 14257000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1126.73 seconds)\n", - "Cbc0010I After 14258000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1126.77 seconds)\n", - "Cbc0010I After 14259000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1126.81 seconds)\n", - "Cbc0010I After 14260000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1126.83 seconds)\n", - "Cbc0010I After 14261000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1126.86 seconds)\n", - "Cbc0010I After 14262000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.89 seconds)\n", - "Cbc0010I After 14263000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1126.92 seconds)\n", - "Cbc0010I After 14264000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1126.95 seconds)\n", - "Cbc0010I After 14265000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1126.98 seconds)\n", - "Cbc0010I After 14266000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1127.01 seconds)\n", - "Cbc0010I After 14267000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1127.04 seconds)\n", - "Cbc0010I After 14268000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1127.07 seconds)\n", - "Cbc0010I After 14269000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1127.09 seconds)\n", - "Cbc0010I After 14270000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1127.12 seconds)\n", - "Cbc0010I After 14271000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1127.15 seconds)\n", - "Cbc0010I After 14272000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1127.18 seconds)\n", - "Cbc0010I After 14273000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1127.21 seconds)\n", - "Cbc0010I After 14274000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1127.24 seconds)\n", - "Cbc0010I After 14275000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1127.27 seconds)\n", - "Cbc0010I After 14276000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1127.30 seconds)\n", - "Cbc0010I After 14277000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.34 seconds)\n", - "Cbc0010I After 14278000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1127.37 seconds)\n", - "Cbc0010I After 14279000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1127.40 seconds)\n", - "Cbc0010I After 14280000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1127.43 seconds)\n", - "Cbc0010I After 14281000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1127.46 seconds)\n", - "Cbc0010I After 14282000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1127.49 seconds)\n", - "Cbc0010I After 14283000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1127.52 seconds)\n", - "Cbc0010I After 14284000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1127.55 seconds)\n", - "Cbc0010I After 14285000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1127.58 seconds)\n", - "Cbc0010I After 14286000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1127.62 seconds)\n", - "Cbc0010I After 14287000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1127.65 seconds)\n", - "Cbc0010I After 14288000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1127.68 seconds)\n", - "Cbc0010I After 14289000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.72 seconds)\n", - "Cbc0010I After 14290000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1127.75 seconds)\n", - "Cbc0010I After 14291000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1127.79 seconds)\n", - "Cbc0010I After 14292000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.82 seconds)\n", - "Cbc0010I After 14293000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.85 seconds)\n", - "Cbc0010I After 14294000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1127.89 seconds)\n", - "Cbc0010I After 14295000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1127.92 seconds)\n", - "Cbc0010I After 14296000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1127.95 seconds)\n", - "Cbc0010I After 14297000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1127.98 seconds)\n", - "Cbc0010I After 14298000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1128.02 seconds)\n", - "Cbc0010I After 14299000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1128.06 seconds)\n", - "Cbc0010I After 14300000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1128.09 seconds)\n", - "Cbc0010I After 14301000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1128.12 seconds)\n", - "Cbc0010I After 14302000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1128.16 seconds)\n", - "Cbc0010I After 14303000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1128.20 seconds)\n", - "Cbc0010I After 14304000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1128.23 seconds)\n", - "Cbc0010I After 14305000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1128.26 seconds)\n", - "Cbc0010I After 14306000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1128.29 seconds)\n", - "Cbc0010I After 14307000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1128.33 seconds)\n", - "Cbc0010I After 14308000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1128.37 seconds)\n", - "Cbc0010I After 14309000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1128.40 seconds)\n", - "Cbc0010I After 14310000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1128.44 seconds)\n", - "Cbc0010I After 14311000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1128.47 seconds)\n", - "Cbc0010I After 14312000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1128.50 seconds)\n", - "Cbc0010I After 14313000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1128.55 seconds)\n", - "Cbc0010I After 14314000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1128.58 seconds)\n", - "Cbc0010I After 14315000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1128.62 seconds)\n", - "Cbc0010I After 14316000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1128.65 seconds)\n", - "Cbc0010I After 14317000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1128.70 seconds)\n", - "Cbc0010I After 14318000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1128.74 seconds)\n", - "Cbc0010I After 14319000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1128.79 seconds)\n", - "Cbc0010I After 14320000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1128.83 seconds)\n", - "Cbc0010I After 14321000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1128.86 seconds)\n", - "Cbc0010I After 14322000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1128.90 seconds)\n", - "Cbc0010I After 14323000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1128.93 seconds)\n", - "Cbc0010I After 14324000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1128.97 seconds)\n", - "Cbc0010I After 14325000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1129.00 seconds)\n", - "Cbc0010I After 14326000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1129.04 seconds)\n", - "Cbc0010I After 14327000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1129.08 seconds)\n", - "Cbc0010I After 14328000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1129.12 seconds)\n", - "Cbc0010I After 14329000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1129.16 seconds)\n", - "Cbc0010I After 14330000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1129.20 seconds)\n", - "Cbc0010I After 14331000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1129.23 seconds)\n", - "Cbc0010I After 14332000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1129.26 seconds)\n", - "Cbc0010I After 14333000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1129.28 seconds)\n", - "Cbc0010I After 14334000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1129.32 seconds)\n", - "Cbc0010I After 14335000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1129.34 seconds)\n", - "Cbc0010I After 14336000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1129.37 seconds)\n", - "Cbc0010I After 14337000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1129.41 seconds)\n", - "Cbc0010I After 14338000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1129.44 seconds)\n", - "Cbc0010I After 14339000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1129.48 seconds)\n", - "Cbc0010I After 14340000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1129.50 seconds)\n", - "Cbc0010I After 14341000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1129.54 seconds)\n", - "Cbc0010I After 14342000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1129.57 seconds)\n", - "Cbc0010I After 14343000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1129.61 seconds)\n", - "Cbc0010I After 14344000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1129.65 seconds)\n", - "Cbc0010I After 14345000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1129.68 seconds)\n", - "Cbc0010I After 14346000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1129.71 seconds)\n", - "Cbc0010I After 14347000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1129.75 seconds)\n", - "Cbc0010I After 14348000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1129.78 seconds)\n", - "Cbc0010I After 14349000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1129.81 seconds)\n", - "Cbc0010I After 14350000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (1129.85 seconds)\n", - "Cbc0010I After 14351000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1129.88 seconds)\n", - "Cbc0010I After 14352000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1129.91 seconds)\n", - "Cbc0010I After 14353000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1129.95 seconds)\n", - "Cbc0010I After 14354000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1130.00 seconds)\n", - "Cbc0010I After 14355000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1130.03 seconds)\n", - "Cbc0010I After 14356000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1130.06 seconds)\n", - "Cbc0010I After 14357000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1130.10 seconds)\n", - "Cbc0010I After 14358000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1130.15 seconds)\n", - "Cbc0010I After 14359000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1130.18 seconds)\n", - "Cbc0010I After 14360000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1130.21 seconds)\n", - "Cbc0010I After 14361000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1130.25 seconds)\n", - "Cbc0010I After 14362000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1130.29 seconds)\n", - "Cbc0010I After 14363000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1130.33 seconds)\n", - "Cbc0010I After 14364000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1130.38 seconds)\n", - "Cbc0010I After 14365000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1130.42 seconds)\n", - "Cbc0010I After 14366000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1130.46 seconds)\n", - "Cbc0010I After 14367000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1130.51 seconds)\n", - "Cbc0010I After 14368000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1130.55 seconds)\n", - "Cbc0010I After 14369000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1130.60 seconds)\n", - "Cbc0010I After 14370000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1130.64 seconds)\n", - "Cbc0010I After 14371000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1130.68 seconds)\n", - "Cbc0010I After 14372000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1130.73 seconds)\n", - "Cbc0010I After 14373000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1130.77 seconds)\n", - "Cbc0010I After 14374000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1130.82 seconds)\n", - "Cbc0010I After 14375000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1130.86 seconds)\n", - "Cbc0010I After 14376000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1130.91 seconds)\n", - "Cbc0010I After 14377000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1130.95 seconds)\n", - "Cbc0010I After 14378000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1130.99 seconds)\n", - "Cbc0010I After 14379000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1131.04 seconds)\n", - "Cbc0010I After 14380000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1131.08 seconds)\n", - "Cbc0010I After 14381000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1131.11 seconds)\n", - "Cbc0010I After 14382000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1131.15 seconds)\n", - "Cbc0010I After 14383000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1131.18 seconds)\n", - "Cbc0010I After 14384000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1131.21 seconds)\n", - "Cbc0010I After 14385000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1131.25 seconds)\n", - "Cbc0010I After 14386000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1131.28 seconds)\n", - "Cbc0010I After 14387000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1131.32 seconds)\n", - "Cbc0010I After 14388000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1131.37 seconds)\n", - "Cbc0010I After 14389000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1131.41 seconds)\n", - "Cbc0010I After 14390000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1131.44 seconds)\n", - "Cbc0010I After 14391000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1131.47 seconds)\n", - "Cbc0010I After 14392000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1131.51 seconds)\n", - "Cbc0010I After 14393000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1131.55 seconds)\n", - "Cbc0010I After 14394000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1131.59 seconds)\n", - "Cbc0010I After 14395000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1131.67 seconds)\n", - "Cbc0010I After 14396000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1131.74 seconds)\n", - "Cbc0010I After 14397000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1131.81 seconds)\n", - "Cbc0010I After 14398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1131.90 seconds)\n", - "Cbc0010I After 14399000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1131.98 seconds)\n", - "Cbc0010I After 14400000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1132.04 seconds)\n", - "Cbc0010I After 14401000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1132.10 seconds)\n", - "Cbc0010I After 14402000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1132.17 seconds)\n", - "Cbc0010I After 14403000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1132.25 seconds)\n", - "Cbc0010I After 14404000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1132.31 seconds)\n", - "Cbc0010I After 14405000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1132.36 seconds)\n", - "Cbc0010I After 14406000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1132.43 seconds)\n", - "Cbc0010I After 14407000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1132.50 seconds)\n", - "Cbc0010I After 14408000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1132.56 seconds)\n", - "Cbc0010I After 14409000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1132.61 seconds)\n", - "Cbc0010I After 14410000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1132.69 seconds)\n", - "Cbc0010I After 14411000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1132.75 seconds)\n", - "Cbc0010I After 14412000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1132.80 seconds)\n", - "Cbc0010I After 14413000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1132.87 seconds)\n", - "Cbc0010I After 14414000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1132.95 seconds)\n", - "Cbc0010I After 14415000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1133.00 seconds)\n", - "Cbc0010I After 14416000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1133.07 seconds)\n", - "Cbc0010I After 14417000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1133.14 seconds)\n", - "Cbc0010I After 14418000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1133.19 seconds)\n", - "Cbc0010I After 14419000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.24 seconds)\n", - "Cbc0010I After 14420000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1133.32 seconds)\n", - "Cbc0010I After 14421000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1133.38 seconds)\n", - "Cbc0010I After 14422000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1133.43 seconds)\n", - "Cbc0010I After 14423000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1133.49 seconds)\n", - "Cbc0010I After 14424000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.57 seconds)\n", - "Cbc0010I After 14425000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1133.63 seconds)\n", - "Cbc0010I After 14426000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1133.68 seconds)\n", - "Cbc0010I After 14427000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1133.76 seconds)\n", - "Cbc0010I After 14428000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1133.83 seconds)\n", - "Cbc0010I After 14429000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1133.88 seconds)\n", - "Cbc0010I After 14430000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1133.94 seconds)\n", - "Cbc0010I After 14431000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1134.02 seconds)\n", - "Cbc0010I After 14432000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1134.08 seconds)\n", - "Cbc0010I After 14433000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1134.14 seconds)\n", - "Cbc0010I After 14434000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.22 seconds)\n", - "Cbc0010I After 14435000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.29 seconds)\n", - "Cbc0010I After 14436000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1134.34 seconds)\n", - "Cbc0010I After 14437000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1134.41 seconds)\n", - "Cbc0010I After 14438000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1134.48 seconds)\n", - "Cbc0010I After 14439000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1134.54 seconds)\n", - "Cbc0010I After 14440000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1134.60 seconds)\n", - "Cbc0010I After 14441000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.67 seconds)\n", - "Cbc0010I After 14442000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1134.73 seconds)\n", - "Cbc0010I After 14443000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1134.79 seconds)\n", - "Cbc0010I After 14444000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1134.87 seconds)\n", - "Cbc0010I After 14445000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1134.92 seconds)\n", - "Cbc0010I After 14446000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1134.97 seconds)\n", - "Cbc0010I After 14447000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1135.05 seconds)\n", - "Cbc0010I After 14448000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1135.11 seconds)\n", - "Cbc0010I After 14449000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1135.17 seconds)\n", - "Cbc0010I After 14450000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.24 seconds)\n", - "Cbc0010I After 14451000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1135.31 seconds)\n", - "Cbc0010I After 14452000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1135.38 seconds)\n", - "Cbc0010I After 14453000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.46 seconds)\n", - "Cbc0010I After 14454000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1135.54 seconds)\n", - "Cbc0010I After 14455000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1135.60 seconds)\n", - "Cbc0010I After 14456000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1135.67 seconds)\n", - "Cbc0010I After 14457000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1135.72 seconds)\n", - "Cbc0010I After 14458000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1135.78 seconds)\n", - "Cbc0010I After 14459000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1135.85 seconds)\n", - "Cbc0010I After 14460000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1135.89 seconds)\n", - "Cbc0010I After 14461000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1135.95 seconds)\n", - "Cbc0010I After 14462000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.02 seconds)\n", - "Cbc0010I After 14463000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1136.07 seconds)\n", - "Cbc0010I After 14464000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1136.13 seconds)\n", - "Cbc0010I After 14465000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1136.19 seconds)\n", - "Cbc0010I After 14466000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1136.25 seconds)\n", - "Cbc0010I After 14467000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1136.31 seconds)\n", - "Cbc0010I After 14468000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.38 seconds)\n", - "Cbc0010I After 14469000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1136.43 seconds)\n", - "Cbc0010I After 14470000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1136.49 seconds)\n", - "Cbc0010I After 14471000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1136.56 seconds)\n", - "Cbc0010I After 14472000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1136.61 seconds)\n", - "Cbc0010I After 14473000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1136.66 seconds)\n", - "Cbc0010I After 14474000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1136.74 seconds)\n", - "Cbc0010I After 14475000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1136.79 seconds)\n", - "Cbc0010I After 14476000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1136.85 seconds)\n", - "Cbc0010I After 14477000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1136.92 seconds)\n", - "Cbc0010I After 14478000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1136.97 seconds)\n", - "Cbc0010I After 14479000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1137.03 seconds)\n", - "Cbc0010I After 14480000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1137.09 seconds)\n", - "Cbc0010I After 14481000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1137.14 seconds)\n", - "Cbc0010I After 14482000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1137.23 seconds)\n", - "Cbc0010I After 14483000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1137.30 seconds)\n", - "Cbc0010I After 14484000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1137.36 seconds)\n", - "Cbc0010I After 14485000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1137.44 seconds)\n", - "Cbc0010I After 14486000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1137.49 seconds)\n", - "Cbc0010I After 14487000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1137.56 seconds)\n", - "Cbc0010I After 14488000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1137.64 seconds)\n", - "Cbc0010I After 14489000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1137.70 seconds)\n", - "Cbc0010I After 14490000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1137.76 seconds)\n", - "Cbc0010I After 14491000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1137.82 seconds)\n", - "Cbc0010I After 14492000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1137.88 seconds)\n", - "Cbc0010I After 14493000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1137.95 seconds)\n", - "Cbc0010I After 14494000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1138.00 seconds)\n", - "Cbc0010I After 14495000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1138.06 seconds)\n", - "Cbc0010I After 14496000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1138.11 seconds)\n", - "Cbc0010I After 14497000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1138.18 seconds)\n", - "Cbc0010I After 14498000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1138.23 seconds)\n", - "Cbc0010I After 14499000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.30 seconds)\n", - "Cbc0010I After 14500000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1138.38 seconds)\n", - "Cbc0010I After 14501000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.46 seconds)\n", - "Cbc0010I After 14502000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1138.52 seconds)\n", - "Cbc0010I After 14503000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1138.58 seconds)\n", - "Cbc0010I After 14504000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1138.63 seconds)\n", - "Cbc0010I After 14505000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1138.70 seconds)\n", - "Cbc0010I After 14506000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1138.75 seconds)\n", - "Cbc0010I After 14507000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1138.81 seconds)\n", - "Cbc0010I After 14508000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1138.89 seconds)\n", - "Cbc0010I After 14509000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1138.96 seconds)\n", - "Cbc0010I After 14510000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1139.08 seconds)\n", - "Cbc0010I After 14511000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1139.19 seconds)\n", - "Cbc0010I After 14512000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1139.30 seconds)\n", - "Cbc0010I After 14513000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1139.39 seconds)\n", - "Cbc0010I After 14514000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1139.46 seconds)\n", - "Cbc0010I After 14515000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1139.55 seconds)\n", - "Cbc0010I After 14516000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1139.60 seconds)\n", - "Cbc0010I After 14517000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1139.68 seconds)\n", - "Cbc0010I After 14518000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1139.74 seconds)\n", - "Cbc0010I After 14519000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1139.82 seconds)\n", - "Cbc0010I After 14520000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1139.96 seconds)\n", - "Cbc0010I After 14521000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1140.08 seconds)\n", - "Cbc0010I After 14522000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1140.16 seconds)\n", - "Cbc0010I After 14523000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1140.23 seconds)\n", - "Cbc0010I After 14524000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1140.31 seconds)\n", - "Cbc0010I After 14525000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1140.39 seconds)\n", - "Cbc0010I After 14526000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1140.46 seconds)\n", - "Cbc0010I After 14527000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.52 seconds)\n", - "Cbc0010I After 14528000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1140.60 seconds)\n", - "Cbc0010I After 14529000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.65 seconds)\n", - "Cbc0010I After 14530000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1140.72 seconds)\n", - "Cbc0010I After 14531000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1140.79 seconds)\n", - "Cbc0010I After 14532000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1140.84 seconds)\n", - "Cbc0010I After 14533000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1140.90 seconds)\n", - "Cbc0010I After 14534000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1140.97 seconds)\n", - "Cbc0010I After 14535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1141.03 seconds)\n", - "Cbc0010I After 14536000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1141.10 seconds)\n", - "Cbc0010I After 14537000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1141.16 seconds)\n", - "Cbc0010I After 14538000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1141.23 seconds)\n", - "Cbc0010I After 14539000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1141.29 seconds)\n", - "Cbc0010I After 14540000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1141.36 seconds)\n", - "Cbc0010I After 14541000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1141.43 seconds)\n", - "Cbc0010I After 14542000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1141.50 seconds)\n", - "Cbc0010I After 14543000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1141.56 seconds)\n", - "Cbc0010I After 14544000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1141.63 seconds)\n", - "Cbc0010I After 14545000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1141.69 seconds)\n", - "Cbc0010I After 14546000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1141.75 seconds)\n", - "Cbc0010I After 14547000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1141.81 seconds)\n", - "Cbc0010I After 14548000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1141.88 seconds)\n", - "Cbc0010I After 14549000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1141.94 seconds)\n", - "Cbc0010I After 14550000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1141.99 seconds)\n", - "Cbc0010I After 14551000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1142.06 seconds)\n", - "Cbc0010I After 14552000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1142.12 seconds)\n", - "Cbc0010I After 14553000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1142.19 seconds)\n", - "Cbc0010I After 14554000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1142.26 seconds)\n", - "Cbc0010I After 14555000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1142.32 seconds)\n", - "Cbc0010I After 14556000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1142.39 seconds)\n", - "Cbc0010I After 14557000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1142.45 seconds)\n", - "Cbc0010I After 14558000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1142.52 seconds)\n", - "Cbc0010I After 14559000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1142.58 seconds)\n", - "Cbc0010I After 14560000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1142.64 seconds)\n", - "Cbc0010I After 14561000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1142.71 seconds)\n", - "Cbc0010I After 14562000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1142.78 seconds)\n", - "Cbc0010I After 14563000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1142.84 seconds)\n", - "Cbc0010I After 14564000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1142.92 seconds)\n", - "Cbc0010I After 14565000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.01 seconds)\n", - "Cbc0010I After 14566000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1143.07 seconds)\n", - "Cbc0010I After 14567000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.14 seconds)\n", - "Cbc0010I After 14568000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1143.21 seconds)\n", - "Cbc0010I After 14569000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1143.27 seconds)\n", - "Cbc0010I After 14570000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1143.33 seconds)\n", - "Cbc0010I After 14571000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1143.38 seconds)\n", - "Cbc0010I After 14572000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1143.44 seconds)\n", - "Cbc0010I After 14573000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1143.50 seconds)\n", - "Cbc0010I After 14574000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1143.56 seconds)\n", - "Cbc0010I After 14575000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.62 seconds)\n", - "Cbc0010I After 14576000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1143.68 seconds)\n", - "Cbc0010I After 14577000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1143.73 seconds)\n", - "Cbc0010I After 14578000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1143.79 seconds)\n", - "Cbc0010I After 14579000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1143.86 seconds)\n", - "Cbc0010I After 14580000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1143.92 seconds)\n", - "Cbc0010I After 14581000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1143.99 seconds)\n", - "Cbc0010I After 14582000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1144.05 seconds)\n", - "Cbc0010I After 14583000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1144.11 seconds)\n", - "Cbc0010I After 14584000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.17 seconds)\n", - "Cbc0010I After 14585000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1144.22 seconds)\n", - "Cbc0010I After 14586000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1144.28 seconds)\n", - "Cbc0010I After 14587000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1144.36 seconds)\n", - "Cbc0010I After 14588000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1144.42 seconds)\n", - "Cbc0010I After 14589000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1144.48 seconds)\n", - "Cbc0010I After 14590000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1144.54 seconds)\n", - "Cbc0010I After 14591000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.60 seconds)\n", - "Cbc0010I After 14592000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1144.66 seconds)\n", - "Cbc0010I After 14593000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1144.72 seconds)\n", - "Cbc0010I After 14594000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1144.78 seconds)\n", - "Cbc0010I After 14595000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1144.85 seconds)\n", - "Cbc0010I After 14596000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1144.91 seconds)\n", - "Cbc0010I After 14597000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1144.97 seconds)\n", - "Cbc0010I After 14598000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1145.03 seconds)\n", - "Cbc0010I After 14599000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.08 seconds)\n", - "Cbc0010I After 14600000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1145.14 seconds)\n", - "Cbc0010I After 14601000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.20 seconds)\n", - "Cbc0010I After 14602000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1145.26 seconds)\n", - "Cbc0010I After 14603000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1145.32 seconds)\n", - "Cbc0010I After 14604000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1145.38 seconds)\n", - "Cbc0010I After 14605000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.44 seconds)\n", - "Cbc0010I After 14606000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1145.50 seconds)\n", - "Cbc0010I After 14607000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1145.56 seconds)\n", - "Cbc0010I After 14608000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1145.67 seconds)\n", - "Cbc0010I After 14609000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1145.74 seconds)\n", - "Cbc0010I After 14610000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1145.80 seconds)\n", - "Cbc0010I After 14611000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1145.87 seconds)\n", - "Cbc0010I After 14612000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1145.93 seconds)\n", - "Cbc0010I After 14613000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1145.99 seconds)\n", - "Cbc0010I After 14614000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1146.06 seconds)\n", - "Cbc0010I After 14615000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1146.11 seconds)\n", - "Cbc0010I After 14616000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1146.18 seconds)\n", - "Cbc0010I After 14617000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1146.23 seconds)\n", - "Cbc0010I After 14618000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1146.29 seconds)\n", - "Cbc0010I After 14619000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1146.35 seconds)\n", - "Cbc0010I After 14620000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1146.40 seconds)\n", - "Cbc0010I After 14621000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1146.46 seconds)\n", - "Cbc0010I After 14622000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1146.51 seconds)\n", - "Cbc0010I After 14623000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1146.56 seconds)\n", - "Cbc0010I After 14624000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1146.64 seconds)\n", - "Cbc0010I After 14625000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1146.71 seconds)\n", - "Cbc0010I After 14626000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1146.78 seconds)\n", - "Cbc0010I After 14627000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1146.86 seconds)\n", - "Cbc0010I After 14628000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1146.93 seconds)\n", - "Cbc0010I After 14629000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1147.00 seconds)\n", - "Cbc0010I After 14630000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1147.08 seconds)\n", - "Cbc0010I After 14631000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1147.15 seconds)\n", - "Cbc0010I After 14632000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1147.22 seconds)\n", - "Cbc0010I After 14633000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1147.29 seconds)\n", - "Cbc0010I After 14634000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1147.36 seconds)\n", - "Cbc0010I After 14635000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1147.43 seconds)\n", - "Cbc0010I After 14636000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1147.51 seconds)\n", - "Cbc0010I After 14637000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1147.58 seconds)\n", - "Cbc0010I After 14638000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1147.65 seconds)\n", - "Cbc0010I After 14639000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1147.72 seconds)\n", - "Cbc0010I After 14640000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1147.80 seconds)\n", - "Cbc0010I After 14641000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1147.87 seconds)\n", - "Cbc0010I After 14642000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1147.94 seconds)\n", - "Cbc0010I After 14643000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1148.00 seconds)\n", - "Cbc0010I After 14644000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1148.07 seconds)\n", - "Cbc0010I After 14645000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1148.14 seconds)\n", - "Cbc0010I After 14646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1148.22 seconds)\n", - "Cbc0010I After 14647000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1148.30 seconds)\n", - "Cbc0010I After 14648000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1148.38 seconds)\n", - "Cbc0010I After 14649000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1148.46 seconds)\n", - "Cbc0010I After 14650000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1148.54 seconds)\n", - "Cbc0010I After 14651000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1148.60 seconds)\n", - "Cbc0010I After 14652000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1148.68 seconds)\n", - "Cbc0010I After 14653000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1148.76 seconds)\n", - "Cbc0010I After 14654000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1148.85 seconds)\n", - "Cbc0010I After 14655000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1148.94 seconds)\n", - "Cbc0010I After 14656000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1149.03 seconds)\n", - "Cbc0010I After 14657000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1149.11 seconds)\n", - "Cbc0010I After 14658000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1149.19 seconds)\n", - "Cbc0010I After 14659000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1149.27 seconds)\n", - "Cbc0010I After 14660000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1149.34 seconds)\n", - "Cbc0010I After 14661000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1149.42 seconds)\n", - "Cbc0010I After 14662000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1149.49 seconds)\n", - "Cbc0010I After 14663000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1149.57 seconds)\n", - "Cbc0010I After 14664000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1149.64 seconds)\n", - "Cbc0010I After 14665000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1149.72 seconds)\n", - "Cbc0010I After 14666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1149.80 seconds)\n", - "Cbc0010I After 14667000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1149.87 seconds)\n", - "Cbc0010I After 14668000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1149.97 seconds)\n", - "Cbc0010I After 14669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1150.05 seconds)\n", - "Cbc0010I After 14670000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1150.12 seconds)\n", - "Cbc0010I After 14671000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1150.20 seconds)\n", - "Cbc0010I After 14672000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1150.27 seconds)\n", - "Cbc0010I After 14673000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1150.35 seconds)\n", - "Cbc0010I After 14674000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1150.43 seconds)\n", - "Cbc0010I After 14675000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1150.50 seconds)\n", - "Cbc0010I After 14676000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1150.57 seconds)\n", - "Cbc0010I After 14677000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1150.64 seconds)\n", - "Cbc0010I After 14678000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1150.69 seconds)\n", - "Cbc0010I After 14679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1150.73 seconds)\n", - "Cbc0010I After 14680000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1150.78 seconds)\n", - "Cbc0010I After 14681000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1150.84 seconds)\n", - "Cbc0010I After 14682000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1150.89 seconds)\n", - "Cbc0010I After 14683000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1150.93 seconds)\n", - "Cbc0010I After 14684000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1150.97 seconds)\n", - "Cbc0010I After 14685000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1151.02 seconds)\n", - "Cbc0010I After 14686000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1151.06 seconds)\n", - "Cbc0010I After 14687000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1151.11 seconds)\n", - "Cbc0010I After 14688000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1151.17 seconds)\n", - "Cbc0010I After 14689000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1151.22 seconds)\n", - "Cbc0010I After 14690000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1151.27 seconds)\n", - "Cbc0010I After 14691000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1151.32 seconds)\n", - "Cbc0010I After 14692000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1151.36 seconds)\n", - "Cbc0010I After 14693000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.41 seconds)\n", - "Cbc0010I After 14694000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1151.45 seconds)\n", - "Cbc0010I After 14695000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1151.50 seconds)\n", - "Cbc0010I After 14696000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1151.56 seconds)\n", - "Cbc0010I After 14697000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1151.61 seconds)\n", - "Cbc0010I After 14698000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1151.67 seconds)\n", - "Cbc0010I After 14699000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1151.73 seconds)\n", - "Cbc0010I After 14700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1151.79 seconds)\n", - "Cbc0010I After 14701000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1151.84 seconds)\n", - "Cbc0010I After 14702000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1151.90 seconds)\n", - "Cbc0010I After 14703000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.94 seconds)\n", - "Cbc0010I After 14704000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1151.99 seconds)\n", - "Cbc0010I After 14705000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1152.03 seconds)\n", - "Cbc0010I After 14706000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1152.08 seconds)\n", - "Cbc0010I After 14707000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1152.12 seconds)\n", - "Cbc0010I After 14708000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1152.17 seconds)\n", - "Cbc0010I After 14709000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1152.22 seconds)\n", - "Cbc0010I After 14710000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.27 seconds)\n", - "Cbc0010I After 14711000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1152.32 seconds)\n", - "Cbc0010I After 14712000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1152.38 seconds)\n", - "Cbc0010I After 14713000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1152.43 seconds)\n", - "Cbc0010I After 14714000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1152.50 seconds)\n", - "Cbc0010I After 14715000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1152.56 seconds)\n", - "Cbc0010I After 14716000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.63 seconds)\n", - "Cbc0010I After 14717000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1152.70 seconds)\n", - "Cbc0010I After 14718000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1152.76 seconds)\n", - "Cbc0010I After 14719000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1152.83 seconds)\n", - "Cbc0010I After 14720000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1152.90 seconds)\n", - "Cbc0010I After 14721000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1152.98 seconds)\n", - "Cbc0010I After 14722000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1153.04 seconds)\n", - "Cbc0010I After 14723000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1153.09 seconds)\n", - "Cbc0010I After 14724000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1153.16 seconds)\n", - "Cbc0010I After 14725000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1153.21 seconds)\n", - "Cbc0010I After 14726000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.26 seconds)\n", - "Cbc0010I After 14727000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.33 seconds)\n", - "Cbc0010I After 14728000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1153.38 seconds)\n", - "Cbc0010I After 14729000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1153.42 seconds)\n", - "Cbc0010I After 14730000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.46 seconds)\n", - "Cbc0010I After 14731000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1153.54 seconds)\n", - "Cbc0010I After 14732000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.60 seconds)\n", - "Cbc0010I After 14733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.65 seconds)\n", - "Cbc0010I After 14734000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1153.71 seconds)\n", - "Cbc0010I After 14735000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1153.75 seconds)\n", - "Cbc0010I After 14736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1153.81 seconds)\n", - "Cbc0010I After 14737000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1153.86 seconds)\n", - "Cbc0010I After 14738000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.91 seconds)\n", - "Cbc0010I After 14739000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1153.96 seconds)\n", - "Cbc0010I After 14740000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1154.00 seconds)\n", - "Cbc0010I After 14741000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.05 seconds)\n", - "Cbc0010I After 14742000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1154.10 seconds)\n", - "Cbc0010I After 14743000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1154.15 seconds)\n", - "Cbc0010I After 14744000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1154.19 seconds)\n", - "Cbc0010I After 14745000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1154.24 seconds)\n", - "Cbc0010I After 14746000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1154.29 seconds)\n", - "Cbc0010I After 14747000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.35 seconds)\n", - "Cbc0010I After 14748000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.43 seconds)\n", - "Cbc0010I After 14749000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.49 seconds)\n", - "Cbc0010I After 14750000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1154.54 seconds)\n", - "Cbc0010I After 14751000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1154.58 seconds)\n", - "Cbc0010I After 14752000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1154.63 seconds)\n", - "Cbc0010I After 14753000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1154.68 seconds)\n", - "Cbc0010I After 14754000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1154.72 seconds)\n", - "Cbc0010I After 14755000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1154.77 seconds)\n", - "Cbc0010I After 14756000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1154.82 seconds)\n", - "Cbc0010I After 14757000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.87 seconds)\n", - "Cbc0010I After 14758000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1154.92 seconds)\n", - "Cbc0010I After 14759000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1154.97 seconds)\n", - "Cbc0010I After 14760000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.02 seconds)\n", - "Cbc0010I After 14761000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1155.07 seconds)\n", - "Cbc0010I After 14762000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1155.13 seconds)\n", - "Cbc0010I After 14763000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1155.21 seconds)\n", - "Cbc0010I After 14764000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1155.26 seconds)\n", - "Cbc0010I After 14765000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1155.32 seconds)\n", - "Cbc0010I After 14766000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1155.39 seconds)\n", - "Cbc0010I After 14767000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1155.47 seconds)\n", - "Cbc0010I After 14768000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.54 seconds)\n", - "Cbc0010I After 14769000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1155.59 seconds)\n", - "Cbc0010I After 14770000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1155.64 seconds)\n", - "Cbc0010I After 14771000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1155.68 seconds)\n", - "Cbc0010I After 14772000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1155.73 seconds)\n", - "Cbc0010I After 14773000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1155.78 seconds)\n", - "Cbc0010I After 14774000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1155.84 seconds)\n", - "Cbc0010I After 14775000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1155.90 seconds)\n", - "Cbc0010I After 14776000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1155.96 seconds)\n", - "Cbc0010I After 14777000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1156.01 seconds)\n", - "Cbc0010I After 14778000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1156.08 seconds)\n", - "Cbc0010I After 14779000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1156.17 seconds)\n", - "Cbc0010I After 14780000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1156.24 seconds)\n", - "Cbc0010I After 14781000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1156.29 seconds)\n", - "Cbc0010I After 14782000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1156.34 seconds)\n", - "Cbc0010I After 14783000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1156.41 seconds)\n", - "Cbc0010I After 14784000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1156.47 seconds)\n", - "Cbc0010I After 14785000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1156.54 seconds)\n", - "Cbc0010I After 14786000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1156.61 seconds)\n", - "Cbc0010I After 14787000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1156.68 seconds)\n", - "Cbc0010I After 14788000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1156.73 seconds)\n", - "Cbc0010I After 14789000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1156.80 seconds)\n", - "Cbc0010I After 14790000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1156.87 seconds)\n", - "Cbc0010I After 14791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1156.95 seconds)\n", - "Cbc0010I After 14792000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1157.02 seconds)\n", - "Cbc0010I After 14793000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1157.08 seconds)\n", - "Cbc0010I After 14794000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1157.15 seconds)\n", - "Cbc0010I After 14795000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1157.21 seconds)\n", - "Cbc0010I After 14796000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1157.27 seconds)\n", - "Cbc0010I After 14797000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1157.35 seconds)\n", - "Cbc0010I After 14798000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1157.43 seconds)\n", - "Cbc0010I After 14799000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1157.49 seconds)\n", - "Cbc0010I After 14800000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1157.56 seconds)\n", - "Cbc0010I After 14801000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1157.63 seconds)\n", - "Cbc0010I After 14802000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1157.70 seconds)\n", - "Cbc0010I After 14803000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1157.77 seconds)\n", - "Cbc0010I After 14804000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1157.84 seconds)\n", - "Cbc0010I After 14805000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1157.90 seconds)\n", - "Cbc0010I After 14806000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1157.96 seconds)\n", - "Cbc0010I After 14807000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1158.03 seconds)\n", - "Cbc0010I After 14808000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1158.10 seconds)\n", - "Cbc0010I After 14809000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1158.16 seconds)\n", - "Cbc0010I After 14810000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1158.24 seconds)\n", - "Cbc0010I After 14811000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1158.29 seconds)\n", - "Cbc0010I After 14812000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1158.35 seconds)\n", - "Cbc0010I After 14813000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1158.40 seconds)\n", - "Cbc0010I After 14814000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1158.45 seconds)\n", - "Cbc0010I After 14815000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1158.52 seconds)\n", - "Cbc0010I After 14816000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1158.59 seconds)\n", - "Cbc0010I After 14817000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1158.64 seconds)\n", - "Cbc0010I After 14818000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1158.70 seconds)\n", - "Cbc0010I After 14819000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1158.75 seconds)\n", - "Cbc0010I After 14820000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1158.82 seconds)\n", - "Cbc0010I After 14821000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1158.88 seconds)\n", - "Cbc0010I After 14822000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1158.96 seconds)\n", - "Cbc0010I After 14823000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1159.02 seconds)\n", - "Cbc0010I After 14824000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1159.08 seconds)\n", - "Cbc0010I After 14825000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1159.13 seconds)\n", - "Cbc0010I After 14826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1159.19 seconds)\n", - "Cbc0010I After 14827000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1159.26 seconds)\n", - "Cbc0010I After 14828000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1159.33 seconds)\n", - "Cbc0010I After 14829000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1159.40 seconds)\n", - "Cbc0010I After 14830000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1159.45 seconds)\n", - "Cbc0010I After 14831000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1159.51 seconds)\n", - "Cbc0010I After 14832000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1159.58 seconds)\n", - "Cbc0010I After 14833000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1159.64 seconds)\n", - "Cbc0010I After 14834000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1159.70 seconds)\n", - "Cbc0010I After 14835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1159.78 seconds)\n", - "Cbc0010I After 14836000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1159.84 seconds)\n", - "Cbc0010I After 14837000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1159.91 seconds)\n", - "Cbc0010I After 14838000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1159.97 seconds)\n", - "Cbc0010I After 14839000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1160.04 seconds)\n", - "Cbc0010I After 14840000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1160.11 seconds)\n", - "Cbc0010I After 14841000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1160.17 seconds)\n", - "Cbc0010I After 14842000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1160.24 seconds)\n", - "Cbc0010I After 14843000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1160.29 seconds)\n", - "Cbc0010I After 14844000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1160.35 seconds)\n", - "Cbc0010I After 14845000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1160.41 seconds)\n", - "Cbc0010I After 14846000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1160.46 seconds)\n", - "Cbc0010I After 14847000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1160.53 seconds)\n", - "Cbc0010I After 14848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1160.61 seconds)\n", - "Cbc0010I After 14849000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1160.67 seconds)\n", - "Cbc0010I After 14850000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1160.73 seconds)\n", - "Cbc0010I After 14851000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1160.78 seconds)\n", - "Cbc0010I After 14852000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1160.84 seconds)\n", - "Cbc0010I After 14853000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1160.89 seconds)\n", - "Cbc0010I After 14854000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1160.95 seconds)\n", - "Cbc0010I After 14855000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1161.01 seconds)\n", - "Cbc0010I After 14856000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1161.07 seconds)\n", - "Cbc0010I After 14857000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1161.14 seconds)\n", - "Cbc0010I After 14858000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1161.24 seconds)\n", - "Cbc0010I After 14859000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1161.30 seconds)\n", - "Cbc0010I After 14860000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1161.38 seconds)\n", - "Cbc0010I After 14861000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1161.45 seconds)\n", - "Cbc0010I After 14862000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1161.52 seconds)\n", - "Cbc0010I After 14863000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1161.58 seconds)\n", - "Cbc0010I After 14864000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1161.65 seconds)\n", - "Cbc0010I After 14865000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1161.72 seconds)\n", - "Cbc0010I After 14866000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1161.78 seconds)\n", - "Cbc0010I After 14867000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1161.84 seconds)\n", - "Cbc0010I After 14868000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1161.91 seconds)\n", - "Cbc0010I After 14869000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1161.98 seconds)\n", - "Cbc0010I After 14870000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1162.04 seconds)\n", - "Cbc0010I After 14871000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1162.09 seconds)\n", - "Cbc0010I After 14872000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1162.15 seconds)\n", - "Cbc0010I After 14873000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1162.21 seconds)\n", - "Cbc0010I After 14874000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.26 seconds)\n", - "Cbc0010I After 14875000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1162.32 seconds)\n", - "Cbc0010I After 14876000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.37 seconds)\n", - "Cbc0010I After 14877000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1162.43 seconds)\n", - "Cbc0010I After 14878000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1162.48 seconds)\n", - "Cbc0010I After 14879000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1162.54 seconds)\n", - "Cbc0010I After 14880000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1162.61 seconds)\n", - "Cbc0010I After 14881000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1162.67 seconds)\n", - "Cbc0010I After 14882000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1162.72 seconds)\n", - "Cbc0010I After 14883000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1162.78 seconds)\n", - "Cbc0010I After 14884000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1162.84 seconds)\n", - "Cbc0010I After 14885000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1162.90 seconds)\n", - "Cbc0010I After 14886000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1162.95 seconds)\n", - "Cbc0010I After 14887000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1163.00 seconds)\n", - "Cbc0010I After 14888000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1163.06 seconds)\n", - "Cbc0010I After 14889000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1163.12 seconds)\n", - "Cbc0010I After 14890000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1163.18 seconds)\n", - "Cbc0010I After 14891000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1163.23 seconds)\n", - "Cbc0010I After 14892000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1163.30 seconds)\n", - "Cbc0010I After 14893000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1163.36 seconds)\n", - "Cbc0010I After 14894000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1163.42 seconds)\n", - "Cbc0010I After 14895000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1163.48 seconds)\n", - "Cbc0010I After 14896000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1163.55 seconds)\n", - "Cbc0010I After 14897000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1163.61 seconds)\n", - "Cbc0010I After 14898000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1163.68 seconds)\n", - "Cbc0010I After 14899000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1163.75 seconds)\n", - "Cbc0010I After 14900000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1163.81 seconds)\n", - "Cbc0010I After 14901000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1163.87 seconds)\n", - "Cbc0010I After 14902000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1163.94 seconds)\n", - "Cbc0010I After 14903000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1164.00 seconds)\n", - "Cbc0010I After 14904000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.05 seconds)\n", - "Cbc0010I After 14905000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1164.12 seconds)\n", - "Cbc0010I After 14906000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1164.19 seconds)\n", - "Cbc0010I After 14907000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1164.25 seconds)\n", - "Cbc0010I After 14908000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1164.31 seconds)\n", - "Cbc0010I After 14909000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1164.37 seconds)\n", - "Cbc0010I After 14910000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1164.45 seconds)\n", - "Cbc0010I After 14911000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1164.51 seconds)\n", - "Cbc0010I After 14912000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1164.57 seconds)\n", - "Cbc0010I After 14913000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1164.65 seconds)\n", - "Cbc0010I After 14914000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1164.72 seconds)\n", - "Cbc0010I After 14915000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1164.79 seconds)\n", - "Cbc0010I After 14916000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1164.84 seconds)\n", - "Cbc0010I After 14917000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.90 seconds)\n", - "Cbc0010I After 14918000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1164.97 seconds)\n", - "Cbc0010I After 14919000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1165.04 seconds)\n", - "Cbc0010I After 14920000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1165.10 seconds)\n", - "Cbc0010I After 14921000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1165.16 seconds)\n", - "Cbc0010I After 14922000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1165.21 seconds)\n", - "Cbc0010I After 14923000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1165.28 seconds)\n", - "Cbc0010I After 14924000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1165.35 seconds)\n", - "Cbc0010I After 14925000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1165.41 seconds)\n", - "Cbc0010I After 14926000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1165.48 seconds)\n", - "Cbc0010I After 14927000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1165.54 seconds)\n", - "Cbc0010I After 14928000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1165.60 seconds)\n", - "Cbc0010I After 14929000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1165.68 seconds)\n", - "Cbc0010I After 14930000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1165.74 seconds)\n", - "Cbc0010I After 14931000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1165.81 seconds)\n", - "Cbc0010I After 14932000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1165.90 seconds)\n", - "Cbc0010I After 14933000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1165.96 seconds)\n", - "Cbc0010I After 14934000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1166.03 seconds)\n", - "Cbc0010I After 14935000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1166.09 seconds)\n", - "Cbc0010I After 14936000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1166.16 seconds)\n", - "Cbc0010I After 14937000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1166.23 seconds)\n", - "Cbc0010I After 14938000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1166.29 seconds)\n", - "Cbc0010I After 14939000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1166.36 seconds)\n", - "Cbc0010I After 14940000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1166.42 seconds)\n", - "Cbc0010I After 14941000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1166.50 seconds)\n", - "Cbc0010I After 14942000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1166.56 seconds)\n", - "Cbc0010I After 14943000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1166.62 seconds)\n", - "Cbc0010I After 14944000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1166.69 seconds)\n", - "Cbc0010I After 14945000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1166.76 seconds)\n", - "Cbc0010I After 14946000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1166.83 seconds)\n", - "Cbc0010I After 14947000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1166.90 seconds)\n", - "Cbc0010I After 14948000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1166.98 seconds)\n", - "Cbc0010I After 14949000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1167.04 seconds)\n", - "Cbc0010I After 14950000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1167.10 seconds)\n", - "Cbc0010I After 14951000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1167.17 seconds)\n", - "Cbc0010I After 14952000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1167.24 seconds)\n", - "Cbc0010I After 14953000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1167.32 seconds)\n", - "Cbc0010I After 14954000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1167.39 seconds)\n", - "Cbc0010I After 14955000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1167.46 seconds)\n", - "Cbc0010I After 14956000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1167.53 seconds)\n", - "Cbc0010I After 14957000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1167.60 seconds)\n", - "Cbc0010I After 14958000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1167.68 seconds)\n", - "Cbc0010I After 14959000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1167.75 seconds)\n", - "Cbc0010I After 14960000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1167.82 seconds)\n", - "Cbc0010I After 14961000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1167.89 seconds)\n", - "Cbc0010I After 14962000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1167.96 seconds)\n", - "Cbc0010I After 14963000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1168.03 seconds)\n", - "Cbc0010I After 14964000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1168.11 seconds)\n", - "Cbc0010I After 14965000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1168.16 seconds)\n", - "Cbc0010I After 14966000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1168.23 seconds)\n", - "Cbc0010I After 14967000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1168.30 seconds)\n", - "Cbc0010I After 14968000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1168.35 seconds)\n", - "Cbc0010I After 14969000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1168.41 seconds)\n", - "Cbc0010I After 14970000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1168.47 seconds)\n", - "Cbc0010I After 14971000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1168.54 seconds)\n", - "Cbc0010I After 14972000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1168.60 seconds)\n", - "Cbc0010I After 14973000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1168.68 seconds)\n", - "Cbc0010I After 14974000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1168.75 seconds)\n", - "Cbc0010I After 14975000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1168.82 seconds)\n", - "Cbc0010I After 14976000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1168.89 seconds)\n", - "Cbc0010I After 14977000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1168.94 seconds)\n", - "Cbc0010I After 14978000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1169.05 seconds)\n", - "Cbc0010I After 14979000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1169.15 seconds)\n", - "Cbc0010I After 14980000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1169.24 seconds)\n", - "Cbc0010I After 14981000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.33 seconds)\n", - "Cbc0010I After 14982000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1169.40 seconds)\n", - "Cbc0010I After 14983000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1169.48 seconds)\n", - "Cbc0010I After 14984000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1169.55 seconds)\n", - "Cbc0010I After 14985000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1169.62 seconds)\n", - "Cbc0010I After 14986000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.69 seconds)\n", - "Cbc0010I After 14987000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1169.77 seconds)\n", - "Cbc0010I After 14988000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1169.81 seconds)\n", - "Cbc0010I After 14989000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1169.85 seconds)\n", - "Cbc0010I After 14990000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1169.90 seconds)\n", - "Cbc0010I After 14991000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1169.98 seconds)\n", - "Cbc0010I After 14992000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1170.05 seconds)\n", - "Cbc0010I After 14993000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1170.13 seconds)\n", - "Cbc0010I After 14994000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1170.20 seconds)\n", - "Cbc0010I After 14995000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.29 seconds)\n", - "Cbc0010I After 14996000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1170.36 seconds)\n", - "Cbc0010I After 14997000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1170.44 seconds)\n", - "Cbc0010I After 14998000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1170.49 seconds)\n", - "Cbc0010I After 14999000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.56 seconds)\n", - "Cbc0010I After 15000000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1170.63 seconds)\n", - "Cbc0010I After 15001000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1170.67 seconds)\n", - "Cbc0010I After 15002000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1170.72 seconds)\n", - "Cbc0010I After 15003000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1170.80 seconds)\n", - "Cbc0010I After 15004000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1170.87 seconds)\n", - "Cbc0010I After 15005000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1170.95 seconds)\n", - "Cbc0010I After 15006000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1171.02 seconds)\n", - "Cbc0010I After 15007000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1171.10 seconds)\n", - "Cbc0010I After 15008000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1171.18 seconds)\n", - "Cbc0010I After 15009000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1171.23 seconds)\n", - "Cbc0010I After 15010000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1171.29 seconds)\n", - "Cbc0010I After 15011000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1171.36 seconds)\n", - "Cbc0010I After 15012000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1171.42 seconds)\n", - "Cbc0010I After 15013000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1171.50 seconds)\n", - "Cbc0010I After 15014000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1171.57 seconds)\n", - "Cbc0010I After 15015000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1171.64 seconds)\n", - "Cbc0010I After 15016000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1171.72 seconds)\n", - "Cbc0010I After 15017000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1171.79 seconds)\n", - "Cbc0010I After 15018000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1171.86 seconds)\n", - "Cbc0010I After 15019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1171.94 seconds)\n", - "Cbc0010I After 15020000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1171.98 seconds)\n", - "Cbc0010I After 15021000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1172.03 seconds)\n", - "Cbc0010I After 15022000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1172.10 seconds)\n", - "Cbc0010I After 15023000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1172.16 seconds)\n", - "Cbc0010I After 15024000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1172.23 seconds)\n", - "Cbc0010I After 15025000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1172.31 seconds)\n", - "Cbc0010I After 15026000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1172.38 seconds)\n", - "Cbc0010I After 15027000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1172.46 seconds)\n", - "Cbc0010I After 15028000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1172.54 seconds)\n", - "Cbc0010I After 15029000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1172.62 seconds)\n", - "Cbc0010I After 15030000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1172.69 seconds)\n", - "Cbc0010I After 15031000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1172.77 seconds)\n", - "Cbc0010I After 15032000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1172.83 seconds)\n", - "Cbc0010I After 15033000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1172.85 seconds)\n", - "Cbc0010I After 15034000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1172.93 seconds)\n", - "Cbc0010I After 15035000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1172.99 seconds)\n", - "Cbc0010I After 15036000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1173.07 seconds)\n", - "Cbc0010I After 15037000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1173.14 seconds)\n", - "Cbc0010I After 15038000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1173.20 seconds)\n", - "Cbc0010I After 15039000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1173.28 seconds)\n", - "Cbc0010I After 15040000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1173.36 seconds)\n", - "Cbc0010I After 15041000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1173.43 seconds)\n", - "Cbc0010I After 15042000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1173.51 seconds)\n", - "Cbc0010I After 15043000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1173.59 seconds)\n", - "Cbc0010I After 15044000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1173.66 seconds)\n", - "Cbc0010I After 15045000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1173.73 seconds)\n", - "Cbc0010I After 15046000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1173.81 seconds)\n", - "Cbc0010I After 15047000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1173.88 seconds)\n", - "Cbc0010I After 15048000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1173.95 seconds)\n", - "Cbc0010I After 15049000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1174.02 seconds)\n", - "Cbc0010I After 15050000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1174.10 seconds)\n", - "Cbc0010I After 15051000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1174.17 seconds)\n", - "Cbc0010I After 15052000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1174.24 seconds)\n", - "Cbc0010I After 15053000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1174.32 seconds)\n", - "Cbc0010I After 15054000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1174.41 seconds)\n", - "Cbc0010I After 15055000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1174.50 seconds)\n", - "Cbc0010I After 15056000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1174.58 seconds)\n", - "Cbc0010I After 15057000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1174.65 seconds)\n", - "Cbc0010I After 15058000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1174.73 seconds)\n", - "Cbc0010I After 15059000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1174.81 seconds)\n", - "Cbc0010I After 15060000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1174.88 seconds)\n", - "Cbc0010I After 15061000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1174.96 seconds)\n", - "Cbc0010I After 15062000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1175.03 seconds)\n", - "Cbc0010I After 15063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1175.11 seconds)\n", - "Cbc0010I After 15064000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1175.18 seconds)\n", - "Cbc0010I After 15065000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1175.26 seconds)\n", - "Cbc0010I After 15066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1175.35 seconds)\n", - "Cbc0010I After 15067000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1175.42 seconds)\n", - "Cbc0010I After 15068000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1175.50 seconds)\n", - "Cbc0010I After 15069000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1175.57 seconds)\n", - "Cbc0010I After 15070000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1175.64 seconds)\n", - "Cbc0010I After 15071000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1175.72 seconds)\n", - "Cbc0010I After 15072000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1175.80 seconds)\n", - "Cbc0010I After 15073000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1175.85 seconds)\n", - "Cbc0010I After 15074000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1175.88 seconds)\n", - "Cbc0010I After 15075000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1175.95 seconds)\n", - "Cbc0010I After 15076000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1176.02 seconds)\n", - "Cbc0010I After 15077000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1176.09 seconds)\n", - "Cbc0010I After 15078000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1176.15 seconds)\n", - "Cbc0010I After 15079000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1176.23 seconds)\n", - "Cbc0010I After 15080000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1176.30 seconds)\n", - "Cbc0010I After 15081000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1176.36 seconds)\n", - "Cbc0010I After 15082000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1176.42 seconds)\n", - "Cbc0010I After 15083000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1176.50 seconds)\n", - "Cbc0010I After 15084000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1176.57 seconds)\n", - "Cbc0010I After 15085000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1176.65 seconds)\n", - "Cbc0010I After 15086000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1176.72 seconds)\n", - "Cbc0010I After 15087000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1176.80 seconds)\n", - "Cbc0010I After 15088000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1176.88 seconds)\n", - "Cbc0010I After 15089000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1176.96 seconds)\n", - "Cbc0010I After 15090000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1177.03 seconds)\n", - "Cbc0010I After 15091000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1177.11 seconds)\n", - "Cbc0010I After 15092000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1177.19 seconds)\n", - "Cbc0010I After 15093000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1177.27 seconds)\n", - "Cbc0010I After 15094000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1177.34 seconds)\n", - "Cbc0010I After 15095000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1177.42 seconds)\n", - "Cbc0010I After 15096000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1177.50 seconds)\n", - "Cbc0010I After 15097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1177.57 seconds)\n", - "Cbc0010I After 15098000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1177.65 seconds)\n", - "Cbc0010I After 15099000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1177.72 seconds)\n", - "Cbc0010I After 15100000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1177.80 seconds)\n", - "Cbc0010I After 15101000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1177.87 seconds)\n", - "Cbc0010I After 15102000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1177.95 seconds)\n", - "Cbc0010I After 15103000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1178.03 seconds)\n", - "Cbc0010I After 15104000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1178.11 seconds)\n", - "Cbc0010I After 15105000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1178.19 seconds)\n", - "Cbc0010I After 15106000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1178.26 seconds)\n", - "Cbc0010I After 15107000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1178.35 seconds)\n", - "Cbc0010I After 15108000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1178.47 seconds)\n", - "Cbc0010I After 15109000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1178.56 seconds)\n", - "Cbc0010I After 15110000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1178.66 seconds)\n", - "Cbc0010I After 15111000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1178.76 seconds)\n", - "Cbc0010I After 15112000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1178.84 seconds)\n", - "Cbc0010I After 15113000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1178.91 seconds)\n", - "Cbc0010I After 15114000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1178.98 seconds)\n", - "Cbc0010I After 15115000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1179.07 seconds)\n", - "Cbc0010I After 15116000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1179.15 seconds)\n", - "Cbc0010I After 15117000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1179.22 seconds)\n", - "Cbc0010I After 15118000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1179.29 seconds)\n", - "Cbc0010I After 15119000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.36 seconds)\n", - "Cbc0010I After 15120000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1179.43 seconds)\n", - "Cbc0010I After 15121000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1179.50 seconds)\n", - "Cbc0010I After 15122000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1179.57 seconds)\n", - "Cbc0010I After 15123000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.65 seconds)\n", - "Cbc0010I After 15124000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1179.72 seconds)\n", - "Cbc0010I After 15125000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1179.79 seconds)\n", - "Cbc0010I After 15126000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1179.87 seconds)\n", - "Cbc0010I After 15127000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1179.94 seconds)\n", - "Cbc0010I After 15128000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1180.01 seconds)\n", - "Cbc0010I After 15129000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.08 seconds)\n", - "Cbc0010I After 15130000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1180.15 seconds)\n", - "Cbc0010I After 15131000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.23 seconds)\n", - "Cbc0010I After 15132000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1180.30 seconds)\n", - "Cbc0010I After 15133000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1180.38 seconds)\n", - "Cbc0010I After 15134000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1180.45 seconds)\n", - "Cbc0010I After 15135000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1180.53 seconds)\n", - "Cbc0010I After 15136000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1180.60 seconds)\n", - "Cbc0010I After 15137000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1180.67 seconds)\n", - "Cbc0010I After 15138000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1180.74 seconds)\n", - "Cbc0010I After 15139000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1180.81 seconds)\n", - "Cbc0010I After 15140000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1180.88 seconds)\n", - "Cbc0010I After 15141000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1180.96 seconds)\n", - "Cbc0010I After 15142000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1181.03 seconds)\n", - "Cbc0010I After 15143000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1181.10 seconds)\n", - "Cbc0010I After 15144000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1181.18 seconds)\n", - "Cbc0010I After 15145000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1181.25 seconds)\n", - "Cbc0010I After 15146000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1181.32 seconds)\n", - "Cbc0010I After 15147000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1181.39 seconds)\n", - "Cbc0010I After 15148000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1181.47 seconds)\n", - "Cbc0010I After 15149000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1181.55 seconds)\n", - "Cbc0010I After 15150000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1181.64 seconds)\n", - "Cbc0010I After 15151000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1181.70 seconds)\n", - "Cbc0010I After 15152000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1181.77 seconds)\n", - "Cbc0010I After 15153000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1181.86 seconds)\n", - "Cbc0010I After 15154000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1181.93 seconds)\n", - "Cbc0010I After 15155000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1182.01 seconds)\n", - "Cbc0010I After 15156000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1182.08 seconds)\n", - "Cbc0010I After 15157000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1182.16 seconds)\n", - "Cbc0010I After 15158000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1182.23 seconds)\n", - "Cbc0010I After 15159000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.31 seconds)\n", - "Cbc0010I After 15160000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.39 seconds)\n", - "Cbc0010I After 15161000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1182.47 seconds)\n", - "Cbc0010I After 15162000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1182.54 seconds)\n", - "Cbc0010I After 15163000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1182.62 seconds)\n", - "Cbc0010I After 15164000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1182.69 seconds)\n", - "Cbc0010I After 15165000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1182.77 seconds)\n", - "Cbc0010I After 15166000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1182.84 seconds)\n", - "Cbc0010I After 15167000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1182.91 seconds)\n", - "Cbc0010I After 15168000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1182.99 seconds)\n", - "Cbc0010I After 15169000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1183.06 seconds)\n", - "Cbc0010I After 15170000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1183.13 seconds)\n", - "Cbc0010I After 15171000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1183.21 seconds)\n", - "Cbc0010I After 15172000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1183.28 seconds)\n", - "Cbc0010I After 15173000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1183.36 seconds)\n", - "Cbc0010I After 15174000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1183.44 seconds)\n", - "Cbc0010I After 15175000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1183.52 seconds)\n", - "Cbc0010I After 15176000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1183.59 seconds)\n", - "Cbc0010I After 15177000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1183.66 seconds)\n", - "Cbc0010I After 15178000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1183.74 seconds)\n", - "Cbc0010I After 15179000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1183.81 seconds)\n", - "Cbc0010I After 15180000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1183.88 seconds)\n", - "Cbc0010I After 15181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1183.95 seconds)\n", - "Cbc0010I After 15182000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1184.02 seconds)\n", - "Cbc0010I After 15183000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1184.10 seconds)\n", - "Cbc0010I After 15184000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1184.17 seconds)\n", - "Cbc0010I After 15185000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1184.24 seconds)\n", - "Cbc0010I After 15186000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1184.31 seconds)\n", - "Cbc0010I After 15187000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.38 seconds)\n", - "Cbc0010I After 15188000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1184.46 seconds)\n", - "Cbc0010I After 15189000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1184.53 seconds)\n", - "Cbc0010I After 15190000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1184.60 seconds)\n", - "Cbc0010I After 15191000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1184.68 seconds)\n", - "Cbc0010I After 15192000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.76 seconds)\n", - "Cbc0010I After 15193000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1184.84 seconds)\n", - "Cbc0010I After 15194000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1184.92 seconds)\n", - "Cbc0010I After 15195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1185.00 seconds)\n", - "Cbc0010I After 15196000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1185.08 seconds)\n", - "Cbc0010I After 15197000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1185.15 seconds)\n", - "Cbc0010I After 15198000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1185.23 seconds)\n", - "Cbc0010I After 15199000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1185.31 seconds)\n", - "Cbc0010I After 15200000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1185.38 seconds)\n", - "Cbc0010I After 15201000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1185.46 seconds)\n", - "Cbc0010I After 15202000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1185.54 seconds)\n", - "Cbc0010I After 15203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1185.61 seconds)\n", - "Cbc0010I After 15204000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1185.69 seconds)\n", - "Cbc0010I After 15205000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1185.77 seconds)\n", - "Cbc0010I After 15206000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1185.85 seconds)\n", - "Cbc0010I After 15207000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1185.92 seconds)\n", - "Cbc0010I After 15208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1186.00 seconds)\n", - "Cbc0010I After 15209000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1186.08 seconds)\n", - "Cbc0010I After 15210000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1186.15 seconds)\n", - "Cbc0010I After 15211000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1186.23 seconds)\n", - "Cbc0010I After 15212000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1186.30 seconds)\n", - "Cbc0010I After 15213000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1186.38 seconds)\n", - "Cbc0010I After 15214000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1186.46 seconds)\n", - "Cbc0010I After 15215000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1186.53 seconds)\n", - "Cbc0010I After 15216000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1186.61 seconds)\n", - "Cbc0010I After 15217000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1186.69 seconds)\n", - "Cbc0010I After 15218000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1186.78 seconds)\n", - "Cbc0010I After 15219000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1186.87 seconds)\n", - "Cbc0010I After 15220000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1186.97 seconds)\n", - "Cbc0010I After 15221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1187.08 seconds)\n", - "Cbc0010I After 15222000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1187.18 seconds)\n", - "Cbc0010I After 15223000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.26 seconds)\n", - "Cbc0010I After 15224000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1187.34 seconds)\n", - "Cbc0010I After 15225000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1187.42 seconds)\n", - "Cbc0010I After 15226000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1187.50 seconds)\n", - "Cbc0010I After 15227000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.58 seconds)\n", - "Cbc0010I After 15228000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1187.65 seconds)\n", - "Cbc0010I After 15229000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1187.73 seconds)\n", - "Cbc0010I After 15230000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1187.81 seconds)\n", - "Cbc0010I After 15231000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1187.88 seconds)\n", - "Cbc0010I After 15232000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1187.96 seconds)\n", - "Cbc0010I After 15233000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1188.04 seconds)\n", - "Cbc0010I After 15234000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1188.11 seconds)\n", - "Cbc0010I After 15235000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1188.20 seconds)\n", - "Cbc0010I After 15236000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1188.28 seconds)\n", - "Cbc0010I After 15237000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1188.36 seconds)\n", - "Cbc0010I After 15238000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1188.44 seconds)\n", - "Cbc0010I After 15239000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1188.52 seconds)\n", - "Cbc0010I After 15240000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1188.59 seconds)\n", - "Cbc0010I After 15241000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1188.66 seconds)\n", - "Cbc0010I After 15242000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1188.74 seconds)\n", - "Cbc0010I After 15243000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1188.82 seconds)\n", - "Cbc0010I After 15244000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1188.89 seconds)\n", - "Cbc0010I After 15245000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1188.95 seconds)\n", - "Cbc0010I After 15246000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1189.02 seconds)\n", - "Cbc0010I After 15247000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1189.10 seconds)\n", - "Cbc0010I After 15248000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.17 seconds)\n", - "Cbc0010I After 15249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.24 seconds)\n", - "Cbc0010I After 15250000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1189.31 seconds)\n", - "Cbc0010I After 15251000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1189.38 seconds)\n", - "Cbc0010I After 15252000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1189.45 seconds)\n", - "Cbc0010I After 15253000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1189.51 seconds)\n", - "Cbc0010I After 15254000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1189.57 seconds)\n", - "Cbc0010I After 15255000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1189.64 seconds)\n", - "Cbc0010I After 15256000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1189.72 seconds)\n", - "Cbc0010I After 15257000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1189.79 seconds)\n", - "Cbc0010I After 15258000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1189.85 seconds)\n", - "Cbc0010I After 15259000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1189.91 seconds)\n", - "Cbc0010I After 15260000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1189.97 seconds)\n", - "Cbc0010I After 15261000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1190.04 seconds)\n", - "Cbc0010I After 15262000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1190.10 seconds)\n", - "Cbc0010I After 15263000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1190.16 seconds)\n", - "Cbc0010I After 15264000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1190.22 seconds)\n", - "Cbc0010I After 15265000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1190.29 seconds)\n", - "Cbc0010I After 15266000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1190.35 seconds)\n", - "Cbc0010I After 15267000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1190.42 seconds)\n", - "Cbc0010I After 15268000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1190.50 seconds)\n", - "Cbc0010I After 15269000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1190.57 seconds)\n", - "Cbc0010I After 15270000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1190.64 seconds)\n", - "Cbc0010I After 15271000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1190.70 seconds)\n", - "Cbc0010I After 15272000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1190.77 seconds)\n", - "Cbc0010I After 15273000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1190.84 seconds)\n", - "Cbc0010I After 15274000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1190.89 seconds)\n", - "Cbc0010I After 15275000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1190.96 seconds)\n", - "Cbc0010I After 15276000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1191.04 seconds)\n", - "Cbc0010I After 15277000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1191.10 seconds)\n", - "Cbc0010I After 15278000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1191.17 seconds)\n", - "Cbc0010I After 15279000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1191.24 seconds)\n", - "Cbc0010I After 15280000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1191.29 seconds)\n", - "Cbc0010I After 15281000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1191.36 seconds)\n", - "Cbc0010I After 15282000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1191.42 seconds)\n", - "Cbc0010I After 15283000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1191.49 seconds)\n", - "Cbc0010I After 15284000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1191.56 seconds)\n", - "Cbc0010I After 15285000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1191.62 seconds)\n", - "Cbc0010I After 15286000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1191.68 seconds)\n", - "Cbc0010I After 15287000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1191.74 seconds)\n", - "Cbc0010I After 15288000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1191.79 seconds)\n", - "Cbc0010I After 15289000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1191.84 seconds)\n", - "Cbc0010I After 15290000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1191.91 seconds)\n", - "Cbc0010I After 15291000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1191.96 seconds)\n", - "Cbc0010I After 15292000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1192.02 seconds)\n", - "Cbc0010I After 15293000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1192.08 seconds)\n", - "Cbc0010I After 15294000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1192.13 seconds)\n", - "Cbc0010I After 15295000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1192.20 seconds)\n", - "Cbc0010I After 15296000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1192.26 seconds)\n", - "Cbc0010I After 15297000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1192.32 seconds)\n", - "Cbc0010I After 15298000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1192.39 seconds)\n", - "Cbc0010I After 15299000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1192.46 seconds)\n", - "Cbc0010I After 15300000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1192.53 seconds)\n", - "Cbc0010I After 15301000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1192.59 seconds)\n", - "Cbc0010I After 15302000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1192.65 seconds)\n", - "Cbc0010I After 15303000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1192.72 seconds)\n", - "Cbc0010I After 15304000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1192.79 seconds)\n", - "Cbc0010I After 15305000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1192.85 seconds)\n", - "Cbc0010I After 15306000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1192.91 seconds)\n", - "Cbc0010I After 15307000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1192.97 seconds)\n", - "Cbc0010I After 15308000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1193.03 seconds)\n", - "Cbc0010I After 15309000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1193.08 seconds)\n", - "Cbc0010I After 15310000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1193.14 seconds)\n", - "Cbc0010I After 15311000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1193.21 seconds)\n", - "Cbc0010I After 15312000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1193.26 seconds)\n", - "Cbc0010I After 15313000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1193.33 seconds)\n", - "Cbc0010I After 15314000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1193.40 seconds)\n", - "Cbc0010I After 15315000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1193.46 seconds)\n", - "Cbc0010I After 15316000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1193.51 seconds)\n", - "Cbc0010I After 15317000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1193.57 seconds)\n", - "Cbc0010I After 15318000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1193.66 seconds)\n", - "Cbc0010I After 15319000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1193.72 seconds)\n", - "Cbc0010I After 15320000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1193.79 seconds)\n", - "Cbc0010I After 15321000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1193.86 seconds)\n", - "Cbc0010I After 15322000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1193.92 seconds)\n", - "Cbc0010I After 15323000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1193.98 seconds)\n", - "Cbc0010I After 15324000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1194.03 seconds)\n", - "Cbc0010I After 15325000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.09 seconds)\n", - "Cbc0010I After 15326000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1194.16 seconds)\n", - "Cbc0010I After 15327000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1194.22 seconds)\n", - "Cbc0010I After 15328000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1194.28 seconds)\n", - "Cbc0010I After 15329000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.34 seconds)\n", - "Cbc0010I After 15330000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1194.41 seconds)\n", - "Cbc0010I After 15331000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1194.48 seconds)\n", - "Cbc0010I After 15332000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.55 seconds)\n", - "Cbc0010I After 15333000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1194.62 seconds)\n", - "Cbc0010I After 15334000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1194.68 seconds)\n", - "Cbc0010I After 15335000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1194.74 seconds)\n", - "Cbc0010I After 15336000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1194.80 seconds)\n", - "Cbc0010I After 15337000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1194.88 seconds)\n", - "Cbc0010I After 15338000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1194.95 seconds)\n", - "Cbc0010I After 15339000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1195.01 seconds)\n", - "Cbc0010I After 15340000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1195.07 seconds)\n", - "Cbc0010I After 15341000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1195.15 seconds)\n", - "Cbc0010I After 15342000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1195.21 seconds)\n", - "Cbc0010I After 15343000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1195.26 seconds)\n", - "Cbc0010I After 15344000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1195.31 seconds)\n", - "Cbc0010I After 15345000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1195.37 seconds)\n", - "Cbc0010I After 15346000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1195.44 seconds)\n", - "Cbc0010I After 15347000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1195.50 seconds)\n", - "Cbc0010I After 15348000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1195.56 seconds)\n", - "Cbc0010I After 15349000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1195.63 seconds)\n", - "Cbc0010I After 15350000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1195.70 seconds)\n", - "Cbc0010I After 15351000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1195.76 seconds)\n", - "Cbc0010I After 15352000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1195.83 seconds)\n", - "Cbc0010I After 15353000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1195.89 seconds)\n", - "Cbc0010I After 15354000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1195.97 seconds)\n", - "Cbc0010I After 15355000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1196.04 seconds)\n", - "Cbc0010I After 15356000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1196.13 seconds)\n", - "Cbc0010I After 15357000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1196.20 seconds)\n", - "Cbc0010I After 15358000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1196.26 seconds)\n", - "Cbc0010I After 15359000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1196.35 seconds)\n", - "Cbc0010I After 15360000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1196.40 seconds)\n", - "Cbc0010I After 15361000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1196.48 seconds)\n", - "Cbc0010I After 15362000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1196.56 seconds)\n", - "Cbc0010I After 15363000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1196.62 seconds)\n", - "Cbc0010I After 15364000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1196.68 seconds)\n", - "Cbc0010I After 15365000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1196.75 seconds)\n", - "Cbc0010I After 15366000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1196.80 seconds)\n", - "Cbc0010I After 15367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1196.86 seconds)\n", - "Cbc0010I After 15368000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1196.91 seconds)\n", - "Cbc0010I After 15369000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1196.98 seconds)\n", - "Cbc0010I After 15370000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1197.05 seconds)\n", - "Cbc0010I After 15371000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1197.12 seconds)\n", - "Cbc0010I After 15372000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1197.18 seconds)\n", - "Cbc0010I After 15373000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1197.24 seconds)\n", - "Cbc0010I After 15374000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1197.32 seconds)\n", - "Cbc0010I After 15375000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1197.38 seconds)\n", - "Cbc0010I After 15376000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1197.45 seconds)\n", - "Cbc0010I After 15377000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1197.52 seconds)\n", - "Cbc0010I After 15378000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1197.59 seconds)\n", - "Cbc0010I After 15379000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1197.65 seconds)\n", - "Cbc0010I After 15380000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1197.73 seconds)\n", - "Cbc0010I After 15381000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1197.79 seconds)\n", - "Cbc0010I After 15382000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1197.87 seconds)\n", - "Cbc0010I After 15383000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1197.94 seconds)\n", - "Cbc0010I After 15384000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1198.00 seconds)\n", - "Cbc0010I After 15385000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1198.06 seconds)\n", - "Cbc0010I After 15386000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1198.14 seconds)\n", - "Cbc0010I After 15387000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1198.22 seconds)\n", - "Cbc0010I After 15388000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1198.28 seconds)\n", - "Cbc0010I After 15389000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1198.36 seconds)\n", - "Cbc0010I After 15390000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1198.43 seconds)\n", - "Cbc0010I After 15391000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1198.50 seconds)\n", - "Cbc0010I After 15392000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1198.56 seconds)\n", - "Cbc0010I After 15393000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1198.63 seconds)\n", - "Cbc0010I After 15394000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1198.68 seconds)\n", - "Cbc0010I After 15395000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1198.74 seconds)\n", - "Cbc0010I After 15396000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1198.81 seconds)\n", - "Cbc0010I After 15397000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1198.86 seconds)\n", - "Cbc0010I After 15398000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1198.92 seconds)\n", - "Cbc0010I After 15399000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1198.99 seconds)\n", - "Cbc0010I After 15400000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1199.07 seconds)\n", - "Cbc0010I After 15401000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1199.15 seconds)\n", - "Cbc0010I After 15402000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1199.22 seconds)\n", - "Cbc0010I After 15403000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1199.28 seconds)\n", - "Cbc0010I After 15404000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1199.35 seconds)\n", - "Cbc0010I After 15405000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1199.42 seconds)\n", - "Cbc0010I After 15406000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1199.48 seconds)\n", - "Cbc0010I After 15407000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1199.56 seconds)\n", - "Cbc0010I After 15408000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1199.64 seconds)\n", - "Cbc0010I After 15409000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1199.71 seconds)\n", - "Cbc0010I After 15410000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1199.76 seconds)\n", - "Cbc0010I After 15411000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1199.83 seconds)\n", - "Cbc0010I After 15412000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1199.91 seconds)\n", - "Cbc0010I After 15413000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1199.99 seconds)\n", - "Cbc0010I After 15414000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1200.07 seconds)\n", - "Cbc0010I After 15415000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1200.14 seconds)\n", - "Cbc0010I After 15416000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1200.20 seconds)\n", - "Cbc0010I After 15417000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1200.26 seconds)\n", - "Cbc0010I After 15418000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1200.33 seconds)\n", - "Cbc0010I After 15419000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1200.40 seconds)\n", - "Cbc0010I After 15420000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1200.48 seconds)\n", - "Cbc0010I After 15421000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1200.55 seconds)\n", - "Cbc0010I After 15422000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1200.62 seconds)\n", - "Cbc0010I After 15423000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1200.68 seconds)\n", - "Cbc0010I After 15424000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1200.74 seconds)\n", - "Cbc0010I After 15425000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1200.81 seconds)\n", - "Cbc0010I After 15426000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1200.88 seconds)\n", - "Cbc0010I After 15427000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1200.94 seconds)\n", - "Cbc0010I After 15428000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1201.00 seconds)\n", - "Cbc0010I After 15429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1201.07 seconds)\n", - "Cbc0010I After 15430000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1201.13 seconds)\n", - "Cbc0010I After 15431000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1201.20 seconds)\n", - "Cbc0010I After 15432000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1201.26 seconds)\n", - "Cbc0010I After 15433000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1201.33 seconds)\n", - "Cbc0010I After 15434000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1201.38 seconds)\n", - "Cbc0010I After 15435000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1201.44 seconds)\n", - "Cbc0010I After 15436000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1201.50 seconds)\n", - "Cbc0010I After 15437000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1201.55 seconds)\n", - "Cbc0010I After 15438000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1201.61 seconds)\n", - "Cbc0010I After 15439000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1201.67 seconds)\n", - "Cbc0010I After 15440000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1201.73 seconds)\n", - "Cbc0010I After 15441000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1201.79 seconds)\n", - "Cbc0010I After 15442000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1201.86 seconds)\n", - "Cbc0010I After 15443000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1201.95 seconds)\n", - "Cbc0010I After 15444000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1202.05 seconds)\n", - "Cbc0010I After 15445000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1202.11 seconds)\n", - "Cbc0010I After 15446000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1202.18 seconds)\n", - "Cbc0010I After 15447000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1202.24 seconds)\n", - "Cbc0010I After 15448000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1202.31 seconds)\n", - "Cbc0010I After 15449000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1202.37 seconds)\n", - "Cbc0010I After 15450000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1202.44 seconds)\n", - "Cbc0010I After 15451000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1202.50 seconds)\n", - "Cbc0010I After 15452000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1202.57 seconds)\n", - "Cbc0010I After 15453000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1202.64 seconds)\n", - "Cbc0010I After 15454000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1202.70 seconds)\n", - "Cbc0010I After 15455000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1202.76 seconds)\n", - "Cbc0010I After 15456000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1202.82 seconds)\n", - "Cbc0010I After 15457000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1202.88 seconds)\n", - "Cbc0010I After 15458000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1202.93 seconds)\n", - "Cbc0010I After 15459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1202.99 seconds)\n", - "Cbc0010I After 15460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1203.05 seconds)\n", - "Cbc0010I After 15461000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1203.11 seconds)\n", - "Cbc0010I After 15462000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1203.18 seconds)\n", - "Cbc0010I After 15463000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1203.24 seconds)\n", - "Cbc0010I After 15464000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1203.30 seconds)\n", - "Cbc0010I After 15465000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1203.36 seconds)\n", - "Cbc0010I After 15466000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1203.43 seconds)\n", - "Cbc0010I After 15467000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1203.49 seconds)\n", - "Cbc0010I After 15468000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1203.55 seconds)\n", - "Cbc0010I After 15469000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1203.60 seconds)\n", - "Cbc0010I After 15470000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1203.66 seconds)\n", - "Cbc0010I After 15471000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1203.73 seconds)\n", - "Cbc0010I After 15472000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1203.79 seconds)\n", - "Cbc0010I After 15473000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1203.85 seconds)\n", - "Cbc0010I After 15474000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1203.91 seconds)\n", - "Cbc0010I After 15475000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1203.97 seconds)\n", - "Cbc0010I After 15476000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1204.03 seconds)\n", - "Cbc0010I After 15477000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1204.10 seconds)\n", - "Cbc0010I After 15478000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1204.17 seconds)\n", - "Cbc0010I After 15479000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1204.24 seconds)\n", - "Cbc0010I After 15480000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1204.31 seconds)\n", - "Cbc0010I After 15481000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1204.37 seconds)\n", - "Cbc0010I After 15482000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1204.44 seconds)\n", - "Cbc0010I After 15483000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1204.51 seconds)\n", - "Cbc0010I After 15484000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1204.61 seconds)\n", - "Cbc0010I After 15485000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1204.68 seconds)\n", - "Cbc0010I After 15486000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1204.75 seconds)\n", - "Cbc0010I After 15487000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1204.82 seconds)\n", - "Cbc0010I After 15488000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1204.89 seconds)\n", - "Cbc0010I After 15489000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1204.96 seconds)\n", - "Cbc0010I After 15490000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1205.03 seconds)\n", - "Cbc0010I After 15491000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1205.09 seconds)\n", - "Cbc0010I After 15492000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1205.15 seconds)\n", - "Cbc0010I After 15493000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1205.23 seconds)\n", - "Cbc0010I After 15494000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1205.30 seconds)\n", - "Cbc0010I After 15495000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1205.38 seconds)\n", - "Cbc0010I After 15496000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1205.45 seconds)\n", - "Cbc0010I After 15497000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1205.52 seconds)\n", - "Cbc0010I After 15498000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1205.58 seconds)\n", - "Cbc0010I After 15499000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1205.64 seconds)\n", - "Cbc0010I After 15500000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1205.71 seconds)\n", - "Cbc0010I After 15501000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1205.75 seconds)\n", - "Cbc0010I After 15502000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1205.81 seconds)\n", - "Cbc0010I After 15503000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1205.88 seconds)\n", - "Cbc0010I After 15504000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1205.94 seconds)\n", - "Cbc0010I After 15505000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1206.01 seconds)\n", - "Cbc0010I After 15506000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1206.06 seconds)\n", - "Cbc0010I After 15507000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1206.12 seconds)\n", - "Cbc0010I After 15508000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1206.19 seconds)\n", - "Cbc0010I After 15509000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1206.26 seconds)\n", - "Cbc0010I After 15510000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1206.33 seconds)\n", - "Cbc0010I After 15511000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1206.39 seconds)\n", - "Cbc0010I After 15512000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1206.45 seconds)\n", - "Cbc0010I After 15513000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1206.52 seconds)\n", - "Cbc0010I After 15514000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1206.59 seconds)\n", - "Cbc0010I After 15515000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1206.66 seconds)\n", - "Cbc0010I After 15516000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1206.73 seconds)\n", - "Cbc0010I After 15517000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1206.79 seconds)\n", - "Cbc0010I After 15518000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1206.86 seconds)\n", - "Cbc0010I After 15519000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1206.93 seconds)\n", - "Cbc0010I After 15520000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1207.01 seconds)\n", - "Cbc0010I After 15521000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1207.08 seconds)\n", - "Cbc0010I After 15522000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1207.15 seconds)\n", - "Cbc0010I After 15523000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1207.21 seconds)\n", - "Cbc0010I After 15524000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1207.28 seconds)\n", - "Cbc0010I After 15525000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1207.35 seconds)\n", - "Cbc0010I After 15526000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1207.43 seconds)\n", - "Cbc0010I After 15527000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1207.50 seconds)\n", - "Cbc0010I After 15528000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1207.58 seconds)\n", - "Cbc0010I After 15529000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1207.64 seconds)\n", - "Cbc0010I After 15530000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1207.72 seconds)\n", - "Cbc0010I After 15531000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1207.78 seconds)\n", - "Cbc0010I After 15532000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1207.84 seconds)\n", - "Cbc0010I After 15533000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1207.91 seconds)\n", - "Cbc0010I After 15534000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1207.98 seconds)\n", - "Cbc0010I After 15535000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1208.06 seconds)\n", - "Cbc0010I After 15536000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1208.12 seconds)\n", - "Cbc0010I After 15537000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1208.18 seconds)\n", - "Cbc0010I After 15538000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1208.25 seconds)\n", - "Cbc0010I After 15539000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1208.32 seconds)\n", - "Cbc0010I After 15540000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1208.38 seconds)\n", - "Cbc0010I After 15541000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1208.45 seconds)\n", - "Cbc0010I After 15542000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1208.51 seconds)\n", - "Cbc0010I After 15543000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1208.59 seconds)\n", - "Cbc0010I After 15544000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1208.64 seconds)\n", - "Cbc0010I After 15545000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1208.69 seconds)\n", - "Cbc0010I After 15546000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1208.75 seconds)\n", - "Cbc0010I After 15547000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1208.86 seconds)\n", - "Cbc0010I After 15548000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1209.00 seconds)\n", - "Cbc0010I After 15549000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1209.08 seconds)\n", - "Cbc0010I After 15550000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1209.15 seconds)\n", - "Cbc0010I After 15551000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1209.28 seconds)\n", - "Cbc0010I After 15552000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1209.37 seconds)\n", - "Cbc0010I After 15553000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1209.45 seconds)\n", - "Cbc0010I After 15554000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1209.51 seconds)\n", - "Cbc0010I After 15555000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1209.58 seconds)\n", - "Cbc0010I After 15556000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1209.66 seconds)\n", - "Cbc0010I After 15557000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1209.74 seconds)\n", - "Cbc0010I After 15558000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1209.81 seconds)\n", - "Cbc0010I After 15559000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1209.89 seconds)\n", - "Cbc0010I After 15560000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1209.95 seconds)\n", - "Cbc0010I After 15561000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1210.01 seconds)\n", - "Cbc0010I After 15562000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1210.07 seconds)\n", - "Cbc0010I After 15563000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1210.13 seconds)\n", - "Cbc0010I After 15564000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1210.18 seconds)\n", - "Cbc0010I After 15565000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1210.25 seconds)\n", - "Cbc0010I After 15566000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1210.32 seconds)\n", - "Cbc0010I After 15567000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1210.40 seconds)\n", - "Cbc0010I After 15568000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1210.47 seconds)\n", - "Cbc0010I After 15569000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1210.52 seconds)\n", - "Cbc0010I After 15570000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1210.59 seconds)\n", - "Cbc0010I After 15571000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1210.65 seconds)\n", - "Cbc0010I After 15572000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1210.72 seconds)\n", - "Cbc0010I After 15573000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1210.78 seconds)\n", - "Cbc0010I After 15574000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1210.84 seconds)\n", - "Cbc0010I After 15575000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1210.90 seconds)\n", - "Cbc0010I After 15576000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1210.95 seconds)\n", - "Cbc0010I After 15577000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1211.03 seconds)\n", - "Cbc0010I After 15578000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1211.08 seconds)\n", - "Cbc0010I After 15579000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1211.13 seconds)\n", - "Cbc0010I After 15580000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1211.19 seconds)\n", - "Cbc0010I After 15581000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.24 seconds)\n", - "Cbc0010I After 15582000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1211.30 seconds)\n", - "Cbc0010I After 15583000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1211.35 seconds)\n", - "Cbc0010I After 15584000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1211.41 seconds)\n", - "Cbc0010I After 15585000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1211.47 seconds)\n", - "Cbc0010I After 15586000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1211.53 seconds)\n", - "Cbc0010I After 15587000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1211.59 seconds)\n", - "Cbc0010I After 15588000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.65 seconds)\n", - "Cbc0010I After 15589000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1211.71 seconds)\n", - "Cbc0010I After 15590000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1211.77 seconds)\n", - "Cbc0010I After 15591000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1211.83 seconds)\n", - "Cbc0010I After 15592000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1211.90 seconds)\n", - "Cbc0010I After 15593000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1211.96 seconds)\n", - "Cbc0010I After 15594000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1212.02 seconds)\n", - "Cbc0010I After 15595000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1212.08 seconds)\n", - "Cbc0010I After 15596000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1212.15 seconds)\n", - "Cbc0010I After 15597000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1212.21 seconds)\n", - "Cbc0010I After 15598000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1212.28 seconds)\n", - "Cbc0010I After 15599000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1212.34 seconds)\n", - "Cbc0010I After 15600000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1212.41 seconds)\n", - "Cbc0010I After 15601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1212.48 seconds)\n", - "Cbc0010I After 15602000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1212.54 seconds)\n", - "Cbc0010I After 15603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1212.59 seconds)\n", - "Cbc0010I After 15604000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1212.65 seconds)\n", - "Cbc0010I After 15605000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1212.70 seconds)\n", - "Cbc0010I After 15606000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1212.78 seconds)\n", - "Cbc0010I After 15607000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1212.85 seconds)\n", - "Cbc0010I After 15608000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1212.91 seconds)\n", - "Cbc0010I After 15609000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1212.99 seconds)\n", - "Cbc0010I After 15610000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1213.07 seconds)\n", - "Cbc0010I After 15611000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1213.15 seconds)\n", - "Cbc0010I After 15612000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1213.22 seconds)\n", - "Cbc0010I After 15613000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1213.28 seconds)\n", - "Cbc0010I After 15614000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1213.35 seconds)\n", - "Cbc0010I After 15615000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1213.42 seconds)\n", - "Cbc0010I After 15616000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1213.48 seconds)\n", - "Cbc0010I After 15617000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1213.56 seconds)\n", - "Cbc0010I After 15618000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1213.65 seconds)\n", - "Cbc0010I After 15619000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1213.71 seconds)\n", - "Cbc0010I After 15620000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1213.77 seconds)\n", - "Cbc0010I After 15621000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1213.82 seconds)\n", - "Cbc0010I After 15622000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1213.87 seconds)\n", - "Cbc0010I After 15623000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1213.92 seconds)\n", - "Cbc0010I After 15624000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1213.98 seconds)\n", - "Cbc0010I After 15625000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1214.04 seconds)\n", - "Cbc0010I After 15626000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1214.09 seconds)\n", - "Cbc0010I After 15627000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1214.16 seconds)\n", - "Cbc0010I After 15628000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1214.22 seconds)\n", - "Cbc0010I After 15629000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1214.29 seconds)\n", - "Cbc0010I After 15630000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1214.35 seconds)\n", - "Cbc0010I After 15631000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1214.42 seconds)\n", - "Cbc0010I After 15632000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1214.49 seconds)\n", - "Cbc0010I After 15633000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1214.56 seconds)\n", - "Cbc0010I After 15634000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1214.62 seconds)\n", - "Cbc0010I After 15635000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1214.69 seconds)\n", - "Cbc0010I After 15636000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1214.77 seconds)\n", - "Cbc0010I After 15637000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1214.86 seconds)\n", - "Cbc0010I After 15638000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1214.95 seconds)\n", - "Cbc0010I After 15639000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1215.03 seconds)\n", - "Cbc0010I After 15640000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1215.10 seconds)\n", - "Cbc0010I After 15641000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1215.16 seconds)\n", - "Cbc0010I After 15642000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1215.22 seconds)\n", - "Cbc0010I After 15643000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1215.28 seconds)\n", - "Cbc0010I After 15644000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1215.35 seconds)\n", - "Cbc0010I After 15645000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1215.41 seconds)\n", - "Cbc0010I After 15646000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1215.49 seconds)\n", - "Cbc0010I After 15647000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1215.55 seconds)\n", - "Cbc0010I After 15648000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1215.62 seconds)\n", - "Cbc0010I After 15649000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1215.68 seconds)\n", - "Cbc0010I After 15650000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1215.74 seconds)\n", - "Cbc0010I After 15651000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1215.82 seconds)\n", - "Cbc0010I After 15652000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1215.90 seconds)\n", - "Cbc0010I After 15653000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1215.98 seconds)\n", - "Cbc0010I After 15654000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1216.07 seconds)\n", - "Cbc0010I After 15655000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1216.13 seconds)\n", - "Cbc0010I After 15656000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1216.21 seconds)\n", - "Cbc0010I After 15657000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1216.30 seconds)\n", - "Cbc0010I After 15658000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1216.37 seconds)\n", - "Cbc0010I After 15659000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1216.44 seconds)\n", - "Cbc0010I After 15660000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1216.51 seconds)\n", - "Cbc0010I After 15661000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1216.58 seconds)\n", - "Cbc0010I After 15662000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1216.65 seconds)\n", - "Cbc0010I After 15663000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1216.72 seconds)\n", - "Cbc0010I After 15664000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1216.79 seconds)\n", - "Cbc0010I After 15665000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1216.86 seconds)\n", - "Cbc0010I After 15666000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1216.92 seconds)\n", - "Cbc0010I After 15667000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1216.98 seconds)\n", - "Cbc0010I After 15668000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1217.05 seconds)\n", - "Cbc0010I After 15669000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1217.12 seconds)\n", - "Cbc0010I After 15670000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1217.18 seconds)\n", - "Cbc0010I After 15671000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1217.26 seconds)\n", - "Cbc0010I After 15672000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1217.33 seconds)\n", - "Cbc0010I After 15673000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1217.39 seconds)\n", - "Cbc0010I After 15674000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1217.46 seconds)\n", - "Cbc0010I After 15675000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1217.54 seconds)\n", - "Cbc0010I After 15676000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1217.59 seconds)\n", - "Cbc0010I After 15677000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1217.66 seconds)\n", - "Cbc0010I After 15678000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1217.74 seconds)\n", - "Cbc0010I After 15679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1217.80 seconds)\n", - "Cbc0010I After 15680000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1217.86 seconds)\n", - "Cbc0010I After 15681000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1217.92 seconds)\n", - "Cbc0010I After 15682000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1217.97 seconds)\n", - "Cbc0010I After 15683000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1218.03 seconds)\n", - "Cbc0010I After 15684000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1218.08 seconds)\n", - "Cbc0010I After 15685000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1218.14 seconds)\n", - "Cbc0010I After 15686000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1218.22 seconds)\n", - "Cbc0010I After 15687000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1218.28 seconds)\n", - "Cbc0010I After 15688000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1218.33 seconds)\n", - "Cbc0010I After 15689000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1218.40 seconds)\n", - "Cbc0010I After 15690000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1218.46 seconds)\n", - "Cbc0010I After 15691000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1218.52 seconds)\n", - "Cbc0010I After 15692000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1218.57 seconds)\n", - "Cbc0010I After 15693000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1218.64 seconds)\n", - "Cbc0010I After 15694000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1218.71 seconds)\n", - "Cbc0010I After 15695000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1218.77 seconds)\n", - "Cbc0010I After 15696000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1218.85 seconds)\n", - "Cbc0010I After 15697000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1218.92 seconds)\n", - "Cbc0010I After 15698000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1218.99 seconds)\n", - "Cbc0010I After 15699000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1219.05 seconds)\n", - "Cbc0010I After 15700000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1219.11 seconds)\n", - "Cbc0010I After 15701000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1219.17 seconds)\n", - "Cbc0010I After 15702000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1219.26 seconds)\n", - "Cbc0010I After 15703000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1219.32 seconds)\n", - "Cbc0010I After 15704000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1219.39 seconds)\n", - "Cbc0010I After 15705000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1219.45 seconds)\n", - "Cbc0010I After 15706000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1219.51 seconds)\n", - "Cbc0010I After 15707000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1219.58 seconds)\n", - "Cbc0010I After 15708000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1219.64 seconds)\n", - "Cbc0010I After 15709000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1219.70 seconds)\n", - "Cbc0010I After 15710000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1219.76 seconds)\n", - "Cbc0010I After 15711000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1219.82 seconds)\n", - "Cbc0010I After 15712000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1219.88 seconds)\n", - "Cbc0010I After 15713000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1219.94 seconds)\n", - "Cbc0010I After 15714000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1220.00 seconds)\n", - "Cbc0010I After 15715000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1220.07 seconds)\n", - "Cbc0010I After 15716000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1220.13 seconds)\n", - "Cbc0010I After 15717000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1220.19 seconds)\n", - "Cbc0010I After 15718000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1220.25 seconds)\n", - "Cbc0010I After 15719000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1220.30 seconds)\n", - "Cbc0010I After 15720000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1220.35 seconds)\n", - "Cbc0010I After 15721000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1220.42 seconds)\n", - "Cbc0010I After 15722000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1220.47 seconds)\n", - "Cbc0010I After 15723000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1220.53 seconds)\n", - "Cbc0010I After 15724000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1220.58 seconds)\n", - "Cbc0010I After 15725000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1220.63 seconds)\n", - "Cbc0010I After 15726000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1220.69 seconds)\n", - "Cbc0010I After 15727000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1220.74 seconds)\n", - "Cbc0010I After 15728000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1220.81 seconds)\n", - "Cbc0010I After 15729000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1220.89 seconds)\n", - "Cbc0010I After 15730000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1220.95 seconds)\n", - "Cbc0010I After 15731000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1221.01 seconds)\n", - "Cbc0010I After 15732000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1221.07 seconds)\n", - "Cbc0010I After 15733000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1221.14 seconds)\n", - "Cbc0010I After 15734000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1221.20 seconds)\n", - "Cbc0010I After 15735000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1221.28 seconds)\n", - "Cbc0010I After 15736000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1221.34 seconds)\n", - "Cbc0010I After 15737000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1221.40 seconds)\n", - "Cbc0010I After 15738000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1221.47 seconds)\n", - "Cbc0010I After 15739000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1221.54 seconds)\n", - "Cbc0010I After 15740000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1221.61 seconds)\n", - "Cbc0010I After 15741000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1221.67 seconds)\n", - "Cbc0010I After 15742000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1221.72 seconds)\n", - "Cbc0010I After 15743000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1221.77 seconds)\n", - "Cbc0010I After 15744000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1221.83 seconds)\n", - "Cbc0010I After 15745000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1221.88 seconds)\n", - "Cbc0010I After 15746000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1221.94 seconds)\n", - "Cbc0010I After 15747000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1222.01 seconds)\n", - "Cbc0010I After 15748000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1222.06 seconds)\n", - "Cbc0010I After 15749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1222.12 seconds)\n", - "Cbc0010I After 15750000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1222.18 seconds)\n", - "Cbc0010I After 15751000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1222.24 seconds)\n", - "Cbc0010I After 15752000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1222.29 seconds)\n", - "Cbc0010I After 15753000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1222.35 seconds)\n", - "Cbc0010I After 15754000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1222.40 seconds)\n", - "Cbc0010I After 15755000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1222.46 seconds)\n", - "Cbc0010I After 15756000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1222.52 seconds)\n", - "Cbc0010I After 15757000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1222.58 seconds)\n", - "Cbc0010I After 15758000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1222.64 seconds)\n", - "Cbc0010I After 15759000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1222.71 seconds)\n", - "Cbc0010I After 15760000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1222.78 seconds)\n", - "Cbc0010I After 15761000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1222.85 seconds)\n", - "Cbc0010I After 15762000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1222.91 seconds)\n", - "Cbc0010I After 15763000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1222.98 seconds)\n", - "Cbc0010I After 15764000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1223.04 seconds)\n", - "Cbc0010I After 15765000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1223.11 seconds)\n", - "Cbc0010I After 15766000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1223.17 seconds)\n", - "Cbc0010I After 15767000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1223.24 seconds)\n", - "Cbc0010I After 15768000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1223.30 seconds)\n", - "Cbc0010I After 15769000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1223.37 seconds)\n", - "Cbc0010I After 15770000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1223.43 seconds)\n", - "Cbc0010I After 15771000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1223.51 seconds)\n", - "Cbc0010I After 15772000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1223.58 seconds)\n", - "Cbc0010I After 15773000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1223.64 seconds)\n", - "Cbc0010I After 15774000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1223.70 seconds)\n", - "Cbc0010I After 15775000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1223.78 seconds)\n", - "Cbc0010I After 15776000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1223.86 seconds)\n", - "Cbc0010I After 15777000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1223.93 seconds)\n", - "Cbc0010I After 15778000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1223.99 seconds)\n", - "Cbc0010I After 15779000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1224.07 seconds)\n", - "Cbc0010I After 15780000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1224.13 seconds)\n", - "Cbc0010I After 15781000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1224.19 seconds)\n", - "Cbc0010I After 15782000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1224.26 seconds)\n", - "Cbc0010I After 15783000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1224.32 seconds)\n", - "Cbc0010I After 15784000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1224.39 seconds)\n", - "Cbc0010I After 15785000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1224.46 seconds)\n", - "Cbc0010I After 15786000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1224.52 seconds)\n", - "Cbc0010I After 15787000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1224.58 seconds)\n", - "Cbc0010I After 15788000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1224.64 seconds)\n", - "Cbc0010I After 15789000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1224.72 seconds)\n", - "Cbc0010I After 15790000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1224.79 seconds)\n", - "Cbc0010I After 15791000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1224.86 seconds)\n", - "Cbc0010I After 15792000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1224.92 seconds)\n", - "Cbc0010I After 15793000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1224.98 seconds)\n", - "Cbc0010I After 15794000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1225.05 seconds)\n", - "Cbc0010I After 15795000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1225.12 seconds)\n", - "Cbc0010I After 15796000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1225.19 seconds)\n", - "Cbc0010I After 15797000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1225.26 seconds)\n", - "Cbc0010I After 15798000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1225.33 seconds)\n", - "Cbc0010I After 15799000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1225.40 seconds)\n", - "Cbc0010I After 15800000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1225.47 seconds)\n", - "Cbc0010I After 15801000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1225.55 seconds)\n", - "Cbc0010I After 15802000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1225.61 seconds)\n", - "Cbc0010I After 15803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1225.67 seconds)\n", - "Cbc0010I After 15804000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1225.75 seconds)\n", - "Cbc0010I After 15805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1225.82 seconds)\n", - "Cbc0010I After 15806000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1225.89 seconds)\n", - "Cbc0010I After 15807000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1225.95 seconds)\n", - "Cbc0010I After 15808000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1226.02 seconds)\n", - "Cbc0010I After 15809000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1226.08 seconds)\n", - "Cbc0010I After 15810000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1226.14 seconds)\n", - "Cbc0010I After 15811000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1226.20 seconds)\n", - "Cbc0010I After 15812000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1226.26 seconds)\n", - "Cbc0010I After 15813000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1226.34 seconds)\n", - "Cbc0010I After 15814000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1226.40 seconds)\n", - "Cbc0010I After 15815000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1226.48 seconds)\n", - "Cbc0010I After 15816000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1226.53 seconds)\n", - "Cbc0010I After 15817000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1226.58 seconds)\n", - "Cbc0010I After 15818000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1226.66 seconds)\n", - "Cbc0010I After 15819000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1226.76 seconds)\n", - "Cbc0010I After 15820000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1226.85 seconds)\n", - "Cbc0010I After 15821000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1226.91 seconds)\n", - "Cbc0010I After 15822000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1226.98 seconds)\n", - "Cbc0010I After 15823000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1227.03 seconds)\n", - "Cbc0010I After 15824000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1227.12 seconds)\n", - "Cbc0010I After 15825000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1227.19 seconds)\n", - "Cbc0010I After 15826000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1227.26 seconds)\n", - "Cbc0010I After 15827000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1227.33 seconds)\n", - "Cbc0010I After 15828000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1227.38 seconds)\n", - "Cbc0010I After 15829000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1227.44 seconds)\n", - "Cbc0010I After 15830000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1227.49 seconds)\n", - "Cbc0010I After 15831000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1227.55 seconds)\n", - "Cbc0010I After 15832000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1227.60 seconds)\n", - "Cbc0010I After 15833000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1227.66 seconds)\n", - "Cbc0010I After 15834000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1227.71 seconds)\n", - "Cbc0010I After 15835000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1227.76 seconds)\n", - "Cbc0010I After 15836000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1227.81 seconds)\n", - "Cbc0010I After 15837000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1227.87 seconds)\n", - "Cbc0010I After 15838000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1227.93 seconds)\n", - "Cbc0010I After 15839000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1227.98 seconds)\n", - "Cbc0010I After 15840000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1228.04 seconds)\n", - "Cbc0010I After 15841000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1228.10 seconds)\n", - "Cbc0010I After 15842000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1228.15 seconds)\n", - "Cbc0010I After 15843000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1228.22 seconds)\n", - "Cbc0010I After 15844000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1228.27 seconds)\n", - "Cbc0010I After 15845000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1228.33 seconds)\n", - "Cbc0010I After 15846000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1228.38 seconds)\n", - "Cbc0010I After 15847000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1228.43 seconds)\n", - "Cbc0010I After 15848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1228.48 seconds)\n", - "Cbc0010I After 15849000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1228.54 seconds)\n", - "Cbc0010I After 15850000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1228.59 seconds)\n", - "Cbc0010I After 15851000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1228.64 seconds)\n", - "Cbc0010I After 15852000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1228.70 seconds)\n", - "Cbc0010I After 15853000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1228.75 seconds)\n", - "Cbc0010I After 15854000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1228.81 seconds)\n", - "Cbc0010I After 15855000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1228.87 seconds)\n", - "Cbc0010I After 15856000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1228.92 seconds)\n", - "Cbc0010I After 15857000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1228.98 seconds)\n", - "Cbc0010I After 15858000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1229.05 seconds)\n", - "Cbc0010I After 15859000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1229.10 seconds)\n", - "Cbc0010I After 15860000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1229.16 seconds)\n", - "Cbc0010I After 15861000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1229.22 seconds)\n", - "Cbc0010I After 15862000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1229.29 seconds)\n", - "Cbc0010I After 15863000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1229.37 seconds)\n", - "Cbc0010I After 15864000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1229.44 seconds)\n", - "Cbc0010I After 15865000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1229.51 seconds)\n", - "Cbc0010I After 15866000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1229.57 seconds)\n", - "Cbc0010I After 15867000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1229.64 seconds)\n", - "Cbc0010I After 15868000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1229.72 seconds)\n", - "Cbc0010I After 15869000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1229.79 seconds)\n", - "Cbc0010I After 15870000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1229.86 seconds)\n", - "Cbc0010I After 15871000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1229.92 seconds)\n", - "Cbc0010I After 15872000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1229.98 seconds)\n", - "Cbc0010I After 15873000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1230.05 seconds)\n", - "Cbc0010I After 15874000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1230.11 seconds)\n", - "Cbc0010I After 15875000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1230.17 seconds)\n", - "Cbc0010I After 15876000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1230.23 seconds)\n", - "Cbc0010I After 15877000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1230.29 seconds)\n", - "Cbc0010I After 15878000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1230.35 seconds)\n", - "Cbc0010I After 15879000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1230.41 seconds)\n", - "Cbc0010I After 15880000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1230.47 seconds)\n", - "Cbc0010I After 15881000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1230.53 seconds)\n", - "Cbc0010I After 15882000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1230.59 seconds)\n", - "Cbc0010I After 15883000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1230.65 seconds)\n", - "Cbc0010I After 15884000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1230.72 seconds)\n", - "Cbc0010I After 15885000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1230.78 seconds)\n", - "Cbc0010I After 15886000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1230.83 seconds)\n", - "Cbc0010I After 15887000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1230.88 seconds)\n", - "Cbc0010I After 15888000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1230.93 seconds)\n", - "Cbc0010I After 15889000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1230.99 seconds)\n", - "Cbc0010I After 15890000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1231.05 seconds)\n", - "Cbc0010I After 15891000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1231.11 seconds)\n", - "Cbc0010I After 15892000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.17 seconds)\n", - "Cbc0010I After 15893000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1231.23 seconds)\n", - "Cbc0010I After 15894000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.29 seconds)\n", - "Cbc0010I After 15895000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.36 seconds)\n", - "Cbc0010I After 15896000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1231.42 seconds)\n", - "Cbc0010I After 15897000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1231.48 seconds)\n", - "Cbc0010I After 15898000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1231.57 seconds)\n", - "Cbc0010I After 15899000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1231.64 seconds)\n", - "Cbc0010I After 15900000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1231.72 seconds)\n", - "Cbc0010I After 15901000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.81 seconds)\n", - "Cbc0010I After 15902000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1231.88 seconds)\n", - "Cbc0010I After 15903000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1231.95 seconds)\n", - "Cbc0010I After 15904000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1232.02 seconds)\n", - "Cbc0010I After 15905000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1232.08 seconds)\n", - "Cbc0010I After 15906000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1232.13 seconds)\n", - "Cbc0010I After 15907000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1232.20 seconds)\n", - "Cbc0010I After 15908000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1232.26 seconds)\n", - "Cbc0010I After 15909000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1232.33 seconds)\n", - "Cbc0010I After 15910000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1232.39 seconds)\n", - "Cbc0010I After 15911000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1232.46 seconds)\n", - "Cbc0010I After 15912000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1232.52 seconds)\n", - "Cbc0010I After 15913000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1232.59 seconds)\n", - "Cbc0010I After 15914000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1232.65 seconds)\n", - "Cbc0010I After 15915000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1232.72 seconds)\n", - "Cbc0010I After 15916000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1232.79 seconds)\n", - "Cbc0010I After 15917000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1232.85 seconds)\n", - "Cbc0010I After 15918000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1232.91 seconds)\n", - "Cbc0010I After 15919000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1232.96 seconds)\n", - "Cbc0010I After 15920000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1233.01 seconds)\n", - "Cbc0010I After 15921000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1233.08 seconds)\n", - "Cbc0010I After 15922000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.15 seconds)\n", - "Cbc0010I After 15923000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1233.22 seconds)\n", - "Cbc0010I After 15924000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1233.28 seconds)\n", - "Cbc0010I After 15925000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1233.34 seconds)\n", - "Cbc0010I After 15926000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.41 seconds)\n", - "Cbc0010I After 15927000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1233.48 seconds)\n", - "Cbc0010I After 15928000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1233.55 seconds)\n", - "Cbc0010I After 15929000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1233.62 seconds)\n", - "Cbc0010I After 15930000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1233.69 seconds)\n", - "Cbc0010I After 15931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1233.76 seconds)\n", - "Cbc0010I After 15932000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1233.83 seconds)\n", - "Cbc0010I After 15933000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1233.90 seconds)\n", - "Cbc0010I After 15934000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1233.97 seconds)\n", - "Cbc0010I After 15935000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1234.03 seconds)\n", - "Cbc0010I After 15936000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1234.08 seconds)\n", - "Cbc0010I After 15937000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1234.12 seconds)\n", - "Cbc0010I After 15938000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1234.17 seconds)\n", - "Cbc0010I After 15939000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1234.22 seconds)\n", - "Cbc0010I After 15940000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1234.29 seconds)\n", - "Cbc0010I After 15941000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1234.36 seconds)\n", - "Cbc0010I After 15942000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1234.44 seconds)\n", - "Cbc0010I After 15943000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1234.51 seconds)\n", - "Cbc0010I After 15944000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1234.57 seconds)\n", - "Cbc0010I After 15945000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1234.64 seconds)\n", - "Cbc0010I After 15946000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1234.71 seconds)\n", - "Cbc0010I After 15947000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1234.77 seconds)\n", - "Cbc0010I After 15948000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1234.83 seconds)\n", - "Cbc0010I After 15949000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1234.89 seconds)\n", - "Cbc0010I After 15950000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1234.96 seconds)\n", - "Cbc0010I After 15951000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1235.02 seconds)\n", - "Cbc0010I After 15952000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1235.09 seconds)\n", - "Cbc0010I After 15953000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1235.15 seconds)\n", - "Cbc0010I After 15954000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1235.23 seconds)\n", - "Cbc0010I After 15955000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1235.31 seconds)\n", - "Cbc0010I After 15956000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1235.37 seconds)\n", - "Cbc0010I After 15957000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1235.44 seconds)\n", - "Cbc0010I After 15958000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1235.50 seconds)\n", - "Cbc0010I After 15959000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1235.55 seconds)\n", - "Cbc0010I After 15960000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1235.61 seconds)\n", - "Cbc0010I After 15961000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1235.66 seconds)\n", - "Cbc0010I After 15962000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1235.71 seconds)\n", - "Cbc0010I After 15963000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1235.77 seconds)\n", - "Cbc0010I After 15964000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1235.82 seconds)\n", - "Cbc0010I After 15965000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1235.88 seconds)\n", - "Cbc0010I After 15966000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1235.93 seconds)\n", - "Cbc0010I After 15967000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1235.99 seconds)\n", - "Cbc0010I After 15968000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1236.04 seconds)\n", - "Cbc0010I After 15969000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1236.11 seconds)\n", - "Cbc0010I After 15970000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1236.17 seconds)\n", - "Cbc0010I After 15971000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1236.23 seconds)\n", - "Cbc0010I After 15972000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1236.29 seconds)\n", - "Cbc0010I After 15973000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1236.35 seconds)\n", - "Cbc0010I After 15974000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1236.40 seconds)\n", - "Cbc0010I After 15975000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1236.46 seconds)\n", - "Cbc0010I After 15976000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1236.52 seconds)\n", - "Cbc0010I After 15977000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1236.56 seconds)\n", - "Cbc0010I After 15978000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1236.62 seconds)\n", - "Cbc0010I After 15979000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1236.69 seconds)\n", - "Cbc0010I After 15980000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1236.75 seconds)\n", - "Cbc0010I After 15981000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1236.81 seconds)\n", - "Cbc0010I After 15982000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1236.87 seconds)\n", - "Cbc0010I After 15983000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1236.93 seconds)\n", - "Cbc0010I After 15984000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1236.99 seconds)\n", - "Cbc0010I After 15985000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1237.06 seconds)\n", - "Cbc0010I After 15986000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1237.12 seconds)\n", - "Cbc0010I After 15987000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1237.20 seconds)\n", - "Cbc0010I After 15988000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1237.27 seconds)\n", - "Cbc0010I After 15989000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1237.33 seconds)\n", - "Cbc0010I After 15990000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1237.38 seconds)\n", - "Cbc0010I After 15991000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1237.43 seconds)\n", - "Cbc0010I After 15992000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1237.49 seconds)\n", - "Cbc0010I After 15993000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1237.54 seconds)\n", - "Cbc0010I After 15994000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1237.60 seconds)\n", - "Cbc0010I After 15995000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1237.66 seconds)\n", - "Cbc0010I After 15996000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1237.73 seconds)\n", - "Cbc0010I After 15997000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1237.80 seconds)\n", - "Cbc0010I After 15998000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1237.87 seconds)\n", - "Cbc0010I After 15999000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1237.92 seconds)\n", - "Cbc0010I After 16000000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1237.99 seconds)\n", - "Cbc0010I After 16001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1238.04 seconds)\n", - "Cbc0010I After 16002000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1238.11 seconds)\n", - "Cbc0010I After 16003000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1238.17 seconds)\n", - "Cbc0010I After 16004000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1238.22 seconds)\n", - "Cbc0010I After 16005000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1238.29 seconds)\n", - "Cbc0010I After 16006000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1238.35 seconds)\n", - "Cbc0010I After 16007000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1238.40 seconds)\n", - "Cbc0010I After 16008000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1238.45 seconds)\n", - "Cbc0010I After 16009000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1238.51 seconds)\n", - "Cbc0010I After 16010000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1238.56 seconds)\n", - "Cbc0010I After 16011000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1238.62 seconds)\n", - "Cbc0010I After 16012000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1238.68 seconds)\n", - "Cbc0010I After 16013000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1238.75 seconds)\n", - "Cbc0010I After 16014000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1238.80 seconds)\n", - "Cbc0010I After 16015000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1238.85 seconds)\n", - "Cbc0010I After 16016000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1238.90 seconds)\n", - "Cbc0010I After 16017000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1238.96 seconds)\n", - "Cbc0010I After 16018000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1239.02 seconds)\n", - "Cbc0010I After 16019000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1239.08 seconds)\n", - "Cbc0010I After 16020000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1239.13 seconds)\n", - "Cbc0010I After 16021000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1239.19 seconds)\n", - "Cbc0010I After 16022000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.25 seconds)\n", - "Cbc0010I After 16023000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1239.31 seconds)\n", - "Cbc0010I After 16024000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1239.39 seconds)\n", - "Cbc0010I After 16025000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1239.46 seconds)\n", - "Cbc0010I After 16026000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1239.52 seconds)\n", - "Cbc0010I After 16027000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1239.59 seconds)\n", - "Cbc0010I After 16028000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1239.66 seconds)\n", - "Cbc0010I After 16029000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.72 seconds)\n", - "Cbc0010I After 16030000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1239.79 seconds)\n", - "Cbc0010I After 16031000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1239.85 seconds)\n", - "Cbc0010I After 16032000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1239.91 seconds)\n", - "Cbc0010I After 16033000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1239.98 seconds)\n", - "Cbc0010I After 16034000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1240.05 seconds)\n", - "Cbc0010I After 16035000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1240.11 seconds)\n", - "Cbc0010I After 16036000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1240.17 seconds)\n", - "Cbc0010I After 16037000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1240.22 seconds)\n", - "Cbc0010I After 16038000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1240.28 seconds)\n", - "Cbc0010I After 16039000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1240.35 seconds)\n", - "Cbc0010I After 16040000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1240.40 seconds)\n", - "Cbc0010I After 16041000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1240.46 seconds)\n", - "Cbc0010I After 16042000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1240.54 seconds)\n", - "Cbc0010I After 16043000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1240.60 seconds)\n", - "Cbc0010I After 16044000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1240.69 seconds)\n", - "Cbc0010I After 16045000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1240.76 seconds)\n", - "Cbc0010I After 16046000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1240.83 seconds)\n", - "Cbc0010I After 16047000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1240.89 seconds)\n", - "Cbc0010I After 16048000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1240.95 seconds)\n", - "Cbc0010I After 16049000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1241.01 seconds)\n", - "Cbc0010I After 16050000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1241.09 seconds)\n", - "Cbc0010I After 16051000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1241.15 seconds)\n", - "Cbc0010I After 16052000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1241.21 seconds)\n", - "Cbc0010I After 16053000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1241.28 seconds)\n", - "Cbc0010I After 16054000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1241.34 seconds)\n", - "Cbc0010I After 16055000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1241.42 seconds)\n", - "Cbc0010I After 16056000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1241.50 seconds)\n", - "Cbc0010I After 16057000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1241.56 seconds)\n", - "Cbc0010I After 16058000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1241.62 seconds)\n", - "Cbc0010I After 16059000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1241.68 seconds)\n", - "Cbc0010I After 16060000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1241.74 seconds)\n", - "Cbc0010I After 16061000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1241.82 seconds)\n", - "Cbc0010I After 16062000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1241.88 seconds)\n", - "Cbc0010I After 16063000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1241.96 seconds)\n", - "Cbc0010I After 16064000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1242.02 seconds)\n", - "Cbc0010I After 16065000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1242.09 seconds)\n", - "Cbc0010I After 16066000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1242.16 seconds)\n", - "Cbc0010I After 16067000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1242.22 seconds)\n", - "Cbc0010I After 16068000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1242.31 seconds)\n", - "Cbc0010I After 16069000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1242.40 seconds)\n", - "Cbc0010I After 16070000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1242.47 seconds)\n", - "Cbc0010I After 16071000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1242.52 seconds)\n", - "Cbc0010I After 16072000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1242.57 seconds)\n", - "Cbc0010I After 16073000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1242.61 seconds)\n", - "Cbc0010I After 16074000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1242.69 seconds)\n", - "Cbc0010I After 16075000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1242.77 seconds)\n", - "Cbc0010I After 16076000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1242.84 seconds)\n", - "Cbc0010I After 16077000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1242.91 seconds)\n", - "Cbc0010I After 16078000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1242.98 seconds)\n", - "Cbc0010I After 16079000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1243.04 seconds)\n", - "Cbc0010I After 16080000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1243.11 seconds)\n", - "Cbc0010I After 16081000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1243.18 seconds)\n", - "Cbc0010I After 16082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1243.25 seconds)\n", - "Cbc0010I After 16083000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1243.32 seconds)\n", - "Cbc0010I After 16084000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1243.39 seconds)\n", - "Cbc0010I After 16085000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1243.47 seconds)\n", - "Cbc0010I After 16086000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1243.54 seconds)\n", - "Cbc0010I After 16087000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1243.62 seconds)\n", - "Cbc0010I After 16088000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1243.69 seconds)\n", - "Cbc0010I After 16089000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1243.76 seconds)\n", - "Cbc0010I After 16090000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1243.84 seconds)\n", - "Cbc0010I After 16091000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1243.92 seconds)\n", - "Cbc0010I After 16092000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1243.98 seconds)\n", - "Cbc0010I After 16093000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1244.05 seconds)\n", - "Cbc0010I After 16094000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1244.12 seconds)\n", - "Cbc0010I After 16095000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1244.18 seconds)\n", - "Cbc0010I After 16096000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1244.24 seconds)\n", - "Cbc0010I After 16097000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1244.30 seconds)\n", - "Cbc0010I After 16098000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1244.38 seconds)\n", - "Cbc0010I After 16099000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1244.46 seconds)\n", - "Cbc0010I After 16100000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1244.55 seconds)\n", - "Cbc0010I After 16101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1244.61 seconds)\n", - "Cbc0010I After 16102000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1244.67 seconds)\n", - "Cbc0010I After 16103000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1244.74 seconds)\n", - "Cbc0010I After 16104000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1244.80 seconds)\n", - "Cbc0010I After 16105000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1244.86 seconds)\n", - "Cbc0010I After 16106000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1244.92 seconds)\n", - "Cbc0010I After 16107000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1244.99 seconds)\n", - "Cbc0010I After 16108000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1245.05 seconds)\n", - "Cbc0010I After 16109000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1245.11 seconds)\n", - "Cbc0010I After 16110000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1245.18 seconds)\n", - "Cbc0010I After 16111000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1245.24 seconds)\n", - "Cbc0010I After 16112000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1245.30 seconds)\n", - "Cbc0010I After 16113000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1245.36 seconds)\n", - "Cbc0010I After 16114000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1245.42 seconds)\n", - "Cbc0010I After 16115000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1245.47 seconds)\n", - "Cbc0010I After 16116000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1245.53 seconds)\n", - "Cbc0010I After 16117000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1245.58 seconds)\n", - "Cbc0010I After 16118000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1245.65 seconds)\n", - "Cbc0010I After 16119000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1245.72 seconds)\n", - "Cbc0010I After 16120000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1245.79 seconds)\n", - "Cbc0010I After 16121000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1245.89 seconds)\n", - "Cbc0010I After 16122000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1245.96 seconds)\n", - "Cbc0010I After 16123000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1246.03 seconds)\n", - "Cbc0010I After 16124000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.10 seconds)\n", - "Cbc0010I After 16125000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1246.15 seconds)\n", - "Cbc0010I After 16126000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1246.21 seconds)\n", - "Cbc0010I After 16127000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1246.27 seconds)\n", - "Cbc0010I After 16128000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.32 seconds)\n", - "Cbc0010I After 16129000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1246.37 seconds)\n", - "Cbc0010I After 16130000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1246.43 seconds)\n", - "Cbc0010I After 16131000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1246.49 seconds)\n", - "Cbc0010I After 16132000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1246.54 seconds)\n", - "Cbc0010I After 16133000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1246.59 seconds)\n", - "Cbc0010I After 16134000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1246.65 seconds)\n", - "Cbc0010I After 16135000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1246.71 seconds)\n", - "Cbc0010I After 16136000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1246.76 seconds)\n", - "Cbc0010I After 16137000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1246.82 seconds)\n", - "Cbc0010I After 16138000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1246.89 seconds)\n", - "Cbc0010I After 16139000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1246.95 seconds)\n", - "Cbc0010I After 16140000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1247.01 seconds)\n", - "Cbc0010I After 16141000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1247.07 seconds)\n", - "Cbc0010I After 16142000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1247.14 seconds)\n", - "Cbc0010I After 16143000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1247.19 seconds)\n", - "Cbc0010I After 16144000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1247.25 seconds)\n", - "Cbc0010I After 16145000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1247.32 seconds)\n", - "Cbc0010I After 16146000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1247.38 seconds)\n", - "Cbc0010I After 16147000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1247.45 seconds)\n", - "Cbc0010I After 16148000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1247.53 seconds)\n", - "Cbc0010I After 16149000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1247.60 seconds)\n", - "Cbc0010I After 16150000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1247.65 seconds)\n", - "Cbc0010I After 16151000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1247.71 seconds)\n", - "Cbc0010I After 16152000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1247.77 seconds)\n", - "Cbc0010I After 16153000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1247.84 seconds)\n", - "Cbc0010I After 16154000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1247.92 seconds)\n", - "Cbc0010I After 16155000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1247.98 seconds)\n", - "Cbc0010I After 16156000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1248.05 seconds)\n", - "Cbc0010I After 16157000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1248.12 seconds)\n", - "Cbc0010I After 16158000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1248.17 seconds)\n", - "Cbc0010I After 16159000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.24 seconds)\n", - "Cbc0010I After 16160000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1248.31 seconds)\n", - "Cbc0010I After 16161000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1248.36 seconds)\n", - "Cbc0010I After 16162000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1248.43 seconds)\n", - "Cbc0010I After 16163000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1248.50 seconds)\n", - "Cbc0010I After 16164000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1248.56 seconds)\n", - "Cbc0010I After 16165000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1248.61 seconds)\n", - "Cbc0010I After 16166000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1248.65 seconds)\n", - "Cbc0010I After 16167000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1248.70 seconds)\n", - "Cbc0010I After 16168000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.75 seconds)\n", - "Cbc0010I After 16169000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1248.83 seconds)\n", - "Cbc0010I After 16170000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1248.89 seconds)\n", - "Cbc0010I After 16171000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1248.95 seconds)\n", - "Cbc0010I After 16172000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1249.02 seconds)\n", - "Cbc0010I After 16173000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1249.09 seconds)\n", - "Cbc0010I After 16174000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1249.16 seconds)\n", - "Cbc0010I After 16175000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1249.23 seconds)\n", - "Cbc0010I After 16176000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1249.30 seconds)\n", - "Cbc0010I After 16177000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1249.38 seconds)\n", - "Cbc0010I After 16178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1249.46 seconds)\n", - "Cbc0010I After 16179000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1249.53 seconds)\n", - "Cbc0010I After 16180000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.60 seconds)\n", - "Cbc0010I After 16181000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1249.67 seconds)\n", - "Cbc0010I After 16182000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1249.73 seconds)\n", - "Cbc0010I After 16183000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1249.79 seconds)\n", - "Cbc0010I After 16184000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.86 seconds)\n", - "Cbc0010I After 16185000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1249.93 seconds)\n", - "Cbc0010I After 16186000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1249.99 seconds)\n", - "Cbc0010I After 16187000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1250.05 seconds)\n", - "Cbc0010I After 16188000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1250.12 seconds)\n", - "Cbc0010I After 16189000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.19 seconds)\n", - "Cbc0010I After 16190000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1250.27 seconds)\n", - "Cbc0010I After 16191000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1250.34 seconds)\n", - "Cbc0010I After 16192000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1250.42 seconds)\n", - "Cbc0010I After 16193000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1250.49 seconds)\n", - "Cbc0010I After 16194000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1250.56 seconds)\n", - "Cbc0010I After 16195000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1250.63 seconds)\n", - "Cbc0010I After 16196000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1250.68 seconds)\n", - "Cbc0010I After 16197000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1250.73 seconds)\n", - "Cbc0010I After 16198000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.79 seconds)\n", - "Cbc0010I After 16199000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1250.86 seconds)\n", - "Cbc0010I After 16200000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1250.92 seconds)\n", - "Cbc0010I After 16201000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1250.99 seconds)\n", - "Cbc0010I After 16202000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1251.05 seconds)\n", - "Cbc0010I After 16203000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1251.12 seconds)\n", - "Cbc0010I After 16204000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1251.19 seconds)\n", - "Cbc0010I After 16205000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1251.27 seconds)\n", - "Cbc0010I After 16206000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1251.34 seconds)\n", - "Cbc0010I After 16207000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1251.41 seconds)\n", - "Cbc0010I After 16208000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1251.47 seconds)\n", - "Cbc0010I After 16209000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1251.52 seconds)\n", - "Cbc0010I After 16210000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1251.58 seconds)\n", - "Cbc0010I After 16211000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1251.63 seconds)\n", - "Cbc0010I After 16212000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1251.68 seconds)\n", - "Cbc0010I After 16213000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1251.75 seconds)\n", - "Cbc0010I After 16214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1251.82 seconds)\n", - "Cbc0010I After 16215000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1251.90 seconds)\n", - "Cbc0010I After 16216000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1251.96 seconds)\n", - "Cbc0010I After 16217000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1252.03 seconds)\n", - "Cbc0010I After 16218000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1252.10 seconds)\n", - "Cbc0010I After 16219000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1252.17 seconds)\n", - "Cbc0010I After 16220000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1252.23 seconds)\n", - "Cbc0010I After 16221000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1252.29 seconds)\n", - "Cbc0010I After 16222000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1252.36 seconds)\n", - "Cbc0010I After 16223000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1252.42 seconds)\n", - "Cbc0010I After 16224000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1252.49 seconds)\n", - "Cbc0010I After 16225000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1252.56 seconds)\n", - "Cbc0010I After 16226000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1252.64 seconds)\n", - "Cbc0010I After 16227000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1252.71 seconds)\n", - "Cbc0010I After 16228000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1252.78 seconds)\n", - "Cbc0010I After 16229000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1252.86 seconds)\n", - "Cbc0010I After 16230000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1252.94 seconds)\n", - "Cbc0010I After 16231000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1253.00 seconds)\n", - "Cbc0010I After 16232000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1253.06 seconds)\n", - "Cbc0010I After 16233000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1253.12 seconds)\n", - "Cbc0010I After 16234000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1253.19 seconds)\n", - "Cbc0010I After 16235000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1253.27 seconds)\n", - "Cbc0010I After 16236000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1253.34 seconds)\n", - "Cbc0010I After 16237000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1253.41 seconds)\n", - "Cbc0010I After 16238000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1253.48 seconds)\n", - "Cbc0010I After 16239000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1253.54 seconds)\n", - "Cbc0010I After 16240000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1253.60 seconds)\n", - "Cbc0010I After 16241000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1253.67 seconds)\n", - "Cbc0010I After 16242000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1253.73 seconds)\n", - "Cbc0010I After 16243000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1253.82 seconds)\n", - "Cbc0010I After 16244000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1253.94 seconds)\n", - "Cbc0010I After 16245000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1254.02 seconds)\n", - "Cbc0010I After 16246000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1254.10 seconds)\n", - "Cbc0010I After 16247000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1254.18 seconds)\n", - "Cbc0010I After 16248000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1254.26 seconds)\n", - "Cbc0010I After 16249000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1254.32 seconds)\n", - "Cbc0010I After 16250000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1254.39 seconds)\n", - "Cbc0010I After 16251000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1254.44 seconds)\n", - "Cbc0010I After 16252000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1254.50 seconds)\n", - "Cbc0010I After 16253000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1254.57 seconds)\n", - "Cbc0010I After 16254000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1254.65 seconds)\n", - "Cbc0010I After 16255000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1254.70 seconds)\n", - "Cbc0010I After 16256000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1254.77 seconds)\n", - "Cbc0010I After 16257000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1254.82 seconds)\n", - "Cbc0010I After 16258000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1254.88 seconds)\n", - "Cbc0010I After 16259000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1254.94 seconds)\n", - "Cbc0010I After 16260000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1254.99 seconds)\n", - "Cbc0010I After 16261000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1255.05 seconds)\n", - "Cbc0010I After 16262000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1255.11 seconds)\n", - "Cbc0010I After 16263000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.16 seconds)\n", - "Cbc0010I After 16264000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1255.23 seconds)\n", - "Cbc0010I After 16265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.28 seconds)\n", - "Cbc0010I After 16266000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1255.34 seconds)\n", - "Cbc0010I After 16267000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1255.39 seconds)\n", - "Cbc0010I After 16268000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1255.45 seconds)\n", - "Cbc0010I After 16269000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1255.52 seconds)\n", - "Cbc0010I After 16270000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1255.57 seconds)\n", - "Cbc0010I After 16271000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1255.63 seconds)\n", - "Cbc0010I After 16272000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1255.70 seconds)\n", - "Cbc0010I After 16273000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1255.76 seconds)\n", - "Cbc0010I After 16274000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1255.83 seconds)\n", - "Cbc0010I After 16275000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1255.90 seconds)\n", - "Cbc0010I After 16276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1255.96 seconds)\n", - "Cbc0010I After 16277000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1256.04 seconds)\n", - "Cbc0010I After 16278000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.11 seconds)\n", - "Cbc0010I After 16279000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1256.16 seconds)\n", - "Cbc0010I After 16280000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.23 seconds)\n", - "Cbc0010I After 16281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1256.29 seconds)\n", - "Cbc0010I After 16282000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1256.37 seconds)\n", - "Cbc0010I After 16283000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1256.42 seconds)\n", - "Cbc0010I After 16284000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1256.46 seconds)\n", - "Cbc0010I After 16285000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1256.52 seconds)\n", - "Cbc0010I After 16286000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1256.59 seconds)\n", - "Cbc0010I After 16287000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1256.65 seconds)\n", - "Cbc0010I After 16288000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1256.72 seconds)\n", - "Cbc0010I After 16289000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1256.78 seconds)\n", - "Cbc0010I After 16290000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1256.84 seconds)\n", - "Cbc0010I After 16291000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1256.88 seconds)\n", - "Cbc0010I After 16292000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1256.94 seconds)\n", - "Cbc0010I After 16293000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1257.02 seconds)\n", - "Cbc0010I After 16294000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1257.08 seconds)\n", - "Cbc0010I After 16295000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1257.16 seconds)\n", - "Cbc0010I After 16296000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1257.22 seconds)\n", - "Cbc0010I After 16297000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1257.28 seconds)\n", - "Cbc0010I After 16298000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1257.35 seconds)\n", - "Cbc0010I After 16299000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1257.41 seconds)\n", - "Cbc0010I After 16300000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1257.48 seconds)\n", - "Cbc0010I After 16301000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1257.57 seconds)\n", - "Cbc0010I After 16302000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1257.66 seconds)\n", - "Cbc0010I After 16303000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1257.74 seconds)\n", - "Cbc0010I After 16304000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1257.81 seconds)\n", - "Cbc0010I After 16305000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1257.87 seconds)\n", - "Cbc0010I After 16306000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1257.91 seconds)\n", - "Cbc0010I After 16307000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1257.97 seconds)\n", - "Cbc0010I After 16308000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1258.02 seconds)\n", - "Cbc0010I After 16309000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1258.06 seconds)\n", - "Cbc0010I After 16310000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1258.10 seconds)\n", - "Cbc0010I After 16311000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1258.16 seconds)\n", - "Cbc0010I After 16312000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1258.24 seconds)\n", - "Cbc0010I After 16313000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1258.30 seconds)\n", - "Cbc0010I After 16314000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1258.36 seconds)\n", - "Cbc0010I After 16315000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1258.42 seconds)\n", - "Cbc0010I After 16316000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1258.48 seconds)\n", - "Cbc0010I After 16317000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1258.55 seconds)\n", - "Cbc0010I After 16318000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1258.60 seconds)\n", - "Cbc0010I After 16319000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1258.68 seconds)\n", - "Cbc0010I After 16320000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1258.78 seconds)\n", - "Cbc0010I After 16321000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1258.86 seconds)\n", - "Cbc0010I After 16322000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1258.93 seconds)\n", - "Cbc0010I After 16323000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1258.99 seconds)\n", - "Cbc0010I After 16324000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1259.06 seconds)\n", - "Cbc0010I After 16325000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1259.12 seconds)\n", - "Cbc0010I After 16326000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1259.18 seconds)\n", - "Cbc0010I After 16327000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1259.25 seconds)\n", - "Cbc0010I After 16328000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1259.31 seconds)\n", - "Cbc0010I After 16329000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1259.37 seconds)\n", - "Cbc0010I After 16330000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1259.46 seconds)\n", - "Cbc0010I After 16331000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1259.54 seconds)\n", - "Cbc0010I After 16332000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1259.61 seconds)\n", - "Cbc0010I After 16333000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1259.67 seconds)\n", - "Cbc0010I After 16334000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1259.74 seconds)\n", - "Cbc0010I After 16335000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1259.81 seconds)\n", - "Cbc0010I After 16336000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1259.89 seconds)\n", - "Cbc0010I After 16337000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1259.96 seconds)\n", - "Cbc0010I After 16338000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1260.03 seconds)\n", - "Cbc0010I After 16339000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1260.11 seconds)\n", - "Cbc0010I After 16340000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1260.19 seconds)\n", - "Cbc0010I After 16341000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1260.25 seconds)\n", - "Cbc0010I After 16342000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1260.31 seconds)\n", - "Cbc0010I After 16343000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1260.40 seconds)\n", - "Cbc0010I After 16344000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1260.48 seconds)\n", - "Cbc0010I After 16345000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1260.55 seconds)\n", - "Cbc0010I After 16346000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1260.61 seconds)\n", - "Cbc0010I After 16347000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.67 seconds)\n", - "Cbc0010I After 16348000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.73 seconds)\n", - "Cbc0010I After 16349000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.81 seconds)\n", - "Cbc0010I After 16350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1260.89 seconds)\n", - "Cbc0010I After 16351000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1260.97 seconds)\n", - "Cbc0010I After 16352000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1261.04 seconds)\n", - "Cbc0010I After 16353000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1261.12 seconds)\n", - "Cbc0010I After 16354000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1261.19 seconds)\n", - "Cbc0010I After 16355000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1261.25 seconds)\n", - "Cbc0010I After 16356000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1261.32 seconds)\n", - "Cbc0010I After 16357000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1261.39 seconds)\n", - "Cbc0010I After 16358000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1261.44 seconds)\n", - "Cbc0010I After 16359000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1261.51 seconds)\n", - "Cbc0010I After 16360000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1261.59 seconds)\n", - "Cbc0010I After 16361000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1261.67 seconds)\n", - "Cbc0010I After 16362000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1261.73 seconds)\n", - "Cbc0010I After 16363000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1261.80 seconds)\n", - "Cbc0010I After 16364000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1261.87 seconds)\n", - "Cbc0010I After 16365000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1261.94 seconds)\n", - "Cbc0010I After 16366000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1262.01 seconds)\n", - "Cbc0010I After 16367000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1262.09 seconds)\n", - "Cbc0010I After 16368000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1262.15 seconds)\n", - "Cbc0010I After 16369000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1262.21 seconds)\n", - "Cbc0010I After 16370000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1262.28 seconds)\n", - "Cbc0010I After 16371000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1262.35 seconds)\n", - "Cbc0010I After 16372000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1262.42 seconds)\n", - "Cbc0010I After 16373000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1262.50 seconds)\n", - "Cbc0010I After 16374000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1262.58 seconds)\n", - "Cbc0010I After 16375000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1262.65 seconds)\n", - "Cbc0010I After 16376000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1262.72 seconds)\n", - "Cbc0010I After 16377000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1262.78 seconds)\n", - "Cbc0010I After 16378000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1262.86 seconds)\n", - "Cbc0010I After 16379000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1262.95 seconds)\n", - "Cbc0010I After 16380000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1263.03 seconds)\n", - "Cbc0010I After 16381000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1263.09 seconds)\n", - "Cbc0010I After 16382000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1263.16 seconds)\n", - "Cbc0010I After 16383000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1263.23 seconds)\n", - "Cbc0010I After 16384000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1263.29 seconds)\n", - "Cbc0010I After 16385000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1263.35 seconds)\n", - "Cbc0010I After 16386000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1263.41 seconds)\n", - "Cbc0010I After 16387000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1263.49 seconds)\n", - "Cbc0010I After 16388000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1263.54 seconds)\n", - "Cbc0010I After 16389000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1263.61 seconds)\n", - "Cbc0010I After 16390000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1263.69 seconds)\n", - "Cbc0010I After 16391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1263.75 seconds)\n", - "Cbc0010I After 16392000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1263.82 seconds)\n", - "Cbc0010I After 16393000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1263.89 seconds)\n", - "Cbc0010I After 16394000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1263.95 seconds)\n", - "Cbc0010I After 16395000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1264.02 seconds)\n", - "Cbc0010I After 16396000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1264.08 seconds)\n", - "Cbc0010I After 16397000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1264.14 seconds)\n", - "Cbc0010I After 16398000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1264.22 seconds)\n", - "Cbc0010I After 16399000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1264.29 seconds)\n", - "Cbc0010I After 16400000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1264.35 seconds)\n", - "Cbc0010I After 16401000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1264.41 seconds)\n", - "Cbc0010I After 16402000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1264.46 seconds)\n", - "Cbc0010I After 16403000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1264.53 seconds)\n", - "Cbc0010I After 16404000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1264.59 seconds)\n", - "Cbc0010I After 16405000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1264.66 seconds)\n", - "Cbc0010I After 16406000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1264.71 seconds)\n", - "Cbc0010I After 16407000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1264.77 seconds)\n", - "Cbc0010I After 16408000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1264.83 seconds)\n", - "Cbc0010I After 16409000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1264.89 seconds)\n", - "Cbc0010I After 16410000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1264.95 seconds)\n", - "Cbc0010I After 16411000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1265.01 seconds)\n", - "Cbc0010I After 16412000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1265.08 seconds)\n", - "Cbc0010I After 16413000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1265.15 seconds)\n", - "Cbc0010I After 16414000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1265.22 seconds)\n", - "Cbc0010I After 16415000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1265.28 seconds)\n", - "Cbc0010I After 16416000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1265.34 seconds)\n", - "Cbc0010I After 16417000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1265.40 seconds)\n", - "Cbc0010I After 16418000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1265.46 seconds)\n", - "Cbc0010I After 16419000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1265.53 seconds)\n", - "Cbc0010I After 16420000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1265.59 seconds)\n", - "Cbc0010I After 16421000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1265.65 seconds)\n", - "Cbc0010I After 16422000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1265.71 seconds)\n", - "Cbc0010I After 16423000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1265.77 seconds)\n", - "Cbc0010I After 16424000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1265.83 seconds)\n", - "Cbc0010I After 16425000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1265.89 seconds)\n", - "Cbc0010I After 16426000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1265.94 seconds)\n", - "Cbc0010I After 16427000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1266.00 seconds)\n", - "Cbc0010I After 16428000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1266.05 seconds)\n", - "Cbc0010I After 16429000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1266.11 seconds)\n", - "Cbc0010I After 16430000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1266.17 seconds)\n", - "Cbc0010I After 16431000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1266.22 seconds)\n", - "Cbc0010I After 16432000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1266.29 seconds)\n", - "Cbc0010I After 16433000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1266.36 seconds)\n", - "Cbc0010I After 16434000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1266.42 seconds)\n", - "Cbc0010I After 16435000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1266.48 seconds)\n", - "Cbc0010I After 16436000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1266.54 seconds)\n", - "Cbc0010I After 16437000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1266.61 seconds)\n", - "Cbc0010I After 16438000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1266.67 seconds)\n", - "Cbc0010I After 16439000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1266.73 seconds)\n", - "Cbc0010I After 16440000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1266.79 seconds)\n", - "Cbc0010I After 16441000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1266.84 seconds)\n", - "Cbc0010I After 16442000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1266.89 seconds)\n", - "Cbc0010I After 16443000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1266.95 seconds)\n", - "Cbc0010I After 16444000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1267.01 seconds)\n", - "Cbc0010I After 16445000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1267.11 seconds)\n", - "Cbc0010I After 16446000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1267.21 seconds)\n", - "Cbc0010I After 16447000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1267.28 seconds)\n", - "Cbc0010I After 16448000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1267.36 seconds)\n", - "Cbc0010I After 16449000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1267.42 seconds)\n", - "Cbc0010I After 16450000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1267.49 seconds)\n", - "Cbc0010I After 16451000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1267.55 seconds)\n", - "Cbc0010I After 16452000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1267.60 seconds)\n", - "Cbc0010I After 16453000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1267.67 seconds)\n", - "Cbc0010I After 16454000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1267.73 seconds)\n", - "Cbc0010I After 16455000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1267.79 seconds)\n", - "Cbc0010I After 16456000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1267.85 seconds)\n", - "Cbc0010I After 16457000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1267.91 seconds)\n", - "Cbc0010I After 16458000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1267.96 seconds)\n", - "Cbc0010I After 16459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1268.02 seconds)\n", - "Cbc0010I After 16460000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1268.08 seconds)\n", - "Cbc0010I After 16461000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1268.14 seconds)\n", - "Cbc0010I After 16462000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1268.20 seconds)\n", - "Cbc0010I After 16463000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1268.27 seconds)\n", - "Cbc0010I After 16464000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1268.33 seconds)\n", - "Cbc0010I After 16465000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1268.39 seconds)\n", - "Cbc0010I After 16466000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1268.46 seconds)\n", - "Cbc0010I After 16467000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1268.53 seconds)\n", - "Cbc0010I After 16468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1268.61 seconds)\n", - "Cbc0010I After 16469000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1268.68 seconds)\n", - "Cbc0010I After 16470000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1268.75 seconds)\n", - "Cbc0010I After 16471000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1268.82 seconds)\n", - "Cbc0010I After 16472000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1268.88 seconds)\n", - "Cbc0010I After 16473000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1268.94 seconds)\n", - "Cbc0010I After 16474000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1269.00 seconds)\n", - "Cbc0010I After 16475000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1269.06 seconds)\n", - "Cbc0010I After 16476000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1269.11 seconds)\n", - "Cbc0010I After 16477000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1269.18 seconds)\n", - "Cbc0010I After 16478000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1269.25 seconds)\n", - "Cbc0010I After 16479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1269.32 seconds)\n", - "Cbc0010I After 16480000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1269.38 seconds)\n", - "Cbc0010I After 16481000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1269.46 seconds)\n", - "Cbc0010I After 16482000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1269.55 seconds)\n", - "Cbc0010I After 16483000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1269.63 seconds)\n", - "Cbc0010I After 16484000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1269.70 seconds)\n", - "Cbc0010I After 16485000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1269.77 seconds)\n", - "Cbc0010I After 16486000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1269.85 seconds)\n", - "Cbc0010I After 16487000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1269.92 seconds)\n", - "Cbc0010I After 16488000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1269.97 seconds)\n", - "Cbc0010I After 16489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1270.03 seconds)\n", - "Cbc0010I After 16490000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1270.12 seconds)\n", - "Cbc0010I After 16491000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1270.19 seconds)\n", - "Cbc0010I After 16492000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1270.25 seconds)\n", - "Cbc0010I After 16493000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1270.32 seconds)\n", - "Cbc0010I After 16494000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1270.38 seconds)\n", - "Cbc0010I After 16495000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1270.46 seconds)\n", - "Cbc0010I After 16496000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1270.53 seconds)\n", - "Cbc0010I After 16497000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1270.61 seconds)\n", - "Cbc0010I After 16498000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1270.68 seconds)\n", - "Cbc0010I After 16499000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1270.76 seconds)\n", - "Cbc0010I After 16500000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1270.84 seconds)\n", - "Cbc0010I After 16501000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1270.91 seconds)\n", - "Cbc0010I After 16502000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1270.96 seconds)\n", - "Cbc0010I After 16503000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1271.01 seconds)\n", - "Cbc0010I After 16504000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1271.08 seconds)\n", - "Cbc0010I After 16505000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1271.15 seconds)\n", - "Cbc0010I After 16506000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1271.22 seconds)\n", - "Cbc0010I After 16507000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1271.28 seconds)\n", - "Cbc0010I After 16508000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1271.34 seconds)\n", - "Cbc0010I After 16509000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1271.40 seconds)\n", - "Cbc0010I After 16510000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1271.49 seconds)\n", - "Cbc0010I After 16511000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1271.56 seconds)\n", - "Cbc0010I After 16512000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1271.63 seconds)\n", - "Cbc0010I After 16513000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1271.70 seconds)\n", - "Cbc0010I After 16514000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1271.76 seconds)\n", - "Cbc0010I After 16515000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1271.81 seconds)\n", - "Cbc0010I After 16516000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1271.88 seconds)\n", - "Cbc0010I After 16517000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1271.94 seconds)\n", - "Cbc0010I After 16518000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1272.00 seconds)\n", - "Cbc0010I After 16519000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1272.06 seconds)\n", - "Cbc0010I After 16520000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1272.11 seconds)\n", - "Cbc0010I After 16521000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1272.17 seconds)\n", - "Cbc0010I After 16522000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1272.22 seconds)\n", - "Cbc0010I After 16523000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1272.28 seconds)\n", - "Cbc0010I After 16524000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1272.34 seconds)\n", - "Cbc0010I After 16525000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1272.40 seconds)\n", - "Cbc0010I After 16526000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1272.45 seconds)\n", - "Cbc0010I After 16527000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1272.50 seconds)\n", - "Cbc0010I After 16528000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1272.56 seconds)\n", - "Cbc0010I After 16529000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1272.61 seconds)\n", - "Cbc0010I After 16530000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1272.67 seconds)\n", - "Cbc0010I After 16531000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1272.73 seconds)\n", - "Cbc0010I After 16532000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1272.79 seconds)\n", - "Cbc0010I After 16533000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1272.84 seconds)\n", - "Cbc0010I After 16534000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1272.90 seconds)\n", - "Cbc0010I After 16535000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1272.96 seconds)\n", - "Cbc0010I After 16536000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1273.01 seconds)\n", - "Cbc0010I After 16537000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1273.07 seconds)\n", - "Cbc0010I After 16538000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.13 seconds)\n", - "Cbc0010I After 16539000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1273.19 seconds)\n", - "Cbc0010I After 16540000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1273.25 seconds)\n", - "Cbc0010I After 16541000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1273.30 seconds)\n", - "Cbc0010I After 16542000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1273.36 seconds)\n", - "Cbc0010I After 16543000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1273.41 seconds)\n", - "Cbc0010I After 16544000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1273.46 seconds)\n", - "Cbc0010I After 16545000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.52 seconds)\n", - "Cbc0010I After 16546000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1273.57 seconds)\n", - "Cbc0010I After 16547000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1273.62 seconds)\n", - "Cbc0010I After 16548000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1273.68 seconds)\n", - "Cbc0010I After 16549000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1273.73 seconds)\n", - "Cbc0010I After 16550000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1273.79 seconds)\n", - "Cbc0010I After 16551000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1273.84 seconds)\n", - "Cbc0010I After 16552000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1273.89 seconds)\n", - "Cbc0010I After 16553000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1273.94 seconds)\n", - "Cbc0010I After 16554000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1273.99 seconds)\n", - "Cbc0010I After 16555000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1274.04 seconds)\n", - "Cbc0010I After 16556000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1274.10 seconds)\n", - "Cbc0010I After 16557000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1274.15 seconds)\n", - "Cbc0010I After 16558000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1274.21 seconds)\n", - "Cbc0010I After 16559000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1274.27 seconds)\n", - "Cbc0010I After 16560000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1274.33 seconds)\n", - "Cbc0010I After 16561000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1274.38 seconds)\n", - "Cbc0010I After 16562000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1274.44 seconds)\n", - "Cbc0010I After 16563000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1274.51 seconds)\n", - "Cbc0010I After 16564000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1274.58 seconds)\n", - "Cbc0010I After 16565000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1274.65 seconds)\n", - "Cbc0010I After 16566000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1274.72 seconds)\n", - "Cbc0010I After 16567000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1274.79 seconds)\n", - "Cbc0010I After 16568000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1274.86 seconds)\n", - "Cbc0010I After 16569000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1274.94 seconds)\n", - "Cbc0010I After 16570000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1275.06 seconds)\n", - "Cbc0010I After 16571000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1275.13 seconds)\n", - "Cbc0010I After 16572000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1275.19 seconds)\n", - "Cbc0010I After 16573000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1275.25 seconds)\n", - "Cbc0010I After 16574000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1275.31 seconds)\n", - "Cbc0010I After 16575000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1275.36 seconds)\n", - "Cbc0010I After 16576000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1275.42 seconds)\n", - "Cbc0010I After 16577000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1275.48 seconds)\n", - "Cbc0010I After 16578000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1275.53 seconds)\n", - "Cbc0010I After 16579000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1275.59 seconds)\n", - "Cbc0010I After 16580000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1275.64 seconds)\n", - "Cbc0010I After 16581000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1275.70 seconds)\n", - "Cbc0010I After 16582000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1275.77 seconds)\n", - "Cbc0010I After 16583000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1275.83 seconds)\n", - "Cbc0010I After 16584000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1275.90 seconds)\n", - "Cbc0010I After 16585000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1275.97 seconds)\n", - "Cbc0010I After 16586000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1276.03 seconds)\n", - "Cbc0010I After 16587000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1276.09 seconds)\n", - "Cbc0010I After 16588000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1276.16 seconds)\n", - "Cbc0010I After 16589000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1276.22 seconds)\n", - "Cbc0010I After 16590000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1276.27 seconds)\n", - "Cbc0010I After 16591000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1276.32 seconds)\n", - "Cbc0010I After 16592000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1276.37 seconds)\n", - "Cbc0010I After 16593000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1276.42 seconds)\n", - "Cbc0010I After 16594000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1276.48 seconds)\n", - "Cbc0010I After 16595000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1276.54 seconds)\n", - "Cbc0010I After 16596000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1276.60 seconds)\n", - "Cbc0010I After 16597000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1276.66 seconds)\n", - "Cbc0010I After 16598000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1276.72 seconds)\n", - "Cbc0010I After 16599000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1276.77 seconds)\n", - "Cbc0010I After 16600000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1276.83 seconds)\n", - "Cbc0010I After 16601000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1276.90 seconds)\n", - "Cbc0010I After 16602000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1276.96 seconds)\n", - "Cbc0010I After 16603000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1277.02 seconds)\n", - "Cbc0010I After 16604000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1277.08 seconds)\n", - "Cbc0010I After 16605000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1277.15 seconds)\n", - "Cbc0010I After 16606000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1277.21 seconds)\n", - "Cbc0010I After 16607000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1277.28 seconds)\n", - "Cbc0010I After 16608000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1277.35 seconds)\n", - "Cbc0010I After 16609000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1277.41 seconds)\n", - "Cbc0010I After 16610000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1277.47 seconds)\n", - "Cbc0010I After 16611000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1277.52 seconds)\n", - "Cbc0010I After 16612000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1277.59 seconds)\n", - "Cbc0010I After 16613000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1277.66 seconds)\n", - "Cbc0010I After 16614000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1277.72 seconds)\n", - "Cbc0010I After 16615000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1277.79 seconds)\n", - "Cbc0010I After 16616000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1277.86 seconds)\n", - "Cbc0010I After 16617000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1277.92 seconds)\n", - "Cbc0010I After 16618000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1277.99 seconds)\n", - "Cbc0010I After 16619000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1278.05 seconds)\n", - "Cbc0010I After 16620000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1278.10 seconds)\n", - "Cbc0010I After 16621000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1278.16 seconds)\n", - "Cbc0010I After 16622000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1278.23 seconds)\n", - "Cbc0010I After 16623000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1278.30 seconds)\n", - "Cbc0010I After 16624000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1278.37 seconds)\n", - "Cbc0010I After 16625000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1278.43 seconds)\n", - "Cbc0010I After 16626000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1278.50 seconds)\n", - "Cbc0010I After 16627000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1278.56 seconds)\n", - "Cbc0010I After 16628000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1278.63 seconds)\n", - "Cbc0010I After 16629000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1278.70 seconds)\n", - "Cbc0010I After 16630000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1278.78 seconds)\n", - "Cbc0010I After 16631000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1278.84 seconds)\n", - "Cbc0010I After 16632000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1278.91 seconds)\n", - "Cbc0010I After 16633000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1278.96 seconds)\n", - "Cbc0010I After 16634000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1279.04 seconds)\n", - "Cbc0010I After 16635000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1279.11 seconds)\n", - "Cbc0010I After 16636000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1279.18 seconds)\n", - "Cbc0010I After 16637000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1279.24 seconds)\n", - "Cbc0010I After 16638000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1279.30 seconds)\n", - "Cbc0010I After 16639000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1279.34 seconds)\n", - "Cbc0010I After 16640000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1279.39 seconds)\n", - "Cbc0010I After 16641000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1279.43 seconds)\n", - "Cbc0010I After 16642000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1279.49 seconds)\n", - "Cbc0010I After 16643000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1279.58 seconds)\n", - "Cbc0010I After 16644000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1279.64 seconds)\n", - "Cbc0010I After 16645000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1279.72 seconds)\n", - "Cbc0010I After 16646000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1279.78 seconds)\n", - "Cbc0010I After 16647000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1279.84 seconds)\n", - "Cbc0010I After 16648000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1279.91 seconds)\n", - "Cbc0010I After 16649000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1279.98 seconds)\n", - "Cbc0010I After 16650000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1280.06 seconds)\n", - "Cbc0010I After 16651000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1280.13 seconds)\n", - "Cbc0010I After 16652000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1280.22 seconds)\n", - "Cbc0010I After 16653000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1280.34 seconds)\n", - "Cbc0010I After 16654000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1280.44 seconds)\n", - "Cbc0010I After 16655000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1280.53 seconds)\n", - "Cbc0010I After 16656000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1280.61 seconds)\n", - "Cbc0010I After 16657000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1280.68 seconds)\n", - "Cbc0010I After 16658000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1280.75 seconds)\n", - "Cbc0010I After 16659000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1280.82 seconds)\n", - "Cbc0010I After 16660000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1280.90 seconds)\n", - "Cbc0010I After 16661000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1280.97 seconds)\n", - "Cbc0010I After 16662000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1281.05 seconds)\n", - "Cbc0010I After 16663000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.11 seconds)\n", - "Cbc0010I After 16664000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1281.17 seconds)\n", - "Cbc0010I After 16665000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1281.23 seconds)\n", - "Cbc0010I After 16666000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1281.30 seconds)\n", - "Cbc0010I After 16667000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1281.37 seconds)\n", - "Cbc0010I After 16668000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.44 seconds)\n", - "Cbc0010I After 16669000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1281.51 seconds)\n", - "Cbc0010I After 16670000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1281.57 seconds)\n", - "Cbc0010I After 16671000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1281.64 seconds)\n", - "Cbc0010I After 16672000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1281.72 seconds)\n", - "Cbc0010I After 16673000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1281.79 seconds)\n", - "Cbc0010I After 16674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1281.86 seconds)\n", - "Cbc0010I After 16675000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1281.92 seconds)\n", - "Cbc0010I After 16676000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1281.99 seconds)\n", - "Cbc0010I After 16677000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1282.06 seconds)\n", - "Cbc0010I After 16678000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1282.14 seconds)\n", - "Cbc0010I After 16679000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.20 seconds)\n", - "Cbc0010I After 16680000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1282.27 seconds)\n", - "Cbc0010I After 16681000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1282.33 seconds)\n", - "Cbc0010I After 16682000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1282.39 seconds)\n", - "Cbc0010I After 16683000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1282.46 seconds)\n", - "Cbc0010I After 16684000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1282.54 seconds)\n", - "Cbc0010I After 16685000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1282.61 seconds)\n", - "Cbc0010I After 16686000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.69 seconds)\n", - "Cbc0010I After 16687000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1282.75 seconds)\n", - "Cbc0010I After 16688000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1282.81 seconds)\n", - "Cbc0010I After 16689000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1282.88 seconds)\n", - "Cbc0010I After 16690000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1282.95 seconds)\n", - "Cbc0010I After 16691000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1283.02 seconds)\n", - "Cbc0010I After 16692000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1283.07 seconds)\n", - "Cbc0010I After 16693000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1283.13 seconds)\n", - "Cbc0010I After 16694000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1283.21 seconds)\n", - "Cbc0010I After 16695000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1283.29 seconds)\n", - "Cbc0010I After 16696000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1283.36 seconds)\n", - "Cbc0010I After 16697000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1283.43 seconds)\n", - "Cbc0010I After 16698000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1283.49 seconds)\n", - "Cbc0010I After 16699000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1283.55 seconds)\n", - "Cbc0010I After 16700000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1283.63 seconds)\n", - "Cbc0010I After 16701000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1283.70 seconds)\n", - "Cbc0010I After 16702000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1283.76 seconds)\n", - "Cbc0010I After 16703000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1283.82 seconds)\n", - "Cbc0010I After 16704000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1283.88 seconds)\n", - "Cbc0010I After 16705000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1283.95 seconds)\n", - "Cbc0010I After 16706000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1284.01 seconds)\n", - "Cbc0010I After 16707000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1284.09 seconds)\n", - "Cbc0010I After 16708000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1284.15 seconds)\n", - "Cbc0010I After 16709000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1284.21 seconds)\n", - "Cbc0010I After 16710000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1284.26 seconds)\n", - "Cbc0010I After 16711000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1284.31 seconds)\n", - "Cbc0010I After 16712000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.34 seconds)\n", - "Cbc0010I After 16713000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1284.37 seconds)\n", - "Cbc0010I After 16714000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1284.45 seconds)\n", - "Cbc0010I After 16715000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1284.52 seconds)\n", - "Cbc0010I After 16716000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1284.58 seconds)\n", - "Cbc0010I After 16717000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1284.65 seconds)\n", - "Cbc0010I After 16718000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1284.72 seconds)\n", - "Cbc0010I After 16719000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1284.79 seconds)\n", - "Cbc0010I After 16720000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.85 seconds)\n", - "Cbc0010I After 16721000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1284.92 seconds)\n", - "Cbc0010I After 16722000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1284.99 seconds)\n", - "Cbc0010I After 16723000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1285.06 seconds)\n", - "Cbc0010I After 16724000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1285.13 seconds)\n", - "Cbc0010I After 16725000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1285.20 seconds)\n", - "Cbc0010I After 16726000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1285.27 seconds)\n", - "Cbc0010I After 16727000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1285.35 seconds)\n", - "Cbc0010I After 16728000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1285.43 seconds)\n", - "Cbc0010I After 16729000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1285.50 seconds)\n", - "Cbc0010I After 16730000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1285.57 seconds)\n", - "Cbc0010I After 16731000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1285.63 seconds)\n", - "Cbc0010I After 16732000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1285.69 seconds)\n", - "Cbc0010I After 16733000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1285.75 seconds)\n", - "Cbc0010I After 16734000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1285.82 seconds)\n", - "Cbc0010I After 16735000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1285.89 seconds)\n", - "Cbc0010I After 16736000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1285.96 seconds)\n", - "Cbc0010I After 16737000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1286.03 seconds)\n", - "Cbc0010I After 16738000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1286.08 seconds)\n", - "Cbc0010I After 16739000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1286.12 seconds)\n", - "Cbc0010I After 16740000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1286.17 seconds)\n", - "Cbc0010I After 16741000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1286.20 seconds)\n", - "Cbc0010I After 16742000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1286.26 seconds)\n", - "Cbc0010I After 16743000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1286.30 seconds)\n", - "Cbc0010I After 16744000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1286.36 seconds)\n", - "Cbc0010I After 16745000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1286.40 seconds)\n", - "Cbc0010I After 16746000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1286.45 seconds)\n", - "Cbc0010I After 16747000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1286.52 seconds)\n", - "Cbc0010I After 16748000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1286.60 seconds)\n", - "Cbc0010I After 16749000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1286.68 seconds)\n", - "Cbc0010I After 16750000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1286.74 seconds)\n", - "Cbc0010I After 16751000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1286.82 seconds)\n", - "Cbc0010I After 16752000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1286.87 seconds)\n", - "Cbc0010I After 16753000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1286.92 seconds)\n", - "Cbc0010I After 16754000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1286.98 seconds)\n", - "Cbc0010I After 16755000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1287.03 seconds)\n", - "Cbc0010I After 16756000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.06 seconds)\n", - "Cbc0010I After 16757000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1287.09 seconds)\n", - "Cbc0010I After 16758000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.13 seconds)\n", - "Cbc0010I After 16759000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1287.21 seconds)\n", - "Cbc0010I After 16760000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1287.27 seconds)\n", - "Cbc0010I After 16761000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1287.34 seconds)\n", - "Cbc0010I After 16762000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1287.39 seconds)\n", - "Cbc0010I After 16763000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1287.45 seconds)\n", - "Cbc0010I After 16764000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1287.51 seconds)\n", - "Cbc0010I After 16765000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1287.56 seconds)\n", - "Cbc0010I After 16766000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1287.62 seconds)\n", - "Cbc0010I After 16767000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1287.68 seconds)\n", - "Cbc0010I After 16768000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1287.74 seconds)\n", - "Cbc0010I After 16769000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1287.79 seconds)\n", - "Cbc0010I After 16770000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1287.85 seconds)\n", - "Cbc0010I After 16771000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1287.91 seconds)\n", - "Cbc0010I After 16772000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1287.98 seconds)\n", - "Cbc0010I After 16773000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.06 seconds)\n", - "Cbc0010I After 16774000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1288.13 seconds)\n", - "Cbc0010I After 16775000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1288.21 seconds)\n", - "Cbc0010I After 16776000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1288.28 seconds)\n", - "Cbc0010I After 16777000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.36 seconds)\n", - "Cbc0010I After 16778000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1288.45 seconds)\n", - "Cbc0010I After 16779000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1288.52 seconds)\n", - "Cbc0010I After 16780000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1288.60 seconds)\n", - "Cbc0010I After 16781000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1288.68 seconds)\n", - "Cbc0010I After 16782000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1288.76 seconds)\n", - "Cbc0010I After 16783000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1288.84 seconds)\n", - "Cbc0010I After 16784000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1288.91 seconds)\n", - "Cbc0010I After 16785000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1288.99 seconds)\n", - "Cbc0010I After 16786000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1289.06 seconds)\n", - "Cbc0010I After 16787000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1289.10 seconds)\n", - "Cbc0010I After 16788000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1289.17 seconds)\n", - "Cbc0010I After 16789000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1289.22 seconds)\n", - "Cbc0010I After 16790000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1289.30 seconds)\n", - "Cbc0010I After 16791000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1289.38 seconds)\n", - "Cbc0010I After 16792000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1289.41 seconds)\n", - "Cbc0010I After 16793000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1289.46 seconds)\n", - "Cbc0010I After 16794000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1289.53 seconds)\n", - "Cbc0010I After 16795000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1289.60 seconds)\n", - "Cbc0010I After 16796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1289.67 seconds)\n", - "Cbc0010I After 16797000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1289.73 seconds)\n", - "Cbc0010I After 16798000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1289.81 seconds)\n", - "Cbc0010I After 16799000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1289.86 seconds)\n", - "Cbc0010I After 16800000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1289.91 seconds)\n", - "Cbc0010I After 16801000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1289.96 seconds)\n", - "Cbc0010I After 16802000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1290.03 seconds)\n", - "Cbc0010I After 16803000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1290.09 seconds)\n", - "Cbc0010I After 16804000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1290.12 seconds)\n", - "Cbc0010I After 16805000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1290.19 seconds)\n", - "Cbc0010I After 16806000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1290.26 seconds)\n", - "Cbc0010I After 16807000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1290.33 seconds)\n", - "Cbc0010I After 16808000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1290.41 seconds)\n", - "Cbc0010I After 16809000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1290.48 seconds)\n", - "Cbc0010I After 16810000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1290.54 seconds)\n", - "Cbc0010I After 16811000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1290.60 seconds)\n", - "Cbc0010I After 16812000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1290.64 seconds)\n", - "Cbc0010I After 16813000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1290.69 seconds)\n", - "Cbc0010I After 16814000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1290.76 seconds)\n", - "Cbc0010I After 16815000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1290.80 seconds)\n", - "Cbc0010I After 16816000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1290.83 seconds)\n", - "Cbc0010I After 16817000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1290.86 seconds)\n", - "Cbc0010I After 16818000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1290.94 seconds)\n", - "Cbc0010I After 16819000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1291.01 seconds)\n", - "Cbc0010I After 16820000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1291.15 seconds)\n", - "Cbc0010I After 16821000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1291.23 seconds)\n", - "Cbc0010I After 16822000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1291.31 seconds)\n", - "Cbc0010I After 16823000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1291.40 seconds)\n", - "Cbc0010I After 16824000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1291.48 seconds)\n", - "Cbc0010I After 16825000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1291.55 seconds)\n", - "Cbc0010I After 16826000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1291.63 seconds)\n", - "Cbc0010I After 16827000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1291.70 seconds)\n", - "Cbc0010I After 16828000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1291.78 seconds)\n", - "Cbc0010I After 16829000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1291.86 seconds)\n", - "Cbc0010I After 16830000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1291.93 seconds)\n", - "Cbc0010I After 16831000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1292.01 seconds)\n", - "Cbc0010I After 16832000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1292.08 seconds)\n", - "Cbc0010I After 16833000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1292.16 seconds)\n", - "Cbc0010I After 16834000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1292.24 seconds)\n", - "Cbc0010I After 16835000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1292.31 seconds)\n", - "Cbc0010I After 16836000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1292.39 seconds)\n", - "Cbc0010I After 16837000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1292.47 seconds)\n", - "Cbc0010I After 16838000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1292.55 seconds)\n", - "Cbc0010I After 16839000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1292.62 seconds)\n", - "Cbc0010I After 16840000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1292.71 seconds)\n", - "Cbc0010I After 16841000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1292.77 seconds)\n", - "Cbc0010I After 16842000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1292.80 seconds)\n", - "Cbc0010I After 16843000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1292.83 seconds)\n", - "Cbc0010I After 16844000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1292.89 seconds)\n", - "Cbc0010I After 16845000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1292.94 seconds)\n", - "Cbc0010I After 16846000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1292.98 seconds)\n", - "Cbc0010I After 16847000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1293.01 seconds)\n", - "Cbc0010I After 16848000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1293.03 seconds)\n", - "Cbc0010I After 16849000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1293.07 seconds)\n", - "Cbc0010I After 16850000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1293.11 seconds)\n", - "Cbc0010I After 16851000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1293.16 seconds)\n", - "Cbc0010I After 16852000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1293.20 seconds)\n", - "Cbc0010I After 16853000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1293.23 seconds)\n", - "Cbc0010I After 16854000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1293.26 seconds)\n", - "Cbc0010I After 16855000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1293.32 seconds)\n", - "Cbc0010I After 16856000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1293.39 seconds)\n", - "Cbc0010I After 16857000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1293.42 seconds)\n", - "Cbc0010I After 16858000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1293.45 seconds)\n", - "Cbc0010I After 16859000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1293.48 seconds)\n", - "Cbc0010I After 16860000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1293.53 seconds)\n", - "Cbc0010I After 16861000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1293.58 seconds)\n", - "Cbc0010I After 16862000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1293.64 seconds)\n", - "Cbc0010I After 16863000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1293.69 seconds)\n", - "Cbc0010I After 16864000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1293.80 seconds)\n", - "Cbc0010I After 16865000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1293.84 seconds)\n", - "Cbc0010I After 16866000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1293.92 seconds)\n", - "Cbc0010I After 16867000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1294.01 seconds)\n", - "Cbc0010I After 16868000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1294.07 seconds)\n", - "Cbc0010I After 16869000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1294.10 seconds)\n", - "Cbc0010I After 16870000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1294.12 seconds)\n", - "Cbc0010I After 16871000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1294.18 seconds)\n", - "Cbc0010I After 16872000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1294.24 seconds)\n", - "Cbc0010I After 16873000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1294.30 seconds)\n", - "Cbc0010I After 16874000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1294.37 seconds)\n", - "Cbc0010I After 16875000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1294.43 seconds)\n", - "Cbc0010I After 16876000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1294.50 seconds)\n", - "Cbc0010I After 16877000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1294.57 seconds)\n", - "Cbc0010I After 16878000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1294.64 seconds)\n", - "Cbc0010I After 16879000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1294.70 seconds)\n", - "Cbc0010I After 16880000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1294.77 seconds)\n", - "Cbc0010I After 16881000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1294.84 seconds)\n", - "Cbc0010I After 16882000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1294.89 seconds)\n", - "Cbc0010I After 16883000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1294.93 seconds)\n", - "Cbc0010I After 16884000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1294.98 seconds)\n", - "Cbc0010I After 16885000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1295.05 seconds)\n", - "Cbc0010I After 16886000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1295.12 seconds)\n", - "Cbc0010I After 16887000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1295.20 seconds)\n", - "Cbc0010I After 16888000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1295.28 seconds)\n", - "Cbc0010I After 16889000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1295.35 seconds)\n", - "Cbc0010I After 16890000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1295.42 seconds)\n", - "Cbc0010I After 16891000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1295.49 seconds)\n", - "Cbc0010I After 16892000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1295.55 seconds)\n", - "Cbc0010I After 16893000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1295.60 seconds)\n", - "Cbc0010I After 16894000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1295.68 seconds)\n", - "Cbc0010I After 16895000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1295.76 seconds)\n", - "Cbc0010I After 16896000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1295.81 seconds)\n", - "Cbc0010I After 16897000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1295.85 seconds)\n", - "Cbc0010I After 16898000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1295.92 seconds)\n", - "Cbc0010I After 16899000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1296.00 seconds)\n", - "Cbc0010I After 16900000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1296.07 seconds)\n", - "Cbc0010I After 16901000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1296.15 seconds)\n", - "Cbc0010I After 16902000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1296.23 seconds)\n", - "Cbc0010I After 16903000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1296.32 seconds)\n", - "Cbc0010I After 16904000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1296.40 seconds)\n", - "Cbc0010I After 16905000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.48 seconds)\n", - "Cbc0010I After 16906000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.56 seconds)\n", - "Cbc0010I After 16907000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1296.64 seconds)\n", - "Cbc0010I After 16908000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1296.72 seconds)\n", - "Cbc0010I After 16909000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1296.80 seconds)\n", - "Cbc0010I After 16910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1296.87 seconds)\n", - "Cbc0010I After 16911000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1296.95 seconds)\n", - "Cbc0010I After 16912000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1297.03 seconds)\n", - "Cbc0010I After 16913000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1297.11 seconds)\n", - "Cbc0010I After 16914000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1297.19 seconds)\n", - "Cbc0010I After 16915000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1297.27 seconds)\n", - "Cbc0010I After 16916000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1297.34 seconds)\n", - "Cbc0010I After 16917000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1297.42 seconds)\n", - "Cbc0010I After 16918000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1297.48 seconds)\n", - "Cbc0010I After 16919000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1297.55 seconds)\n", - "Cbc0010I After 16920000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1297.63 seconds)\n", - "Cbc0010I After 16921000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1297.69 seconds)\n", - "Cbc0010I After 16922000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1297.74 seconds)\n", - "Cbc0010I After 16923000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1297.76 seconds)\n", - "Cbc0010I After 16924000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1297.79 seconds)\n", - "Cbc0010I After 16925000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1297.82 seconds)\n", - "Cbc0010I After 16926000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1297.89 seconds)\n", - "Cbc0010I After 16927000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1297.96 seconds)\n", - "Cbc0010I After 16928000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1298.04 seconds)\n", - "Cbc0010I After 16929000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1298.11 seconds)\n", - "Cbc0010I After 16930000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1298.17 seconds)\n", - "Cbc0010I After 16931000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1298.25 seconds)\n", - "Cbc0010I After 16932000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1298.32 seconds)\n", - "Cbc0010I After 16933000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1298.39 seconds)\n", - "Cbc0010I After 16934000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1298.47 seconds)\n", - "Cbc0010I After 16935000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1298.54 seconds)\n", - "Cbc0010I After 16936000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1298.62 seconds)\n", - "Cbc0010I After 16937000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.69 seconds)\n", - "Cbc0010I After 16938000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.77 seconds)\n", - "Cbc0010I After 16939000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1298.84 seconds)\n", - "Cbc0010I After 16940000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1298.92 seconds)\n", - "Cbc0010I After 16941000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1298.99 seconds)\n", - "Cbc0010I After 16942000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1299.06 seconds)\n", - "Cbc0010I After 16943000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1299.14 seconds)\n", - "Cbc0010I After 16944000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1299.21 seconds)\n", - "Cbc0010I After 16945000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1299.29 seconds)\n", - "Cbc0010I After 16946000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1299.37 seconds)\n", - "Cbc0010I After 16947000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1299.46 seconds)\n", - "Cbc0010I After 16948000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1299.54 seconds)\n", - "Cbc0010I After 16949000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1299.61 seconds)\n", - "Cbc0010I After 16950000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1299.71 seconds)\n", - "Cbc0010I After 16951000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1299.78 seconds)\n", - "Cbc0010I After 16952000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1299.86 seconds)\n", - "Cbc0010I After 16953000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1299.93 seconds)\n", - "Cbc0010I After 16954000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1300.01 seconds)\n", - "Cbc0010I After 16955000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1300.09 seconds)\n", - "Cbc0010I After 16956000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1300.17 seconds)\n", - "Cbc0010I After 16957000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.24 seconds)\n", - "Cbc0010I After 16958000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1300.32 seconds)\n", - "Cbc0010I After 16959000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1300.39 seconds)\n", - "Cbc0010I After 16960000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1300.47 seconds)\n", - "Cbc0010I After 16961000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1300.55 seconds)\n", - "Cbc0010I After 16962000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1300.61 seconds)\n", - "Cbc0010I After 16963000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1300.64 seconds)\n", - "Cbc0010I After 16964000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1300.70 seconds)\n", - "Cbc0010I After 16965000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.77 seconds)\n", - "Cbc0010I After 16966000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1300.83 seconds)\n", - "Cbc0010I After 16967000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1300.90 seconds)\n", - "Cbc0010I After 16968000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1300.95 seconds)\n", - "Cbc0010I After 16969000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1301.02 seconds)\n", - "Cbc0010I After 16970000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1301.10 seconds)\n", - "Cbc0010I After 16971000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1301.15 seconds)\n", - "Cbc0010I After 16972000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1301.19 seconds)\n", - "Cbc0010I After 16973000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1301.23 seconds)\n", - "Cbc0010I After 16974000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1301.28 seconds)\n", - "Cbc0010I After 16975000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1301.33 seconds)\n", - "Cbc0010I After 16976000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1301.39 seconds)\n", - "Cbc0010I After 16977000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1301.42 seconds)\n", - "Cbc0010I After 16978000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1301.45 seconds)\n", - "Cbc0010I After 16979000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1301.50 seconds)\n", - "Cbc0010I After 16980000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1301.56 seconds)\n", - "Cbc0010I After 16981000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1301.62 seconds)\n", - "Cbc0010I After 16982000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1301.67 seconds)\n", - "Cbc0010I After 16983000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1301.72 seconds)\n", - "Cbc0010I After 16984000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1301.80 seconds)\n", - "Cbc0010I After 16985000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1301.85 seconds)\n", - "Cbc0010I After 16986000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1301.91 seconds)\n", - "Cbc0010I After 16987000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1301.96 seconds)\n", - "Cbc0010I After 16988000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1302.01 seconds)\n", - "Cbc0010I After 16989000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1302.08 seconds)\n", - "Cbc0010I After 16990000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1302.11 seconds)\n", - "Cbc0010I After 16991000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1302.14 seconds)\n", - "Cbc0010I After 16992000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1302.18 seconds)\n", - "Cbc0010I After 16993000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1302.21 seconds)\n", - "Cbc0010I After 16994000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1302.27 seconds)\n", - "Cbc0010I After 16995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1302.33 seconds)\n", - "Cbc0010I After 16996000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1302.40 seconds)\n", - "Cbc0010I After 16997000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1302.48 seconds)\n", - "Cbc0010I After 16998000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1302.54 seconds)\n", - "Cbc0010I After 16999000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1302.60 seconds)\n", - "Cbc0010I After 17000000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1302.66 seconds)\n", - "Cbc0010I After 17001000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1302.73 seconds)\n", - "Cbc0010I After 17002000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1302.81 seconds)\n", - "Cbc0010I After 17003000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1302.90 seconds)\n", - "Cbc0010I After 17004000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1302.97 seconds)\n", - "Cbc0010I After 17005000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1303.03 seconds)\n", - "Cbc0010I After 17006000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1303.10 seconds)\n", - "Cbc0010I After 17007000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1303.16 seconds)\n", - "Cbc0010I After 17008000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1303.22 seconds)\n", - "Cbc0010I After 17009000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1303.29 seconds)\n", - "Cbc0010I After 17010000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1303.36 seconds)\n", - "Cbc0010I After 17011000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1303.42 seconds)\n", - "Cbc0010I After 17012000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1303.48 seconds)\n", - "Cbc0010I After 17013000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1303.56 seconds)\n", - "Cbc0010I After 17014000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1303.62 seconds)\n", - "Cbc0010I After 17015000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1303.68 seconds)\n", - "Cbc0010I After 17016000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1303.75 seconds)\n", - "Cbc0010I After 17017000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1303.81 seconds)\n", - "Cbc0010I After 17018000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1303.90 seconds)\n", - "Cbc0010I After 17019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1303.98 seconds)\n", - "Cbc0010I After 17020000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1304.05 seconds)\n", - "Cbc0010I After 17021000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1304.11 seconds)\n", - "Cbc0010I After 17022000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1304.18 seconds)\n", - "Cbc0010I After 17023000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1304.25 seconds)\n", - "Cbc0010I After 17024000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1304.31 seconds)\n", - "Cbc0010I After 17025000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1304.38 seconds)\n", - "Cbc0010I After 17026000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1304.46 seconds)\n", - "Cbc0010I After 17027000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1304.52 seconds)\n", - "Cbc0010I After 17028000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1304.59 seconds)\n", - "Cbc0010I After 17029000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1304.65 seconds)\n", - "Cbc0010I After 17030000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1304.71 seconds)\n", - "Cbc0010I After 17031000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1304.77 seconds)\n", - "Cbc0010I After 17032000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1304.84 seconds)\n", - "Cbc0010I After 17033000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1304.92 seconds)\n", - "Cbc0010I After 17034000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.00 seconds)\n", - "Cbc0010I After 17035000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1305.08 seconds)\n", - "Cbc0010I After 17036000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1305.16 seconds)\n", - "Cbc0010I After 17037000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.25 seconds)\n", - "Cbc0010I After 17038000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1305.33 seconds)\n", - "Cbc0010I After 17039000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1305.41 seconds)\n", - "Cbc0010I After 17040000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1305.49 seconds)\n", - "Cbc0010I After 17041000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1305.55 seconds)\n", - "Cbc0010I After 17042000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1305.61 seconds)\n", - "Cbc0010I After 17043000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1305.69 seconds)\n", - "Cbc0010I After 17044000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1305.76 seconds)\n", - "Cbc0010I After 17045000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1305.84 seconds)\n", - "Cbc0010I After 17046000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1305.91 seconds)\n", - "Cbc0010I After 17047000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1305.98 seconds)\n", - "Cbc0010I After 17048000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1306.03 seconds)\n", - "Cbc0010I After 17049000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1306.07 seconds)\n", - "Cbc0010I After 17050000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1306.13 seconds)\n", - "Cbc0010I After 17051000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1306.21 seconds)\n", - "Cbc0010I After 17052000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1306.28 seconds)\n", - "Cbc0010I After 17053000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1306.35 seconds)\n", - "Cbc0010I After 17054000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1306.42 seconds)\n", - "Cbc0010I After 17055000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1306.48 seconds)\n", - "Cbc0010I After 17056000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1306.56 seconds)\n", - "Cbc0010I After 17057000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1306.64 seconds)\n", - "Cbc0010I After 17058000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1306.72 seconds)\n", - "Cbc0010I After 17059000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1306.79 seconds)\n", - "Cbc0010I After 17060000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1306.86 seconds)\n", - "Cbc0010I After 17061000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1306.93 seconds)\n", - "Cbc0010I After 17062000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1307.00 seconds)\n", - "Cbc0010I After 17063000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1307.07 seconds)\n", - "Cbc0010I After 17064000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1307.15 seconds)\n", - "Cbc0010I After 17065000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1307.23 seconds)\n", - "Cbc0010I After 17066000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1307.31 seconds)\n", - "Cbc0010I After 17067000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1307.40 seconds)\n", - "Cbc0010I After 17068000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1307.49 seconds)\n", - "Cbc0010I After 17069000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1307.57 seconds)\n", - "Cbc0010I After 17070000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1307.68 seconds)\n", - "Cbc0010I After 17071000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1307.80 seconds)\n", - "Cbc0010I After 17072000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1307.89 seconds)\n", - "Cbc0010I After 17073000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1307.97 seconds)\n", - "Cbc0010I After 17074000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1308.05 seconds)\n", - "Cbc0010I After 17075000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.13 seconds)\n", - "Cbc0010I After 17076000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.21 seconds)\n", - "Cbc0010I After 17077000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1308.28 seconds)\n", - "Cbc0010I After 17078000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1308.31 seconds)\n", - "Cbc0010I After 17079000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1308.37 seconds)\n", - "Cbc0010I After 17080000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1308.43 seconds)\n", - "Cbc0010I After 17081000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1308.49 seconds)\n", - "Cbc0010I After 17082000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1308.54 seconds)\n", - "Cbc0010I After 17083000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1308.58 seconds)\n", - "Cbc0010I After 17084000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1308.64 seconds)\n", - "Cbc0010I After 17085000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1308.70 seconds)\n", - "Cbc0010I After 17086000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1308.74 seconds)\n", - "Cbc0010I After 17087000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1308.79 seconds)\n", - "Cbc0010I After 17088000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1308.85 seconds)\n", - "Cbc0010I After 17089000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1308.91 seconds)\n", - "Cbc0010I After 17090000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1308.97 seconds)\n", - "Cbc0010I After 17091000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1309.05 seconds)\n", - "Cbc0010I After 17092000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1309.12 seconds)\n", - "Cbc0010I After 17093000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1309.18 seconds)\n", - "Cbc0010I After 17094000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.22 seconds)\n", - "Cbc0010I After 17095000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.30 seconds)\n", - "Cbc0010I After 17096000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1309.35 seconds)\n", - "Cbc0010I After 17097000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.44 seconds)\n", - "Cbc0010I After 17098000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1309.56 seconds)\n", - "Cbc0010I After 17099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1309.70 seconds)\n", - "Cbc0010I After 17100000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1309.87 seconds)\n", - "Cbc0010I After 17101000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1310.05 seconds)\n", - "Cbc0010I After 17102000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1310.20 seconds)\n", - "Cbc0010I After 17103000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1310.33 seconds)\n", - "Cbc0010I After 17104000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1310.44 seconds)\n", - "Cbc0010I After 17105000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1310.54 seconds)\n", - "Cbc0010I After 17106000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1310.62 seconds)\n", - "Cbc0010I After 17107000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1310.69 seconds)\n", - "Cbc0010I After 17108000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1310.76 seconds)\n", - "Cbc0010I After 17109000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1310.80 seconds)\n", - "Cbc0010I After 17110000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1310.84 seconds)\n", - "Cbc0010I After 17111000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1310.89 seconds)\n", - "Cbc0010I After 17112000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1310.92 seconds)\n", - "Cbc0010I After 17113000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1310.96 seconds)\n", - "Cbc0010I After 17114000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1311.01 seconds)\n", - "Cbc0010I After 17115000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1311.06 seconds)\n", - "Cbc0010I After 17116000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1311.12 seconds)\n", - "Cbc0010I After 17117000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1311.18 seconds)\n", - "Cbc0010I After 17118000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1311.22 seconds)\n", - "Cbc0010I After 17119000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1311.25 seconds)\n", - "Cbc0010I After 17120000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1311.29 seconds)\n", - "Cbc0010I After 17121000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1311.35 seconds)\n", - "Cbc0010I After 17122000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1311.40 seconds)\n", - "Cbc0010I After 17123000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1311.46 seconds)\n", - "Cbc0010I After 17124000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1311.51 seconds)\n", - "Cbc0010I After 17125000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1311.56 seconds)\n", - "Cbc0010I After 17126000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1311.61 seconds)\n", - "Cbc0010I After 17127000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1311.64 seconds)\n", - "Cbc0010I After 17128000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1311.69 seconds)\n", - "Cbc0010I After 17129000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1311.77 seconds)\n", - "Cbc0010I After 17130000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1311.85 seconds)\n", - "Cbc0010I After 17131000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1311.92 seconds)\n", - "Cbc0010I After 17132000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1311.99 seconds)\n", - "Cbc0010I After 17133000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1312.06 seconds)\n", - "Cbc0010I After 17134000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1312.13 seconds)\n", - "Cbc0010I After 17135000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1312.21 seconds)\n", - "Cbc0010I After 17136000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1312.28 seconds)\n", - "Cbc0010I After 17137000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1312.35 seconds)\n", - "Cbc0010I After 17138000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1312.43 seconds)\n", - "Cbc0010I After 17139000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1312.50 seconds)\n", - "Cbc0010I After 17140000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1312.56 seconds)\n", - "Cbc0010I After 17141000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1312.62 seconds)\n", - "Cbc0010I After 17142000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1312.67 seconds)\n", - "Cbc0010I After 17143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1312.74 seconds)\n", - "Cbc0010I After 17144000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1312.82 seconds)\n", - "Cbc0010I After 17145000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1312.89 seconds)\n", - "Cbc0010I After 17146000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1312.95 seconds)\n", - "Cbc0010I After 17147000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.02 seconds)\n", - "Cbc0010I After 17148000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1313.09 seconds)\n", - "Cbc0010I After 17149000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.16 seconds)\n", - "Cbc0010I After 17150000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1313.25 seconds)\n", - "Cbc0010I After 17151000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1313.32 seconds)\n", - "Cbc0010I After 17152000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1313.40 seconds)\n", - "Cbc0010I After 17153000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1313.45 seconds)\n", - "Cbc0010I After 17154000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1313.53 seconds)\n", - "Cbc0010I After 17155000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1313.60 seconds)\n", - "Cbc0010I After 17156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1313.68 seconds)\n", - "Cbc0010I After 17157000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1313.76 seconds)\n", - "Cbc0010I After 17158000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1313.84 seconds)\n", - "Cbc0010I After 17159000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1313.91 seconds)\n", - "Cbc0010I After 17160000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1313.99 seconds)\n", - "Cbc0010I After 17161000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1314.06 seconds)\n", - "Cbc0010I After 17162000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1314.14 seconds)\n", - "Cbc0010I After 17163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1314.22 seconds)\n", - "Cbc0010I After 17164000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1314.29 seconds)\n", - "Cbc0010I After 17165000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1314.38 seconds)\n", - "Cbc0010I After 17166000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1314.47 seconds)\n", - "Cbc0010I After 17167000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1314.55 seconds)\n", - "Cbc0010I After 17168000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1314.62 seconds)\n", - "Cbc0010I After 17169000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1314.70 seconds)\n", - "Cbc0010I After 17170000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1314.78 seconds)\n", - "Cbc0010I After 17171000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1314.86 seconds)\n", - "Cbc0010I After 17172000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1314.94 seconds)\n", - "Cbc0010I After 17173000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1315.02 seconds)\n", - "Cbc0010I After 17174000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1315.07 seconds)\n", - "Cbc0010I After 17175000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1315.11 seconds)\n", - "Cbc0010I After 17176000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1315.17 seconds)\n", - "Cbc0010I After 17177000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1315.23 seconds)\n", - "Cbc0010I After 17178000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1315.29 seconds)\n", - "Cbc0010I After 17179000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1315.33 seconds)\n", - "Cbc0010I After 17180000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1315.41 seconds)\n", - "Cbc0010I After 17181000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1315.49 seconds)\n", - "Cbc0010I After 17182000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1315.56 seconds)\n", - "Cbc0010I After 17183000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1315.64 seconds)\n", - "Cbc0010I After 17184000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1315.72 seconds)\n", - "Cbc0010I After 17185000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1315.80 seconds)\n", - "Cbc0010I After 17186000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1315.88 seconds)\n", - "Cbc0010I After 17187000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1315.96 seconds)\n", - "Cbc0010I After 17188000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1316.03 seconds)\n", - "Cbc0010I After 17189000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1316.11 seconds)\n", - "Cbc0010I After 17190000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1316.18 seconds)\n", - "Cbc0010I After 17191000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1316.25 seconds)\n", - "Cbc0010I After 17192000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1316.32 seconds)\n", - "Cbc0010I After 17193000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1316.39 seconds)\n", - "Cbc0010I After 17194000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1316.47 seconds)\n", - "Cbc0010I After 17195000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1316.55 seconds)\n", - "Cbc0010I After 17196000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1316.63 seconds)\n", - "Cbc0010I After 17197000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1316.71 seconds)\n", - "Cbc0010I After 17198000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1316.79 seconds)\n", - "Cbc0010I After 17199000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1316.87 seconds)\n", - "Cbc0010I After 17200000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1316.95 seconds)\n", - "Cbc0010I After 17201000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.01 seconds)\n", - "Cbc0010I After 17202000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1317.04 seconds)\n", - "Cbc0010I After 17203000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1317.07 seconds)\n", - "Cbc0010I After 17204000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1317.11 seconds)\n", - "Cbc0010I After 17205000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.16 seconds)\n", - "Cbc0010I After 17206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1317.19 seconds)\n", - "Cbc0010I After 17207000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.23 seconds)\n", - "Cbc0010I After 17208000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1317.29 seconds)\n", - "Cbc0010I After 17209000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1317.32 seconds)\n", - "Cbc0010I After 17210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1317.36 seconds)\n", - "Cbc0010I After 17211000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1317.41 seconds)\n", - "Cbc0010I After 17212000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1317.45 seconds)\n", - "Cbc0010I After 17213000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1317.48 seconds)\n", - "Cbc0010I After 17214000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1317.51 seconds)\n", - "Cbc0010I After 17215000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1317.54 seconds)\n", - "Cbc0010I After 17216000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1317.58 seconds)\n", - "Cbc0010I After 17217000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1317.63 seconds)\n", - "Cbc0010I After 17218000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.68 seconds)\n", - "Cbc0010I After 17219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1317.73 seconds)\n", - "Cbc0010I After 17220000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1317.77 seconds)\n", - "Cbc0010I After 17221000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1317.82 seconds)\n", - "Cbc0010I After 17222000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1317.86 seconds)\n", - "Cbc0010I After 17223000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1317.92 seconds)\n", - "Cbc0010I After 17224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1317.98 seconds)\n", - "Cbc0010I After 17225000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.04 seconds)\n", - "Cbc0010I After 17226000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1318.11 seconds)\n", - "Cbc0010I After 17227000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1318.19 seconds)\n", - "Cbc0010I After 17228000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.23 seconds)\n", - "Cbc0010I After 17229000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1318.28 seconds)\n", - "Cbc0010I After 17230000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1318.32 seconds)\n", - "Cbc0010I After 17231000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1318.37 seconds)\n", - "Cbc0010I After 17232000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1318.44 seconds)\n", - "Cbc0010I After 17233000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1318.48 seconds)\n", - "Cbc0010I After 17234000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1318.55 seconds)\n", - "Cbc0010I After 17235000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1318.60 seconds)\n", - "Cbc0010I After 17236000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1318.65 seconds)\n", - "Cbc0010I After 17237000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1318.70 seconds)\n", - "Cbc0010I After 17238000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1318.77 seconds)\n", - "Cbc0010I After 17239000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1318.85 seconds)\n", - "Cbc0010I After 17240000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1318.93 seconds)\n", - "Cbc0010I After 17241000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1319.01 seconds)\n", - "Cbc0010I After 17242000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1319.08 seconds)\n", - "Cbc0010I After 17243000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1319.15 seconds)\n", - "Cbc0010I After 17244000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1319.22 seconds)\n", - "Cbc0010I After 17245000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1319.30 seconds)\n", - "Cbc0010I After 17246000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1319.37 seconds)\n", - "Cbc0010I After 17247000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1319.45 seconds)\n", - "Cbc0010I After 17248000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1319.53 seconds)\n", - "Cbc0010I After 17249000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1319.62 seconds)\n", - "Cbc0010I After 17250000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1319.70 seconds)\n", - "Cbc0010I After 17251000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1319.78 seconds)\n", - "Cbc0010I After 17252000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1319.85 seconds)\n", - "Cbc0010I After 17253000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1319.91 seconds)\n", - "Cbc0010I After 17254000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1319.99 seconds)\n", - "Cbc0010I After 17255000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1320.05 seconds)\n", - "Cbc0010I After 17256000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1320.12 seconds)\n", - "Cbc0010I After 17257000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1320.19 seconds)\n", - "Cbc0010I After 17258000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1320.27 seconds)\n", - "Cbc0010I After 17259000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1320.33 seconds)\n", - "Cbc0010I After 17260000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1320.41 seconds)\n", - "Cbc0010I After 17261000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1320.49 seconds)\n", - "Cbc0010I After 17262000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1320.56 seconds)\n", - "Cbc0010I After 17263000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1320.64 seconds)\n", - "Cbc0010I After 17264000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1320.71 seconds)\n", - "Cbc0010I After 17265000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1320.79 seconds)\n", - "Cbc0010I After 17266000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1320.87 seconds)\n", - "Cbc0010I After 17267000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1320.96 seconds)\n", - "Cbc0010I After 17268000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1321.04 seconds)\n", - "Cbc0010I After 17269000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1321.12 seconds)\n", - "Cbc0010I After 17270000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1321.20 seconds)\n", - "Cbc0010I After 17271000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1321.27 seconds)\n", - "Cbc0010I After 17272000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1321.35 seconds)\n", - "Cbc0010I After 17273000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1321.42 seconds)\n", - "Cbc0010I After 17274000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1321.49 seconds)\n", - "Cbc0010I After 17275000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1321.57 seconds)\n", - "Cbc0010I After 17276000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1321.66 seconds)\n", - "Cbc0010I After 17277000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1321.74 seconds)\n", - "Cbc0010I After 17278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1321.82 seconds)\n", - "Cbc0010I After 17279000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1321.90 seconds)\n", - "Cbc0010I After 17280000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1322.03 seconds)\n", - "Cbc0010I After 17281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1322.14 seconds)\n", - "Cbc0010I After 17282000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1322.23 seconds)\n", - "Cbc0010I After 17283000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1322.29 seconds)\n", - "Cbc0010I After 17284000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1322.32 seconds)\n", - "Cbc0010I After 17285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1322.35 seconds)\n", - "Cbc0010I After 17286000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1322.40 seconds)\n", - "Cbc0010I After 17287000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1322.45 seconds)\n", - "Cbc0010I After 17288000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1322.53 seconds)\n", - "Cbc0010I After 17289000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1322.59 seconds)\n", - "Cbc0010I After 17290000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1322.67 seconds)\n", - "Cbc0010I After 17291000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1322.74 seconds)\n", - "Cbc0010I After 17292000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1322.82 seconds)\n", - "Cbc0010I After 17293000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1322.89 seconds)\n", - "Cbc0010I After 17294000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1322.96 seconds)\n", - "Cbc0010I After 17295000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1323.03 seconds)\n", - "Cbc0010I After 17296000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1323.11 seconds)\n", - "Cbc0010I After 17297000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1323.17 seconds)\n", - "Cbc0010I After 17298000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1323.24 seconds)\n", - "Cbc0010I After 17299000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1323.31 seconds)\n", - "Cbc0010I After 17300000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1323.38 seconds)\n", - "Cbc0010I After 17301000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1323.46 seconds)\n", - "Cbc0010I After 17302000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1323.53 seconds)\n", - "Cbc0010I After 17303000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1323.60 seconds)\n", - "Cbc0010I After 17304000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.68 seconds)\n", - "Cbc0010I After 17305000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.75 seconds)\n", - "Cbc0010I After 17306000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1323.82 seconds)\n", - "Cbc0010I After 17307000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1323.87 seconds)\n", - "Cbc0010I After 17308000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1323.92 seconds)\n", - "Cbc0010I After 17309000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1323.96 seconds)\n", - "Cbc0010I After 17310000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1323.99 seconds)\n", - "Cbc0010I After 17311000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1324.02 seconds)\n", - "Cbc0010I After 17312000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1324.05 seconds)\n", - "Cbc0010I After 17313000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1324.11 seconds)\n", - "Cbc0010I After 17314000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1324.17 seconds)\n", - "Cbc0010I After 17315000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.25 seconds)\n", - "Cbc0010I After 17316000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1324.30 seconds)\n", - "Cbc0010I After 17317000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1324.36 seconds)\n", - "Cbc0010I After 17318000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1324.42 seconds)\n", - "Cbc0010I After 17319000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1324.49 seconds)\n", - "Cbc0010I After 17320000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1324.56 seconds)\n", - "Cbc0010I After 17321000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.64 seconds)\n", - "Cbc0010I After 17322000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1324.72 seconds)\n", - "Cbc0010I After 17323000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1324.80 seconds)\n", - "Cbc0010I After 17324000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1324.89 seconds)\n", - "Cbc0010I After 17325000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1324.97 seconds)\n", - "Cbc0010I After 17326000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1325.05 seconds)\n", - "Cbc0010I After 17327000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1325.13 seconds)\n", - "Cbc0010I After 17328000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1325.20 seconds)\n", - "Cbc0010I After 17329000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1325.28 seconds)\n", - "Cbc0010I After 17330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1325.32 seconds)\n", - "Cbc0010I After 17331000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1325.38 seconds)\n", - "Cbc0010I After 17332000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1325.42 seconds)\n", - "Cbc0010I After 17333000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1325.46 seconds)\n", - "Cbc0010I After 17334000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1325.53 seconds)\n", - "Cbc0010I After 17335000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1325.61 seconds)\n", - "Cbc0010I After 17336000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1325.66 seconds)\n", - "Cbc0010I After 17337000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1325.72 seconds)\n", - "Cbc0010I After 17338000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1325.79 seconds)\n", - "Cbc0010I After 17339000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1325.82 seconds)\n", - "Cbc0010I After 17340000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1325.87 seconds)\n", - "Cbc0010I After 17341000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1325.95 seconds)\n", - "Cbc0010I After 17342000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1325.99 seconds)\n", - "Cbc0010I After 17343000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1326.06 seconds)\n", - "Cbc0010I After 17344000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1326.13 seconds)\n", - "Cbc0010I After 17345000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1326.21 seconds)\n", - "Cbc0010I After 17346000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1326.28 seconds)\n", - "Cbc0010I After 17347000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1326.35 seconds)\n", - "Cbc0010I After 17348000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1326.43 seconds)\n", - "Cbc0010I After 17349000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1326.50 seconds)\n", - "Cbc0010I After 17350000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1326.58 seconds)\n", - "Cbc0010I After 17351000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1326.65 seconds)\n", - "Cbc0010I After 17352000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1326.73 seconds)\n", - "Cbc0010I After 17353000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1326.81 seconds)\n", - "Cbc0010I After 17354000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1326.88 seconds)\n", - "Cbc0010I After 17355000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1326.96 seconds)\n", - "Cbc0010I After 17356000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1327.03 seconds)\n", - "Cbc0010I After 17357000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1327.11 seconds)\n", - "Cbc0010I After 17358000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1327.19 seconds)\n", - "Cbc0010I After 17359000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1327.25 seconds)\n", - "Cbc0010I After 17360000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1327.32 seconds)\n", - "Cbc0010I After 17361000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1327.39 seconds)\n", - "Cbc0010I After 17362000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1327.46 seconds)\n", - "Cbc0010I After 17363000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1327.53 seconds)\n", - "Cbc0010I After 17364000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1327.59 seconds)\n", - "Cbc0010I After 17365000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1327.65 seconds)\n", - "Cbc0010I After 17366000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1327.72 seconds)\n", - "Cbc0010I After 17367000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1327.79 seconds)\n", - "Cbc0010I After 17368000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1327.86 seconds)\n", - "Cbc0010I After 17369000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1327.92 seconds)\n", - "Cbc0010I After 17370000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1327.99 seconds)\n", - "Cbc0010I After 17371000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1328.07 seconds)\n", - "Cbc0010I After 17372000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1328.14 seconds)\n", - "Cbc0010I After 17373000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1328.22 seconds)\n", - "Cbc0010I After 17374000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1328.29 seconds)\n", - "Cbc0010I After 17375000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1328.37 seconds)\n", - "Cbc0010I After 17376000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1328.45 seconds)\n", - "Cbc0010I After 17377000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1328.52 seconds)\n", - "Cbc0010I After 17378000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1328.60 seconds)\n", - "Cbc0010I After 17379000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1328.68 seconds)\n", - "Cbc0010I After 17380000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1328.75 seconds)\n", - "Cbc0010I After 17381000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1328.82 seconds)\n", - "Cbc0010I After 17382000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1328.89 seconds)\n", - "Cbc0010I After 17383000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1328.97 seconds)\n", - "Cbc0010I After 17384000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1329.03 seconds)\n", - "Cbc0010I After 17385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1329.09 seconds)\n", - "Cbc0010I After 17386000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1329.17 seconds)\n", - "Cbc0010I After 17387000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1329.24 seconds)\n", - "Cbc0010I After 17388000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1329.31 seconds)\n", - "Cbc0010I After 17389000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1329.39 seconds)\n", - "Cbc0010I After 17390000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1329.47 seconds)\n", - "Cbc0010I After 17391000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1329.54 seconds)\n", - "Cbc0010I After 17392000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1329.61 seconds)\n", - "Cbc0010I After 17393000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1329.68 seconds)\n", - "Cbc0010I After 17394000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1329.76 seconds)\n", - "Cbc0010I After 17395000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1329.83 seconds)\n", - "Cbc0010I After 17396000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1329.90 seconds)\n", - "Cbc0010I After 17397000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1329.97 seconds)\n", - "Cbc0010I After 17398000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1330.04 seconds)\n", - "Cbc0010I After 17399000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1330.11 seconds)\n", - "Cbc0010I After 17400000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1330.16 seconds)\n", - "Cbc0010I After 17401000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1330.21 seconds)\n", - "Cbc0010I After 17402000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1330.26 seconds)\n", - "Cbc0010I After 17403000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1330.32 seconds)\n", - "Cbc0010I After 17404000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1330.36 seconds)\n", - "Cbc0010I After 17405000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1330.41 seconds)\n", - "Cbc0010I After 17406000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1330.44 seconds)\n", - "Cbc0010I After 17407000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1330.51 seconds)\n", - "Cbc0010I After 17408000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1330.58 seconds)\n", - "Cbc0010I After 17409000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1330.65 seconds)\n", - "Cbc0010I After 17410000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1330.71 seconds)\n", - "Cbc0010I After 17411000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1330.77 seconds)\n", - "Cbc0010I After 17412000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1330.85 seconds)\n", - "Cbc0010I After 17413000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1330.91 seconds)\n", - "Cbc0010I After 17414000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1330.96 seconds)\n", - "Cbc0010I After 17415000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1331.02 seconds)\n", - "Cbc0010I After 17416000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1331.08 seconds)\n", - "Cbc0010I After 17417000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1331.12 seconds)\n", - "Cbc0010I After 17418000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1331.17 seconds)\n", - "Cbc0010I After 17419000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1331.23 seconds)\n", - "Cbc0010I After 17420000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1331.30 seconds)\n", - "Cbc0010I After 17421000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1331.36 seconds)\n", - "Cbc0010I After 17422000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1331.41 seconds)\n", - "Cbc0010I After 17423000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1331.47 seconds)\n", - "Cbc0010I After 17424000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1331.54 seconds)\n", - "Cbc0010I After 17425000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1331.59 seconds)\n", - "Cbc0010I After 17426000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1331.66 seconds)\n", - "Cbc0010I After 17427000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1331.73 seconds)\n", - "Cbc0010I After 17428000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1331.81 seconds)\n", - "Cbc0010I After 17429000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1331.92 seconds)\n", - "Cbc0010I After 17430000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1332.01 seconds)\n", - "Cbc0010I After 17431000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1332.09 seconds)\n", - "Cbc0010I After 17432000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1332.17 seconds)\n", - "Cbc0010I After 17433000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1332.25 seconds)\n", - "Cbc0010I After 17434000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1332.32 seconds)\n", - "Cbc0010I After 17435000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1332.40 seconds)\n", - "Cbc0010I After 17436000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1332.47 seconds)\n", - "Cbc0010I After 17437000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1332.54 seconds)\n", - "Cbc0010I After 17438000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1332.57 seconds)\n", - "Cbc0010I After 17439000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1332.64 seconds)\n", - "Cbc0010I After 17440000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1332.70 seconds)\n", - "Cbc0010I After 17441000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1332.77 seconds)\n", - "Cbc0010I After 17442000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1332.84 seconds)\n", - "Cbc0010I After 17443000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1332.90 seconds)\n", - "Cbc0010I After 17444000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1332.97 seconds)\n", - "Cbc0010I After 17445000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1333.03 seconds)\n", - "Cbc0010I After 17446000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1333.09 seconds)\n", - "Cbc0010I After 17447000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1333.15 seconds)\n", - "Cbc0010I After 17448000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1333.22 seconds)\n", - "Cbc0010I After 17449000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1333.29 seconds)\n", - "Cbc0010I After 17450000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1333.37 seconds)\n", - "Cbc0010I After 17451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1333.44 seconds)\n", - "Cbc0010I After 17452000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1333.52 seconds)\n", - "Cbc0010I After 17453000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1333.57 seconds)\n", - "Cbc0010I After 17454000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1333.65 seconds)\n", - "Cbc0010I After 17455000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1333.72 seconds)\n", - "Cbc0010I After 17456000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1333.79 seconds)\n", - "Cbc0010I After 17457000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1333.86 seconds)\n", - "Cbc0010I After 17458000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1333.93 seconds)\n", - "Cbc0010I After 17459000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1334.01 seconds)\n", - "Cbc0010I After 17460000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1334.06 seconds)\n", - "Cbc0010I After 17461000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1334.11 seconds)\n", - "Cbc0010I After 17462000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1334.17 seconds)\n", - "Cbc0010I After 17463000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1334.24 seconds)\n", - "Cbc0010I After 17464000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1334.32 seconds)\n", - "Cbc0010I After 17465000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1334.38 seconds)\n", - "Cbc0010I After 17466000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1334.44 seconds)\n", - "Cbc0010I After 17467000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1334.50 seconds)\n", - "Cbc0010I After 17468000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1334.56 seconds)\n", - "Cbc0010I After 17469000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1334.63 seconds)\n", - "Cbc0010I After 17470000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1334.71 seconds)\n", - "Cbc0010I After 17471000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1334.78 seconds)\n", - "Cbc0010I After 17472000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1334.85 seconds)\n", - "Cbc0010I After 17473000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1334.90 seconds)\n", - "Cbc0010I After 17474000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1334.96 seconds)\n", - "Cbc0010I After 17475000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1335.02 seconds)\n", - "Cbc0010I After 17476000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1335.09 seconds)\n", - "Cbc0010I After 17477000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1335.17 seconds)\n", - "Cbc0010I After 17478000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.25 seconds)\n", - "Cbc0010I After 17479000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1335.33 seconds)\n", - "Cbc0010I After 17480000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.41 seconds)\n", - "Cbc0010I After 17481000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1335.49 seconds)\n", - "Cbc0010I After 17482000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1335.57 seconds)\n", - "Cbc0010I After 17483000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1335.64 seconds)\n", - "Cbc0010I After 17484000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1335.72 seconds)\n", - "Cbc0010I After 17485000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1335.80 seconds)\n", - "Cbc0010I After 17486000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1335.88 seconds)\n", - "Cbc0010I After 17487000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1335.97 seconds)\n", - "Cbc0010I After 17488000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1336.07 seconds)\n", - "Cbc0010I After 17489000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1336.18 seconds)\n", - "Cbc0010I After 17490000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1336.28 seconds)\n", - "Cbc0010I After 17491000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1336.37 seconds)\n", - "Cbc0010I After 17492000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1336.47 seconds)\n", - "Cbc0010I After 17493000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1336.52 seconds)\n", - "Cbc0010I After 17494000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1336.56 seconds)\n", - "Cbc0010I After 17495000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1336.63 seconds)\n", - "Cbc0010I After 17496000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1336.72 seconds)\n", - "Cbc0010I After 17497000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1336.78 seconds)\n", - "Cbc0010I After 17498000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1336.82 seconds)\n", - "Cbc0010I After 17499000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1336.87 seconds)\n", - "Cbc0010I After 17500000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1336.93 seconds)\n", - "Cbc0010I After 17501000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1336.97 seconds)\n", - "Cbc0010I After 17502000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1337.03 seconds)\n", - "Cbc0010I After 17503000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1337.09 seconds)\n", - "Cbc0010I After 17504000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1337.17 seconds)\n", - "Cbc0010I After 17505000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1337.25 seconds)\n", - "Cbc0010I After 17506000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1337.33 seconds)\n", - "Cbc0010I After 17507000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1337.41 seconds)\n", - "Cbc0010I After 17508000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1337.48 seconds)\n", - "Cbc0010I After 17509000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1337.51 seconds)\n", - "Cbc0010I After 17510000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1337.55 seconds)\n", - "Cbc0010I After 17511000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1337.61 seconds)\n", - "Cbc0010I After 17512000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1337.65 seconds)\n", - "Cbc0010I After 17513000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1337.68 seconds)\n", - "Cbc0010I After 17514000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1337.71 seconds)\n", - "Cbc0010I After 17515000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1337.81 seconds)\n", - "Cbc0010I After 17516000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1337.89 seconds)\n", - "Cbc0010I After 17517000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1337.99 seconds)\n", - "Cbc0010I After 17518000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1338.07 seconds)\n", - "Cbc0010I After 17519000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1338.16 seconds)\n", - "Cbc0010I After 17520000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1338.25 seconds)\n", - "Cbc0010I After 17521000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1338.35 seconds)\n", - "Cbc0010I After 17522000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1338.45 seconds)\n", - "Cbc0010I After 17523000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1338.52 seconds)\n", - "Cbc0010I After 17524000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.60 seconds)\n", - "Cbc0010I After 17525000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.66 seconds)\n", - "Cbc0010I After 17526000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1338.74 seconds)\n", - "Cbc0010I After 17527000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1338.81 seconds)\n", - "Cbc0010I After 17528000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1338.88 seconds)\n", - "Cbc0010I After 17529000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1338.94 seconds)\n", - "Cbc0010I After 17530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1339.00 seconds)\n", - "Cbc0010I After 17531000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1339.11 seconds)\n", - "Cbc0010I After 17532000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1339.20 seconds)\n", - "Cbc0010I After 17533000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1339.29 seconds)\n", - "Cbc0010I After 17534000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1339.37 seconds)\n", - "Cbc0010I After 17535000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1339.45 seconds)\n", - "Cbc0010I After 17536000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1339.53 seconds)\n", - "Cbc0010I After 17537000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1339.61 seconds)\n", - "Cbc0010I After 17538000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1339.69 seconds)\n", - "Cbc0010I After 17539000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1339.73 seconds)\n", - "Cbc0010I After 17540000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1339.76 seconds)\n", - "Cbc0010I After 17541000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1339.79 seconds)\n", - "Cbc0010I After 17542000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1339.85 seconds)\n", - "Cbc0010I After 17543000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1339.91 seconds)\n", - "Cbc0010I After 17544000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1339.97 seconds)\n", - "Cbc0010I After 17545000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1340.03 seconds)\n", - "Cbc0010I After 17546000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1340.08 seconds)\n", - "Cbc0010I After 17547000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1340.12 seconds)\n", - "Cbc0010I After 17548000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1340.15 seconds)\n", - "Cbc0010I After 17549000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1340.20 seconds)\n", - "Cbc0010I After 17550000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1340.28 seconds)\n", - "Cbc0010I After 17551000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1340.35 seconds)\n", - "Cbc0010I After 17552000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1340.43 seconds)\n", - "Cbc0010I After 17553000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1340.49 seconds)\n", - "Cbc0010I After 17554000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1340.53 seconds)\n", - "Cbc0010I After 17555000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1340.61 seconds)\n", - "Cbc0010I After 17556000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1340.67 seconds)\n", - "Cbc0010I After 17557000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1340.74 seconds)\n", - "Cbc0010I After 17558000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1340.81 seconds)\n", - "Cbc0010I After 17559000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1340.89 seconds)\n", - "Cbc0010I After 17560000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1340.96 seconds)\n", - "Cbc0010I After 17561000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1341.04 seconds)\n", - "Cbc0010I After 17562000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1341.12 seconds)\n", - "Cbc0010I After 17563000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1341.19 seconds)\n", - "Cbc0010I After 17564000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1341.27 seconds)\n", - "Cbc0010I After 17565000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1341.35 seconds)\n", - "Cbc0010I After 17566000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1341.43 seconds)\n", - "Cbc0010I After 17567000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1341.50 seconds)\n", - "Cbc0010I After 17568000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1341.58 seconds)\n", - "Cbc0010I After 17569000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1341.66 seconds)\n", - "Cbc0010I After 17570000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1341.71 seconds)\n", - "Cbc0010I After 17571000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1341.77 seconds)\n", - "Cbc0010I After 17572000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1341.82 seconds)\n", - "Cbc0010I After 17573000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1341.89 seconds)\n", - "Cbc0010I After 17574000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1341.92 seconds)\n", - "Cbc0010I After 17575000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1341.96 seconds)\n", - "Cbc0010I After 17576000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1342.01 seconds)\n", - "Cbc0010I After 17577000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1342.07 seconds)\n", - "Cbc0010I After 17578000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1342.13 seconds)\n", - "Cbc0010I After 17579000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1342.16 seconds)\n", - "Cbc0010I After 17580000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1342.22 seconds)\n", - "Cbc0010I After 17581000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1342.29 seconds)\n", - "Cbc0010I After 17582000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1342.37 seconds)\n", - "Cbc0010I After 17583000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1342.45 seconds)\n", - "Cbc0010I After 17584000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1342.52 seconds)\n", - "Cbc0010I After 17585000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1342.61 seconds)\n", - "Cbc0010I After 17586000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1342.67 seconds)\n", - "Cbc0010I After 17587000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1342.75 seconds)\n", - "Cbc0010I After 17588000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1342.81 seconds)\n", - "Cbc0010I After 17589000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1342.89 seconds)\n", - "Cbc0010I After 17590000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1342.96 seconds)\n", - "Cbc0010I After 17591000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1343.02 seconds)\n", - "Cbc0010I After 17592000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1343.09 seconds)\n", - "Cbc0010I After 17593000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1343.12 seconds)\n", - "Cbc0010I After 17594000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1343.20 seconds)\n", - "Cbc0010I After 17595000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1343.28 seconds)\n", - "Cbc0010I After 17596000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1343.35 seconds)\n", - "Cbc0010I After 17597000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1343.41 seconds)\n", - "Cbc0010I After 17598000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1343.48 seconds)\n", - "Cbc0010I After 17599000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1343.55 seconds)\n", - "Cbc0010I After 17600000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1343.62 seconds)\n", - "Cbc0010I After 17601000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1343.70 seconds)\n", - "Cbc0010I After 17602000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1343.75 seconds)\n", - "Cbc0010I After 17603000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1343.83 seconds)\n", - "Cbc0010I After 17604000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1343.91 seconds)\n", - "Cbc0010I After 17605000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1343.98 seconds)\n", - "Cbc0010I After 17606000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1344.06 seconds)\n", - "Cbc0010I After 17607000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1344.14 seconds)\n", - "Cbc0010I After 17608000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1344.17 seconds)\n", - "Cbc0010I After 17609000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.23 seconds)\n", - "Cbc0010I After 17610000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1344.28 seconds)\n", - "Cbc0010I After 17611000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1344.35 seconds)\n", - "Cbc0010I After 17612000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1344.43 seconds)\n", - "Cbc0010I After 17613000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.52 seconds)\n", - "Cbc0010I After 17614000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1344.60 seconds)\n", - "Cbc0010I After 17615000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1344.67 seconds)\n", - "Cbc0010I After 17616000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1344.75 seconds)\n", - "Cbc0010I After 17617000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1344.83 seconds)\n", - "Cbc0010I After 17618000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1344.91 seconds)\n", - "Cbc0010I After 17619000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1344.98 seconds)\n", - "Cbc0010I After 17620000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1345.06 seconds)\n", - "Cbc0010I After 17621000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1345.14 seconds)\n", - "Cbc0010I After 17622000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1345.22 seconds)\n", - "Cbc0010I After 17623000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1345.29 seconds)\n", - "Cbc0010I After 17624000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1345.37 seconds)\n", - "Cbc0010I After 17625000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1345.45 seconds)\n", - "Cbc0010I After 17626000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1345.53 seconds)\n", - "Cbc0010I After 17627000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1345.61 seconds)\n", - "Cbc0010I After 17628000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1345.64 seconds)\n", - "Cbc0010I After 17629000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1345.70 seconds)\n", - "Cbc0010I After 17630000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1345.76 seconds)\n", - "Cbc0010I After 17631000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1345.82 seconds)\n", - "Cbc0010I After 17632000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1345.88 seconds)\n", - "Cbc0010I After 17633000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1345.96 seconds)\n", - "Cbc0010I After 17634000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1346.05 seconds)\n", - "Cbc0010I After 17635000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1346.15 seconds)\n", - "Cbc0010I After 17636000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1346.23 seconds)\n", - "Cbc0010I After 17637000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1346.31 seconds)\n", - "Cbc0010I After 17638000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1346.34 seconds)\n", - "Cbc0010I After 17639000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1346.40 seconds)\n", - "Cbc0010I After 17640000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1346.47 seconds)\n", - "Cbc0010I After 17641000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1346.53 seconds)\n", - "Cbc0010I After 17642000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1346.59 seconds)\n", - "Cbc0010I After 17643000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1346.67 seconds)\n", - "Cbc0010I After 17644000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1346.73 seconds)\n", - "Cbc0010I After 17645000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1346.81 seconds)\n", - "Cbc0010I After 17646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1346.89 seconds)\n", - "Cbc0010I After 17647000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1346.97 seconds)\n", - "Cbc0010I After 17648000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1347.04 seconds)\n", - "Cbc0010I After 17649000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1347.12 seconds)\n", - "Cbc0010I After 17650000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1347.19 seconds)\n", - "Cbc0010I After 17651000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1347.27 seconds)\n", - "Cbc0010I After 17652000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1347.33 seconds)\n", - "Cbc0010I After 17653000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1347.36 seconds)\n", - "Cbc0010I After 17654000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1347.39 seconds)\n", - "Cbc0010I After 17655000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1347.43 seconds)\n", - "Cbc0010I After 17656000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1347.50 seconds)\n", - "Cbc0010I After 17657000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1347.56 seconds)\n", - "Cbc0010I After 17658000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1347.63 seconds)\n", - "Cbc0010I After 17659000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1347.69 seconds)\n", - "Cbc0010I After 17660000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1347.74 seconds)\n", - "Cbc0010I After 17661000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1347.81 seconds)\n", - "Cbc0010I After 17662000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1347.87 seconds)\n", - "Cbc0010I After 17663000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1347.90 seconds)\n", - "Cbc0010I After 17664000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1347.93 seconds)\n", - "Cbc0010I After 17665000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1348.00 seconds)\n", - "Cbc0010I After 17666000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1348.07 seconds)\n", - "Cbc0010I After 17667000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1348.15 seconds)\n", - "Cbc0010I After 17668000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1348.23 seconds)\n", - "Cbc0010I After 17669000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1348.31 seconds)\n", - "Cbc0010I After 17670000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1348.39 seconds)\n", - "Cbc0010I After 17671000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1348.45 seconds)\n", - "Cbc0010I After 17672000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1348.52 seconds)\n", - "Cbc0010I After 17673000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1348.60 seconds)\n", - "Cbc0010I After 17674000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1348.67 seconds)\n", - "Cbc0010I After 17675000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1348.75 seconds)\n", - "Cbc0010I After 17676000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1348.80 seconds)\n", - "Cbc0010I After 17677000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1348.86 seconds)\n", - "Cbc0010I After 17678000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1348.90 seconds)\n", - "Cbc0010I After 17679000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1348.94 seconds)\n", - "Cbc0010I After 17680000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1348.99 seconds)\n", - "Cbc0010I After 17681000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1349.05 seconds)\n", - "Cbc0010I After 17682000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1349.11 seconds)\n", - "Cbc0010I After 17683000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1349.14 seconds)\n", - "Cbc0010I After 17684000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1349.20 seconds)\n", - "Cbc0010I After 17685000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1349.23 seconds)\n", - "Cbc0010I After 17686000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1349.28 seconds)\n", - "Cbc0010I After 17687000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1349.35 seconds)\n", - "Cbc0010I After 17688000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1349.42 seconds)\n", - "Cbc0010I After 17689000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1349.49 seconds)\n", - "Cbc0010I After 17690000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1349.57 seconds)\n", - "Cbc0010I After 17691000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1349.65 seconds)\n", - "Cbc0010I After 17692000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1349.72 seconds)\n", - "Cbc0010I After 17693000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1349.80 seconds)\n", - "Cbc0010I After 17694000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1349.87 seconds)\n", - "Cbc0010I After 17695000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1349.94 seconds)\n", - "Cbc0010I After 17696000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1350.01 seconds)\n", - "Cbc0010I After 17697000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1350.08 seconds)\n", - "Cbc0010I After 17698000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1350.16 seconds)\n", - "Cbc0010I After 17699000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1350.22 seconds)\n", - "Cbc0010I After 17700000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1350.27 seconds)\n", - "Cbc0010I After 17701000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1350.34 seconds)\n", - "Cbc0010I After 17702000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1350.38 seconds)\n", - "Cbc0010I After 17703000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1350.46 seconds)\n", - "Cbc0010I After 17704000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1350.53 seconds)\n", - "Cbc0010I After 17705000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1350.58 seconds)\n", - "Cbc0010I After 17706000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1350.65 seconds)\n", - "Cbc0010I After 17707000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1350.72 seconds)\n", - "Cbc0010I After 17708000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1350.78 seconds)\n", - "Cbc0010I After 17709000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1350.85 seconds)\n", - "Cbc0010I After 17710000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1350.91 seconds)\n", - "Cbc0010I After 17711000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1350.98 seconds)\n", - "Cbc0010I After 17712000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1351.05 seconds)\n", - "Cbc0010I After 17713000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1351.10 seconds)\n", - "Cbc0010I After 17714000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1351.16 seconds)\n", - "Cbc0010I After 17715000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1351.23 seconds)\n", - "Cbc0010I After 17716000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1351.32 seconds)\n", - "Cbc0010I After 17717000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1351.39 seconds)\n", - "Cbc0010I After 17718000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1351.47 seconds)\n", - "Cbc0010I After 17719000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1351.55 seconds)\n", - "Cbc0010I After 17720000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1351.63 seconds)\n", - "Cbc0010I After 17721000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1351.69 seconds)\n", - "Cbc0010I After 17722000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1351.77 seconds)\n", - "Cbc0010I After 17723000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1351.85 seconds)\n", - "Cbc0010I After 17724000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1351.93 seconds)\n", - "Cbc0010I After 17725000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1352.00 seconds)\n", - "Cbc0010I After 17726000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1352.04 seconds)\n", - "Cbc0010I After 17727000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1352.10 seconds)\n", - "Cbc0010I After 17728000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1352.14 seconds)\n", - "Cbc0010I After 17729000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1352.18 seconds)\n", - "Cbc0010I After 17730000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1352.22 seconds)\n", - "Cbc0010I After 17731000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1352.28 seconds)\n", - "Cbc0010I After 17732000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1352.33 seconds)\n", - "Cbc0010I After 17733000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1352.36 seconds)\n", - "Cbc0010I After 17734000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.39 seconds)\n", - "Cbc0010I After 17735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1352.43 seconds)\n", - "Cbc0010I After 17736000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1352.49 seconds)\n", - "Cbc0010I After 17737000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.55 seconds)\n", - "Cbc0010I After 17738000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1352.59 seconds)\n", - "Cbc0010I After 17739000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1352.65 seconds)\n", - "Cbc0010I After 17740000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1352.73 seconds)\n", - "Cbc0010I After 17741000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1352.79 seconds)\n", - "Cbc0010I After 17742000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1352.86 seconds)\n", - "Cbc0010I After 17743000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1352.92 seconds)\n", - "Cbc0010I After 17744000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1352.97 seconds)\n", - "Cbc0010I After 17745000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1353.02 seconds)\n", - "Cbc0010I After 17746000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1353.09 seconds)\n", - "Cbc0010I After 17747000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1353.16 seconds)\n", - "Cbc0010I After 17748000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1353.26 seconds)\n", - "Cbc0010I After 17749000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1353.29 seconds)\n", - "Cbc0010I After 17750000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1353.33 seconds)\n", - "Cbc0010I After 17751000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1353.40 seconds)\n", - "Cbc0010I After 17752000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1353.47 seconds)\n", - "Cbc0010I After 17753000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1353.53 seconds)\n", - "Cbc0010I After 17754000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1353.60 seconds)\n", - "Cbc0010I After 17755000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1353.67 seconds)\n", - "Cbc0010I After 17756000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1353.75 seconds)\n", - "Cbc0010I After 17757000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1353.82 seconds)\n", - "Cbc0010I After 17758000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1353.89 seconds)\n", - "Cbc0010I After 17759000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1353.95 seconds)\n", - "Cbc0010I After 17760000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1354.02 seconds)\n", - "Cbc0010I After 17761000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1354.10 seconds)\n", - "Cbc0010I After 17762000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1354.16 seconds)\n", - "Cbc0010I After 17763000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1354.21 seconds)\n", - "Cbc0010I After 17764000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1354.27 seconds)\n", - "Cbc0010I After 17765000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1354.31 seconds)\n", - "Cbc0010I After 17766000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1354.38 seconds)\n", - "Cbc0010I After 17767000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1354.45 seconds)\n", - "Cbc0010I After 17768000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1354.51 seconds)\n", - "Cbc0010I After 17769000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1354.58 seconds)\n", - "Cbc0010I After 17770000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1354.65 seconds)\n", - "Cbc0010I After 17771000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1354.73 seconds)\n", - "Cbc0010I After 17772000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1354.80 seconds)\n", - "Cbc0010I After 17773000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1354.87 seconds)\n", - "Cbc0010I After 17774000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1354.93 seconds)\n", - "Cbc0010I After 17775000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1354.95 seconds)\n", - "Cbc0010I After 17776000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1354.98 seconds)\n", - "Cbc0010I After 17777000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1355.02 seconds)\n", - "Cbc0010I After 17778000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.07 seconds)\n", - "Cbc0010I After 17779000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1355.13 seconds)\n", - "Cbc0010I After 17780000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1355.17 seconds)\n", - "Cbc0010I After 17781000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1355.20 seconds)\n", - "Cbc0010I After 17782000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.29 seconds)\n", - "Cbc0010I After 17783000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1355.38 seconds)\n", - "Cbc0010I After 17784000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1355.45 seconds)\n", - "Cbc0010I After 17785000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1355.53 seconds)\n", - "Cbc0010I After 17786000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1355.60 seconds)\n", - "Cbc0010I After 17787000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1355.66 seconds)\n", - "Cbc0010I After 17788000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1355.73 seconds)\n", - "Cbc0010I After 17789000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1355.81 seconds)\n", - "Cbc0010I After 17790000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1355.89 seconds)\n", - "Cbc0010I After 17791000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1355.97 seconds)\n", - "Cbc0010I After 17792000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.02 seconds)\n", - "Cbc0010I After 17793000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1356.06 seconds)\n", - "Cbc0010I After 17794000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.12 seconds)\n", - "Cbc0010I After 17795000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1356.19 seconds)\n", - "Cbc0010I After 17796000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1356.27 seconds)\n", - "Cbc0010I After 17797000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1356.32 seconds)\n", - "Cbc0010I After 17798000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1356.38 seconds)\n", - "Cbc0010I After 17799000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.43 seconds)\n", - "Cbc0010I After 17800000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1356.47 seconds)\n", - "Cbc0010I After 17801000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1356.54 seconds)\n", - "Cbc0010I After 17802000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1356.61 seconds)\n", - "Cbc0010I After 17803000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1356.69 seconds)\n", - "Cbc0010I After 17804000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1356.76 seconds)\n", - "Cbc0010I After 17805000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1356.82 seconds)\n", - "Cbc0010I After 17806000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1356.88 seconds)\n", - "Cbc0010I After 17807000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1356.91 seconds)\n", - "Cbc0010I After 17808000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1356.95 seconds)\n", - "Cbc0010I After 17809000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1356.99 seconds)\n", - "Cbc0010I After 17810000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1357.03 seconds)\n", - "Cbc0010I After 17811000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1357.06 seconds)\n", - "Cbc0010I After 17812000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1357.10 seconds)\n", - "Cbc0010I After 17813000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1357.16 seconds)\n", - "Cbc0010I After 17814000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1357.23 seconds)\n", - "Cbc0010I After 17815000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1357.28 seconds)\n", - "Cbc0010I After 17816000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1357.33 seconds)\n", - "Cbc0010I After 17817000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1357.40 seconds)\n", - "Cbc0010I After 17818000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1357.46 seconds)\n", - "Cbc0010I After 17819000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1357.54 seconds)\n", - "Cbc0010I After 17820000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1357.62 seconds)\n", - "Cbc0010I After 17821000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1357.70 seconds)\n", - "Cbc0010I After 17822000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1357.78 seconds)\n", - "Cbc0010I After 17823000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1357.86 seconds)\n", - "Cbc0010I After 17824000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1357.92 seconds)\n", - "Cbc0010I After 17825000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1357.97 seconds)\n", - "Cbc0010I After 17826000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1358.05 seconds)\n", - "Cbc0010I After 17827000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1358.12 seconds)\n", - "Cbc0010I After 17828000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1358.19 seconds)\n", - "Cbc0010I After 17829000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1358.27 seconds)\n", - "Cbc0010I After 17830000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1358.34 seconds)\n", - "Cbc0010I After 17831000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1358.40 seconds)\n", - "Cbc0010I After 17832000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1358.44 seconds)\n", - "Cbc0010I After 17833000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1358.48 seconds)\n", - "Cbc0010I After 17834000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1358.56 seconds)\n", - "Cbc0010I After 17835000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1358.62 seconds)\n", - "Cbc0010I After 17836000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1358.66 seconds)\n", - "Cbc0010I After 17837000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1358.72 seconds)\n", - "Cbc0010I After 17838000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1358.78 seconds)\n", - "Cbc0010I After 17839000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1358.85 seconds)\n", - "Cbc0010I After 17840000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1358.92 seconds)\n", - "Cbc0010I After 17841000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.00 seconds)\n", - "Cbc0010I After 17842000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1359.08 seconds)\n", - "Cbc0010I After 17843000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1359.19 seconds)\n", - "Cbc0010I After 17844000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1359.29 seconds)\n", - "Cbc0010I After 17845000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1359.37 seconds)\n", - "Cbc0010I After 17846000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1359.42 seconds)\n", - "Cbc0010I After 17847000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1359.47 seconds)\n", - "Cbc0010I After 17848000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1359.51 seconds)\n", - "Cbc0010I After 17849000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1359.58 seconds)\n", - "Cbc0010I After 17850000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1359.65 seconds)\n", - "Cbc0010I After 17851000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1359.70 seconds)\n", - "Cbc0010I After 17852000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1359.74 seconds)\n", - "Cbc0010I After 17853000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.78 seconds)\n", - "Cbc0010I After 17854000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1359.83 seconds)\n", - "Cbc0010I After 17855000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1359.90 seconds)\n", - "Cbc0010I After 17856000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1359.97 seconds)\n", - "Cbc0010I After 17857000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.03 seconds)\n", - "Cbc0010I After 17858000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1360.09 seconds)\n", - "Cbc0010I After 17859000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.13 seconds)\n", - "Cbc0010I After 17860000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1360.18 seconds)\n", - "Cbc0010I After 17861000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1360.22 seconds)\n", - "Cbc0010I After 17862000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1360.29 seconds)\n", - "Cbc0010I After 17863000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1360.37 seconds)\n", - "Cbc0010I After 17864000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1360.42 seconds)\n", - "Cbc0010I After 17865000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1360.46 seconds)\n", - "Cbc0010I After 17866000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1360.50 seconds)\n", - "Cbc0010I After 17867000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1360.55 seconds)\n", - "Cbc0010I After 17868000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1360.60 seconds)\n", - "Cbc0010I After 17869000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1360.66 seconds)\n", - "Cbc0010I After 17870000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1360.69 seconds)\n", - "Cbc0010I After 17871000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1360.72 seconds)\n", - "Cbc0010I After 17872000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1360.79 seconds)\n", - "Cbc0010I After 17873000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1360.84 seconds)\n", - "Cbc0010I After 17874000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1360.89 seconds)\n", - "Cbc0010I After 17875000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1360.96 seconds)\n", - "Cbc0010I After 17876000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1361.03 seconds)\n", - "Cbc0010I After 17877000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1361.10 seconds)\n", - "Cbc0010I After 17878000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1361.17 seconds)\n", - "Cbc0010I After 17879000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1361.24 seconds)\n", - "Cbc0010I After 17880000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1361.32 seconds)\n", - "Cbc0010I After 17881000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1361.39 seconds)\n", - "Cbc0010I After 17882000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1361.42 seconds)\n", - "Cbc0010I After 17883000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1361.47 seconds)\n", - "Cbc0010I After 17884000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1361.51 seconds)\n", - "Cbc0010I After 17885000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1361.57 seconds)\n", - "Cbc0010I After 17886000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1361.62 seconds)\n", - "Cbc0010I After 17887000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1361.67 seconds)\n", - "Cbc0010I After 17888000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1361.72 seconds)\n", - "Cbc0010I After 17889000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1361.78 seconds)\n", - "Cbc0010I After 17890000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1361.81 seconds)\n", - "Cbc0010I After 17891000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1361.84 seconds)\n", - "Cbc0010I After 17892000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1361.87 seconds)\n", - "Cbc0010I After 17893000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1361.91 seconds)\n", - "Cbc0010I After 17894000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1361.95 seconds)\n", - "Cbc0010I After 17895000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1361.98 seconds)\n", - "Cbc0010I After 17896000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1362.01 seconds)\n", - "Cbc0010I After 17897000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1362.05 seconds)\n", - "Cbc0010I After 17898000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1362.09 seconds)\n", - "Cbc0010I After 17899000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1362.13 seconds)\n", - "Cbc0010I After 17900000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1362.16 seconds)\n", - "Cbc0010I After 17901000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1362.20 seconds)\n", - "Cbc0010I After 17902000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1362.24 seconds)\n", - "Cbc0010I After 17903000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1362.29 seconds)\n", - "Cbc0010I After 17904000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1362.32 seconds)\n", - "Cbc0010I After 17905000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1362.37 seconds)\n", - "Cbc0010I After 17906000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1362.42 seconds)\n", - "Cbc0010I After 17907000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1362.47 seconds)\n", - "Cbc0010I After 17908000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1362.53 seconds)\n", - "Cbc0010I After 17909000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1362.60 seconds)\n", - "Cbc0010I After 17910000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1362.65 seconds)\n", - "Cbc0010I After 17911000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1362.73 seconds)\n", - "Cbc0010I After 17912000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1362.80 seconds)\n", - "Cbc0010I After 17913000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1362.87 seconds)\n", - "Cbc0010I After 17914000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1362.94 seconds)\n", - "Cbc0010I After 17915000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1363.01 seconds)\n", - "Cbc0010I After 17916000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1363.08 seconds)\n", - "Cbc0010I After 17917000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1363.14 seconds)\n", - "Cbc0010I After 17918000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1363.19 seconds)\n", - "Cbc0010I After 17919000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1363.22 seconds)\n", - "Cbc0010I After 17920000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1363.25 seconds)\n", - "Cbc0010I After 17921000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1363.30 seconds)\n", - "Cbc0010I After 17922000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.37 seconds)\n", - "Cbc0010I After 17923000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1363.42 seconds)\n", - "Cbc0010I After 17924000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.47 seconds)\n", - "Cbc0010I After 17925000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1363.50 seconds)\n", - "Cbc0010I After 17926000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1363.56 seconds)\n", - "Cbc0010I After 17927000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1363.62 seconds)\n", - "Cbc0010I After 17928000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1363.66 seconds)\n", - "Cbc0010I After 17929000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1363.70 seconds)\n", - "Cbc0010I After 17930000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1363.74 seconds)\n", - "Cbc0010I After 17931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1363.78 seconds)\n", - "Cbc0010I After 17932000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1363.83 seconds)\n", - "Cbc0010I After 17933000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1363.86 seconds)\n", - "Cbc0010I After 17934000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1363.91 seconds)\n", - "Cbc0010I After 17935000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1363.96 seconds)\n", - "Cbc0010I After 17936000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1364.00 seconds)\n", - "Cbc0010I After 17937000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1364.06 seconds)\n", - "Cbc0010I After 17938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1364.11 seconds)\n", - "Cbc0010I After 17939000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1364.17 seconds)\n", - "Cbc0010I After 17940000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1364.25 seconds)\n", - "Cbc0010I After 17941000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1364.31 seconds)\n", - "Cbc0010I After 17942000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1364.36 seconds)\n", - "Cbc0010I After 17943000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1364.40 seconds)\n", - "Cbc0010I After 17944000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1364.44 seconds)\n", - "Cbc0010I After 17945000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1364.50 seconds)\n", - "Cbc0010I After 17946000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1364.53 seconds)\n", - "Cbc0010I After 17947000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1364.58 seconds)\n", - "Cbc0010I After 17948000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1364.62 seconds)\n", - "Cbc0010I After 17949000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1364.66 seconds)\n", - "Cbc0010I After 17950000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1364.75 seconds)\n", - "Cbc0010I After 17951000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1364.80 seconds)\n", - "Cbc0010I After 17952000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1364.85 seconds)\n", - "Cbc0010I After 17953000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1364.89 seconds)\n", - "Cbc0010I After 17954000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1364.93 seconds)\n", - "Cbc0010I After 17955000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1364.97 seconds)\n", - "Cbc0010I After 17956000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1365.00 seconds)\n", - "Cbc0010I After 17957000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1365.04 seconds)\n", - "Cbc0010I After 17958000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1365.09 seconds)\n", - "Cbc0010I After 17959000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1365.15 seconds)\n", - "Cbc0010I After 17960000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1365.21 seconds)\n", - "Cbc0010I After 17961000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1365.28 seconds)\n", - "Cbc0010I After 17962000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1365.35 seconds)\n", - "Cbc0010I After 17963000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.41 seconds)\n", - "Cbc0010I After 17964000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1365.48 seconds)\n", - "Cbc0010I After 17965000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1365.54 seconds)\n", - "Cbc0010I After 17966000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1365.58 seconds)\n", - "Cbc0010I After 17967000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1365.64 seconds)\n", - "Cbc0010I After 17968000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1365.71 seconds)\n", - "Cbc0010I After 17969000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.76 seconds)\n", - "Cbc0010I After 17970000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1365.82 seconds)\n", - "Cbc0010I After 17971000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1365.87 seconds)\n", - "Cbc0010I After 17972000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1365.90 seconds)\n", - "Cbc0010I After 17973000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1365.94 seconds)\n", - "Cbc0010I After 17974000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1365.98 seconds)\n", - "Cbc0010I After 17975000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1366.02 seconds)\n", - "Cbc0010I After 17976000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1366.08 seconds)\n", - "Cbc0010I After 17977000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1366.12 seconds)\n", - "Cbc0010I After 17978000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1366.16 seconds)\n", - "Cbc0010I After 17979000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1366.23 seconds)\n", - "Cbc0010I After 17980000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1366.29 seconds)\n", - "Cbc0010I After 17981000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1366.36 seconds)\n", - "Cbc0010I After 17982000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1366.43 seconds)\n", - "Cbc0010I After 17983000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1366.50 seconds)\n", - "Cbc0010I After 17984000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1366.56 seconds)\n", - "Cbc0010I After 17985000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1366.62 seconds)\n", - "Cbc0010I After 17986000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1366.67 seconds)\n", - "Cbc0010I After 17987000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1366.72 seconds)\n", - "Cbc0010I After 17988000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1366.79 seconds)\n", - "Cbc0010I After 17989000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1366.84 seconds)\n", - "Cbc0010I After 17990000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1366.88 seconds)\n", - "Cbc0010I After 17991000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1366.94 seconds)\n", - "Cbc0010I After 17992000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1366.99 seconds)\n", - "Cbc0010I After 17993000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1367.05 seconds)\n", - "Cbc0010I After 17994000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.11 seconds)\n", - "Cbc0010I After 17995000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1367.17 seconds)\n", - "Cbc0010I After 17996000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.24 seconds)\n", - "Cbc0010I After 17997000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.30 seconds)\n", - "Cbc0010I After 17998000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.35 seconds)\n", - "Cbc0010I After 17999000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1367.42 seconds)\n", - "Cbc0010I After 18000000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1367.47 seconds)\n", - "Cbc0010I After 18001000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1367.53 seconds)\n", - "Cbc0010I After 18002000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1367.58 seconds)\n", - "Cbc0010I After 18003000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1367.63 seconds)\n", - "Cbc0010I After 18004000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1367.68 seconds)\n", - "Cbc0010I After 18005000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1367.73 seconds)\n", - "Cbc0010I After 18006000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1367.80 seconds)\n", - "Cbc0010I After 18007000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1367.87 seconds)\n", - "Cbc0010I After 18008000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1367.92 seconds)\n", - "Cbc0010I After 18009000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1367.97 seconds)\n", - "Cbc0010I After 18010000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1368.04 seconds)\n", - "Cbc0010I After 18011000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1368.10 seconds)\n", - "Cbc0010I After 18012000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1368.15 seconds)\n", - "Cbc0010I After 18013000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1368.22 seconds)\n", - "Cbc0010I After 18014000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1368.29 seconds)\n", - "Cbc0010I After 18015000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1368.36 seconds)\n", - "Cbc0010I After 18016000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1368.43 seconds)\n", - "Cbc0010I After 18017000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1368.50 seconds)\n", - "Cbc0010I After 18018000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1368.54 seconds)\n", - "Cbc0010I After 18019000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1368.60 seconds)\n", - "Cbc0010I After 18020000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1368.64 seconds)\n", - "Cbc0010I After 18021000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1368.69 seconds)\n", - "Cbc0010I After 18022000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1368.76 seconds)\n", - "Cbc0010I After 18023000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1368.84 seconds)\n", - "Cbc0010I After 18024000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1368.91 seconds)\n", - "Cbc0010I After 18025000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1368.99 seconds)\n", - "Cbc0010I After 18026000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1369.06 seconds)\n", - "Cbc0010I After 18027000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1369.13 seconds)\n", - "Cbc0010I After 18028000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1369.18 seconds)\n", - "Cbc0010I After 18029000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1369.23 seconds)\n", - "Cbc0010I After 18030000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1369.29 seconds)\n", - "Cbc0010I After 18031000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1369.35 seconds)\n", - "Cbc0010I After 18032000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1369.44 seconds)\n", - "Cbc0010I After 18033000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1369.53 seconds)\n", - "Cbc0010I After 18034000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1369.59 seconds)\n", - "Cbc0010I After 18035000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1369.66 seconds)\n", - "Cbc0010I After 18036000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1369.72 seconds)\n", - "Cbc0010I After 18037000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1369.78 seconds)\n", - "Cbc0010I After 18038000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1369.84 seconds)\n", - "Cbc0010I After 18039000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1369.89 seconds)\n", - "Cbc0010I After 18040000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1369.96 seconds)\n", - "Cbc0010I After 18041000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1370.04 seconds)\n", - "Cbc0010I After 18042000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1370.12 seconds)\n", - "Cbc0010I After 18043000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1370.18 seconds)\n", - "Cbc0010I After 18044000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1370.25 seconds)\n", - "Cbc0010I After 18045000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.30 seconds)\n", - "Cbc0010I After 18046000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1370.36 seconds)\n", - "Cbc0010I After 18047000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1370.41 seconds)\n", - "Cbc0010I After 18048000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1370.47 seconds)\n", - "Cbc0010I After 18049000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1370.53 seconds)\n", - "Cbc0010I After 18050000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.59 seconds)\n", - "Cbc0010I After 18051000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1370.65 seconds)\n", - "Cbc0010I After 18052000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1370.72 seconds)\n", - "Cbc0010I After 18053000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1370.79 seconds)\n", - "Cbc0010I After 18054000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1370.86 seconds)\n", - "Cbc0010I After 18055000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1370.92 seconds)\n", - "Cbc0010I After 18056000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1371.00 seconds)\n", - "Cbc0010I After 18057000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1371.07 seconds)\n", - "Cbc0010I After 18058000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1371.15 seconds)\n", - "Cbc0010I After 18059000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1371.22 seconds)\n", - "Cbc0010I After 18060000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.30 seconds)\n", - "Cbc0010I After 18061000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1371.36 seconds)\n", - "Cbc0010I After 18062000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.42 seconds)\n", - "Cbc0010I After 18063000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1371.49 seconds)\n", - "Cbc0010I After 18064000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1371.53 seconds)\n", - "Cbc0010I After 18065000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1371.58 seconds)\n", - "Cbc0010I After 18066000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.64 seconds)\n", - "Cbc0010I After 18067000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1371.68 seconds)\n", - "Cbc0010I After 18068000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1371.73 seconds)\n", - "Cbc0010I After 18069000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1371.79 seconds)\n", - "Cbc0010I After 18070000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1371.85 seconds)\n", - "Cbc0010I After 18071000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1371.92 seconds)\n", - "Cbc0010I After 18072000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1371.99 seconds)\n", - "Cbc0010I After 18073000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.07 seconds)\n", - "Cbc0010I After 18074000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1372.16 seconds)\n", - "Cbc0010I After 18075000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1372.24 seconds)\n", - "Cbc0010I After 18076000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.32 seconds)\n", - "Cbc0010I After 18077000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1372.39 seconds)\n", - "Cbc0010I After 18078000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1372.47 seconds)\n", - "Cbc0010I After 18079000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1372.53 seconds)\n", - "Cbc0010I After 18080000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1372.58 seconds)\n", - "Cbc0010I After 18081000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1372.64 seconds)\n", - "Cbc0010I After 18082000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1372.69 seconds)\n", - "Cbc0010I After 18083000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1372.74 seconds)\n", - "Cbc0010I After 18084000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1372.79 seconds)\n", - "Cbc0010I After 18085000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1372.84 seconds)\n", - "Cbc0010I After 18086000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1372.88 seconds)\n", - "Cbc0010I After 18087000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1372.93 seconds)\n", - "Cbc0010I After 18088000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1372.97 seconds)\n", - "Cbc0010I After 18089000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1373.02 seconds)\n", - "Cbc0010I After 18090000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1373.08 seconds)\n", - "Cbc0010I After 18091000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1373.15 seconds)\n", - "Cbc0010I After 18092000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1373.21 seconds)\n", - "Cbc0010I After 18093000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1373.29 seconds)\n", - "Cbc0010I After 18094000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1373.35 seconds)\n", - "Cbc0010I After 18095000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1373.42 seconds)\n", - "Cbc0010I After 18096000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1373.48 seconds)\n", - "Cbc0010I After 18097000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1373.55 seconds)\n", - "Cbc0010I After 18098000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1373.62 seconds)\n", - "Cbc0010I After 18099000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1373.68 seconds)\n", - "Cbc0010I After 18100000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1373.74 seconds)\n", - "Cbc0010I After 18101000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1373.78 seconds)\n", - "Cbc0010I After 18102000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1373.83 seconds)\n", - "Cbc0010I After 18103000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1373.87 seconds)\n", - "Cbc0010I After 18104000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1373.92 seconds)\n", - "Cbc0010I After 18105000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1374.00 seconds)\n", - "Cbc0010I After 18106000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1374.07 seconds)\n", - "Cbc0010I After 18107000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1374.13 seconds)\n", - "Cbc0010I After 18108000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1374.18 seconds)\n", - "Cbc0010I After 18109000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1374.23 seconds)\n", - "Cbc0010I After 18110000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1374.29 seconds)\n", - "Cbc0010I After 18111000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1374.34 seconds)\n", - "Cbc0010I After 18112000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1374.40 seconds)\n", - "Cbc0010I After 18113000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.46 seconds)\n", - "Cbc0010I After 18114000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.52 seconds)\n", - "Cbc0010I After 18115000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1374.57 seconds)\n", - "Cbc0010I After 18116000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1374.63 seconds)\n", - "Cbc0010I After 18117000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1374.69 seconds)\n", - "Cbc0010I After 18118000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1374.75 seconds)\n", - "Cbc0010I After 18119000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1374.80 seconds)\n", - "Cbc0010I After 18120000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1374.86 seconds)\n", - "Cbc0010I After 18121000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1374.91 seconds)\n", - "Cbc0010I After 18122000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1374.97 seconds)\n", - "Cbc0010I After 18123000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1375.04 seconds)\n", - "Cbc0010I After 18124000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.10 seconds)\n", - "Cbc0010I After 18125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.16 seconds)\n", - "Cbc0010I After 18126000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1375.22 seconds)\n", - "Cbc0010I After 18127000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1375.28 seconds)\n", - "Cbc0010I After 18128000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1375.33 seconds)\n", - "Cbc0010I After 18129000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1375.40 seconds)\n", - "Cbc0010I After 18130000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1375.46 seconds)\n", - "Cbc0010I After 18131000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1375.52 seconds)\n", - "Cbc0010I After 18132000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1375.58 seconds)\n", - "Cbc0010I After 18133000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1375.64 seconds)\n", - "Cbc0010I After 18134000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1375.70 seconds)\n", - "Cbc0010I After 18135000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1375.75 seconds)\n", - "Cbc0010I After 18136000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1375.81 seconds)\n", - "Cbc0010I After 18137000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1375.87 seconds)\n", - "Cbc0010I After 18138000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1375.93 seconds)\n", - "Cbc0010I After 18139000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1376.00 seconds)\n", - "Cbc0010I After 18140000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1376.06 seconds)\n", - "Cbc0010I After 18141000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1376.11 seconds)\n", - "Cbc0010I After 18142000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.17 seconds)\n", - "Cbc0010I After 18143000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1376.23 seconds)\n", - "Cbc0010I After 18144000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.30 seconds)\n", - "Cbc0010I After 18145000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1376.35 seconds)\n", - "Cbc0010I After 18146000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.41 seconds)\n", - "Cbc0010I After 18147000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1376.47 seconds)\n", - "Cbc0010I After 18148000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.53 seconds)\n", - "Cbc0010I After 18149000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1376.60 seconds)\n", - "Cbc0010I After 18150000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1376.65 seconds)\n", - "Cbc0010I After 18151000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1376.71 seconds)\n", - "Cbc0010I After 18152000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1376.76 seconds)\n", - "Cbc0010I After 18153000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1376.81 seconds)\n", - "Cbc0010I After 18154000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1376.87 seconds)\n", - "Cbc0010I After 18155000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1376.91 seconds)\n", - "Cbc0010I After 18156000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1376.96 seconds)\n", - "Cbc0010I After 18157000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1377.02 seconds)\n", - "Cbc0010I After 18158000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1377.10 seconds)\n", - "Cbc0010I After 18159000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1377.16 seconds)\n", - "Cbc0010I After 18160000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1377.22 seconds)\n", - "Cbc0010I After 18161000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1377.28 seconds)\n", - "Cbc0010I After 18162000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1377.35 seconds)\n", - "Cbc0010I After 18163000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1377.41 seconds)\n", - "Cbc0010I After 18164000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1377.48 seconds)\n", - "Cbc0010I After 18165000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1377.53 seconds)\n", - "Cbc0010I After 18166000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1377.60 seconds)\n", - "Cbc0010I After 18167000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.66 seconds)\n", - "Cbc0010I After 18168000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.72 seconds)\n", - "Cbc0010I After 18169000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1377.78 seconds)\n", - "Cbc0010I After 18170000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1377.84 seconds)\n", - "Cbc0010I After 18171000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1377.89 seconds)\n", - "Cbc0010I After 18172000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1377.96 seconds)\n", - "Cbc0010I After 18173000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1378.02 seconds)\n", - "Cbc0010I After 18174000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1378.09 seconds)\n", - "Cbc0010I After 18175000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1378.15 seconds)\n", - "Cbc0010I After 18176000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1378.22 seconds)\n", - "Cbc0010I After 18177000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1378.28 seconds)\n", - "Cbc0010I After 18178000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1378.34 seconds)\n", - "Cbc0010I After 18179000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1378.40 seconds)\n", - "Cbc0010I After 18180000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.46 seconds)\n", - "Cbc0010I After 18181000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1378.51 seconds)\n", - "Cbc0010I After 18182000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1378.58 seconds)\n", - "Cbc0010I After 18183000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.63 seconds)\n", - "Cbc0010I After 18184000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1378.70 seconds)\n", - "Cbc0010I After 18185000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1378.76 seconds)\n", - "Cbc0010I After 18186000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1378.82 seconds)\n", - "Cbc0010I After 18187000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1378.88 seconds)\n", - "Cbc0010I After 18188000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1378.95 seconds)\n", - "Cbc0010I After 18189000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1379.00 seconds)\n", - "Cbc0010I After 18190000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1379.07 seconds)\n", - "Cbc0010I After 18191000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1379.13 seconds)\n", - "Cbc0010I After 18192000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1379.20 seconds)\n", - "Cbc0010I After 18193000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1379.26 seconds)\n", - "Cbc0010I After 18194000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1379.33 seconds)\n", - "Cbc0010I After 18195000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1379.39 seconds)\n", - "Cbc0010I After 18196000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1379.45 seconds)\n", - "Cbc0010I After 18197000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1379.51 seconds)\n", - "Cbc0010I After 18198000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1379.58 seconds)\n", - "Cbc0010I After 18199000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1379.65 seconds)\n", - "Cbc0010I After 18200000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1379.70 seconds)\n", - "Cbc0010I After 18201000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1379.77 seconds)\n", - "Cbc0010I After 18202000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1379.82 seconds)\n", - "Cbc0010I After 18203000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1379.90 seconds)\n", - "Cbc0010I After 18204000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1379.95 seconds)\n", - "Cbc0010I After 18205000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1380.02 seconds)\n", - "Cbc0010I After 18206000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1380.10 seconds)\n", - "Cbc0010I After 18207000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1380.15 seconds)\n", - "Cbc0010I After 18208000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1380.21 seconds)\n", - "Cbc0010I After 18209000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1380.28 seconds)\n", - "Cbc0010I After 18210000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1380.34 seconds)\n", - "Cbc0010I After 18211000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1380.42 seconds)\n", - "Cbc0010I After 18212000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1380.48 seconds)\n", - "Cbc0010I After 18213000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1380.55 seconds)\n", - "Cbc0010I After 18214000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1380.60 seconds)\n", - "Cbc0010I After 18215000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1380.67 seconds)\n", - "Cbc0010I After 18216000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1380.73 seconds)\n", - "Cbc0010I After 18217000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1380.79 seconds)\n", - "Cbc0010I After 18218000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1380.86 seconds)\n", - "Cbc0010I After 18219000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1380.93 seconds)\n", - "Cbc0010I After 18220000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1381.03 seconds)\n", - "Cbc0010I After 18221000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1381.10 seconds)\n", - "Cbc0010I After 18222000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1381.16 seconds)\n", - "Cbc0010I After 18223000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1381.22 seconds)\n", - "Cbc0010I After 18224000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1381.28 seconds)\n", - "Cbc0010I After 18225000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1381.35 seconds)\n", - "Cbc0010I After 18226000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1381.42 seconds)\n", - "Cbc0010I After 18227000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1381.47 seconds)\n", - "Cbc0010I After 18228000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1381.52 seconds)\n", - "Cbc0010I After 18229000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1381.59 seconds)\n", - "Cbc0010I After 18230000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1381.64 seconds)\n", - "Cbc0010I After 18231000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1381.70 seconds)\n", - "Cbc0010I After 18232000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1381.75 seconds)\n", - "Cbc0010I After 18233000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1381.82 seconds)\n", - "Cbc0010I After 18234000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1381.88 seconds)\n", - "Cbc0010I After 18235000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1381.94 seconds)\n", - "Cbc0010I After 18236000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1382.00 seconds)\n", - "Cbc0010I After 18237000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1382.07 seconds)\n", - "Cbc0010I After 18238000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1382.14 seconds)\n", - "Cbc0010I After 18239000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1382.19 seconds)\n", - "Cbc0010I After 18240000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1382.25 seconds)\n", - "Cbc0010I After 18241000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1382.32 seconds)\n", - "Cbc0010I After 18242000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1382.39 seconds)\n", - "Cbc0010I After 18243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1382.46 seconds)\n", - "Cbc0010I After 18244000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1382.56 seconds)\n", - "Cbc0010I After 18245000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1382.65 seconds)\n", - "Cbc0010I After 18246000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1382.71 seconds)\n", - "Cbc0010I After 18247000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1382.78 seconds)\n", - "Cbc0010I After 18248000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1382.84 seconds)\n", - "Cbc0010I After 18249000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1382.91 seconds)\n", - "Cbc0010I After 18250000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1382.97 seconds)\n", - "Cbc0010I After 18251000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1383.04 seconds)\n", - "Cbc0010I After 18252000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1383.10 seconds)\n", - "Cbc0010I After 18253000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1383.16 seconds)\n", - "Cbc0010I After 18254000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1383.22 seconds)\n", - "Cbc0010I After 18255000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1383.29 seconds)\n", - "Cbc0010I After 18256000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1383.34 seconds)\n", - "Cbc0010I After 18257000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1383.41 seconds)\n", - "Cbc0010I After 18258000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1383.46 seconds)\n", - "Cbc0010I After 18259000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1383.55 seconds)\n", - "Cbc0010I After 18260000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1383.61 seconds)\n", - "Cbc0010I After 18261000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1383.66 seconds)\n", - "Cbc0010I After 18262000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1383.73 seconds)\n", - "Cbc0010I After 18263000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1383.78 seconds)\n", - "Cbc0010I After 18264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1383.84 seconds)\n", - "Cbc0010I After 18265000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1383.92 seconds)\n", - "Cbc0010I After 18266000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1383.97 seconds)\n", - "Cbc0010I After 18267000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1384.03 seconds)\n", - "Cbc0010I After 18268000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1384.10 seconds)\n", - "Cbc0010I After 18269000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1384.15 seconds)\n", - "Cbc0010I After 18270000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1384.21 seconds)\n", - "Cbc0010I After 18271000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1384.27 seconds)\n", - "Cbc0010I After 18272000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1384.35 seconds)\n", - "Cbc0010I After 18273000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1384.41 seconds)\n", - "Cbc0010I After 18274000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1384.47 seconds)\n", - "Cbc0010I After 18275000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1384.53 seconds)\n", - "Cbc0010I After 18276000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1384.58 seconds)\n", - "Cbc0010I After 18277000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1384.65 seconds)\n", - "Cbc0010I After 18278000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1384.71 seconds)\n", - "Cbc0010I After 18279000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1384.77 seconds)\n", - "Cbc0010I After 18280000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1384.84 seconds)\n", - "Cbc0010I After 18281000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1384.89 seconds)\n", - "Cbc0010I After 18282000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1384.95 seconds)\n", - "Cbc0010I After 18283000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1385.02 seconds)\n", - "Cbc0010I After 18284000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1385.08 seconds)\n", - "Cbc0010I After 18285000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1385.15 seconds)\n", - "Cbc0010I After 18286000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1385.20 seconds)\n", - "Cbc0010I After 18287000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1385.28 seconds)\n", - "Cbc0010I After 18288000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1385.34 seconds)\n", - "Cbc0010I After 18289000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1385.39 seconds)\n", - "Cbc0010I After 18290000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1385.47 seconds)\n", - "Cbc0010I After 18291000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1385.53 seconds)\n", - "Cbc0010I After 18292000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.58 seconds)\n", - "Cbc0010I After 18293000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1385.65 seconds)\n", - "Cbc0010I After 18294000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.71 seconds)\n", - "Cbc0010I After 18295000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1385.76 seconds)\n", - "Cbc0010I After 18296000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1385.83 seconds)\n", - "Cbc0010I After 18297000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1385.90 seconds)\n", - "Cbc0010I After 18298000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1385.95 seconds)\n", - "Cbc0010I After 18299000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1386.01 seconds)\n", - "Cbc0010I After 18300000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1386.08 seconds)\n", - "Cbc0010I After 18301000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1386.13 seconds)\n", - "Cbc0010I After 18302000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1386.20 seconds)\n", - "Cbc0010I After 18303000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1386.27 seconds)\n", - "Cbc0010I After 18304000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1386.37 seconds)\n", - "Cbc0010I After 18305000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1386.45 seconds)\n", - "Cbc0010I After 18306000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1386.54 seconds)\n", - "Cbc0010I After 18307000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1386.60 seconds)\n", - "Cbc0010I After 18308000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1386.68 seconds)\n", - "Cbc0010I After 18309000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1386.76 seconds)\n", - "Cbc0010I After 18310000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1386.83 seconds)\n", - "Cbc0010I After 18311000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1386.91 seconds)\n", - "Cbc0010I After 18312000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1386.98 seconds)\n", - "Cbc0010I After 18313000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1387.05 seconds)\n", - "Cbc0010I After 18314000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1387.13 seconds)\n", - "Cbc0010I After 18315000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.21 seconds)\n", - "Cbc0010I After 18316000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1387.28 seconds)\n", - "Cbc0010I After 18317000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.35 seconds)\n", - "Cbc0010I After 18318000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1387.43 seconds)\n", - "Cbc0010I After 18319000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1387.51 seconds)\n", - "Cbc0010I After 18320000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.59 seconds)\n", - "Cbc0010I After 18321000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1387.66 seconds)\n", - "Cbc0010I After 18322000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1387.74 seconds)\n", - "Cbc0010I After 18323000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1387.81 seconds)\n", - "Cbc0010I After 18324000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1387.89 seconds)\n", - "Cbc0010I After 18325000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1387.97 seconds)\n", - "Cbc0010I After 18326000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1388.04 seconds)\n", - "Cbc0010I After 18327000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1388.12 seconds)\n", - "Cbc0010I After 18328000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1388.20 seconds)\n", - "Cbc0010I After 18329000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1388.27 seconds)\n", - "Cbc0010I After 18330000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1388.35 seconds)\n", - "Cbc0010I After 18331000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1388.42 seconds)\n", - "Cbc0010I After 18332000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1388.50 seconds)\n", - "Cbc0010I After 18333000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1388.59 seconds)\n", - "Cbc0010I After 18334000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1388.66 seconds)\n", - "Cbc0010I After 18335000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1388.74 seconds)\n", - "Cbc0010I After 18336000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1388.79 seconds)\n", - "Cbc0010I After 18337000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1388.85 seconds)\n", - "Cbc0010I After 18338000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1388.90 seconds)\n", - "Cbc0010I After 18339000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1388.94 seconds)\n", - "Cbc0010I After 18340000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1388.98 seconds)\n", - "Cbc0010I After 18341000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1389.02 seconds)\n", - "Cbc0010I After 18342000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1389.07 seconds)\n", - "Cbc0010I After 18343000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1389.13 seconds)\n", - "Cbc0010I After 18344000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1389.19 seconds)\n", - "Cbc0010I After 18345000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1389.24 seconds)\n", - "Cbc0010I After 18346000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.29 seconds)\n", - "Cbc0010I After 18347000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1389.34 seconds)\n", - "Cbc0010I After 18348000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1389.39 seconds)\n", - "Cbc0010I After 18349000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1389.44 seconds)\n", - "Cbc0010I After 18350000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.50 seconds)\n", - "Cbc0010I After 18351000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.55 seconds)\n", - "Cbc0010I After 18352000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1389.60 seconds)\n", - "Cbc0010I After 18353000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1389.64 seconds)\n", - "Cbc0010I After 18354000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1389.69 seconds)\n", - "Cbc0010I After 18355000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1389.74 seconds)\n", - "Cbc0010I After 18356000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1389.78 seconds)\n", - "Cbc0010I After 18357000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.83 seconds)\n", - "Cbc0010I After 18358000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1389.88 seconds)\n", - "Cbc0010I After 18359000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1389.93 seconds)\n", - "Cbc0010I After 18360000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1389.98 seconds)\n", - "Cbc0010I After 18361000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1390.03 seconds)\n", - "Cbc0010I After 18362000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1390.08 seconds)\n", - "Cbc0010I After 18363000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1390.13 seconds)\n", - "Cbc0010I After 18364000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1390.18 seconds)\n", - "Cbc0010I After 18365000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1390.25 seconds)\n", - "Cbc0010I After 18366000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1390.30 seconds)\n", - "Cbc0010I After 18367000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1390.38 seconds)\n", - "Cbc0010I After 18368000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1390.44 seconds)\n", - "Cbc0010I After 18369000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1390.50 seconds)\n", - "Cbc0010I After 18370000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1390.57 seconds)\n", - "Cbc0010I After 18371000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1390.64 seconds)\n", - "Cbc0010I After 18372000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1390.71 seconds)\n", - "Cbc0010I After 18373000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1390.77 seconds)\n", - "Cbc0010I After 18374000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1390.84 seconds)\n", - "Cbc0010I After 18375000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1390.92 seconds)\n", - "Cbc0010I After 18376000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1390.98 seconds)\n", - "Cbc0010I After 18377000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1391.05 seconds)\n", - "Cbc0010I After 18378000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1391.11 seconds)\n", - "Cbc0010I After 18379000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1391.17 seconds)\n", - "Cbc0010I After 18380000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1391.24 seconds)\n", - "Cbc0010I After 18381000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1391.30 seconds)\n", - "Cbc0010I After 18382000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1391.36 seconds)\n", - "Cbc0010I After 18383000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1391.44 seconds)\n", - "Cbc0010I After 18384000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1391.50 seconds)\n", - "Cbc0010I After 18385000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1391.56 seconds)\n", - "Cbc0010I After 18386000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1391.64 seconds)\n", - "Cbc0010I After 18387000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1391.69 seconds)\n", - "Cbc0010I After 18388000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1391.78 seconds)\n", - "Cbc0010I After 18389000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1391.85 seconds)\n", - "Cbc0010I After 18390000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1391.92 seconds)\n", - "Cbc0010I After 18391000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1391.97 seconds)\n", - "Cbc0010I After 18392000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1392.04 seconds)\n", - "Cbc0010I After 18393000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1392.09 seconds)\n", - "Cbc0010I After 18394000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1392.15 seconds)\n", - "Cbc0010I After 18395000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1392.21 seconds)\n", - "Cbc0010I After 18396000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1392.27 seconds)\n", - "Cbc0010I After 18397000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1392.34 seconds)\n", - "Cbc0010I After 18398000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.40 seconds)\n", - "Cbc0010I After 18399000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1392.46 seconds)\n", - "Cbc0010I After 18400000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.54 seconds)\n", - "Cbc0010I After 18401000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1392.60 seconds)\n", - "Cbc0010I After 18402000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1392.66 seconds)\n", - "Cbc0010I After 18403000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1392.74 seconds)\n", - "Cbc0010I After 18404000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1392.79 seconds)\n", - "Cbc0010I After 18405000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1392.86 seconds)\n", - "Cbc0010I After 18406000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1392.92 seconds)\n", - "Cbc0010I After 18407000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1392.99 seconds)\n", - "Cbc0010I After 18408000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1393.07 seconds)\n", - "Cbc0010I After 18409000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1393.12 seconds)\n", - "Cbc0010I After 18410000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1393.17 seconds)\n", - "Cbc0010I After 18411000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1393.24 seconds)\n", - "Cbc0010I After 18412000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1393.32 seconds)\n", - "Cbc0010I After 18413000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1393.37 seconds)\n", - "Cbc0010I After 18414000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1393.44 seconds)\n", - "Cbc0010I After 18415000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1393.49 seconds)\n", - "Cbc0010I After 18416000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1393.55 seconds)\n", - "Cbc0010I After 18417000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1393.60 seconds)\n", - "Cbc0010I After 18418000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1393.64 seconds)\n", - "Cbc0010I After 18419000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1393.70 seconds)\n", - "Cbc0010I After 18420000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1393.75 seconds)\n", - "Cbc0010I After 18421000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1393.81 seconds)\n", - "Cbc0010I After 18422000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1393.89 seconds)\n", - "Cbc0010I After 18423000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1393.96 seconds)\n", - "Cbc0010I After 18424000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1394.04 seconds)\n", - "Cbc0010I After 18425000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1394.11 seconds)\n", - "Cbc0010I After 18426000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1394.17 seconds)\n", - "Cbc0010I After 18427000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1394.25 seconds)\n", - "Cbc0010I After 18428000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1394.30 seconds)\n", - "Cbc0010I After 18429000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1394.37 seconds)\n", - "Cbc0010I After 18430000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1394.43 seconds)\n", - "Cbc0010I After 18431000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1394.49 seconds)\n", - "Cbc0010I After 18432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1394.56 seconds)\n", - "Cbc0010I After 18433000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1394.62 seconds)\n", - "Cbc0010I After 18434000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1394.67 seconds)\n", - "Cbc0010I After 18435000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1394.75 seconds)\n", - "Cbc0010I After 18436000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1394.81 seconds)\n", - "Cbc0010I After 18437000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1394.86 seconds)\n", - "Cbc0010I After 18438000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1394.93 seconds)\n", - "Cbc0010I After 18439000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1395.00 seconds)\n", - "Cbc0010I After 18440000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1395.05 seconds)\n", - "Cbc0010I After 18441000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1395.14 seconds)\n", - "Cbc0010I After 18442000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1395.21 seconds)\n", - "Cbc0010I After 18443000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1395.26 seconds)\n", - "Cbc0010I After 18444000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1395.34 seconds)\n", - "Cbc0010I After 18445000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1395.42 seconds)\n", - "Cbc0010I After 18446000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1395.47 seconds)\n", - "Cbc0010I After 18447000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1395.54 seconds)\n", - "Cbc0010I After 18448000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1395.61 seconds)\n", - "Cbc0010I After 18449000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1395.66 seconds)\n", - "Cbc0010I After 18450000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1395.72 seconds)\n", - "Cbc0010I After 18451000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1395.78 seconds)\n", - "Cbc0010I After 18452000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1395.85 seconds)\n", - "Cbc0010I After 18453000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1395.92 seconds)\n", - "Cbc0010I After 18454000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1396.02 seconds)\n", - "Cbc0010I After 18455000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1396.10 seconds)\n", - "Cbc0010I After 18456000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1396.18 seconds)\n", - "Cbc0010I After 18457000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1396.23 seconds)\n", - "Cbc0010I After 18458000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1396.30 seconds)\n", - "Cbc0010I After 18459000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1396.38 seconds)\n", - "Cbc0010I After 18460000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1396.46 seconds)\n", - "Cbc0010I After 18461000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1396.53 seconds)\n", - "Cbc0010I After 18462000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1396.59 seconds)\n", - "Cbc0010I After 18463000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1396.66 seconds)\n", - "Cbc0010I After 18464000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1396.73 seconds)\n", - "Cbc0010I After 18465000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1396.80 seconds)\n", - "Cbc0010I After 18466000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1396.86 seconds)\n", - "Cbc0010I After 18467000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1396.94 seconds)\n", - "Cbc0010I After 18468000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1397.01 seconds)\n", - "Cbc0010I After 18469000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1397.08 seconds)\n", - "Cbc0010I After 18470000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1397.15 seconds)\n", - "Cbc0010I After 18471000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1397.22 seconds)\n", - "Cbc0010I After 18472000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1397.29 seconds)\n", - "Cbc0010I After 18473000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1397.37 seconds)\n", - "Cbc0010I After 18474000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1397.46 seconds)\n", - "Cbc0010I After 18475000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1397.52 seconds)\n", - "Cbc0010I After 18476000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1397.59 seconds)\n", - "Cbc0010I After 18477000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1397.66 seconds)\n", - "Cbc0010I After 18478000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1397.74 seconds)\n", - "Cbc0010I After 18479000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1397.82 seconds)\n", - "Cbc0010I After 18480000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1397.89 seconds)\n", - "Cbc0010I After 18481000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1397.97 seconds)\n", - "Cbc0010I After 18482000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1398.04 seconds)\n", - "Cbc0010I After 18483000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1398.10 seconds)\n", - "Cbc0010I After 18484000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1398.18 seconds)\n", - "Cbc0010I After 18485000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1398.26 seconds)\n", - "Cbc0010I After 18486000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1398.34 seconds)\n", - "Cbc0010I After 18487000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1398.40 seconds)\n", - "Cbc0010I After 18488000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1398.47 seconds)\n", - "Cbc0010I After 18489000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1398.54 seconds)\n", - "Cbc0010I After 18490000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1398.61 seconds)\n", - "Cbc0010I After 18491000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1398.68 seconds)\n", - "Cbc0010I After 18492000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1398.77 seconds)\n", - "Cbc0010I After 18493000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1398.84 seconds)\n", - "Cbc0010I After 18494000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1398.92 seconds)\n", - "Cbc0010I After 18495000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1398.99 seconds)\n", - "Cbc0010I After 18496000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1399.07 seconds)\n", - "Cbc0010I After 18497000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1399.15 seconds)\n", - "Cbc0010I After 18498000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1399.23 seconds)\n", - "Cbc0010I After 18499000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1399.30 seconds)\n", - "Cbc0010I After 18500000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1399.37 seconds)\n", - "Cbc0010I After 18501000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1399.44 seconds)\n", - "Cbc0010I After 18502000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1399.52 seconds)\n", - "Cbc0010I After 18503000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1399.59 seconds)\n", - "Cbc0010I After 18504000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1399.66 seconds)\n", - "Cbc0010I After 18505000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1399.72 seconds)\n", - "Cbc0010I After 18506000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1399.79 seconds)\n", - "Cbc0010I After 18507000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1399.86 seconds)\n", - "Cbc0010I After 18508000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1399.93 seconds)\n", - "Cbc0010I After 18509000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1400.01 seconds)\n", - "Cbc0010I After 18510000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1400.07 seconds)\n", - "Cbc0010I After 18511000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1400.13 seconds)\n", - "Cbc0010I After 18512000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1400.19 seconds)\n", - "Cbc0010I After 18513000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1400.25 seconds)\n", - "Cbc0010I After 18514000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1400.32 seconds)\n", - "Cbc0010I After 18515000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1400.38 seconds)\n", - "Cbc0010I After 18516000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1400.45 seconds)\n", - "Cbc0010I After 18517000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1400.51 seconds)\n", - "Cbc0010I After 18518000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1400.58 seconds)\n", - "Cbc0010I After 18519000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1400.63 seconds)\n", - "Cbc0010I After 18520000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1400.70 seconds)\n", - "Cbc0010I After 18521000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1400.77 seconds)\n", - "Cbc0010I After 18522000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1400.82 seconds)\n", - "Cbc0010I After 18523000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1400.88 seconds)\n", - "Cbc0010I After 18524000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1400.95 seconds)\n", - "Cbc0010I After 18525000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1401.01 seconds)\n", - "Cbc0010I After 18526000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1401.08 seconds)\n", - "Cbc0010I After 18527000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1401.15 seconds)\n", - "Cbc0010I After 18528000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1401.22 seconds)\n", - "Cbc0010I After 18529000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1401.28 seconds)\n", - "Cbc0010I After 18530000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1401.35 seconds)\n", - "Cbc0010I After 18531000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1401.40 seconds)\n", - "Cbc0010I After 18532000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1401.46 seconds)\n", - "Cbc0010I After 18533000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1401.51 seconds)\n", - "Cbc0010I After 18534000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1401.56 seconds)\n", - "Cbc0010I After 18535000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1401.62 seconds)\n", - "Cbc0010I After 18536000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1401.67 seconds)\n", - "Cbc0010I After 18537000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1401.72 seconds)\n", - "Cbc0010I After 18538000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1401.77 seconds)\n", - "Cbc0010I After 18539000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1401.82 seconds)\n", - "Cbc0010I After 18540000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1401.90 seconds)\n", - "Cbc0010I After 18541000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1401.96 seconds)\n", - "Cbc0010I After 18542000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.02 seconds)\n", - "Cbc0010I After 18543000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.09 seconds)\n", - "Cbc0010I After 18544000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1402.14 seconds)\n", - "Cbc0010I After 18545000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1402.21 seconds)\n", - "Cbc0010I After 18546000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1402.28 seconds)\n", - "Cbc0010I After 18547000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1402.33 seconds)\n", - "Cbc0010I After 18548000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1402.40 seconds)\n", - "Cbc0010I After 18549000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1402.47 seconds)\n", - "Cbc0010I After 18550000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1402.54 seconds)\n", - "Cbc0010I After 18551000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1402.65 seconds)\n", - "Cbc0010I After 18552000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1402.74 seconds)\n", - "Cbc0010I After 18553000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1402.82 seconds)\n", - "Cbc0010I After 18554000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1402.90 seconds)\n", - "Cbc0010I After 18555000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1402.97 seconds)\n", - "Cbc0010I After 18556000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1403.05 seconds)\n", - "Cbc0010I After 18557000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1403.13 seconds)\n", - "Cbc0010I After 18558000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1403.21 seconds)\n", - "Cbc0010I After 18559000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1403.29 seconds)\n", - "Cbc0010I After 18560000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1403.37 seconds)\n", - "Cbc0010I After 18561000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1403.44 seconds)\n", - "Cbc0010I After 18562000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1403.51 seconds)\n", - "Cbc0010I After 18563000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1403.58 seconds)\n", - "Cbc0010I After 18564000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1403.66 seconds)\n", - "Cbc0010I After 18565000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1403.73 seconds)\n", - "Cbc0010I After 18566000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1403.81 seconds)\n", - "Cbc0010I After 18567000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1403.87 seconds)\n", - "Cbc0010I After 18568000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1403.94 seconds)\n", - "Cbc0010I After 18569000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.01 seconds)\n", - "Cbc0010I After 18570000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1404.07 seconds)\n", - "Cbc0010I After 18571000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1404.14 seconds)\n", - "Cbc0010I After 18572000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1404.22 seconds)\n", - "Cbc0010I After 18573000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1404.30 seconds)\n", - "Cbc0010I After 18574000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1404.39 seconds)\n", - "Cbc0010I After 18575000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.50 seconds)\n", - "Cbc0010I After 18576000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1404.59 seconds)\n", - "Cbc0010I After 18577000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1404.67 seconds)\n", - "Cbc0010I After 18578000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1404.76 seconds)\n", - "Cbc0010I After 18579000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1404.84 seconds)\n", - "Cbc0010I After 18580000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1404.92 seconds)\n", - "Cbc0010I After 18581000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1405.01 seconds)\n", - "Cbc0010I After 18582000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1405.08 seconds)\n", - "Cbc0010I After 18583000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1405.16 seconds)\n", - "Cbc0010I After 18584000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1405.24 seconds)\n", - "Cbc0010I After 18585000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1405.32 seconds)\n", - "Cbc0010I After 18586000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1405.40 seconds)\n", - "Cbc0010I After 18587000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.47 seconds)\n", - "Cbc0010I After 18588000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1405.55 seconds)\n", - "Cbc0010I After 18589000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.63 seconds)\n", - "Cbc0010I After 18590000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1405.70 seconds)\n", - "Cbc0010I After 18591000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1405.77 seconds)\n", - "Cbc0010I After 18592000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1405.83 seconds)\n", - "Cbc0010I After 18593000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1405.90 seconds)\n", - "Cbc0010I After 18594000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1405.97 seconds)\n", - "Cbc0010I After 18595000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1406.04 seconds)\n", - "Cbc0010I After 18596000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1406.12 seconds)\n", - "Cbc0010I After 18597000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1406.19 seconds)\n", - "Cbc0010I After 18598000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1406.25 seconds)\n", - "Cbc0010I After 18599000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1406.33 seconds)\n", - "Cbc0010I After 18600000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1406.40 seconds)\n", - "Cbc0010I After 18601000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1406.47 seconds)\n", - "Cbc0010I After 18602000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1406.54 seconds)\n", - "Cbc0010I After 18603000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1406.61 seconds)\n", - "Cbc0010I After 18604000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1406.68 seconds)\n", - "Cbc0010I After 18605000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1406.74 seconds)\n", - "Cbc0010I After 18606000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1406.81 seconds)\n", - "Cbc0010I After 18607000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1406.86 seconds)\n", - "Cbc0010I After 18608000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1406.92 seconds)\n", - "Cbc0010I After 18609000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1406.99 seconds)\n", - "Cbc0010I After 18610000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1407.05 seconds)\n", - "Cbc0010I After 18611000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1407.11 seconds)\n", - "Cbc0010I After 18612000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.16 seconds)\n", - "Cbc0010I After 18613000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1407.21 seconds)\n", - "Cbc0010I After 18614000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1407.27 seconds)\n", - "Cbc0010I After 18615000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.34 seconds)\n", - "Cbc0010I After 18616000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1407.40 seconds)\n", - "Cbc0010I After 18617000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1407.48 seconds)\n", - "Cbc0010I After 18618000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1407.56 seconds)\n", - "Cbc0010I After 18619000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1407.65 seconds)\n", - "Cbc0010I After 18620000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1407.72 seconds)\n", - "Cbc0010I After 18621000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1407.79 seconds)\n", - "Cbc0010I After 18622000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1407.85 seconds)\n", - "Cbc0010I After 18623000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1407.91 seconds)\n", - "Cbc0010I After 18624000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1407.96 seconds)\n", - "Cbc0010I After 18625000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1408.03 seconds)\n", - "Cbc0010I After 18626000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.09 seconds)\n", - "Cbc0010I After 18627000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1408.16 seconds)\n", - "Cbc0010I After 18628000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.22 seconds)\n", - "Cbc0010I After 18629000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1408.27 seconds)\n", - "Cbc0010I After 18630000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1408.30 seconds)\n", - "Cbc0010I After 18631000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1408.34 seconds)\n", - "Cbc0010I After 18632000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1408.41 seconds)\n", - "Cbc0010I After 18633000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1408.47 seconds)\n", - "Cbc0010I After 18634000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1408.51 seconds)\n", - "Cbc0010I After 18635000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1408.55 seconds)\n", - "Cbc0010I After 18636000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1408.63 seconds)\n", - "Cbc0010I After 18637000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1408.69 seconds)\n", - "Cbc0010I After 18638000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1408.74 seconds)\n", - "Cbc0010I After 18639000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1408.78 seconds)\n", - "Cbc0010I After 18640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1408.82 seconds)\n", - "Cbc0010I After 18641000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1408.89 seconds)\n", - "Cbc0010I After 18642000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1408.95 seconds)\n", - "Cbc0010I After 18643000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1409.01 seconds)\n", - "Cbc0010I After 18644000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1409.07 seconds)\n", - "Cbc0010I After 18645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.14 seconds)\n", - "Cbc0010I After 18646000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.20 seconds)\n", - "Cbc0010I After 18647000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1409.28 seconds)\n", - "Cbc0010I After 18648000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1409.33 seconds)\n", - "Cbc0010I After 18649000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1409.40 seconds)\n", - "Cbc0010I After 18650000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1409.46 seconds)\n", - "Cbc0010I After 18651000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1409.51 seconds)\n", - "Cbc0010I After 18652000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1409.58 seconds)\n", - "Cbc0010I After 18653000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1409.64 seconds)\n", - "Cbc0010I After 18654000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1409.71 seconds)\n", - "Cbc0010I After 18655000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1409.77 seconds)\n", - "Cbc0010I After 18656000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1409.82 seconds)\n", - "Cbc0010I After 18657000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1409.90 seconds)\n", - "Cbc0010I After 18658000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1409.95 seconds)\n", - "Cbc0010I After 18659000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1410.00 seconds)\n", - "Cbc0010I After 18660000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1410.08 seconds)\n", - "Cbc0010I After 18661000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1410.15 seconds)\n", - "Cbc0010I After 18662000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1410.26 seconds)\n", - "Cbc0010I After 18663000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1410.34 seconds)\n", - "Cbc0010I After 18664000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1410.40 seconds)\n", - "Cbc0010I After 18665000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1410.46 seconds)\n", - "Cbc0010I After 18666000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1410.54 seconds)\n", - "Cbc0010I After 18667000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1410.60 seconds)\n", - "Cbc0010I After 18668000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1410.65 seconds)\n", - "Cbc0010I After 18669000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1410.71 seconds)\n", - "Cbc0010I After 18670000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1410.78 seconds)\n", - "Cbc0010I After 18671000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1410.83 seconds)\n", - "Cbc0010I After 18672000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1410.88 seconds)\n", - "Cbc0010I After 18673000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1410.96 seconds)\n", - "Cbc0010I After 18674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1411.03 seconds)\n", - "Cbc0010I After 18675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1411.07 seconds)\n", - "Cbc0010I After 18676000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1411.13 seconds)\n", - "Cbc0010I After 18677000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1411.21 seconds)\n", - "Cbc0010I After 18678000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1411.26 seconds)\n", - "Cbc0010I After 18679000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1411.32 seconds)\n", - "Cbc0010I After 18680000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1411.39 seconds)\n", - "Cbc0010I After 18681000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1411.44 seconds)\n", - "Cbc0010I After 18682000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1411.49 seconds)\n", - "Cbc0010I After 18683000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1411.54 seconds)\n", - "Cbc0010I After 18684000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1411.61 seconds)\n", - "Cbc0010I After 18685000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1411.67 seconds)\n", - "Cbc0010I After 18686000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1411.71 seconds)\n", - "Cbc0010I After 18687000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1411.76 seconds)\n", - "Cbc0010I After 18688000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1411.83 seconds)\n", - "Cbc0010I After 18689000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1411.90 seconds)\n", - "Cbc0010I After 18690000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1411.95 seconds)\n", - "Cbc0010I After 18691000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1412.00 seconds)\n", - "Cbc0010I After 18692000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1412.04 seconds)\n", - "Cbc0010I After 18693000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1412.11 seconds)\n", - "Cbc0010I After 18694000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.17 seconds)\n", - "Cbc0010I After 18695000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1412.23 seconds)\n", - "Cbc0010I After 18696000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1412.28 seconds)\n", - "Cbc0010I After 18697000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1412.33 seconds)\n", - "Cbc0010I After 18698000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.40 seconds)\n", - "Cbc0010I After 18699000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.46 seconds)\n", - "Cbc0010I After 18700000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1412.51 seconds)\n", - "Cbc0010I After 18701000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1412.59 seconds)\n", - "Cbc0010I After 18702000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1412.67 seconds)\n", - "Cbc0010I After 18703000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.72 seconds)\n", - "Cbc0010I After 18704000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1412.77 seconds)\n", - "Cbc0010I After 18705000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1412.85 seconds)\n", - "Cbc0010I After 18706000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1412.92 seconds)\n", - "Cbc0010I After 18707000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1413.00 seconds)\n", - "Cbc0010I After 18708000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.06 seconds)\n", - "Cbc0010I After 18709000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.13 seconds)\n", - "Cbc0010I After 18710000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1413.19 seconds)\n", - "Cbc0010I After 18711000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1413.24 seconds)\n", - "Cbc0010I After 18712000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1413.29 seconds)\n", - "Cbc0010I After 18713000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1413.36 seconds)\n", - "Cbc0010I After 18714000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1413.45 seconds)\n", - "Cbc0010I After 18715000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1413.51 seconds)\n", - "Cbc0010I After 18716000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1413.60 seconds)\n", - "Cbc0010I After 18717000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1413.66 seconds)\n", - "Cbc0010I After 18718000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1413.71 seconds)\n", - "Cbc0010I After 18719000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1413.79 seconds)\n", - "Cbc0010I After 18720000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1413.84 seconds)\n", - "Cbc0010I After 18721000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1413.91 seconds)\n", - "Cbc0010I After 18722000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1413.98 seconds)\n", - "Cbc0010I After 18723000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1414.03 seconds)\n", - "Cbc0010I After 18724000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1414.10 seconds)\n", - "Cbc0010I After 18725000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1414.17 seconds)\n", - "Cbc0010I After 18726000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1414.22 seconds)\n", - "Cbc0010I After 18727000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1414.27 seconds)\n", - "Cbc0010I After 18728000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1414.34 seconds)\n", - "Cbc0010I After 18729000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1414.40 seconds)\n", - "Cbc0010I After 18730000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1414.44 seconds)\n", - "Cbc0010I After 18731000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1414.51 seconds)\n", - "Cbc0010I After 18732000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1414.58 seconds)\n", - "Cbc0010I After 18733000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1414.63 seconds)\n", - "Cbc0010I After 18734000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1414.70 seconds)\n", - "Cbc0010I After 18735000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1414.78 seconds)\n", - "Cbc0010I After 18736000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1414.83 seconds)\n", - "Cbc0010I After 18737000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1414.90 seconds)\n", - "Cbc0010I After 18738000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1414.98 seconds)\n", - "Cbc0010I After 18739000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1415.04 seconds)\n", - "Cbc0010I After 18740000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1415.09 seconds)\n", - "Cbc0010I After 18741000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1415.16 seconds)\n", - "Cbc0010I After 18742000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1415.22 seconds)\n", - "Cbc0010I After 18743000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1415.27 seconds)\n", - "Cbc0010I After 18744000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1415.32 seconds)\n", - "Cbc0010I After 18745000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1415.38 seconds)\n", - "Cbc0010I After 18746000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1415.43 seconds)\n", - "Cbc0010I After 18747000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1415.50 seconds)\n", - "Cbc0010I After 18748000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1415.57 seconds)\n", - "Cbc0010I After 18749000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1415.62 seconds)\n", - "Cbc0010I After 18750000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1415.70 seconds)\n", - "Cbc0010I After 18751000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1415.77 seconds)\n", - "Cbc0010I After 18752000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1415.83 seconds)\n", - "Cbc0010I After 18753000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1415.89 seconds)\n", - "Cbc0010I After 18754000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1415.96 seconds)\n", - "Cbc0010I After 18755000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1416.01 seconds)\n", - "Cbc0010I After 18756000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1416.09 seconds)\n", - "Cbc0010I After 18757000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1416.16 seconds)\n", - "Cbc0010I After 18758000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1416.21 seconds)\n", - "Cbc0010I After 18759000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1416.28 seconds)\n", - "Cbc0010I After 18760000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1416.35 seconds)\n", - "Cbc0010I After 18761000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1416.40 seconds)\n", - "Cbc0010I After 18762000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1416.47 seconds)\n", - "Cbc0010I After 18763000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1416.53 seconds)\n", - "Cbc0010I After 18764000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1416.58 seconds)\n", - "Cbc0010I After 18765000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1416.64 seconds)\n", - "Cbc0010I After 18766000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1416.71 seconds)\n", - "Cbc0010I After 18767000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1416.76 seconds)\n", - "Cbc0010I After 18768000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1416.82 seconds)\n", - "Cbc0010I After 18769000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1416.91 seconds)\n", - "Cbc0010I After 18770000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1416.96 seconds)\n", - "Cbc0010I After 18771000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1417.01 seconds)\n", - "Cbc0010I After 18772000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1417.07 seconds)\n", - "Cbc0010I After 18773000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1417.15 seconds)\n", - "Cbc0010I After 18774000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1417.20 seconds)\n", - "Cbc0010I After 18775000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1417.25 seconds)\n", - "Cbc0010I After 18776000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1417.31 seconds)\n", - "Cbc0010I After 18777000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1417.38 seconds)\n", - "Cbc0010I After 18778000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1417.44 seconds)\n", - "Cbc0010I After 18779000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1417.49 seconds)\n", - "Cbc0010I After 18780000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1417.56 seconds)\n", - "Cbc0010I After 18781000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1417.63 seconds)\n", - "Cbc0010I After 18782000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1417.68 seconds)\n", - "Cbc0010I After 18783000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1417.73 seconds)\n", - "Cbc0010I After 18784000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1417.80 seconds)\n", - "Cbc0010I After 18785000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1417.90 seconds)\n", - "Cbc0010I After 18786000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1417.98 seconds)\n", - "Cbc0010I After 18787000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1418.04 seconds)\n", - "Cbc0010I After 18788000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1418.11 seconds)\n", - "Cbc0010I After 18789000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1418.18 seconds)\n", - "Cbc0010I After 18790000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1418.23 seconds)\n", - "Cbc0010I After 18791000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1418.30 seconds)\n", - "Cbc0010I After 18792000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1418.38 seconds)\n", - "Cbc0010I After 18793000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1418.44 seconds)\n", - "Cbc0010I After 18794000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1418.50 seconds)\n", - "Cbc0010I After 18795000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1418.57 seconds)\n", - "Cbc0010I After 18796000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1418.63 seconds)\n", - "Cbc0010I After 18797000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1418.68 seconds)\n", - "Cbc0010I After 18798000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1418.74 seconds)\n", - "Cbc0010I After 18799000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1418.82 seconds)\n", - "Cbc0010I After 18800000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1418.89 seconds)\n", - "Cbc0010I After 18801000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1418.97 seconds)\n", - "Cbc0010I After 18802000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1419.03 seconds)\n", - "Cbc0010I After 18803000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.10 seconds)\n", - "Cbc0010I After 18804000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1419.17 seconds)\n", - "Cbc0010I After 18805000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1419.24 seconds)\n", - "Cbc0010I After 18806000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1419.32 seconds)\n", - "Cbc0010I After 18807000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1419.39 seconds)\n", - "Cbc0010I After 18808000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1419.46 seconds)\n", - "Cbc0010I After 18809000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1419.54 seconds)\n", - "Cbc0010I After 18810000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1419.61 seconds)\n", - "Cbc0010I After 18811000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.69 seconds)\n", - "Cbc0010I After 18812000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1419.76 seconds)\n", - "Cbc0010I After 18813000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.84 seconds)\n", - "Cbc0010I After 18814000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1419.92 seconds)\n", - "Cbc0010I After 18815000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1419.99 seconds)\n", - "Cbc0010I After 18816000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1420.07 seconds)\n", - "Cbc0010I After 18817000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1420.15 seconds)\n", - "Cbc0010I After 18818000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1420.22 seconds)\n", - "Cbc0010I After 18819000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1420.30 seconds)\n", - "Cbc0010I After 18820000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1420.38 seconds)\n", - "Cbc0010I After 18821000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1420.45 seconds)\n", - "Cbc0010I After 18822000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1420.53 seconds)\n", - "Cbc0010I After 18823000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1420.60 seconds)\n", - "Cbc0010I After 18824000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1420.68 seconds)\n", - "Cbc0010I After 18825000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1420.76 seconds)\n", - "Cbc0010I After 18826000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1420.85 seconds)\n", - "Cbc0010I After 18827000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1420.93 seconds)\n", - "Cbc0010I After 18828000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1421.01 seconds)\n", - "Cbc0010I After 18829000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1421.07 seconds)\n", - "Cbc0010I After 18830000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1421.14 seconds)\n", - "Cbc0010I After 18831000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1421.21 seconds)\n", - "Cbc0010I After 18832000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1421.29 seconds)\n", - "Cbc0010I After 18833000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1421.36 seconds)\n", - "Cbc0010I After 18834000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1421.44 seconds)\n", - "Cbc0010I After 18835000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1421.51 seconds)\n", - "Cbc0010I After 18836000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1421.59 seconds)\n", - "Cbc0010I After 18837000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1421.66 seconds)\n", - "Cbc0010I After 18838000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1421.74 seconds)\n", - "Cbc0010I After 18839000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1421.82 seconds)\n", - "Cbc0010I After 18840000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1421.89 seconds)\n", - "Cbc0010I After 18841000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1421.97 seconds)\n", - "Cbc0010I After 18842000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1422.04 seconds)\n", - "Cbc0010I After 18843000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1422.12 seconds)\n", - "Cbc0010I After 18844000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1422.19 seconds)\n", - "Cbc0010I After 18845000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1422.26 seconds)\n", - "Cbc0010I After 18846000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1422.33 seconds)\n", - "Cbc0010I After 18847000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1422.40 seconds)\n", - "Cbc0010I After 18848000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1422.48 seconds)\n", - "Cbc0010I After 18849000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1422.55 seconds)\n", - "Cbc0010I After 18850000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1422.63 seconds)\n", - "Cbc0010I After 18851000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1422.70 seconds)\n", - "Cbc0010I After 18852000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1422.77 seconds)\n", - "Cbc0010I After 18853000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1422.84 seconds)\n", - "Cbc0010I After 18854000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1422.92 seconds)\n", - "Cbc0010I After 18855000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1422.99 seconds)\n", - "Cbc0010I After 18856000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1423.07 seconds)\n", - "Cbc0010I After 18857000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1423.15 seconds)\n", - "Cbc0010I After 18858000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.22 seconds)\n", - "Cbc0010I After 18859000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1423.29 seconds)\n", - "Cbc0010I After 18860000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1423.36 seconds)\n", - "Cbc0010I After 18861000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1423.44 seconds)\n", - "Cbc0010I After 18862000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.51 seconds)\n", - "Cbc0010I After 18863000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1423.58 seconds)\n", - "Cbc0010I After 18864000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1423.66 seconds)\n", - "Cbc0010I After 18865000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1423.73 seconds)\n", - "Cbc0010I After 18866000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1423.80 seconds)\n", - "Cbc0010I After 18867000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1423.88 seconds)\n", - "Cbc0010I After 18868000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1424.01 seconds)\n", - "Cbc0010I After 18869000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1424.10 seconds)\n", - "Cbc0010I After 18870000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1424.22 seconds)\n", - "Cbc0010I After 18871000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1424.32 seconds)\n", - "Cbc0010I After 18872000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1424.41 seconds)\n", - "Cbc0010I After 18873000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1424.50 seconds)\n", - "Cbc0010I After 18874000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1424.58 seconds)\n", - "Cbc0010I After 18875000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1424.65 seconds)\n", - "Cbc0010I After 18876000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1424.72 seconds)\n", - "Cbc0010I After 18877000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1424.79 seconds)\n", - "Cbc0010I After 18878000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1424.86 seconds)\n", - "Cbc0010I After 18879000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1424.93 seconds)\n", - "Cbc0010I After 18880000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1424.98 seconds)\n", - "Cbc0010I After 18881000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1425.05 seconds)\n", - "Cbc0010I After 18882000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1425.11 seconds)\n", - "Cbc0010I After 18883000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1425.17 seconds)\n", - "Cbc0010I After 18884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1425.23 seconds)\n", - "Cbc0010I After 18885000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1425.29 seconds)\n", - "Cbc0010I After 18886000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1425.37 seconds)\n", - "Cbc0010I After 18887000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1425.44 seconds)\n", - "Cbc0010I After 18888000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1425.49 seconds)\n", - "Cbc0010I After 18889000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1425.56 seconds)\n", - "Cbc0010I After 18890000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1425.63 seconds)\n", - "Cbc0010I After 18891000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1425.69 seconds)\n", - "Cbc0010I After 18892000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1425.76 seconds)\n", - "Cbc0010I After 18893000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1425.82 seconds)\n", - "Cbc0010I After 18894000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1425.87 seconds)\n", - "Cbc0010I After 18895000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1425.96 seconds)\n", - "Cbc0010I After 18896000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.02 seconds)\n", - "Cbc0010I After 18897000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1426.10 seconds)\n", - "Cbc0010I After 18898000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1426.16 seconds)\n", - "Cbc0010I After 18899000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1426.21 seconds)\n", - "Cbc0010I After 18900000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1426.26 seconds)\n", - "Cbc0010I After 18901000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1426.31 seconds)\n", - "Cbc0010I After 18902000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.36 seconds)\n", - "Cbc0010I After 18903000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1426.42 seconds)\n", - "Cbc0010I After 18904000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1426.46 seconds)\n", - "Cbc0010I After 18905000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1426.51 seconds)\n", - "Cbc0010I After 18906000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1426.58 seconds)\n", - "Cbc0010I After 18907000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1426.65 seconds)\n", - "Cbc0010I After 18908000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1426.69 seconds)\n", - "Cbc0010I After 18909000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1426.77 seconds)\n", - "Cbc0010I After 18910000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1426.86 seconds)\n", - "Cbc0010I After 18911000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1426.91 seconds)\n", - "Cbc0010I After 18912000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1426.99 seconds)\n", - "Cbc0010I After 18913000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1427.06 seconds)\n", - "Cbc0010I After 18914000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1427.11 seconds)\n", - "Cbc0010I After 18915000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1427.19 seconds)\n", - "Cbc0010I After 18916000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1427.26 seconds)\n", - "Cbc0010I After 18917000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1427.31 seconds)\n", - "Cbc0010I After 18918000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1427.37 seconds)\n", - "Cbc0010I After 18919000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1427.45 seconds)\n", - "Cbc0010I After 18920000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1427.50 seconds)\n", - "Cbc0010I After 18921000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1427.56 seconds)\n", - "Cbc0010I After 18922000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1427.64 seconds)\n", - "Cbc0010I After 18923000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1427.71 seconds)\n", - "Cbc0010I After 18924000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1427.77 seconds)\n", - "Cbc0010I After 18925000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1427.83 seconds)\n", - "Cbc0010I After 18926000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1427.88 seconds)\n", - "Cbc0010I After 18927000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1427.94 seconds)\n", - "Cbc0010I After 18928000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1427.99 seconds)\n", - "Cbc0010I After 18929000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.05 seconds)\n", - "Cbc0010I After 18930000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1428.12 seconds)\n", - "Cbc0010I After 18931000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1428.19 seconds)\n", - "Cbc0010I After 18932000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1428.26 seconds)\n", - "Cbc0010I After 18933000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1428.32 seconds)\n", - "Cbc0010I After 18934000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1428.36 seconds)\n", - "Cbc0010I After 18935000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1428.43 seconds)\n", - "Cbc0010I After 18936000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1428.51 seconds)\n", - "Cbc0010I After 18937000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1428.59 seconds)\n", - "Cbc0010I After 18938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.65 seconds)\n", - "Cbc0010I After 18939000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1428.72 seconds)\n", - "Cbc0010I After 18940000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1428.77 seconds)\n", - "Cbc0010I After 18941000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1428.85 seconds)\n", - "Cbc0010I After 18942000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1428.92 seconds)\n", - "Cbc0010I After 18943000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1428.97 seconds)\n", - "Cbc0010I After 18944000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.04 seconds)\n", - "Cbc0010I After 18945000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.11 seconds)\n", - "Cbc0010I After 18946000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1429.16 seconds)\n", - "Cbc0010I After 18947000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1429.23 seconds)\n", - "Cbc0010I After 18948000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1429.29 seconds)\n", - "Cbc0010I After 18949000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1429.34 seconds)\n", - "Cbc0010I After 18950000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1429.40 seconds)\n", - "Cbc0010I After 18951000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1429.48 seconds)\n", - "Cbc0010I After 18952000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1429.54 seconds)\n", - "Cbc0010I After 18953000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1429.59 seconds)\n", - "Cbc0010I After 18954000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1429.66 seconds)\n", - "Cbc0010I After 18955000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1429.73 seconds)\n", - "Cbc0010I After 18956000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1429.78 seconds)\n", - "Cbc0010I After 18957000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1429.85 seconds)\n", - "Cbc0010I After 18958000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1429.93 seconds)\n", - "Cbc0010I After 18959000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1429.99 seconds)\n", - "Cbc0010I After 18960000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1430.05 seconds)\n", - "Cbc0010I After 18961000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1430.12 seconds)\n", - "Cbc0010I After 18962000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1430.19 seconds)\n", - "Cbc0010I After 18963000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1430.23 seconds)\n", - "Cbc0010I After 18964000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1430.30 seconds)\n", - "Cbc0010I After 18965000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1430.37 seconds)\n", - "Cbc0010I After 18966000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1430.43 seconds)\n", - "Cbc0010I After 18967000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1430.48 seconds)\n", - "Cbc0010I After 18968000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.56 seconds)\n", - "Cbc0010I After 18969000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.62 seconds)\n", - "Cbc0010I After 18970000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1430.67 seconds)\n", - "Cbc0010I After 18971000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1430.73 seconds)\n", - "Cbc0010I After 18972000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1430.80 seconds)\n", - "Cbc0010I After 18973000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1430.89 seconds)\n", - "Cbc0010I After 18974000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1430.94 seconds)\n", - "Cbc0010I After 18975000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1430.99 seconds)\n", - "Cbc0010I After 18976000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1431.07 seconds)\n", - "Cbc0010I After 18977000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1431.14 seconds)\n", - "Cbc0010I After 18978000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1431.19 seconds)\n", - "Cbc0010I After 18979000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1431.24 seconds)\n", - "Cbc0010I After 18980000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1431.30 seconds)\n", - "Cbc0010I After 18981000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1431.37 seconds)\n", - "Cbc0010I After 18982000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1431.44 seconds)\n", - "Cbc0010I After 18983000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1431.49 seconds)\n", - "Cbc0010I After 18984000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1431.53 seconds)\n", - "Cbc0010I After 18985000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1431.58 seconds)\n", - "Cbc0010I After 18986000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1431.66 seconds)\n", - "Cbc0010I After 18987000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1431.73 seconds)\n", - "Cbc0010I After 18988000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1431.77 seconds)\n", - "Cbc0010I After 18989000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1431.82 seconds)\n", - "Cbc0010I After 18990000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1431.89 seconds)\n", - "Cbc0010I After 18991000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1431.96 seconds)\n", - "Cbc0010I After 18992000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1432.03 seconds)\n", - "Cbc0010I After 18993000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1432.12 seconds)\n", - "Cbc0010I After 18994000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1432.18 seconds)\n", - "Cbc0010I After 18995000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1432.24 seconds)\n", - "Cbc0010I After 18996000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1432.32 seconds)\n", - "Cbc0010I After 18997000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1432.39 seconds)\n", - "Cbc0010I After 18998000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1432.48 seconds)\n", - "Cbc0010I After 18999000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1432.53 seconds)\n", - "Cbc0010I After 19000000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1432.59 seconds)\n", - "Cbc0010I After 19001000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1432.67 seconds)\n", - "Cbc0010I After 19002000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1432.72 seconds)\n", - "Cbc0010I After 19003000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1432.78 seconds)\n", - "Cbc0010I After 19004000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1432.86 seconds)\n", - "Cbc0010I After 19005000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1432.91 seconds)\n", - "Cbc0010I After 19006000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1432.96 seconds)\n", - "Cbc0010I After 19007000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1433.04 seconds)\n", - "Cbc0010I After 19008000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1433.10 seconds)\n", - "Cbc0010I After 19009000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1433.15 seconds)\n", - "Cbc0010I After 19010000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1433.23 seconds)\n", - "Cbc0010I After 19011000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1433.30 seconds)\n", - "Cbc0010I After 19012000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1433.35 seconds)\n", - "Cbc0010I After 19013000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1433.41 seconds)\n", - "Cbc0010I After 19014000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1433.48 seconds)\n", - "Cbc0010I After 19015000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1433.55 seconds)\n", - "Cbc0010I After 19016000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1433.60 seconds)\n", - "Cbc0010I After 19017000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1433.66 seconds)\n", - "Cbc0010I After 19018000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1433.74 seconds)\n", - "Cbc0010I After 19019000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1433.80 seconds)\n", - "Cbc0010I After 19020000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1433.85 seconds)\n", - "Cbc0010I After 19021000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1433.91 seconds)\n", - "Cbc0010I After 19022000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1433.99 seconds)\n", - "Cbc0010I After 19023000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1434.04 seconds)\n", - "Cbc0010I After 19024000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1434.09 seconds)\n", - "Cbc0010I After 19025000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.17 seconds)\n", - "Cbc0010I After 19026000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1434.24 seconds)\n", - "Cbc0010I After 19027000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.29 seconds)\n", - "Cbc0010I After 19028000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1434.34 seconds)\n", - "Cbc0010I After 19029000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1434.41 seconds)\n", - "Cbc0010I After 19030000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.49 seconds)\n", - "Cbc0010I After 19031000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.54 seconds)\n", - "Cbc0010I After 19032000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1434.59 seconds)\n", - "Cbc0010I After 19033000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1434.64 seconds)\n", - "Cbc0010I After 19034000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.73 seconds)\n", - "Cbc0010I After 19035000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1434.80 seconds)\n", - "Cbc0010I After 19036000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1434.85 seconds)\n", - "Cbc0010I After 19037000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1434.91 seconds)\n", - "Cbc0010I After 19038000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1434.98 seconds)\n", - "Cbc0010I After 19039000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1435.05 seconds)\n", - "Cbc0010I After 19040000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1435.13 seconds)\n", - "Cbc0010I After 19041000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1435.19 seconds)\n", - "Cbc0010I After 19042000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1435.25 seconds)\n", - "Cbc0010I After 19043000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.30 seconds)\n", - "Cbc0010I After 19044000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.39 seconds)\n", - "Cbc0010I After 19045000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1435.47 seconds)\n", - "Cbc0010I After 19046000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1435.55 seconds)\n", - "Cbc0010I After 19047000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1435.60 seconds)\n", - "Cbc0010I After 19048000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1435.64 seconds)\n", - "Cbc0010I After 19049000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1435.71 seconds)\n", - "Cbc0010I After 19050000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.79 seconds)\n", - "Cbc0010I After 19051000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1435.85 seconds)\n", - "Cbc0010I After 19052000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1435.89 seconds)\n", - "Cbc0010I After 19053000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1435.94 seconds)\n", - "Cbc0010I After 19054000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.01 seconds)\n", - "Cbc0010I After 19055000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1436.08 seconds)\n", - "Cbc0010I After 19056000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1436.15 seconds)\n", - "Cbc0010I After 19057000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1436.20 seconds)\n", - "Cbc0010I After 19058000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.25 seconds)\n", - "Cbc0010I After 19059000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1436.33 seconds)\n", - "Cbc0010I After 19060000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1436.40 seconds)\n", - "Cbc0010I After 19061000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1436.45 seconds)\n", - "Cbc0010I After 19062000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1436.50 seconds)\n", - "Cbc0010I After 19063000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1436.53 seconds)\n", - "Cbc0010I After 19064000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1436.56 seconds)\n", - "Cbc0010I After 19065000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1436.58 seconds)\n", - "Cbc0010I After 19066000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1436.61 seconds)\n", - "Cbc0010I After 19067000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1436.65 seconds)\n", - "Cbc0010I After 19068000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1436.67 seconds)\n", - "Cbc0010I After 19069000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1436.70 seconds)\n", - "Cbc0010I After 19070000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1436.74 seconds)\n", - "Cbc0010I After 19071000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1436.76 seconds)\n", - "Cbc0010I After 19072000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1436.80 seconds)\n", - "Cbc0010I After 19073000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1436.83 seconds)\n", - "Cbc0010I After 19074000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1436.86 seconds)\n", - "Cbc0010I After 19075000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1436.89 seconds)\n", - "Cbc0010I After 19076000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1436.92 seconds)\n", - "Cbc0010I After 19077000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1436.95 seconds)\n", - "Cbc0010I After 19078000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1436.97 seconds)\n", - "Cbc0010I After 19079000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1437.00 seconds)\n", - "Cbc0010I After 19080000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1437.04 seconds)\n", - "Cbc0010I After 19081000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1437.11 seconds)\n", - "Cbc0010I After 19082000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1437.17 seconds)\n", - "Cbc0010I After 19083000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1437.21 seconds)\n", - "Cbc0010I After 19084000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1437.25 seconds)\n", - "Cbc0010I After 19085000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1437.29 seconds)\n", - "Cbc0010I After 19086000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1437.32 seconds)\n", - "Cbc0010I After 19087000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1437.36 seconds)\n", - "Cbc0010I After 19088000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1437.40 seconds)\n", - "Cbc0010I After 19089000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1437.43 seconds)\n", - "Cbc0010I After 19090000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1437.46 seconds)\n", - "Cbc0010I After 19091000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1437.49 seconds)\n", - "Cbc0010I After 19092000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1437.53 seconds)\n", - "Cbc0010I After 19093000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1437.56 seconds)\n", - "Cbc0010I After 19094000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1437.59 seconds)\n", - "Cbc0010I After 19095000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1437.62 seconds)\n", - "Cbc0010I After 19096000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1437.65 seconds)\n", - "Cbc0010I After 19097000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1437.69 seconds)\n", - "Cbc0010I After 19098000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1437.72 seconds)\n", - "Cbc0010I After 19099000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1437.75 seconds)\n", - "Cbc0010I After 19100000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1437.78 seconds)\n", - "Cbc0010I After 19101000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1437.81 seconds)\n", - "Cbc0010I After 19102000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1437.85 seconds)\n", - "Cbc0010I After 19103000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1437.87 seconds)\n", - "Cbc0010I After 19104000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1437.90 seconds)\n", - "Cbc0010I After 19105000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1437.93 seconds)\n", - "Cbc0010I After 19106000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1437.97 seconds)\n", - "Cbc0010I After 19107000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1438.00 seconds)\n", - "Cbc0010I After 19108000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1438.03 seconds)\n", - "Cbc0010I After 19109000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1438.06 seconds)\n", - "Cbc0010I After 19110000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1438.09 seconds)\n", - "Cbc0010I After 19111000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1438.12 seconds)\n", - "Cbc0010I After 19112000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1438.15 seconds)\n", - "Cbc0010I After 19113000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1438.19 seconds)\n", - "Cbc0010I After 19114000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1438.22 seconds)\n", - "Cbc0010I After 19115000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1438.25 seconds)\n", - "Cbc0010I After 19116000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1438.29 seconds)\n", - "Cbc0010I After 19117000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1438.32 seconds)\n", - "Cbc0010I After 19118000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1438.35 seconds)\n", - "Cbc0010I After 19119000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1438.38 seconds)\n", - "Cbc0010I After 19120000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1438.42 seconds)\n", - "Cbc0010I After 19121000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1438.44 seconds)\n", - "Cbc0010I After 19122000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1438.47 seconds)\n", - "Cbc0010I After 19123000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1438.51 seconds)\n", - "Cbc0010I After 19124000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1438.54 seconds)\n", - "Cbc0010I After 19125000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1438.56 seconds)\n", - "Cbc0010I After 19126000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1438.59 seconds)\n", - "Cbc0010I After 19127000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1438.62 seconds)\n", - "Cbc0010I After 19128000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1438.65 seconds)\n", - "Cbc0010I After 19129000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1438.68 seconds)\n", - "Cbc0010I After 19130000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1438.72 seconds)\n", - "Cbc0010I After 19131000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1438.75 seconds)\n", - "Cbc0010I After 19132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1438.78 seconds)\n", - "Cbc0010I After 19133000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1438.81 seconds)\n", - "Cbc0010I After 19134000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1438.85 seconds)\n", - "Cbc0010I After 19135000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1438.88 seconds)\n", - "Cbc0010I After 19136000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1438.91 seconds)\n", - "Cbc0010I After 19137000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1438.94 seconds)\n", - "Cbc0010I After 19138000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1438.99 seconds)\n", - "Cbc0010I After 19139000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1439.02 seconds)\n", - "Cbc0010I After 19140000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1439.05 seconds)\n", - "Cbc0010I After 19141000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1439.08 seconds)\n", - "Cbc0010I After 19142000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1439.11 seconds)\n", - "Cbc0010I After 19143000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1439.14 seconds)\n", - "Cbc0010I After 19144000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1439.17 seconds)\n", - "Cbc0010I After 19145000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1439.20 seconds)\n", - "Cbc0010I After 19146000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1439.23 seconds)\n", - "Cbc0010I After 19147000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1439.27 seconds)\n", - "Cbc0010I After 19148000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1439.30 seconds)\n", - "Cbc0010I After 19149000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1439.34 seconds)\n", - "Cbc0010I After 19150000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1439.37 seconds)\n", - "Cbc0010I After 19151000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1439.41 seconds)\n", - "Cbc0010I After 19152000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1439.44 seconds)\n", - "Cbc0010I After 19153000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1439.48 seconds)\n", - "Cbc0010I After 19154000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1439.51 seconds)\n", - "Cbc0010I After 19155000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1439.54 seconds)\n", - "Cbc0010I After 19156000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1439.58 seconds)\n", - "Cbc0010I After 19157000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1439.61 seconds)\n", - "Cbc0010I After 19158000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1439.64 seconds)\n", - "Cbc0010I After 19159000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1439.67 seconds)\n", - "Cbc0010I After 19160000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1439.70 seconds)\n", - "Cbc0010I After 19161000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1439.74 seconds)\n", - "Cbc0010I After 19162000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1439.77 seconds)\n", - "Cbc0010I After 19163000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1439.82 seconds)\n", - "Cbc0010I After 19164000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1439.87 seconds)\n", - "Cbc0010I After 19165000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1439.93 seconds)\n", - "Cbc0010I After 19166000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1439.97 seconds)\n", - "Cbc0010I After 19167000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1440.02 seconds)\n", - "Cbc0010I After 19168000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1440.05 seconds)\n", - "Cbc0010I After 19169000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1440.09 seconds)\n", - "Cbc0010I After 19170000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1440.14 seconds)\n", - "Cbc0010I After 19171000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1440.17 seconds)\n", - "Cbc0010I After 19172000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1440.20 seconds)\n", - "Cbc0010I After 19173000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1440.23 seconds)\n", - "Cbc0010I After 19174000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1440.27 seconds)\n", - "Cbc0010I After 19175000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1440.31 seconds)\n", - "Cbc0010I After 19176000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1440.36 seconds)\n", - "Cbc0010I After 19177000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1440.40 seconds)\n", - "Cbc0010I After 19178000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1440.44 seconds)\n", - "Cbc0010I After 19179000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1440.47 seconds)\n", - "Cbc0010I After 19180000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1440.50 seconds)\n", - "Cbc0010I After 19181000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1440.53 seconds)\n", - "Cbc0010I After 19182000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1440.57 seconds)\n", - "Cbc0010I After 19183000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1440.62 seconds)\n", - "Cbc0010I After 19184000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1440.66 seconds)\n", - "Cbc0010I After 19185000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1440.70 seconds)\n", - "Cbc0010I After 19186000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1440.74 seconds)\n", - "Cbc0010I After 19187000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1440.79 seconds)\n", - "Cbc0010I After 19188000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1440.83 seconds)\n", - "Cbc0010I After 19189000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1440.87 seconds)\n", - "Cbc0010I After 19190000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1440.90 seconds)\n", - "Cbc0010I After 19191000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1440.92 seconds)\n", - "Cbc0010I After 19192000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1440.96 seconds)\n", - "Cbc0010I After 19193000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1441.00 seconds)\n", - "Cbc0010I After 19194000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1441.04 seconds)\n", - "Cbc0010I After 19195000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.08 seconds)\n", - "Cbc0010I After 19196000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1441.13 seconds)\n", - "Cbc0010I After 19197000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1441.17 seconds)\n", - "Cbc0010I After 19198000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1441.21 seconds)\n", - "Cbc0010I After 19199000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1441.26 seconds)\n", - "Cbc0010I After 19200000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1441.30 seconds)\n", - "Cbc0010I After 19201000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1441.34 seconds)\n", - "Cbc0010I After 19202000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1441.39 seconds)\n", - "Cbc0010I After 19203000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1441.44 seconds)\n", - "Cbc0010I After 19204000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1441.49 seconds)\n", - "Cbc0010I After 19205000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1441.53 seconds)\n", - "Cbc0010I After 19206000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1441.58 seconds)\n", - "Cbc0010I After 19207000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1441.62 seconds)\n", - "Cbc0010I After 19208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1441.66 seconds)\n", - "Cbc0010I After 19209000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1441.69 seconds)\n", - "Cbc0010I After 19210000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1441.72 seconds)\n", - "Cbc0010I After 19211000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1441.75 seconds)\n", - "Cbc0010I After 19212000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1441.79 seconds)\n", - "Cbc0010I After 19213000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1441.83 seconds)\n", - "Cbc0010I After 19214000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.87 seconds)\n", - "Cbc0010I After 19215000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1441.92 seconds)\n", - "Cbc0010I After 19216000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1441.96 seconds)\n", - "Cbc0010I After 19217000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1441.99 seconds)\n", - "Cbc0010I After 19218000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1442.01 seconds)\n", - "Cbc0010I After 19219000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1442.05 seconds)\n", - "Cbc0010I After 19220000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1442.09 seconds)\n", - "Cbc0010I After 19221000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1442.13 seconds)\n", - "Cbc0010I After 19222000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1442.18 seconds)\n", - "Cbc0010I After 19223000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1442.22 seconds)\n", - "Cbc0010I After 19224000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1442.26 seconds)\n", - "Cbc0010I After 19225000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1442.31 seconds)\n", - "Cbc0010I After 19226000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1442.35 seconds)\n", - "Cbc0010I After 19227000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1442.40 seconds)\n", - "Cbc0010I After 19228000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1442.44 seconds)\n", - "Cbc0010I After 19229000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1442.48 seconds)\n", - "Cbc0010I After 19230000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1442.52 seconds)\n", - "Cbc0010I After 19231000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1442.55 seconds)\n", - "Cbc0010I After 19232000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1442.57 seconds)\n", - "Cbc0010I After 19233000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1442.62 seconds)\n", - "Cbc0010I After 19234000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1442.66 seconds)\n", - "Cbc0010I After 19235000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1442.70 seconds)\n", - "Cbc0010I After 19236000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1442.73 seconds)\n", - "Cbc0010I After 19237000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1442.76 seconds)\n", - "Cbc0010I After 19238000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1442.79 seconds)\n", - "Cbc0010I After 19239000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1442.82 seconds)\n", - "Cbc0010I After 19240000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1442.85 seconds)\n", - "Cbc0010I After 19241000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1442.89 seconds)\n", - "Cbc0010I After 19242000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1442.93 seconds)\n", - "Cbc0010I After 19243000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1442.96 seconds)\n", - "Cbc0010I After 19244000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1443.00 seconds)\n", - "Cbc0010I After 19245000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1443.04 seconds)\n", - "Cbc0010I After 19246000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.08 seconds)\n", - "Cbc0010I After 19247000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1443.13 seconds)\n", - "Cbc0010I After 19248000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1443.17 seconds)\n", - "Cbc0010I After 19249000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1443.20 seconds)\n", - "Cbc0010I After 19250000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1443.24 seconds)\n", - "Cbc0010I After 19251000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1443.28 seconds)\n", - "Cbc0010I After 19252000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1443.32 seconds)\n", - "Cbc0010I After 19253000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1443.35 seconds)\n", - "Cbc0010I After 19254000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.38 seconds)\n", - "Cbc0010I After 19255000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1443.41 seconds)\n", - "Cbc0010I After 19256000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1443.44 seconds)\n", - "Cbc0010I After 19257000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1443.47 seconds)\n", - "Cbc0010I After 19258000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1443.49 seconds)\n", - "Cbc0010I After 19259000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1443.53 seconds)\n", - "Cbc0010I After 19260000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1443.57 seconds)\n", - "Cbc0010I After 19261000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1443.61 seconds)\n", - "Cbc0010I After 19262000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1443.69 seconds)\n", - "Cbc0010I After 19263000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1443.77 seconds)\n", - "Cbc0010I After 19264000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1443.84 seconds)\n", - "Cbc0010I After 19265000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1443.89 seconds)\n", - "Cbc0010I After 19266000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1443.94 seconds)\n", - "Cbc0010I After 19267000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1444.01 seconds)\n", - "Cbc0010I After 19268000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1444.07 seconds)\n", - "Cbc0010I After 19269000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1444.14 seconds)\n", - "Cbc0010I After 19270000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1444.20 seconds)\n", - "Cbc0010I After 19271000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1444.27 seconds)\n", - "Cbc0010I After 19272000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1444.33 seconds)\n", - "Cbc0010I After 19273000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1444.39 seconds)\n", - "Cbc0010I After 19274000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1444.46 seconds)\n", - "Cbc0010I After 19275000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1444.52 seconds)\n", - "Cbc0010I After 19276000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1444.59 seconds)\n", - "Cbc0010I After 19277000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1444.66 seconds)\n", - "Cbc0010I After 19278000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1444.73 seconds)\n", - "Cbc0010I After 19279000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1444.79 seconds)\n", - "Cbc0010I After 19280000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1444.86 seconds)\n", - "Cbc0010I After 19281000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1444.93 seconds)\n", - "Cbc0010I After 19282000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1445.00 seconds)\n", - "Cbc0010I After 19283000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1445.07 seconds)\n", - "Cbc0010I After 19284000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1445.13 seconds)\n", - "Cbc0010I After 19285000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1445.20 seconds)\n", - "Cbc0010I After 19286000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1445.28 seconds)\n", - "Cbc0010I After 19287000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1445.35 seconds)\n", - "Cbc0010I After 19288000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1445.44 seconds)\n", - "Cbc0010I After 19289000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1445.52 seconds)\n", - "Cbc0010I After 19290000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1445.59 seconds)\n", - "Cbc0010I After 19291000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1445.66 seconds)\n", - "Cbc0010I After 19292000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1445.75 seconds)\n", - "Cbc0010I After 19293000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1445.84 seconds)\n", - "Cbc0010I After 19294000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1445.93 seconds)\n", - "Cbc0010I After 19295000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1446.01 seconds)\n", - "Cbc0010I After 19296000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1446.09 seconds)\n", - "Cbc0010I After 19297000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1446.16 seconds)\n", - "Cbc0010I After 19298000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1446.24 seconds)\n", - "Cbc0010I After 19299000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1446.31 seconds)\n", - "Cbc0010I After 19300000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1446.38 seconds)\n", - "Cbc0010I After 19301000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1446.46 seconds)\n", - "Cbc0010I After 19302000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1446.53 seconds)\n", - "Cbc0010I After 19303000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1446.60 seconds)\n", - "Cbc0010I After 19304000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1446.68 seconds)\n", - "Cbc0010I After 19305000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1446.75 seconds)\n", - "Cbc0010I After 19306000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1446.82 seconds)\n", - "Cbc0010I After 19307000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1446.89 seconds)\n", - "Cbc0010I After 19308000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1446.96 seconds)\n", - "Cbc0010I After 19309000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1447.04 seconds)\n", - "Cbc0010I After 19310000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1447.11 seconds)\n", - "Cbc0010I After 19311000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1447.18 seconds)\n", - "Cbc0010I After 19312000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1447.25 seconds)\n", - "Cbc0010I After 19313000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1447.31 seconds)\n", - "Cbc0010I After 19314000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1447.39 seconds)\n", - "Cbc0010I After 19315000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1447.45 seconds)\n", - "Cbc0010I After 19316000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1447.53 seconds)\n", - "Cbc0010I After 19317000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1447.59 seconds)\n", - "Cbc0010I After 19318000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1447.67 seconds)\n", - "Cbc0010I After 19319000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1447.74 seconds)\n", - "Cbc0010I After 19320000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1447.81 seconds)\n", - "Cbc0010I After 19321000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1447.90 seconds)\n", - "Cbc0010I After 19322000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1447.99 seconds)\n", - "Cbc0010I After 19323000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1448.07 seconds)\n", - "Cbc0010I After 19324000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1448.14 seconds)\n", - "Cbc0010I After 19325000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1448.22 seconds)\n", - "Cbc0010I After 19326000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1448.29 seconds)\n", - "Cbc0010I After 19327000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1448.37 seconds)\n", - "Cbc0010I After 19328000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1448.45 seconds)\n", - "Cbc0010I After 19329000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1448.53 seconds)\n", - "Cbc0010I After 19330000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1448.60 seconds)\n", - "Cbc0010I After 19331000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1448.68 seconds)\n", - "Cbc0010I After 19332000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1448.75 seconds)\n", - "Cbc0010I After 19333000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1448.82 seconds)\n", - "Cbc0010I After 19334000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1448.90 seconds)\n", - "Cbc0010I After 19335000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1448.96 seconds)\n", - "Cbc0010I After 19336000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1449.04 seconds)\n", - "Cbc0010I After 19337000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1449.11 seconds)\n", - "Cbc0010I After 19338000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1449.18 seconds)\n", - "Cbc0010I After 19339000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1449.25 seconds)\n", - "Cbc0010I After 19340000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1449.33 seconds)\n", - "Cbc0010I After 19341000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1449.41 seconds)\n", - "Cbc0010I After 19342000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1449.48 seconds)\n", - "Cbc0010I After 19343000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1449.56 seconds)\n", - "Cbc0010I After 19344000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1449.63 seconds)\n", - "Cbc0010I After 19345000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1449.70 seconds)\n", - "Cbc0010I After 19346000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1449.78 seconds)\n", - "Cbc0010I After 19347000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1449.84 seconds)\n", - "Cbc0010I After 19348000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1449.92 seconds)\n", - "Cbc0010I After 19349000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1449.99 seconds)\n", - "Cbc0010I After 19350000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1450.06 seconds)\n", - "Cbc0010I After 19351000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1450.14 seconds)\n", - "Cbc0010I After 19352000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1450.21 seconds)\n", - "Cbc0010I After 19353000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1450.28 seconds)\n", - "Cbc0010I After 19354000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1450.34 seconds)\n", - "Cbc0010I After 19355000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1450.41 seconds)\n", - "Cbc0010I After 19356000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1450.48 seconds)\n", - "Cbc0010I After 19357000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1450.55 seconds)\n", - "Cbc0010I After 19358000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1450.61 seconds)\n", - "Cbc0010I After 19359000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1450.68 seconds)\n", - "Cbc0010I After 19360000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1450.74 seconds)\n", - "Cbc0010I After 19361000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1450.81 seconds)\n", - "Cbc0010I After 19362000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1450.87 seconds)\n", - "Cbc0010I After 19363000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1450.94 seconds)\n", - "Cbc0010I After 19364000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1451.02 seconds)\n", - "Cbc0010I After 19365000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1451.08 seconds)\n", - "Cbc0010I After 19366000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1451.15 seconds)\n", - "Cbc0010I After 19367000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1451.22 seconds)\n", - "Cbc0010I After 19368000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1451.29 seconds)\n", - "Cbc0010I After 19369000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1451.41 seconds)\n", - "Cbc0010I After 19370000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1451.50 seconds)\n", - "Cbc0010I After 19371000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1451.59 seconds)\n", - "Cbc0010I After 19372000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1451.67 seconds)\n", - "Cbc0010I After 19373000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1451.75 seconds)\n", - "Cbc0010I After 19374000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1451.82 seconds)\n", - "Cbc0010I After 19375000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1451.89 seconds)\n", - "Cbc0010I After 19376000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1451.96 seconds)\n", - "Cbc0010I After 19377000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1452.05 seconds)\n", - "Cbc0010I After 19378000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1452.13 seconds)\n", - "Cbc0010I After 19379000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1452.21 seconds)\n", - "Cbc0010I After 19380000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1452.29 seconds)\n", - "Cbc0010I After 19381000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1452.36 seconds)\n", - "Cbc0010I After 19382000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1452.43 seconds)\n", - "Cbc0010I After 19383000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1452.49 seconds)\n", - "Cbc0010I After 19384000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1452.56 seconds)\n", - "Cbc0010I After 19385000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1452.62 seconds)\n", - "Cbc0010I After 19386000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1452.69 seconds)\n", - "Cbc0010I After 19387000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1452.76 seconds)\n", - "Cbc0010I After 19388000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1452.83 seconds)\n", - "Cbc0010I After 19389000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1452.91 seconds)\n", - "Cbc0010I After 19390000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1452.98 seconds)\n", - "Cbc0010I After 19391000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1453.05 seconds)\n", - "Cbc0010I After 19392000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1453.11 seconds)\n", - "Cbc0010I After 19393000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1453.18 seconds)\n", - "Cbc0010I After 19394000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1453.25 seconds)\n", - "Cbc0010I After 19395000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1453.32 seconds)\n", - "Cbc0010I After 19396000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1453.38 seconds)\n", - "Cbc0010I After 19397000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1453.45 seconds)\n", - "Cbc0010I After 19398000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1453.52 seconds)\n", - "Cbc0010I After 19399000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1453.58 seconds)\n", - "Cbc0010I After 19400000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1453.65 seconds)\n", - "Cbc0010I After 19401000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1453.72 seconds)\n", - "Cbc0010I After 19402000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1453.79 seconds)\n", - "Cbc0010I After 19403000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1453.86 seconds)\n", - "Cbc0010I After 19404000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1453.92 seconds)\n", - "Cbc0010I After 19405000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1453.98 seconds)\n", - "Cbc0010I After 19406000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1454.05 seconds)\n", - "Cbc0010I After 19407000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1454.11 seconds)\n", - "Cbc0010I After 19408000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1454.18 seconds)\n", - "Cbc0010I After 19409000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1454.25 seconds)\n", - "Cbc0010I After 19410000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1454.32 seconds)\n", - "Cbc0010I After 19411000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1454.40 seconds)\n", - "Cbc0010I After 19412000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1454.48 seconds)\n", - "Cbc0010I After 19413000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1454.56 seconds)\n", - "Cbc0010I After 19414000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1454.63 seconds)\n", - "Cbc0010I After 19415000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1454.70 seconds)\n", - "Cbc0010I After 19416000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1454.78 seconds)\n", - "Cbc0010I After 19417000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1454.85 seconds)\n", - "Cbc0010I After 19418000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1454.92 seconds)\n", - "Cbc0010I After 19419000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1455.00 seconds)\n", - "Cbc0010I After 19420000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1455.07 seconds)\n", - "Cbc0010I After 19421000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1455.14 seconds)\n", - "Cbc0010I After 19422000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1455.22 seconds)\n", - "Cbc0010I After 19423000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1455.29 seconds)\n", - "Cbc0010I After 19424000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1455.36 seconds)\n", - "Cbc0010I After 19425000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1455.45 seconds)\n", - "Cbc0010I After 19426000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1455.53 seconds)\n", - "Cbc0010I After 19427000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1455.60 seconds)\n", - "Cbc0010I After 19428000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1455.68 seconds)\n", - "Cbc0010I After 19429000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1455.75 seconds)\n", - "Cbc0010I After 19430000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1455.83 seconds)\n", - "Cbc0010I After 19431000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1455.91 seconds)\n", - "Cbc0010I After 19432000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1455.99 seconds)\n", - "Cbc0010I After 19433000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1456.07 seconds)\n", - "Cbc0010I After 19434000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1456.14 seconds)\n", - "Cbc0010I After 19435000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1456.22 seconds)\n", - "Cbc0010I After 19436000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1456.29 seconds)\n", - "Cbc0010I After 19437000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1456.36 seconds)\n", - "Cbc0010I After 19438000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1456.43 seconds)\n", - "Cbc0010I After 19439000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1456.51 seconds)\n", - "Cbc0010I After 19440000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1456.60 seconds)\n", - "Cbc0010I After 19441000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1456.69 seconds)\n", - "Cbc0010I After 19442000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1456.77 seconds)\n", - "Cbc0010I After 19443000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1456.84 seconds)\n", - "Cbc0010I After 19444000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1456.91 seconds)\n", - "Cbc0010I After 19445000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1456.97 seconds)\n", - "Cbc0010I After 19446000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1457.04 seconds)\n", - "Cbc0010I After 19447000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1457.11 seconds)\n", - "Cbc0010I After 19448000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1457.18 seconds)\n", - "Cbc0010I After 19449000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1457.25 seconds)\n", - "Cbc0010I After 19450000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1457.32 seconds)\n", - "Cbc0010I After 19451000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1457.39 seconds)\n", - "Cbc0010I After 19452000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1457.46 seconds)\n", - "Cbc0010I After 19453000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1457.54 seconds)\n", - "Cbc0010I After 19454000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1457.61 seconds)\n", - "Cbc0010I After 19455000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1457.69 seconds)\n", - "Cbc0010I After 19456000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1457.76 seconds)\n", - "Cbc0010I After 19457000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1457.84 seconds)\n", - "Cbc0010I After 19458000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1457.90 seconds)\n", - "Cbc0010I After 19459000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1457.97 seconds)\n", - "Cbc0010I After 19460000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1458.04 seconds)\n", - "Cbc0010I After 19461000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1458.12 seconds)\n", - "Cbc0010I After 19462000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1458.19 seconds)\n", - "Cbc0010I After 19463000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1458.26 seconds)\n", - "Cbc0010I After 19464000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1458.33 seconds)\n", - "Cbc0010I After 19465000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1458.40 seconds)\n", - "Cbc0010I After 19466000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1458.48 seconds)\n", - "Cbc0010I After 19467000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1458.55 seconds)\n", - "Cbc0010I After 19468000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1458.62 seconds)\n", - "Cbc0010I After 19469000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1458.70 seconds)\n", - "Cbc0010I After 19470000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1458.77 seconds)\n", - "Cbc0010I After 19471000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1458.84 seconds)\n", - "Cbc0010I After 19472000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1458.91 seconds)\n", - "Cbc0010I After 19473000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1458.98 seconds)\n", - "Cbc0010I After 19474000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1459.06 seconds)\n", - "Cbc0010I After 19475000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1459.13 seconds)\n", - "Cbc0010I After 19476000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1459.20 seconds)\n", - "Cbc0010I After 19477000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1459.28 seconds)\n", - "Cbc0010I After 19478000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1459.35 seconds)\n", - "Cbc0010I After 19479000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1459.41 seconds)\n", - "Cbc0010I After 19480000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1459.48 seconds)\n", - "Cbc0010I After 19481000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1459.56 seconds)\n", - "Cbc0010I After 19482000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1459.63 seconds)\n", - "Cbc0010I After 19483000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1459.70 seconds)\n", - "Cbc0010I After 19484000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1459.78 seconds)\n", - "Cbc0010I After 19485000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1459.85 seconds)\n", - "Cbc0010I After 19486000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1459.92 seconds)\n", - "Cbc0010I After 19487000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1459.99 seconds)\n", - "Cbc0010I After 19488000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1460.07 seconds)\n", - "Cbc0010I After 19489000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1460.14 seconds)\n", - "Cbc0010I After 19490000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1460.21 seconds)\n", - "Cbc0010I After 19491000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1460.29 seconds)\n", - "Cbc0010I After 19492000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1460.36 seconds)\n", - "Cbc0010I After 19493000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1460.44 seconds)\n", - "Cbc0010I After 19494000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1460.54 seconds)\n", - "Cbc0010I After 19495000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1460.63 seconds)\n", - "Cbc0010I After 19496000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1460.71 seconds)\n", - "Cbc0010I After 19497000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1460.78 seconds)\n", - "Cbc0010I After 19498000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1460.85 seconds)\n", - "Cbc0010I After 19499000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1460.92 seconds)\n", - "Cbc0010I After 19500000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1460.99 seconds)\n", - "Cbc0010I After 19501000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1461.07 seconds)\n", - "Cbc0010I After 19502000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1461.13 seconds)\n", - "Cbc0010I After 19503000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1461.20 seconds)\n", - "Cbc0010I After 19504000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1461.27 seconds)\n", - "Cbc0010I After 19505000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1461.35 seconds)\n", - "Cbc0010I After 19506000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1461.42 seconds)\n", - "Cbc0010I After 19507000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1461.49 seconds)\n", - "Cbc0010I After 19508000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1461.56 seconds)\n", - "Cbc0010I After 19509000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1461.64 seconds)\n", - "Cbc0010I After 19510000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1461.71 seconds)\n", - "Cbc0010I After 19511000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1461.78 seconds)\n", - "Cbc0010I After 19512000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1461.85 seconds)\n", - "Cbc0010I After 19513000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1461.93 seconds)\n", - "Cbc0010I After 19514000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1462.00 seconds)\n", - "Cbc0010I After 19515000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1462.07 seconds)\n", - "Cbc0010I After 19516000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1462.14 seconds)\n", - "Cbc0010I After 19517000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1462.21 seconds)\n", - "Cbc0010I After 19518000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1462.29 seconds)\n", - "Cbc0010I After 19519000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1462.36 seconds)\n", - "Cbc0010I After 19520000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1462.43 seconds)\n", - "Cbc0010I After 19521000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1462.50 seconds)\n", - "Cbc0010I After 19522000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1462.58 seconds)\n", - "Cbc0010I After 19523000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1462.65 seconds)\n", - "Cbc0010I After 19524000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1462.72 seconds)\n", - "Cbc0010I After 19525000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1462.79 seconds)\n", - "Cbc0010I After 19526000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1462.86 seconds)\n", - "Cbc0010I After 19527000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1462.93 seconds)\n", - "Cbc0010I After 19528000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1463.01 seconds)\n", - "Cbc0010I After 19529000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1463.07 seconds)\n", - "Cbc0010I After 19530000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1463.15 seconds)\n", - "Cbc0010I After 19531000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1463.22 seconds)\n", - "Cbc0010I After 19532000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1463.30 seconds)\n", - "Cbc0010I After 19533000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1463.37 seconds)\n", - "Cbc0010I After 19534000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1463.44 seconds)\n", - "Cbc0010I After 19535000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1463.52 seconds)\n", - "Cbc0010I After 19536000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1463.60 seconds)\n", - "Cbc0010I After 19537000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1463.67 seconds)\n", - "Cbc0010I After 19538000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1463.74 seconds)\n", - "Cbc0010I After 19539000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1463.81 seconds)\n", - "Cbc0010I After 19540000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1463.89 seconds)\n", - "Cbc0010I After 19541000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1463.96 seconds)\n", - "Cbc0010I After 19542000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1464.03 seconds)\n", - "Cbc0010I After 19543000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1464.09 seconds)\n", - "Cbc0010I After 19544000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1464.16 seconds)\n", - "Cbc0010I After 19545000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.23 seconds)\n", - "Cbc0010I After 19546000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.30 seconds)\n", - "Cbc0010I After 19547000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1464.37 seconds)\n", - "Cbc0010I After 19548000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1464.44 seconds)\n", - "Cbc0010I After 19549000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1464.51 seconds)\n", - "Cbc0010I After 19550000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1464.58 seconds)\n", - "Cbc0010I After 19551000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1464.66 seconds)\n", - "Cbc0010I After 19552000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1464.72 seconds)\n", - "Cbc0010I After 19553000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1464.79 seconds)\n", - "Cbc0010I After 19554000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1464.87 seconds)\n", - "Cbc0010I After 19555000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1464.94 seconds)\n", - "Cbc0010I After 19556000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1465.01 seconds)\n", - "Cbc0010I After 19557000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1465.09 seconds)\n", - "Cbc0010I After 19558000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1465.16 seconds)\n", - "Cbc0010I After 19559000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1465.24 seconds)\n", - "Cbc0010I After 19560000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1465.31 seconds)\n", - "Cbc0010I After 19561000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1465.38 seconds)\n", - "Cbc0010I After 19562000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1465.46 seconds)\n", - "Cbc0010I After 19563000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1465.53 seconds)\n", - "Cbc0010I After 19564000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1465.60 seconds)\n", - "Cbc0010I After 19565000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1465.67 seconds)\n", - "Cbc0010I After 19566000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1465.74 seconds)\n", - "Cbc0010I After 19567000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1465.82 seconds)\n", - "Cbc0010I After 19568000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1465.89 seconds)\n", - "Cbc0010I After 19569000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1465.96 seconds)\n", - "Cbc0010I After 19570000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1466.03 seconds)\n", - "Cbc0010I After 19571000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1466.10 seconds)\n", - "Cbc0010I After 19572000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1466.18 seconds)\n", - "Cbc0010I After 19573000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1466.25 seconds)\n", - "Cbc0010I After 19574000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1466.34 seconds)\n", - "Cbc0010I After 19575000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1466.42 seconds)\n", - "Cbc0010I After 19576000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1466.49 seconds)\n", - "Cbc0010I After 19577000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1466.56 seconds)\n", - "Cbc0010I After 19578000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1466.69 seconds)\n", - "Cbc0010I After 19579000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1466.78 seconds)\n", - "Cbc0010I After 19580000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1466.88 seconds)\n", - "Cbc0010I After 19581000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1466.97 seconds)\n", - "Cbc0010I After 19582000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1467.05 seconds)\n", - "Cbc0010I After 19583000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1467.13 seconds)\n", - "Cbc0010I After 19584000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1467.20 seconds)\n", - "Cbc0010I After 19585000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1467.31 seconds)\n", - "Cbc0010I After 19586000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1467.40 seconds)\n", - "Cbc0010I After 19587000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1467.47 seconds)\n", - "Cbc0010I After 19588000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1467.54 seconds)\n", - "Cbc0010I After 19589000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1467.60 seconds)\n", - "Cbc0010I After 19590000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1467.67 seconds)\n", - "Cbc0010I After 19591000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1467.74 seconds)\n", - "Cbc0010I After 19592000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1467.81 seconds)\n", - "Cbc0010I After 19593000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1467.87 seconds)\n", - "Cbc0010I After 19594000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1467.94 seconds)\n", - "Cbc0010I After 19595000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1468.01 seconds)\n", - "Cbc0010I After 19596000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1468.08 seconds)\n", - "Cbc0010I After 19597000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1468.15 seconds)\n", - "Cbc0010I After 19598000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1468.22 seconds)\n", - "Cbc0010I After 19599000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1468.29 seconds)\n", - "Cbc0010I After 19600000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1468.36 seconds)\n", - "Cbc0010I After 19601000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1468.43 seconds)\n", - "Cbc0010I After 19602000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1468.50 seconds)\n", - "Cbc0010I After 19603000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1468.56 seconds)\n", - "Cbc0010I After 19604000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1468.63 seconds)\n", - "Cbc0010I After 19605000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1468.70 seconds)\n", - "Cbc0010I After 19606000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1468.77 seconds)\n", - "Cbc0010I After 19607000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1468.84 seconds)\n", - "Cbc0010I After 19608000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1468.91 seconds)\n", - "Cbc0010I After 19609000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1468.97 seconds)\n", - "Cbc0010I After 19610000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1469.04 seconds)\n", - "Cbc0010I After 19611000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1469.11 seconds)\n", - "Cbc0010I After 19612000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1469.18 seconds)\n", - "Cbc0010I After 19613000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1469.25 seconds)\n", - "Cbc0010I After 19614000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1469.31 seconds)\n", - "Cbc0010I After 19615000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1469.38 seconds)\n", - "Cbc0010I After 19616000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1469.46 seconds)\n", - "Cbc0010I After 19617000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1469.54 seconds)\n", - "Cbc0010I After 19618000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1469.62 seconds)\n", - "Cbc0010I After 19619000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1469.70 seconds)\n", - "Cbc0010I After 19620000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1469.77 seconds)\n", - "Cbc0010I After 19621000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1469.84 seconds)\n", - "Cbc0010I After 19622000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1469.91 seconds)\n", - "Cbc0010I After 19623000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1469.98 seconds)\n", - "Cbc0010I After 19624000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1470.05 seconds)\n", - "Cbc0010I After 19625000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1470.12 seconds)\n", - "Cbc0010I After 19626000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1470.19 seconds)\n", - "Cbc0010I After 19627000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1470.27 seconds)\n", - "Cbc0010I After 19628000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1470.34 seconds)\n", - "Cbc0010I After 19629000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1470.41 seconds)\n", - "Cbc0010I After 19630000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1470.48 seconds)\n", - "Cbc0010I After 19631000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1470.56 seconds)\n", - "Cbc0010I After 19632000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1470.63 seconds)\n", - "Cbc0010I After 19633000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1470.70 seconds)\n", - "Cbc0010I After 19634000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1470.77 seconds)\n", - "Cbc0010I After 19635000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1470.84 seconds)\n", - "Cbc0010I After 19636000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1470.92 seconds)\n", - "Cbc0010I After 19637000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1471.00 seconds)\n", - "Cbc0010I After 19638000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1471.08 seconds)\n", - "Cbc0010I After 19639000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1471.15 seconds)\n", - "Cbc0010I After 19640000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1471.22 seconds)\n", - "Cbc0010I After 19641000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1471.29 seconds)\n", - "Cbc0010I After 19642000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1471.36 seconds)\n", - "Cbc0010I After 19643000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1471.43 seconds)\n", - "Cbc0010I After 19644000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1471.50 seconds)\n", - "Cbc0010I After 19645000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1471.57 seconds)\n", - "Cbc0010I After 19646000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1471.65 seconds)\n", - "Cbc0010I After 19647000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1471.72 seconds)\n", - "Cbc0010I After 19648000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1471.79 seconds)\n", - "Cbc0010I After 19649000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1471.86 seconds)\n", - "Cbc0010I After 19650000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1471.92 seconds)\n", - "Cbc0010I After 19651000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1471.99 seconds)\n", - "Cbc0010I After 19652000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1472.06 seconds)\n", - "Cbc0010I After 19653000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1472.12 seconds)\n", - "Cbc0010I After 19654000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1472.19 seconds)\n", - "Cbc0010I After 19655000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.26 seconds)\n", - "Cbc0010I After 19656000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1472.33 seconds)\n", - "Cbc0010I After 19657000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1472.41 seconds)\n", - "Cbc0010I After 19658000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.48 seconds)\n", - "Cbc0010I After 19659000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1472.54 seconds)\n", - "Cbc0010I After 19660000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1472.61 seconds)\n", - "Cbc0010I After 19661000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1472.70 seconds)\n", - "Cbc0010I After 19662000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1472.78 seconds)\n", - "Cbc0010I After 19663000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1472.86 seconds)\n", - "Cbc0010I After 19664000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1472.93 seconds)\n", - "Cbc0010I After 19665000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1473.01 seconds)\n", - "Cbc0010I After 19666000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.08 seconds)\n", - "Cbc0010I After 19667000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1473.15 seconds)\n", - "Cbc0010I After 19668000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1473.23 seconds)\n", - "Cbc0010I After 19669000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.30 seconds)\n", - "Cbc0010I After 19670000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1473.38 seconds)\n", - "Cbc0010I After 19671000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1473.45 seconds)\n", - "Cbc0010I After 19672000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1473.53 seconds)\n", - "Cbc0010I After 19673000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1473.60 seconds)\n", - "Cbc0010I After 19674000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1473.67 seconds)\n", - "Cbc0010I After 19675000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1473.75 seconds)\n", - "Cbc0010I After 19676000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1473.82 seconds)\n", - "Cbc0010I After 19677000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1473.90 seconds)\n", - "Cbc0010I After 19678000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1473.97 seconds)\n", - "Cbc0010I After 19679000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1474.04 seconds)\n", - "Cbc0010I After 19680000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1474.11 seconds)\n", - "Cbc0010I After 19681000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1474.18 seconds)\n", - "Cbc0010I After 19682000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1474.25 seconds)\n", - "Cbc0010I After 19683000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1474.32 seconds)\n", - "Cbc0010I After 19684000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1474.39 seconds)\n", - "Cbc0010I After 19685000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1474.46 seconds)\n", - "Cbc0010I After 19686000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1474.52 seconds)\n", - "Cbc0010I After 19687000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1474.60 seconds)\n", - "Cbc0010I After 19688000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1474.66 seconds)\n", - "Cbc0010I After 19689000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1474.73 seconds)\n", - "Cbc0010I After 19690000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1474.80 seconds)\n", - "Cbc0010I After 19691000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1474.88 seconds)\n", - "Cbc0010I After 19692000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1474.96 seconds)\n", - "Cbc0010I After 19693000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1475.04 seconds)\n", - "Cbc0010I After 19694000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1475.11 seconds)\n", - "Cbc0010I After 19695000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1475.19 seconds)\n", - "Cbc0010I After 19696000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1475.26 seconds)\n", - "Cbc0010I After 19697000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1475.33 seconds)\n", - "Cbc0010I After 19698000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1475.41 seconds)\n", - "Cbc0010I After 19699000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1475.47 seconds)\n", - "Cbc0010I After 19700000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1475.54 seconds)\n", - "Cbc0010I After 19701000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1475.62 seconds)\n", - "Cbc0010I After 19702000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1475.69 seconds)\n", - "Cbc0010I After 19703000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1475.77 seconds)\n", - "Cbc0010I After 19704000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1475.84 seconds)\n", - "Cbc0010I After 19705000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1475.92 seconds)\n", - "Cbc0010I After 19706000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1476.00 seconds)\n", - "Cbc0010I After 19707000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1476.08 seconds)\n", - "Cbc0010I After 19708000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1476.15 seconds)\n", - "Cbc0010I After 19709000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1476.22 seconds)\n", - "Cbc0010I After 19710000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1476.29 seconds)\n", - "Cbc0010I After 19711000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1476.37 seconds)\n", - "Cbc0010I After 19712000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1476.44 seconds)\n", - "Cbc0010I After 19713000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1476.51 seconds)\n", - "Cbc0010I After 19714000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1476.59 seconds)\n", - "Cbc0010I After 19715000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1476.66 seconds)\n", - "Cbc0010I After 19716000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1476.74 seconds)\n", - "Cbc0010I After 19717000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1476.83 seconds)\n", - "Cbc0010I After 19718000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1476.90 seconds)\n", - "Cbc0010I After 19719000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1476.97 seconds)\n", - "Cbc0010I After 19720000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1477.04 seconds)\n", - "Cbc0010I After 19721000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1477.11 seconds)\n", - "Cbc0010I After 19722000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1477.18 seconds)\n", - "Cbc0010I After 19723000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1477.25 seconds)\n", - "Cbc0010I After 19724000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1477.32 seconds)\n", - "Cbc0010I After 19725000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1477.39 seconds)\n", - "Cbc0010I After 19726000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1477.45 seconds)\n", - "Cbc0010I After 19727000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1477.51 seconds)\n", - "Cbc0010I After 19728000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1477.58 seconds)\n", - "Cbc0010I After 19729000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1477.65 seconds)\n", - "Cbc0010I After 19730000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1477.72 seconds)\n", - "Cbc0010I After 19731000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1477.79 seconds)\n", - "Cbc0010I After 19732000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1477.86 seconds)\n", - "Cbc0010I After 19733000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1477.92 seconds)\n", - "Cbc0010I After 19734000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1478.00 seconds)\n", - "Cbc0010I After 19735000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1478.07 seconds)\n", - "Cbc0010I After 19736000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1478.14 seconds)\n", - "Cbc0010I After 19737000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1478.20 seconds)\n", - "Cbc0010I After 19738000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1478.27 seconds)\n", - "Cbc0010I After 19739000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1478.34 seconds)\n", - "Cbc0010I After 19740000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1478.41 seconds)\n", - "Cbc0010I After 19741000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1478.48 seconds)\n", - "Cbc0010I After 19742000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1478.56 seconds)\n", - "Cbc0010I After 19743000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1478.64 seconds)\n", - "Cbc0010I After 19744000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1478.71 seconds)\n", - "Cbc0010I After 19745000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1478.82 seconds)\n", - "Cbc0010I After 19746000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1478.91 seconds)\n", - "Cbc0010I After 19747000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1478.99 seconds)\n", - "Cbc0010I After 19748000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1479.07 seconds)\n", - "Cbc0010I After 19749000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1479.14 seconds)\n", - "Cbc0010I After 19750000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1479.21 seconds)\n", - "Cbc0010I After 19751000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1479.29 seconds)\n", - "Cbc0010I After 19752000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1479.36 seconds)\n", - "Cbc0010I After 19753000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1479.44 seconds)\n", - "Cbc0010I After 19754000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1479.51 seconds)\n", - "Cbc0010I After 19755000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1479.58 seconds)\n", - "Cbc0010I After 19756000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1479.65 seconds)\n", - "Cbc0010I After 19757000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1479.72 seconds)\n", - "Cbc0010I After 19758000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1479.80 seconds)\n", - "Cbc0010I After 19759000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1479.87 seconds)\n", - "Cbc0010I After 19760000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1479.94 seconds)\n", - "Cbc0010I After 19761000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1480.01 seconds)\n", - "Cbc0010I After 19762000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1480.08 seconds)\n", - "Cbc0010I After 19763000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1480.15 seconds)\n", - "Cbc0010I After 19764000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1480.23 seconds)\n", - "Cbc0010I After 19765000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1480.30 seconds)\n", - "Cbc0010I After 19766000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1480.38 seconds)\n", - "Cbc0010I After 19767000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1480.45 seconds)\n", - "Cbc0010I After 19768000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1480.53 seconds)\n", - "Cbc0010I After 19769000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1480.60 seconds)\n", - "Cbc0010I After 19770000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1480.67 seconds)\n", - "Cbc0010I After 19771000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1480.74 seconds)\n", - "Cbc0010I After 19772000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1480.81 seconds)\n", - "Cbc0010I After 19773000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1480.88 seconds)\n", - "Cbc0010I After 19774000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1480.95 seconds)\n", - "Cbc0010I After 19775000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1481.01 seconds)\n", - "Cbc0010I After 19776000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1481.08 seconds)\n", - "Cbc0010I After 19777000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1481.15 seconds)\n", - "Cbc0010I After 19778000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1481.23 seconds)\n", - "Cbc0010I After 19779000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1481.30 seconds)\n", - "Cbc0010I After 19780000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1481.37 seconds)\n", - "Cbc0010I After 19781000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1481.45 seconds)\n", - "Cbc0010I After 19782000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1481.52 seconds)\n", - "Cbc0010I After 19783000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1481.59 seconds)\n", - "Cbc0010I After 19784000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1481.66 seconds)\n", - "Cbc0010I After 19785000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1481.73 seconds)\n", - "Cbc0010I After 19786000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1481.86 seconds)\n", - "Cbc0010I After 19787000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1481.95 seconds)\n", - "Cbc0010I After 19788000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1482.03 seconds)\n", - "Cbc0010I After 19789000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1482.11 seconds)\n", - "Cbc0010I After 19790000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1482.19 seconds)\n", - "Cbc0010I After 19791000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1482.26 seconds)\n", - "Cbc0010I After 19792000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1482.33 seconds)\n", - "Cbc0010I After 19793000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1482.40 seconds)\n", - "Cbc0010I After 19794000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1482.48 seconds)\n", - "Cbc0010I After 19795000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1482.55 seconds)\n", - "Cbc0010I After 19796000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1482.63 seconds)\n", - "Cbc0010I After 19797000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1482.69 seconds)\n", - "Cbc0010I After 19798000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1482.77 seconds)\n", - "Cbc0010I After 19799000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1482.83 seconds)\n", - "Cbc0010I After 19800000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1482.90 seconds)\n", - "Cbc0010I After 19801000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1482.98 seconds)\n", - "Cbc0010I After 19802000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1483.05 seconds)\n", - "Cbc0010I After 19803000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1483.13 seconds)\n", - "Cbc0010I After 19804000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1483.20 seconds)\n", - "Cbc0010I After 19805000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1483.27 seconds)\n", - "Cbc0010I After 19806000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1483.34 seconds)\n", - "Cbc0010I After 19807000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1483.41 seconds)\n", - "Cbc0010I After 19808000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1483.47 seconds)\n", - "Cbc0010I After 19809000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1483.54 seconds)\n", - "Cbc0010I After 19810000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1483.61 seconds)\n", - "Cbc0010I After 19811000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1483.68 seconds)\n", - "Cbc0010I After 19812000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1483.75 seconds)\n", - "Cbc0010I After 19813000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1483.82 seconds)\n", - "Cbc0010I After 19814000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1483.89 seconds)\n", - "Cbc0010I After 19815000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1483.96 seconds)\n", - "Cbc0010I After 19816000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1484.03 seconds)\n", - "Cbc0010I After 19817000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1484.09 seconds)\n", - "Cbc0010I After 19818000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1484.16 seconds)\n", - "Cbc0010I After 19819000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1484.23 seconds)\n", - "Cbc0010I After 19820000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1484.30 seconds)\n", - "Cbc0010I After 19821000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1484.39 seconds)\n", - "Cbc0010I After 19822000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1484.48 seconds)\n", - "Cbc0010I After 19823000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1484.56 seconds)\n", - "Cbc0010I After 19824000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1484.64 seconds)\n", - "Cbc0010I After 19825000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1484.71 seconds)\n", - "Cbc0010I After 19826000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1484.78 seconds)\n", - "Cbc0010I After 19827000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1484.85 seconds)\n", - "Cbc0010I After 19828000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1484.93 seconds)\n", - "Cbc0010I After 19829000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1485.00 seconds)\n", - "Cbc0010I After 19830000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1485.07 seconds)\n", - "Cbc0010I After 19831000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1485.15 seconds)\n", - "Cbc0010I After 19832000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1485.22 seconds)\n", - "Cbc0010I After 19833000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1485.30 seconds)\n", - "Cbc0010I After 19834000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1485.37 seconds)\n", - "Cbc0010I After 19835000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1485.45 seconds)\n", - "Cbc0010I After 19836000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1485.52 seconds)\n", - "Cbc0010I After 19837000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1485.59 seconds)\n", - "Cbc0010I After 19838000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1485.67 seconds)\n", - "Cbc0010I After 19839000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1485.74 seconds)\n", - "Cbc0010I After 19840000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1485.82 seconds)\n", - "Cbc0010I After 19841000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1485.89 seconds)\n", - "Cbc0010I After 19842000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1485.96 seconds)\n", - "Cbc0010I After 19843000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1486.04 seconds)\n", - "Cbc0010I After 19844000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1486.11 seconds)\n", - "Cbc0010I After 19845000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1486.19 seconds)\n", - "Cbc0010I After 19846000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1486.25 seconds)\n", - "Cbc0010I After 19847000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1486.32 seconds)\n", - "Cbc0010I After 19848000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1486.40 seconds)\n", - "Cbc0010I After 19849000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1486.47 seconds)\n", - "Cbc0010I After 19850000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1486.55 seconds)\n", - "Cbc0010I After 19851000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1486.63 seconds)\n", - "Cbc0010I After 19852000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1486.70 seconds)\n", - "Cbc0010I After 19853000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1486.77 seconds)\n", - "Cbc0010I After 19854000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1486.84 seconds)\n", - "Cbc0010I After 19855000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1486.92 seconds)\n", - "Cbc0010I After 19856000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1486.99 seconds)\n", - "Cbc0010I After 19857000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1487.06 seconds)\n", - "Cbc0010I After 19858000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1487.13 seconds)\n", - "Cbc0010I After 19859000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.21 seconds)\n", - "Cbc0010I After 19860000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1487.28 seconds)\n", - "Cbc0010I After 19861000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1487.37 seconds)\n", - "Cbc0010I After 19862000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1487.45 seconds)\n", - "Cbc0010I After 19863000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1487.53 seconds)\n", - "Cbc0010I After 19864000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.60 seconds)\n", - "Cbc0010I After 19865000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1487.67 seconds)\n", - "Cbc0010I After 19866000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1487.74 seconds)\n", - "Cbc0010I After 19867000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1487.81 seconds)\n", - "Cbc0010I After 19868000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1487.89 seconds)\n", - "Cbc0010I After 19869000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1487.96 seconds)\n", - "Cbc0010I After 19870000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1488.05 seconds)\n", - "Cbc0010I After 19871000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1488.12 seconds)\n", - "Cbc0010I After 19872000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1488.19 seconds)\n", - "Cbc0010I After 19873000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1488.26 seconds)\n", - "Cbc0010I After 19874000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1488.33 seconds)\n", - "Cbc0010I After 19875000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1488.42 seconds)\n", - "Cbc0010I After 19876000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1488.50 seconds)\n", - "Cbc0010I After 19877000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1488.57 seconds)\n", - "Cbc0010I After 19878000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1488.64 seconds)\n", - "Cbc0010I After 19879000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1488.72 seconds)\n", - "Cbc0010I After 19880000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1488.80 seconds)\n", - "Cbc0010I After 19881000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1488.87 seconds)\n", - "Cbc0010I After 19882000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1488.94 seconds)\n", - "Cbc0010I After 19883000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1489.00 seconds)\n", - "Cbc0010I After 19884000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1489.07 seconds)\n", - "Cbc0010I After 19885000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1489.14 seconds)\n", - "Cbc0010I After 19886000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1489.20 seconds)\n", - "Cbc0010I After 19887000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1489.27 seconds)\n", - "Cbc0010I After 19888000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1489.34 seconds)\n", - "Cbc0010I After 19889000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1489.42 seconds)\n", - "Cbc0010I After 19890000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1489.49 seconds)\n", - "Cbc0010I After 19891000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1489.56 seconds)\n", - "Cbc0010I After 19892000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1489.63 seconds)\n", - "Cbc0010I After 19893000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1489.70 seconds)\n", - "Cbc0010I After 19894000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1489.77 seconds)\n", - "Cbc0010I After 19895000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1489.84 seconds)\n", - "Cbc0010I After 19896000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1489.92 seconds)\n", - "Cbc0010I After 19897000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1489.98 seconds)\n", - "Cbc0010I After 19898000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1490.05 seconds)\n", - "Cbc0010I After 19899000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1490.12 seconds)\n", - "Cbc0010I After 19900000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1490.19 seconds)\n", - "Cbc0010I After 19901000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1490.26 seconds)\n", - "Cbc0010I After 19902000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1490.33 seconds)\n", - "Cbc0010I After 19903000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1490.40 seconds)\n", - "Cbc0010I After 19904000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1490.47 seconds)\n", - "Cbc0010I After 19905000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1490.54 seconds)\n", - "Cbc0010I After 19906000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1490.61 seconds)\n", - "Cbc0010I After 19907000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1490.68 seconds)\n", - "Cbc0010I After 19908000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1490.75 seconds)\n", - "Cbc0010I After 19909000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1490.82 seconds)\n", - "Cbc0010I After 19910000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1490.89 seconds)\n", - "Cbc0010I After 19911000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1490.97 seconds)\n", - "Cbc0010I After 19912000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1491.05 seconds)\n", - "Cbc0010I After 19913000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1491.12 seconds)\n", - "Cbc0010I After 19914000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1491.20 seconds)\n", - "Cbc0010I After 19915000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1491.27 seconds)\n", - "Cbc0010I After 19916000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1491.34 seconds)\n", - "Cbc0010I After 19917000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1491.41 seconds)\n", - "Cbc0010I After 19918000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1491.48 seconds)\n", - "Cbc0010I After 19919000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1491.55 seconds)\n", - "Cbc0010I After 19920000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1491.62 seconds)\n", - "Cbc0010I After 19921000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (1491.69 seconds)\n", - "Cbc0010I After 19922000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1491.76 seconds)\n", - "Cbc0010I After 19923000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1491.84 seconds)\n", - "Cbc0010I After 19924000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1491.91 seconds)\n", - "Cbc0010I After 19925000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1491.98 seconds)\n", - "Cbc0010I After 19926000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1492.05 seconds)\n", - "Cbc0010I After 19927000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1492.12 seconds)\n", - "Cbc0010I After 19928000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1492.20 seconds)\n", - "Cbc0010I After 19929000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1492.27 seconds)\n", - "Cbc0010I After 19930000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1492.34 seconds)\n", - "Cbc0010I After 19931000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1492.41 seconds)\n", - "Cbc0010I After 19932000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1492.49 seconds)\n", - "Cbc0010I After 19933000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1492.56 seconds)\n", - "Cbc0010I After 19934000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1492.63 seconds)\n", - "Cbc0010I After 19935000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1492.70 seconds)\n", - "Cbc0010I After 19936000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1492.78 seconds)\n", - "Cbc0010I After 19937000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1492.85 seconds)\n", - "Cbc0010I After 19938000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1492.93 seconds)\n", - "Cbc0010I After 19939000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1493.00 seconds)\n", - "Cbc0010I After 19940000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1493.08 seconds)\n", - "Cbc0010I After 19941000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1493.15 seconds)\n", - "Cbc0010I After 19942000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1493.22 seconds)\n", - "Cbc0010I After 19943000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1493.29 seconds)\n", - "Cbc0010I After 19944000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1493.37 seconds)\n", - "Cbc0010I After 19945000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1493.44 seconds)\n", - "Cbc0010I After 19946000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1493.51 seconds)\n", - "Cbc0010I After 19947000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1493.59 seconds)\n", - "Cbc0010I After 19948000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1493.66 seconds)\n", - "Cbc0010I After 19949000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1493.73 seconds)\n", - "Cbc0010I After 19950000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1493.81 seconds)\n", - "Cbc0010I After 19951000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1493.88 seconds)\n", - "Cbc0010I After 19952000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1493.95 seconds)\n", - "Cbc0010I After 19953000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1494.03 seconds)\n", - "Cbc0010I After 19954000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1494.10 seconds)\n", - "Cbc0010I After 19955000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1494.17 seconds)\n", - "Cbc0010I After 19956000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1494.25 seconds)\n", - "Cbc0010I After 19957000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1494.32 seconds)\n", - "Cbc0010I After 19958000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1494.40 seconds)\n", - "Cbc0010I After 19959000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1494.47 seconds)\n", - "Cbc0010I After 19960000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1494.54 seconds)\n", - "Cbc0010I After 19961000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1494.61 seconds)\n", - "Cbc0010I After 19962000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1494.69 seconds)\n", - "Cbc0010I After 19963000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1494.75 seconds)\n", - "Cbc0010I After 19964000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1494.83 seconds)\n", - "Cbc0010I After 19965000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1494.91 seconds)\n", - "Cbc0010I After 19966000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1494.98 seconds)\n", - "Cbc0010I After 19967000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1495.06 seconds)\n", - "Cbc0010I After 19968000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1495.13 seconds)\n", - "Cbc0010I After 19969000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1495.20 seconds)\n", - "Cbc0010I After 19970000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1495.28 seconds)\n", - "Cbc0010I After 19971000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1495.36 seconds)\n", - "Cbc0010I After 19972000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1495.43 seconds)\n", - "Cbc0010I After 19973000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1495.50 seconds)\n", - "Cbc0010I After 19974000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1495.57 seconds)\n", - "Cbc0010I After 19975000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1495.65 seconds)\n", - "Cbc0010I After 19976000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1495.72 seconds)\n", - "Cbc0010I After 19977000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1495.80 seconds)\n", - "Cbc0010I After 19978000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1495.87 seconds)\n", - "Cbc0010I After 19979000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1495.94 seconds)\n", - "Cbc0010I After 19980000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1496.03 seconds)\n", - "Cbc0010I After 19981000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1496.11 seconds)\n", - "Cbc0010I After 19982000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1496.19 seconds)\n", - "Cbc0010I After 19983000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1496.26 seconds)\n", - "Cbc0010I After 19984000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1496.34 seconds)\n", - "Cbc0010I After 19985000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1496.41 seconds)\n", - "Cbc0010I After 19986000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1496.48 seconds)\n", - "Cbc0010I After 19987000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1496.55 seconds)\n", - "Cbc0010I After 19988000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1496.63 seconds)\n", - "Cbc0010I After 19989000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1496.70 seconds)\n", - "Cbc0010I After 19990000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1496.77 seconds)\n", - "Cbc0010I After 19991000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1496.84 seconds)\n", - "Cbc0010I After 19992000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1496.92 seconds)\n", - "Cbc0010I After 19993000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1496.99 seconds)\n", - "Cbc0010I After 19994000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1497.07 seconds)\n", - "Cbc0010I After 19995000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1497.22 seconds)\n", - "Cbc0010I After 19996000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1497.31 seconds)\n", - "Cbc0010I After 19997000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1497.42 seconds)\n", - "Cbc0010I After 19998000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1497.53 seconds)\n", - "Cbc0010I After 19999000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1497.62 seconds)\n", - "Cbc0010I After 20000000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1497.70 seconds)\n", - "Cbc0010I After 20001000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1497.78 seconds)\n", - "Cbc0010I After 20002000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1497.86 seconds)\n", - "Cbc0010I After 20003000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1497.93 seconds)\n", - "Cbc0010I After 20004000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1498.01 seconds)\n", - "Cbc0010I After 20005000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1498.08 seconds)\n", - "Cbc0010I After 20006000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1498.15 seconds)\n", - "Cbc0010I After 20007000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1498.22 seconds)\n", - "Cbc0010I After 20008000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1498.30 seconds)\n", - "Cbc0010I After 20009000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1498.37 seconds)\n", - "Cbc0010I After 20010000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1498.45 seconds)\n", - "Cbc0010I After 20011000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1498.53 seconds)\n", - "Cbc0010I After 20012000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1498.60 seconds)\n", - "Cbc0010I After 20013000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1498.68 seconds)\n", - "Cbc0010I After 20014000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1498.75 seconds)\n", - "Cbc0010I After 20015000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1498.83 seconds)\n", - "Cbc0010I After 20016000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1498.91 seconds)\n", - "Cbc0010I After 20017000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1498.98 seconds)\n", - "Cbc0010I After 20018000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1499.05 seconds)\n", - "Cbc0010I After 20019000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1499.13 seconds)\n", - "Cbc0010I After 20020000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1499.21 seconds)\n", - "Cbc0010I After 20021000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1499.28 seconds)\n", - "Cbc0010I After 20022000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1499.38 seconds)\n", - "Cbc0010I After 20023000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1499.49 seconds)\n", - "Cbc0010I After 20024000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1499.58 seconds)\n", - "Cbc0010I After 20025000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1499.66 seconds)\n", - "Cbc0010I After 20026000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1499.74 seconds)\n", - "Cbc0010I After 20027000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1499.81 seconds)\n", - "Cbc0010I After 20028000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1499.89 seconds)\n", - "Cbc0010I After 20029000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1499.96 seconds)\n", - "Cbc0010I After 20030000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1500.04 seconds)\n", - "Cbc0010I After 20031000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1500.12 seconds)\n", - "Cbc0010I After 20032000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1500.19 seconds)\n", - "Cbc0010I After 20033000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1500.27 seconds)\n", - "Cbc0010I After 20034000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1500.34 seconds)\n", - "Cbc0010I After 20035000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1500.42 seconds)\n", - "Cbc0010I After 20036000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1500.50 seconds)\n", - "Cbc0010I After 20037000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1500.58 seconds)\n", - "Cbc0010I After 20038000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1500.64 seconds)\n", - "Cbc0010I After 20039000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1500.70 seconds)\n", - "Cbc0010I After 20040000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1500.76 seconds)\n", - "Cbc0010I After 20041000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1500.82 seconds)\n", - "Cbc0010I After 20042000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1500.88 seconds)\n", - "Cbc0010I After 20043000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1500.94 seconds)\n", - "Cbc0010I After 20044000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1501.00 seconds)\n", - "Cbc0010I After 20045000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1501.06 seconds)\n", - "Cbc0010I After 20046000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1501.12 seconds)\n", - "Cbc0010I After 20047000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1501.18 seconds)\n", - "Cbc0010I After 20048000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1501.23 seconds)\n", - "Cbc0010I After 20049000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1501.30 seconds)\n", - "Cbc0010I After 20050000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1501.37 seconds)\n", - "Cbc0010I After 20051000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1501.43 seconds)\n", - "Cbc0010I After 20052000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1501.49 seconds)\n", - "Cbc0010I After 20053000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1501.55 seconds)\n", - "Cbc0010I After 20054000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1501.61 seconds)\n", - "Cbc0010I After 20055000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1501.66 seconds)\n", - "Cbc0010I After 20056000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1501.72 seconds)\n", - "Cbc0010I After 20057000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1501.78 seconds)\n", - "Cbc0010I After 20058000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1501.83 seconds)\n", - "Cbc0010I After 20059000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1501.89 seconds)\n", - "Cbc0010I After 20060000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1501.95 seconds)\n", - "Cbc0010I After 20061000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1502.02 seconds)\n", - "Cbc0010I After 20062000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1502.07 seconds)\n", - "Cbc0010I After 20063000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1502.13 seconds)\n", - "Cbc0010I After 20064000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1502.19 seconds)\n", - "Cbc0010I After 20065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1502.26 seconds)\n", - "Cbc0010I After 20066000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1502.32 seconds)\n", - "Cbc0010I After 20067000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1502.38 seconds)\n", - "Cbc0010I After 20068000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1502.45 seconds)\n", - "Cbc0010I After 20069000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1502.51 seconds)\n", - "Cbc0010I After 20070000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1502.57 seconds)\n", - "Cbc0010I After 20071000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1502.63 seconds)\n", - "Cbc0010I After 20072000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1502.69 seconds)\n", - "Cbc0010I After 20073000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1502.76 seconds)\n", - "Cbc0010I After 20074000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1502.82 seconds)\n", - "Cbc0010I After 20075000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1502.88 seconds)\n", - "Cbc0010I After 20076000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1502.93 seconds)\n", - "Cbc0010I After 20077000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1503.00 seconds)\n", - "Cbc0010I After 20078000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1503.07 seconds)\n", - "Cbc0010I After 20079000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1503.13 seconds)\n", - "Cbc0010I After 20080000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1503.19 seconds)\n", - "Cbc0010I After 20081000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1503.25 seconds)\n", - "Cbc0010I After 20082000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1503.33 seconds)\n", - "Cbc0010I After 20083000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1503.39 seconds)\n", - "Cbc0010I After 20084000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1503.46 seconds)\n", - "Cbc0010I After 20085000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1503.53 seconds)\n", - "Cbc0010I After 20086000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1503.61 seconds)\n", - "Cbc0010I After 20087000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1503.67 seconds)\n", - "Cbc0010I After 20088000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1503.75 seconds)\n", - "Cbc0010I After 20089000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1503.80 seconds)\n", - "Cbc0010I After 20090000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1503.88 seconds)\n", - "Cbc0010I After 20091000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1503.95 seconds)\n", - "Cbc0010I After 20092000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1504.01 seconds)\n", - "Cbc0010I After 20093000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1504.07 seconds)\n", - "Cbc0010I After 20094000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1504.13 seconds)\n", - "Cbc0010I After 20095000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1504.20 seconds)\n", - "Cbc0010I After 20096000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1504.27 seconds)\n", - "Cbc0010I After 20097000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1504.33 seconds)\n", - "Cbc0010I After 20098000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1504.40 seconds)\n", - "Cbc0010I After 20099000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1504.46 seconds)\n", - "Cbc0010I After 20100000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1504.53 seconds)\n", - "Cbc0010I After 20101000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1504.60 seconds)\n", - "Cbc0010I After 20102000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1504.66 seconds)\n", - "Cbc0010I After 20103000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1504.72 seconds)\n", - "Cbc0010I After 20104000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1504.78 seconds)\n", - "Cbc0010I After 20105000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1504.85 seconds)\n", - "Cbc0010I After 20106000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1504.91 seconds)\n", - "Cbc0010I After 20107000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1504.97 seconds)\n", - "Cbc0010I After 20108000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1505.04 seconds)\n", - "Cbc0010I After 20109000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1505.13 seconds)\n", - "Cbc0010I After 20110000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1505.20 seconds)\n", - "Cbc0010I After 20111000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1505.25 seconds)\n", - "Cbc0010I After 20112000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1505.31 seconds)\n", - "Cbc0010I After 20113000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1505.37 seconds)\n", - "Cbc0010I After 20114000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1505.43 seconds)\n", - "Cbc0010I After 20115000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1505.49 seconds)\n", - "Cbc0010I After 20116000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1505.55 seconds)\n", - "Cbc0010I After 20117000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1505.61 seconds)\n", - "Cbc0010I After 20118000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1505.67 seconds)\n", - "Cbc0010I After 20119000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1505.75 seconds)\n", - "Cbc0010I After 20120000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1505.82 seconds)\n", - "Cbc0010I After 20121000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1505.89 seconds)\n", - "Cbc0010I After 20122000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1505.97 seconds)\n", - "Cbc0010I After 20123000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1506.04 seconds)\n", - "Cbc0010I After 20124000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1506.10 seconds)\n", - "Cbc0010I After 20125000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1506.17 seconds)\n", - "Cbc0010I After 20126000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1506.23 seconds)\n", - "Cbc0010I After 20127000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1506.29 seconds)\n", - "Cbc0010I After 20128000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1506.35 seconds)\n", - "Cbc0010I After 20129000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1506.41 seconds)\n", - "Cbc0010I After 20130000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1506.47 seconds)\n", - "Cbc0010I After 20131000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1506.53 seconds)\n", - "Cbc0010I After 20132000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1506.59 seconds)\n", - "Cbc0010I After 20133000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1506.64 seconds)\n", - "Cbc0010I After 20134000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1506.70 seconds)\n", - "Cbc0010I After 20135000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1506.77 seconds)\n", - "Cbc0010I After 20136000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1506.82 seconds)\n", - "Cbc0010I After 20137000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1506.88 seconds)\n", - "Cbc0010I After 20138000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1506.94 seconds)\n", - "Cbc0010I After 20139000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1507.00 seconds)\n", - "Cbc0010I After 20140000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1507.07 seconds)\n", - "Cbc0010I After 20141000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1507.13 seconds)\n", - "Cbc0010I After 20142000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1507.19 seconds)\n", - "Cbc0010I After 20143000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1507.25 seconds)\n", - "Cbc0010I After 20144000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1507.31 seconds)\n", - "Cbc0010I After 20145000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1507.37 seconds)\n", - "Cbc0010I After 20146000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1507.43 seconds)\n", - "Cbc0010I After 20147000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1507.49 seconds)\n", - "Cbc0010I After 20148000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1507.55 seconds)\n", - "Cbc0010I After 20149000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1507.61 seconds)\n", - "Cbc0010I After 20150000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1507.67 seconds)\n", - "Cbc0010I After 20151000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1507.73 seconds)\n", - "Cbc0010I After 20152000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1507.79 seconds)\n", - "Cbc0010I After 20153000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1507.85 seconds)\n", - "Cbc0010I After 20154000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1507.91 seconds)\n", - "Cbc0010I After 20155000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1507.98 seconds)\n", - "Cbc0010I After 20156000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1508.04 seconds)\n", - "Cbc0010I After 20157000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1508.11 seconds)\n", - "Cbc0010I After 20158000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1508.17 seconds)\n", - "Cbc0010I After 20159000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1508.24 seconds)\n", - "Cbc0010I After 20160000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1508.31 seconds)\n", - "Cbc0010I After 20161000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1508.39 seconds)\n", - "Cbc0010I After 20162000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1508.47 seconds)\n", - "Cbc0010I After 20163000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1508.54 seconds)\n", - "Cbc0010I After 20164000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1508.59 seconds)\n", - "Cbc0010I After 20165000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1508.64 seconds)\n", - "Cbc0010I After 20166000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1508.71 seconds)\n", - "Cbc0010I After 20167000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1508.76 seconds)\n", - "Cbc0010I After 20168000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1508.82 seconds)\n", - "Cbc0010I After 20169000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1508.88 seconds)\n", - "Cbc0010I After 20170000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1508.94 seconds)\n", - "Cbc0010I After 20171000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1509.01 seconds)\n", - "Cbc0010I After 20172000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1509.17 seconds)\n", - "Cbc0010I After 20173000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1509.32 seconds)\n", - "Cbc0010I After 20174000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1509.40 seconds)\n", - "Cbc0010I After 20175000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1509.46 seconds)\n", - "Cbc0010I After 20176000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1509.54 seconds)\n", - "Cbc0010I After 20177000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1509.61 seconds)\n", - "Cbc0010I After 20178000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1509.68 seconds)\n", - "Cbc0010I After 20179000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1509.73 seconds)\n", - "Cbc0010I After 20180000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1509.78 seconds)\n", - "Cbc0010I After 20181000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1509.85 seconds)\n", - "Cbc0010I After 20182000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1509.91 seconds)\n", - "Cbc0010I After 20183000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1509.99 seconds)\n", - "Cbc0010I After 20184000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1510.08 seconds)\n", - "Cbc0010I After 20185000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1510.16 seconds)\n", - "Cbc0010I After 20186000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1510.22 seconds)\n", - "Cbc0010I After 20187000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1510.28 seconds)\n", - "Cbc0010I After 20188000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1510.34 seconds)\n", - "Cbc0010I After 20189000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1510.40 seconds)\n", - "Cbc0010I After 20190000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1510.45 seconds)\n", - "Cbc0010I After 20191000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1510.51 seconds)\n", - "Cbc0010I After 20192000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1510.57 seconds)\n", - "Cbc0010I After 20193000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1510.63 seconds)\n", - "Cbc0010I After 20194000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1510.69 seconds)\n", - "Cbc0010I After 20195000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1510.75 seconds)\n", - "Cbc0010I After 20196000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1510.81 seconds)\n", - "Cbc0010I After 20197000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1510.88 seconds)\n", - "Cbc0010I After 20198000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1510.93 seconds)\n", - "Cbc0010I After 20199000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1510.99 seconds)\n", - "Cbc0010I After 20200000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1511.05 seconds)\n", - "Cbc0010I After 20201000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1511.12 seconds)\n", - "Cbc0010I After 20202000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1511.19 seconds)\n", - "Cbc0010I After 20203000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1511.27 seconds)\n", - "Cbc0010I After 20204000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1511.35 seconds)\n", - "Cbc0010I After 20205000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1511.42 seconds)\n", - "Cbc0010I After 20206000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1511.50 seconds)\n", - "Cbc0010I After 20207000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1511.56 seconds)\n", - "Cbc0010I After 20208000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1511.64 seconds)\n", - "Cbc0010I After 20209000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1511.71 seconds)\n", - "Cbc0010I After 20210000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1511.78 seconds)\n", - "Cbc0010I After 20211000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1511.85 seconds)\n", - "Cbc0010I After 20212000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1511.93 seconds)\n", - "Cbc0010I After 20213000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1512.00 seconds)\n", - "Cbc0010I After 20214000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1512.07 seconds)\n", - "Cbc0010I After 20215000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1512.14 seconds)\n", - "Cbc0010I After 20216000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1512.22 seconds)\n", - "Cbc0010I After 20217000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1512.30 seconds)\n", - "Cbc0010I After 20218000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1512.36 seconds)\n", - "Cbc0010I After 20219000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1512.44 seconds)\n", - "Cbc0010I After 20220000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1512.51 seconds)\n", - "Cbc0010I After 20221000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1512.57 seconds)\n", - "Cbc0010I After 20222000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1512.64 seconds)\n", - "Cbc0010I After 20223000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1512.71 seconds)\n", - "Cbc0010I After 20224000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1512.78 seconds)\n", - "Cbc0010I After 20225000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1512.85 seconds)\n", - "Cbc0010I After 20226000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1512.92 seconds)\n", - "Cbc0010I After 20227000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1512.99 seconds)\n", - "Cbc0010I After 20228000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1513.06 seconds)\n", - "Cbc0010I After 20229000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1513.13 seconds)\n", - "Cbc0010I After 20230000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1513.20 seconds)\n", - "Cbc0010I After 20231000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1513.27 seconds)\n", - "Cbc0010I After 20232000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1513.34 seconds)\n", - "Cbc0010I After 20233000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1513.41 seconds)\n", - "Cbc0010I After 20234000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1513.48 seconds)\n", - "Cbc0010I After 20235000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1513.55 seconds)\n", - "Cbc0010I After 20236000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1513.62 seconds)\n", - "Cbc0010I After 20237000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1513.69 seconds)\n", - "Cbc0010I After 20238000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1513.76 seconds)\n", - "Cbc0010I After 20239000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1513.83 seconds)\n", - "Cbc0010I After 20240000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1513.90 seconds)\n", - "Cbc0010I After 20241000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1513.97 seconds)\n", - "Cbc0010I After 20242000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1514.05 seconds)\n", - "Cbc0010I After 20243000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1514.13 seconds)\n", - "Cbc0010I After 20244000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1514.21 seconds)\n", - "Cbc0010I After 20245000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1514.31 seconds)\n", - "Cbc0010I After 20246000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1514.39 seconds)\n", - "Cbc0010I After 20247000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1514.47 seconds)\n", - "Cbc0010I After 20248000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1514.54 seconds)\n", - "Cbc0010I After 20249000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1514.62 seconds)\n", - "Cbc0010I After 20250000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1514.69 seconds)\n", - "Cbc0010I After 20251000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1514.76 seconds)\n", - "Cbc0010I After 20252000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1514.84 seconds)\n", - "Cbc0010I After 20253000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1514.92 seconds)\n", - "Cbc0010I After 20254000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1514.99 seconds)\n", - "Cbc0010I After 20255000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1515.07 seconds)\n", - "Cbc0010I After 20256000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1515.14 seconds)\n", - "Cbc0010I After 20257000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1515.21 seconds)\n", - "Cbc0010I After 20258000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1515.29 seconds)\n", - "Cbc0010I After 20259000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1515.36 seconds)\n", - "Cbc0010I After 20260000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1515.43 seconds)\n", - "Cbc0010I After 20261000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1515.50 seconds)\n", - "Cbc0010I After 20262000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1515.58 seconds)\n", - "Cbc0010I After 20263000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1515.65 seconds)\n", - "Cbc0010I After 20264000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1515.72 seconds)\n", - "Cbc0010I After 20265000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1515.80 seconds)\n", - "Cbc0010I After 20266000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1515.87 seconds)\n", - "Cbc0010I After 20267000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1515.96 seconds)\n", - "Cbc0010I After 20268000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1516.04 seconds)\n", - "Cbc0010I After 20269000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1516.12 seconds)\n", - "Cbc0010I After 20270000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1516.20 seconds)\n", - "Cbc0010I After 20271000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1516.27 seconds)\n", - "Cbc0010I After 20272000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1516.35 seconds)\n", - "Cbc0010I After 20273000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1516.42 seconds)\n", - "Cbc0010I After 20274000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1516.50 seconds)\n", - "Cbc0010I After 20275000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1516.58 seconds)\n", - "Cbc0010I After 20276000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1516.65 seconds)\n", - "Cbc0010I After 20277000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1516.72 seconds)\n", - "Cbc0010I After 20278000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1516.80 seconds)\n", - "Cbc0010I After 20279000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1516.87 seconds)\n", - "Cbc0010I After 20280000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1516.94 seconds)\n", - "Cbc0010I After 20281000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1517.02 seconds)\n", - "Cbc0010I After 20282000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1517.09 seconds)\n", - "Cbc0010I After 20283000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1517.17 seconds)\n", - "Cbc0010I After 20284000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1517.26 seconds)\n", - "Cbc0010I After 20285000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1517.35 seconds)\n", - "Cbc0010I After 20286000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1517.43 seconds)\n", - "Cbc0010I After 20287000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1517.50 seconds)\n", - "Cbc0010I After 20288000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1517.58 seconds)\n", - "Cbc0010I After 20289000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1517.66 seconds)\n", - "Cbc0010I After 20290000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1517.73 seconds)\n", - "Cbc0010I After 20291000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1517.81 seconds)\n", - "Cbc0010I After 20292000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1517.88 seconds)\n", - "Cbc0010I After 20293000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1517.96 seconds)\n", - "Cbc0010I After 20294000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1518.03 seconds)\n", - "Cbc0010I After 20295000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1518.11 seconds)\n", - "Cbc0010I After 20296000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1518.18 seconds)\n", - "Cbc0010I After 20297000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1518.26 seconds)\n", - "Cbc0010I After 20298000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1518.34 seconds)\n", - "Cbc0010I After 20299000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1518.41 seconds)\n", - "Cbc0010I After 20300000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1518.49 seconds)\n", - "Cbc0010I After 20301000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1518.57 seconds)\n", - "Cbc0010I After 20302000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1518.65 seconds)\n", - "Cbc0010I After 20303000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1518.72 seconds)\n", - "Cbc0010I After 20304000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1518.80 seconds)\n", - "Cbc0010I After 20305000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1518.88 seconds)\n", - "Cbc0010I After 20306000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1518.95 seconds)\n", - "Cbc0010I After 20307000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1519.03 seconds)\n", - "Cbc0010I After 20308000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1519.11 seconds)\n", - "Cbc0010I After 20309000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1519.18 seconds)\n", - "Cbc0010I After 20310000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.26 seconds)\n", - "Cbc0010I After 20311000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1519.35 seconds)\n", - "Cbc0010I After 20312000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1519.44 seconds)\n", - "Cbc0010I After 20313000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1519.52 seconds)\n", - "Cbc0010I After 20314000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.60 seconds)\n", - "Cbc0010I After 20315000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1519.68 seconds)\n", - "Cbc0010I After 20316000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1519.75 seconds)\n", - "Cbc0010I After 20317000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1519.83 seconds)\n", - "Cbc0010I After 20318000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1519.90 seconds)\n", - "Cbc0010I After 20319000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1519.98 seconds)\n", - "Cbc0010I After 20320000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1520.05 seconds)\n", - "Cbc0010I After 20321000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1520.13 seconds)\n", - "Cbc0010I After 20322000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1520.20 seconds)\n", - "Cbc0010I After 20323000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1520.28 seconds)\n", - "Cbc0010I After 20324000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1520.34 seconds)\n", - "Cbc0010I After 20325000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1520.41 seconds)\n", - "Cbc0010I After 20326000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1520.47 seconds)\n", - "Cbc0010I After 20327000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1520.53 seconds)\n", - "Cbc0010I After 20328000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1520.65 seconds)\n", - "Cbc0010I After 20329000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1520.75 seconds)\n", - "Cbc0010I After 20330000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1520.85 seconds)\n", - "Cbc0010I After 20331000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1520.95 seconds)\n", - "Cbc0010I After 20332000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1521.04 seconds)\n", - "Cbc0010I After 20333000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1521.13 seconds)\n", - "Cbc0010I After 20334000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1521.20 seconds)\n", - "Cbc0010I After 20335000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1521.28 seconds)\n", - "Cbc0010I After 20336000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1521.35 seconds)\n", - "Cbc0010I After 20337000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1521.41 seconds)\n", - "Cbc0010I After 20338000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1521.47 seconds)\n", - "Cbc0010I After 20339000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1521.52 seconds)\n", - "Cbc0010I After 20340000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1521.58 seconds)\n", - "Cbc0010I After 20341000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1521.64 seconds)\n", - "Cbc0010I After 20342000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1521.69 seconds)\n", - "Cbc0010I After 20343000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1521.75 seconds)\n", - "Cbc0010I After 20344000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1521.81 seconds)\n", - "Cbc0010I After 20345000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1521.87 seconds)\n", - "Cbc0010I After 20346000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1521.92 seconds)\n", - "Cbc0010I After 20347000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1522.00 seconds)\n", - "Cbc0010I After 20348000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1522.06 seconds)\n", - "Cbc0010I After 20349000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1522.12 seconds)\n", - "Cbc0010I After 20350000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1522.18 seconds)\n", - "Cbc0010I After 20351000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1522.25 seconds)\n", - "Cbc0010I After 20352000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1522.31 seconds)\n", - "Cbc0010I After 20353000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1522.37 seconds)\n", - "Cbc0010I After 20354000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1522.43 seconds)\n", - "Cbc0010I After 20355000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1522.50 seconds)\n", - "Cbc0010I After 20356000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1522.55 seconds)\n", - "Cbc0010I After 20357000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1522.61 seconds)\n", - "Cbc0010I After 20358000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1522.67 seconds)\n", - "Cbc0010I After 20359000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1522.73 seconds)\n", - "Cbc0010I After 20360000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1522.80 seconds)\n", - "Cbc0010I After 20361000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1522.86 seconds)\n", - "Cbc0010I After 20362000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1522.92 seconds)\n", - "Cbc0010I After 20363000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1522.98 seconds)\n", - "Cbc0010I After 20364000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1523.05 seconds)\n", - "Cbc0010I After 20365000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1523.11 seconds)\n", - "Cbc0010I After 20366000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.18 seconds)\n", - "Cbc0010I After 20367000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1523.24 seconds)\n", - "Cbc0010I After 20368000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1523.29 seconds)\n", - "Cbc0010I After 20369000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.36 seconds)\n", - "Cbc0010I After 20370000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1523.42 seconds)\n", - "Cbc0010I After 20371000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1523.49 seconds)\n", - "Cbc0010I After 20372000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1523.56 seconds)\n", - "Cbc0010I After 20373000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1523.62 seconds)\n", - "Cbc0010I After 20374000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1523.68 seconds)\n", - "Cbc0010I After 20375000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1523.75 seconds)\n", - "Cbc0010I After 20376000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1523.82 seconds)\n", - "Cbc0010I After 20377000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1523.90 seconds)\n", - "Cbc0010I After 20378000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1523.98 seconds)\n", - "Cbc0010I After 20379000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1524.04 seconds)\n", - "Cbc0010I After 20380000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1524.10 seconds)\n", - "Cbc0010I After 20381000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1524.16 seconds)\n", - "Cbc0010I After 20382000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1524.24 seconds)\n", - "Cbc0010I After 20383000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1524.29 seconds)\n", - "Cbc0010I After 20384000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1524.35 seconds)\n", - "Cbc0010I After 20385000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1524.42 seconds)\n", - "Cbc0010I After 20386000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1524.49 seconds)\n", - "Cbc0010I After 20387000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1524.55 seconds)\n", - "Cbc0010I After 20388000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1524.61 seconds)\n", - "Cbc0010I After 20389000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1524.67 seconds)\n", - "Cbc0010I After 20390000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1524.72 seconds)\n", - "Cbc0010I After 20391000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1524.78 seconds)\n", - "Cbc0010I After 20392000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1524.85 seconds)\n", - "Cbc0010I After 20393000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1524.91 seconds)\n", - "Cbc0010I After 20394000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1524.98 seconds)\n", - "Cbc0010I After 20395000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1525.05 seconds)\n", - "Cbc0010I After 20396000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1525.11 seconds)\n", - "Cbc0010I After 20397000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1525.16 seconds)\n", - "Cbc0010I After 20398000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1525.23 seconds)\n", - "Cbc0010I After 20399000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1525.28 seconds)\n", - "Cbc0010I After 20400000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1525.34 seconds)\n", - "Cbc0010I After 20401000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1525.40 seconds)\n", - "Cbc0010I After 20402000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1525.46 seconds)\n", - "Cbc0010I After 20403000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1525.52 seconds)\n", - "Cbc0010I After 20404000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1525.58 seconds)\n", - "Cbc0010I After 20405000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1525.64 seconds)\n", - "Cbc0010I After 20406000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1525.70 seconds)\n", - "Cbc0010I After 20407000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1525.77 seconds)\n", - "Cbc0010I After 20408000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1525.83 seconds)\n", - "Cbc0010I After 20409000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1525.90 seconds)\n", - "Cbc0010I After 20410000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1525.95 seconds)\n", - "Cbc0010I After 20411000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1526.02 seconds)\n", - "Cbc0010I After 20412000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1526.08 seconds)\n", - "Cbc0010I After 20413000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1526.14 seconds)\n", - "Cbc0010I After 20414000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1526.21 seconds)\n", - "Cbc0010I After 20415000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1526.26 seconds)\n", - "Cbc0010I After 20416000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1526.32 seconds)\n", - "Cbc0010I After 20417000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1526.39 seconds)\n", - "Cbc0010I After 20418000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1526.45 seconds)\n", - "Cbc0010I After 20419000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.50 seconds)\n", - "Cbc0010I After 20420000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1526.56 seconds)\n", - "Cbc0010I After 20421000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1526.64 seconds)\n", - "Cbc0010I After 20422000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1526.70 seconds)\n", - "Cbc0010I After 20423000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.75 seconds)\n", - "Cbc0010I After 20424000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1526.81 seconds)\n", - "Cbc0010I After 20425000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1526.86 seconds)\n", - "Cbc0010I After 20426000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1526.92 seconds)\n", - "Cbc0010I After 20427000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1526.98 seconds)\n", - "Cbc0010I After 20428000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1527.05 seconds)\n", - "Cbc0010I After 20429000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1527.11 seconds)\n", - "Cbc0010I After 20430000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1527.16 seconds)\n", - "Cbc0010I After 20431000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1527.22 seconds)\n", - "Cbc0010I After 20432000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.27 seconds)\n", - "Cbc0010I After 20433000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1527.33 seconds)\n", - "Cbc0010I After 20434000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1527.38 seconds)\n", - "Cbc0010I After 20435000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1527.44 seconds)\n", - "Cbc0010I After 20436000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.50 seconds)\n", - "Cbc0010I After 20437000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1527.56 seconds)\n", - "Cbc0010I After 20438000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1527.61 seconds)\n", - "Cbc0010I After 20439000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1527.67 seconds)\n", - "Cbc0010I After 20440000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1527.73 seconds)\n", - "Cbc0010I After 20441000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1527.79 seconds)\n", - "Cbc0010I After 20442000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1527.84 seconds)\n", - "Cbc0010I After 20443000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1527.90 seconds)\n", - "Cbc0010I After 20444000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1527.96 seconds)\n", - "Cbc0010I After 20445000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.04 seconds)\n", - "Cbc0010I After 20446000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.09 seconds)\n", - "Cbc0010I After 20447000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1528.14 seconds)\n", - "Cbc0010I After 20448000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1528.20 seconds)\n", - "Cbc0010I After 20449000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1528.26 seconds)\n", - "Cbc0010I After 20450000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1528.33 seconds)\n", - "Cbc0010I After 20451000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1528.38 seconds)\n", - "Cbc0010I After 20452000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1528.43 seconds)\n", - "Cbc0010I After 20453000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1528.49 seconds)\n", - "Cbc0010I After 20454000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1528.59 seconds)\n", - "Cbc0010I After 20455000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1528.66 seconds)\n", - "Cbc0010I After 20456000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (1528.73 seconds)\n", - "Cbc0010I After 20457000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1528.80 seconds)\n", - "Cbc0010I After 20458000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1528.87 seconds)\n", - "Cbc0010I After 20459000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1528.93 seconds)\n", - "Cbc0010I After 20460000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1528.99 seconds)\n", - "Cbc0010I After 20461000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1529.05 seconds)\n", - "Cbc0010I After 20462000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1529.11 seconds)\n", - "Cbc0010I After 20463000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1529.17 seconds)\n", - "Cbc0010I After 20464000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1529.24 seconds)\n", - "Cbc0010I After 20465000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1529.30 seconds)\n", - "Cbc0010I After 20466000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1529.36 seconds)\n", - "Cbc0010I After 20467000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1529.42 seconds)\n", - "Cbc0010I After 20468000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1529.47 seconds)\n", - "Cbc0010I After 20469000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1529.53 seconds)\n", - "Cbc0010I After 20470000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1529.59 seconds)\n", - "Cbc0010I After 20471000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1529.64 seconds)\n", - "Cbc0010I After 20472000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1529.71 seconds)\n", - "Cbc0010I After 20473000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1529.77 seconds)\n", - "Cbc0010I After 20474000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1529.83 seconds)\n", - "Cbc0010I After 20475000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1529.88 seconds)\n", - "Cbc0010I After 20476000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1529.95 seconds)\n", - "Cbc0010I After 20477000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1530.03 seconds)\n", - "Cbc0010I After 20478000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1530.10 seconds)\n", - "Cbc0010I After 20479000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1530.18 seconds)\n", - "Cbc0010I After 20480000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1530.25 seconds)\n", - "Cbc0010I After 20481000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1530.33 seconds)\n", - "Cbc0010I After 20482000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1530.40 seconds)\n", - "Cbc0010I After 20483000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1530.47 seconds)\n", - "Cbc0010I After 20484000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1530.54 seconds)\n", - "Cbc0010I After 20485000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1530.61 seconds)\n", - "Cbc0010I After 20486000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1530.69 seconds)\n", - "Cbc0010I After 20487000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1530.76 seconds)\n", - "Cbc0010I After 20488000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1530.85 seconds)\n", - "Cbc0010I After 20489000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1530.93 seconds)\n", - "Cbc0010I After 20490000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1531.00 seconds)\n", - "Cbc0010I After 20491000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1531.08 seconds)\n", - "Cbc0010I After 20492000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1531.15 seconds)\n", - "Cbc0010I After 20493000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1531.22 seconds)\n", - "Cbc0010I After 20494000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1531.30 seconds)\n", - "Cbc0010I After 20495000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1531.43 seconds)\n", - "Cbc0010I After 20496000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1531.53 seconds)\n", - "Cbc0010I After 20497000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1531.63 seconds)\n", - "Cbc0010I After 20498000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1531.73 seconds)\n", - "Cbc0010I After 20499000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1531.82 seconds)\n", - "Cbc0010I After 20500000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1531.89 seconds)\n", - "Cbc0010I After 20501000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1531.96 seconds)\n", - "Cbc0010I After 20502000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1532.03 seconds)\n", - "Cbc0010I After 20503000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1532.10 seconds)\n", - "Cbc0010I After 20504000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1532.17 seconds)\n", - "Cbc0010I After 20505000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1532.24 seconds)\n", - "Cbc0010I After 20506000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1532.32 seconds)\n", - "Cbc0010I After 20507000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1532.40 seconds)\n", - "Cbc0010I After 20508000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1532.47 seconds)\n", - "Cbc0010I After 20509000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1532.54 seconds)\n", - "Cbc0010I After 20510000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1532.61 seconds)\n", - "Cbc0010I After 20511000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1532.67 seconds)\n", - "Cbc0010I After 20512000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1532.74 seconds)\n", - "Cbc0010I After 20513000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1532.81 seconds)\n", - "Cbc0010I After 20514000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1532.87 seconds)\n", - "Cbc0010I After 20515000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1532.94 seconds)\n", - "Cbc0010I After 20516000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1533.01 seconds)\n", - "Cbc0010I After 20517000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1533.08 seconds)\n", - "Cbc0010I After 20518000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1533.15 seconds)\n", - "Cbc0010I After 20519000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1533.22 seconds)\n", - "Cbc0010I After 20520000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1533.29 seconds)\n", - "Cbc0010I After 20521000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1533.36 seconds)\n", - "Cbc0010I After 20522000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1533.43 seconds)\n", - "Cbc0010I After 20523000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1533.50 seconds)\n", - "Cbc0010I After 20524000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1533.57 seconds)\n", - "Cbc0010I After 20525000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1533.64 seconds)\n", - "Cbc0010I After 20526000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1533.71 seconds)\n", - "Cbc0010I After 20527000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1533.78 seconds)\n", - "Cbc0010I After 20528000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1533.85 seconds)\n", - "Cbc0010I After 20529000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1533.92 seconds)\n", - "Cbc0010I After 20530000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1533.99 seconds)\n", - "Cbc0010I After 20531000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1534.06 seconds)\n", - "Cbc0010I After 20532000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1534.13 seconds)\n", - "Cbc0010I After 20533000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1534.20 seconds)\n", - "Cbc0010I After 20534000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1534.27 seconds)\n", - "Cbc0010I After 20535000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1534.34 seconds)\n", - "Cbc0010I After 20536000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1534.41 seconds)\n", - "Cbc0010I After 20537000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1534.48 seconds)\n", - "Cbc0010I After 20538000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1534.55 seconds)\n", - "Cbc0010I After 20539000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1534.62 seconds)\n", - "Cbc0010I After 20540000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1534.69 seconds)\n", - "Cbc0010I After 20541000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1534.77 seconds)\n", - "Cbc0010I After 20542000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1534.84 seconds)\n", - "Cbc0010I After 20543000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1534.91 seconds)\n", - "Cbc0010I After 20544000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1534.99 seconds)\n", - "Cbc0010I After 20545000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1535.06 seconds)\n", - "Cbc0010I After 20546000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1535.13 seconds)\n", - "Cbc0010I After 20547000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1535.21 seconds)\n", - "Cbc0010I After 20548000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1535.28 seconds)\n", - "Cbc0010I After 20549000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1535.36 seconds)\n", - "Cbc0010I After 20550000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1535.43 seconds)\n", - "Cbc0010I After 20551000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1535.50 seconds)\n", - "Cbc0010I After 20552000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1535.58 seconds)\n", - "Cbc0010I After 20553000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1535.65 seconds)\n", - "Cbc0010I After 20554000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1535.72 seconds)\n", - "Cbc0010I After 20555000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1535.80 seconds)\n", - "Cbc0010I After 20556000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1535.87 seconds)\n", - "Cbc0010I After 20557000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1535.94 seconds)\n", - "Cbc0010I After 20558000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1536.01 seconds)\n", - "Cbc0010I After 20559000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1536.08 seconds)\n", - "Cbc0010I After 20560000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1536.15 seconds)\n", - "Cbc0010I After 20561000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1536.22 seconds)\n", - "Cbc0010I After 20562000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1536.29 seconds)\n", - "Cbc0010I After 20563000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1536.36 seconds)\n", - "Cbc0010I After 20564000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1536.43 seconds)\n", - "Cbc0010I After 20565000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1536.50 seconds)\n", - "Cbc0010I After 20566000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1536.57 seconds)\n", - "Cbc0010I After 20567000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1536.64 seconds)\n", - "Cbc0010I After 20568000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1536.71 seconds)\n", - "Cbc0010I After 20569000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1536.79 seconds)\n", - "Cbc0010I After 20570000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1536.86 seconds)\n", - "Cbc0010I After 20571000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1536.94 seconds)\n", - "Cbc0010I After 20572000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1537.01 seconds)\n", - "Cbc0010I After 20573000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1537.08 seconds)\n", - "Cbc0010I After 20574000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1537.16 seconds)\n", - "Cbc0010I After 20575000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1537.23 seconds)\n", - "Cbc0010I After 20576000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1537.30 seconds)\n", - "Cbc0010I After 20577000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1537.39 seconds)\n", - "Cbc0010I After 20578000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1537.48 seconds)\n", - "Cbc0010I After 20579000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1537.55 seconds)\n", - "Cbc0010I After 20580000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1537.63 seconds)\n", - "Cbc0010I After 20581000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1537.72 seconds)\n", - "Cbc0010I After 20582000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1537.79 seconds)\n", - "Cbc0010I After 20583000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1537.89 seconds)\n", - "Cbc0010I After 20584000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1537.97 seconds)\n", - "Cbc0010I After 20585000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1538.05 seconds)\n", - "Cbc0010I After 20586000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1538.13 seconds)\n", - "Cbc0010I After 20587000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1538.21 seconds)\n", - "Cbc0010I After 20588000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1538.28 seconds)\n", - "Cbc0010I After 20589000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1538.36 seconds)\n", - "Cbc0010I After 20590000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1538.43 seconds)\n", - "Cbc0010I After 20591000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1538.51 seconds)\n", - "Cbc0010I After 20592000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1538.58 seconds)\n", - "Cbc0010I After 20593000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1538.66 seconds)\n", - "Cbc0010I After 20594000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1538.75 seconds)\n", - "Cbc0010I After 20595000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1538.81 seconds)\n", - "Cbc0010I After 20596000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1538.87 seconds)\n", - "Cbc0010I After 20597000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1538.94 seconds)\n", - "Cbc0010I After 20598000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1539.00 seconds)\n", - "Cbc0010I After 20599000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1539.06 seconds)\n", - "Cbc0010I After 20600000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1539.12 seconds)\n", - "Cbc0010I After 20601000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1539.18 seconds)\n", - "Cbc0010I After 20602000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1539.24 seconds)\n", - "Cbc0010I After 20603000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1539.30 seconds)\n", - "Cbc0010I After 20604000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1539.36 seconds)\n", - "Cbc0010I After 20605000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1539.43 seconds)\n", - "Cbc0010I After 20606000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1539.49 seconds)\n", - "Cbc0010I After 20607000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1539.56 seconds)\n", - "Cbc0010I After 20608000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1539.63 seconds)\n", - "Cbc0010I After 20609000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1539.69 seconds)\n", - "Cbc0010I After 20610000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1539.75 seconds)\n", - "Cbc0010I After 20611000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1539.82 seconds)\n", - "Cbc0010I After 20612000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1539.88 seconds)\n", - "Cbc0010I After 20613000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1539.94 seconds)\n", - "Cbc0010I After 20614000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1540.00 seconds)\n", - "Cbc0010I After 20615000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1540.07 seconds)\n", - "Cbc0010I After 20616000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1540.13 seconds)\n", - "Cbc0010I After 20617000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.19 seconds)\n", - "Cbc0010I After 20618000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.26 seconds)\n", - "Cbc0010I After 20619000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1540.33 seconds)\n", - "Cbc0010I After 20620000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1540.39 seconds)\n", - "Cbc0010I After 20621000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1540.46 seconds)\n", - "Cbc0010I After 20622000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1540.53 seconds)\n", - "Cbc0010I After 20623000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1540.61 seconds)\n", - "Cbc0010I After 20624000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1540.69 seconds)\n", - "Cbc0010I After 20625000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1540.76 seconds)\n", - "Cbc0010I After 20626000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1540.83 seconds)\n", - "Cbc0010I After 20627000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1540.90 seconds)\n", - "Cbc0010I After 20628000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1540.96 seconds)\n", - "Cbc0010I After 20629000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1541.02 seconds)\n", - "Cbc0010I After 20630000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1541.07 seconds)\n", - "Cbc0010I After 20631000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1541.13 seconds)\n", - "Cbc0010I After 20632000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1541.19 seconds)\n", - "Cbc0010I After 20633000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1541.24 seconds)\n", - "Cbc0010I After 20634000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1541.30 seconds)\n", - "Cbc0010I After 20635000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1541.36 seconds)\n", - "Cbc0010I After 20636000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1541.42 seconds)\n", - "Cbc0010I After 20637000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1541.49 seconds)\n", - "Cbc0010I After 20638000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1541.55 seconds)\n", - "Cbc0010I After 20639000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1541.62 seconds)\n", - "Cbc0010I After 20640000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1541.67 seconds)\n", - "Cbc0010I After 20641000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1541.73 seconds)\n", - "Cbc0010I After 20642000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1541.79 seconds)\n", - "Cbc0010I After 20643000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1541.84 seconds)\n", - "Cbc0010I After 20644000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1541.90 seconds)\n", - "Cbc0010I After 20645000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1541.99 seconds)\n", - "Cbc0010I After 20646000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1542.06 seconds)\n", - "Cbc0010I After 20647000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1542.13 seconds)\n", - "Cbc0010I After 20648000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1542.19 seconds)\n", - "Cbc0010I After 20649000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1542.24 seconds)\n", - "Cbc0010I After 20650000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1542.31 seconds)\n", - "Cbc0010I After 20651000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1542.37 seconds)\n", - "Cbc0010I After 20652000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1542.43 seconds)\n", - "Cbc0010I After 20653000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1542.49 seconds)\n", - "Cbc0010I After 20654000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1542.55 seconds)\n", - "Cbc0010I After 20655000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1542.62 seconds)\n", - "Cbc0010I After 20656000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1542.68 seconds)\n", - "Cbc0010I After 20657000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1542.76 seconds)\n", - "Cbc0010I After 20658000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1542.81 seconds)\n", - "Cbc0010I After 20659000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1542.87 seconds)\n", - "Cbc0010I After 20660000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1542.93 seconds)\n", - "Cbc0010I After 20661000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1543.05 seconds)\n", - "Cbc0010I After 20662000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1543.14 seconds)\n", - "Cbc0010I After 20663000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1543.22 seconds)\n", - "Cbc0010I After 20664000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1543.30 seconds)\n", - "Cbc0010I After 20665000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1543.37 seconds)\n", - "Cbc0010I After 20666000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1543.44 seconds)\n", - "Cbc0010I After 20667000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1543.50 seconds)\n", - "Cbc0010I After 20668000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1543.57 seconds)\n", - "Cbc0010I After 20669000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1543.63 seconds)\n", - "Cbc0010I After 20670000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1543.69 seconds)\n", - "Cbc0010I After 20671000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1543.76 seconds)\n", - "Cbc0010I After 20672000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1543.82 seconds)\n", - "Cbc0010I After 20673000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1543.89 seconds)\n", - "Cbc0010I After 20674000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1543.95 seconds)\n", - "Cbc0010I After 20675000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1544.02 seconds)\n", - "Cbc0010I After 20676000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1544.09 seconds)\n", - "Cbc0010I After 20677000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1544.15 seconds)\n", - "Cbc0010I After 20678000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1544.20 seconds)\n", - "Cbc0010I After 20679000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1544.26 seconds)\n", - "Cbc0010I After 20680000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1544.32 seconds)\n", - "Cbc0010I After 20681000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1544.37 seconds)\n", - "Cbc0010I After 20682000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1544.43 seconds)\n", - "Cbc0010I After 20683000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1544.49 seconds)\n", - "Cbc0010I After 20684000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1544.55 seconds)\n", - "Cbc0010I After 20685000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1544.60 seconds)\n", - "Cbc0010I After 20686000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1544.66 seconds)\n", - "Cbc0010I After 20687000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1544.71 seconds)\n", - "Cbc0010I After 20688000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1544.77 seconds)\n", - "Cbc0010I After 20689000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1544.84 seconds)\n", - "Cbc0010I After 20690000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1544.91 seconds)\n", - "Cbc0010I After 20691000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1544.96 seconds)\n", - "Cbc0010I After 20692000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1545.03 seconds)\n", - "Cbc0010I After 20693000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1545.11 seconds)\n", - "Cbc0010I After 20694000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1545.16 seconds)\n", - "Cbc0010I After 20695000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1545.21 seconds)\n", - "Cbc0010I After 20696000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1545.27 seconds)\n", - "Cbc0010I After 20697000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1545.33 seconds)\n", - "Cbc0010I After 20698000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1545.39 seconds)\n", - "Cbc0010I After 20699000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1545.46 seconds)\n", - "Cbc0010I After 20700000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1545.51 seconds)\n", - "Cbc0010I After 20701000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1545.58 seconds)\n", - "Cbc0010I After 20702000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1545.64 seconds)\n", - "Cbc0010I After 20703000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1545.70 seconds)\n", - "Cbc0010I After 20704000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1545.77 seconds)\n", - "Cbc0010I After 20705000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1545.83 seconds)\n", - "Cbc0010I After 20706000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1545.89 seconds)\n", - "Cbc0010I After 20707000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1545.95 seconds)\n", - "Cbc0010I After 20708000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1546.02 seconds)\n", - "Cbc0010I After 20709000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1546.08 seconds)\n", - "Cbc0010I After 20710000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1546.15 seconds)\n", - "Cbc0010I After 20711000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1546.22 seconds)\n", - "Cbc0010I After 20712000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1546.28 seconds)\n", - "Cbc0010I After 20713000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1546.36 seconds)\n", - "Cbc0010I After 20714000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1546.44 seconds)\n", - "Cbc0010I After 20715000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1546.50 seconds)\n", - "Cbc0010I After 20716000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1546.56 seconds)\n", - "Cbc0010I After 20717000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1546.63 seconds)\n", - "Cbc0010I After 20718000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1546.69 seconds)\n", - "Cbc0010I After 20719000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1546.75 seconds)\n", - "Cbc0010I After 20720000 nodes, 30 on tree, 1e+50 best solution, best possible 0 (1546.81 seconds)\n", - "Cbc0010I After 20721000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1546.88 seconds)\n", - "Cbc0010I After 20722000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1546.93 seconds)\n", - "Cbc0010I After 20723000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1546.99 seconds)\n", - "Cbc0010I After 20724000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1547.05 seconds)\n", - "Cbc0010I After 20725000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1547.11 seconds)\n", - "Cbc0010I After 20726000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1547.17 seconds)\n", - "Cbc0010I After 20727000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1547.23 seconds)\n", - "Cbc0010I After 20728000 nodes, 24 on tree, 1e+50 best solution, best possible 0 (1547.29 seconds)\n", - "Cbc0010I After 20729000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1547.36 seconds)\n", - "Cbc0010I After 20730000 nodes, 29 on tree, 1e+50 best solution, best possible 0 (1547.42 seconds)\n", - "Cbc0010I After 20731000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1547.49 seconds)\n", - "Cbc0010I After 20732000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1547.55 seconds)\n", - "Cbc0010I After 20733000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1547.61 seconds)\n", - "Cbc0010I After 20734000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1547.68 seconds)\n", - "Cbc0010I After 20735000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1547.74 seconds)\n", - "Cbc0010I After 20736000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1547.80 seconds)\n", - "Cbc0010I After 20737000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1547.87 seconds)\n", - "Cbc0010I After 20738000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1547.93 seconds)\n", - "Cbc0010I After 20739000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1547.98 seconds)\n", - "Cbc0010I After 20740000 nodes, 19 on tree, 1e+50 best solution, best possible 0 (1548.04 seconds)\n", - "Cbc0010I After 20741000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1548.09 seconds)\n", - "Cbc0010I After 20742000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1548.15 seconds)\n", - "Cbc0010I After 20743000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1548.21 seconds)\n", - "Cbc0010I After 20744000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1548.27 seconds)\n", - "Cbc0010I After 20745000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1548.34 seconds)\n", - "Cbc0010I After 20746000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1548.43 seconds)\n", - "Cbc0010I After 20747000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1548.51 seconds)\n", - "Cbc0010I After 20748000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1548.59 seconds)\n", - "Cbc0010I After 20749000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1548.66 seconds)\n", - "Cbc0010I After 20750000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1548.73 seconds)\n", - "Cbc0010I After 20751000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1548.81 seconds)\n", - "Cbc0010I After 20752000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1548.88 seconds)\n", - "Cbc0010I After 20753000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1548.95 seconds)\n", - "Cbc0010I After 20754000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1549.02 seconds)\n", - "Cbc0010I After 20755000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1549.10 seconds)\n", - "Cbc0010I After 20756000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1549.17 seconds)\n", - "Cbc0010I After 20757000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1549.24 seconds)\n", - "Cbc0010I After 20758000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1549.31 seconds)\n", - "Cbc0010I After 20759000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1549.38 seconds)\n", - "Cbc0010I After 20760000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1549.45 seconds)\n", - "Cbc0010I After 20761000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1549.53 seconds)\n", - "Cbc0010I After 20762000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1549.60 seconds)\n", - "Cbc0010I After 20763000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1549.67 seconds)\n", - "Cbc0010I After 20764000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1549.75 seconds)\n", - "Cbc0010I After 20765000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1549.82 seconds)\n", - "Cbc0010I After 20766000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1549.90 seconds)\n", - "Cbc0010I After 20767000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1549.98 seconds)\n", - "Cbc0010I After 20768000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1550.05 seconds)\n", - "Cbc0010I After 20769000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1550.12 seconds)\n", - "Cbc0010I After 20770000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1550.19 seconds)\n", - "Cbc0010I After 20771000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1550.26 seconds)\n", - "Cbc0010I After 20772000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1550.33 seconds)\n", - "Cbc0010I After 20773000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1550.41 seconds)\n", - "Cbc0010I After 20774000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1550.48 seconds)\n", - "Cbc0010I After 20775000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1550.55 seconds)\n", - "Cbc0010I After 20776000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1550.63 seconds)\n", - "Cbc0010I After 20777000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1550.70 seconds)\n", - "Cbc0010I After 20778000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1550.78 seconds)\n", - "Cbc0010I After 20779000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1550.84 seconds)\n", - "Cbc0010I After 20780000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1550.91 seconds)\n", - "Cbc0010I After 20781000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1550.98 seconds)\n", - "Cbc0010I After 20782000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1551.05 seconds)\n", - "Cbc0010I After 20783000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1551.11 seconds)\n", - "Cbc0010I After 20784000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1551.18 seconds)\n", - "Cbc0010I After 20785000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1551.25 seconds)\n", - "Cbc0010I After 20786000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1551.33 seconds)\n", - "Cbc0010I After 20787000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1551.40 seconds)\n", - "Cbc0010I After 20788000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1551.50 seconds)\n", - "Cbc0010I After 20789000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1551.58 seconds)\n", - "Cbc0010I After 20790000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1551.65 seconds)\n", - "Cbc0010I After 20791000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1551.73 seconds)\n", - "Cbc0010I After 20792000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1551.80 seconds)\n", - "Cbc0010I After 20793000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1551.87 seconds)\n", - "Cbc0010I After 20794000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1551.95 seconds)\n", - "Cbc0010I After 20795000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1552.02 seconds)\n", - "Cbc0010I After 20796000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1552.10 seconds)\n", - "Cbc0010I After 20797000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1552.17 seconds)\n", - "Cbc0010I After 20798000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1552.25 seconds)\n", - "Cbc0010I After 20799000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1552.32 seconds)\n", - "Cbc0010I After 20800000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1552.39 seconds)\n", - "Cbc0010I After 20801000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1552.48 seconds)\n", - "Cbc0010I After 20802000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1552.55 seconds)\n", - "Cbc0010I After 20803000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1552.62 seconds)\n", - "Cbc0010I After 20804000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1552.70 seconds)\n", - "Cbc0010I After 20805000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1552.78 seconds)\n", - "Cbc0010I After 20806000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1552.85 seconds)\n", - "Cbc0010I After 20807000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1552.92 seconds)\n", - "Cbc0010I After 20808000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1553.00 seconds)\n", - "Cbc0010I After 20809000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1553.07 seconds)\n", - "Cbc0010I After 20810000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1553.15 seconds)\n", - "Cbc0010I After 20811000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1553.23 seconds)\n", - "Cbc0010I After 20812000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1553.30 seconds)\n", - "Cbc0010I After 20813000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1553.37 seconds)\n", - "Cbc0010I After 20814000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1553.45 seconds)\n", - "Cbc0010I After 20815000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1553.52 seconds)\n", - "Cbc0010I After 20816000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1553.60 seconds)\n", - "Cbc0010I After 20817000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1553.67 seconds)\n", - "Cbc0010I After 20818000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1553.75 seconds)\n", - "Cbc0010I After 20819000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1553.83 seconds)\n", - "Cbc0010I After 20820000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1553.92 seconds)\n", - "Cbc0010I After 20821000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1554.00 seconds)\n", - "Cbc0010I After 20822000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1554.08 seconds)\n", - "Cbc0010I After 20823000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1554.15 seconds)\n", - "Cbc0010I After 20824000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1554.23 seconds)\n", - "Cbc0010I After 20825000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1554.30 seconds)\n", - "Cbc0010I After 20826000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1554.37 seconds)\n", - "Cbc0010I After 20827000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1554.44 seconds)\n", - "Cbc0010I After 20828000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1554.54 seconds)\n", - "Cbc0010I After 20829000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1554.61 seconds)\n", - "Cbc0010I After 20830000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1554.69 seconds)\n", - "Cbc0010I After 20831000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1554.77 seconds)\n", - "Cbc0010I After 20832000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1554.84 seconds)\n", - "Cbc0010I After 20833000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1554.90 seconds)\n", - "Cbc0010I After 20834000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1554.97 seconds)\n", - "Cbc0010I After 20835000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1555.04 seconds)\n", - "Cbc0010I After 20836000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1555.12 seconds)\n", - "Cbc0010I After 20837000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1555.19 seconds)\n", - "Cbc0010I After 20838000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1555.26 seconds)\n", - "Cbc0010I After 20839000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1555.33 seconds)\n", - "Cbc0010I After 20840000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1555.41 seconds)\n", - "Cbc0010I After 20841000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1555.49 seconds)\n", - "Cbc0010I After 20842000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1555.57 seconds)\n", - "Cbc0010I After 20843000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1555.63 seconds)\n", - "Cbc0010I After 20844000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1555.70 seconds)\n", - "Cbc0010I After 20845000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1555.77 seconds)\n", - "Cbc0010I After 20846000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1555.84 seconds)\n", - "Cbc0010I After 20847000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1555.91 seconds)\n", - "Cbc0010I After 20848000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1555.98 seconds)\n", - "Cbc0010I After 20849000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1556.06 seconds)\n", - "Cbc0010I After 20850000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1556.13 seconds)\n", - "Cbc0010I After 20851000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1556.20 seconds)\n", - "Cbc0010I After 20852000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1556.27 seconds)\n", - "Cbc0010I After 20853000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1556.34 seconds)\n", - "Cbc0010I After 20854000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1556.41 seconds)\n", - "Cbc0010I After 20855000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1556.48 seconds)\n", - "Cbc0010I After 20856000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1556.55 seconds)\n", - "Cbc0010I After 20857000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1556.63 seconds)\n", - "Cbc0010I After 20858000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1556.71 seconds)\n", - "Cbc0010I After 20859000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1556.81 seconds)\n", - "Cbc0010I After 20860000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1556.89 seconds)\n", - "Cbc0010I After 20861000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1556.97 seconds)\n", - "Cbc0010I After 20862000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1557.05 seconds)\n", - "Cbc0010I After 20863000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1557.13 seconds)\n", - "Cbc0010I After 20864000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1557.20 seconds)\n", - "Cbc0010I After 20865000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1557.27 seconds)\n", - "Cbc0010I After 20866000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1557.35 seconds)\n", - "Cbc0010I After 20867000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1557.43 seconds)\n", - "Cbc0010I After 20868000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1557.50 seconds)\n", - "Cbc0010I After 20869000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1557.58 seconds)\n", - "Cbc0010I After 20870000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1557.71 seconds)\n", - "Cbc0010I After 20871000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1557.80 seconds)\n", - "Cbc0010I After 20872000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1557.88 seconds)\n", - "Cbc0010I After 20873000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1557.96 seconds)\n", - "Cbc0010I After 20874000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1558.06 seconds)\n", - "Cbc0010I After 20875000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1558.16 seconds)\n", - "Cbc0010I After 20876000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1558.24 seconds)\n", - "Cbc0010I After 20877000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1558.30 seconds)\n", - "Cbc0010I After 20878000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1558.36 seconds)\n", - "Cbc0010I After 20879000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1558.42 seconds)\n", - "Cbc0010I After 20880000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1558.48 seconds)\n", - "Cbc0010I After 20881000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1558.54 seconds)\n", - "Cbc0010I After 20882000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1558.60 seconds)\n", - "Cbc0010I After 20883000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1558.66 seconds)\n", - "Cbc0010I After 20884000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1558.73 seconds)\n", - "Cbc0010I After 20885000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1558.78 seconds)\n", - "Cbc0010I After 20886000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1558.86 seconds)\n", - "Cbc0010I After 20887000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1558.93 seconds)\n", - "Cbc0010I After 20888000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1559.00 seconds)\n", - "Cbc0010I After 20889000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1559.06 seconds)\n", - "Cbc0010I After 20890000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1559.12 seconds)\n", - "Cbc0010I After 20891000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1559.19 seconds)\n", - "Cbc0010I After 20892000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1559.26 seconds)\n", - "Cbc0010I After 20893000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1559.32 seconds)\n", - "Cbc0010I After 20894000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1559.39 seconds)\n", - "Cbc0010I After 20895000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1559.46 seconds)\n", - "Cbc0010I After 20896000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1559.53 seconds)\n", - "Cbc0010I After 20897000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1559.60 seconds)\n", - "Cbc0010I After 20898000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1559.66 seconds)\n", - "Cbc0010I After 20899000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1559.72 seconds)\n", - "Cbc0010I After 20900000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1559.78 seconds)\n", - "Cbc0010I After 20901000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1559.84 seconds)\n", - "Cbc0010I After 20902000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1559.90 seconds)\n", - "Cbc0010I After 20903000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1559.97 seconds)\n", - "Cbc0010I After 20904000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1560.03 seconds)\n", - "Cbc0010I After 20905000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1560.10 seconds)\n", - "Cbc0010I After 20906000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1560.16 seconds)\n", - "Cbc0010I After 20907000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1560.22 seconds)\n", - "Cbc0010I After 20908000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1560.28 seconds)\n", - "Cbc0010I After 20909000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1560.35 seconds)\n", - "Cbc0010I After 20910000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1560.40 seconds)\n", - "Cbc0010I After 20911000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1560.47 seconds)\n", - "Cbc0010I After 20912000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1560.54 seconds)\n", - "Cbc0010I After 20913000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1560.60 seconds)\n", - "Cbc0010I After 20914000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1560.66 seconds)\n", - "Cbc0010I After 20915000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1560.74 seconds)\n", - "Cbc0010I After 20916000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1560.81 seconds)\n", - "Cbc0010I After 20917000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1560.88 seconds)\n", - "Cbc0010I After 20918000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1560.95 seconds)\n", - "Cbc0010I After 20919000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1561.03 seconds)\n", - "Cbc0010I After 20920000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1561.10 seconds)\n", - "Cbc0010I After 20921000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1561.16 seconds)\n", - "Cbc0010I After 20922000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1561.22 seconds)\n", - "Cbc0010I After 20923000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1561.28 seconds)\n", - "Cbc0010I After 20924000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1561.35 seconds)\n", - "Cbc0010I After 20925000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1561.41 seconds)\n", - "Cbc0010I After 20926000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1561.48 seconds)\n", - "Cbc0010I After 20927000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1561.55 seconds)\n", - "Cbc0010I After 20928000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1561.61 seconds)\n", - "Cbc0010I After 20929000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1561.67 seconds)\n", - "Cbc0010I After 20930000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1561.75 seconds)\n", - "Cbc0010I After 20931000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1561.81 seconds)\n", - "Cbc0010I After 20932000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1561.86 seconds)\n", - "Cbc0010I After 20933000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1561.92 seconds)\n", - "Cbc0010I After 20934000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1561.99 seconds)\n", - "Cbc0010I After 20935000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1562.04 seconds)\n", - "Cbc0010I After 20936000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1562.10 seconds)\n", - "Cbc0010I After 20937000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1562.16 seconds)\n", - "Cbc0010I After 20938000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1562.23 seconds)\n", - "Cbc0010I After 20939000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1562.30 seconds)\n", - "Cbc0010I After 20940000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1562.36 seconds)\n", - "Cbc0010I After 20941000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1562.43 seconds)\n", - "Cbc0010I After 20942000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1562.49 seconds)\n", - "Cbc0010I After 20943000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1562.56 seconds)\n", - "Cbc0010I After 20944000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1562.62 seconds)\n", - "Cbc0010I After 20945000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1562.69 seconds)\n", - "Cbc0010I After 20946000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1562.75 seconds)\n", - "Cbc0010I After 20947000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1562.83 seconds)\n", - "Cbc0010I After 20948000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1562.90 seconds)\n", - "Cbc0010I After 20949000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1562.96 seconds)\n", - "Cbc0010I After 20950000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1563.04 seconds)\n", - "Cbc0010I After 20951000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1563.10 seconds)\n", - "Cbc0010I After 20952000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1563.17 seconds)\n", - "Cbc0010I After 20953000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1563.24 seconds)\n", - "Cbc0010I After 20954000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1563.31 seconds)\n", - "Cbc0010I After 20955000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1563.39 seconds)\n", - "Cbc0010I After 20956000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1563.46 seconds)\n", - "Cbc0010I After 20957000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1563.52 seconds)\n", - "Cbc0010I After 20958000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1563.59 seconds)\n", - "Cbc0010I After 20959000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1563.65 seconds)\n", - "Cbc0010I After 20960000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1563.72 seconds)\n", - "Cbc0010I After 20961000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1563.78 seconds)\n", - "Cbc0010I After 20962000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1563.87 seconds)\n", - "Cbc0010I After 20963000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1563.95 seconds)\n", - "Cbc0010I After 20964000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1564.00 seconds)\n", - "Cbc0010I After 20965000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1564.07 seconds)\n", - "Cbc0010I After 20966000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1564.13 seconds)\n", - "Cbc0010I After 20967000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1564.19 seconds)\n", - "Cbc0010I After 20968000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1564.25 seconds)\n", - "Cbc0010I After 20969000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1564.31 seconds)\n", - "Cbc0010I After 20970000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1564.37 seconds)\n", - "Cbc0010I After 20971000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1564.44 seconds)\n", - "Cbc0010I After 20972000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1564.52 seconds)\n", - "Cbc0010I After 20973000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1564.60 seconds)\n", - "Cbc0010I After 20974000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1564.65 seconds)\n", - "Cbc0010I After 20975000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1564.73 seconds)\n", - "Cbc0010I After 20976000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1564.79 seconds)\n", - "Cbc0010I After 20977000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1564.84 seconds)\n", - "Cbc0010I After 20978000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1564.90 seconds)\n", - "Cbc0010I After 20979000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1564.96 seconds)\n", - "Cbc0010I After 20980000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1565.03 seconds)\n", - "Cbc0010I After 20981000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1565.09 seconds)\n", - "Cbc0010I After 20982000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1565.16 seconds)\n", - "Cbc0010I After 20983000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1565.22 seconds)\n", - "Cbc0010I After 20984000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1565.29 seconds)\n", - "Cbc0010I After 20985000 nodes, 28 on tree, 1e+50 best solution, best possible 0 (1565.35 seconds)\n", - "Cbc0010I After 20986000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1565.41 seconds)\n", - "Cbc0010I After 20987000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1565.47 seconds)\n", - "Cbc0010I After 20988000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1565.54 seconds)\n", - "Cbc0010I After 20989000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1565.60 seconds)\n", - "Cbc0010I After 20990000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1565.66 seconds)\n", - "Cbc0010I After 20991000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1565.72 seconds)\n", - "Cbc0010I After 20992000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1565.79 seconds)\n", - "Cbc0010I After 20993000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1565.87 seconds)\n", - "Cbc0010I After 20994000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1565.93 seconds)\n", - "Cbc0010I After 20995000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1566.00 seconds)\n", - "Cbc0010I After 20996000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1566.05 seconds)\n", - "Cbc0010I After 20997000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1566.11 seconds)\n", - "Cbc0010I After 20998000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1566.17 seconds)\n", - "Cbc0010I After 20999000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1566.22 seconds)\n", - "Cbc0010I After 21000000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1566.29 seconds)\n", - "Cbc0010I After 21001000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1566.35 seconds)\n", - "Cbc0010I After 21002000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1566.41 seconds)\n", - "Cbc0010I After 21003000 nodes, 23 on tree, 1e+50 best solution, best possible 0 (1566.47 seconds)\n", - "Cbc0010I After 21004000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1566.54 seconds)\n", - "Cbc0010I After 21005000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1566.62 seconds)\n", - "Cbc0010I After 21006000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1566.69 seconds)\n", - "Cbc0010I After 21007000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1566.76 seconds)\n", - "Cbc0010I After 21008000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1566.83 seconds)\n", - "Cbc0010I After 21009000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1566.91 seconds)\n", - "Cbc0010I After 21010000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1566.98 seconds)\n", - "Cbc0010I After 21011000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1567.06 seconds)\n", - "Cbc0010I After 21012000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1567.14 seconds)\n", - "Cbc0010I After 21013000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1567.23 seconds)\n", - "Cbc0010I After 21014000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1567.30 seconds)\n", - "Cbc0010I After 21015000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1567.38 seconds)\n", - "Cbc0010I After 21016000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1567.45 seconds)\n", - "Cbc0010I After 21017000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1567.52 seconds)\n", - "Cbc0010I After 21018000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1567.59 seconds)\n", - "Cbc0010I After 21019000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1567.66 seconds)\n", - "Cbc0010I After 21020000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1567.74 seconds)\n", - "Cbc0010I After 21021000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1567.81 seconds)\n", - "Cbc0010I After 21022000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1567.89 seconds)\n", - "Cbc0010I After 21023000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1567.97 seconds)\n", - "Cbc0010I After 21024000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1568.04 seconds)\n", - "Cbc0010I After 21025000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1568.11 seconds)\n", - "Cbc0010I After 21026000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1568.18 seconds)\n", - "Cbc0010I After 21027000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1568.25 seconds)\n", - "Cbc0010I After 21028000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1568.32 seconds)\n", - "Cbc0010I After 21029000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1568.38 seconds)\n", - "Cbc0010I After 21030000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1568.46 seconds)\n", - "Cbc0010I After 21031000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1568.53 seconds)\n", - "Cbc0010I After 21032000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1568.61 seconds)\n", - "Cbc0010I After 21033000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1568.67 seconds)\n", - "Cbc0010I After 21034000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1568.75 seconds)\n", - "Cbc0010I After 21035000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1568.83 seconds)\n", - "Cbc0010I After 21036000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1568.91 seconds)\n", - "Cbc0010I After 21037000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1568.98 seconds)\n", - "Cbc0010I After 21038000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1569.06 seconds)\n", - "Cbc0010I After 21039000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1569.13 seconds)\n", - "Cbc0010I After 21040000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1569.21 seconds)\n", - "Cbc0010I After 21041000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1569.28 seconds)\n", - "Cbc0010I After 21042000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1569.36 seconds)\n", - "Cbc0010I After 21043000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1569.43 seconds)\n", - "Cbc0010I After 21044000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1569.51 seconds)\n", - "Cbc0010I After 21045000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1569.59 seconds)\n", - "Cbc0010I After 21046000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1569.66 seconds)\n", - "Cbc0010I After 21047000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1569.73 seconds)\n", - "Cbc0010I After 21048000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1569.81 seconds)\n", - "Cbc0010I After 21049000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1569.89 seconds)\n", - "Cbc0010I After 21050000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1569.96 seconds)\n", - "Cbc0010I After 21051000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1570.03 seconds)\n", - "Cbc0010I After 21052000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1570.11 seconds)\n", - "Cbc0010I After 21053000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1570.18 seconds)\n", - "Cbc0010I After 21054000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1570.26 seconds)\n", - "Cbc0010I After 21055000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1570.33 seconds)\n", - "Cbc0010I After 21056000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1570.40 seconds)\n", - "Cbc0010I After 21057000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1570.47 seconds)\n", - "Cbc0010I After 21058000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1570.54 seconds)\n", - "Cbc0010I After 21059000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1570.62 seconds)\n", - "Cbc0010I After 21060000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1570.69 seconds)\n", - "Cbc0010I After 21061000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1570.76 seconds)\n", - "Cbc0010I After 21062000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1570.83 seconds)\n", - "Cbc0010I After 21063000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1570.90 seconds)\n", - "Cbc0010I After 21064000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1570.97 seconds)\n", - "Cbc0010I After 21065000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1571.05 seconds)\n", - "Cbc0010I After 21066000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1571.12 seconds)\n", - "Cbc0010I After 21067000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1571.19 seconds)\n", - "Cbc0010I After 21068000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1571.26 seconds)\n", - "Cbc0010I After 21069000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1571.33 seconds)\n", - "Cbc0010I After 21070000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1571.40 seconds)\n", - "Cbc0010I After 21071000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1571.48 seconds)\n", - "Cbc0010I After 21072000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1571.55 seconds)\n", - "Cbc0010I After 21073000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1571.62 seconds)\n", - "Cbc0010I After 21074000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1571.69 seconds)\n", - "Cbc0010I After 21075000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1571.77 seconds)\n", - "Cbc0010I After 21076000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1571.85 seconds)\n", - "Cbc0010I After 21077000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1571.97 seconds)\n", - "Cbc0010I After 21078000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1572.08 seconds)\n", - "Cbc0010I After 21079000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1572.18 seconds)\n", - "Cbc0010I After 21080000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1572.27 seconds)\n", - "Cbc0010I After 21081000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1572.35 seconds)\n", - "Cbc0010I After 21082000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1572.42 seconds)\n", - "Cbc0010I After 21083000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1572.50 seconds)\n", - "Cbc0010I After 21084000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1572.57 seconds)\n", - "Cbc0010I After 21085000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1572.64 seconds)\n", - "Cbc0010I After 21086000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1572.71 seconds)\n", - "Cbc0010I After 21087000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1572.79 seconds)\n", - "Cbc0010I After 21088000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1572.86 seconds)\n", - "Cbc0010I After 21089000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1572.94 seconds)\n", - "Cbc0010I After 21090000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1573.01 seconds)\n", - "Cbc0010I After 21091000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1573.08 seconds)\n", - "Cbc0010I After 21092000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1573.16 seconds)\n", - "Cbc0010I After 21093000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1573.23 seconds)\n", - "Cbc0010I After 21094000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1573.31 seconds)\n", - "Cbc0010I After 21095000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1573.39 seconds)\n", - "Cbc0010I After 21096000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1573.47 seconds)\n", - "Cbc0010I After 21097000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1573.55 seconds)\n", - "Cbc0010I After 21098000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1573.63 seconds)\n", - "Cbc0010I After 21099000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1573.71 seconds)\n", - "Cbc0010I After 21100000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1573.78 seconds)\n", - "Cbc0010I After 21101000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1573.86 seconds)\n", - "Cbc0010I After 21102000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1573.93 seconds)\n", - "Cbc0010I After 21103000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1574.00 seconds)\n", - "Cbc0010I After 21104000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1574.08 seconds)\n", - "Cbc0010I After 21105000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1574.17 seconds)\n", - "Cbc0010I After 21106000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1574.25 seconds)\n", - "Cbc0010I After 21107000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1574.33 seconds)\n", - "Cbc0010I After 21108000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1574.40 seconds)\n", - "Cbc0010I After 21109000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1574.47 seconds)\n", - "Cbc0010I After 21110000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1574.55 seconds)\n", - "Cbc0010I After 21111000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1574.62 seconds)\n", - "Cbc0010I After 21112000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1574.70 seconds)\n", - "Cbc0010I After 21113000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1574.78 seconds)\n", - "Cbc0010I After 21114000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1574.85 seconds)\n", - "Cbc0010I After 21115000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1574.93 seconds)\n", - "Cbc0010I After 21116000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1575.01 seconds)\n", - "Cbc0010I After 21117000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1575.08 seconds)\n", - "Cbc0010I After 21118000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1575.16 seconds)\n", - "Cbc0010I After 21119000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1575.24 seconds)\n", - "Cbc0010I After 21120000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1575.33 seconds)\n", - "Cbc0010I After 21121000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1575.41 seconds)\n", - "Cbc0010I After 21122000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1575.48 seconds)\n", - "Cbc0010I After 21123000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1575.56 seconds)\n", - "Cbc0010I After 21124000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1575.64 seconds)\n", - "Cbc0010I After 21125000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1575.70 seconds)\n", - "Cbc0010I After 21126000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1575.77 seconds)\n", - "Cbc0010I After 21127000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1575.83 seconds)\n", - "Cbc0010I After 21128000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1575.90 seconds)\n", - "Cbc0010I After 21129000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1575.98 seconds)\n", - "Cbc0010I After 21130000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1576.04 seconds)\n", - "Cbc0010I After 21131000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1576.10 seconds)\n", - "Cbc0010I After 21132000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1576.16 seconds)\n", - "Cbc0010I After 21133000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1576.22 seconds)\n", - "Cbc0010I After 21134000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1576.29 seconds)\n", - "Cbc0010I After 21135000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1576.35 seconds)\n", - "Cbc0010I After 21136000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1576.42 seconds)\n", - "Cbc0010I After 21137000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1576.49 seconds)\n", - "Cbc0010I After 21138000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1576.55 seconds)\n", - "Cbc0010I After 21139000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1576.61 seconds)\n", - "Cbc0010I After 21140000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1576.66 seconds)\n", - "Cbc0010I After 21141000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1576.72 seconds)\n", - "Cbc0010I After 21142000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1576.78 seconds)\n", - "Cbc0010I After 21143000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1576.84 seconds)\n", - "Cbc0010I After 21144000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1576.90 seconds)\n", - "Cbc0010I After 21145000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1576.96 seconds)\n", - "Cbc0010I After 21146000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1577.04 seconds)\n", - "Cbc0010I After 21147000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1577.10 seconds)\n", - "Cbc0010I After 21148000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1577.18 seconds)\n", - "Cbc0010I After 21149000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1577.24 seconds)\n", - "Cbc0010I After 21150000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1577.30 seconds)\n", - "Cbc0010I After 21151000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1577.36 seconds)\n", - "Cbc0010I After 21152000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1577.41 seconds)\n", - "Cbc0010I After 21153000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1577.47 seconds)\n", - "Cbc0010I After 21154000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1577.53 seconds)\n", - "Cbc0010I After 21155000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1577.59 seconds)\n", - "Cbc0010I After 21156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1577.66 seconds)\n", - "Cbc0010I After 21157000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1577.71 seconds)\n", - "Cbc0010I After 21158000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1577.76 seconds)\n", - "Cbc0010I After 21159000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1577.82 seconds)\n", - "Cbc0010I After 21160000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1577.90 seconds)\n", - "Cbc0010I After 21161000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1578.00 seconds)\n", - "Cbc0010I After 21162000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1578.08 seconds)\n", - "Cbc0010I After 21163000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1578.15 seconds)\n", - "Cbc0010I After 21164000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1578.23 seconds)\n", - "Cbc0010I After 21165000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1578.28 seconds)\n", - "Cbc0010I After 21166000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1578.34 seconds)\n", - "Cbc0010I After 21167000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1578.40 seconds)\n", - "Cbc0010I After 21168000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1578.46 seconds)\n", - "Cbc0010I After 21169000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1578.52 seconds)\n", - "Cbc0010I After 21170000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1578.59 seconds)\n", - "Cbc0010I After 21171000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1578.65 seconds)\n", - "Cbc0010I After 21172000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1578.71 seconds)\n", - "Cbc0010I After 21173000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1578.78 seconds)\n", - "Cbc0010I After 21174000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1578.84 seconds)\n", - "Cbc0010I After 21175000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1578.90 seconds)\n", - "Cbc0010I After 21176000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1578.97 seconds)\n", - "Cbc0010I After 21177000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1579.03 seconds)\n", - "Cbc0010I After 21178000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1579.09 seconds)\n", - "Cbc0010I After 21179000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1579.15 seconds)\n", - "Cbc0010I After 21180000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1579.22 seconds)\n", - "Cbc0010I After 21181000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1579.29 seconds)\n", - "Cbc0010I After 21182000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1579.36 seconds)\n", - "Cbc0010I After 21183000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1579.42 seconds)\n", - "Cbc0010I After 21184000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1579.48 seconds)\n", - "Cbc0010I After 21185000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1579.55 seconds)\n", - "Cbc0010I After 21186000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1579.61 seconds)\n", - "Cbc0010I After 21187000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1579.67 seconds)\n", - "Cbc0010I After 21188000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1579.73 seconds)\n", - "Cbc0010I After 21189000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1579.80 seconds)\n", - "Cbc0010I After 21190000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1579.86 seconds)\n", - "Cbc0010I After 21191000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1579.92 seconds)\n", - "Cbc0010I After 21192000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1579.98 seconds)\n", - "Cbc0010I After 21193000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1580.04 seconds)\n", - "Cbc0010I After 21194000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1580.10 seconds)\n", - "Cbc0010I After 21195000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1580.16 seconds)\n", - "Cbc0010I After 21196000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1580.22 seconds)\n", - "Cbc0010I After 21197000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1580.27 seconds)\n", - "Cbc0010I After 21198000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1580.33 seconds)\n", - "Cbc0010I After 21199000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1580.39 seconds)\n", - "Cbc0010I After 21200000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1580.44 seconds)\n", - "Cbc0010I After 21201000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1580.50 seconds)\n", - "Cbc0010I After 21202000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1580.56 seconds)\n", - "Cbc0010I After 21203000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1580.61 seconds)\n", - "Cbc0010I After 21204000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1580.68 seconds)\n", - "Cbc0010I After 21205000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1580.74 seconds)\n", - "Cbc0010I After 21206000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1580.81 seconds)\n", - "Cbc0010I After 21207000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1580.90 seconds)\n", - "Cbc0010I After 21208000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1580.95 seconds)\n", - "Cbc0010I After 21209000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1581.02 seconds)\n", - "Cbc0010I After 21210000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1581.10 seconds)\n", - "Cbc0010I After 21211000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1581.14 seconds)\n", - "Cbc0010I After 21212000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1581.20 seconds)\n", - "Cbc0010I After 21213000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1581.26 seconds)\n", - "Cbc0010I After 21214000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1581.32 seconds)\n", - "Cbc0010I After 21215000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1581.39 seconds)\n", - "Cbc0010I After 21216000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1581.45 seconds)\n", - "Cbc0010I After 21217000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1581.51 seconds)\n", - "Cbc0010I After 21218000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1581.57 seconds)\n", - "Cbc0010I After 21219000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1581.63 seconds)\n", - "Cbc0010I After 21220000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1581.70 seconds)\n", - "Cbc0010I After 21221000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1581.76 seconds)\n", - "Cbc0010I After 21222000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1581.83 seconds)\n", - "Cbc0010I After 21223000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1581.90 seconds)\n", - "Cbc0010I After 21224000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1581.96 seconds)\n", - "Cbc0010I After 21225000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1582.03 seconds)\n", - "Cbc0010I After 21226000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1582.10 seconds)\n", - "Cbc0010I After 21227000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1582.16 seconds)\n", - "Cbc0010I After 21228000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1582.23 seconds)\n", - "Cbc0010I After 21229000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1582.29 seconds)\n", - "Cbc0010I After 21230000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1582.35 seconds)\n", - "Cbc0010I After 21231000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1582.42 seconds)\n", - "Cbc0010I After 21232000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1582.48 seconds)\n", - "Cbc0010I After 21233000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1582.55 seconds)\n", - "Cbc0010I After 21234000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1582.62 seconds)\n", - "Cbc0010I After 21235000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1582.67 seconds)\n", - "Cbc0010I After 21236000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1582.72 seconds)\n", - "Cbc0010I After 21237000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1582.77 seconds)\n", - "Cbc0010I After 21238000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1582.84 seconds)\n", - "Cbc0010I After 21239000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1582.90 seconds)\n", - "Cbc0010I After 21240000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1582.96 seconds)\n", - "Cbc0010I After 21241000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1583.03 seconds)\n", - "Cbc0010I After 21242000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1583.08 seconds)\n", - "Cbc0010I After 21243000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1583.14 seconds)\n", - "Cbc0010I After 21244000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1583.20 seconds)\n", - "Cbc0010I After 21245000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1583.27 seconds)\n", - "Cbc0010I After 21246000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1583.32 seconds)\n", - "Cbc0010I After 21247000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1583.38 seconds)\n", - "Cbc0010I After 21248000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1583.44 seconds)\n", - "Cbc0010I After 21249000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1583.50 seconds)\n", - "Cbc0010I After 21250000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1583.56 seconds)\n", - "Cbc0010I After 21251000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1583.62 seconds)\n", - "Cbc0010I After 21252000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1583.68 seconds)\n", - "Cbc0010I After 21253000 nodes, 26 on tree, 1e+50 best solution, best possible 0 (1583.74 seconds)\n", - "Cbc0010I After 21254000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1583.80 seconds)\n", - "Cbc0010I After 21255000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1583.87 seconds)\n", - "Cbc0010I After 21256000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1583.93 seconds)\n", - "Cbc0010I After 21257000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1583.98 seconds)\n", - "Cbc0010I After 21258000 nodes, 22 on tree, 1e+50 best solution, best possible 0 (1584.04 seconds)\n", - "Cbc0010I After 21259000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1584.10 seconds)\n", - "Cbc0010I After 21260000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1584.19 seconds)\n", - "Cbc0010I After 21261000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1584.26 seconds)\n", - "Cbc0010I After 21262000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1584.34 seconds)\n", - "Cbc0010I After 21263000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1584.42 seconds)\n", - "Cbc0010I After 21264000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1584.50 seconds)\n", - "Cbc0010I After 21265000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1584.56 seconds)\n", - "Cbc0010I After 21266000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1584.63 seconds)\n", - "Cbc0010I After 21267000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1584.70 seconds)\n", - "Cbc0010I After 21268000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1584.77 seconds)\n", - "Cbc0010I After 21269000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1584.85 seconds)\n", - "Cbc0010I After 21270000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1584.92 seconds)\n", - "Cbc0010I After 21271000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1584.99 seconds)\n", - "Cbc0010I After 21272000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1585.05 seconds)\n", - "Cbc0010I After 21273000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1585.12 seconds)\n", - "Cbc0010I After 21274000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1585.19 seconds)\n", - "Cbc0010I After 21275000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1585.26 seconds)\n", - "Cbc0010I After 21276000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1585.33 seconds)\n", - "Cbc0010I After 21277000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1585.42 seconds)\n", - "Cbc0010I After 21278000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1585.52 seconds)\n", - "Cbc0010I After 21279000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1585.61 seconds)\n", - "Cbc0010I After 21280000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1585.69 seconds)\n", - "Cbc0010I After 21281000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1585.77 seconds)\n", - "Cbc0010I After 21282000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1585.84 seconds)\n", - "Cbc0010I After 21283000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1585.91 seconds)\n", - "Cbc0010I After 21284000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1585.98 seconds)\n", - "Cbc0010I After 21285000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1586.06 seconds)\n", - "Cbc0010I After 21286000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1586.19 seconds)\n", - "Cbc0010I After 21287000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1586.27 seconds)\n", - "Cbc0010I After 21288000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1586.35 seconds)\n", - "Cbc0010I After 21289000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1586.44 seconds)\n", - "Cbc0010I After 21290000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1586.51 seconds)\n", - "Cbc0010I After 21291000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1586.58 seconds)\n", - "Cbc0010I After 21292000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1586.65 seconds)\n", - "Cbc0010I After 21293000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1586.73 seconds)\n", - "Cbc0010I After 21294000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1586.80 seconds)\n", - "Cbc0010I After 21295000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1586.87 seconds)\n", - "Cbc0010I After 21296000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1586.95 seconds)\n", - "Cbc0010I After 21297000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1587.02 seconds)\n", - "Cbc0010I After 21298000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1587.09 seconds)\n", - "Cbc0010I After 21299000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1587.17 seconds)\n", - "Cbc0010I After 21300000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1587.24 seconds)\n", - "Cbc0010I After 21301000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1587.32 seconds)\n", - "Cbc0010I After 21302000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1587.39 seconds)\n", - "Cbc0010I After 21303000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1587.46 seconds)\n", - "Cbc0010I After 21304000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1587.54 seconds)\n", - "Cbc0010I After 21305000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1587.61 seconds)\n", - "Cbc0010I After 21306000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1587.68 seconds)\n", - "Cbc0010I After 21307000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1587.76 seconds)\n", - "Cbc0010I After 21308000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1587.83 seconds)\n", - "Cbc0010I After 21309000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1587.91 seconds)\n", - "Cbc0010I After 21310000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1587.98 seconds)\n", - "Cbc0010I After 21311000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1588.05 seconds)\n", - "Cbc0010I After 21312000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1588.13 seconds)\n", - "Cbc0010I After 21313000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1588.20 seconds)\n", - "Cbc0010I After 21314000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1588.28 seconds)\n", - "Cbc0010I After 21315000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1588.36 seconds)\n", - "Cbc0010I After 21316000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1588.47 seconds)\n", - "Cbc0010I After 21317000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1588.56 seconds)\n", - "Cbc0010I After 21318000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1588.64 seconds)\n", - "Cbc0010I After 21319000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1588.71 seconds)\n", - "Cbc0010I After 21320000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1588.78 seconds)\n", - "Cbc0010I After 21321000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1588.86 seconds)\n", - "Cbc0010I After 21322000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1588.93 seconds)\n", - "Cbc0010I After 21323000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1589.00 seconds)\n", - "Cbc0010I After 21324000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1589.08 seconds)\n", - "Cbc0010I After 21325000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1589.15 seconds)\n", - "Cbc0010I After 21326000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1589.23 seconds)\n", - "Cbc0010I After 21327000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1589.30 seconds)\n", - "Cbc0010I After 21328000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1589.41 seconds)\n", - "Cbc0010I After 21329000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1589.50 seconds)\n", - "Cbc0010I After 21330000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1589.59 seconds)\n", - "Cbc0010I After 21331000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1589.67 seconds)\n", - "Cbc0010I After 21332000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1589.74 seconds)\n", - "Cbc0010I After 21333000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1589.82 seconds)\n", - "Cbc0010I After 21334000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1589.89 seconds)\n", - "Cbc0010I After 21335000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1589.97 seconds)\n", - "Cbc0010I After 21336000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1590.05 seconds)\n", - "Cbc0010I After 21337000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1590.12 seconds)\n", - "Cbc0010I After 21338000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.20 seconds)\n", - "Cbc0010I After 21339000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1590.27 seconds)\n", - "Cbc0010I After 21340000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1590.35 seconds)\n", - "Cbc0010I After 21341000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1590.42 seconds)\n", - "Cbc0010I After 21342000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1590.50 seconds)\n", - "Cbc0010I After 21343000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.58 seconds)\n", - "Cbc0010I After 21344000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1590.66 seconds)\n", - "Cbc0010I After 21345000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1590.74 seconds)\n", - "Cbc0010I After 21346000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1590.81 seconds)\n", - "Cbc0010I After 21347000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1590.89 seconds)\n", - "Cbc0010I After 21348000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1590.97 seconds)\n", - "Cbc0010I After 21349000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1591.05 seconds)\n", - "Cbc0010I After 21350000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1591.12 seconds)\n", - "Cbc0010I After 21351000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1591.20 seconds)\n", - "Cbc0010I After 21352000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1591.27 seconds)\n", - "Cbc0010I After 21353000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1591.35 seconds)\n", - "Cbc0010I After 21354000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1591.43 seconds)\n", - "Cbc0010I After 21355000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1591.50 seconds)\n", - "Cbc0010I After 21356000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1591.58 seconds)\n", - "Cbc0010I After 21357000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1591.65 seconds)\n", - "Cbc0010I After 21358000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1591.73 seconds)\n", - "Cbc0010I After 21359000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1591.81 seconds)\n", - "Cbc0010I After 21360000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1591.88 seconds)\n", - "Cbc0010I After 21361000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1591.96 seconds)\n", - "Cbc0010I After 21362000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1592.03 seconds)\n", - "Cbc0010I After 21363000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1592.11 seconds)\n", - "Cbc0010I After 21364000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1592.19 seconds)\n", - "Cbc0010I After 21365000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1592.26 seconds)\n", - "Cbc0010I After 21366000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1592.34 seconds)\n", - "Cbc0010I After 21367000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1592.41 seconds)\n", - "Cbc0010I After 21368000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1592.50 seconds)\n", - "Cbc0010I After 21369000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1592.58 seconds)\n", - "Cbc0010I After 21370000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1592.66 seconds)\n", - "Cbc0010I After 21371000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1592.74 seconds)\n", - "Cbc0010I After 21372000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1592.82 seconds)\n", - "Cbc0010I After 21373000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1592.89 seconds)\n", - "Cbc0010I After 21374000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1592.97 seconds)\n", - "Cbc0010I After 21375000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1593.05 seconds)\n", - "Cbc0010I After 21376000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1593.13 seconds)\n", - "Cbc0010I After 21377000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1593.20 seconds)\n", - "Cbc0010I After 21378000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1593.28 seconds)\n", - "Cbc0010I After 21379000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1593.36 seconds)\n", - "Cbc0010I After 21380000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1593.43 seconds)\n", - "Cbc0010I After 21381000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1593.51 seconds)\n", - "Cbc0010I After 21382000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1593.59 seconds)\n", - "Cbc0010I After 21383000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1593.67 seconds)\n", - "Cbc0010I After 21384000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1593.74 seconds)\n", - "Cbc0010I After 21385000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1593.82 seconds)\n", - "Cbc0010I After 21386000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1593.90 seconds)\n", - "Cbc0010I After 21387000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1593.98 seconds)\n", - "Cbc0010I After 21388000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1594.06 seconds)\n", - "Cbc0010I After 21389000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1594.15 seconds)\n", - "Cbc0010I After 21390000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1594.21 seconds)\n", - "Cbc0010I After 21391000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1594.28 seconds)\n", - "Cbc0010I After 21392000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1594.34 seconds)\n", - "Cbc0010I After 21393000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1594.40 seconds)\n", - "Cbc0010I After 21394000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1594.46 seconds)\n", - "Cbc0010I After 21395000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1594.53 seconds)\n", - "Cbc0010I After 21396000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1594.59 seconds)\n", - "Cbc0010I After 21397000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1594.66 seconds)\n", - "Cbc0010I After 21398000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1594.73 seconds)\n", - "Cbc0010I After 21399000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1594.80 seconds)\n", - "Cbc0010I After 21400000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1594.86 seconds)\n", - "Cbc0010I After 21401000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1594.93 seconds)\n", - "Cbc0010I After 21402000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1594.99 seconds)\n", - "Cbc0010I After 21403000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1595.05 seconds)\n", - "Cbc0010I After 21404000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1595.11 seconds)\n", - "Cbc0010I After 21405000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1595.17 seconds)\n", - "Cbc0010I After 21406000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1595.24 seconds)\n", - "Cbc0010I After 21407000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1595.32 seconds)\n", - "Cbc0010I After 21408000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1595.38 seconds)\n", - "Cbc0010I After 21409000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1595.44 seconds)\n", - "Cbc0010I After 21410000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1595.50 seconds)\n", - "Cbc0010I After 21411000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1595.57 seconds)\n", - "Cbc0010I After 21412000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1595.64 seconds)\n", - "Cbc0010I After 21413000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1595.71 seconds)\n", - "Cbc0010I After 21414000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1595.78 seconds)\n", - "Cbc0010I After 21415000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1595.85 seconds)\n", - "Cbc0010I After 21416000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1595.92 seconds)\n", - "Cbc0010I After 21417000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1595.99 seconds)\n", - "Cbc0010I After 21418000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1596.06 seconds)\n", - "Cbc0010I After 21419000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1596.12 seconds)\n", - "Cbc0010I After 21420000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1596.19 seconds)\n", - "Cbc0010I After 21421000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1596.25 seconds)\n", - "Cbc0010I After 21422000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1596.32 seconds)\n", - "Cbc0010I After 21423000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1596.38 seconds)\n", - "Cbc0010I After 21424000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1596.44 seconds)\n", - "Cbc0010I After 21425000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1596.50 seconds)\n", - "Cbc0010I After 21426000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1596.56 seconds)\n", - "Cbc0010I After 21427000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1596.63 seconds)\n", - "Cbc0010I After 21428000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1596.69 seconds)\n", - "Cbc0010I After 21429000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1596.76 seconds)\n", - "Cbc0010I After 21430000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1596.83 seconds)\n", - "Cbc0010I After 21431000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1596.90 seconds)\n", - "Cbc0010I After 21432000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1596.97 seconds)\n", - "Cbc0010I After 21433000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1597.04 seconds)\n", - "Cbc0010I After 21434000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1597.10 seconds)\n", - "Cbc0010I After 21435000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1597.16 seconds)\n", - "Cbc0010I After 21436000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1597.22 seconds)\n", - "Cbc0010I After 21437000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1597.29 seconds)\n", - "Cbc0010I After 21438000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1597.35 seconds)\n", - "Cbc0010I After 21439000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1597.42 seconds)\n", - "Cbc0010I After 21440000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1597.48 seconds)\n", - "Cbc0010I After 21441000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1597.54 seconds)\n", - "Cbc0010I After 21442000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1597.60 seconds)\n", - "Cbc0010I After 21443000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1597.67 seconds)\n", - "Cbc0010I After 21444000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1597.73 seconds)\n", - "Cbc0010I After 21445000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1597.79 seconds)\n", - "Cbc0010I After 21446000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1597.86 seconds)\n", - "Cbc0010I After 21447000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1597.92 seconds)\n", - "Cbc0010I After 21448000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1597.99 seconds)\n", - "Cbc0010I After 21449000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1598.05 seconds)\n", - "Cbc0010I After 21450000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1598.10 seconds)\n", - "Cbc0010I After 21451000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1598.16 seconds)\n", - "Cbc0010I After 21452000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1598.22 seconds)\n", - "Cbc0010I After 21453000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1598.28 seconds)\n", - "Cbc0010I After 21454000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1598.35 seconds)\n", - "Cbc0010I After 21455000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1598.42 seconds)\n", - "Cbc0010I After 21456000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1598.49 seconds)\n", - "Cbc0010I After 21457000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1598.55 seconds)\n", - "Cbc0010I After 21458000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1598.62 seconds)\n", - "Cbc0010I After 21459000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1598.68 seconds)\n", - "Cbc0010I After 21460000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1598.76 seconds)\n", - "Cbc0010I After 21461000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1598.81 seconds)\n", - "Cbc0010I After 21462000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1598.87 seconds)\n", - "Cbc0010I After 21463000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1598.98 seconds)\n", - "Cbc0010I After 21464000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1599.05 seconds)\n", - "Cbc0010I After 21465000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1599.11 seconds)\n", - "Cbc0010I After 21466000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1599.18 seconds)\n", - "Cbc0010I After 21467000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1599.24 seconds)\n", - "Cbc0010I After 21468000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1599.30 seconds)\n", - "Cbc0010I After 21469000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1599.36 seconds)\n", - "Cbc0010I After 21470000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1599.42 seconds)\n", - "Cbc0010I After 21471000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1599.48 seconds)\n", - "Cbc0010I After 21472000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1599.54 seconds)\n", - "Cbc0010I After 21473000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1599.60 seconds)\n", - "Cbc0010I After 21474000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1599.66 seconds)\n", - "Cbc0010I After 21475000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1599.72 seconds)\n", - "Cbc0010I After 21476000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1599.78 seconds)\n", - "Cbc0010I After 21477000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1599.85 seconds)\n", - "Cbc0010I After 21478000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1599.92 seconds)\n", - "Cbc0010I After 21479000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1599.98 seconds)\n", - "Cbc0010I After 21480000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1600.03 seconds)\n", - "Cbc0010I After 21481000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1600.09 seconds)\n", - "Cbc0010I After 21482000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1600.16 seconds)\n", - "Cbc0010I After 21483000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1600.23 seconds)\n", - "Cbc0010I After 21484000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1600.27 seconds)\n", - "Cbc0010I After 21485000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1600.33 seconds)\n", - "Cbc0010I After 21486000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1600.40 seconds)\n", - "Cbc0010I After 21487000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1600.46 seconds)\n", - "Cbc0010I After 21488000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1600.51 seconds)\n", - "Cbc0010I After 21489000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1600.56 seconds)\n", - "Cbc0010I After 21490000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1600.62 seconds)\n", - "Cbc0010I After 21491000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1600.68 seconds)\n", - "Cbc0010I After 21492000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1600.74 seconds)\n", - "Cbc0010I After 21493000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1600.80 seconds)\n", - "Cbc0010I After 21494000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1600.87 seconds)\n", - "Cbc0010I After 21495000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1600.98 seconds)\n", - "Cbc0010I After 21496000 nodes, 32 on tree, 1e+50 best solution, best possible 0 (1601.07 seconds)\n", - "Cbc0010I After 21497000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1601.15 seconds)\n", - "Cbc0010I After 21498000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1601.23 seconds)\n", - "Cbc0010I After 21499000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1601.30 seconds)\n", - "Cbc0010I After 21500000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1601.37 seconds)\n", - "Cbc0010I After 21501000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1601.44 seconds)\n", - "Cbc0010I After 21502000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1601.50 seconds)\n", - "Cbc0010I After 21503000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1601.56 seconds)\n", - "Cbc0010I After 21504000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1601.62 seconds)\n", - "Cbc0010I After 21505000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1601.68 seconds)\n", - "Cbc0010I After 21506000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1601.75 seconds)\n", - "Cbc0010I After 21507000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1601.83 seconds)\n", - "Cbc0010I After 21508000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1601.90 seconds)\n", - "Cbc0010I After 21509000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1601.97 seconds)\n", - "Cbc0010I After 21510000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1602.04 seconds)\n", - "Cbc0010I After 21511000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1602.12 seconds)\n", - "Cbc0010I After 21512000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1602.19 seconds)\n", - "Cbc0010I After 21513000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1602.26 seconds)\n", - "Cbc0010I After 21514000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1602.34 seconds)\n", - "Cbc0010I After 21515000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1602.41 seconds)\n", - "Cbc0010I After 21516000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1602.48 seconds)\n", - "Cbc0010I After 21517000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1602.55 seconds)\n", - "Cbc0010I After 21518000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1602.63 seconds)\n", - "Cbc0010I After 21519000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1602.70 seconds)\n", - "Cbc0010I After 21520000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1602.77 seconds)\n", - "Cbc0010I After 21521000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1602.85 seconds)\n", - "Cbc0010I After 21522000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1602.92 seconds)\n", - "Cbc0010I After 21523000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1603.00 seconds)\n", - "Cbc0010I After 21524000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1603.07 seconds)\n", - "Cbc0010I After 21525000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1603.15 seconds)\n", - "Cbc0010I After 21526000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1603.22 seconds)\n", - "Cbc0010I After 21527000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1603.30 seconds)\n", - "Cbc0010I After 21528000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1603.39 seconds)\n", - "Cbc0010I After 21529000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1603.47 seconds)\n", - "Cbc0010I After 21530000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1603.55 seconds)\n", - "Cbc0010I After 21531000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1603.63 seconds)\n", - "Cbc0010I After 21532000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1603.70 seconds)\n", - "Cbc0010I After 21533000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1603.77 seconds)\n", - "Cbc0010I After 21534000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1603.84 seconds)\n", - "Cbc0010I After 21535000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1603.92 seconds)\n", - "Cbc0010I After 21536000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1604.00 seconds)\n", - "Cbc0010I After 21537000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1604.07 seconds)\n", - "Cbc0010I After 21538000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1604.15 seconds)\n", - "Cbc0010I After 21539000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1604.22 seconds)\n", - "Cbc0010I After 21540000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1604.30 seconds)\n", - "Cbc0010I After 21541000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1604.37 seconds)\n", - "Cbc0010I After 21542000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1604.45 seconds)\n", - "Cbc0010I After 21543000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1604.52 seconds)\n", - "Cbc0010I After 21544000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1604.60 seconds)\n", - "Cbc0010I After 21545000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1604.68 seconds)\n", - "Cbc0010I After 21546000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1604.75 seconds)\n", - "Cbc0010I After 21547000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1604.83 seconds)\n", - "Cbc0010I After 21548000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1604.90 seconds)\n", - "Cbc0010I After 21549000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1604.98 seconds)\n", - "Cbc0010I After 21550000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1605.05 seconds)\n", - "Cbc0010I After 21551000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1605.12 seconds)\n", - "Cbc0010I After 21552000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1605.20 seconds)\n", - "Cbc0010I After 21553000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1605.28 seconds)\n", - "Cbc0010I After 21554000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1605.35 seconds)\n", - "Cbc0010I After 21555000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1605.43 seconds)\n", - "Cbc0010I After 21556000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1605.51 seconds)\n", - "Cbc0010I After 21557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1605.58 seconds)\n", - "Cbc0010I After 21558000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1605.66 seconds)\n", - "Cbc0010I After 21559000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1605.73 seconds)\n", - "Cbc0010I After 21560000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1605.83 seconds)\n", - "Cbc0010I After 21561000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1605.91 seconds)\n", - "Cbc0010I After 21562000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1605.98 seconds)\n", - "Cbc0010I After 21563000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1606.06 seconds)\n", - "Cbc0010I After 21564000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1606.13 seconds)\n", - "Cbc0010I After 21565000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1606.21 seconds)\n", - "Cbc0010I After 21566000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1606.29 seconds)\n", - "Cbc0010I After 21567000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1606.36 seconds)\n", - "Cbc0010I After 21568000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1606.44 seconds)\n", - "Cbc0010I After 21569000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1606.51 seconds)\n", - "Cbc0010I After 21570000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1606.59 seconds)\n", - "Cbc0010I After 21571000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1606.67 seconds)\n", - "Cbc0010I After 21572000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1606.74 seconds)\n", - "Cbc0010I After 21573000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1606.82 seconds)\n", - "Cbc0010I After 21574000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1606.90 seconds)\n", - "Cbc0010I After 21575000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1606.97 seconds)\n", - "Cbc0010I After 21576000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1607.05 seconds)\n", - "Cbc0010I After 21577000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1607.13 seconds)\n", - "Cbc0010I After 21578000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1607.22 seconds)\n", - "Cbc0010I After 21579000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1607.30 seconds)\n", - "Cbc0010I After 21580000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1607.40 seconds)\n", - "Cbc0010I After 21581000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1607.49 seconds)\n", - "Cbc0010I After 21582000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1607.58 seconds)\n", - "Cbc0010I After 21583000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1607.66 seconds)\n", - "Cbc0010I After 21584000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1607.74 seconds)\n", - "Cbc0010I After 21585000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1607.81 seconds)\n", - "Cbc0010I After 21586000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1607.89 seconds)\n", - "Cbc0010I After 21587000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1607.96 seconds)\n", - "Cbc0010I After 21588000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1608.04 seconds)\n", - "Cbc0010I After 21589000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1608.12 seconds)\n", - "Cbc0010I After 21590000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1608.19 seconds)\n", - "Cbc0010I After 21591000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1608.27 seconds)\n", - "Cbc0010I After 21592000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1608.35 seconds)\n", - "Cbc0010I After 21593000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1608.43 seconds)\n", - "Cbc0010I After 21594000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1608.50 seconds)\n", - "Cbc0010I After 21595000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1608.58 seconds)\n", - "Cbc0010I After 21596000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1608.66 seconds)\n", - "Cbc0010I After 21597000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1608.74 seconds)\n", - "Cbc0010I After 21598000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1608.81 seconds)\n", - "Cbc0010I After 21599000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1608.89 seconds)\n", - "Cbc0010I After 21600000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1608.96 seconds)\n", - "Cbc0010I After 21601000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1609.04 seconds)\n", - "Cbc0010I After 21602000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1609.12 seconds)\n", - "Cbc0010I After 21603000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1609.20 seconds)\n", - "Cbc0010I After 21604000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1609.29 seconds)\n", - "Cbc0010I After 21605000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1609.37 seconds)\n", - "Cbc0010I After 21606000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1609.43 seconds)\n", - "Cbc0010I After 21607000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1609.50 seconds)\n", - "Cbc0010I After 21608000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1609.58 seconds)\n", - "Cbc0010I After 21609000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1609.65 seconds)\n", - "Cbc0010I After 21610000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1609.72 seconds)\n", - "Cbc0010I After 21611000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1609.78 seconds)\n", - "Cbc0010I After 21612000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1609.84 seconds)\n", - "Cbc0010I After 21613000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1609.90 seconds)\n", - "Cbc0010I After 21614000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1609.97 seconds)\n", - "Cbc0010I After 21615000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1610.04 seconds)\n", - "Cbc0010I After 21616000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1610.10 seconds)\n", - "Cbc0010I After 21617000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1610.17 seconds)\n", - "Cbc0010I After 21618000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1610.23 seconds)\n", - "Cbc0010I After 21619000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1610.30 seconds)\n", - "Cbc0010I After 21620000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1610.37 seconds)\n", - "Cbc0010I After 21621000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1610.44 seconds)\n", - "Cbc0010I After 21622000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1610.54 seconds)\n", - "Cbc0010I After 21623000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1610.64 seconds)\n", - "Cbc0010I After 21624000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1610.76 seconds)\n", - "Cbc0010I After 21625000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1610.90 seconds)\n", - "Cbc0010I After 21626000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1611.03 seconds)\n", - "Cbc0010I After 21627000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1611.21 seconds)\n", - "Cbc0010I After 21628000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1611.31 seconds)\n", - "Cbc0010I After 21629000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1611.40 seconds)\n", - "Cbc0010I After 21630000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1611.47 seconds)\n", - "Cbc0010I After 21631000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1611.55 seconds)\n", - "Cbc0010I After 21632000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1611.64 seconds)\n", - "Cbc0010I After 21633000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1611.71 seconds)\n", - "Cbc0010I After 21634000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1611.77 seconds)\n", - "Cbc0010I After 21635000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1611.85 seconds)\n", - "Cbc0010I After 21636000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1611.92 seconds)\n", - "Cbc0010I After 21637000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1612.00 seconds)\n", - "Cbc0010I After 21638000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1612.05 seconds)\n", - "Cbc0010I After 21639000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1612.12 seconds)\n", - "Cbc0010I After 21640000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.19 seconds)\n", - "Cbc0010I After 21641000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.26 seconds)\n", - "Cbc0010I After 21642000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1612.32 seconds)\n", - "Cbc0010I After 21643000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1612.38 seconds)\n", - "Cbc0010I After 21644000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1612.45 seconds)\n", - "Cbc0010I After 21645000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1612.51 seconds)\n", - "Cbc0010I After 21646000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1612.58 seconds)\n", - "Cbc0010I After 21647000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1612.64 seconds)\n", - "Cbc0010I After 21648000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1612.70 seconds)\n", - "Cbc0010I After 21649000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1612.76 seconds)\n", - "Cbc0010I After 21650000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1612.82 seconds)\n", - "Cbc0010I After 21651000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1612.88 seconds)\n", - "Cbc0010I After 21652000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1612.93 seconds)\n", - "Cbc0010I After 21653000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1612.99 seconds)\n", - "Cbc0010I After 21654000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1613.05 seconds)\n", - "Cbc0010I After 21655000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1613.10 seconds)\n", - "Cbc0010I After 21656000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1613.17 seconds)\n", - "Cbc0010I After 21657000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1613.23 seconds)\n", - "Cbc0010I After 21658000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1613.28 seconds)\n", - "Cbc0010I After 21659000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.34 seconds)\n", - "Cbc0010I After 21660000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1613.40 seconds)\n", - "Cbc0010I After 21661000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1613.47 seconds)\n", - "Cbc0010I After 21662000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1613.53 seconds)\n", - "Cbc0010I After 21663000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1613.59 seconds)\n", - "Cbc0010I After 21664000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1613.66 seconds)\n", - "Cbc0010I After 21665000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.73 seconds)\n", - "Cbc0010I After 21666000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1613.81 seconds)\n", - "Cbc0010I After 21667000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1613.91 seconds)\n", - "Cbc0010I After 21668000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1613.98 seconds)\n", - "Cbc0010I After 21669000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.05 seconds)\n", - "Cbc0010I After 21670000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1614.11 seconds)\n", - "Cbc0010I After 21671000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1614.17 seconds)\n", - "Cbc0010I After 21672000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1614.24 seconds)\n", - "Cbc0010I After 21673000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.30 seconds)\n", - "Cbc0010I After 21674000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1614.36 seconds)\n", - "Cbc0010I After 21675000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1614.43 seconds)\n", - "Cbc0010I After 21676000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1614.49 seconds)\n", - "Cbc0010I After 21677000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1614.56 seconds)\n", - "Cbc0010I After 21678000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1614.63 seconds)\n", - "Cbc0010I After 21679000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1614.69 seconds)\n", - "Cbc0010I After 21680000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1614.76 seconds)\n", - "Cbc0010I After 21681000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1614.83 seconds)\n", - "Cbc0010I After 21682000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1614.90 seconds)\n", - "Cbc0010I After 21683000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1614.95 seconds)\n", - "Cbc0010I After 21684000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1615.00 seconds)\n", - "Cbc0010I After 21685000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1615.06 seconds)\n", - "Cbc0010I After 21686000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1615.11 seconds)\n", - "Cbc0010I After 21687000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1615.16 seconds)\n", - "Cbc0010I After 21688000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1615.22 seconds)\n", - "Cbc0010I After 21689000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1615.28 seconds)\n", - "Cbc0010I After 21690000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1615.34 seconds)\n", - "Cbc0010I After 21691000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1615.39 seconds)\n", - "Cbc0010I After 21692000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1615.45 seconds)\n", - "Cbc0010I After 21693000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1615.50 seconds)\n", - "Cbc0010I After 21694000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1615.56 seconds)\n", - "Cbc0010I After 21695000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1615.61 seconds)\n", - "Cbc0010I After 21696000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1615.67 seconds)\n", - "Cbc0010I After 21697000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1615.73 seconds)\n", - "Cbc0010I After 21698000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1615.81 seconds)\n", - "Cbc0010I After 21699000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1615.88 seconds)\n", - "Cbc0010I After 21700000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1615.94 seconds)\n", - "Cbc0010I After 21701000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1615.99 seconds)\n", - "Cbc0010I After 21702000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1616.06 seconds)\n", - "Cbc0010I After 21703000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1616.15 seconds)\n", - "Cbc0010I After 21704000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1616.21 seconds)\n", - "Cbc0010I After 21705000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1616.28 seconds)\n", - "Cbc0010I After 21706000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1616.37 seconds)\n", - "Cbc0010I After 21707000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1616.45 seconds)\n", - "Cbc0010I After 21708000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1616.51 seconds)\n", - "Cbc0010I After 21709000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1616.58 seconds)\n", - "Cbc0010I After 21710000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1616.64 seconds)\n", - "Cbc0010I After 21711000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1616.70 seconds)\n", - "Cbc0010I After 21712000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1616.77 seconds)\n", - "Cbc0010I After 21713000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1616.83 seconds)\n", - "Cbc0010I After 21714000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1616.89 seconds)\n", - "Cbc0010I After 21715000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1616.96 seconds)\n", - "Cbc0010I After 21716000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1617.02 seconds)\n", - "Cbc0010I After 21717000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1617.09 seconds)\n", - "Cbc0010I After 21718000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1617.15 seconds)\n", - "Cbc0010I After 21719000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1617.21 seconds)\n", - "Cbc0010I After 21720000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1617.28 seconds)\n", - "Cbc0010I After 21721000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1617.35 seconds)\n", - "Cbc0010I After 21722000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1617.40 seconds)\n", - "Cbc0010I After 21723000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1617.46 seconds)\n", - "Cbc0010I After 21724000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1617.52 seconds)\n", - "Cbc0010I After 21725000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1617.58 seconds)\n", - "Cbc0010I After 21726000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1617.64 seconds)\n", - "Cbc0010I After 21727000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1617.70 seconds)\n", - "Cbc0010I After 21728000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1617.76 seconds)\n", - "Cbc0010I After 21729000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1617.82 seconds)\n", - "Cbc0010I After 21730000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1617.89 seconds)\n", - "Cbc0010I After 21731000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1617.96 seconds)\n", - "Cbc0010I After 21732000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1618.05 seconds)\n", - "Cbc0010I After 21733000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1618.10 seconds)\n", - "Cbc0010I After 21734000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1618.16 seconds)\n", - "Cbc0010I After 21735000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1618.21 seconds)\n", - "Cbc0010I After 21736000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1618.27 seconds)\n", - "Cbc0010I After 21737000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1618.33 seconds)\n", - "Cbc0010I After 21738000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1618.39 seconds)\n", - "Cbc0010I After 21739000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1618.45 seconds)\n", - "Cbc0010I After 21740000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1618.52 seconds)\n", - "Cbc0010I After 21741000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1618.60 seconds)\n", - "Cbc0010I After 21742000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1618.65 seconds)\n", - "Cbc0010I After 21743000 nodes, 34 on tree, 1e+50 best solution, best possible 0 (1618.71 seconds)\n", - "Cbc0010I After 21744000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1618.79 seconds)\n", - "Cbc0010I After 21745000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1618.86 seconds)\n", - "Cbc0010I After 21746000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1618.92 seconds)\n", - "Cbc0010I After 21747000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1618.97 seconds)\n", - "Cbc0010I After 21748000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1619.03 seconds)\n", - "Cbc0010I After 21749000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1619.09 seconds)\n", - "Cbc0010I After 21750000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1619.15 seconds)\n", - "Cbc0010I After 21751000 nodes, 31 on tree, 1e+50 best solution, best possible 0 (1619.21 seconds)\n", - "Cbc0010I After 21752000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1619.27 seconds)\n", - "Cbc0010I After 21753000 nodes, 25 on tree, 1e+50 best solution, best possible 0 (1619.33 seconds)\n", - "Cbc0010I After 21754000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1619.39 seconds)\n", - "Cbc0010I After 21755000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1619.45 seconds)\n", - "Cbc0010I After 21756000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1619.52 seconds)\n", - "Cbc0010I After 21757000 nodes, 33 on tree, 1e+50 best solution, best possible 0 (1619.59 seconds)\n", - "Cbc0010I After 21758000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1619.66 seconds)\n", - "Cbc0010I After 21759000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1619.72 seconds)\n", - "Cbc0010I After 21760000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1619.80 seconds)\n", - "Cbc0010I After 21761000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1619.87 seconds)\n", - "Cbc0010I After 21762000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1619.96 seconds)\n", - "Cbc0010I After 21763000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1620.05 seconds)\n", - "Cbc0010I After 21764000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1620.13 seconds)\n", - "Cbc0010I After 21765000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1620.21 seconds)\n", - "Cbc0010I After 21766000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1620.28 seconds)\n", - "Cbc0010I After 21767000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1620.36 seconds)\n", - "Cbc0010I After 21768000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1620.43 seconds)\n", - "Cbc0010I After 21769000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1620.50 seconds)\n", - "Cbc0010I After 21770000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1620.58 seconds)\n", - "Cbc0010I After 21771000 nodes, 36 on tree, 1e+50 best solution, best possible 0 (1620.65 seconds)\n", - "Cbc0010I After 21772000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1620.72 seconds)\n", - "Cbc0010I After 21773000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1620.80 seconds)\n", - "Cbc0010I After 21774000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1620.87 seconds)\n", - "Cbc0010I After 21775000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1620.94 seconds)\n", - "Cbc0010I After 21776000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1621.02 seconds)\n", - "Cbc0010I After 21777000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1621.10 seconds)\n", - "Cbc0010I After 21778000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1621.17 seconds)\n", - "Cbc0010I After 21779000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1621.24 seconds)\n", - "Cbc0010I After 21780000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1621.32 seconds)\n", - "Cbc0010I After 21781000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1621.41 seconds)\n", - "Cbc0010I After 21782000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1621.49 seconds)\n", - "Cbc0010I After 21783000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1621.57 seconds)\n", - "Cbc0010I After 21784000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1621.64 seconds)\n", - "Cbc0010I After 21785000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1621.71 seconds)\n", - "Cbc0010I After 21786000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1621.78 seconds)\n", - "Cbc0010I After 21787000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1621.86 seconds)\n", - "Cbc0010I After 21788000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1621.93 seconds)\n", - "Cbc0010I After 21789000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1622.00 seconds)\n", - "Cbc0010I After 21790000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1622.08 seconds)\n", - "Cbc0010I After 21791000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1622.16 seconds)\n", - "Cbc0010I After 21792000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1622.23 seconds)\n", - "Cbc0010I After 21793000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1622.30 seconds)\n", - "Cbc0010I After 21794000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1622.38 seconds)\n", - "Cbc0010I After 21795000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1622.45 seconds)\n", - "Cbc0010I After 21796000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1622.53 seconds)\n", - "Cbc0010I After 21797000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1622.61 seconds)\n", - "Cbc0010I After 21798000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1622.68 seconds)\n", - "Cbc0010I After 21799000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1622.75 seconds)\n", - "Cbc0010I After 21800000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1622.83 seconds)\n", - "Cbc0010I After 21801000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1622.90 seconds)\n", - "Cbc0010I After 21802000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1622.98 seconds)\n", - "Cbc0010I After 21803000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1623.05 seconds)\n", - "Cbc0010I After 21804000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1623.13 seconds)\n", - "Cbc0010I After 21805000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1623.20 seconds)\n", - "Cbc0010I After 21806000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1623.28 seconds)\n", - "Cbc0010I After 21807000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1623.35 seconds)\n", - "Cbc0010I After 21808000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1623.42 seconds)\n", - "Cbc0010I After 21809000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1623.50 seconds)\n", - "Cbc0010I After 21810000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1623.58 seconds)\n", - "Cbc0010I After 21811000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1623.66 seconds)\n", - "Cbc0010I After 21812000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1623.73 seconds)\n", - "Cbc0010I After 21813000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1623.81 seconds)\n", - "Cbc0010I After 21814000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1623.88 seconds)\n", - "Cbc0010I After 21815000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1623.95 seconds)\n", - "Cbc0010I After 21816000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1624.03 seconds)\n", - "Cbc0010I After 21817000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1624.10 seconds)\n", - "Cbc0010I After 21818000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1624.18 seconds)\n", - "Cbc0010I After 21819000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1624.26 seconds)\n", - "Cbc0010I After 21820000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1624.35 seconds)\n", - "Cbc0010I After 21821000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1624.43 seconds)\n", - "Cbc0010I After 21822000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1624.51 seconds)\n", - "Cbc0010I After 21823000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1624.59 seconds)\n", - "Cbc0010I After 21824000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1624.66 seconds)\n", - "Cbc0010I After 21825000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1624.74 seconds)\n", - "Cbc0010I After 21826000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1624.81 seconds)\n", - "Cbc0010I After 21827000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1624.89 seconds)\n", - "Cbc0010I After 21828000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1624.97 seconds)\n", - "Cbc0010I After 21829000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1625.04 seconds)\n", - "Cbc0010I After 21830000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1625.12 seconds)\n", - "Cbc0010I After 21831000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1625.19 seconds)\n", - "Cbc0010I After 21832000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1625.26 seconds)\n", - "Cbc0010I After 21833000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1625.33 seconds)\n", - "Cbc0010I After 21834000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1625.40 seconds)\n", - "Cbc0010I After 21835000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1625.47 seconds)\n", - "Cbc0010I After 21836000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1625.54 seconds)\n", - "Cbc0010I After 21837000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1625.61 seconds)\n", - "Cbc0010I After 21838000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1625.69 seconds)\n", - "Cbc0010I After 21839000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1625.76 seconds)\n", - "Cbc0010I After 21840000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1625.83 seconds)\n", - "Cbc0010I After 21841000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1625.90 seconds)\n", - "Cbc0010I After 21842000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1625.97 seconds)\n", - "Cbc0010I After 21843000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1626.05 seconds)\n", - "Cbc0010I After 21844000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1626.12 seconds)\n", - "Cbc0010I After 21845000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1626.19 seconds)\n", - "Cbc0010I After 21846000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1626.29 seconds)\n", - "Cbc0010I After 21847000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1626.37 seconds)\n", - "Cbc0010I After 21848000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1626.45 seconds)\n", - "Cbc0010I After 21849000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1626.52 seconds)\n", - "Cbc0010I After 21850000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1626.60 seconds)\n", - "Cbc0010I After 21851000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1626.68 seconds)\n", - "Cbc0010I After 21852000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1626.76 seconds)\n", - "Cbc0010I After 21853000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1626.83 seconds)\n", - "Cbc0010I After 21854000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1626.91 seconds)\n", - "Cbc0010I After 21855000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1626.99 seconds)\n", - "Cbc0010I After 21856000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1627.07 seconds)\n", - "Cbc0010I After 21857000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1627.17 seconds)\n", - "Cbc0010I After 21858000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1627.25 seconds)\n", - "Cbc0010I After 21859000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1627.32 seconds)\n", - "Cbc0010I After 21860000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1627.39 seconds)\n", - "Cbc0010I After 21861000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1627.45 seconds)\n", - "Cbc0010I After 21862000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1627.51 seconds)\n", - "Cbc0010I After 21863000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1627.57 seconds)\n", - "Cbc0010I After 21864000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1627.63 seconds)\n", - "Cbc0010I After 21865000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1627.70 seconds)\n", - "Cbc0010I After 21866000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1627.77 seconds)\n", - "Cbc0010I After 21867000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1627.84 seconds)\n", - "Cbc0010I After 21868000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1627.90 seconds)\n", - "Cbc0010I After 21869000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1628.02 seconds)\n", - "Cbc0010I After 21870000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1628.10 seconds)\n", - "Cbc0010I After 21871000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.17 seconds)\n", - "Cbc0010I After 21872000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1628.23 seconds)\n", - "Cbc0010I After 21873000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.29 seconds)\n", - "Cbc0010I After 21874000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1628.36 seconds)\n", - "Cbc0010I After 21875000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.43 seconds)\n", - "Cbc0010I After 21876000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.51 seconds)\n", - "Cbc0010I After 21877000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1628.58 seconds)\n", - "Cbc0010I After 21878000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1628.64 seconds)\n", - "Cbc0010I After 21879000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1628.71 seconds)\n", - "Cbc0010I After 21880000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1628.78 seconds)\n", - "Cbc0010I After 21881000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1628.84 seconds)\n", - "Cbc0010I After 21882000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1628.91 seconds)\n", - "Cbc0010I After 21883000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1628.98 seconds)\n", - "Cbc0010I After 21884000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1629.05 seconds)\n", - "Cbc0010I After 21885000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1629.12 seconds)\n", - "Cbc0010I After 21886000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1629.19 seconds)\n", - "Cbc0010I After 21887000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1629.25 seconds)\n", - "Cbc0010I After 21888000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1629.31 seconds)\n", - "Cbc0010I After 21889000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1629.37 seconds)\n", - "Cbc0010I After 21890000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1629.43 seconds)\n", - "Cbc0010I After 21891000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1629.51 seconds)\n", - "Cbc0010I After 21892000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1629.56 seconds)\n", - "Cbc0010I After 21893000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1629.63 seconds)\n", - "Cbc0010I After 21894000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1629.69 seconds)\n", - "Cbc0010I After 21895000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1629.75 seconds)\n", - "Cbc0010I After 21896000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1629.81 seconds)\n", - "Cbc0010I After 21897000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1629.89 seconds)\n", - "Cbc0010I After 21898000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1629.97 seconds)\n", - "Cbc0010I After 21899000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1630.04 seconds)\n", - "Cbc0010I After 21900000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1630.10 seconds)\n", - "Cbc0010I After 21901000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1630.16 seconds)\n", - "Cbc0010I After 21902000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1630.22 seconds)\n", - "Cbc0010I After 21903000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1630.27 seconds)\n", - "Cbc0010I After 21904000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1630.33 seconds)\n", - "Cbc0010I After 21905000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1630.39 seconds)\n", - "Cbc0010I After 21906000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1630.46 seconds)\n", - "Cbc0010I After 21907000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1630.54 seconds)\n", - "Cbc0010I After 21908000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1630.62 seconds)\n", - "Cbc0010I After 21909000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1630.68 seconds)\n", - "Cbc0010I After 21910000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1630.76 seconds)\n", - "Cbc0010I After 21911000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1630.82 seconds)\n", - "Cbc0010I After 21912000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1630.91 seconds)\n", - "Cbc0010I After 21913000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1630.96 seconds)\n", - "Cbc0010I After 21914000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1631.03 seconds)\n", - "Cbc0010I After 21915000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1631.09 seconds)\n", - "Cbc0010I After 21916000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1631.16 seconds)\n", - "Cbc0010I After 21917000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1631.23 seconds)\n", - "Cbc0010I After 21918000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1631.30 seconds)\n", - "Cbc0010I After 21919000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1631.37 seconds)\n", - "Cbc0010I After 21920000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1631.44 seconds)\n", - "Cbc0010I After 21921000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1631.51 seconds)\n", - "Cbc0010I After 21922000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.57 seconds)\n", - "Cbc0010I After 21923000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.64 seconds)\n", - "Cbc0010I After 21924000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1631.71 seconds)\n", - "Cbc0010I After 21925000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1631.77 seconds)\n", - "Cbc0010I After 21926000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1631.84 seconds)\n", - "Cbc0010I After 21927000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1631.91 seconds)\n", - "Cbc0010I After 21928000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1631.97 seconds)\n", - "Cbc0010I After 21929000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1632.04 seconds)\n", - "Cbc0010I After 21930000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1632.09 seconds)\n", - "Cbc0010I After 21931000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1632.15 seconds)\n", - "Cbc0010I After 21932000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1632.21 seconds)\n", - "Cbc0010I After 21933000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1632.28 seconds)\n", - "Cbc0010I After 21934000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1632.34 seconds)\n", - "Cbc0010I After 21935000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1632.40 seconds)\n", - "Cbc0010I After 21936000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1632.46 seconds)\n", - "Cbc0010I After 21937000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1632.52 seconds)\n", - "Cbc0010I After 21938000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1632.59 seconds)\n", - "Cbc0010I After 21939000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1632.65 seconds)\n", - "Cbc0010I After 21940000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1632.71 seconds)\n", - "Cbc0010I After 21941000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1632.77 seconds)\n", - "Cbc0010I After 21942000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1632.83 seconds)\n", - "Cbc0010I After 21943000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1632.89 seconds)\n", - "Cbc0010I After 21944000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1632.95 seconds)\n", - "Cbc0010I After 21945000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1633.01 seconds)\n", - "Cbc0010I After 21946000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1633.07 seconds)\n", - "Cbc0010I After 21947000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1633.14 seconds)\n", - "Cbc0010I After 21948000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1633.21 seconds)\n", - "Cbc0010I After 21949000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1633.27 seconds)\n", - "Cbc0010I After 21950000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1633.35 seconds)\n", - "Cbc0010I After 21951000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1633.41 seconds)\n", - "Cbc0010I After 21952000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1633.48 seconds)\n", - "Cbc0010I After 21953000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1633.54 seconds)\n", - "Cbc0010I After 21954000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1633.60 seconds)\n", - "Cbc0010I After 21955000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1633.67 seconds)\n", - "Cbc0010I After 21956000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1633.73 seconds)\n", - "Cbc0010I After 21957000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1633.80 seconds)\n", - "Cbc0010I After 21958000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1633.88 seconds)\n", - "Cbc0010I After 21959000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1633.95 seconds)\n", - "Cbc0010I After 21960000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1634.02 seconds)\n", - "Cbc0010I After 21961000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1634.08 seconds)\n", - "Cbc0010I After 21962000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1634.15 seconds)\n", - "Cbc0010I After 21963000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1634.21 seconds)\n", - "Cbc0010I After 21964000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1634.28 seconds)\n", - "Cbc0010I After 21965000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1634.34 seconds)\n", - "Cbc0010I After 21966000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1634.40 seconds)\n", - "Cbc0010I After 21967000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1634.46 seconds)\n", - "Cbc0010I After 21968000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1634.52 seconds)\n", - "Cbc0010I After 21969000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1634.58 seconds)\n", - "Cbc0010I After 21970000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1634.64 seconds)\n", - "Cbc0010I After 21971000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1634.70 seconds)\n", - "Cbc0010I After 21972000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1634.76 seconds)\n", - "Cbc0010I After 21973000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1634.82 seconds)\n", - "Cbc0010I After 21974000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1634.89 seconds)\n", - "Cbc0010I After 21975000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1634.96 seconds)\n", - "Cbc0010I After 21976000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1635.02 seconds)\n", - "Cbc0010I After 21977000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1635.09 seconds)\n", - "Cbc0010I After 21978000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1635.15 seconds)\n", - "Cbc0010I After 21979000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1635.21 seconds)\n", - "Cbc0010I After 21980000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1635.28 seconds)\n", - "Cbc0010I After 21981000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1635.34 seconds)\n", - "Cbc0010I After 21982000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1635.40 seconds)\n", - "Cbc0010I After 21983000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1635.46 seconds)\n", - "Cbc0010I After 21984000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1635.51 seconds)\n", - "Cbc0010I After 21985000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1635.57 seconds)\n", - "Cbc0010I After 21986000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1635.63 seconds)\n", - "Cbc0010I After 21987000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1635.69 seconds)\n", - "Cbc0010I After 21988000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1635.75 seconds)\n", - "Cbc0010I After 21989000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1635.81 seconds)\n", - "Cbc0010I After 21990000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1635.87 seconds)\n", - "Cbc0010I After 21991000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1635.93 seconds)\n", - "Cbc0010I After 21992000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1635.99 seconds)\n", - "Cbc0010I After 21993000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1636.05 seconds)\n", - "Cbc0010I After 21994000 nodes, 35 on tree, 1e+50 best solution, best possible 0 (1636.13 seconds)\n", - "Cbc0010I After 21995000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1636.19 seconds)\n", - "Cbc0010I After 21996000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1636.26 seconds)\n", - "Cbc0010I After 21997000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1636.33 seconds)\n", - "Cbc0010I After 21998000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1636.38 seconds)\n", - "Cbc0010I After 21999000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1636.44 seconds)\n", - "Cbc0010I After 22000000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1636.50 seconds)\n", - "Cbc0010I After 22001000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1636.56 seconds)\n", - "Cbc0010I After 22002000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1636.62 seconds)\n", - "Cbc0010I After 22003000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1636.68 seconds)\n", - "Cbc0010I After 22004000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1636.74 seconds)\n", - "Cbc0010I After 22005000 nodes, 203 on tree, 1e+50 best solution, best possible 0 (1636.81 seconds)\n", - "Cbc0010I After 22006000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (1636.91 seconds)\n", - "Cbc0010I After 22007000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (1636.98 seconds)\n", - "Cbc0010I After 22008000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1637.04 seconds)\n", - "Cbc0010I After 22009000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1637.12 seconds)\n", - "Cbc0010I After 22010000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1637.18 seconds)\n", - "Cbc0010I After 22011000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1637.26 seconds)\n", - "Cbc0010I After 22012000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1637.32 seconds)\n", - "Cbc0010I After 22013000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (1637.39 seconds)\n", - "Cbc0010I After 22014000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1637.45 seconds)\n", - "Cbc0010I After 22015000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1637.53 seconds)\n", - "Cbc0010I After 22016000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1637.60 seconds)\n", - "Cbc0010I After 22017000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1637.69 seconds)\n", - "Cbc0010I After 22018000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1637.75 seconds)\n", - "Cbc0010I After 22019000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1637.82 seconds)\n", - "Cbc0010I After 22020000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1637.89 seconds)\n", - "Cbc0010I After 22021000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1637.97 seconds)\n", - "Cbc0010I After 22022000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1638.03 seconds)\n", - "Cbc0010I After 22023000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1638.09 seconds)\n", - "Cbc0010I After 22024000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1638.16 seconds)\n", - "Cbc0010I After 22025000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1638.22 seconds)\n", - "Cbc0010I After 22026000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (1638.29 seconds)\n", - "Cbc0010I After 22027000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1638.37 seconds)\n", - "Cbc0010I After 22028000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1638.45 seconds)\n", - "Cbc0010I After 22029000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1638.51 seconds)\n", - "Cbc0010I After 22030000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1638.58 seconds)\n", - "Cbc0010I After 22031000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1638.66 seconds)\n", - "Cbc0010I After 22032000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1638.73 seconds)\n", - "Cbc0010I After 22033000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1638.80 seconds)\n", - "Cbc0010I After 22034000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1638.86 seconds)\n", - "Cbc0010I After 22035000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1638.94 seconds)\n", - "Cbc0010I After 22036000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1639.03 seconds)\n", - "Cbc0010I After 22037000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1639.10 seconds)\n", - "Cbc0010I After 22038000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1639.17 seconds)\n", - "Cbc0010I After 22039000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1639.24 seconds)\n", - "Cbc0010I After 22040000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1639.30 seconds)\n", - "Cbc0010I After 22041000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1639.37 seconds)\n", - "Cbc0010I After 22042000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1639.43 seconds)\n", - "Cbc0010I After 22043000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1639.49 seconds)\n", - "Cbc0010I After 22044000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1639.56 seconds)\n", - "Cbc0010I After 22045000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1639.62 seconds)\n", - "Cbc0010I After 22046000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1639.69 seconds)\n", - "Cbc0010I After 22047000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1639.75 seconds)\n", - "Cbc0010I After 22048000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1639.83 seconds)\n", - "Cbc0010I After 22049000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1639.90 seconds)\n", - "Cbc0010I After 22050000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1639.96 seconds)\n", - "Cbc0010I After 22051000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1640.04 seconds)\n", - "Cbc0010I After 22052000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1640.11 seconds)\n", - "Cbc0010I After 22053000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1640.19 seconds)\n", - "Cbc0010I After 22054000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1640.27 seconds)\n", - "Cbc0010I After 22055000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1640.34 seconds)\n", - "Cbc0010I After 22056000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1640.41 seconds)\n", - "Cbc0010I After 22057000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1640.49 seconds)\n", - "Cbc0010I After 22058000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1640.57 seconds)\n", - "Cbc0010I After 22059000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1640.64 seconds)\n", - "Cbc0010I After 22060000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1640.71 seconds)\n", - "Cbc0010I After 22061000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1640.78 seconds)\n", - "Cbc0010I After 22062000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1640.86 seconds)\n", - "Cbc0010I After 22063000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1640.95 seconds)\n", - "Cbc0010I After 22064000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1641.04 seconds)\n", - "Cbc0010I After 22065000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1641.11 seconds)\n", - "Cbc0010I After 22066000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1641.18 seconds)\n", - "Cbc0010I After 22067000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1641.26 seconds)\n", - "Cbc0010I After 22068000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1641.33 seconds)\n", - "Cbc0010I After 22069000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1641.40 seconds)\n", - "Cbc0010I After 22070000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1641.46 seconds)\n", - "Cbc0010I After 22071000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1641.53 seconds)\n", - "Cbc0010I After 22072000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1641.59 seconds)\n", - "Cbc0010I After 22073000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1641.65 seconds)\n", - "Cbc0010I After 22074000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1641.72 seconds)\n", - "Cbc0010I After 22075000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1641.79 seconds)\n", - "Cbc0010I After 22076000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1641.86 seconds)\n", - "Cbc0010I After 22077000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1642.00 seconds)\n", - "Cbc0010I After 22078000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1642.09 seconds)\n", - "Cbc0010I After 22079000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1642.16 seconds)\n", - "Cbc0010I After 22080000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1642.23 seconds)\n", - "Cbc0010I After 22081000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1642.30 seconds)\n", - "Cbc0010I After 22082000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1642.37 seconds)\n", - "Cbc0010I After 22083000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1642.44 seconds)\n", - "Cbc0010I After 22084000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1642.51 seconds)\n", - "Cbc0010I After 22085000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1642.57 seconds)\n", - "Cbc0010I After 22086000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1642.63 seconds)\n", - "Cbc0010I After 22087000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1642.69 seconds)\n", - "Cbc0010I After 22088000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1642.75 seconds)\n", - "Cbc0010I After 22089000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1642.82 seconds)\n", - "Cbc0010I After 22090000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1642.88 seconds)\n", - "Cbc0010I After 22091000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1642.94 seconds)\n", - "Cbc0010I After 22092000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1643.00 seconds)\n", - "Cbc0010I After 22093000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1643.06 seconds)\n", - "Cbc0010I After 22094000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1643.12 seconds)\n", - "Cbc0010I After 22095000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1643.19 seconds)\n", - "Cbc0010I After 22096000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1643.25 seconds)\n", - "Cbc0010I After 22097000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1643.32 seconds)\n", - "Cbc0010I After 22098000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1643.37 seconds)\n", - "Cbc0010I After 22099000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1643.43 seconds)\n", - "Cbc0010I After 22100000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1643.49 seconds)\n", - "Cbc0010I After 22101000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1643.55 seconds)\n", - "Cbc0010I After 22102000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1643.61 seconds)\n", - "Cbc0010I After 22103000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1643.67 seconds)\n", - "Cbc0010I After 22104000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1643.74 seconds)\n", - "Cbc0010I After 22105000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1643.80 seconds)\n", - "Cbc0010I After 22106000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1643.86 seconds)\n", - "Cbc0010I After 22107000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1643.92 seconds)\n", - "Cbc0010I After 22108000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1643.98 seconds)\n", - "Cbc0010I After 22109000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1644.04 seconds)\n", - "Cbc0010I After 22110000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1644.11 seconds)\n", - "Cbc0010I After 22111000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1644.19 seconds)\n", - "Cbc0010I After 22112000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1644.27 seconds)\n", - "Cbc0010I After 22113000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1644.33 seconds)\n", - "Cbc0010I After 22114000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1644.40 seconds)\n", - "Cbc0010I After 22115000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1644.46 seconds)\n", - "Cbc0010I After 22116000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1644.52 seconds)\n", - "Cbc0010I After 22117000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1644.58 seconds)\n", - "Cbc0010I After 22118000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1644.67 seconds)\n", - "Cbc0010I After 22119000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1644.74 seconds)\n", - "Cbc0010I After 22120000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1644.81 seconds)\n", - "Cbc0010I After 22121000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1644.89 seconds)\n", - "Cbc0010I After 22122000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1644.95 seconds)\n", - "Cbc0010I After 22123000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1645.01 seconds)\n", - "Cbc0010I After 22124000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1645.08 seconds)\n", - "Cbc0010I After 22125000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1645.15 seconds)\n", - "Cbc0010I After 22126000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1645.21 seconds)\n", - "Cbc0010I After 22127000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1645.28 seconds)\n", - "Cbc0010I After 22128000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1645.34 seconds)\n", - "Cbc0010I After 22129000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1645.42 seconds)\n", - "Cbc0010I After 22130000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1645.49 seconds)\n", - "Cbc0010I After 22131000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1645.56 seconds)\n", - "Cbc0010I After 22132000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1645.62 seconds)\n", - "Cbc0010I After 22133000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1645.68 seconds)\n", - "Cbc0010I After 22134000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1645.74 seconds)\n", - "Cbc0010I After 22135000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1645.82 seconds)\n", - "Cbc0010I After 22136000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1645.89 seconds)\n", - "Cbc0010I After 22137000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1645.95 seconds)\n", - "Cbc0010I After 22138000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1646.01 seconds)\n", - "Cbc0010I After 22139000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1646.08 seconds)\n", - "Cbc0010I After 22140000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1646.15 seconds)\n", - "Cbc0010I After 22141000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1646.22 seconds)\n", - "Cbc0010I After 22142000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1646.28 seconds)\n", - "Cbc0010I After 22143000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1646.34 seconds)\n", - "Cbc0010I After 22144000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1646.40 seconds)\n", - "Cbc0010I After 22145000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1646.47 seconds)\n", - "Cbc0010I After 22146000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1646.54 seconds)\n", - "Cbc0010I After 22147000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1646.61 seconds)\n", - "Cbc0010I After 22148000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1646.68 seconds)\n", - "Cbc0010I After 22149000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1646.75 seconds)\n", - "Cbc0010I After 22150000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1646.82 seconds)\n", - "Cbc0010I After 22151000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1646.89 seconds)\n", - "Cbc0010I After 22152000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1646.95 seconds)\n", - "Cbc0010I After 22153000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1647.03 seconds)\n", - "Cbc0010I After 22154000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1647.10 seconds)\n", - "Cbc0010I After 22155000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1647.17 seconds)\n", - "Cbc0010I After 22156000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1647.22 seconds)\n", - "Cbc0010I After 22157000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1647.29 seconds)\n", - "Cbc0010I After 22158000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1647.37 seconds)\n", - "Cbc0010I After 22159000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1647.45 seconds)\n", - "Cbc0010I After 22160000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1647.54 seconds)\n", - "Cbc0010I After 22161000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1647.61 seconds)\n", - "Cbc0010I After 22162000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1647.68 seconds)\n", - "Cbc0010I After 22163000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1647.74 seconds)\n", - "Cbc0010I After 22164000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1647.81 seconds)\n", - "Cbc0010I After 22165000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1647.88 seconds)\n", - "Cbc0010I After 22166000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1647.95 seconds)\n", - "Cbc0010I After 22167000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1648.02 seconds)\n", - "Cbc0010I After 22168000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1648.10 seconds)\n", - "Cbc0010I After 22169000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1648.16 seconds)\n", - "Cbc0010I After 22170000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1648.23 seconds)\n", - "Cbc0010I After 22171000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1648.29 seconds)\n", - "Cbc0010I After 22172000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1648.35 seconds)\n", - "Cbc0010I After 22173000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1648.41 seconds)\n", - "Cbc0010I After 22174000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1648.48 seconds)\n", - "Cbc0010I After 22175000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1648.53 seconds)\n", - "Cbc0010I After 22176000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1648.60 seconds)\n", - "Cbc0010I After 22177000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1648.68 seconds)\n", - "Cbc0010I After 22178000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1648.76 seconds)\n", - "Cbc0010I After 22179000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1648.83 seconds)\n", - "Cbc0010I After 22180000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1648.91 seconds)\n", - "Cbc0010I After 22181000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1648.98 seconds)\n", - "Cbc0010I After 22182000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1649.05 seconds)\n", - "Cbc0010I After 22183000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1649.12 seconds)\n", - "Cbc0010I After 22184000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1649.18 seconds)\n", - "Cbc0010I After 22185000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1649.25 seconds)\n", - "Cbc0010I After 22186000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1649.33 seconds)\n", - "Cbc0010I After 22187000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1649.41 seconds)\n", - "Cbc0010I After 22188000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1649.48 seconds)\n", - "Cbc0010I After 22189000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1649.56 seconds)\n", - "Cbc0010I After 22190000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1649.63 seconds)\n", - "Cbc0010I After 22191000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1649.71 seconds)\n", - "Cbc0010I After 22192000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1649.78 seconds)\n", - "Cbc0010I After 22193000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1649.84 seconds)\n", - "Cbc0010I After 22194000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1649.91 seconds)\n", - "Cbc0010I After 22195000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1649.97 seconds)\n", - "Cbc0010I After 22196000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1650.03 seconds)\n", - "Cbc0010I After 22197000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1650.10 seconds)\n", - "Cbc0010I After 22198000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1650.18 seconds)\n", - "Cbc0010I After 22199000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1650.25 seconds)\n", - "Cbc0010I After 22200000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1650.33 seconds)\n", - "Cbc0010I After 22201000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1650.40 seconds)\n", - "Cbc0010I After 22202000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1650.49 seconds)\n", - "Cbc0010I After 22203000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1650.56 seconds)\n", - "Cbc0010I After 22204000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1650.63 seconds)\n", - "Cbc0010I After 22205000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1650.70 seconds)\n", - "Cbc0010I After 22206000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1650.76 seconds)\n", - "Cbc0010I After 22207000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1650.82 seconds)\n", - "Cbc0010I After 22208000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1650.88 seconds)\n", - "Cbc0010I After 22209000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1650.96 seconds)\n", - "Cbc0010I After 22210000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1651.03 seconds)\n", - "Cbc0010I After 22211000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1651.11 seconds)\n", - "Cbc0010I After 22212000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1651.18 seconds)\n", - "Cbc0010I After 22213000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1651.24 seconds)\n", - "Cbc0010I After 22214000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1651.33 seconds)\n", - "Cbc0010I After 22215000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1651.43 seconds)\n", - "Cbc0010I After 22216000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1651.52 seconds)\n", - "Cbc0010I After 22217000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1651.60 seconds)\n", - "Cbc0010I After 22218000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1651.68 seconds)\n", - "Cbc0010I After 22219000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1651.76 seconds)\n", - "Cbc0010I After 22220000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1651.83 seconds)\n", - "Cbc0010I After 22221000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1651.89 seconds)\n", - "Cbc0010I After 22222000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1651.95 seconds)\n", - "Cbc0010I After 22223000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1652.01 seconds)\n", - "Cbc0010I After 22224000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1652.07 seconds)\n", - "Cbc0010I After 22225000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1652.14 seconds)\n", - "Cbc0010I After 22226000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1652.21 seconds)\n", - "Cbc0010I After 22227000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1652.28 seconds)\n", - "Cbc0010I After 22228000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1652.35 seconds)\n", - "Cbc0010I After 22229000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1652.41 seconds)\n", - "Cbc0010I After 22230000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1652.46 seconds)\n", - "Cbc0010I After 22231000 nodes, 47 on tree, 1e+50 best solution, best possible 0 (1652.52 seconds)\n", - "Cbc0010I After 22232000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1652.57 seconds)\n", - "Cbc0010I After 22233000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1652.63 seconds)\n", - "Cbc0010I After 22234000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1652.69 seconds)\n", - "Cbc0010I After 22235000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1652.76 seconds)\n", - "Cbc0010I After 22236000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1652.83 seconds)\n", - "Cbc0010I After 22237000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1652.89 seconds)\n", - "Cbc0010I After 22238000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1652.96 seconds)\n", - "Cbc0010I After 22239000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1653.03 seconds)\n", - "Cbc0010I After 22240000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1653.10 seconds)\n", - "Cbc0010I After 22241000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1653.17 seconds)\n", - "Cbc0010I After 22242000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1653.24 seconds)\n", - "Cbc0010I After 22243000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1653.31 seconds)\n", - "Cbc0010I After 22244000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1653.39 seconds)\n", - "Cbc0010I After 22245000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1653.49 seconds)\n", - "Cbc0010I After 22246000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1653.58 seconds)\n", - "Cbc0010I After 22247000 nodes, 38 on tree, 1e+50 best solution, best possible 0 (1653.65 seconds)\n", - "Cbc0010I After 22248000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (1653.76 seconds)\n", - "Cbc0010I After 22249000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (1653.83 seconds)\n", - "Cbc0010I After 22250000 nodes, 186 on tree, 1e+50 best solution, best possible 0 (1653.91 seconds)\n", - "Cbc0010I After 22251000 nodes, 206 on tree, 1e+50 best solution, best possible 0 (1653.98 seconds)\n", - "Cbc0010I After 22252000 nodes, 198 on tree, 1e+50 best solution, best possible 0 (1654.06 seconds)\n", - "Cbc0010I After 22253000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1654.12 seconds)\n", - "Cbc0010I After 22254000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1654.19 seconds)\n", - "Cbc0010I After 22255000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1654.25 seconds)\n", - "Cbc0010I After 22256000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1654.30 seconds)\n", - "Cbc0010I After 22257000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1654.36 seconds)\n", - "Cbc0010I After 22258000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1654.43 seconds)\n", - "Cbc0010I After 22259000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1654.50 seconds)\n", - "Cbc0010I After 22260000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1654.57 seconds)\n", - "Cbc0010I After 22261000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1654.64 seconds)\n", - "Cbc0010I After 22262000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1654.71 seconds)\n", - "Cbc0010I After 22263000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (1654.78 seconds)\n", - "Cbc0010I After 22264000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (1654.85 seconds)\n", - "Cbc0010I After 22265000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1654.92 seconds)\n", - "Cbc0010I After 22266000 nodes, 182 on tree, 1e+50 best solution, best possible 0 (1654.99 seconds)\n", - "Cbc0010I After 22267000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1655.06 seconds)\n", - "Cbc0010I After 22268000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1655.12 seconds)\n", - "Cbc0010I After 22269000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1655.18 seconds)\n", - "Cbc0010I After 22270000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1655.25 seconds)\n", - "Cbc0010I After 22271000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1655.33 seconds)\n", - "Cbc0010I After 22272000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1655.39 seconds)\n", - "Cbc0010I After 22273000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1655.46 seconds)\n", - "Cbc0010I After 22274000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1655.54 seconds)\n", - "Cbc0010I After 22275000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1655.62 seconds)\n", - "Cbc0010I After 22276000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1655.68 seconds)\n", - "Cbc0010I After 22277000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1655.75 seconds)\n", - "Cbc0010I After 22278000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1655.81 seconds)\n", - "Cbc0010I After 22279000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1655.87 seconds)\n", - "Cbc0010I After 22280000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1655.94 seconds)\n", - "Cbc0010I After 22281000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1656.01 seconds)\n", - "Cbc0010I After 22282000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1656.07 seconds)\n", - "Cbc0010I After 22283000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1656.13 seconds)\n", - "Cbc0010I After 22284000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1656.20 seconds)\n", - "Cbc0010I After 22285000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1656.32 seconds)\n", - "Cbc0010I After 22286000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1656.40 seconds)\n", - "Cbc0010I After 22287000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1656.46 seconds)\n", - "Cbc0010I After 22288000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1656.56 seconds)\n", - "Cbc0010I After 22289000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1656.64 seconds)\n", - "Cbc0010I After 22290000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1656.74 seconds)\n", - "Cbc0010I After 22291000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1656.84 seconds)\n", - "Cbc0010I After 22292000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1656.94 seconds)\n", - "Cbc0010I After 22293000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1657.05 seconds)\n", - "Cbc0010I After 22294000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1657.16 seconds)\n", - "Cbc0010I After 22295000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1657.26 seconds)\n", - "Cbc0010I After 22296000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1657.34 seconds)\n", - "Cbc0010I After 22297000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1657.45 seconds)\n", - "Cbc0010I After 22298000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1657.54 seconds)\n", - "Cbc0010I After 22299000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1657.63 seconds)\n", - "Cbc0010I After 22300000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1657.70 seconds)\n", - "Cbc0010I After 22301000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1657.78 seconds)\n", - "Cbc0010I After 22302000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1657.86 seconds)\n", - "Cbc0010I After 22303000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1657.93 seconds)\n", - "Cbc0010I After 22304000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1658.01 seconds)\n", - "Cbc0010I After 22305000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1658.07 seconds)\n", - "Cbc0010I After 22306000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1658.15 seconds)\n", - "Cbc0010I After 22307000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1658.23 seconds)\n", - "Cbc0010I After 22308000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1658.30 seconds)\n", - "Cbc0010I After 22309000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1658.37 seconds)\n", - "Cbc0010I After 22310000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1658.44 seconds)\n", - "Cbc0010I After 22311000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1658.50 seconds)\n", - "Cbc0010I After 22312000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1658.56 seconds)\n", - "Cbc0010I After 22313000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1658.62 seconds)\n", - "Cbc0010I After 22314000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1658.69 seconds)\n", - "Cbc0010I After 22315000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1658.77 seconds)\n", - "Cbc0010I After 22316000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1658.85 seconds)\n", - "Cbc0010I After 22317000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1658.94 seconds)\n", - "Cbc0010I After 22318000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1659.03 seconds)\n", - "Cbc0010I After 22319000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1659.13 seconds)\n", - "Cbc0010I After 22320000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1659.27 seconds)\n", - "Cbc0010I After 22321000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1659.41 seconds)\n", - "Cbc0010I After 22322000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1659.53 seconds)\n", - "Cbc0010I After 22323000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1659.64 seconds)\n", - "Cbc0010I After 22324000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1659.76 seconds)\n", - "Cbc0010I After 22325000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1659.92 seconds)\n", - "Cbc0010I After 22326000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1660.05 seconds)\n", - "Cbc0010I After 22327000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1660.22 seconds)\n", - "Cbc0010I After 22328000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1660.68 seconds)\n", - "Cbc0010I After 22329000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1661.06 seconds)\n", - "Cbc0010I After 22330000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1661.42 seconds)\n", - "Cbc0010I After 22331000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1661.86 seconds)\n", - "Cbc0010I After 22332000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1662.20 seconds)\n", - "Cbc0010I After 22333000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1662.41 seconds)\n", - "Cbc0010I After 22334000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1662.63 seconds)\n", - "Cbc0010I After 22335000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1662.83 seconds)\n", - "Cbc0010I After 22336000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1662.99 seconds)\n", - "Cbc0010I After 22337000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1663.15 seconds)\n", - "Cbc0010I After 22338000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1663.34 seconds)\n", - "Cbc0010I After 22339000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1663.55 seconds)\n", - "Cbc0010I After 22340000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1663.75 seconds)\n", - "Cbc0010I After 22341000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1663.92 seconds)\n", - "Cbc0010I After 22342000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1664.07 seconds)\n", - "Cbc0010I After 22343000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1664.27 seconds)\n", - "Cbc0010I After 22344000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1664.46 seconds)\n", - "Cbc0010I After 22345000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1664.63 seconds)\n", - "Cbc0010I After 22346000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1664.79 seconds)\n", - "Cbc0010I After 22347000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1664.95 seconds)\n", - "Cbc0010I After 22348000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1665.09 seconds)\n", - "Cbc0010I After 22349000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1665.28 seconds)\n", - "Cbc0010I After 22350000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1665.43 seconds)\n", - "Cbc0010I After 22351000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1665.60 seconds)\n", - "Cbc0010I After 22352000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1665.74 seconds)\n", - "Cbc0010I After 22353000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1665.86 seconds)\n", - "Cbc0010I After 22354000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1666.00 seconds)\n", - "Cbc0010I After 22355000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1666.14 seconds)\n", - "Cbc0010I After 22356000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1666.27 seconds)\n", - "Cbc0010I After 22357000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1666.38 seconds)\n", - "Cbc0010I After 22358000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1666.51 seconds)\n", - "Cbc0010I After 22359000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1666.68 seconds)\n", - "Cbc0010I After 22360000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1666.85 seconds)\n", - "Cbc0010I After 22361000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1667.13 seconds)\n", - "Cbc0010I After 22362000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1667.34 seconds)\n", - "Cbc0010I After 22363000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1667.61 seconds)\n", - "Cbc0010I After 22364000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1667.89 seconds)\n", - "Cbc0010I After 22365000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1668.13 seconds)\n", - "Cbc0010I After 22366000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1668.35 seconds)\n", - "Cbc0010I After 22367000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1668.59 seconds)\n", - "Cbc0010I After 22368000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1668.81 seconds)\n", - "Cbc0010I After 22369000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1669.04 seconds)\n", - "Cbc0010I After 22370000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1669.32 seconds)\n", - "Cbc0010I After 22371000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1669.48 seconds)\n", - "Cbc0010I After 22372000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1669.71 seconds)\n", - "Cbc0010I After 22373000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1669.89 seconds)\n", - "Cbc0010I After 22374000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1670.03 seconds)\n", - "Cbc0010I After 22375000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1670.18 seconds)\n", - "Cbc0010I After 22376000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1670.32 seconds)\n", - "Cbc0010I After 22377000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1670.48 seconds)\n", - "Cbc0010I After 22378000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1670.62 seconds)\n", - "Cbc0010I After 22379000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1670.72 seconds)\n", - "Cbc0010I After 22380000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1670.83 seconds)\n", - "Cbc0010I After 22381000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1670.94 seconds)\n", - "Cbc0010I After 22382000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1671.04 seconds)\n", - "Cbc0010I After 22383000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1671.13 seconds)\n", - "Cbc0010I After 22384000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1671.33 seconds)\n", - "Cbc0010I After 22385000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1671.48 seconds)\n", - "Cbc0010I After 22386000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1671.60 seconds)\n", - "Cbc0010I After 22387000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1671.73 seconds)\n", - "Cbc0010I After 22388000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1671.84 seconds)\n", - "Cbc0010I After 22389000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1671.97 seconds)\n", - "Cbc0010I After 22390000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1672.07 seconds)\n", - "Cbc0010I After 22391000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1672.20 seconds)\n", - "Cbc0010I After 22392000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1672.30 seconds)\n", - "Cbc0010I After 22393000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1672.46 seconds)\n", - "Cbc0010I After 22394000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1672.60 seconds)\n", - "Cbc0010I After 22395000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1672.73 seconds)\n", - "Cbc0010I After 22396000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1672.87 seconds)\n", - "Cbc0010I After 22397000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1672.99 seconds)\n", - "Cbc0010I After 22398000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1673.14 seconds)\n", - "Cbc0010I After 22399000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1673.29 seconds)\n", - "Cbc0010I After 22400000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1673.41 seconds)\n", - "Cbc0010I After 22401000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1673.54 seconds)\n", - "Cbc0010I After 22402000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1673.65 seconds)\n", - "Cbc0010I After 22403000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1673.78 seconds)\n", - "Cbc0010I After 22404000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1673.92 seconds)\n", - "Cbc0010I After 22405000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1674.03 seconds)\n", - "Cbc0010I After 22406000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1674.15 seconds)\n", - "Cbc0010I After 22407000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1674.26 seconds)\n", - "Cbc0010I After 22408000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1674.40 seconds)\n", - "Cbc0010I After 22409000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1674.52 seconds)\n", - "Cbc0010I After 22410000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1674.65 seconds)\n", - "Cbc0010I After 22411000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1674.84 seconds)\n", - "Cbc0010I After 22412000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1674.96 seconds)\n", - "Cbc0010I After 22413000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1675.10 seconds)\n", - "Cbc0010I After 22414000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1675.22 seconds)\n", - "Cbc0010I After 22415000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1675.33 seconds)\n", - "Cbc0010I After 22416000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1675.46 seconds)\n", - "Cbc0010I After 22417000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1675.59 seconds)\n", - "Cbc0010I After 22418000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1675.72 seconds)\n", - "Cbc0010I After 22419000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1675.85 seconds)\n", - "Cbc0010I After 22420000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1675.99 seconds)\n", - "Cbc0010I After 22421000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1676.12 seconds)\n", - "Cbc0010I After 22422000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1676.23 seconds)\n", - "Cbc0010I After 22423000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1676.36 seconds)\n", - "Cbc0010I After 22424000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1676.45 seconds)\n", - "Cbc0010I After 22425000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1676.54 seconds)\n", - "Cbc0010I After 22426000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1676.62 seconds)\n", - "Cbc0010I After 22427000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1676.70 seconds)\n", - "Cbc0010I After 22428000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1676.80 seconds)\n", - "Cbc0010I After 22429000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1676.87 seconds)\n", - "Cbc0010I After 22430000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1676.95 seconds)\n", - "Cbc0010I After 22431000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1677.01 seconds)\n", - "Cbc0010I After 22432000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1677.08 seconds)\n", - "Cbc0010I After 22433000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1677.14 seconds)\n", - "Cbc0010I After 22434000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1677.21 seconds)\n", - "Cbc0010I After 22435000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1677.27 seconds)\n", - "Cbc0010I After 22436000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1677.33 seconds)\n", - "Cbc0010I After 22437000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1677.40 seconds)\n", - "Cbc0010I After 22438000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1677.46 seconds)\n", - "Cbc0010I After 22439000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1677.52 seconds)\n", - "Cbc0010I After 22440000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1677.59 seconds)\n", - "Cbc0010I After 22441000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1677.66 seconds)\n", - "Cbc0010I After 22442000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1677.72 seconds)\n", - "Cbc0010I After 22443000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1677.78 seconds)\n", - "Cbc0010I After 22444000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1677.84 seconds)\n", - "Cbc0010I After 22445000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1677.89 seconds)\n", - "Cbc0010I After 22446000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1677.95 seconds)\n", - "Cbc0010I After 22447000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1678.01 seconds)\n", - "Cbc0010I After 22448000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1678.07 seconds)\n", - "Cbc0010I After 22449000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1678.15 seconds)\n", - "Cbc0010I After 22450000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1678.20 seconds)\n", - "Cbc0010I After 22451000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1678.28 seconds)\n", - "Cbc0010I After 22452000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1678.34 seconds)\n", - "Cbc0010I After 22453000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1678.40 seconds)\n", - "Cbc0010I After 22454000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1678.46 seconds)\n", - "Cbc0010I After 22455000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1678.53 seconds)\n", - "Cbc0010I After 22456000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1678.59 seconds)\n", - "Cbc0010I After 22457000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1678.65 seconds)\n", - "Cbc0010I After 22458000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1678.71 seconds)\n", - "Cbc0010I After 22459000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1678.77 seconds)\n", - "Cbc0010I After 22460000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1678.84 seconds)\n", - "Cbc0010I After 22461000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1678.90 seconds)\n", - "Cbc0010I After 22462000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1678.98 seconds)\n", - "Cbc0010I After 22463000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1679.05 seconds)\n", - "Cbc0010I After 22464000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1679.11 seconds)\n", - "Cbc0010I After 22465000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1679.19 seconds)\n", - "Cbc0010I After 22466000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1679.26 seconds)\n", - "Cbc0010I After 22467000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1679.33 seconds)\n", - "Cbc0010I After 22468000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1679.40 seconds)\n", - "Cbc0010I After 22469000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1679.46 seconds)\n", - "Cbc0010I After 22470000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1679.52 seconds)\n", - "Cbc0010I After 22471000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1679.58 seconds)\n", - "Cbc0010I After 22472000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1679.65 seconds)\n", - "Cbc0010I After 22473000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1679.70 seconds)\n", - "Cbc0010I After 22474000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1679.78 seconds)\n", - "Cbc0010I After 22475000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1679.85 seconds)\n", - "Cbc0010I After 22476000 nodes, 52 on tree, 1e+50 best solution, best possible 0 (1679.92 seconds)\n", - "Cbc0010I After 22477000 nodes, 39 on tree, 1e+50 best solution, best possible 0 (1679.98 seconds)\n", - "Cbc0010I After 22478000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1680.05 seconds)\n", - "Cbc0010I After 22479000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1680.12 seconds)\n", - "Cbc0010I After 22480000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1680.20 seconds)\n", - "Cbc0010I After 22481000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1680.27 seconds)\n", - "Cbc0010I After 22482000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1680.32 seconds)\n", - "Cbc0010I After 22483000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1680.38 seconds)\n", - "Cbc0010I After 22484000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1680.47 seconds)\n", - "Cbc0010I After 22485000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1680.55 seconds)\n", - "Cbc0010I After 22486000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1680.63 seconds)\n", - "Cbc0010I After 22487000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1680.70 seconds)\n", - "Cbc0010I After 22488000 nodes, 205 on tree, 1e+50 best solution, best possible 0 (1680.77 seconds)\n", - "Cbc0010I After 22489000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1680.84 seconds)\n", - "Cbc0010I After 22490000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (1680.91 seconds)\n", - "Cbc0010I After 22491000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1680.97 seconds)\n", - "Cbc0010I After 22492000 nodes, 188 on tree, 1e+50 best solution, best possible 0 (1681.03 seconds)\n", - "Cbc0010I After 22493000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1681.10 seconds)\n", - "Cbc0010I After 22494000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1681.18 seconds)\n", - "Cbc0010I After 22495000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1681.26 seconds)\n", - "Cbc0010I After 22496000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1681.40 seconds)\n", - "Cbc0010I After 22497000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1681.52 seconds)\n", - "Cbc0010I After 22498000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1681.63 seconds)\n", - "Cbc0010I After 22499000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1681.76 seconds)\n", - "Cbc0010I After 22500000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1681.89 seconds)\n", - "Cbc0010I After 22501000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1682.05 seconds)\n", - "Cbc0010I After 22502000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1682.18 seconds)\n", - "Cbc0010I After 22503000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1682.35 seconds)\n", - "Cbc0010I After 22504000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1682.46 seconds)\n", - "Cbc0010I After 22505000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1682.60 seconds)\n", - "Cbc0010I After 22506000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1682.73 seconds)\n", - "Cbc0010I After 22507000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1682.85 seconds)\n", - "Cbc0010I After 22508000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1682.97 seconds)\n", - "Cbc0010I After 22509000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1683.14 seconds)\n", - "Cbc0010I After 22510000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1683.30 seconds)\n", - "Cbc0010I After 22511000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1683.43 seconds)\n", - "Cbc0010I After 22512000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1683.55 seconds)\n", - "Cbc0010I After 22513000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1683.68 seconds)\n", - "Cbc0010I After 22514000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1683.79 seconds)\n", - "Cbc0010I After 22515000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1683.92 seconds)\n", - "Cbc0010I After 22516000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1684.07 seconds)\n", - "Cbc0010I After 22517000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1684.22 seconds)\n", - "Cbc0010I After 22518000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1684.37 seconds)\n", - "Cbc0010I After 22519000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1684.50 seconds)\n", - "Cbc0010I After 22520000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1684.71 seconds)\n", - "Cbc0010I After 22521000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1684.85 seconds)\n", - "Cbc0010I After 22522000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1685.01 seconds)\n", - "Cbc0010I After 22523000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1685.11 seconds)\n", - "Cbc0010I After 22524000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1685.20 seconds)\n", - "Cbc0010I After 22525000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1685.29 seconds)\n", - "Cbc0010I After 22526000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1685.35 seconds)\n", - "Cbc0010I After 22527000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1685.43 seconds)\n", - "Cbc0010I After 22528000 nodes, 173 on tree, 1e+50 best solution, best possible 0 (1685.51 seconds)\n", - "Cbc0010I After 22529000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1685.61 seconds)\n", - "Cbc0010I After 22530000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1685.71 seconds)\n", - "Cbc0010I After 22531000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1685.80 seconds)\n", - "Cbc0010I After 22532000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1685.89 seconds)\n", - "Cbc0010I After 22533000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1686.00 seconds)\n", - "Cbc0010I After 22534000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1686.11 seconds)\n", - "Cbc0010I After 22535000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1686.24 seconds)\n", - "Cbc0010I After 22536000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1686.37 seconds)\n", - "Cbc0010I After 22537000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1686.51 seconds)\n", - "Cbc0010I After 22538000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1686.62 seconds)\n", - "Cbc0010I After 22539000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1686.74 seconds)\n", - "Cbc0010I After 22540000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1686.90 seconds)\n", - "Cbc0010I After 22541000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1687.03 seconds)\n", - "Cbc0010I After 22542000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1687.18 seconds)\n", - "Cbc0010I After 22543000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1687.42 seconds)\n", - "Cbc0010I After 22544000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1687.58 seconds)\n", - "Cbc0010I After 22545000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1687.74 seconds)\n", - "Cbc0010I After 22546000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1687.88 seconds)\n", - "Cbc0010I After 22547000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1688.02 seconds)\n", - "Cbc0010I After 22548000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1688.16 seconds)\n", - "Cbc0010I After 22549000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1688.29 seconds)\n", - "Cbc0010I After 22550000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1688.42 seconds)\n", - "Cbc0010I After 22551000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1688.53 seconds)\n", - "Cbc0010I After 22552000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1688.64 seconds)\n", - "Cbc0010I After 22553000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1688.75 seconds)\n", - "Cbc0010I After 22554000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1688.88 seconds)\n", - "Cbc0010I After 22555000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1689.01 seconds)\n", - "Cbc0010I After 22556000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1689.15 seconds)\n", - "Cbc0010I After 22557000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1689.31 seconds)\n", - "Cbc0010I After 22558000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1689.55 seconds)\n", - "Cbc0010I After 22559000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1689.75 seconds)\n", - "Cbc0010I After 22560000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1689.96 seconds)\n", - "Cbc0010I After 22561000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1690.12 seconds)\n", - "Cbc0010I After 22562000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1690.27 seconds)\n", - "Cbc0010I After 22563000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1690.41 seconds)\n", - "Cbc0010I After 22564000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1690.53 seconds)\n", - "Cbc0010I After 22565000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1690.63 seconds)\n", - "Cbc0010I After 22566000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1690.75 seconds)\n", - "Cbc0010I After 22567000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1690.88 seconds)\n", - "Cbc0010I After 22568000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1691.02 seconds)\n", - "Cbc0010I After 22569000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1691.15 seconds)\n", - "Cbc0010I After 22570000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1691.29 seconds)\n", - "Cbc0010I After 22571000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1691.42 seconds)\n", - "Cbc0010I After 22572000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1691.54 seconds)\n", - "Cbc0010I After 22573000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1691.68 seconds)\n", - "Cbc0010I After 22574000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1691.82 seconds)\n", - "Cbc0010I After 22575000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1691.97 seconds)\n", - "Cbc0010I After 22576000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1692.16 seconds)\n", - "Cbc0010I After 22577000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1692.30 seconds)\n", - "Cbc0010I After 22578000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1692.41 seconds)\n", - "Cbc0010I After 22579000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1692.51 seconds)\n", - "Cbc0010I After 22580000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1692.60 seconds)\n", - "Cbc0010I After 22581000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1692.68 seconds)\n", - "Cbc0010I After 22582000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1692.76 seconds)\n", - "Cbc0010I After 22583000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1692.84 seconds)\n", - "Cbc0010I After 22584000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1692.91 seconds)\n", - "Cbc0010I After 22585000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1692.99 seconds)\n", - "Cbc0010I After 22586000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1693.06 seconds)\n", - "Cbc0010I After 22587000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1693.12 seconds)\n", - "Cbc0010I After 22588000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1693.19 seconds)\n", - "Cbc0010I After 22589000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1693.27 seconds)\n", - "Cbc0010I After 22590000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1693.34 seconds)\n", - "Cbc0010I After 22591000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1693.42 seconds)\n", - "Cbc0010I After 22592000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1693.50 seconds)\n", - "Cbc0010I After 22593000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1693.57 seconds)\n", - "Cbc0010I After 22594000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1693.63 seconds)\n", - "Cbc0010I After 22595000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1693.70 seconds)\n", - "Cbc0010I After 22596000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1693.77 seconds)\n", - "Cbc0010I After 22597000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1693.84 seconds)\n", - "Cbc0010I After 22598000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1693.92 seconds)\n", - "Cbc0010I After 22599000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1693.99 seconds)\n", - "Cbc0010I After 22600000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1694.08 seconds)\n", - "Cbc0010I After 22601000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1694.16 seconds)\n", - "Cbc0010I After 22602000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1694.22 seconds)\n", - "Cbc0010I After 22603000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1694.29 seconds)\n", - "Cbc0010I After 22604000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1694.35 seconds)\n", - "Cbc0010I After 22605000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1694.41 seconds)\n", - "Cbc0010I After 22606000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1694.47 seconds)\n", - "Cbc0010I After 22607000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1694.53 seconds)\n", - "Cbc0010I After 22608000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1694.59 seconds)\n", - "Cbc0010I After 22609000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1694.67 seconds)\n", - "Cbc0010I After 22610000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1694.74 seconds)\n", - "Cbc0010I After 22611000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1694.81 seconds)\n", - "Cbc0010I After 22612000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1694.89 seconds)\n", - "Cbc0010I After 22613000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1694.96 seconds)\n", - "Cbc0010I After 22614000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1695.04 seconds)\n", - "Cbc0010I After 22615000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1695.11 seconds)\n", - "Cbc0010I After 22616000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1695.19 seconds)\n", - "Cbc0010I After 22617000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1695.28 seconds)\n", - "Cbc0010I After 22618000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1695.36 seconds)\n", - "Cbc0010I After 22619000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1695.44 seconds)\n", - "Cbc0010I After 22620000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1695.51 seconds)\n", - "Cbc0010I After 22621000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1695.58 seconds)\n", - "Cbc0010I After 22622000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1695.65 seconds)\n", - "Cbc0010I After 22623000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1695.74 seconds)\n", - "Cbc0010I After 22624000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1695.84 seconds)\n", - "Cbc0010I After 22625000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1695.94 seconds)\n", - "Cbc0010I After 22626000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1696.06 seconds)\n", - "Cbc0010I After 22627000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1696.20 seconds)\n", - "Cbc0010I After 22628000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1696.34 seconds)\n", - "Cbc0010I After 22629000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1696.47 seconds)\n", - "Cbc0010I After 22630000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1696.63 seconds)\n", - "Cbc0010I After 22631000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1696.83 seconds)\n", - "Cbc0010I After 22632000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1697.11 seconds)\n", - "Cbc0010I After 22633000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1697.26 seconds)\n", - "Cbc0010I After 22634000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1697.43 seconds)\n", - "Cbc0010I After 22635000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1697.59 seconds)\n", - "Cbc0010I After 22636000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1697.74 seconds)\n", - "Cbc0010I After 22637000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1697.91 seconds)\n", - "Cbc0010I After 22638000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1698.07 seconds)\n", - "Cbc0010I After 22639000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1698.23 seconds)\n", - "Cbc0010I After 22640000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1698.35 seconds)\n", - "Cbc0010I After 22641000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1698.45 seconds)\n", - "Cbc0010I After 22642000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1698.57 seconds)\n", - "Cbc0010I After 22643000 nodes, 56 on tree, 1e+50 best solution, best possible 0 (1698.75 seconds)\n", - "Cbc0010I After 22644000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1698.92 seconds)\n", - "Cbc0010I After 22645000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1699.08 seconds)\n", - "Cbc0010I After 22646000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1699.23 seconds)\n", - "Cbc0010I After 22647000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1699.36 seconds)\n", - "Cbc0010I After 22648000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1699.48 seconds)\n", - "Cbc0010I After 22649000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1699.61 seconds)\n", - "Cbc0010I After 22650000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1699.73 seconds)\n", - "Cbc0010I After 22651000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1699.82 seconds)\n", - "Cbc0010I After 22652000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1699.91 seconds)\n", - "Cbc0010I After 22653000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1700.01 seconds)\n", - "Cbc0010I After 22654000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1700.09 seconds)\n", - "Cbc0010I After 22655000 nodes, 54 on tree, 1e+50 best solution, best possible 0 (1700.18 seconds)\n", - "Cbc0010I After 22656000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1700.27 seconds)\n", - "Cbc0010I After 22657000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1700.37 seconds)\n", - "Cbc0010I After 22658000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1700.48 seconds)\n", - "Cbc0010I After 22659000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1700.61 seconds)\n", - "Cbc0010I After 22660000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1700.73 seconds)\n", - "Cbc0010I After 22661000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1700.85 seconds)\n", - "Cbc0010I After 22662000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1700.95 seconds)\n", - "Cbc0010I After 22663000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1701.06 seconds)\n", - "Cbc0010I After 22664000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1701.13 seconds)\n", - "Cbc0010I After 22665000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1701.21 seconds)\n", - "Cbc0010I After 22666000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1701.28 seconds)\n", - "Cbc0010I After 22667000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1701.35 seconds)\n", - "Cbc0010I After 22668000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1701.42 seconds)\n", - "Cbc0010I After 22669000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1701.49 seconds)\n", - "Cbc0010I After 22670000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1701.58 seconds)\n", - "Cbc0010I After 22671000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1701.66 seconds)\n", - "Cbc0010I After 22672000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1701.73 seconds)\n", - "Cbc0010I After 22673000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1701.79 seconds)\n", - "Cbc0010I After 22674000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1701.85 seconds)\n", - "Cbc0010I After 22675000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1701.91 seconds)\n", - "Cbc0010I After 22676000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1701.97 seconds)\n", - "Cbc0010I After 22677000 nodes, 58 on tree, 1e+50 best solution, best possible 0 (1702.04 seconds)\n", - "Cbc0010I After 22678000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1702.10 seconds)\n", - "Cbc0010I After 22679000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1702.16 seconds)\n", - "Cbc0010I After 22680000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1702.22 seconds)\n", - "Cbc0010I After 22681000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1702.27 seconds)\n", - "Cbc0010I After 22682000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1702.34 seconds)\n", - "Cbc0010I After 22683000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1702.41 seconds)\n", - "Cbc0010I After 22684000 nodes, 44 on tree, 1e+50 best solution, best possible 0 (1702.47 seconds)\n", - "Cbc0010I After 22685000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1702.53 seconds)\n", - "Cbc0010I After 22686000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1702.59 seconds)\n", - "Cbc0010I After 22687000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1702.65 seconds)\n", - "Cbc0010I After 22688000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1702.70 seconds)\n", - "Cbc0010I After 22689000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1702.77 seconds)\n", - "Cbc0010I After 22690000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1702.83 seconds)\n", - "Cbc0010I After 22691000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1702.89 seconds)\n", - "Cbc0010I After 22692000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1702.95 seconds)\n", - "Cbc0010I After 22693000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1703.01 seconds)\n", - "Cbc0010I After 22694000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1703.07 seconds)\n", - "Cbc0010I After 22695000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1703.15 seconds)\n", - "Cbc0010I After 22696000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1703.22 seconds)\n", - "Cbc0010I After 22697000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1703.30 seconds)\n", - "Cbc0010I After 22698000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1703.38 seconds)\n", - "Cbc0010I After 22699000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1703.48 seconds)\n", - "Cbc0010I After 22700000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1703.59 seconds)\n", - "Cbc0010I After 22701000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1703.72 seconds)\n", - "Cbc0010I After 22702000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1703.84 seconds)\n", - "Cbc0010I After 22703000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1703.95 seconds)\n", - "Cbc0010I After 22704000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1704.14 seconds)\n", - "Cbc0010I After 22705000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1704.28 seconds)\n", - "Cbc0010I After 22706000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1704.42 seconds)\n", - "Cbc0010I After 22707000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1704.54 seconds)\n", - "Cbc0010I After 22708000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1704.63 seconds)\n", - "Cbc0010I After 22709000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1704.74 seconds)\n", - "Cbc0010I After 22710000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1704.84 seconds)\n", - "Cbc0010I After 22711000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1704.95 seconds)\n", - "Cbc0010I After 22712000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1705.06 seconds)\n", - "Cbc0010I After 22713000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1705.20 seconds)\n", - "Cbc0010I After 22714000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1705.33 seconds)\n", - "Cbc0010I After 22715000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1705.46 seconds)\n", - "Cbc0010I After 22716000 nodes, 43 on tree, 1e+50 best solution, best possible 0 (1705.56 seconds)\n", - "Cbc0010I After 22717000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1705.67 seconds)\n", - "Cbc0010I After 22718000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1705.83 seconds)\n", - "Cbc0010I After 22719000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1705.97 seconds)\n", - "Cbc0010I After 22720000 nodes, 63 on tree, 1e+50 best solution, best possible 0 (1706.11 seconds)\n", - "Cbc0010I After 22721000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1706.25 seconds)\n", - "Cbc0010I After 22722000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1706.37 seconds)\n", - "Cbc0010I After 22723000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1706.53 seconds)\n", - "Cbc0010I After 22724000 nodes, 195 on tree, 1e+50 best solution, best possible 0 (1706.61 seconds)\n", - "Cbc0010I After 22725000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1706.68 seconds)\n", - "Cbc0010I After 22726000 nodes, 187 on tree, 1e+50 best solution, best possible 0 (1706.77 seconds)\n", - "Cbc0010I After 22727000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1706.85 seconds)\n", - "Cbc0010I After 22728000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1706.95 seconds)\n", - "Cbc0010I After 22729000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1707.06 seconds)\n", - "Cbc0010I After 22730000 nodes, 184 on tree, 1e+50 best solution, best possible 0 (1707.16 seconds)\n", - "Cbc0010I After 22731000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1707.25 seconds)\n", - "Cbc0010I After 22732000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1707.34 seconds)\n", - "Cbc0010I After 22733000 nodes, 194 on tree, 1e+50 best solution, best possible 0 (1707.44 seconds)\n", - "Cbc0010I After 22734000 nodes, 176 on tree, 1e+50 best solution, best possible 0 (1707.56 seconds)\n", - "Cbc0010I After 22735000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1707.65 seconds)\n", - "Cbc0010I After 22736000 nodes, 185 on tree, 1e+50 best solution, best possible 0 (1707.72 seconds)\n", - "Cbc0010I After 22737000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1707.79 seconds)\n", - "Cbc0010I After 22738000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1707.86 seconds)\n", - "Cbc0010I After 22739000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1707.94 seconds)\n", - "Cbc0010I After 22740000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1708.04 seconds)\n", - "Cbc0010I After 22741000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1708.13 seconds)\n", - "Cbc0010I After 22742000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1708.23 seconds)\n", - "Cbc0010I After 22743000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1708.35 seconds)\n", - "Cbc0010I After 22744000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1708.45 seconds)\n", - "Cbc0010I After 22745000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1708.54 seconds)\n", - "Cbc0010I After 22746000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1708.64 seconds)\n", - "Cbc0010I After 22747000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1708.75 seconds)\n", - "Cbc0010I After 22748000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1708.87 seconds)\n", - "Cbc0010I After 22749000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1708.97 seconds)\n", - "Cbc0010I After 22750000 nodes, 193 on tree, 1e+50 best solution, best possible 0 (1709.06 seconds)\n", - "Cbc0010I After 22751000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1709.13 seconds)\n", - "Cbc0010I After 22752000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1709.20 seconds)\n", - "Cbc0010I After 22753000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.26 seconds)\n", - "Cbc0010I After 22754000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.33 seconds)\n", - "Cbc0010I After 22755000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1709.39 seconds)\n", - "Cbc0010I After 22756000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1709.46 seconds)\n", - "Cbc0010I After 22757000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.52 seconds)\n", - "Cbc0010I After 22758000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1709.60 seconds)\n", - "Cbc0010I After 22759000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1709.68 seconds)\n", - "Cbc0010I After 22760000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1709.76 seconds)\n", - "Cbc0010I After 22761000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1709.83 seconds)\n", - "Cbc0010I After 22762000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1709.90 seconds)\n", - "Cbc0010I After 22763000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1709.98 seconds)\n", - "Cbc0010I After 22764000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1710.06 seconds)\n", - "Cbc0010I After 22765000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1710.13 seconds)\n", - "Cbc0010I After 22766000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1710.21 seconds)\n", - "Cbc0010I After 22767000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1710.28 seconds)\n", - "Cbc0010I After 22768000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1710.35 seconds)\n", - "Cbc0010I After 22769000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1710.42 seconds)\n", - "Cbc0010I After 22770000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1710.49 seconds)\n", - "Cbc0010I After 22771000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1710.57 seconds)\n", - "Cbc0010I After 22772000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1710.64 seconds)\n", - "Cbc0010I After 22773000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1710.70 seconds)\n", - "Cbc0010I After 22774000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1710.78 seconds)\n", - "Cbc0010I After 22775000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1710.85 seconds)\n", - "Cbc0010I After 22776000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1710.93 seconds)\n", - "Cbc0010I After 22777000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1711.00 seconds)\n", - "Cbc0010I After 22778000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1711.07 seconds)\n", - "Cbc0010I After 22779000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1711.15 seconds)\n", - "Cbc0010I After 22780000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1711.25 seconds)\n", - "Cbc0010I After 22781000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1711.35 seconds)\n", - "Cbc0010I After 22782000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1711.54 seconds)\n", - "Cbc0010I After 22783000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1711.68 seconds)\n", - "Cbc0010I After 22784000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1711.81 seconds)\n", - "Cbc0010I After 22785000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1711.98 seconds)\n", - "Cbc0010I After 22786000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1712.11 seconds)\n", - "Cbc0010I After 22787000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1712.25 seconds)\n", - "Cbc0010I After 22788000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1712.38 seconds)\n", - "Cbc0010I After 22789000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1712.49 seconds)\n", - "Cbc0010I After 22790000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1712.61 seconds)\n", - "Cbc0010I After 22791000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1712.71 seconds)\n", - "Cbc0010I After 22792000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1712.85 seconds)\n", - "Cbc0010I After 22793000 nodes, 161 on tree, 1e+50 best solution, best possible 0 (1712.99 seconds)\n", - "Cbc0010I After 22794000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1713.13 seconds)\n", - "Cbc0010I After 22795000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1713.25 seconds)\n", - "Cbc0010I After 22796000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1713.38 seconds)\n", - "Cbc0010I After 22797000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1713.50 seconds)\n", - "Cbc0010I After 22798000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1713.66 seconds)\n", - "Cbc0010I After 22799000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1713.78 seconds)\n", - "Cbc0010I After 22800000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1713.89 seconds)\n", - "Cbc0010I After 22801000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1714.04 seconds)\n", - "Cbc0010I After 22802000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1714.18 seconds)\n", - "Cbc0010I After 22803000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1714.30 seconds)\n", - "Cbc0010I After 22804000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1714.42 seconds)\n", - "Cbc0010I After 22805000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1714.52 seconds)\n", - "Cbc0010I After 22806000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1714.61 seconds)\n", - "Cbc0010I After 22807000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1714.73 seconds)\n", - "Cbc0010I After 22808000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1714.83 seconds)\n", - "Cbc0010I After 22809000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1714.93 seconds)\n", - "Cbc0010I After 22810000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1715.03 seconds)\n", - "Cbc0010I After 22811000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1715.13 seconds)\n", - "Cbc0010I After 22812000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1715.23 seconds)\n", - "Cbc0010I After 22813000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1715.34 seconds)\n", - "Cbc0010I After 22814000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1715.43 seconds)\n", - "Cbc0010I After 22815000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1715.51 seconds)\n", - "Cbc0010I After 22816000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1715.59 seconds)\n", - "Cbc0010I After 22817000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1715.67 seconds)\n", - "Cbc0010I After 22818000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1715.76 seconds)\n", - "Cbc0010I After 22819000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1715.84 seconds)\n", - "Cbc0010I After 22820000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1715.91 seconds)\n", - "Cbc0010I After 22821000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1715.98 seconds)\n", - "Cbc0010I After 22822000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1716.04 seconds)\n", - "Cbc0010I After 22823000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1716.10 seconds)\n", - "Cbc0010I After 22824000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1716.18 seconds)\n", - "Cbc0010I After 22825000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1716.30 seconds)\n", - "Cbc0010I After 22826000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1716.40 seconds)\n", - "Cbc0010I After 22827000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1716.54 seconds)\n", - "Cbc0010I After 22828000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1716.80 seconds)\n", - "Cbc0010I After 22829000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1716.95 seconds)\n", - "Cbc0010I After 22830000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1717.08 seconds)\n", - "Cbc0010I After 22831000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1717.23 seconds)\n", - "Cbc0010I After 22832000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1717.36 seconds)\n", - "Cbc0010I After 22833000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1717.51 seconds)\n", - "Cbc0010I After 22834000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1717.63 seconds)\n", - "Cbc0010I After 22835000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1717.76 seconds)\n", - "Cbc0010I After 22836000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1717.89 seconds)\n", - "Cbc0010I After 22837000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1718.03 seconds)\n", - "Cbc0010I After 22838000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1718.16 seconds)\n", - "Cbc0010I After 22839000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1718.27 seconds)\n", - "Cbc0010I After 22840000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1718.42 seconds)\n", - "Cbc0010I After 22841000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1718.55 seconds)\n", - "Cbc0010I After 22842000 nodes, 85 on tree, 1e+50 best solution, best possible 0 (1718.69 seconds)\n", - "Cbc0010I After 22843000 nodes, 96 on tree, 1e+50 best solution, best possible 0 (1718.81 seconds)\n", - "Cbc0010I After 22844000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1718.92 seconds)\n", - "Cbc0010I After 22845000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1719.02 seconds)\n", - "Cbc0010I After 22846000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1719.13 seconds)\n", - "Cbc0010I After 22847000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1719.24 seconds)\n", - "Cbc0010I After 22848000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1719.34 seconds)\n", - "Cbc0010I After 22849000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1719.45 seconds)\n", - "Cbc0010I After 22850000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1719.62 seconds)\n", - "Cbc0010I After 22851000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1719.75 seconds)\n", - "Cbc0010I After 22852000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1719.88 seconds)\n", - "Cbc0010I After 22853000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1720.01 seconds)\n", - "Cbc0010I After 22854000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1720.16 seconds)\n", - "Cbc0010I After 22855000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1720.28 seconds)\n", - "Cbc0010I After 22856000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1720.39 seconds)\n", - "Cbc0010I After 22857000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1720.49 seconds)\n", - "Cbc0010I After 22858000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1720.59 seconds)\n", - "Cbc0010I After 22859000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1720.69 seconds)\n", - "Cbc0010I After 22860000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1720.79 seconds)\n", - "Cbc0010I After 22861000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1720.90 seconds)\n", - "Cbc0010I After 22862000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1720.99 seconds)\n", - "Cbc0010I After 22863000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1721.09 seconds)\n", - "Cbc0010I After 22864000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1721.21 seconds)\n", - "Cbc0010I After 22865000 nodes, 114 on tree, 1e+50 best solution, best possible 0 (1721.43 seconds)\n", - "Cbc0010I After 22866000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1721.55 seconds)\n", - "Cbc0010I After 22867000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1721.66 seconds)\n", - "Cbc0010I After 22868000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1721.74 seconds)\n", - "Cbc0010I After 22869000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1721.83 seconds)\n", - "Cbc0010I After 22870000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1721.91 seconds)\n", - "Cbc0010I After 22871000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1722.01 seconds)\n", - "Cbc0010I After 22872000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1722.12 seconds)\n", - "Cbc0010I After 22873000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1722.23 seconds)\n", - "Cbc0010I After 22874000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1722.32 seconds)\n", - "Cbc0010I After 22875000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1722.40 seconds)\n", - "Cbc0010I After 22876000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1722.47 seconds)\n", - "Cbc0010I After 22877000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1722.54 seconds)\n", - "Cbc0010I After 22878000 nodes, 86 on tree, 1e+50 best solution, best possible 0 (1722.60 seconds)\n", - "Cbc0010I After 22879000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1722.67 seconds)\n", - "Cbc0010I After 22880000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1722.74 seconds)\n", - "Cbc0010I After 22881000 nodes, 145 on tree, 1e+50 best solution, best possible 0 (1722.81 seconds)\n", - "Cbc0010I After 22882000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1722.89 seconds)\n", - "Cbc0010I After 22883000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1722.99 seconds)\n", - "Cbc0010I After 22884000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1723.12 seconds)\n", - "Cbc0010I After 22885000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1723.25 seconds)\n", - "Cbc0010I After 22886000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1723.41 seconds)\n", - "Cbc0010I After 22887000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1723.59 seconds)\n", - "Cbc0010I After 22888000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1723.71 seconds)\n", - "Cbc0010I After 22889000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1723.82 seconds)\n", - "Cbc0010I After 22890000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1723.91 seconds)\n", - "Cbc0010I After 22891000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1724.06 seconds)\n", - "Cbc0010I After 22892000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1724.18 seconds)\n", - "Cbc0010I After 22893000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1724.29 seconds)\n", - "Cbc0010I After 22894000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1724.42 seconds)\n", - "Cbc0010I After 22895000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1724.52 seconds)\n", - "Cbc0010I After 22896000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1724.63 seconds)\n", - "Cbc0010I After 22897000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1724.73 seconds)\n", - "Cbc0010I After 22898000 nodes, 50 on tree, 1e+50 best solution, best possible 0 (1724.81 seconds)\n", - "Cbc0010I After 22899000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1724.90 seconds)\n", - "Cbc0010I After 22900000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1724.97 seconds)\n", - "Cbc0010I After 22901000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1725.05 seconds)\n", - "Cbc0010I After 22902000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1725.14 seconds)\n", - "Cbc0010I After 22903000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1725.24 seconds)\n", - "Cbc0010I After 22904000 nodes, 55 on tree, 1e+50 best solution, best possible 0 (1725.34 seconds)\n", - "Cbc0010I After 22905000 nodes, 151 on tree, 1e+50 best solution, best possible 0 (1725.43 seconds)\n", - "Cbc0010I After 22906000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1725.53 seconds)\n", - "Cbc0010I After 22907000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1725.65 seconds)\n", - "Cbc0010I After 22908000 nodes, 49 on tree, 1e+50 best solution, best possible 0 (1725.74 seconds)\n", - "Cbc0010I After 22909000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1725.82 seconds)\n", - "Cbc0010I After 22910000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1725.93 seconds)\n", - "Cbc0010I After 22911000 nodes, 51 on tree, 1e+50 best solution, best possible 0 (1726.04 seconds)\n", - "Cbc0010I After 22912000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1726.12 seconds)\n", - "Cbc0010I After 22913000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1726.22 seconds)\n", - "Cbc0010I After 22914000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1726.30 seconds)\n", - "Cbc0010I After 22915000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1726.38 seconds)\n", - "Cbc0010I After 22916000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1726.46 seconds)\n", - "Cbc0010I After 22917000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1726.54 seconds)\n", - "Cbc0010I After 22918000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1726.62 seconds)\n", - "Cbc0010I After 22919000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1726.70 seconds)\n", - "Cbc0010I After 22920000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1726.76 seconds)\n", - "Cbc0010I After 22921000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1726.82 seconds)\n", - "Cbc0010I After 22922000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1726.90 seconds)\n", - "Cbc0010I After 22923000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1726.97 seconds)\n", - "Cbc0010I After 22924000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1727.04 seconds)\n", - "Cbc0010I After 22925000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1727.13 seconds)\n", - "Cbc0010I After 22926000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1727.20 seconds)\n", - "Cbc0010I After 22927000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1727.26 seconds)\n", - "Cbc0010I After 22928000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1727.32 seconds)\n", - "Cbc0010I After 22929000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1727.38 seconds)\n", - "Cbc0010I After 22930000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1727.44 seconds)\n", - "Cbc0010I After 22931000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1727.50 seconds)\n", - "Cbc0010I After 22932000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1727.59 seconds)\n", - "Cbc0010I After 22933000 nodes, 46 on tree, 1e+50 best solution, best possible 0 (1727.66 seconds)\n", - "Cbc0010I After 22934000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1727.72 seconds)\n", - "Cbc0010I After 22935000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1727.78 seconds)\n", - "Cbc0010I After 22936000 nodes, 97 on tree, 1e+50 best solution, best possible 0 (1727.85 seconds)\n", - "Cbc0010I After 22937000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (1727.91 seconds)\n", - "Cbc0010I After 22938000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1727.97 seconds)\n", - "Cbc0010I After 22939000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1728.02 seconds)\n", - "Cbc0010I After 22940000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1728.08 seconds)\n", - "Cbc0010I After 22941000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1728.14 seconds)\n", - "Cbc0010I After 22942000 nodes, 57 on tree, 1e+50 best solution, best possible 0 (1728.20 seconds)\n", - "Cbc0010I After 22943000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1728.26 seconds)\n", - "Cbc0010I After 22944000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1728.32 seconds)\n", - "Cbc0010I After 22945000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1728.39 seconds)\n", - "Cbc0010I After 22946000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1728.46 seconds)\n", - "Cbc0010I After 22947000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1728.54 seconds)\n", - "Cbc0010I After 22948000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1728.64 seconds)\n", - "Cbc0010I After 22949000 nodes, 200 on tree, 1e+50 best solution, best possible 0 (1728.74 seconds)\n", - "Cbc0010I After 22950000 nodes, 201 on tree, 1e+50 best solution, best possible 0 (1728.85 seconds)\n", - "Cbc0010I After 22951000 nodes, 192 on tree, 1e+50 best solution, best possible 0 (1728.96 seconds)\n", - "Cbc0010I After 22952000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1729.06 seconds)\n", - "Cbc0010I After 22953000 nodes, 181 on tree, 1e+50 best solution, best possible 0 (1729.18 seconds)\n", - "Cbc0010I After 22954000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (1729.29 seconds)\n", - "Cbc0010I After 22955000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1729.46 seconds)\n", - "Cbc0010I After 22956000 nodes, 168 on tree, 1e+50 best solution, best possible 0 (1729.60 seconds)\n", - "Cbc0010I After 22957000 nodes, 171 on tree, 1e+50 best solution, best possible 0 (1729.71 seconds)\n", - "Cbc0010I After 22958000 nodes, 167 on tree, 1e+50 best solution, best possible 0 (1729.81 seconds)\n", - "Cbc0010I After 22959000 nodes, 180 on tree, 1e+50 best solution, best possible 0 (1729.89 seconds)\n", - "Cbc0010I After 22960000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (1729.98 seconds)\n", - "Cbc0010I After 22961000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1730.05 seconds)\n", - "Cbc0010I After 22962000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1730.11 seconds)\n", - "Cbc0010I After 22963000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1730.17 seconds)\n", - "Cbc0010I After 22964000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1730.23 seconds)\n", - "Cbc0010I After 22965000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1730.29 seconds)\n", - "Cbc0010I After 22966000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1730.37 seconds)\n", - "Cbc0010I After 22967000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1730.44 seconds)\n", - "Cbc0010I After 22968000 nodes, 148 on tree, 1e+50 best solution, best possible 0 (1730.51 seconds)\n", - "Cbc0010I After 22969000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1730.57 seconds)\n", - "Cbc0010I After 22970000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1730.63 seconds)\n", - "Cbc0010I After 22971000 nodes, 163 on tree, 1e+50 best solution, best possible 0 (1730.70 seconds)\n", - "Cbc0010I After 22972000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1730.77 seconds)\n", - "Cbc0010I After 22973000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1730.83 seconds)\n", - "Cbc0010I After 22974000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1730.91 seconds)\n", - "Cbc0010I After 22975000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1730.99 seconds)\n", - "Cbc0010I After 22976000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1731.05 seconds)\n", - "Cbc0010I After 22977000 nodes, 146 on tree, 1e+50 best solution, best possible 0 (1731.12 seconds)\n", - "Cbc0010I After 22978000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1731.22 seconds)\n", - "Cbc0010I After 22979000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1731.29 seconds)\n", - "Cbc0010I After 22980000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1731.35 seconds)\n", - "Cbc0010I After 22981000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1731.44 seconds)\n", - "Cbc0010I After 22982000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1731.54 seconds)\n", - "Cbc0010I After 22983000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1731.65 seconds)\n", - "Cbc0010I After 22984000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1731.74 seconds)\n", - "Cbc0010I After 22985000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1731.86 seconds)\n", - "Cbc0010I After 22986000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1732.00 seconds)\n", - "Cbc0010I After 22987000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1732.14 seconds)\n", - "Cbc0010I After 22988000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1732.29 seconds)\n", - "Cbc0010I After 22989000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1732.45 seconds)\n", - "Cbc0010I After 22990000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1732.71 seconds)\n", - "Cbc0010I After 22991000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1732.93 seconds)\n", - "Cbc0010I After 22992000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1733.07 seconds)\n", - "Cbc0010I After 22993000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1733.21 seconds)\n", - "Cbc0010I After 22994000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1733.34 seconds)\n", - "Cbc0010I After 22995000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1733.46 seconds)\n", - "Cbc0010I After 22996000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1733.59 seconds)\n", - "Cbc0010I After 22997000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1733.69 seconds)\n", - "Cbc0010I After 22998000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1733.76 seconds)\n", - "Cbc0010I After 22999000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1733.85 seconds)\n", - "Cbc0010I After 23000000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1733.93 seconds)\n", - "Cbc0010I After 23001000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.01 seconds)\n", - "Cbc0010I After 23002000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1734.09 seconds)\n", - "Cbc0010I After 23003000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1734.16 seconds)\n", - "Cbc0010I After 23004000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.23 seconds)\n", - "Cbc0010I After 23005000 nodes, 133 on tree, 1e+50 best solution, best possible 0 (1734.32 seconds)\n", - "Cbc0010I After 23006000 nodes, 110 on tree, 1e+50 best solution, best possible 0 (1734.39 seconds)\n", - "Cbc0010I After 23007000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1734.46 seconds)\n", - "Cbc0010I After 23008000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1734.53 seconds)\n", - "Cbc0010I After 23009000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (1734.60 seconds)\n", - "Cbc0010I After 23010000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1734.66 seconds)\n", - "Cbc0010I After 23011000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1734.73 seconds)\n", - "Cbc0010I After 23012000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1734.80 seconds)\n", - "Cbc0010I After 23013000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1734.86 seconds)\n", - "Cbc0010I After 23014000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1734.95 seconds)\n", - "Cbc0010I After 23015000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1735.04 seconds)\n", - "Cbc0010I After 23016000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1735.12 seconds)\n", - "Cbc0010I After 23017000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1735.22 seconds)\n", - "Cbc0010I After 23018000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1735.32 seconds)\n", - "Cbc0010I After 23019000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1735.46 seconds)\n", - "Cbc0010I After 23020000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1735.60 seconds)\n", - "Cbc0010I After 23021000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1735.74 seconds)\n", - "Cbc0010I After 23022000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1735.87 seconds)\n", - "Cbc0010I After 23023000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1736.00 seconds)\n", - "Cbc0010I After 23024000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1736.13 seconds)\n", - "Cbc0010I After 23025000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1736.23 seconds)\n", - "Cbc0010I After 23026000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1736.35 seconds)\n", - "Cbc0010I After 23027000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1736.48 seconds)\n", - "Cbc0010I After 23028000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1736.63 seconds)\n", - "Cbc0010I After 23029000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1736.76 seconds)\n", - "Cbc0010I After 23030000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1736.89 seconds)\n", - "Cbc0010I After 23031000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1737.02 seconds)\n", - "Cbc0010I After 23032000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1737.17 seconds)\n", - "Cbc0010I After 23033000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1737.33 seconds)\n", - "Cbc0010I After 23034000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1737.43 seconds)\n", - "Cbc0010I After 23035000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1737.53 seconds)\n", - "Cbc0010I After 23036000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1737.63 seconds)\n", - "Cbc0010I After 23037000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (1737.73 seconds)\n", - "Cbc0010I After 23038000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1737.85 seconds)\n", - "Cbc0010I After 23039000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1737.95 seconds)\n", - "Cbc0010I After 23040000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1738.03 seconds)\n", - "Cbc0010I After 23041000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1738.18 seconds)\n", - "Cbc0010I After 23042000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1738.36 seconds)\n", - "Cbc0010I After 23043000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1738.49 seconds)\n", - "Cbc0010I After 23044000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1738.61 seconds)\n", - "Cbc0010I After 23045000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1738.74 seconds)\n", - "Cbc0010I After 23046000 nodes, 126 on tree, 1e+50 best solution, best possible 0 (1738.86 seconds)\n", - "Cbc0010I After 23047000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1738.98 seconds)\n", - "Cbc0010I After 23048000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1739.09 seconds)\n", - "Cbc0010I After 23049000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1739.21 seconds)\n", - "Cbc0010I After 23050000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1739.31 seconds)\n", - "Cbc0010I After 23051000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1739.41 seconds)\n", - "Cbc0010I After 23052000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1739.53 seconds)\n", - "Cbc0010I After 23053000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1739.66 seconds)\n", - "Cbc0010I After 23054000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1739.78 seconds)\n", - "Cbc0010I After 23055000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1739.91 seconds)\n", - "Cbc0010I After 23056000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1740.03 seconds)\n", - "Cbc0010I After 23057000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1740.15 seconds)\n", - "Cbc0010I After 23058000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1740.24 seconds)\n", - "Cbc0010I After 23059000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1740.33 seconds)\n", - "Cbc0010I After 23060000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1740.42 seconds)\n", - "Cbc0010I After 23061000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1740.49 seconds)\n", - "Cbc0010I After 23062000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1740.56 seconds)\n", - "Cbc0010I After 23063000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (1740.65 seconds)\n", - "Cbc0010I After 23064000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1740.74 seconds)\n", - "Cbc0010I After 23065000 nodes, 128 on tree, 1e+50 best solution, best possible 0 (1740.82 seconds)\n", - "Cbc0010I After 23066000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1740.92 seconds)\n", - "Cbc0010I After 23067000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1741.03 seconds)\n", - "Cbc0010I After 23068000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1741.18 seconds)\n", - "Cbc0010I After 23069000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1741.32 seconds)\n", - "Cbc0010I After 23070000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1741.47 seconds)\n", - "Cbc0010I After 23071000 nodes, 107 on tree, 1e+50 best solution, best possible 0 (1741.63 seconds)\n", - "Cbc0010I After 23072000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1741.79 seconds)\n", - "Cbc0010I After 23073000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1741.97 seconds)\n", - "Cbc0010I After 23074000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1742.13 seconds)\n", - "Cbc0010I After 23075000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1742.34 seconds)\n", - "Cbc0010I After 23076000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1742.56 seconds)\n", - "Cbc0010I After 23077000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1742.76 seconds)\n", - "Cbc0010I After 23078000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1742.97 seconds)\n", - "Cbc0010I After 23079000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1743.14 seconds)\n", - "Cbc0010I After 23080000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1743.30 seconds)\n", - "Cbc0010I After 23081000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1743.41 seconds)\n", - "Cbc0010I After 23082000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1743.51 seconds)\n", - "Cbc0010I After 23083000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1743.63 seconds)\n", - "Cbc0010I After 23084000 nodes, 101 on tree, 1e+50 best solution, best possible 0 (1743.73 seconds)\n", - "Cbc0010I After 23085000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1743.82 seconds)\n", - "Cbc0010I After 23086000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1743.90 seconds)\n", - "Cbc0010I After 23087000 nodes, 99 on tree, 1e+50 best solution, best possible 0 (1743.97 seconds)\n", - "Cbc0010I After 23088000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1744.05 seconds)\n", - "Cbc0010I After 23089000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1744.12 seconds)\n", - "Cbc0010I After 23090000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1744.20 seconds)\n", - "Cbc0010I After 23091000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1744.29 seconds)\n", - "Cbc0010I After 23092000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1744.38 seconds)\n", - "Cbc0010I After 23093000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1744.49 seconds)\n", - "Cbc0010I After 23094000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1744.60 seconds)\n", - "Cbc0010I After 23095000 nodes, 71 on tree, 1e+50 best solution, best possible 0 (1744.70 seconds)\n", - "Cbc0010I After 23096000 nodes, 91 on tree, 1e+50 best solution, best possible 0 (1744.80 seconds)\n", - "Cbc0010I After 23097000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1744.87 seconds)\n", - "Cbc0010I After 23098000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1744.94 seconds)\n", - "Cbc0010I After 23099000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1745.00 seconds)\n", - "Cbc0010I After 23100000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1745.08 seconds)\n", - "Cbc0010I After 23101000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1745.15 seconds)\n", - "Cbc0010I After 23102000 nodes, 125 on tree, 1e+50 best solution, best possible 0 (1745.26 seconds)\n", - "Cbc0010I After 23103000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1745.35 seconds)\n", - "Cbc0010I After 23104000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1745.43 seconds)\n", - "Cbc0010I After 23105000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1745.52 seconds)\n", - "Cbc0010I After 23106000 nodes, 84 on tree, 1e+50 best solution, best possible 0 (1745.60 seconds)\n", - "Cbc0010I After 23107000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1745.67 seconds)\n", - "Cbc0010I After 23108000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1745.75 seconds)\n", - "Cbc0010I After 23109000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (1745.82 seconds)\n", - "Cbc0010I After 23110000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1745.89 seconds)\n", - "Cbc0010I After 23111000 nodes, 115 on tree, 1e+50 best solution, best possible 0 (1745.98 seconds)\n", - "Cbc0010I After 23112000 nodes, 94 on tree, 1e+50 best solution, best possible 0 (1746.08 seconds)\n", - "Cbc0010I After 23113000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1746.16 seconds)\n", - "Cbc0010I After 23114000 nodes, 129 on tree, 1e+50 best solution, best possible 0 (1746.28 seconds)\n", - "Cbc0010I After 23115000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1746.42 seconds)\n", - "Cbc0010I After 23116000 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1746.54 seconds)\n", - "Cbc0010I After 23117000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1746.65 seconds)\n", - "Cbc0010I After 23118000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1746.75 seconds)\n", - "Cbc0010I After 23119000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1746.88 seconds)\n", - "Cbc0010I After 23120000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1746.97 seconds)\n", - "Cbc0010I After 23121000 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1747.06 seconds)\n", - "Cbc0010I After 23122000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1747.17 seconds)\n", - "Cbc0010I After 23123000 nodes, 92 on tree, 1e+50 best solution, best possible 0 (1747.30 seconds)\n", - "Cbc0010I After 23124000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1747.43 seconds)\n", - "Cbc0010I After 23125000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1747.55 seconds)\n", - "Cbc0010I After 23126000 nodes, 104 on tree, 1e+50 best solution, best possible 0 (1747.68 seconds)\n", - "Cbc0010I After 23127000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1747.79 seconds)\n", - "Cbc0010I After 23128000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1747.88 seconds)\n", - "Cbc0010I After 23129000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1747.97 seconds)\n", - "Cbc0010I After 23130000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1748.05 seconds)\n", - "Cbc0010I After 23131000 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1748.13 seconds)\n", - "Cbc0010I After 23132000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1748.20 seconds)\n", - "Cbc0010I After 23133000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1748.28 seconds)\n", - "Cbc0010I After 23134000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1748.38 seconds)\n", - "Cbc0010I After 23135000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1748.49 seconds)\n", - "Cbc0010I After 23136000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1748.58 seconds)\n", - "Cbc0010I After 23137000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1748.67 seconds)\n", - "Cbc0010I After 23138000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (1748.79 seconds)\n", - "Cbc0010I After 23139000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1748.93 seconds)\n", - "Cbc0010I After 23140000 nodes, 42 on tree, 1e+50 best solution, best possible 0 (1749.06 seconds)\n", - "Cbc0010I After 23141000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1749.19 seconds)\n", - "Cbc0010I After 23142000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1749.30 seconds)\n", - "Cbc0010I After 23143000 nodes, 53 on tree, 1e+50 best solution, best possible 0 (1749.40 seconds)\n", - "Cbc0010I After 23144000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (1749.50 seconds)\n", - "Cbc0010I After 23145000 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1749.58 seconds)\n", - "Cbc0010I After 23146000 nodes, 80 on tree, 1e+50 best solution, best possible 0 (1749.68 seconds)\n", - "Cbc0010I After 23147000 nodes, 72 on tree, 1e+50 best solution, best possible 0 (1749.78 seconds)\n", - "Cbc0010I After 23148000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1749.88 seconds)\n", - "Cbc0010I After 23149000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1749.98 seconds)\n", - "Cbc0010I After 23150000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1750.06 seconds)\n", - "Cbc0010I After 23151000 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1750.15 seconds)\n", - "Cbc0010I After 23152000 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1750.22 seconds)\n", - "Cbc0010I After 23153000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1750.28 seconds)\n", - "Cbc0010I After 23154000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1750.36 seconds)\n", - "Cbc0010I After 23155000 nodes, 82 on tree, 1e+50 best solution, best possible 0 (1750.43 seconds)\n", - "Cbc0010I After 23156000 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1750.52 seconds)\n", - "Cbc0010I After 23157000 nodes, 73 on tree, 1e+50 best solution, best possible 0 (1750.62 seconds)\n", - "Cbc0010I After 23158000 nodes, 79 on tree, 1e+50 best solution, best possible 0 (1750.70 seconds)\n", - "Cbc0010I After 23159000 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1750.78 seconds)\n", - "Cbc0010I After 23160000 nodes, 45 on tree, 1e+50 best solution, best possible 0 (1750.85 seconds)\n", - "Cbc0010I After 23161000 nodes, 40 on tree, 1e+50 best solution, best possible 0 (1750.93 seconds)\n", - "Cbc0010I After 23162000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1751.00 seconds)\n", - "Cbc0010I After 23163000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1751.07 seconds)\n", - "Cbc0010I After 23164000 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1751.14 seconds)\n", - "Cbc0010I After 23165000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1751.20 seconds)\n", - "Cbc0010I After 23166000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1751.29 seconds)\n", - "Cbc0010I After 23167000 nodes, 88 on tree, 1e+50 best solution, best possible 0 (1751.37 seconds)\n", - "Cbc0010I After 23168000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1751.49 seconds)\n", - "Cbc0010I After 23169000 nodes, 48 on tree, 1e+50 best solution, best possible 0 (1751.62 seconds)\n", - "Cbc0010I After 23170000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (1751.76 seconds)\n", - "Cbc0010I After 23171000 nodes, 41 on tree, 1e+50 best solution, best possible 0 (1751.90 seconds)\n", - "Cbc0010I After 23172000 nodes, 118 on tree, 1e+50 best solution, best possible 0 (1752.03 seconds)\n", - "Cbc0010I After 23173000 nodes, 83 on tree, 1e+50 best solution, best possible 0 (1752.14 seconds)\n", - "Cbc0010I After 23174000 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1752.25 seconds)\n", - "Cbc0010I After 23175000 nodes, 37 on tree, 1e+50 best solution, best possible 0 (1752.35 seconds)\n", - "Cbc0010I After 23176000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1752.47 seconds)\n", - "Cbc0010I After 23177000 nodes, 197 on tree, 1e+50 best solution, best possible 0 (1752.58 seconds)\n", - "Cbc0010I After 23178000 nodes, 190 on tree, 1e+50 best solution, best possible 0 (1752.67 seconds)\n", - "Cbc0010I After 23179000 nodes, 191 on tree, 1e+50 best solution, best possible 0 (1752.78 seconds)\n", - "Cbc0010I After 23180000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1752.87 seconds)\n", - "Cbc0010I After 23181000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1752.95 seconds)\n", - "Cbc0010I After 23182000 nodes, 189 on tree, 1e+50 best solution, best possible 0 (1753.04 seconds)\n", - "Cbc0010I After 23183000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1753.11 seconds)\n", - "Cbc0010I After 23184000 nodes, 170 on tree, 1e+50 best solution, best possible 0 (1753.21 seconds)\n", - "Cbc0010I After 23185000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1753.28 seconds)\n", - "Cbc0010I After 23186000 nodes, 174 on tree, 1e+50 best solution, best possible 0 (1753.35 seconds)\n", - "Cbc0010I After 23187000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1753.42 seconds)\n", - "Cbc0010I After 23188000 nodes, 177 on tree, 1e+50 best solution, best possible 0 (1753.50 seconds)\n", - "Cbc0010I After 23189000 nodes, 154 on tree, 1e+50 best solution, best possible 0 (1753.58 seconds)\n", - "Cbc0010I After 23190000 nodes, 179 on tree, 1e+50 best solution, best possible 0 (1753.65 seconds)\n", - "Cbc0010I After 23191000 nodes, 164 on tree, 1e+50 best solution, best possible 0 (1753.73 seconds)\n", - "Cbc0010I After 23192000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (1753.80 seconds)\n", - "Cbc0010I After 23193000 nodes, 149 on tree, 1e+50 best solution, best possible 0 (1753.86 seconds)\n", - "Cbc0010I After 23194000 nodes, 143 on tree, 1e+50 best solution, best possible 0 (1753.93 seconds)\n", - "Cbc0010I After 23195000 nodes, 150 on tree, 1e+50 best solution, best possible 0 (1754.00 seconds)\n", - "Cbc0010I After 23196000 nodes, 178 on tree, 1e+50 best solution, best possible 0 (1754.07 seconds)\n", - "Cbc0010I After 23197000 nodes, 172 on tree, 1e+50 best solution, best possible 0 (1754.15 seconds)\n", - "Cbc0010I After 23198000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1754.24 seconds)\n", - "Cbc0010I After 23199000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1754.41 seconds)\n", - "Cbc0010I After 23200000 nodes, 152 on tree, 1e+50 best solution, best possible 0 (1754.57 seconds)\n", - "Cbc0010I After 23201000 nodes, 147 on tree, 1e+50 best solution, best possible 0 (1754.69 seconds)\n", - "Cbc0010I After 23202000 nodes, 159 on tree, 1e+50 best solution, best possible 0 (1754.80 seconds)\n", - "Cbc0010I After 23203000 nodes, 169 on tree, 1e+50 best solution, best possible 0 (1754.90 seconds)\n", - "Cbc0010I After 23204000 nodes, 158 on tree, 1e+50 best solution, best possible 0 (1754.98 seconds)\n", - "Cbc0010I After 23205000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1755.08 seconds)\n", - "Cbc0010I After 23206000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1755.16 seconds)\n", - "Cbc0010I After 23207000 nodes, 162 on tree, 1e+50 best solution, best possible 0 (1755.23 seconds)\n", - "Cbc0010I After 23208000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1755.31 seconds)\n", - "Cbc0010I After 23209000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1755.40 seconds)\n", - "Cbc0010I After 23210000 nodes, 183 on tree, 1e+50 best solution, best possible 0 (1755.49 seconds)\n", - "Cbc0010I After 23211000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1755.60 seconds)\n", - "Cbc0010I After 23212000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1755.68 seconds)\n", - "Cbc0010I After 23213000 nodes, 175 on tree, 1e+50 best solution, best possible 0 (1755.76 seconds)\n", - "Cbc0010I After 23214000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1755.83 seconds)\n", - "Cbc0010I After 23215000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1755.89 seconds)\n", - "Cbc0010I After 23216000 nodes, 160 on tree, 1e+50 best solution, best possible 0 (1755.95 seconds)\n", - "Cbc0010I After 23217000 nodes, 122 on tree, 1e+50 best solution, best possible 0 (1756.01 seconds)\n", - "Cbc0010I After 23218000 nodes, 135 on tree, 1e+50 best solution, best possible 0 (1756.07 seconds)\n", - "Cbc0010I After 23219000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1756.12 seconds)\n", - "Cbc0010I After 23220000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1756.19 seconds)\n", - "Cbc0010I After 23221000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.26 seconds)\n", - "Cbc0010I After 23222000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1756.33 seconds)\n", - "Cbc0010I After 23223000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1756.39 seconds)\n", - "Cbc0010I After 23224000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.44 seconds)\n", - "Cbc0010I After 23225000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1756.50 seconds)\n", - "Cbc0010I After 23226000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1756.56 seconds)\n", - "Cbc0010I After 23227000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1756.61 seconds)\n", - "Cbc0010I After 23228000 nodes, 156 on tree, 1e+50 best solution, best possible 0 (1756.67 seconds)\n", - "Cbc0010I After 23229000 nodes, 121 on tree, 1e+50 best solution, best possible 0 (1756.73 seconds)\n", - "Cbc0010I After 23230000 nodes, 119 on tree, 1e+50 best solution, best possible 0 (1756.81 seconds)\n", - "Cbc0010I After 23231000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1756.89 seconds)\n", - "Cbc0010I After 23232000 nodes, 112 on tree, 1e+50 best solution, best possible 0 (1756.98 seconds)\n", - "Cbc0010I After 23233000 nodes, 132 on tree, 1e+50 best solution, best possible 0 (1757.06 seconds)\n", - "Cbc0010I After 23234000 nodes, 157 on tree, 1e+50 best solution, best possible 0 (1757.14 seconds)\n", - "Cbc0010I After 23235000 nodes, 116 on tree, 1e+50 best solution, best possible 0 (1757.21 seconds)\n", - "Cbc0010I After 23236000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1757.28 seconds)\n", - "Cbc0010I After 23237000 nodes, 117 on tree, 1e+50 best solution, best possible 0 (1757.36 seconds)\n", - "Cbc0010I After 23238000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1757.44 seconds)\n", - "Cbc0010I After 23239000 nodes, 124 on tree, 1e+50 best solution, best possible 0 (1757.54 seconds)\n", - "Cbc0010I After 23240000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1757.62 seconds)\n", - "Cbc0010I After 23241000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1757.71 seconds)\n", - "Cbc0010I After 23242000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (1757.79 seconds)\n", - "Cbc0010I After 23243000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1757.85 seconds)\n", - "Cbc0010I After 23244000 nodes, 138 on tree, 1e+50 best solution, best possible 0 (1757.93 seconds)\n", - "Cbc0010I After 23245000 nodes, 123 on tree, 1e+50 best solution, best possible 0 (1758.01 seconds)\n", - "Cbc0010I After 23246000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1758.08 seconds)\n", - "Cbc0010I After 23247000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.16 seconds)\n", - "Cbc0010I After 23248000 nodes, 140 on tree, 1e+50 best solution, best possible 0 (1758.23 seconds)\n", - "Cbc0010I After 23249000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.31 seconds)\n", - "Cbc0010I After 23250000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.38 seconds)\n", - "Cbc0010I After 23251000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1758.46 seconds)\n", - "Cbc0010I After 23252000 nodes, 95 on tree, 1e+50 best solution, best possible 0 (1758.55 seconds)\n", - "Cbc0010I After 23253000 nodes, 127 on tree, 1e+50 best solution, best possible 0 (1758.62 seconds)\n", - "Cbc0010I After 23254000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1758.70 seconds)\n", - "Cbc0010I After 23255000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (1758.77 seconds)\n", - "Cbc0010I After 23256000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1758.83 seconds)\n", - "Cbc0010I After 23257000 nodes, 141 on tree, 1e+50 best solution, best possible 0 (1758.90 seconds)\n", - "Cbc0010I After 23258000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1758.97 seconds)\n", - "Cbc0010I After 23259000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1759.06 seconds)\n", - "Cbc0010I After 23260000 nodes, 113 on tree, 1e+50 best solution, best possible 0 (1759.14 seconds)\n", - "Cbc0010I After 23261000 nodes, 108 on tree, 1e+50 best solution, best possible 0 (1759.21 seconds)\n", - "Cbc0010I After 23262000 nodes, 89 on tree, 1e+50 best solution, best possible 0 (1759.28 seconds)\n", - "Cbc0010I After 23263000 nodes, 130 on tree, 1e+50 best solution, best possible 0 (1759.35 seconds)\n", - "Cbc0010I After 23264000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1759.43 seconds)\n", - "Cbc0010I After 23265000 nodes, 136 on tree, 1e+50 best solution, best possible 0 (1759.50 seconds)\n", - "Cbc0010I After 23266000 nodes, 103 on tree, 1e+50 best solution, best possible 0 (1759.58 seconds)\n", - "Cbc0010I After 23267000 nodes, 102 on tree, 1e+50 best solution, best possible 0 (1759.66 seconds)\n", - "Cbc0010I After 23268000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1759.73 seconds)\n", - "Cbc0010I After 23269000 nodes, 106 on tree, 1e+50 best solution, best possible 0 (1759.81 seconds)\n", - "Cbc0010I After 23270000 nodes, 134 on tree, 1e+50 best solution, best possible 0 (1759.89 seconds)\n", - "Cbc0010I After 23271000 nodes, 100 on tree, 1e+50 best solution, best possible 0 (1759.96 seconds)\n", - "Cbc0010I After 23272000 nodes, 109 on tree, 1e+50 best solution, best possible 0 (1760.04 seconds)\n", - "Cbc0010I After 23273000 nodes, 98 on tree, 1e+50 best solution, best possible 0 (1760.11 seconds)\n", - "Cbc0010I After 23274000 nodes, 90 on tree, 1e+50 best solution, best possible 0 (1760.17 seconds)\n", - "Cbc0010I After 23275000 nodes, 144 on tree, 1e+50 best solution, best possible 0 (1760.24 seconds)\n", - "Cbc0010I After 23276000 nodes, 105 on tree, 1e+50 best solution, best possible 0 (1760.32 seconds)\n", - "Cbc0010I After 23277000 nodes, 153 on tree, 1e+50 best solution, best possible 0 (1760.39 seconds)\n", - "Cbc0010I After 23278000 n" - ] } ], "source": [ @@ -22643,13 +191,6 @@ "result['inconsistency']" ] }, - { - "cell_type": "code", - "execution_count": null, - "metadata": {}, - "outputs": [], - "source": [] - }, { "cell_type": "code", "execution_count": null, diff --git a/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb index 901e706..293e41a 100644 --- a/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb +++ b/notebooks/illustration/multiclass/05_check_1_dataset_known_folds_som_micro.ipynb @@ -18,12 +18,12 @@ { "data": { "text/plain": [ - "({0: 165, 1: 130, 2: 77, 3: 66, 4: 116},\n", - " {'n_folds': 4, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", - " {'acc': 0.6726,\n", - " 'sens': 0.1814,\n", - " 'spec': 0.7954,\n", - " 'f1p': 0.1814,\n", + "({0: 62, 1: 181, 2: 107, 3: 66},\n", + " {'n_folds': 3, 'n_repeats': 2, 'strategy': 'stratified_sklearn'},\n", + " {'acc': 0.6304,\n", + " 'sens': 0.2608,\n", + " 'spec': 0.7536,\n", + " 'f1p': 0.2608,\n", " 'beta_positive': 2,\n", " 'beta_negative': 2})" ] @@ -62,44 +62,44 @@ "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 20:23:20,198:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", - "2023-11-03 20:23:20,200:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 20:23:20,202:INFO:intervals before: (0, 346), (0, 1038)\n", - "2023-11-03 20:23:20,202:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 20:23:20,203:INFO:the tn solutions: (779.8805399999999, 780.23346)\n", - "2023-11-03 20:23:20,205:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,205:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 20:23:20,206:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,207:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", - "2023-11-03 20:23:20,208:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,209:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,210:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-11-03 20:23:20,211:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,211:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", - "2023-11-03 20:23:20,213:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", - "2023-11-03 20:23:20,213:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,214:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 20:23:20,215:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,217:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 20:23:20,218:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,219:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,220:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-11-03 20:23:20,221:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,222:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", - "2023-11-03 20:23:20,223:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", - "2023-11-03 20:23:20,224:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,224:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-11-03 20:23:20,225:INFO:intervals before: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,226:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", - "2023-11-03 20:23:20,226:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,227:INFO:intervals after: [(88, 88)], [(780, 780)]\n", - "2023-11-03 20:23:20,227:INFO:testing acc, feasible tptn pairs: 1\n", - "2023-11-03 20:23:20,230:INFO:testing sens, feasible tptn pairs: 1\n", - "2023-11-03 20:23:20,230:INFO:testing spec, feasible tptn pairs: 1\n", - "2023-11-03 20:23:20,231:INFO:testing f1p, feasible tptn pairs: 1\n", - "2023-11-03 20:23:20,232:INFO:constructing final tp, tn pair set\n", - "2023-11-03 20:23:20,232:INFO:final number of intervals: 1\n", - "2023-11-03 20:23:20,233:INFO:final number of pairs: 1\n" + "2023-11-04 11:32:09,641:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-04 11:32:09,644:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-04 11:32:09,645:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-04 11:32:09,646:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-04 11:32:09,647:INFO:the tn solutions: (779.8805399999999, 780.23346)\n", + "2023-11-04 11:32:09,648:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,649:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-04 11:32:09,653:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,654:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", + "2023-11-04 11:32:09,656:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,656:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,657:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-04 11:32:09,658:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,659:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", + "2023-11-04 11:32:09,660:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", + "2023-11-04 11:32:09,661:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,664:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-04 11:32:09,665:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,666:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-04 11:32:09,666:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,667:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,668:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-04 11:32:09,670:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,672:INFO:the tp solutions: (87.95250800000001, 88.023092)\n", + "2023-11-04 11:32:09,673:INFO:the tn solutions: (778.7721780040409, 781.2044258844836)\n", + "2023-11-04 11:32:09,674:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,675:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-04 11:32:09,677:INFO:intervals before: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,677:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-04 11:32:09,680:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,680:INFO:intervals after: [(88, 88)], [(780, 780)]\n", + "2023-11-04 11:32:09,682:INFO:testing acc, feasible tptn pairs: 1\n", + "2023-11-04 11:32:09,682:INFO:testing sens, feasible tptn pairs: 1\n", + "2023-11-04 11:32:09,684:INFO:testing spec, feasible tptn pairs: 1\n", + "2023-11-04 11:32:09,685:INFO:testing f1p, feasible tptn pairs: 1\n", + "2023-11-04 11:32:09,686:INFO:constructing final tp, tn pair set\n", + "2023-11-04 11:32:09,689:INFO:final number of intervals: 1\n", + "2023-11-04 11:32:09,690:INFO:final number of pairs: 1\n" ] }, { @@ -125,9 +125,20 @@ "cell_type": "code", "execution_count": 13, "metadata": {}, - "outputs": [], + "outputs": [ + { + "data": { + "text/plain": [ + "{'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543}" + ] + }, + "execution_count": 13, + "metadata": {}, + "output_type": "execute_result" + } + ], "source": [ - "#scores['acc'] = (1.0 + scores['spec']) / 2.0" + "scores" ] }, { @@ -136,64 +147,54 @@ "metadata": {}, "outputs": [], "source": [ - "#scores['acc']" - ] - }, - { - "cell_type": "code", - "execution_count": 15, - "metadata": {}, - "outputs": [], - "source": [ - "#scores['acc'] = 0.8756\n", "scores['sens'] = 0.2553" ] }, { "cell_type": "code", - "execution_count": 16, + "execution_count": 15, "metadata": {}, "outputs": [ { "name": "stderr", "output_type": "stream", "text": [ - "2023-11-03 20:23:20,274:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2553, 'spec': 0.7514, 'f1p': 0.2543}\n", - "2023-11-03 20:23:20,276:INFO:evaluating the tp and tn solution for acc and sens\n", - "2023-11-03 20:23:20,277:INFO:intervals before: (0, 346), (0, 1038)\n", - "2023-11-03 20:23:20,277:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", - "2023-11-03 20:23:20,278:INFO:the tn solutions: (779.5345399999999, 779.88746)\n", - "2023-11-03 20:23:20,279:INFO:intervals after: [(1, 0)], [(1, 0)]\n", - "2023-11-03 20:23:20,279:INFO:evaluating the tp and tn solution for acc and spec\n", - "2023-11-03 20:23:20,280:INFO:intervals before: [(1, 0)], [(1, 0)]\n", - "2023-11-03 20:23:20,280:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", - "2023-11-03 20:23:20,281:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,282:INFO:intervals after: [], []\n", - "2023-11-03 20:23:20,282:INFO:evaluating the tp and tn solution for acc and f1p\n", - "2023-11-03 20:23:20,283:INFO:intervals before: [], []\n", - "2023-11-03 20:23:20,284:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", - "2023-11-03 20:23:20,285:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", - "2023-11-03 20:23:20,286:INFO:intervals after: [], []\n", - "2023-11-03 20:23:20,286:INFO:evaluating the tp and tn solution for sens and spec\n", - "2023-11-03 20:23:20,289:INFO:intervals before: [], []\n", - "2023-11-03 20:23:20,290:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", - "2023-11-03 20:23:20,290:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,291:INFO:intervals after: [], []\n", - "2023-11-03 20:23:20,291:INFO:evaluating the tp and tn solution for sens and f1p\n", - "2023-11-03 20:23:20,293:INFO:intervals before: [], []\n", - "2023-11-03 20:23:20,294:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", - "2023-11-03 20:23:20,294:INFO:the tn solutions: (776.397796151697, 778.8284162069881)\n", - "2023-11-03 20:23:20,295:INFO:intervals after: [], []\n", - "2023-11-03 20:23:20,295:INFO:evaluating the tp and tn solution for spec and f1p\n", - "2023-11-03 20:23:20,296:INFO:intervals before: [], []\n", - "2023-11-03 20:23:20,297:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", - "2023-11-03 20:23:20,297:INFO:the tn solutions: (779.847324, 780.059076)\n", - "2023-11-03 20:23:20,298:INFO:intervals after: [], []\n", - "2023-11-03 20:23:20,299:INFO:testing acc, feasible tptn pairs: 0\n", - "2023-11-03 20:23:20,300:INFO:no more feasible tp,tn pairs left\n", - "2023-11-03 20:23:20,301:INFO:constructing final tp, tn pair set\n", - "2023-11-03 20:23:20,301:INFO:final number of intervals: 0\n", - "2023-11-03 20:23:20,302:INFO:final number of pairs: 0\n" + "2023-11-04 11:32:09,740:INFO:checking the scores {'acc': 0.6272, 'sens': 0.2553, 'spec': 0.7514, 'f1p': 0.2543}\n", + "2023-11-04 11:32:09,742:INFO:evaluating the tp and tn solution for acc and sens\n", + "2023-11-04 11:32:09,744:INFO:intervals before: (0, 346), (0, 1038)\n", + "2023-11-04 11:32:09,744:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-04 11:32:09,745:INFO:the tn solutions: (779.5345399999999, 779.88746)\n", + "2023-11-04 11:32:09,746:INFO:intervals after: [(1, 0)], [(1, 0)]\n", + "2023-11-04 11:32:09,750:INFO:evaluating the tp and tn solution for acc and spec\n", + "2023-11-04 11:32:09,751:INFO:intervals before: [(1, 0)], [(1, 0)]\n", + "2023-11-04 11:32:09,752:INFO:the tp solutions: (87.8445559999999, 88.33864400000004)\n", + "2023-11-04 11:32:09,754:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,755:INFO:intervals after: [], []\n", + "2023-11-04 11:32:09,756:INFO:evaluating the tp and tn solution for acc and f1p\n", + "2023-11-04 11:32:09,757:INFO:intervals before: [], []\n", + "2023-11-04 11:32:09,758:INFO:the tp solutions: (87.90462837746212, 88.04741174998863)\n", + "2023-11-04 11:32:09,759:INFO:the tn solutions: (779.594751267001, 780.5429578357666)\n", + "2023-11-04 11:32:09,760:INFO:intervals after: [], []\n", + "2023-11-04 11:32:09,761:INFO:evaluating the tp and tn solution for sens and spec\n", + "2023-11-04 11:32:09,762:INFO:intervals before: [], []\n", + "2023-11-04 11:32:09,763:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-04 11:32:09,765:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,765:INFO:intervals after: [], []\n", + "2023-11-04 11:32:09,767:INFO:evaluating the tp and tn solution for sens and f1p\n", + "2023-11-04 11:32:09,768:INFO:intervals before: [], []\n", + "2023-11-04 11:32:09,769:INFO:the tp solutions: (88.29850800000001, 88.36909200000001)\n", + "2023-11-04 11:32:09,769:INFO:the tn solutions: (776.397796151697, 778.8284162069881)\n", + "2023-11-04 11:32:09,771:INFO:intervals after: [], []\n", + "2023-11-04 11:32:09,772:INFO:evaluating the tp and tn solution for spec and f1p\n", + "2023-11-04 11:32:09,773:INFO:intervals before: [], []\n", + "2023-11-04 11:32:09,774:INFO:the tp solutions: (87.93699113585161, 88.04870828206266)\n", + "2023-11-04 11:32:09,775:INFO:the tn solutions: (779.847324, 780.059076)\n", + "2023-11-04 11:32:09,776:INFO:intervals after: [], []\n", + "2023-11-04 11:32:09,777:INFO:testing acc, feasible tptn pairs: 0\n", + "2023-11-04 11:32:09,777:INFO:no more feasible tp,tn pairs left\n", + "2023-11-04 11:32:09,778:INFO:constructing final tp, tn pair set\n", + "2023-11-04 11:32:09,779:INFO:final number of intervals: 0\n", + "2023-11-04 11:32:09,780:INFO:final number of pairs: 0\n" ] }, { @@ -202,7 +203,7 @@ "True" ] }, - "execution_count": 16, + "execution_count": 15, "metadata": {}, "output_type": "execute_result" } From 79874ed5c2fd484a801453c271f21a9d5b83391a Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 12:27:32 +0100 Subject: [PATCH 24/40] update --- tests/check/multiclass/test_1_testset_no_kfold_macro.py | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/tests/check/multiclass/test_1_testset_no_kfold_macro.py b/tests/check/multiclass/test_1_testset_no_kfold_macro.py index fa04abb..791a53d 100644 --- a/tests/check/multiclass/test_1_testset_no_kfold_macro.py +++ b/tests/check/multiclass/test_1_testset_no_kfold_macro.py @@ -60,6 +60,7 @@ def test_inconsistent_configuration(random_seed): result = check_1_testset_no_kfold_macro(testset=dataset, scores=scores, - eps=1e-4) + eps=1e-4, + timeout=2) assert result['inconsistency'] From 44fd89ac166d6640dac7fd9ad37cfa910988e081 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 12:33:37 +0100 Subject: [PATCH 25/40] README restructured --- README.rst | 127 +++++------------------------------------------------ 1 file changed, 11 insertions(+), 116 deletions(-) diff --git a/README.rst b/README.rst index 39a2d31..0bce888 100644 --- a/README.rst +++ b/README.rst @@ -385,8 +385,8 @@ If one of the scores is adjusted, for example, negative predictive value is chan result['inconsistency'] # True -n testsets without k-folding, SoM over the testsets -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +n testsets without k-folding, SoM/Mos over the testsets +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In this scenario there are n different testsets, the classifier is evaluated on each testsets, and the scores are aggregated by the SoM aggregation. This scenario is similar to the "1 dataset k-fold SoM" case, except the scores are aggregated over testsets rather than folds. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case. In the following example, a consistent case is tested. @@ -415,115 +415,8 @@ If one of the scores is slightly adjusted, for example, ``npv`` changed to 0.626 results["inconsistency"] # True -n testsets without k-folding, MoS over the testsets -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +Similar tests are provided for the MoS aggregation as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. -This scenario is analogous to the "n testsets without k-folding, SoM" scenario, except the aggregation over the testsets is carried out with the MoS approach. The output is structured similarly to the output of the "1 dataset k-fold MoS" scenario. In the first example, a feasible scenario is tested. - -.. code-block:: Python - - from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold - - testsets = [{'p': 349, 'n': 50}, - {'p': 478, 'n': 323}, - {'p': 324, 'n': 83}, - {'p': 123, 'n': 145}] - - scores = {'acc': 0.6441, 'sens': 0.6706, 'spec': 0.3796, 'bacc': 0.5251} - results = check_n_testsets_mos_no_kfold(testsets=testsets, - scores=scores, - eps=0.0001) - results["inconsistency"] - # False - -If one of the scores is slightly adjusted, for example, ``sens`` is updated to 0.6756, the configuration becomes infeasible. - -.. code-block:: Python - - scores['sens'] = 0.6756 - - results = check_n_testsets_mos_no_kfold(testsets=testsets, - scores=scores, - eps=0.0001) - results["inconsistency"] - # True - -n datasets with k-folds, SoM over datasets and SoM over folds -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -Again, the scenario is similar to the "1 dataset k-fold SoM" scenario, except there is another level of aggregation over datasets, and one single confusion matrix is determined for the entire experiment and the scores are calculated from that. In this scenario a list of evaluations need to be specified. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case, there is a top level ``inconsistency`` flag indicating if inconsistency has been detected. In the following example, a consistent case is prepared with two datasets. - -.. code-block:: Python - - from mlscorecheck.check.binary import check_n_datasets_som_kfold_som - - evaluation0 = {'dataset': {'p': 389, 'n': 630}, - 'folding': {'n_folds': 5, 'n_repeats': 2, - 'strategy': 'stratified_sklearn'}} - evaluation1 = {'dataset': {'dataset_name': 'common_datasets.saheart'}, - 'folding': {'n_folds': 5, 'n_repeats': 2, - 'strategy': 'stratified_sklearn'}} - evaluations = [evaluation0, evaluation1] - - scores = {'acc': 0.631, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - - result = check_n_datasets_som_kfold_som(scores=scores, - evaluations=evaluations, - eps=1e-3) - result['inconsistency'] - # False - -However, if one of the scores is adjusted a little, like accuracy is changed to 0.731, the configuration becomes inconsistent: - -.. code-block:: Python - - scores = {'acc': 0.731, 'sens': 0.341, 'spec': 0.802, 'f1p': 0.406, 'fm': 0.414} - - result = check_n_datasets_som_kfold_som(scores=scores, - evaluations=evaluations, - eps=1e-3) - result['inconsistency'] - # True - -n datasets with k-folds, MoS over datasets and SoM over folds -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -This scenario is about performance scores calculated for each dataset individually by the SoM aggregation in any k-folding strategy, and then the scores are aggregated across the datasets in the MoS manner. Because of the overall averaging, one cannot do inference about the non-linear scores, only the four linear scores are supported (``acc``, ``sens``, ``spec``, ``bacc``), and the scores are checked by linear programming. Similarly as before, the specification of a list of evaluations is needed. In the following example a consistent scenario is tested, with score bounds also specified on the datasets: - -.. code-block:: Python - - from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som - - evaluation0 = {'dataset': {'p': 39, 'n': 822}, - 'folding': {'n_folds': 5, 'n_repeats': 3, - 'strategy': 'stratified_sklearn'}} - evaluation1 = {'dataset': {'dataset_name': 'common_datasets.winequality-white-3_vs_7'}, - 'folding': {'n_folds': 5, 'n_repeats': 3, - 'strategy': 'stratified_sklearn'}} - evaluations = [evaluation0, evaluation1] - - scores = {'acc': 0.312, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - - result = check_n_datasets_mos_kfold_som(evaluations=evaluations, - dataset_score_bounds={'acc': (0.0, 0.5)}, - eps=1e-4, - scores=scores) - result['inconsistency'] - # False - -However, if one of the scores is adjusted a little (accuracy changed to 0.412 and the score bounds also changed), the configuration becomes infeasible: - -.. code-block:: Python - - scores = {'acc': 0.412, 'sens': 0.45, 'spec': 0.312, 'bacc': 0.381} - result = check_n_datasets_mos_kfold_som(evaluations=evaluations, - dataset_score_bounds={'acc': (0.5, 1.0)}, - eps=1e-4, - scores=scores) - result['inconsistency'] - # True - -The output is structured similarly to the '1 dataset k-folds MoS' case, one can query the status of the solver by the key ``lp_status`` and the actual configuration of the variables by the ``lp_configuration`` key. If there are hints on the minimum and maximum scores across the datasets, one can add those bounds through the ``dataset_score_bounds`` parameter to strengthen the test. n datasets with k-folds, MoS over datasets and MoS over folds ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ @@ -562,13 +455,11 @@ Again, the details of the analysis are accessible under the ``lp_status`` and `` If there are hints on the minimum and maximum scores across the datasets, one can add those bounds through the ``dataset_score_bounds`` parameter to strengthen the test. -Not knowing the mode of aggregation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +Similar tests are provided for the SoM aggregation as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. -The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. Not knowing the k-folding scheme -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In many cases, it is not stated explicitly if stratification was applied or not, only the use of k-fold is phrased in papers. Not knowing the folding structure, the MoS aggregated tests cannot be used. However, if the cardinality of the minority class is not too big (a couple of dozens), then all potential k-fold configurations can be generated, and the MoS tests can be applied to each. If the scores are inconsistent with each, it means that no k-fold could result the scores. There are two functions supporting these exhaustive tests, one for the dataset level, and one for the experiment level. @@ -671,7 +562,7 @@ As the test confirms, the setup is consistent. However, if one of the scores is >>> results['inconsistency'] # True -Similar functionality is provided for macro-averaging. +Similar functionality is provided for macro-averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. 1 dataset, known k-folds, SoM/MoS aggregation, micro/macro-averaging ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ @@ -707,7 +598,7 @@ As the test confirms, the scenario is feasible. However, if one of the scores is >>> result['inconsistency'] # True -Similar functionality is provided for mean of scores aggregation and macro averaging. +Similar functionality is provided for mean of scores aggregation and macro averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. Regression ^^^^^^^^^^ @@ -748,6 +639,10 @@ As the results show, there is no inconsistency detected. However, if the mae sco >>> result['inconsistency'] # True +Not knowing the mode of aggregation +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. Test bundles ============ From 3b9b55e32d71414824b98f1e09a189ea0f72cc5f Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 12:38:18 +0100 Subject: [PATCH 26/40] version bump --- README.rst | 5 +++-- mlscorecheck/_version.py | 2 +- 2 files changed, 4 insertions(+), 3 deletions(-) diff --git a/README.rst b/README.rst index 0bce888..94340c8 100644 --- a/README.rst +++ b/README.rst @@ -52,10 +52,11 @@ The consistency tests are numerical and **not** statistical: if inconsistencies Latest news =========== -* the 1.0.0 version of the package is released +* the 1.0.1 version of the package is released; * the paper describing the numerical techniques is available as a preprint at: https://arxiv.org/abs/2310.12527 * the full documentation is available at: https://mlscorecheck.readthedocs.io/en/latest/ -* 10 test bundles including retina image processing datasets, preterm delivery prediction from electrohysterograms and skin lesion classification has been added. +* 10 test bundles including retina image processing datasets, preterm delivery prediction from electrohysterograms and skin lesion classification has been added; +* multiclass and regression tests added. Citation ======== diff --git a/mlscorecheck/_version.py b/mlscorecheck/_version.py index 3695874..0363fca 100644 --- a/mlscorecheck/_version.py +++ b/mlscorecheck/_version.py @@ -2,4 +2,4 @@ This module contains the version of the package. """ -__version__ = "1.0.0" +__version__ = "1.0.1" From ee2d84885acb6c6a5b169f179131af56927b5cc2 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 12:39:46 +0100 Subject: [PATCH 27/40] sample code fix --- README.rst | 52 ++++++++++++++++++++++++++-------------------------- 1 file changed, 26 insertions(+), 26 deletions(-) diff --git a/README.rst b/README.rst index 94340c8..7a6b494 100644 --- a/README.rst +++ b/README.rst @@ -541,26 +541,26 @@ In this scenario, we suppose there is a multiclass classification testset and th .. code-block:: Python - >>> from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro + from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro - >>> testset = {0: 10, 1: 100, 2: 80} - >>> scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, + testset = {0: 10, 1: 100, 2: 80} + scores = {'acc': 0.5158, 'sens': 0.2737, 'spec': 0.6368, 'bacc': 0.4553, 'ppv': 0.2737, 'npv': 0.6368} - >>> results = check_1_testset_no_kfold_micro(testset=testset, + results = check_1_testset_no_kfold_micro(testset=testset, scores=scores, eps=1e-4) - >>> results['inconsistency'] + results['inconsistency'] # False As the test confirms, the setup is consistent. However, if one of the scores is adjusted a little, for example, accuracy is changed to 0.5258, the configuration becomes infeasible: .. code-block:: Python - >>> scores['acc'] = 0.5258 - >>> results = check_1_testset_no_kfold_micro(testset=testset, + scores['acc'] = 0.5258 + results = check_1_testset_no_kfold_micro(testset=testset, scores=scores, eps=1e-4) - >>> results['inconsistency'] + results['inconsistency'] # True Similar functionality is provided for macro-averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. @@ -574,29 +574,29 @@ In the first example, we test an artificially generated, consistent scenario: .. code-block:: Python - >>> from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro + from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro - >>> dataset = {0: 86, 1: 96, 2: 59, 3: 105} - >>> folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]} - >>> scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543} + dataset = {0: 86, 1: 96, 2: 59, 3: 105} + folding = {'folds': [{0: 43, 1: 48, 2: 30, 3: 52}, {0: 43, 1: 48, 2: 29, 3: 53}]} + scores = {'acc': 0.6272, 'sens': 0.2543, 'spec': 0.7514, 'f1p': 0.2543} - >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + result = check_1_dataset_known_folds_som_micro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) - >>> result['inconsistency'] + result['inconsistency'] # False As the test confirms, the scenario is feasible. However, if one of the scores is adjusted a little, for example, sensitivity is changed to 0.2553, the configuration becomes infeasible: .. code-block:: Python - >>> scores['sens'] = 0.2553 - >>> result = check_1_dataset_known_folds_som_micro(dataset=dataset, + scores['sens'] = 0.2553 + result = check_1_dataset_known_folds_som_micro(dataset=dataset, folding=folding, scores=scores, eps=1e-4) - >>> result['inconsistency'] + result['inconsistency'] # True Similar functionality is provided for mean of scores aggregation and macro averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. @@ -615,29 +615,29 @@ In the first example, we test an artificially generated, consistent scenario: .. code-block:: Python - >>> from mlscorecheck.check.regression import check_1_testset_no_kfold + from mlscorecheck.check.regression import check_1_testset_no_kfold - >>> var = 0.0831619 # the variance of the target values in the testset - >>> n_samples = 100 - >>> scores = {'mae': 0.0254, 'r2': 0.9897} + var = 0.0831619 # the variance of the target values in the testset + n_samples = 100 + scores = {'mae': 0.0254, 'r2': 0.9897} - >>> result = check_1_testset_no_kfold(var=var, + result = check_1_testset_no_kfold(var=var, n_samples=n_samples, scores=scores, eps=1e-4) - >>> result['inconsistency'] + result['inconsistency'] # False As the results show, there is no inconsistency detected. However, if the mae score is adjusted slightly to 0.03, the configuration becomes inconsistent: .. code-block:: Python - >>> scores['mae'] = 0.03 - >>> result = check_1_testset_no_kfold(var=var, + scores['mae'] = 0.03 + result = check_1_testset_no_kfold(var=var, n_samples=n_samples, scores=scores, eps=1e-4) - >>> result['inconsistency'] + result['inconsistency'] # True Not knowing the mode of aggregation From e8c490eaaac6abcf665018fde83b933f9c2e10a4 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 13:17:20 +0100 Subject: [PATCH 28/40] readme update --- README.rst | 64 +++++++++++++++++++++++++++--------------------------- 1 file changed, 32 insertions(+), 32 deletions(-) diff --git a/README.rst b/README.rst index 7a6b494..e21b07e 100644 --- a/README.rst +++ b/README.rst @@ -231,30 +231,25 @@ A dataset and a folding constitute an *evaluation*, and many of the test functio "folding": {"n_folds": 5, "n_repeats": 1, "strategy": "stratified_sklearn"}} -Testing the consistency of performance scores ---------------------------------------------- +The output of the tests +----------------------- -Numerous experimental setups are supported by the package. In this section we go through them one by one giving some examples of possible use cases. - -We emphasize again, that the tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. +The tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. A note on the *Score of Means* and *Mean of Scores* aggregations -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +---------------------------------------------------------------- When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). -The two types of tests -^^^^^^^^^^^^^^^^^^^^^^ +Binary classification +--------------------- In the context of a single testset or a Score of Means (SoM) aggregation, which results in one confusion matrix, one can systematically iterate through all potential confusion matrices to assess whether any of them can generate the reported scores within the specified numerical uncertainty. To expedite this process, the test leverages interval arithmetic. The test supports the performance scores ``acc``, ``sens``, ``spec``, ``ppv``, ``npv``, ``bacc``, ``f1``, ``f1n``, ``fbp``, ``fbn``, ``fm``, ``upm``, ``gm``, ``mk``, ``lrp``, ``lrn``, ``mcc``, ``bm``, ``pt``, ``dor``, ``ji``, ``kappa``. Note that when the f-beta positive or f-beta negative scores are used, one also needs to specify the ``beta_positive`` or ``beta_negative`` parameters. With a MoS type of aggregation, only the averages of scores over folds or datasets are available. In this case, it is feasible to reconstruct fold-level or dataset-level confusion matrices for the linear scores ``acc``, ``sens``, ``spec`` and ``bacc`` using linear integer programming. These tests formulate a linear integer program based on the reported scores and the experimental setup, and check if the program is feasible to produce the reported values within the estimated numerical uncertainties. -Binary classification -^^^^^^^^^^^^^^^^^^^^^ - 1 testset with no k-fold -~~~~~~~~~~~~~~~~~~~~~~~~ +^^^^^^^^^^^^^^^^^^^^^^^^ A scenario like this is having one single test set to which classification is applied and the scores are computed from the resulting confusion matrix. For example, given a test image, which is segmented and the scores of the segmentation (as a binary classification of pixels) are calculated and reported. @@ -290,8 +285,8 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura As the ``inconsistency`` flag shows, here inconsistencies were identified, there are no such ``tp`` and ``tn`` combinations which would end up with the reported scores. Either the assumption on the properties of the dataset, or the scores are incorrect. -1 dataset with k-fold, mean-of-scores (MoS) -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +1 dataset with k-fold, mean of scores (MoS) +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ This scenario is the most common in the literature. A classification technique is executed to each fold in a (repeated) k-fold scenario, the scores are calculated for each fold, and the average of the scores is reported with some numerical uncertainty due to rounding/ceiling/flooring. Because of the averaging, this test supports only the linear scores (``acc``, ``sens``, ``spec``, ``bacc``) which usually are among the most commonly reported scores. The test constructs a linear integer program describing the scenario with the true positive and true negative parameters of all folds and checks its feasibility. @@ -348,8 +343,8 @@ with a true positive and true negative configuration with the specified lower an Note that in this example, although ``f1`` is provided, it is completely ignored as the aggregated tests work only for the four linear scores. -1 dataset with kfold score-of-means (SoM) -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +1 dataset with k-fold, score of means (SoM) +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ When the scores are calculated in the Score-of-Means (SoM) manner in a k-fold scenario, it means that the total confusion matrix of all folds is calculated first, and then the score formulas are applied to it. The only difference compared to the "1 testset no kfold" scenario is that the number of repetitions of the k-fold scheme multiples the ``p`` and ``n`` statistics of the dataset, but the actual structure of the folds is irrelevant. The result of the analysis is structured similarly to the "1 testset no kfold" case. @@ -386,8 +381,8 @@ If one of the scores is adjusted, for example, negative predictive value is chan result['inconsistency'] # True -n testsets without k-folding, SoM/Mos over the testsets -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +n testsets without k-fold, SoM/MoS aggregation +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In this scenario there are n different testsets, the classifier is evaluated on each testsets, and the scores are aggregated by the SoM aggregation. This scenario is similar to the "1 dataset k-fold SoM" case, except the scores are aggregated over testsets rather than folds. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case. In the following example, a consistent case is tested. @@ -419,8 +414,8 @@ If one of the scores is slightly adjusted, for example, ``npv`` changed to 0.626 Similar tests are provided for the MoS aggregation as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. -n datasets with k-folds, MoS over datasets and MoS over folds -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +n datasets with k-fold, MoS over datasets and MoS over folds +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In this scenario, scores are calculated in the MoS manner for each dataset, and then aggregated again across the datasets. Again, because of the averaging, only the four linear scores (``acc``, ``sens``, ``spec``, ``bacc``) are supported. In the following example a consistent scenario is checked with three datasets and without score bounds specified at any level: @@ -456,11 +451,10 @@ Again, the details of the analysis are accessible under the ``lp_status`` and `` If there are hints on the minimum and maximum scores across the datasets, one can add those bounds through the ``dataset_score_bounds`` parameter to strengthen the test. -Similar tests are provided for the SoM aggregation as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. - +Similar tests are provided for the SoM aggregation and the mixing of MoS and SoM aggregation, as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. Not knowing the k-folding scheme -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In many cases, it is not stated explicitly if stratification was applied or not, only the use of k-fold is phrased in papers. Not knowing the folding structure, the MoS aggregated tests cannot be used. However, if the cardinality of the minority class is not too big (a couple of dozens), then all potential k-fold configurations can be generated, and the MoS tests can be applied to each. If the scores are inconsistent with each, it means that no k-fold could result the scores. There are two functions supporting these exhaustive tests, one for the dataset level, and one for the experiment level. @@ -529,13 +523,23 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th result['inconsistency'] # True +Not knowing the mode of aggregation +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. + Multiclass classification -^^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------- In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. +A note on micro and macro-averaging +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +In a multiclass scenario, the commonly used approach is for measuring the performance of a classification technique is to calculate the micro or macro-averaged scores. In the micro-averaging approach, the confusion matrices of the individual classes are aggregated, and the scores are calculated from the aggregated confusion matrix. In the macro-averaging approach, the scores are calculated for each class, and the average of the scores is reported. The micro-averaging approach is more robust to class imbalance, however, it is not possible to estimate the standard deviation of the scores. The macro-averaging approach is more sensitive to class imbalance, but it is possible to estimate the standard deviation of the scores. + 1 testset, no k-fold, micro/macro-averaging -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In this scenario, we suppose there is a multiclass classification testset and the class level scores on the testset are aggregated by micro-averaging. The test is based on exhaustive enumeration, so all 20 performance scores are supported. In the first example, we test an artificially generated, consistent scenario: @@ -566,7 +570,7 @@ As the test confirms, the setup is consistent. However, if one of the scores is Similar functionality is provided for macro-averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. 1 dataset, known k-folds, SoM/MoS aggregation, micro/macro-averaging -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by micro-averaging, and the fold level results are aggregated in the score of means fashion. The test is based on exhaustive enumeration, therefore, all 20 performance scores are supported. @@ -602,12 +606,12 @@ As the test confirms, the scenario is feasible. However, if one of the scores is Similar functionality is provided for mean of scores aggregation and macro averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. Regression -^^^^^^^^^^ +---------- From the point of view of consistency testing, regression is the hardest problem as the predictions can produce any performance scores. The tests implemented in the package allow testing the relation of the *mean squared error* (``mse``), *root mean squared error* (``rmse``), *mean average error* (``mae``) and *r^2 scores* (``r2``). 1 testset, no k-fold -~~~~~~~~~~~~~~~~~~~~ +^^^^^^^^^^^^^^^^^^^^ In this scenario, we assume there is a regression testset, and the performance scores are calculated on the testset. @@ -640,10 +644,6 @@ As the results show, there is no inconsistency detected. However, if the mae sco result['inconsistency'] # True -Not knowing the mode of aggregation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. Test bundles ============ From b49ce7b3ca8b6777b1b265cccd10edbc68cceca9 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 13:24:40 +0100 Subject: [PATCH 29/40] readme update --- README.rst | 37 +++++++++++++++---------------------- 1 file changed, 15 insertions(+), 22 deletions(-) diff --git a/README.rst b/README.rst index e21b07e..bfd58ba 100644 --- a/README.rst +++ b/README.rst @@ -127,8 +127,8 @@ For further information, see * ReadTheDocs full documentation: https://mlscorecheck.readthedocs.io/en/latest/ * The preprint: https://arxiv.org/abs/2310.12527 -Use cases -========= +Binary classification +===================== In general, there are three inputs to the consistency testing functions: @@ -241,15 +241,8 @@ A note on the *Score of Means* and *Mean of Scores* aggregations When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). -Binary classification ---------------------- - -In the context of a single testset or a Score of Means (SoM) aggregation, which results in one confusion matrix, one can systematically iterate through all potential confusion matrices to assess whether any of them can generate the reported scores within the specified numerical uncertainty. To expedite this process, the test leverages interval arithmetic. The test supports the performance scores ``acc``, ``sens``, ``spec``, ``ppv``, ``npv``, ``bacc``, ``f1``, ``f1n``, ``fbp``, ``fbn``, ``fm``, ``upm``, ``gm``, ``mk``, ``lrp``, ``lrn``, ``mcc``, ``bm``, ``pt``, ``dor``, ``ji``, ``kappa``. Note that when the f-beta positive or f-beta negative scores are used, one also needs to specify the ``beta_positive`` or ``beta_negative`` parameters. - -With a MoS type of aggregation, only the averages of scores over folds or datasets are available. In this case, it is feasible to reconstruct fold-level or dataset-level confusion matrices for the linear scores ``acc``, ``sens``, ``spec`` and ``bacc`` using linear integer programming. These tests formulate a linear integer program based on the reported scores and the experimental setup, and check if the program is feasible to produce the reported values within the estimated numerical uncertainties. - 1 testset with no k-fold -^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------ A scenario like this is having one single test set to which classification is applied and the scores are computed from the resulting confusion matrix. For example, given a test image, which is segmented and the scores of the segmentation (as a binary classification of pixels) are calculated and reported. @@ -286,7 +279,7 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura As the ``inconsistency`` flag shows, here inconsistencies were identified, there are no such ``tp`` and ``tn`` combinations which would end up with the reported scores. Either the assumption on the properties of the dataset, or the scores are incorrect. 1 dataset with k-fold, mean of scores (MoS) -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------------------------- This scenario is the most common in the literature. A classification technique is executed to each fold in a (repeated) k-fold scenario, the scores are calculated for each fold, and the average of the scores is reported with some numerical uncertainty due to rounding/ceiling/flooring. Because of the averaging, this test supports only the linear scores (``acc``, ``sens``, ``spec``, ``bacc``) which usually are among the most commonly reported scores. The test constructs a linear integer program describing the scenario with the true positive and true negative parameters of all folds and checks its feasibility. @@ -344,7 +337,7 @@ with a true positive and true negative configuration with the specified lower an Note that in this example, although ``f1`` is provided, it is completely ignored as the aggregated tests work only for the four linear scores. 1 dataset with k-fold, score of means (SoM) -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------------------------- When the scores are calculated in the Score-of-Means (SoM) manner in a k-fold scenario, it means that the total confusion matrix of all folds is calculated first, and then the score formulas are applied to it. The only difference compared to the "1 testset no kfold" scenario is that the number of repetitions of the k-fold scheme multiples the ``p`` and ``n`` statistics of the dataset, but the actual structure of the folds is irrelevant. The result of the analysis is structured similarly to the "1 testset no kfold" case. @@ -382,7 +375,7 @@ If one of the scores is adjusted, for example, negative predictive value is chan # True n testsets without k-fold, SoM/MoS aggregation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +---------------------------------------------- In this scenario there are n different testsets, the classifier is evaluated on each testsets, and the scores are aggregated by the SoM aggregation. This scenario is similar to the "1 dataset k-fold SoM" case, except the scores are aggregated over testsets rather than folds. The output of the test is structured similarly as in the "1 dataset k-fold SoM" case. In the following example, a consistent case is tested. @@ -415,7 +408,7 @@ Similar tests are provided for the MoS aggregation as well, for further details n datasets with k-fold, MoS over datasets and MoS over folds -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------------------------------------------ In this scenario, scores are calculated in the MoS manner for each dataset, and then aggregated again across the datasets. Again, because of the averaging, only the four linear scores (``acc``, ``sens``, ``spec``, ``bacc``) are supported. In the following example a consistent scenario is checked with three datasets and without score bounds specified at any level: @@ -454,7 +447,7 @@ If there are hints on the minimum and maximum scores across the datasets, one ca Similar tests are provided for the SoM aggregation and the mixing of MoS and SoM aggregation, as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. Not knowing the k-folding scheme -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +-------------------------------- In many cases, it is not stated explicitly if stratification was applied or not, only the use of k-fold is phrased in papers. Not knowing the folding structure, the MoS aggregated tests cannot be used. However, if the cardinality of the minority class is not too big (a couple of dozens), then all potential k-fold configurations can be generated, and the MoS tests can be applied to each. If the scores are inconsistent with each, it means that no k-fold could result the scores. There are two functions supporting these exhaustive tests, one for the dataset level, and one for the experiment level. @@ -524,22 +517,22 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th # True Not knowing the mode of aggregation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +----------------------------------- The biggest challenge with aggregated scores is that the ways of aggregation at the dataset and experiment level are rarely disclosed explicitly. Even in this case the tools presented in the previous section can be used since there are hardly any further ways of meaningful averaging than (MoS on folds, MoS on datasets), (SoM on folds, MoS on datasets), (SoM on folds, SoM on datasets), hence, if a certain set of scores is inconsistent with each of these possibilities, one can safely say that the results do not satisfy the reasonable expectations. Multiclass classification -------------------------- +========================= In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. A note on micro and macro-averaging -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +----------------------------------- In a multiclass scenario, the commonly used approach is for measuring the performance of a classification technique is to calculate the micro or macro-averaged scores. In the micro-averaging approach, the confusion matrices of the individual classes are aggregated, and the scores are calculated from the aggregated confusion matrix. In the macro-averaging approach, the scores are calculated for each class, and the average of the scores is reported. The micro-averaging approach is more robust to class imbalance, however, it is not possible to estimate the standard deviation of the scores. The macro-averaging approach is more sensitive to class imbalance, but it is possible to estimate the standard deviation of the scores. 1 testset, no k-fold, micro/macro-averaging -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +------------------------------------------- In this scenario, we suppose there is a multiclass classification testset and the class level scores on the testset are aggregated by micro-averaging. The test is based on exhaustive enumeration, so all 20 performance scores are supported. In the first example, we test an artificially generated, consistent scenario: @@ -570,7 +563,7 @@ As the test confirms, the setup is consistent. However, if one of the scores is Similar functionality is provided for macro-averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. 1 dataset, known k-folds, SoM/MoS aggregation, micro/macro-averaging -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +-------------------------------------------------------------------- In this scenario, we assume there is a multiclass classification dataset, which is evaluated in a k-fold cross-validation scenario, the class level scores are calculated by micro-averaging, and the fold level results are aggregated in the score of means fashion. The test is based on exhaustive enumeration, therefore, all 20 performance scores are supported. @@ -606,12 +599,12 @@ As the test confirms, the scenario is feasible. However, if one of the scores is Similar functionality is provided for mean of scores aggregation and macro averaging, for further details see https://mlscorecheck.readthedocs.io/en/latest/. Regression ----------- +========== From the point of view of consistency testing, regression is the hardest problem as the predictions can produce any performance scores. The tests implemented in the package allow testing the relation of the *mean squared error* (``mse``), *root mean squared error* (``rmse``), *mean average error* (``mae``) and *r^2 scores* (``r2``). 1 testset, no k-fold -^^^^^^^^^^^^^^^^^^^^ +-------------------- In this scenario, we assume there is a regression testset, and the performance scores are calculated on the testset. From 60506d5d0f50b7aafd97ccbcd1b9a675670847e5 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 13:42:51 +0100 Subject: [PATCH 30/40] regression added --- docs/03_api.rst | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/docs/03_api.rst b/docs/03_api.rst index 0daff0d..0a59c13 100644 --- a/docs/03_api.rst +++ b/docs/03_api.rst @@ -33,6 +33,10 @@ Multiclass classification .. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_som_macro .. autofunction:: mlscorecheck.check.multiclass.check_1_dataset_known_folds_som_micro +Regression +---------- + +.. autofunction:: mlscorecheck.check.regression.check_1_testset_no_kfold Test bundles (``bundles``) ========================== From 50ef85dcbc5db3766ca36ca48e0d4666a4eb4dde Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sat, 4 Nov 2023 13:59:55 +0100 Subject: [PATCH 31/40] readme toc test --- README.rst | 27 ++++++++++++--------------- 1 file changed, 12 insertions(+), 15 deletions(-) diff --git a/README.rst b/README.rst index bfd58ba..ed255a7 100644 --- a/README.rst +++ b/README.rst @@ -27,11 +27,18 @@ .. |Gitter| image:: https://badges.gitter.im/mlscorecheck.svg .. _Gitter: https://app.gitter.im/#/room/!AmkvUevcfkobbwcNWS:gitter.im + mlscorecheck: testing the consistency of binary classification performance scores ********************************************************************************* +.. contents:: + :depth: 3 + +Getting started +=============== + The purpose -=========== +----------- Performance scores for binary classification are reported on a dataset and look suspicious (exceptionally high scores possibly due to typo, uncommon evaluation methodology, data leakage in preparation, incorrect use of statistics, etc.). With the tools implemented in the package ``mlscorecheck``, one can test if the reported performance scores are consistent with each other and the assumptions on the experimental setup up to the numerical uncertainty due to rounding/truncation/ceiling. @@ -50,7 +57,7 @@ Testing is as simple as the following example shows: the tested scores are incon The consistency tests are numerical and **not** statistical: if inconsistencies are identified, it means that either the assumptions on the experimental setup or the reported scores are incorrect. Latest news -=========== +----------- * the 1.0.1 version of the package is released; * the paper describing the numerical techniques is available as a preprint at: https://arxiv.org/abs/2310.12527 @@ -59,7 +66,7 @@ Latest news * multiclass and regression tests added. Citation -======== +-------- If you use the package, please consider citing the following paper: @@ -71,18 +78,8 @@ If you use the package, please consider citing the following paper: year={2023} } -Contents -======== - -The contents of the repository: - -* ``mlscorecheck`` folder: the implementation of the consistency tests; -* ``notebooks/illustration`` folder: the notebooks containing all working sample codes used throughout this README and the ReadTheDocs documentation; -* ``notebooks/utils`` folder: utilities related to generate the algebraic solutions of the score functions, as well as the summary tables used for illustration; -* ``tests`` folder: the unit and functional tests covering each line of code of the package. - Installation -============ +------------ The package has only basic requirements when used for consistency testing. @@ -664,7 +661,7 @@ Contribution We kindly encourage any experts to provide further, field specific dataset and experiment specifications and test bundles to facilitate the reporting of clean and reproducible results in any field related to binary classification! References -********** +========== .. [RV] Kovács, G. and Fazekas, A.: "A new baseline for retinal vessel segmentation: Numerical identification and correction of methodological inconsistencies affecting 100+ papers", Medical Image Analysis, 2022(1), pp. 102300 From 74281ccd0a207d8c26188c946fd01b3ec3d3f7df Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sun, 5 Nov 2023 08:38:06 +0100 Subject: [PATCH 32/40] pulp seed fixed --- mlscorecheck/aggregated/_check_aggregated_scores.py | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/mlscorecheck/aggregated/_check_aggregated_scores.py b/mlscorecheck/aggregated/_check_aggregated_scores.py index 293c1f4..e5d98dd 100644 --- a/mlscorecheck/aggregated/_check_aggregated_scores.py +++ b/mlscorecheck/aggregated/_check_aggregated_scores.py @@ -74,7 +74,10 @@ def check_aggregated_scores(*, solver_name = (PREFERRED_SOLVER if solver_name is None or solver_name not in solvers else solver_name) - solver = pl.getSolver(solver_name, timeLimit=timeout, msg=verbosity) + solver = pl.getSolver(solver_name, + timeLimit=timeout, + msg=verbosity, + options=[f"RandomS 1", f"RandomC 1"]) result = solve(experiment, scores, eps, solver) From 7308bfc460879e5c055fe7538e969009b00d8f49 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sun, 5 Nov 2023 08:49:19 +0100 Subject: [PATCH 33/40] f string fix --- mlscorecheck/aggregated/_check_aggregated_scores.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/mlscorecheck/aggregated/_check_aggregated_scores.py b/mlscorecheck/aggregated/_check_aggregated_scores.py index e5d98dd..6e39208 100644 --- a/mlscorecheck/aggregated/_check_aggregated_scores.py +++ b/mlscorecheck/aggregated/_check_aggregated_scores.py @@ -77,7 +77,7 @@ def check_aggregated_scores(*, solver = pl.getSolver(solver_name, timeLimit=timeout, msg=verbosity, - options=[f"RandomS 1", f"RandomC 1"]) + options=["RandomS 1", "RandomC 1"]) result = solve(experiment, scores, eps, solver) From d0dc9944e3a118c1566762cd251c75f9b4e66c09 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sun, 5 Nov 2023 09:57:49 +0100 Subject: [PATCH 34/40] smaller test --- mlscorecheck/aggregated/_check_aggregated_scores.py | 2 ++ tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py | 1 + 2 files changed, 3 insertions(+) diff --git a/mlscorecheck/aggregated/_check_aggregated_scores.py b/mlscorecheck/aggregated/_check_aggregated_scores.py index 6e39208..faa00d0 100644 --- a/mlscorecheck/aggregated/_check_aggregated_scores.py +++ b/mlscorecheck/aggregated/_check_aggregated_scores.py @@ -74,6 +74,8 @@ def check_aggregated_scores(*, solver_name = (PREFERRED_SOLVER if solver_name is None or solver_name not in solvers else solver_name) + + print('solver setting') solver = pl.getSolver(solver_name, timeLimit=timeout, msg=verbosity, diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py index f466aff..1da44b5 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -20,6 +20,7 @@ def test_consistent(random_seed: int): random_state=random_seed, average='macro', aggregation='mos', + max_class_size=100, rounding_decimals=4, #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] ) From 23beb91d54ed1487dc9a4ca50f8c284243c5c700 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sun, 5 Nov 2023 09:58:11 +0100 Subject: [PATCH 35/40] print removed --- mlscorecheck/aggregated/_check_aggregated_scores.py | 1 - 1 file changed, 1 deletion(-) diff --git a/mlscorecheck/aggregated/_check_aggregated_scores.py b/mlscorecheck/aggregated/_check_aggregated_scores.py index faa00d0..c38a6cf 100644 --- a/mlscorecheck/aggregated/_check_aggregated_scores.py +++ b/mlscorecheck/aggregated/_check_aggregated_scores.py @@ -75,7 +75,6 @@ def check_aggregated_scores(*, else solver_name) - print('solver setting') solver = pl.getSolver(solver_name, timeLimit=timeout, msg=verbosity, From c699e4035b5dc6e1e7dae3ce96c9a0c115531a08 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Sun, 5 Nov 2023 10:44:43 +0100 Subject: [PATCH 36/40] black formatting --- .flake8 | 2 + .../aggregated/_check_aggregated_scores.py | 118 ++-- mlscorecheck/aggregated/_dataset.py | 48 +- mlscorecheck/aggregated/_evaluation.py | 111 ++-- mlscorecheck/aggregated/_experiment.py | 146 ++--- mlscorecheck/aggregated/_fold.py | 79 +-- mlscorecheck/aggregated/_fold_enumeration.py | 245 +++++---- mlscorecheck/aggregated/_folding.py | 84 +-- mlscorecheck/aggregated/_folding_utils.py | 111 ++-- mlscorecheck/aggregated/_generate_problems.py | 438 ++++++++------- .../aggregated/_linear_programming.py | 52 +- mlscorecheck/aggregated/_utils.py | 35 +- .../binary/_check_1_dataset_kfold_som.py | 45 +- .../_check_1_dataset_known_folds_mos.py | 60 ++- .../_check_1_dataset_unknown_folds_mos.py | 97 ++-- .../check/binary/_check_1_testset_no_kfold.py | 84 +-- .../binary/_check_n_datasets_mos_kfold_som.py | 67 ++- .../_check_n_datasets_mos_known_folds_mos.py | 67 ++- ..._check_n_datasets_mos_unknown_folds_mos.py | 100 ++-- .../binary/_check_n_datasets_som_kfold_som.py | 43 +- .../binary/_check_n_testsets_mos_no_kfold.py | 74 ++- .../binary/_check_n_testsets_som_no_kfold.py | 55 +- .../_check_1_dataset_known_folds_mos_macro.py | 70 +-- .../_check_1_dataset_known_folds_mos_micro.py | 61 ++- .../_check_1_dataset_known_folds_som_macro.py | 45 +- .../_check_1_dataset_known_folds_som_micro.py | 31 +- .../_check_1_testset_no_kfold_macro.py | 49 +- .../_check_1_testset_no_kfold_micro.py | 37 +- .../check/regression/_check_regression.py | 127 +++-- mlscorecheck/core/_dict.py | 5 +- mlscorecheck/core/_load_json.py | 5 +- mlscorecheck/core/_numerical_tolerance.py | 18 +- mlscorecheck/core/_random_state.py | 5 +- mlscorecheck/core/_rounding.py | 8 +- mlscorecheck/core/_safe_eval.py | 10 +- mlscorecheck/experiments/_load_datasets.py | 43 +- mlscorecheck/experiments/_load_experiments.py | 107 ++-- mlscorecheck/individual/_check_scores_tptn.py | 444 +++++++++------ mlscorecheck/individual/_complex_interval.py | 16 +- mlscorecheck/individual/_expression.py | 25 +- mlscorecheck/individual/_interval.py | 139 +++-- mlscorecheck/individual/_pair_solutions.py | 99 ++-- mlscorecheck/individual/_problem_generator.py | 150 +++--- .../individual/_tptn_solution_bundles.py | 215 ++++---- mlscorecheck/individual/_utils.py | 61 ++- mlscorecheck/symbolic/_algebra.py | 4 +- mlscorecheck/symbolic/_availability.py | 8 +- mlscorecheck/symbolic/_sage_algebra.py | 162 +++--- mlscorecheck/symbolic/_score_objects.py | 353 ++++++------ mlscorecheck/symbolic/_solver.py | 171 +++--- mlscorecheck/symbolic/_symbols.py | 43 +- mlscorecheck/symbolic/_sympy_algebra.py | 12 +- tests/aggregated/_evaluate_lp.py | 15 +- .../test_check_aggregated_scores.py | 400 +++++++------- tests/aggregated/test_dataset.py | 11 +- tests/aggregated/test_evaluation.py | 224 ++++---- tests/aggregated/test_experiment.py | 290 +++++----- tests/aggregated/test_fold.py | 50 +- tests/aggregated/test_folding.py | 24 +- tests/aggregated/test_folding_utils.py | 240 ++++++--- tests/aggregated/test_generate_problems.py | 32 +- tests/aggregated/test_linear_programming.py | 27 +- tests/aggregated/test_utils.py | 22 +- .../test_1_dataset_known_folds_mos_scores.py | 142 ++--- .../check/binary/test_1_dataset_som_scores.py | 78 +-- ...test_1_dataset_unknown_folds_mos_scores.py | 97 ++-- .../binary/test_1_testset_no_kfold_scores.py | 91 ++-- .../test_n_datasets_mos_kfold_som_scores.py | 138 +++-- ...t_n_datasets_mos_known_folds_mos_scores.py | 140 ++--- ...n_datasets_mos_unknown_folds_mos_scores.py | 155 +++--- .../test_n_datasets_som_kfold_som_scores.py | 65 ++- .../test_n_testsets_mos_no_kfold_scores.py | 74 +-- .../test_n_testsets_som_no_kfold_scores.py | 74 +-- tests/check/bundles/test_isic2016.py | 28 +- tests/check/bundles/test_isic2017.py | 83 +-- tests/check/bundles/test_retina_chasedb1.py | 198 +++---- tests/check/bundles/test_retina_diaretdb0.py | 124 +++-- tests/check/bundles/test_retina_diaretdb1.py | 510 ++++++++++-------- tests/check/bundles/test_retina_drishti_gs.py | 235 ++++---- tests/check/bundles/test_retina_drive.py | 192 +++---- tests/check/bundles/test_retina_hrf.py | 170 +++--- tests/check/bundles/test_retina_stare.py | 198 +++---- tests/check/bundles/test_tpehg.py | 13 +- .../test_1_dataset_known_folds_mos_macro.py | 65 ++- .../test_1_dataset_known_folds_mos_micro.py | 57 +- .../test_1_dataset_known_folds_som_macro.py | 47 +- .../test_1_dataset_known_folds_som_micro.py | 46 +- .../test_1_testset_no_kfold_macro.py | 61 +-- .../test_1_testset_no_kfold_micro.py | 58 +- .../test_check_1_testset_no_kfold.py | 54 +- tests/core/test_dict.py | 14 +- tests/core/test_numerical_uncertainty.py | 11 +- tests/core/test_random_state.py | 1 + tests/core/test_rounding.py | 9 +- tests/core/test_safe_eval.py | 15 +- tests/experiments/test_load_datasets.py | 35 +- tests/experiments/test_load_experiments.py | 67 ++- tests/individual/test_check_tptn_solutions.py | 199 ++++--- tests/individual/test_complex_interval.py | 7 +- tests/individual/test_expression.py | 5 +- tests/individual/test_interval.py | 269 +++++---- tests/individual/test_pair_solutions.py | 144 +++-- tests/individual/test_problem_generator.py | 64 ++- tests/individual/test_tptn_solutions.py | 97 ++-- tests/individual/test_utils.py | 67 ++- tests/scores/test_calculate_scores.py | 33 +- tests/scores/test_multiclass_scores.py | 54 +- tests/scores/test_scores.py | 51 +- tests/symbolic/test_algebra.py | 74 +-- tests/symbolic/test_availability.py | 8 +- tests/symbolic/test_score_objects.py | 30 +- tests/symbolic/test_solver.py | 53 +- 112 files changed, 5949 insertions(+), 4570 deletions(-) create mode 100644 .flake8 diff --git a/.flake8 b/.flake8 new file mode 100644 index 0000000..7da1f96 --- /dev/null +++ b/.flake8 @@ -0,0 +1,2 @@ +[flake8] +max-line-length = 100 diff --git a/mlscorecheck/aggregated/_check_aggregated_scores.py b/mlscorecheck/aggregated/_check_aggregated_scores.py index c38a6cf..29b5dd5 100644 --- a/mlscorecheck/aggregated/_check_aggregated_scores.py +++ b/mlscorecheck/aggregated/_check_aggregated_scores.py @@ -5,27 +5,34 @@ import pulp as pl -from ..core import (logger, NUMERICAL_TOLERANCE, check_uncertainty_and_tolerance, - update_uncertainty) +from ..core import ( + logger, + NUMERICAL_TOLERANCE, + check_uncertainty_and_tolerance, + update_uncertainty, +) from ..individual import resolve_aliases_and_complements from ._experiment import Experiment from ._linear_programming import solve from ._utils import compare_scores, aggregated_scores -__all__ = ['check_aggregated_scores'] +__all__ = ["check_aggregated_scores"] solvers = pl.listSolvers(onlyAvailable=True) -PREFERRED_SOLVER = 'PULP_CBC_CMD' if 'PULP_CBC_CMD' in solvers else solvers[0] - -def check_aggregated_scores(*, - experiment: dict, - scores: dict, - eps, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +PREFERRED_SOLVER = "PULP_CBC_CMD" if "PULP_CBC_CMD" in solvers else solvers[0] + + +def check_aggregated_scores( + *, + experiment: dict, + scores: dict, + eps, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Check aggregated scores @@ -59,26 +66,37 @@ def check_aggregated_scores(*, scores = resolve_aliases_and_complements(scores) if all(score not in aggregated_scores for score in scores): - logger.info('there are no scores suitable for aggregated checks') - return {'inconsistency': False, - 'message': 'no scores suitable for aggregated consistency checks'} - - experiment = Experiment(**experiment) if isinstance(experiment, dict) else experiment - - if experiment.aggregation == 'som' \ - and any(evaluation.aggregation == 'mos' for evaluation in experiment.evaluations): - raise ValueError('experiment level MoS aggregation with dataset level SoM '\ - 'aggregation is an unlikely situation, it is not supported in this high level '\ - 'interface.') - - solver_name = (PREFERRED_SOLVER if solver_name is None or solver_name not in solvers - else solver_name) - - - solver = pl.getSolver(solver_name, - timeLimit=timeout, - msg=verbosity, - options=["RandomS 1", "RandomC 1"]) + logger.info("there are no scores suitable for aggregated checks") + return { + "inconsistency": False, + "message": "no scores suitable for aggregated consistency checks", + } + + experiment = ( + Experiment(**experiment) if isinstance(experiment, dict) else experiment + ) + + if experiment.aggregation == "som" and any( + evaluation.aggregation == "mos" for evaluation in experiment.evaluations + ): + raise ValueError( + "experiment level MoS aggregation with dataset level SoM " + "aggregation is an unlikely situation, it is not supported in this high level " + "interface." + ) + + solver_name = ( + PREFERRED_SOLVER + if solver_name is None or solver_name not in solvers + else solver_name + ) + + solver = pl.getSolver( + solver_name, + timeLimit=timeout, + msg=verbosity, + options=["RandomS 1", "RandomC 1", "randomS 1", "randomC 1"], + ) result = solve(experiment, scores, eps, solver) @@ -88,21 +106,27 @@ def check_aggregated_scores(*, if result.status == 1: # the problem is feasible - comp_flag = compare_scores(scores, populated.scores, eps+numerical_tolerance) - bounds_flag = configuration_details['bounds_flag'] - return {'inconsistency': False, - 'lp_scores': populated.scores, - 'lp_status': 'feasible', - 'lp_configuration_scores_match': comp_flag, - 'lp_configuration_bounds_match': bounds_flag, - 'lp_configuration': configuration_details} + comp_flag = compare_scores(scores, populated.scores, eps + numerical_tolerance) + bounds_flag = configuration_details["bounds_flag"] + return { + "inconsistency": False, + "lp_scores": populated.scores, + "lp_status": "feasible", + "lp_configuration_scores_match": comp_flag, + "lp_configuration_bounds_match": bounds_flag, + "lp_configuration": configuration_details, + } if result.status == 0: # timed out - return {'inconsistency': False, - 'lp_status': 'timeout', - 'lp_configuration': configuration_details} + return { + "inconsistency": False, + "lp_status": "timeout", + "lp_configuration": configuration_details, + } # infeasible - return {'inconsistency': True, - 'lp_status': 'infeasible', - 'lp_configuration': configuration_details} + return { + "inconsistency": True, + "lp_status": "infeasible", + "lp_configuration": configuration_details, + } diff --git a/mlscorecheck/aggregated/_dataset.py b/mlscorecheck/aggregated/_dataset.py index 83eb7e8..9977477 100644 --- a/mlscorecheck/aggregated/_dataset.py +++ b/mlscorecheck/aggregated/_dataset.py @@ -8,17 +8,21 @@ from ..experiments import dataset_statistics -__all__ = ['Dataset'] +__all__ = ["Dataset"] + class Dataset: """ The abstract representation of a dataset """ - def __init__(self, - p: int = None, - n: int = None, - dataset_name: str = None, - identifier: str = None): + + def __init__( + self, + p: int = None, + n: int = None, + dataset_name: str = None, + identifier: str = None, + ): """ Constructor of a dataset @@ -31,11 +35,11 @@ def __init__(self, None) """ if (p is None and n is not None) or (p is not None and n is None): - raise ValueError('specify either p and n or neither of them') - if (p is None and dataset_name is None): - raise ValueError('specify either p and n or the name') - if (p is not None and dataset_name is not None): - raise ValueError('specify either p and n or the name') + raise ValueError("specify either p and n or neither of them") + if p is None and dataset_name is None: + raise ValueError("specify either p and n or the name") + if p is not None and dataset_name is not None: + raise ValueError("specify either p and n or the name") self.p = p self.n = n @@ -44,9 +48,11 @@ def __init__(self, self.resolve_pn() if identifier is None: - self.identifier = (f'{dataset_name}_{random_identifier(3)}' - if dataset_name is not None - else random_identifier(5)) + self.identifier = ( + f"{dataset_name}_{random_identifier(3)}" + if dataset_name is not None + else random_identifier(5) + ) else: self.identifier = identifier @@ -56,8 +62,8 @@ def resolve_pn(self): """ if self.p is None: dataset = dataset_statistics[self.dataset_name] - self.p = dataset['p'] - self.n = dataset['n'] + self.p = dataset["p"] + self.n = dataset["n"] def to_dict(self) -> dict: """ @@ -66,7 +72,9 @@ def to_dict(self) -> dict: Returns: dict: to_dict """ - return {'p': self.p if self.dataset_name is None else None, - 'n': self.n if self.dataset_name is None else None, - 'dataset_name': self.dataset_name, - 'identifier': self.identifier} + return { + "p": self.p if self.dataset_name is None else None, + "n": self.n if self.dataset_name is None else None, + "dataset_name": self.dataset_name, + "identifier": self.identifier, + } diff --git a/mlscorecheck/aggregated/_evaluation.py b/mlscorecheck/aggregated/_evaluation.py index f873976..d62ef89 100644 --- a/mlscorecheck/aggregated/_evaluation.py +++ b/mlscorecheck/aggregated/_evaluation.py @@ -6,20 +6,24 @@ from ._dataset import Dataset from ._folding import Folding -from ..core import (init_random_state, dict_mean, round_scores, - NUMERICAL_TOLERANCE) +from ..core import init_random_state, dict_mean, round_scores, NUMERICAL_TOLERANCE from ..scores import calculate_scores_for_lp from ._utils import check_bounds, aggregated_scores from ._linear_programming import add_bounds + class Evaluation: """ Abstract representation of an evaluation """ - def __init__(self, dataset: dict, - folding: dict, - aggregation: str, - fold_score_bounds: dict = None): + + def __init__( + self, + dataset: dict, + folding: dict, + aggregation: str, + fold_score_bounds: dict = None, + ): """ Constructor of the object @@ -35,16 +39,20 @@ def __init__(self, dataset: dict, self.fold_score_bounds = fold_score_bounds self.aggregation = aggregation - if aggregation == 'som' and fold_score_bounds is not None: - raise ValueError('It is unlikely that fold score bounds are set for a SoM '\ - 'aggregation, therefore, it is not supported.') + if aggregation == "som" and fold_score_bounds is not None: + raise ValueError( + "It is unlikely that fold score bounds are set for a SoM " + "aggregation, therefore, it is not supported." + ) self.folds = self.folding.generate_folds(self.dataset, self.aggregation) - self.figures = {'tp': None, - 'tn': None, - 'p': sum(fold.p for fold in self.folds), - 'n': sum(fold.n for fold in self.folds)} + self.figures = { + "tp": None, + "tn": None, + "p": sum(fold.p for fold in self.folds), + "n": sum(fold.n for fold in self.folds), + } self.scores = None @@ -55,12 +63,14 @@ def to_dict(self) -> dict: Returns: dict: the dictionary representation """ - return {'dataset': self.dataset.to_dict(), - 'folding': self.folding.to_dict(), - 'fold_score_bounds': self.fold_score_bounds, - 'aggregation': self.aggregation} - - def sample_figures(self, random_state = None, score_subset: list = None): + return { + "dataset": self.dataset.to_dict(), + "folding": self.folding.to_dict(), + "fold_score_bounds": self.fold_score_bounds, + "aggregation": self.aggregation, + } + + def sample_figures(self, random_state=None, score_subset: list = None): """ Samples the figures in the evaluation @@ -79,9 +89,9 @@ def sample_figures(self, random_state = None, score_subset: list = None): return self - def calculate_scores(self, - rounding_decimals: int = None, - score_subset: list = None) -> dict: + def calculate_scores( + self, rounding_decimals: int = None, score_subset: list = None + ) -> dict: """ Calculates the scores @@ -99,23 +109,26 @@ def calculate_scores(self, fold.calculate_scores(score_subset=score_subset) if isinstance(self.folds[0].tp, pl.LpVariable): - self.figures['tp'] = pl.lpSum(fold.tp for fold in self.folds) - self.figures['tn'] = pl.lpSum(fold.tn for fold in self.folds) + self.figures["tp"] = pl.lpSum(fold.tp for fold in self.folds) + self.figures["tn"] = pl.lpSum(fold.tn for fold in self.folds) else: - self.figures['tp'] = sum(fold.tp for fold in self.folds) - self.figures['tn'] = sum(fold.tn for fold in self.folds) - - if self.aggregation == 'som': - self.scores = calculate_scores_for_lp(self.figures, score_subset=score_subset) - elif self.aggregation == 'mos': + self.figures["tp"] = sum(fold.tp for fold in self.folds) + self.figures["tn"] = sum(fold.tn for fold in self.folds) + + if self.aggregation == "som": + self.scores = calculate_scores_for_lp( + self.figures, score_subset=score_subset + ) + elif self.aggregation == "mos": self.scores = dict_mean([fold.scores for fold in self.folds]) - return self.scores if rounding_decimals is None else round_scores(self.scores, - rounding_decimals) + return ( + self.scores + if rounding_decimals is None + else round_scores(self.scores, rounding_decimals) + ) - def init_lp(self, - lp_problem: pl.LpProblem, - scores: dict = None) -> pl.LpProblem: + def init_lp(self, lp_problem: pl.LpProblem, scores: dict = None) -> pl.LpProblem: """ Initializes a linear programming problem @@ -141,8 +154,7 @@ def init_lp(self, return lp_problem - def populate(self, - lp_problem: pl.LpProblem): + def populate(self, lp_problem: pl.LpProblem): """ Populates the evaluation with the figures in the solved linear programming problem @@ -157,8 +169,7 @@ def populate(self, return self - def check_bounds(self, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + def check_bounds(self, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: """ Check the bounds in the problem @@ -169,18 +180,20 @@ def check_bounds(self, dict: a summary of the test, with the boolean flag under ``bounds_flag`` indicating the overall results """ - results = {'folds': []} + results = {"folds": []} for fold in self.folds: - tmp = {'fold': fold.to_dict() | {'tp': fold.tp, 'tn': fold.tn}, - 'scores': fold.scores, - 'score_bounds': self.fold_score_bounds} + tmp = { + "fold": fold.to_dict() | {"tp": fold.tp, "tn": fold.tn}, + "scores": fold.scores, + "score_bounds": self.fold_score_bounds, + } if self.fold_score_bounds is not None: - tmp['bounds_flag'] = check_bounds(fold.scores, - self.fold_score_bounds, - numerical_tolerance) + tmp["bounds_flag"] = check_bounds( + fold.scores, self.fold_score_bounds, numerical_tolerance + ) else: - tmp['bounds_flag'] = True - results['folds'].append(tmp) - results['bounds_flag'] = all(fold['bounds_flag'] for fold in results['folds']) + tmp["bounds_flag"] = True + results["folds"].append(tmp) + results["bounds_flag"] = all(fold["bounds_flag"] for fold in results["folds"]) return results diff --git a/mlscorecheck/aggregated/_experiment.py b/mlscorecheck/aggregated/_experiment.py index 46c5de9..f789206 100644 --- a/mlscorecheck/aggregated/_experiment.py +++ b/mlscorecheck/aggregated/_experiment.py @@ -4,8 +4,7 @@ import pulp as pl -from ..core import (init_random_state, dict_mean, round_scores, - NUMERICAL_TOLERANCE) +from ..core import init_random_state, dict_mean, round_scores, NUMERICAL_TOLERANCE from ..scores import calculate_scores_for_lp from ._evaluation import Evaluation @@ -13,16 +12,17 @@ from ._utils import check_bounds, aggregated_scores from ._linear_programming import add_bounds -__all__ = ['Experiment'] +__all__ = ["Experiment"] + class Experiment: """ Abstract representation of an experiment """ - def __init__(self, - evaluations: list, - aggregation: str, - dataset_score_bounds: dict = None): + + def __init__( + self, evaluations: list, aggregation: str, dataset_score_bounds: dict = None + ): """ Constructor of the experiment @@ -35,14 +35,18 @@ def __init__(self, self.dataset_score_bounds = dataset_score_bounds self.aggregation = aggregation - if aggregation == 'som' and dataset_score_bounds is not None: - raise ValueError('It is unlikely that fold score bounds are set for a SoM '\ - 'aggregation, therefore, it is not supported.') + if aggregation == "som" and dataset_score_bounds is not None: + raise ValueError( + "It is unlikely that fold score bounds are set for a SoM " + "aggregation, therefore, it is not supported." + ) - self.figures = {'tp': None, - 'tn': None, - 'p': sum(evaluation.figures['p'] for evaluation in self.evaluations), - 'n': sum(evaluation.figures['n'] for evaluation in self.evaluations)} + self.figures = { + "tp": None, + "tn": None, + "p": sum(evaluation.figures["p"] for evaluation in self.evaluations), + "n": sum(evaluation.figures["n"] for evaluation in self.evaluations), + } self.scores = None @@ -53,11 +57,13 @@ def to_dict(self) -> dict: Returns: dict: the dictionary representation of the object """ - return {'evaluations': [evaluation.to_dict() for evaluation in self.evaluations], - 'dataset_score_bounds': self.dataset_score_bounds, - 'aggregation': self.aggregation} + return { + "evaluations": [evaluation.to_dict() for evaluation in self.evaluations], + "dataset_score_bounds": self.dataset_score_bounds, + "aggregation": self.aggregation, + } - def sample_figures(self, random_state = None, score_subset: list = None): + def sample_figures(self, random_state=None, score_subset: list = None): """ Samples the ``tp`` and ``tn`` figures @@ -76,9 +82,9 @@ def sample_figures(self, random_state = None, score_subset: list = None): return self - def calculate_scores(self, - rounding_decimals: int = None, - score_subset: list = None) -> dict: + def calculate_scores( + self, rounding_decimals: int = None, score_subset: list = None + ) -> dict: """ Calculates the scores @@ -89,35 +95,47 @@ def calculate_scores(self, Returns: dict(str,float): the scores """ - score_subset = ['acc', 'sens', 'spec', 'bacc'] if score_subset is None else score_subset - score_subset = [score for score in score_subset if score in ['acc', 'sens', 'spec', 'bacc']] + score_subset = ( + ["acc", "sens", "spec", "bacc"] if score_subset is None else score_subset + ) + score_subset = [ + score for score in score_subset if score in ["acc", "sens", "spec", "bacc"] + ] for evaluation in self.evaluations: evaluation.calculate_scores(score_subset=score_subset) if isinstance(self.evaluations[0].folds[0].tp, pl.LpVariable): - self.figures['tp'] = pl.lpSum(evaluation.figures['tp'] - for evaluation in self.evaluations) - self.figures['tn'] = pl.lpSum(evaluation.figures['tn'] - for evaluation in self.evaluations) + self.figures["tp"] = pl.lpSum( + evaluation.figures["tp"] for evaluation in self.evaluations + ) + self.figures["tn"] = pl.lpSum( + evaluation.figures["tn"] for evaluation in self.evaluations + ) else: - self.figures['tp'] = sum(evaluation.figures['tp'] - for evaluation in self.evaluations) - self.figures['tn'] = sum(evaluation.figures['tn'] - for evaluation in self.evaluations) - - if self.aggregation == 'som': - self.scores = calculate_scores_for_lp(self.figures, - score_subset=score_subset) - elif self.aggregation == 'mos': - self.scores = dict_mean([evaluation.scores for evaluation in self.evaluations]) - - return self.scores if rounding_decimals is None else round_scores(self.scores, - rounding_decimals) - - def init_lp(self, - lp_problem: pl.LpProblem, - scores: dict = None) -> pl.LpProblem: + self.figures["tp"] = sum( + evaluation.figures["tp"] for evaluation in self.evaluations + ) + self.figures["tn"] = sum( + evaluation.figures["tn"] for evaluation in self.evaluations + ) + + if self.aggregation == "som": + self.scores = calculate_scores_for_lp( + self.figures, score_subset=score_subset + ) + elif self.aggregation == "mos": + self.scores = dict_mean( + [evaluation.scores for evaluation in self.evaluations] + ) + + return ( + self.scores + if rounding_decimals is None + else round_scores(self.scores, rounding_decimals) + ) + + def init_lp(self, lp_problem: pl.LpProblem, scores: dict = None) -> pl.LpProblem: """ Initializes a linear programming problem @@ -130,8 +148,7 @@ def init_lp(self, """ for evaluation in self.evaluations: - evaluation.init_lp(lp_problem, - scores=scores) + evaluation.init_lp(lp_problem, scores=scores) score_subset = aggregated_scores if scores is not None: @@ -140,10 +157,12 @@ def init_lp(self, self.calculate_scores(score_subset=score_subset) for evaluation in self.evaluations: - add_bounds(lp_problem, - evaluation.scores, - self.dataset_score_bounds, - evaluation.dataset.identifier) + add_bounds( + lp_problem, + evaluation.scores, + self.dataset_score_bounds, + evaluation.dataset.identifier, + ) return lp_problem @@ -174,21 +193,24 @@ def check_bounds(self, numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict indicating the overall results """ - results = {'evaluations': []} + results = {"evaluations": []} for evaluation in self.evaluations: - tmp = {'folds': evaluation.check_bounds(numerical_tolerance), - 'scores': evaluation.scores, - 'score_bounds': self.dataset_score_bounds} + tmp = { + "folds": evaluation.check_bounds(numerical_tolerance), + "scores": evaluation.scores, + "score_bounds": self.dataset_score_bounds, + } if self.dataset_score_bounds is not None: - tmp['bounds_flag'] = check_bounds(evaluation.scores, - self.dataset_score_bounds, - numerical_tolerance) - tmp['bounds_flag'] = tmp['bounds_flag'] and tmp['folds']['bounds_flag'] + tmp["bounds_flag"] = check_bounds( + evaluation.scores, self.dataset_score_bounds, numerical_tolerance + ) + tmp["bounds_flag"] = tmp["bounds_flag"] and tmp["folds"]["bounds_flag"] else: - tmp['bounds_flag'] = tmp['folds'] - results['evaluations'].append(tmp) + tmp["bounds_flag"] = tmp["folds"] + results["evaluations"].append(tmp) - results['bounds_flag'] = all(evaluation['bounds_flag'] - for evaluation in results['evaluations']) + results["bounds_flag"] = all( + evaluation["bounds_flag"] for evaluation in results["evaluations"] + ) return results diff --git a/mlscorecheck/aggregated/_fold.py b/mlscorecheck/aggregated/_fold.py index aec8bc0..65beaaf 100644 --- a/mlscorecheck/aggregated/_fold.py +++ b/mlscorecheck/aggregated/_fold.py @@ -9,21 +9,20 @@ import pulp as pl -from ..core import (init_random_state, round_scores) +from ..core import init_random_state, round_scores from ..scores import calculate_scores_for_lp from ._utils import random_identifier, aggregated_scores -__all__ = ['Fold'] +__all__ = ["Fold"] + class Fold: """ Abstract representation of a fold """ - def __init__(self, - p: int, - n: int, - identifier: str = None): + + def __init__(self, p: int, n: int, identifier: str = None): """ Constructor of a fold @@ -40,8 +39,10 @@ def __init__(self, self.tn = None self.scores = None - self.variable_names = {'tp': f'tp_{self.identifier}'.replace('-', '_'), - 'tn': f'tn_{self.identifier}'.replace('-', '_')} + self.variable_names = { + "tp": f"tp_{self.identifier}".replace("-", "_"), + "tn": f"tn_{self.identifier}".replace("-", "_"), + } def to_dict(self) -> dict: """ @@ -50,11 +51,9 @@ def to_dict(self) -> dict: Returns: dict: the dictionary representation """ - return {'p': self.p, - 'n': self.n, - 'identifier': self.identifier} + return {"p": self.p, "n": self.n, "identifier": self.identifier} - def sample_figures(self, random_state = None): + def sample_figures(self, random_state=None): """ Samples the ``tp`` and ``tn`` figures @@ -66,14 +65,14 @@ def sample_figures(self, random_state = None): """ random_state = init_random_state(random_state) - self.tp = random_state.randint(self.p+1) - self.tn = random_state.randint(self.n+1) + self.tp = random_state.randint(self.p + 1) + self.tn = random_state.randint(self.n + 1) return self - def calculate_scores(self, - rounding_decimals: int = None, - score_subset: list = None) -> dict: + def calculate_scores( + self, rounding_decimals: int = None, score_subset: list = None + ) -> dict: """ Calculate the scores for the fold @@ -86,14 +85,16 @@ def calculate_scores(self, """ score_subset = score_subset if score_subset is not None else aggregated_scores - self.scores = calculate_scores_for_lp({'p': self.p, - 'n': self.n, - 'tp': self.tp, - 'tn': self.tn}, - score_subset=score_subset) + self.scores = calculate_scores_for_lp( + {"p": self.p, "n": self.n, "tp": self.tp, "tn": self.tn}, + score_subset=score_subset, + ) - return self.scores if rounding_decimals is None else round_scores(self.scores, - rounding_decimals) + return ( + self.scores + if rounding_decimals is None + else round_scores(self.scores, rounding_decimals) + ) def set_initial_values(self, scores): """ @@ -102,17 +103,17 @@ def set_initial_values(self, scores): Args: scores (dict): the dictionary of scores """ - if 'acc' in scores: - tp_init = scores['acc'] * self.p - tn_init = scores['acc'] * self.n - if 'bacc' in scores: - tp_init = scores['bacc'] * self.p - tn_init = scores['bacc'] * self.n - - if 'sens' in scores: - tp_init = scores['sens'] * self.p - if 'spec' in scores: - tn_init = scores['spec'] * self.n + if "acc" in scores: + tp_init = scores["acc"] * self.p + tn_init = scores["acc"] * self.n + if "bacc" in scores: + tp_init = scores["bacc"] * self.p + tn_init = scores["bacc"] * self.n + + if "sens" in scores: + tp_init = scores["sens"] * self.p + if "spec" in scores: + tn_init = scores["spec"] * self.n self.tp.setInitialValue(int(tp_init)) self.tn.setInitialValue(int(tn_init)) @@ -127,8 +128,8 @@ def init_lp(self, scores: dict = None): Returns: pl.LpProblem: the updated problem """ - self.tp = pl.LpVariable(self.variable_names['tp'], 0, self.p, pl.LpInteger) - self.tn = pl.LpVariable(self.variable_names['tn'], 0, self.n, pl.LpInteger) + self.tp = pl.LpVariable(self.variable_names["tp"], 0, self.p, pl.LpInteger) + self.tn = pl.LpVariable(self.variable_names["tn"], 0, self.n, pl.LpInteger) if scores is not None: self.set_initial_values(scores) @@ -150,9 +151,9 @@ def populate(self, lp_problem: pl.LpProblem) -> pl.LpProblem: obj: the self object populated with the ``tp`` and ``tn`` scores """ for variable in lp_problem.variables(): - if variable.name == self.variable_names['tp']: + if variable.name == self.variable_names["tp"]: self.tp = variable.varValue - if variable.name == self.variable_names['tn']: + if variable.name == self.variable_names["tn"]: self.tn = variable.varValue return self diff --git a/mlscorecheck/aggregated/_fold_enumeration.py b/mlscorecheck/aggregated/_fold_enumeration.py index 333750f..9af33be 100644 --- a/mlscorecheck/aggregated/_fold_enumeration.py +++ b/mlscorecheck/aggregated/_fold_enumeration.py @@ -9,16 +9,19 @@ from ..experiments import dataset_statistics from ._utils import random_identifier -__all__ = ['integer_partitioning_generator', - 'all_integer_partitioning_generator', - 'fold_partitioning_generator', - 'determine_min_max_p', - 'kfolds_generator', - 'repeated_kfolds_generator', - 'experiment_kfolds_generator', - '_check_specification_and_determine_p_n'] - -def integer_partitioning_generator(n: int, m: int): # pylint: disable=invalid-name +__all__ = [ + "integer_partitioning_generator", + "all_integer_partitioning_generator", + "fold_partitioning_generator", + "determine_min_max_p", + "kfolds_generator", + "repeated_kfolds_generator", + "experiment_kfolds_generator", + "_check_specification_and_determine_p_n", +] + + +def integer_partitioning_generator(n: int, m: int): # pylint: disable=invalid-name """ Integer partitioning generator @@ -32,41 +35,44 @@ def integer_partitioning_generator(n: int, m: int): # pylint: disable=invalid-na Yields: list: the next configuration """ - x = [0] * (m+1) # pylint: disable=invalid-name - s = [0] * (m+1) # pylint: disable=invalid-name + x = [0] * (m + 1) # pylint: disable=invalid-name + s = [0] * (m + 1) # pylint: disable=invalid-name - for k in range(1, m): # pylint: disable=invalid-name + for k in range(1, m): # pylint: disable=invalid-name x[k] = 1 x[m] = n - m + 1 - for k in range(1, m + 1): # pylint: disable=invalid-name - s[k] = x[k] + s[k-1] + for k in range(1, m + 1): # pylint: disable=invalid-name + s[k] = x[k] + s[k - 1] while True: yield x[1:] - u = x[m] # pylint: disable=invalid-name - k = m # pylint: disable=invalid-name + u = x[m] # pylint: disable=invalid-name + k = m # pylint: disable=invalid-name while k > 0: - k -= 1 # pylint: disable=invalid-name + k -= 1 # pylint: disable=invalid-name if x[k] + 2 <= u: break if k == 0: return - f = x[k] + 1 # pylint: disable=invalid-name - s_ = s[k-1] # pylint: disable=invalid-name + f = x[k] + 1 # pylint: disable=invalid-name + s_ = s[k - 1] # pylint: disable=invalid-name while k < m: x[k] = f - s_ += f # pylint: disable=invalid-name + s_ += f # pylint: disable=invalid-name s[k] = s_ - k += 1 # pylint: disable=invalid-name + k += 1 # pylint: disable=invalid-name - x[m] = n - s[m-1] + x[m] = n - s[m - 1] -def all_integer_partitioning_generator(n, k, non_zero, max_count): # pylint: disable=invalid-name + +def all_integer_partitioning_generator( + n, k, non_zero, max_count +): # pylint: disable=invalid-name """ Generate all integer partitioning of n to k parts (including 0 parts) @@ -84,11 +90,12 @@ def all_integer_partitioning_generator(n, k, non_zero, max_count): # pylint: dis else: lower_bound = min(k, n) if non_zero else 1 upper_bound = min(k, n) - for m in range(lower_bound, upper_bound + 1):# pylint: disable=invalid-name + for m in range(lower_bound, upper_bound + 1): # pylint: disable=invalid-name for positives in integer_partitioning_generator(n, m): if all(pos <= max_count for pos in positives): yield [0] * (k - m) + positives + def not_enough_diverse_folds(p_values, n_values): """ Checks if there are enough folds with positive and negative samples @@ -101,10 +108,15 @@ def not_enough_diverse_folds(p_values, n_values): bool: True, if the configuration is incorrect, False otherwise """ - return (len(p_values) > 1 and (sum(p_tmp > 0 for p_tmp in p_values) < 2 - or sum(n_tmp > 0 for n_tmp in n_values) < 2)) + return len(p_values) > 1 and ( + sum(p_tmp > 0 for p_tmp in p_values) < 2 + or sum(n_tmp > 0 for n_tmp in n_values) < 2 + ) + -def determine_min_max_p(*, p, n, k_a, k_b, c_a, p_non_zero, n_non_zero): # pylint: disable=too-many-locals +def determine_min_max_p( + *, p, n, k_a, k_b, c_a, p_non_zero, n_non_zero +): # pylint: disable=too-many-locals """ Determines the minimum and maximum number of positives that can appear in folds of type A @@ -125,12 +137,15 @@ def determine_min_max_p(*, p, n, k_a, k_b, c_a, p_non_zero, n_non_zero): # pylin total_a = k_a * c_a - min_p_a = max(p_non_zero*k_a, total_a - (n - n_non_zero*k_b)) - max_p_a = min(p - p_non_zero*k_b, total_a - n_non_zero*k_a) + min_p_a = max(p_non_zero * k_a, total_a - (n - n_non_zero * k_b)) + max_p_a = min(p - p_non_zero * k_b, total_a - n_non_zero * k_a) return min_p_a, max_p_a -def fold_partitioning_generator(*, p, n, k, p_non_zero=True, n_non_zero=True, p_min=-1): #pylint: disable=invalid-name,too-many-locals + +def fold_partitioning_generator( + *, p, n, k, p_non_zero=True, n_non_zero=True, p_min=-1 +): # pylint: disable=invalid-name,too-many-locals """ Generates the fold partitioning @@ -152,26 +167,30 @@ def fold_partitioning_generator(*, p, n, k, p_non_zero=True, n_non_zero=True, p_ c_a = k_div + 1 c_b = k_div - min_p_a, max_p_a = determine_min_max_p(p=p, - n=n, - k_a=k_a, - k_b=k_b, - c_a=c_a, - p_non_zero=p_non_zero, - n_non_zero=n_non_zero) + min_p_a, max_p_a = determine_min_max_p( + p=p, + n=n, + k_a=k_a, + k_b=k_b, + c_a=c_a, + p_non_zero=p_non_zero, + n_non_zero=n_non_zero, + ) for p_a in range(min_p_a, max_p_a + 1): p_b = p - p_a - for ps_a in all_integer_partitioning_generator(p_a, k_a, p_non_zero, c_a - n_non_zero): - + for ps_a in all_integer_partitioning_generator( + p_a, k_a, p_non_zero, c_a - n_non_zero + ): if any(p_tmp < p_min for p_tmp in ps_a): continue ns_a = [c_a - tmp for tmp in ps_a] - for ps_b in all_integer_partitioning_generator(p_b, k_b, p_non_zero, c_b - n_non_zero): - + for ps_b in all_integer_partitioning_generator( + p_b, k_b, p_non_zero, c_b - n_non_zero + ): if any(p_tmp < p_min for p_tmp in ps_b): continue @@ -185,6 +204,7 @@ def fold_partitioning_generator(*, p, n, k, p_non_zero=True, n_non_zero=True, p_ yield ps_all, ns_all + def _check_specification_and_determine_p_n(dataset: dict, folding: dict) -> (int, int): """ Checking if the dataset specification is correct and determining the p and n values @@ -199,24 +219,30 @@ def _check_specification_and_determine_p_n(dataset: dict, folding: dict) -> (int Raises: ValueError: if the specification is not suitable """ - if folding.get('folds') is not None: + if folding.get("folds") is not None: raise ValueError('do not specify the "folds" key for the generation of folds') - if (dataset.get('p') is not None and dataset.get('n') is None)\ - or (dataset.get('p') is None and dataset.get('n') is not None): + if (dataset.get("p") is not None and dataset.get("n") is None) or ( + dataset.get("p") is None and dataset.get("n") is not None + ): raise ValueError('either specify both "p" and "n" or None of them') - if dataset.get('dataset_name') is not None and dataset.get('p') is not None: + if dataset.get("dataset_name") is not None and dataset.get("p") is not None: raise ValueError('either specify "dataset_name" or "p" and "n"') - p = (dataset_statistics[dataset['dataset_name']]["p"] - if dataset.get('dataset_name') is not None else dataset["p"]) - n = (dataset_statistics[dataset['dataset_name']]["n"] - if dataset.get('dataset_name') is not None else dataset["n"]) + p = ( + dataset_statistics[dataset["dataset_name"]]["p"] + if dataset.get("dataset_name") is not None + else dataset["p"] + ) + n = ( + dataset_statistics[dataset["dataset_name"]]["n"] + if dataset.get("dataset_name") is not None + else dataset["n"] + ) return p, n -def kfolds_generator(evaluation: dict, - available_scores: list, - repeat_idx=0): + +def kfolds_generator(evaluation: dict, available_scores: list, repeat_idx=0): """ Generates the fold configurations @@ -231,37 +257,51 @@ def kfolds_generator(evaluation: dict, Yields: list(dict): the list of fold specifications """ - p, n = _check_specification_and_determine_p_n(evaluation.get('dataset'), - evaluation.get('folding')) + p, n = _check_specification_and_determine_p_n( + evaluation.get("dataset"), evaluation.get("folding") + ) p_zero = False n_zero = False - if 'sens' not in available_scores and 'bacc' not in available_scores: + if "sens" not in available_scores and "bacc" not in available_scores: p_zero = True - logger.info('sens and bacc not among the reported scores, p=0 folds are also considered') - if 'spec' not in available_scores and 'bacc' not in available_scores: + logger.info( + "sens and bacc not among the reported scores, p=0 folds are also considered" + ) + if "spec" not in available_scores and "bacc" not in available_scores: n_zero = True - logger.info('spec and bacc not among the reported scores, n=0 folds are also considered') - - if evaluation['dataset'].get('dataset_name') is not None: - evaluation['dataset']['identifier'] = \ - f'{evaluation["dataset"]["dataset_name"]}_{random_identifier(3)}' + logger.info( + "spec and bacc not among the reported scores, n=0 folds are also considered" + ) + + if evaluation["dataset"].get("dataset_name") is not None: + evaluation["dataset"][ + "identifier" + ] = f'{evaluation["dataset"]["dataset_name"]}_{random_identifier(3)}' else: - evaluation['dataset']['identifier'] = random_identifier(6) - - for jdx, (p_vals, n_vals) in enumerate(fold_partitioning_generator(p=p, - n=n, - k=evaluation['folding'].get('n_folds', 1), - p_non_zero=not p_zero, - n_non_zero=not n_zero)): - yield [{'p': p_, - 'n': n_, - 'identifier': f"{evaluation['dataset']['identifier']}_f{idx}_k{jdx}_r{repeat_idx}"} - for idx, (p_, n_) in enumerate(zip(p_vals, n_vals))] - -def repeated_kfolds_generator(evaluation: dict, - available_scores: list): + evaluation["dataset"]["identifier"] = random_identifier(6) + + for jdx, (p_vals, n_vals) in enumerate( + fold_partitioning_generator( + p=p, + n=n, + k=evaluation["folding"].get("n_folds", 1), + p_non_zero=not p_zero, + n_non_zero=not n_zero, + ) + ): + yield [ + { + "p": p_, + "n": n_, + "identifier": f"{evaluation['dataset']['identifier']}_f{idx}_k{jdx}_r{repeat_idx}", + } + for idx, (p_, n_) in enumerate(zip(p_vals, n_vals)) + ] + + +def repeated_kfolds_generator(evaluation: dict, available_scores: list): """ Generates the evaluation variations @@ -275,27 +315,32 @@ def repeated_kfolds_generator(evaluation: dict, Yields: dict: one evaluation """ - n_repeats = evaluation['folding'].get('n_repeats', 1) - generators = [kfolds_generator(evaluation, available_scores, idx) for idx in range(n_repeats)] + n_repeats = evaluation["folding"].get("n_repeats", 1) + generators = [ + kfolds_generator(evaluation, available_scores, idx) for idx in range(n_repeats) + ] if n_repeats > 1: - for folds in itertools.product(*generators): - yield {'dataset': copy.deepcopy(evaluation['dataset']), - 'folding': { - 'folds': [fold for fold_list in folds for fold in fold_list]}, - 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), - 'aggregation': evaluation.get('aggregation')} + yield { + "dataset": copy.deepcopy(evaluation["dataset"]), + "folding": { + "folds": [fold for fold_list in folds for fold in fold_list] + }, + "fold_score_bounds": copy.deepcopy(evaluation.get("fold_score_bounds")), + "aggregation": evaluation.get("aggregation"), + } else: for fold_list in generators[0]: - yield {'dataset': copy.deepcopy(evaluation['dataset']), - 'folding': { - 'folds': fold_list}, - 'fold_score_bounds': copy.deepcopy(evaluation.get('fold_score_bounds')), - 'aggregation': evaluation.get('aggregation')} - -def experiment_kfolds_generator(experiment: dict, - available_scores: list): + yield { + "dataset": copy.deepcopy(evaluation["dataset"]), + "folding": {"folds": fold_list}, + "fold_score_bounds": copy.deepcopy(evaluation.get("fold_score_bounds")), + "aggregation": evaluation.get("aggregation"), + } + + +def experiment_kfolds_generator(experiment: dict, available_scores: list): """ Generates the experiment variations @@ -309,9 +354,13 @@ def experiment_kfolds_generator(experiment: dict, Yields: dict: one experiment """ - generators = [repeated_kfolds_generator(evaluation, available_scores) - for evaluation in experiment['evaluations']] + generators = [ + repeated_kfolds_generator(evaluation, available_scores) + for evaluation in experiment["evaluations"] + ] for evaluations in itertools.product(*generators): - yield {'evaluations': list(evaluations), - 'dataset_score_bounds': experiment.get('dataset_score_bounds'), - 'aggregation': experiment['aggregation']} + yield { + "evaluations": list(evaluations), + "dataset_score_bounds": experiment.get("dataset_score_bounds"), + "aggregation": experiment["aggregation"], + } diff --git a/mlscorecheck/aggregated/_folding.py b/mlscorecheck/aggregated/_folding.py index ab0418a..2323542 100644 --- a/mlscorecheck/aggregated/_folding.py +++ b/mlscorecheck/aggregated/_folding.py @@ -7,17 +7,21 @@ from ._dataset import Dataset -__all__ = ['Folding'] +__all__ = ["Folding"] + class Folding: """ Abstract representation of a folding """ - def __init__(self, - n_folds: int = None, - n_repeats: int = None, - folds: list = None, - strategy: str = None): + + def __init__( + self, + n_folds: int = None, + n_repeats: int = None, + folds: list = None, + strategy: str = None, + ): """ Constructor of the folding @@ -28,11 +32,11 @@ def __init__(self, strategy (str): the folding strategy ('stratified_sklearn') """ if (n_folds is not None) and (folds is not None): - raise ValueError('specify either n_folds,n_repeats,strategy or folds') + raise ValueError("specify either n_folds,n_repeats,strategy or folds") if (n_folds is None) and (n_repeats is None) and (folds is None): - raise ValueError('specify either n_folds,strategy or folds') + raise ValueError("specify either n_folds,strategy or folds") if ((folds is None) and (strategy is None)) and (n_folds > 1): - raise ValueError('specify strategy if folds are not set explicitly') + raise ValueError("specify strategy if folds are not set explicitly") self.n_folds = n_folds self.n_repeats = n_repeats if n_repeats is not None else 1 @@ -46,10 +50,12 @@ def to_dict(self) -> dict: Returns: dict: the representation of the folding """ - return {'n_folds': self.n_folds, - 'n_repeats': self.n_repeats, - 'folds': self.folds, - 'strategy': self.strategy} + return { + "n_folds": self.n_folds, + "n_repeats": self.n_repeats, + "folds": self.folds, + "strategy": self.strategy, + } def generate_folds(self, dataset: Dataset, aggregation: str) -> list: """ @@ -69,34 +75,44 @@ def generate_folds(self, dataset: Dataset, aggregation: str) -> list: p = 0 n = 0 for fold in self.folds: - p += fold['p'] - n += fold['n'] + p += fold["p"] + n += fold["n"] - term_a = ((dataset.p != p) and (p % dataset.p != 0)) - term_b = ((dataset.n != n) and (n % dataset.n != 0)) - term_c = (dataset.p > 0 and dataset.n > 0 and (p // dataset.p != n // dataset.n)) + term_a = (dataset.p != p) and (p % dataset.p != 0) + term_b = (dataset.n != n) and (n % dataset.n != 0) + term_c = ( + dataset.p > 0 and dataset.n > 0 and (p // dataset.p != n // dataset.n) + ) if term_a or term_b or term_c: - raise ValueError("The total p and n figures in the folds are not "\ - "multiples of the dataset's p and n figures "\ - f"{p}, {dataset.p}, {n}, {dataset.n}") + raise ValueError( + "The total p and n figures in the folds are not " + "multiples of the dataset's p and n figures " + f"{p}, {dataset.p}, {n}, {dataset.n}" + ) return [Fold(**fold) for fold in self.folds] p, n = dataset.p, dataset.n - if aggregation == 'som': - return [Fold(p=p * self.n_repeats, - n=n * self.n_repeats, - identifier=dataset.identifier)] - - if aggregation == 'mos': - folds = _create_folds(p=p, - n=n, - n_folds=self.n_folds, - n_repeats=self.n_repeats, - folding=self.strategy, - identifier=dataset.identifier) + if aggregation == "som": + return [ + Fold( + p=p * self.n_repeats, + n=n * self.n_repeats, + identifier=dataset.identifier, + ) + ] + + if aggregation == "mos": + folds = _create_folds( + p=p, + n=n, + n_folds=self.n_folds, + n_repeats=self.n_repeats, + folding=self.strategy, + identifier=dataset.identifier, + ) return [Fold(**fold) for fold in folds] - raise ValueError(f'aggregation mode {aggregation} is not supported') + raise ValueError(f"aggregation mode {aggregation} is not supported") diff --git a/mlscorecheck/aggregated/_folding_utils.py b/mlscorecheck/aggregated/_folding_utils.py index 64458b4..8489f24 100644 --- a/mlscorecheck/aggregated/_folding_utils.py +++ b/mlscorecheck/aggregated/_folding_utils.py @@ -10,16 +10,17 @@ from ._utils import random_identifier -__all__ = ['stratified_configurations_sklearn', - 'determine_fold_configurations', - '_create_folds', - 'multiclass_stratified_folds', - 'transform_multiclass_fold_to_binary', - 'create_folds_multiclass'] - -def stratified_configurations_sklearn(p: int, - n: int, - n_splits: int) -> list: +__all__ = [ + "stratified_configurations_sklearn", + "determine_fold_configurations", + "_create_folds", + "multiclass_stratified_folds", + "transform_multiclass_fold_to_binary", + "create_folds_multiclass", +] + + +def stratified_configurations_sklearn(p: int, n: int, n_splits: int) -> list: """ The sklearn stratification strategy @@ -50,11 +51,10 @@ def stratified_configurations_sklearn(p: int, return results -def determine_fold_configurations(p: int, - n: int, - n_folds: int, - n_repeats: int, - folding: str = 'stratified_sklearn') -> list: + +def determine_fold_configurations( + p: int, n: int, n_folds: int, n_repeats: int, folding: str = "stratified_sklearn" +) -> list: """ Determine fold configurations according to a folding @@ -71,21 +71,24 @@ def determine_fold_configurations(p: int, Raises: ValueError: if the folding is not supported """ - if folding != 'stratified_sklearn': - raise ValueError(f'folding strategy {folding} is not supported yet') + if folding != "stratified_sklearn": + raise ValueError(f"folding strategy {folding} is not supported yet") configurations = stratified_configurations_sklearn(p=p, n=n, n_splits=n_folds) - configurations = [{'n': conf[0], 'p': conf[1]} for conf in configurations] + configurations = [{"n": conf[0], "p": conf[1]} for conf in configurations] return [{**item} for item in configurations for _ in range(n_repeats)] -def _create_folds(p: int, - n: int, - *, - n_folds: int = None, - n_repeats: int = None, - folding: str = None, - score_bounds: dict = None, - identifier: str = None) -> list: + +def _create_folds( + p: int, + n: int, + *, + n_folds: int = None, + n_repeats: int = None, + folding: str = None, + score_bounds: dict = None, + identifier: str = None, +) -> list: """ Given a dataset, adds folds to it @@ -106,22 +109,21 @@ def _create_folds(p: int, """ if n_folds == 1: - folds = [{'p': p, - 'n': n, - 'identifier': f'{identifier}_0_r{idx}'} for idx in range(n_repeats)] + folds = [ + {"p": p, "n": n, "identifier": f"{identifier}_0_r{idx}"} + for idx in range(n_repeats) + ] elif folding is None: - folds = [{'p': p * n_repeats, 'n': n * n_repeats, 'identifier': f'{identifier}_0'}] + folds = [ + {"p": p * n_repeats, "n": n * n_repeats, "identifier": f"{identifier}_0"} + ] else: - folds = determine_fold_configurations(p, - n, - n_folds, - n_repeats, - folding) + folds = determine_fold_configurations(p, n, n_folds, n_repeats, folding) n_fold = 0 n_repeat = 0 for fold in folds: - fold['identifier'] = f'{identifier}_{n_repeat}_{n_fold}' + fold["identifier"] = f"{identifier}_{n_repeat}_{n_fold}" n_fold += 1 if n_fold % n_folds == 0: n_fold = 0 @@ -129,10 +131,11 @@ def _create_folds(p: int, for fold in folds: if score_bounds is not None: - fold['score_bounds'] = {**score_bounds} + fold["score_bounds"] = {**score_bounds} return folds + def multiclass_stratified_folds(dataset: dict, n_folds: int) -> list: """ Generating the folds for an sklearn stratified multiclass setup @@ -146,11 +149,14 @@ def multiclass_stratified_folds(dataset: dict, n_folds: int) -> list: """ folds = [] labels = np.hstack([np.repeat(key, value) for key, value in dataset.items()]) - for _, test in StratifiedKFold(n_splits=n_folds).split(labels.reshape(-1, 1), labels, labels): + for _, test in StratifiedKFold(n_splits=n_folds).split( + labels.reshape(-1, 1), labels, labels + ): folds.append(dict(enumerate(np.bincount(labels[test])))) return folds + def transform_multiclass_fold_to_binary(fold: dict) -> list: """ Transforms a multiclass fold specification to a list of binary folds @@ -162,14 +168,15 @@ def transform_multiclass_fold_to_binary(fold: dict) -> list: list(dict): the list of binary folds """ n_total = sum(fold.values()) - folds = [{'p': value, 'n': n_total - value} for value in fold.values()] - identifier = fold.get('identifier', random_identifier(4)) + folds = [{"p": value, "n": n_total - value} for value in fold.values()] + identifier = fold.get("identifier", random_identifier(4)) for idx, fold_ in enumerate(folds): - fold_['identifier'] = f'{identifier}_{idx}' + fold_["identifier"] = f"{identifier}_{idx}" return folds + def create_folds_multiclass(dataset: dict, folding: dict) -> list: """ Create the folds for the multiclass setup @@ -181,19 +188,21 @@ def create_folds_multiclass(dataset: dict, folding: dict) -> list: Returns: list(dict): the list of fold specifications """ - if folding.get('folds') is not None and (folding.get('n_repeats') is not None \ - or folding.get('strategy') is not None - or folding.get('n_folds') is not None): - raise ValueError('either specify the folds or the folding strategy') - - if 'folds' in folding: - return folding['folds'] - if folding.get('strategy') == 'stratified_sklearn': - folds = multiclass_stratified_folds(dataset, folding.get('n_folds', 1)) + if folding.get("folds") is not None and ( + folding.get("n_repeats") is not None + or folding.get("strategy") is not None + or folding.get("n_folds") is not None + ): + raise ValueError("either specify the folds or the folding strategy") + + if "folds" in folding: + return folding["folds"] + if folding.get("strategy") == "stratified_sklearn": + folds = multiclass_stratified_folds(dataset, folding.get("n_folds", 1)) else: folds = [dataset] - n_repeats = folding.get('n_repeats', 1) + n_repeats = folding.get("n_repeats", 1) folds = folds * n_repeats folds = [copy.deepcopy(fold) for fold in folds] diff --git a/mlscorecheck/aggregated/_generate_problems.py b/mlscorecheck/aggregated/_generate_problems.py index f2ea3c9..1cc3833 100644 --- a/mlscorecheck/aggregated/_generate_problems.py +++ b/mlscorecheck/aggregated/_generate_problems.py @@ -5,14 +5,12 @@ import numpy as np -from ..core import (init_random_state, dict_minmax, dict_mean, round_scores) +from ..core import init_random_state, dict_minmax, dict_mean, round_scores from ..experiments import dataset_statistics from ..scores import calculate_scores, calculate_scores_for_lp -from ..individual import (sample_multiclass_dataset, - generate_multiclass_dataset) -from ._folding_utils import (multiclass_stratified_folds, - create_folds_multiclass) +from ..individual import sample_multiclass_dataset, generate_multiclass_dataset +from ._folding_utils import multiclass_stratified_folds, create_folds_multiclass from ..scores import calculate_multiclass_scores @@ -21,19 +19,21 @@ from ._evaluation import Evaluation from ._experiment import Experiment -__all__ = ['generate_dataset', - 'generate_folding', - 'generate_evaluation', - 'generate_experiment', - 'get_fold_score_bounds', - 'get_dataset_score_bounds', - 'generate_scores_for_testsets', - 'generate_dataset_folding_multiclass'] - -def generate_dataset(max_p: int = 500, - max_n: int = 500, - random_state = None, - no_name: bool = False) -> dict: +__all__ = [ + "generate_dataset", + "generate_folding", + "generate_evaluation", + "generate_experiment", + "get_fold_score_bounds", + "get_dataset_score_bounds", + "generate_scores_for_testsets", + "generate_dataset_folding_multiclass", +] + + +def generate_dataset( + max_p: int = 500, max_n: int = 500, random_state=None, no_name: bool = False +) -> dict: """ Generate a random dataset specification @@ -50,19 +50,22 @@ def generate_dataset(max_p: int = 500, random_state = init_random_state(random_state) if random_state.randint(2) == 0 or no_name: - p = random_state.randint(1, max_p+1) - n = random_state.randint(1, max_n+1) - return {'p': p, - 'n': n} - - return {'dataset_name': random_state.choice(list(dataset_statistics.keys()))} - -def generate_folding(*, dataset: dict, - max_folds: int = 10, - max_repeats: int = 5, - strategies: list = None, - random_state = None, - no_folds: bool = False) -> dict: + p = random_state.randint(1, max_p + 1) + n = random_state.randint(1, max_n + 1) + return {"p": p, "n": n} + + return {"dataset_name": random_state.choice(list(dataset_statistics.keys()))} + + +def generate_folding( + *, + dataset: dict, + max_folds: int = 10, + max_repeats: int = 5, + strategies: list = None, + random_state=None, + no_folds: bool = False, +) -> dict: """ Generate a random folding specification for a dataset @@ -79,40 +82,42 @@ def generate_folding(*, dataset: dict, """ random_state = init_random_state(random_state) - strategies = ['stratified_sklearn'] if strategies is None else strategies + strategies = ["stratified_sklearn"] if strategies is None else strategies dataset = Dataset(**dataset) p, n = dataset.p, dataset.n max_folds = min(p, n, max_folds) - n_folds = random_state.randint(1, max_folds+1) - n_repeats = random_state.randint(1, max_repeats+1) + n_folds = random_state.randint(1, max_folds + 1) + n_repeats = random_state.randint(1, max_repeats + 1) strategy = random_state.choice(strategies) if random_state.randint(2) == 0 or no_folds: - return {'n_folds': n_folds, - 'n_repeats': n_repeats, - 'strategy': strategy} - - folding = Folding(n_folds=n_folds, - n_repeats=n_repeats, - strategy=strategy) - - return {'folds': [fold.to_dict() for fold in folding.generate_folds(dataset, 'mos')]} - -def generate_evaluation(*, max_p: int = 500, # pylint: disable=too-many-locals - max_n: int = 500, - max_folds: int = 10, - max_repeats: int = 5, - strategies: list = None, - feasible_fold_score_bounds: bool = None, - aggregation: str = None, - random_state = None, - return_scores: bool = False, - rounding_decimals: int = None, - no_name: bool = False, - no_folds: bool = False, - score_subset: list = None) -> dict: + return {"n_folds": n_folds, "n_repeats": n_repeats, "strategy": strategy} + + folding = Folding(n_folds=n_folds, n_repeats=n_repeats, strategy=strategy) + + return { + "folds": [fold.to_dict() for fold in folding.generate_folds(dataset, "mos")] + } + + +def generate_evaluation( # pylint: disable=too-many-locals + *, + max_p: int = 500, + max_n: int = 500, + max_folds: int = 10, + max_repeats: int = 5, + strategies: list = None, + feasible_fold_score_bounds: bool = None, + aggregation: str = None, + random_state=None, + return_scores: bool = False, + rounding_decimals: int = None, + no_name: bool = False, + no_folds: bool = False, + score_subset: list = None, +) -> dict: """ Generate a random evaluation specification @@ -139,46 +144,55 @@ def generate_evaluation(*, max_p: int = 500, # pylint: disable=too-many-locals """ random_state = init_random_state(random_state) - result = {'dataset': generate_dataset(max_p=max_p, - max_n=max_n, - random_state=random_state, - no_name=no_name)} - result['folding'] = generate_folding(dataset=result['dataset'], - max_folds=max_folds, - max_repeats=max_repeats, - strategies=strategies, - random_state=random_state, - no_folds=no_folds) - - aggregation = aggregation if aggregation is not None else random_state.choice(['som', 'mos']) - - evaluation = Evaluation(dataset=result['dataset'], - folding=result['folding'], - aggregation=aggregation).sample_figures(random_state) - - if aggregation == 'som': - scores = calculate_scores(problem=evaluation.figures | {'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=rounding_decimals) - scores['beta_positive'] = 2 - scores['beta_negative'] = 2 + result = { + "dataset": generate_dataset( + max_p=max_p, max_n=max_n, random_state=random_state, no_name=no_name + ) + } + result["folding"] = generate_folding( + dataset=result["dataset"], + max_folds=max_folds, + max_repeats=max_repeats, + strategies=strategies, + random_state=random_state, + no_folds=no_folds, + ) + + aggregation = ( + aggregation if aggregation is not None else random_state.choice(["som", "mos"]) + ) + + evaluation = Evaluation( + dataset=result["dataset"], folding=result["folding"], aggregation=aggregation + ).sample_figures(random_state) + + if aggregation == "som": + scores = calculate_scores( + problem=evaluation.figures | {"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=rounding_decimals, + ) + scores["beta_positive"] = 2 + scores["beta_negative"] = 2 else: - scores = evaluation.calculate_scores(rounding_decimals, - score_subset=score_subset) + scores = evaluation.calculate_scores( + rounding_decimals, score_subset=score_subset + ) if feasible_fold_score_bounds is None: - result['fold_score_bounds'] = None + result["fold_score_bounds"] = None else: - result['fold_score_bounds'] = get_fold_score_bounds(evaluation, - feasible_fold_score_bounds) + result["fold_score_bounds"] = get_fold_score_bounds( + evaluation, feasible_fold_score_bounds + ) - result['aggregation'] = aggregation + result["aggregation"] = aggregation return (result, scores) if return_scores else result -def get_fold_score_bounds(evaluation: Evaluation, - feasible: bool = True, - numerical_tolerance: float = 1*1e-1) -> dict: + +def get_fold_score_bounds( + evaluation: Evaluation, feasible: bool = True, numerical_tolerance: float = 1 * 1e-1 +) -> dict: """ Extract fold score bounds from an evaluation (sampled and scores computed) @@ -193,8 +207,10 @@ def get_fold_score_bounds(evaluation: Evaluation, score_bounds = dict_minmax([fold.scores for fold in evaluation.folds]) for key, value in score_bounds.items(): - score_bounds[key] = (max(0.0, value[0] - numerical_tolerance), - min(1.0, value[1] + numerical_tolerance)) + score_bounds[key] = ( + max(0.0, value[0] - numerical_tolerance), + min(1.0, value[1] + numerical_tolerance), + ) if feasible: return score_bounds @@ -203,14 +219,18 @@ def get_fold_score_bounds(evaluation: Evaluation, return score_bounds -def generate_experiment(*, max_evaluations: int = 5, - evaluation_params: dict = None, - feasible_dataset_score_bounds: bool = None, - aggregation: str = None, - random_state = None, - return_scores: bool = False, - rounding_decimals: int = None, - score_subset: list = None) -> dict: + +def generate_experiment( + *, + max_evaluations: int = 5, + evaluation_params: dict = None, + feasible_dataset_score_bounds: bool = None, + aggregation: str = None, + random_state=None, + return_scores: bool = False, + rounding_decimals: int = None, + score_subset: list = None, +) -> dict: """ Generate a random experiment specification @@ -235,47 +255,57 @@ def generate_experiment(*, max_evaluations: int = 5, random_state = init_random_state(random_state) - n_evaluations = random_state.randint(1, max_evaluations+1) - - aggregation = (aggregation if aggregation is not None - else random_state.choice(['som', 'mos'])) - - evaluations = [generate_evaluation(**evaluation_params, - random_state=random_state) - for _ in range(n_evaluations)] - - experiment = Experiment(evaluations=evaluations, - aggregation=aggregation).sample_figures(random_state) - if aggregation == 'som': - scores = calculate_scores(problem=experiment.figures | {'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=rounding_decimals) - scores['beta_positive'] = 2 - scores['beta_negative'] = 2 + n_evaluations = random_state.randint(1, max_evaluations + 1) + + aggregation = ( + aggregation if aggregation is not None else random_state.choice(["som", "mos"]) + ) + + evaluations = [ + generate_evaluation(**evaluation_params, random_state=random_state) + for _ in range(n_evaluations) + ] + + experiment = Experiment( + evaluations=evaluations, aggregation=aggregation + ).sample_figures(random_state) + if aggregation == "som": + scores = calculate_scores( + problem=experiment.figures | {"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=rounding_decimals, + ) + scores["beta_positive"] = 2 + scores["beta_negative"] = 2 else: - scores = experiment.calculate_scores(rounding_decimals, - score_subset=score_subset) + scores = experiment.calculate_scores( + rounding_decimals, score_subset=score_subset + ) - if evaluation_params.get('feasible_fold_score_bounds') is not None: + if evaluation_params.get("feasible_fold_score_bounds") is not None: for idx, evaluation in enumerate(experiment.evaluations): - evaluations[idx]['fold_score_bounds'] = \ - get_fold_score_bounds(evaluation, - evaluation_params['feasible_fold_score_bounds']) + evaluations[idx]["fold_score_bounds"] = get_fold_score_bounds( + evaluation, evaluation_params["feasible_fold_score_bounds"] + ) if feasible_dataset_score_bounds is None: score_bounds = None else: - score_bounds = get_dataset_score_bounds(experiment, feasible_dataset_score_bounds) + score_bounds = get_dataset_score_bounds( + experiment, feasible_dataset_score_bounds + ) - experiment = {'evaluations': evaluations, - 'aggregation': aggregation, - 'dataset_score_bounds': score_bounds} + experiment = { + "evaluations": evaluations, + "aggregation": aggregation, + "dataset_score_bounds": score_bounds, + } return (experiment, scores) if return_scores else experiment -def get_dataset_score_bounds(experiment: Experiment, - feasible: bool = True, - numerical_tolerance: float = 2*1e-2) -> dict: + +def get_dataset_score_bounds( + experiment: Experiment, feasible: bool = True, numerical_tolerance: float = 2 * 1e-2 +) -> dict: """ Extract fold score bounds from an experiment (sampled and scores computed) @@ -287,10 +317,14 @@ def get_dataset_score_bounds(experiment: Experiment, Returns: dict(str,tuple(float,float)): the score bounds """ - score_bounds = dict_minmax([evaluation.scores for evaluation in experiment.evaluations]) + score_bounds = dict_minmax( + [evaluation.scores for evaluation in experiment.evaluations] + ) for key, value in score_bounds.items(): - score_bounds[key] = (max(0.0, value[0] - numerical_tolerance), - min(1.0, value[1] + numerical_tolerance)) + score_bounds[key] = ( + max(0.0, value[0] - numerical_tolerance), + min(1.0, value[1] + numerical_tolerance), + ) if feasible: return score_bounds @@ -299,11 +333,10 @@ def get_dataset_score_bounds(experiment: Experiment, return score_bounds -def generate_scores_for_testsets(testsets, - rounding_decimals=None, - subset=None, - random_state=None, - aggregation='mos'): + +def generate_scores_for_testsets( + testsets, rounding_decimals=None, subset=None, random_state=None, aggregation="mos" +): """ Sample scores for testsets @@ -320,38 +353,43 @@ def generate_scores_for_testsets(testsets, if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) - subset = subset if subset is not None else ['acc', 'sens', 'spec'] + subset = subset if subset is not None else ["acc", "sens", "spec"] - testsets = [{'p': testset['p'], 'n': testset['n']} for testset in testsets] + testsets = [{"p": testset["p"], "n": testset["n"]} for testset in testsets] for testset in testsets: - testset['tp'] = random_state.randint(testset['p'] + 1) - testset['tn'] = random_state.randint(testset['n'] + 1) + testset["tp"] = random_state.randint(testset["p"] + 1) + testset["tn"] = random_state.randint(testset["n"] + 1) - if aggregation == 'mos': + if aggregation == "mos": scores = [calculate_scores_for_lp(testset) for testset in testsets] scores = round_scores(dict_mean(scores), rounding_decimals=rounding_decimals) return {key: value for key, value in scores.items() if key in subset} mean_figures = dict_mean(testsets) - scores = calculate_scores(mean_figures | {'beta_positive': 2, 'beta_negative': 2}, - rounding_decimals=rounding_decimals, - subset=subset) - - return scores | {'beta_positive': 2, 'beta_negative': 2} - -def generate_dataset_folding_multiclass(*, - random_state=None, - max_n_classes=5, - min_n_classes=3, - max_class_size=200, - min_class_size=10, - max_n_folds=5, - max_n_repeats=3, - average=None, - aggregation=None, - rounding_decimals=None, - subset=None): + scores = calculate_scores( + mean_figures | {"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=rounding_decimals, + subset=subset, + ) + + return scores | {"beta_positive": 2, "beta_negative": 2} + + +def generate_dataset_folding_multiclass( + *, + random_state=None, + max_n_classes=5, + min_n_classes=3, + max_class_size=200, + min_class_size=10, + max_n_folds=5, + max_n_repeats=3, + average=None, + aggregation=None, + rounding_decimals=None, + subset=None, +): """ Generates a multiclass dataset and folding with scores @@ -374,45 +412,61 @@ def generate_dataset_folding_multiclass(*, if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) - if not aggregation in {'mos', 'som'}: - raise ValueError(f'Unknown aggregation: {aggregation}') + if not aggregation in {"mos", "som"}: + raise ValueError(f"Unknown aggregation: {aggregation}") - dataset = generate_multiclass_dataset(random_state=random_state, - max_n_classes=max_n_classes, - min_n_classes=min_n_classes, - max_class_size=max_class_size, - min_class_size=min_class_size) + dataset = generate_multiclass_dataset( + random_state=random_state, + max_n_classes=max_n_classes, + min_n_classes=min_n_classes, + max_class_size=max_class_size, + min_class_size=min_class_size, + ) - folding = {'n_folds': min([min(list(dataset.values())), random_state.randint(2, max_n_folds)])} + folding = { + "n_folds": min( + [min(list(dataset.values())), random_state.randint(2, max_n_folds)] + ) + } if random_state.randint(2) == 0: - folding = folding | {'n_repeats': random_state.randint(1, max_n_repeats), - 'strategy': 'stratified_sklearn'} + folding = folding | { + "n_repeats": random_state.randint(1, max_n_repeats), + "strategy": "stratified_sklearn", + } elif random_state.randint(2) == 0: - folding = \ - {'folds': multiclass_stratified_folds(dataset=dataset, - n_folds=folding['n_folds'])} + folding = { + "folds": multiclass_stratified_folds( + dataset=dataset, n_folds=folding["n_folds"] + ) + } else: - folding = {'n_folds': 1} - - samples = [sample_multiclass_dataset(dataset=fold, - random_state=random_state) - for fold in create_folds_multiclass(dataset, folding)] - - if aggregation == 'mos': - scores = [calculate_multiclass_scores(sample, - average=average, - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - subset=subset) for sample in samples] + folding = {"n_folds": 1} + + samples = [ + sample_multiclass_dataset(dataset=fold, random_state=random_state) + for fold in create_folds_multiclass(dataset, folding) + ] + + if aggregation == "mos": + scores = [ + calculate_multiclass_scores( + sample, + average=average, + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + subset=subset, + ) + for sample in samples + ] scores = round_scores(dict_mean(scores), rounding_decimals=rounding_decimals) return dataset, folding, scores # if aggregation == 'som': - scores = calculate_multiclass_scores(np.sum(np.array(samples), axis=0), - average=average, - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=rounding_decimals, - subset=subset) - return dataset, folding, scores | {'beta_positive': 2, 'beta_negative': 2} + scores = calculate_multiclass_scores( + np.sum(np.array(samples), axis=0), + average=average, + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=rounding_decimals, + subset=subset, + ) + return dataset, folding, scores | {"beta_positive": 2, "beta_negative": 2} diff --git a/mlscorecheck/aggregated/_linear_programming.py b/mlscorecheck/aggregated/_linear_programming.py index 228cefc..6978504 100644 --- a/mlscorecheck/aggregated/_linear_programming.py +++ b/mlscorecheck/aggregated/_linear_programming.py @@ -9,14 +9,12 @@ from ._utils import random_identifier -__all__ = ['add_bounds', - 'solve', - 'create_lp_target'] - -def add_bounds(lp_problem: pl.LpProblem, - variables: dict, - bounds: dict, - label: str) -> pl.LpProblem: +__all__ = ["add_bounds", "solve", "create_lp_target"] + + +def add_bounds( + lp_problem: pl.LpProblem, variables: dict, bounds: dict, label: str +) -> pl.LpProblem: """ Adding bounds to a linear program @@ -36,26 +34,30 @@ def add_bounds(lp_problem: pl.LpProblem, for variable in bounds: if variable in variables: if bounds[variable][0] is not None and not np.isnan(bounds[variable][0]): - logger.info('%s: adding lower bound %s for %s', - label, str(bounds[variable][0]), variable) + logger.info( + "%s: adding lower bound %s for %s", + label, + str(bounds[variable][0]), + variable, + ) lp_problem += bounds[variable][0] <= variables[variable] else: - logger.info('%s: No lower bound for variable %s', label, variable) + logger.info("%s: No lower bound for variable %s", label, variable) if bounds[variable][1] is not None and not np.isnan(bounds[variable][1]): - logger.info('%s: adding upper bound %s for %s', label, - bounds[variable][1], - variable) + logger.info( + "%s: adding upper bound %s for %s", + label, + bounds[variable][1], + variable, + ) lp_problem += variables[variable] <= bounds[variable][1] else: - logger.info('%s: No upper bound for variable %s', label, variable) + logger.info("%s: No upper bound for variable %s", label, variable) return lp_problem -def create_lp_target(obj, - scores: dict, - eps, - lp_problem: pl.LpProblem) -> pl.LpProblem: +def create_lp_target(obj, scores: dict, eps, lp_problem: pl.LpProblem) -> pl.LpProblem: """ Add the target and the score conditions to the linear programming problem @@ -69,7 +71,7 @@ def create_lp_target(obj, pl.LpProblem: the updated linear programming problem """ for key in scores: - if key in ['acc', 'sens', 'spec', 'bacc'] and key in obj.scores: + if key in ["acc", "sens", "spec", "bacc"] and key in obj.scores: lp_problem += obj.scores[key] >= scores[key] - eps[key] lp_problem += obj.scores[key] <= scores[key] + eps[key] @@ -78,10 +80,8 @@ def create_lp_target(obj, return lp_problem -def solve(obj, - scores: dict, - eps, - solver = None) -> pl.LpProblem: + +def solve(obj, scores: dict, eps, solver=None) -> pl.LpProblem: """ Solving a problem. @@ -95,9 +95,9 @@ def solve(obj, pl.LpProblem: the solved linear programming problem """ if not isinstance(eps, dict): - eps = {key: eps for key in ['acc', 'sens', 'spec', 'bacc']} + eps = {key: eps for key in ["acc", "sens", "spec", "bacc"]} - lp_problem = pl.LpProblem(f'feasibility_{random_identifier(8)}') + lp_problem = pl.LpProblem(f"feasibility_{random_identifier(8)}") lp_problem = obj.init_lp(lp_problem, scores) diff --git a/mlscorecheck/aggregated/_utils.py b/mlscorecheck/aggregated/_utils.py index 1b1660e..a736a84 100644 --- a/mlscorecheck/aggregated/_utils.py +++ b/mlscorecheck/aggregated/_utils.py @@ -7,12 +7,10 @@ import numpy as np -__all__ = ['random_identifier', - 'check_bounds', - 'compare_scores', - 'aggregated_scores'] +__all__ = ["random_identifier", "check_bounds", "compare_scores", "aggregated_scores"] + +aggregated_scores = ["acc", "sens", "spec", "bacc"] -aggregated_scores = ['acc', 'sens', 'spec', 'bacc'] def random_identifier(length: int): """ @@ -25,11 +23,10 @@ def random_identifier(length: int): str: the identifier """ letters = string.ascii_lowercase - return ''.join(random.choice(letters) for _ in range(length)) + return "".join(random.choice(letters) for _ in range(length)) + -def check_bounds(scores: dict, - bounds: dict = None, - tolerance: float = 1e-5) -> bool: +def check_bounds(scores: dict, bounds: dict = None, tolerance: float = 1e-5) -> bool: """ Checks the bounds for the scores @@ -50,17 +47,16 @@ def check_bounds(scores: dict, for key in bounds: if key in scores: if bounds[key][0] is not None and not np.isnan(bounds[key][0]): - flag = flag and (bounds[key][0]-tolerance <= scores[key]) + flag = flag and (bounds[key][0] - tolerance <= scores[key]) if bounds[key][1] is not None and not np.isnan(bounds[key][1]): - flag = flag and (scores[key] <= bounds[key][1]+tolerance) + flag = flag and (scores[key] <= bounds[key][1] + tolerance) return flag -def compare_scores(scores0: dict, - scores1: dict, - eps, - subset: list = None, - tolerance: float = 1e-5): + +def compare_scores( + scores0: dict, scores1: dict, eps, subset: list = None, tolerance: float = 1e-5 +): """ Compares two sets of scores @@ -78,5 +74,8 @@ def compare_scores(scores0: dict, if not isinstance(eps, dict): eps = {key: eps for key in scores0} - return all(abs(scores0[key] - scores1[key]) <= eps[key] + tolerance - for key in scores1 if key in scores0) + return all( + abs(scores0[key] - scores1[key]) <= eps[key] + tolerance + for key in scores1 + if key in scores0 + ) diff --git a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py index 7dbb264..21d8d64 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py +++ b/mlscorecheck/check/binary/_check_1_dataset_kfold_som.py @@ -8,15 +8,18 @@ from ...individual import check_scores_tptn_pairs from ...aggregated import Experiment -__all__ = ['check_1_dataset_kfold_som'] +__all__ = ["check_1_dataset_kfold_som"] -def check_1_dataset_kfold_som(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True) -> dict: + +def check_1_dataset_kfold_som( + dataset: dict, + folding: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True +) -> dict: """ This function checks the consistency of scores calculated by applying k-fold cross validation to a single dataset and aggregating the figures over the folds in the score of means fashion. @@ -87,21 +90,23 @@ def check_1_dataset_kfold_som(dataset: dict, # True """ - if folding.get('folds') is None and folding.get('strategy') is None: + if folding.get("folds") is None and folding.get("strategy") is None: # any folding strategy results the same - folding = {**folding} | {'strategy': 'stratified_sklearn'} + folding = {**folding} | {"strategy": "stratified_sklearn"} # creating the experiment consisting of one single dataset, the # outer level aggregation can be arbitrary - experiment = Experiment(evaluations=[{'dataset': dataset, - 'folding': folding, - 'aggregation': 'som'}], - aggregation='som') + experiment = Experiment( + evaluations=[{"dataset": dataset, "folding": folding, "aggregation": "som"}], + aggregation="som", + ) # executing the individual tests - return check_scores_tptn_pairs(scores=scores, - eps=eps, - p=experiment.figures['p'], - n=experiment.figures['n'], - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + return check_scores_tptn_pairs( + scores=scores, + eps=eps, + p=experiment.figures["p"], + n=experiment.figures["n"], + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py index ed8a939..07b78b3 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py +++ b/mlscorecheck/check/binary/_check_1_dataset_known_folds_mos.py @@ -7,18 +7,21 @@ from ...core import NUMERICAL_TOLERANCE from ...aggregated import check_aggregated_scores, Experiment, Evaluation -__all__ = ['check_1_dataset_known_folds_mos'] - -def check_1_dataset_known_folds_mos(dataset: dict, - folding: dict, - scores: dict, - eps, - fold_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_1_dataset_known_folds_mos"] + + +def check_1_dataset_known_folds_mos( + dataset: dict, + folding: dict, + scores: dict, + eps, + fold_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ This function checks the consistency of scores calculated by applying k-fold cross validation to a single dataset and aggregating the figures over the folds in the mean of scores fashion. @@ -102,18 +105,21 @@ def check_1_dataset_known_folds_mos(dataset: dict, # True """ - evaluation = Evaluation(dataset=dataset, - folding=folding, - fold_score_bounds=fold_score_bounds, - aggregation='mos') - - experiment = Experiment(evaluations=[evaluation.to_dict()], - aggregation='mos') - - return check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=eps, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + evaluation = Evaluation( + dataset=dataset, + folding=folding, + fold_score_bounds=fold_score_bounds, + aggregation="mos", + ) + + experiment = Experiment(evaluations=[evaluation.to_dict()], aggregation="mos") + + return check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=eps, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py index 432b395..04bd032 100644 --- a/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py +++ b/mlscorecheck/check/binary/_check_1_dataset_unknown_folds_mos.py @@ -4,17 +4,15 @@ """ from ...core import NUMERICAL_TOLERANCE -from ...aggregated import (Dataset, - repeated_kfolds_generator, - kfolds_generator) +from ...aggregated import Dataset, repeated_kfolds_generator, kfolds_generator from ._check_1_dataset_known_folds_mos import check_1_dataset_known_folds_mos -__all__ = ['check_1_dataset_unknown_folds_mos', - 'estimate_n_evaluations'] +__all__ = ["check_1_dataset_unknown_folds_mos", "estimate_n_evaluations"] -def estimate_n_evaluations(dataset: dict, - folding: dict, - available_scores: list = None) -> int: + +def estimate_n_evaluations( + dataset: dict, folding: dict, available_scores: list = None +) -> int: """ Estimates the number of estimations with different fold combinations. @@ -27,27 +25,32 @@ def estimate_n_evaluations(dataset: dict, int: the estimated number of different fold configurations. """ dataset = Dataset(**dataset) - n_repeats = folding.get('n_repeats', 1) + n_repeats = folding.get("n_repeats", 1) available_scores = [] if available_scores is None else available_scores - count = sum(1 for _ in kfolds_generator({'dataset': dataset.to_dict(), - 'folding': folding}, - available_scores)) + count = sum( + 1 + for _ in kfolds_generator( + {"dataset": dataset.to_dict(), "folding": folding}, available_scores + ) + ) return count**n_repeats + def check_1_dataset_unknown_folds_mos( - dataset: dict, - folding: dict, - scores: dict, - eps, - fold_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + dataset: dict, + folding: dict, + scores: dict, + eps, + fold_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Checking the consistency of scores calculated in a k-fold cross validation on a single dataset, in a mean-of-scores fashion, without knowing the fold configuration. @@ -123,33 +126,39 @@ def check_1_dataset_unknown_folds_mos( >>> result['inconsistency'] # True """ - evaluation = {'dataset': dataset, - 'folding': folding, - 'fold_score_bounds': fold_score_bounds, - 'aggregation': 'mos'} + evaluation = { + "dataset": dataset, + "folding": folding, + "fold_score_bounds": fold_score_bounds, + "aggregation": "mos", + } - results = {'details': []} + results = {"details": []} idx = 0 - for evaluation_0 in repeated_kfolds_generator(evaluation, - list(scores.keys())): - tmp = {'folds': evaluation_0['folding']['folds'], - 'details': check_1_dataset_known_folds_mos( - scores=scores, - eps=eps, - dataset=evaluation_0['dataset'], - folding=evaluation_0['folding'], - fold_score_bounds=evaluation_0.get('fold_score_bounds'), - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance), - 'configuration_id': idx} - results['details'].append(tmp) - if not tmp['details']['inconsistency']: + for evaluation_0 in repeated_kfolds_generator(evaluation, list(scores.keys())): + tmp = { + "folds": evaluation_0["folding"]["folds"], + "details": check_1_dataset_known_folds_mos( + scores=scores, + eps=eps, + dataset=evaluation_0["dataset"], + folding=evaluation_0["folding"], + fold_score_bounds=evaluation_0.get("fold_score_bounds"), + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ), + "configuration_id": idx, + } + results["details"].append(tmp) + if not tmp["details"]["inconsistency"]: break idx += 1 - results['inconsistency'] = all(tmp['details']['inconsistency'] for tmp in results['details']) + results["inconsistency"] = all( + tmp["details"]["inconsistency"] for tmp in results["details"] + ) return results diff --git a/mlscorecheck/check/binary/_check_1_testset_no_kfold.py b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py index 671077f..c411d6b 100644 --- a/mlscorecheck/check/binary/_check_1_testset_no_kfold.py +++ b/mlscorecheck/check/binary/_check_1_testset_no_kfold.py @@ -9,14 +9,17 @@ from ...individual import check_scores_tptn_pairs from ...experiments import dataset_statistics -__all__ = ['check_1_testset_no_kfold'] - -def check_1_testset_no_kfold(testset: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True) -> dict: +__all__ = ["check_1_testset_no_kfold"] + + +def check_1_testset_no_kfold( + testset: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True +) -> dict: """ Use this check if the scores are calculated on one single test set with no kfolding. The test is performed by exhaustively testing all @@ -81,31 +84,46 @@ def check_1_testset_no_kfold(testset: dict, # True """ - logger.info('Use this function if the scores originate from the '\ - 'tp and tn statistics calculated on one test set with '\ - 'no aggregation of any kind.') + logger.info( + "Use this function if the scores originate from the " + "tp and tn statistics calculated on one test set with " + "no aggregation of any kind." + ) - if ('p' not in testset or 'n' not in testset) and ('name' not in testset): + if ("p" not in testset or "n" not in testset) and ("name" not in testset): raise ValueError('either "p" and "n" or "name" should be specified') - if ('n_repeats' in testset) or ('n_folds' in testset) \ - or ('folds' in testset) or ('aggregation' in testset): - warnings.warn('Additional fields beyond ("p", "n") or "name" present ' \ - 'in the specification, you might want to use another check '\ - 'function specialized to datasets') - - p = testset.get('p') - n = testset.get('n') - if 'name' in testset: - p = dataset_statistics[testset['name']]['p'] - n = dataset_statistics[testset['name']]['n'] - - logger.info('calling the score check with scores %s, uncertainty %s, p %d and n %d', - str(scores), str(eps), p, n) - - return check_scores_tptn_pairs(scores=scores, - eps=eps, - p=p, - n=n, - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + if ( + ("n_repeats" in testset) + or ("n_folds" in testset) + or ("folds" in testset) + or ("aggregation" in testset) + ): + warnings.warn( + 'Additional fields beyond ("p", "n") or "name" present ' + "in the specification, you might want to use another check " + "function specialized to datasets" + ) + + p = testset.get("p") + n = testset.get("n") + if "name" in testset: + p = dataset_statistics[testset["name"]]["p"] + n = dataset_statistics[testset["name"]]["n"] + + logger.info( + "calling the score check with scores %s, uncertainty %s, p %d and n %d", + str(scores), + str(eps), + p, + n, + ) + + return check_scores_tptn_pairs( + scores=scores, + eps=eps, + p=p, + n=n, + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py index 5d5b00e..fe46e10 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_kfold_som.py @@ -9,17 +9,20 @@ from ...aggregated import check_aggregated_scores, Experiment from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_datasets_mos_kfold_som'] - -def check_n_datasets_mos_kfold_som(evaluations: list, - scores: dict, - eps, - dataset_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_n_datasets_mos_kfold_som"] + + +def check_n_datasets_mos_kfold_som( + evaluations: list, + scores: dict, + eps, + dataset_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ This function checks the consistency of scores calculated on multiple datasets with k-fold cross-validation, applying score of means aggregation over the folds and mean of scores @@ -102,25 +105,33 @@ def check_n_datasets_mos_kfold_som(evaluations: list, # True """ - if any(evaluation.get('aggregation', 'som') != 'som' for evaluation in evaluations): - raise ValueError('the aggregation specified in each dataset must be "rom" or nothing.') + if any(evaluation.get("aggregation", "som") != "som" for evaluation in evaluations): + raise ValueError( + 'the aggregation specified in each dataset must be "rom" or nothing.' + ) - if any(evaluation.get('fold_score_bounds') is not None for evaluation in evaluations): - raise ValueError('do not specify fold_score_bounds for a SoM evaluation') + if any( + evaluation.get("fold_score_bounds") is not None for evaluation in evaluations + ): + raise ValueError("do not specify fold_score_bounds for a SoM evaluation") evaluations = copy.deepcopy(evaluations) for evaluation in evaluations: - evaluation['aggregation'] = 'som' - - experiment = Experiment(evaluations=evaluations, - dataset_score_bounds=dataset_score_bounds, - aggregation='mos') - - return check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=eps, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + evaluation["aggregation"] = "som" + + experiment = Experiment( + evaluations=evaluations, + dataset_score_bounds=dataset_score_bounds, + aggregation="mos", + ) + + return check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=eps, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py index 59955f0..2d20457 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_known_folds_mos.py @@ -9,17 +9,20 @@ from ...aggregated import check_aggregated_scores, Experiment from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_datasets_mos_known_folds_mos'] - -def check_n_datasets_mos_known_folds_mos(evaluations: list, - scores: dict, - eps, - dataset_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_n_datasets_mos_known_folds_mos"] + + +def check_n_datasets_mos_known_folds_mos( + evaluations: list, + scores: dict, + eps, + dataset_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ This function checks the consistency of scores calculated by applying k-fold cross validation to N datasets and aggregating the figures over the folds and datasets in the mean of scores @@ -95,24 +98,32 @@ def check_n_datasets_mos_known_folds_mos(evaluations: list, >>> result['inconsistency'] # True """ - if any(evaluation.get('aggregation', 'mos') != 'mos' for evaluation in evaluations): - raise ValueError('the aggregation specified in each dataset must be "mor" or nothing.') - if any(evaluation.get('fold_score_bounds') is not None for evaluation in evaluations): - raise ValueError('do not specify fold_score_bounds through this interface') + if any(evaluation.get("aggregation", "mos") != "mos" for evaluation in evaluations): + raise ValueError( + 'the aggregation specified in each dataset must be "mor" or nothing.' + ) + if any( + evaluation.get("fold_score_bounds") is not None for evaluation in evaluations + ): + raise ValueError("do not specify fold_score_bounds through this interface") evaluations = copy.deepcopy(evaluations) for evaluation in evaluations: - evaluation['aggregation'] = 'mos' - - experiment = Experiment(evaluations=evaluations, - dataset_score_bounds=dataset_score_bounds, - aggregation='mos') - - return check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=eps, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + evaluation["aggregation"] = "mos" + + experiment = Experiment( + evaluations=evaluations, + dataset_score_bounds=dataset_score_bounds, + aggregation="mos", + ) + + return check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=eps, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py index 91a70d5..58b1352 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py +++ b/mlscorecheck/check/binary/_check_n_datasets_mos_unknown_folds_mos.py @@ -9,17 +9,15 @@ import numpy as np -from ._check_n_datasets_mos_known_folds_mos \ - import check_n_datasets_mos_known_folds_mos +from ._check_n_datasets_mos_known_folds_mos import check_n_datasets_mos_known_folds_mos from ._check_1_dataset_unknown_folds_mos import estimate_n_evaluations from ...core import NUMERICAL_TOLERANCE -from ...aggregated import (experiment_kfolds_generator) +from ...aggregated import experiment_kfolds_generator -__all__ = ['check_n_datasets_mos_unknown_folds_mos', - 'estimate_n_experiments'] +__all__ = ["check_n_datasets_mos_unknown_folds_mos", "estimate_n_experiments"] -def estimate_n_experiments(evaluations: list, - available_scores: list = None) -> int: + +def estimate_n_experiments(evaluations: list, available_scores: list = None) -> int: """ Estimates the number of estimations with different fold combinations. @@ -31,21 +29,28 @@ def estimate_n_experiments(evaluations: list, """ available_scores = [] if available_scores is None else available_scores - counts = [estimate_n_evaluations(dataset=evaluation['dataset'], - folding=evaluation['folding'], - available_scores=available_scores) - for evaluation in evaluations] + counts = [ + estimate_n_evaluations( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + available_scores=available_scores, + ) + for evaluation in evaluations + ] return np.prod(counts) -def check_n_datasets_mos_unknown_folds_mos(evaluations: list, - scores: dict, - eps, - dataset_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + +def check_n_datasets_mos_unknown_folds_mos( + evaluations: list, + scores: dict, + eps, + dataset_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Checking the consistency of scores calculated in k-fold cross validation on multiple datasets, in mean-of-scores fashion, without knowing the fold configurations. @@ -125,39 +130,44 @@ def check_n_datasets_mos_unknown_folds_mos(evaluations: list, >>> result['inconsistency'] # True """ - if any(evaluation.get('aggregation', 'mos') != 'mos' for evaluation in evaluations): - raise ValueError('the aggregation specified in each dataset must be "mor" or nothing.') - if any(evaluation.get('fold_score_bounds') is not None for evaluation in evaluations): - raise ValueError('do not specify fold score bounds through this interface') + if any(evaluation.get("aggregation", "mos") != "mos" for evaluation in evaluations): + raise ValueError( + 'the aggregation specified in each dataset must be "mor" or nothing.' + ) + if any( + evaluation.get("fold_score_bounds") is not None for evaluation in evaluations + ): + raise ValueError("do not specify fold score bounds through this interface") evaluations = copy.deepcopy(evaluations) for evaluation in evaluations: - evaluation['aggregation'] = 'mos' + evaluation["aggregation"] = "mos" - experiment = {'evaluations': evaluations, - 'dataset_score_bounds': dataset_score_bounds, - 'aggregation': 'mos'} + experiment = { + "evaluations": evaluations, + "dataset_score_bounds": dataset_score_bounds, + "aggregation": "mos", + } - results = {'details': [], - 'inconsistency': True} + results = {"details": [], "inconsistency": True} - for experiment in experiment_kfolds_generator(experiment, - list(scores.keys())): + for experiment in experiment_kfolds_generator(experiment, list(scores.keys())): result = check_n_datasets_mos_known_folds_mos( - evaluations=experiment['evaluations'], - dataset_score_bounds=experiment.get('dataset_score_bounds'), - scores=scores, - eps=eps, - timeout=timeout, - solver_name=solver_name, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) - - results['details'].append(result) - results['inconsistency'] = results['inconsistency'] and result['inconsistency'] - - if not result['inconsistency']: + evaluations=experiment["evaluations"], + dataset_score_bounds=experiment.get("dataset_score_bounds"), + scores=scores, + eps=eps, + timeout=timeout, + solver_name=solver_name, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) + + results["details"].append(result) + results["inconsistency"] = results["inconsistency"] and result["inconsistency"] + + if not result["inconsistency"]: break return results diff --git a/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py index bf80193..4502629 100644 --- a/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py +++ b/mlscorecheck/check/binary/_check_n_datasets_som_kfold_som.py @@ -10,14 +10,17 @@ from ...individual import check_scores_tptn_pairs from ...aggregated import Experiment -__all__ = ['check_n_datasets_som_kfold_som'] +__all__ = ["check_n_datasets_som_kfold_som"] -def check_n_datasets_som_kfold_som(evaluations: list, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True): + +def check_n_datasets_som_kfold_som( + evaluations: list, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True +): """ Checking the consistency of scores calculated by applying k-fold cross validation to multiple datasets and aggregating the figures @@ -94,24 +97,26 @@ def check_n_datasets_som_kfold_som(evaluations: list, >>> result['inconsistency'] # True """ - if any(evaluation.get('aggregation', 'som') != 'som' for evaluation in evaluations): - raise ValueError('the aggregation specifications cannot be anything else '\ - 'but "rom"') + if any(evaluation.get("aggregation", "som") != "som" for evaluation in evaluations): + raise ValueError( + "the aggregation specifications cannot be anything else but 'rom'" + ) evaluations = copy.deepcopy(evaluations) for evaluation in evaluations: - evaluation['aggregation'] = 'som' + evaluation["aggregation"] = "som" # creating the experiment consisting of one single dataset, the # outer level aggregation can be arbitrary - experiment = Experiment(evaluations=evaluations, - aggregation='som') + experiment = Experiment(evaluations=evaluations, aggregation="som") # executing the individual tests - return check_scores_tptn_pairs(scores=scores, - eps=eps, - p=experiment.figures['p'], - n=experiment.figures['n'], - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + return check_scores_tptn_pairs( + scores=scores, + eps=eps, + p=experiment.figures["p"], + n=experiment.figures["n"], + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py index c3f5a64..1c23180 100644 --- a/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py +++ b/mlscorecheck/check/binary/_check_n_testsets_mos_no_kfold.py @@ -7,17 +7,20 @@ from ...aggregated import check_aggregated_scores, Experiment, Dataset from ...core import NUMERICAL_TOLERANCE -__all__ = ['check_n_testsets_mos_no_kfold'] - -def check_n_testsets_mos_no_kfold(testsets: list, - scores: dict, - eps, - testset_score_bounds: dict = None, - *, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_n_testsets_mos_no_kfold"] + + +def check_n_testsets_mos_no_kfold( + testsets: list, + scores: dict, + eps, + testset_score_bounds: dict = None, + *, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE, +) -> dict: """ This function checks the consistency of scores calculated on multiple testsets with no k-fold and aggregating the figures over the testsets in the mean of scores fashion. @@ -89,20 +92,35 @@ def check_n_testsets_mos_no_kfold(testsets: list, datasets = [Dataset(**dataset) for dataset in testsets] - evaluations = [{'dataset': dataset.to_dict(), - 'folding': {'folds': [{'p': dataset.p, 'n': dataset.n, - 'identifier': f'{dataset.identifier}_{idx}'}]}, - 'aggregation': 'mos'} - for idx, dataset in enumerate(datasets)] - - experiment = Experiment(evaluations=evaluations, - dataset_score_bounds=testset_score_bounds, - aggregation='mos') - - return check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=eps, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + evaluations = [ + { + "dataset": dataset.to_dict(), + "folding": { + "folds": [ + { + "p": dataset.p, + "n": dataset.n, + "identifier": f"{dataset.identifier}_{idx}", + } + ] + }, + "aggregation": "mos", + } + for idx, dataset in enumerate(datasets) + ] + + experiment = Experiment( + evaluations=evaluations, + dataset_score_bounds=testset_score_bounds, + aggregation="mos", + ) + + return check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=eps, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py index ec86da0..c02f74c 100644 --- a/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py +++ b/mlscorecheck/check/binary/_check_n_testsets_som_no_kfold.py @@ -8,14 +8,17 @@ from ...individual import check_scores_tptn_pairs from ...aggregated import Experiment, Dataset -__all__ = ['check_n_testsets_som_no_kfold'] +__all__ = ["check_n_testsets_som_no_kfold"] -def check_n_testsets_som_no_kfold(testsets: list, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True): + +def check_n_testsets_som_no_kfold( + testsets: list, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True, +): """ Checking the consistency of scores calculated by aggregating the figures over testsets in the score of means fashion, without k-folding. @@ -82,21 +85,33 @@ def check_n_testsets_som_no_kfold(testsets: list, datasets = [Dataset(**dataset) for dataset in testsets] - evaluations = [{'dataset': dataset.to_dict(), - 'folding': {'folds': [{'p': dataset.p, 'n': dataset.n, - 'identifier': f'{dataset.identifier}_{idx}'}]}, - 'aggregation': 'mos'} - for idx, dataset in enumerate(datasets)] + evaluations = [ + { + "dataset": dataset.to_dict(), + "folding": { + "folds": [ + { + "p": dataset.p, + "n": dataset.n, + "identifier": f"{dataset.identifier}_{idx}", + } + ] + }, + "aggregation": "mos", + } + for idx, dataset in enumerate(datasets) + ] # creating the experiment consisting of one single dataset, the # outer level aggregation can be arbitrary - experiment = Experiment(evaluations=evaluations, - aggregation='som') + experiment = Experiment(evaluations=evaluations, aggregation="som") # executing the individual tests - return check_scores_tptn_pairs(scores=scores, - eps=eps, - p=experiment.figures['p'], - n=experiment.figures['n'], - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + return check_scores_tptn_pairs( + scores=scores, + eps=eps, + p=experiment.figures["p"], + n=experiment.figures["n"], + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py index fa8bf51..94d8f22 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_macro.py @@ -4,24 +4,26 @@ """ from ...core import NUMERICAL_TOLERANCE -from ...aggregated import (transform_multiclass_fold_to_binary, - create_folds_multiclass) +from ...aggregated import transform_multiclass_fold_to_binary, create_folds_multiclass from ..binary import check_n_datasets_mos_known_folds_mos -__all__ = ['check_1_dataset_known_folds_mos_macro'] - -def check_1_dataset_known_folds_mos_macro(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - class_score_bounds: dict = None, - fold_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_1_dataset_known_folds_mos_macro"] + + +def check_1_dataset_known_folds_mos_macro( + dataset: dict, + folding: dict, + scores: dict, + eps, + *, + class_score_bounds: dict = None, + fold_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Checking the consistency of scores calculated by taking the macro average of class-level scores on one single multiclass dataset with k-fold cross-validation. @@ -99,18 +101,26 @@ def check_1_dataset_known_folds_mos_macro(dataset: dict, evaluations = [] for binary_folding in binary_folds: - folding = {'folds': binary_folding} - dataset = {'p': sum(tmp['p'] for tmp in binary_folding), - 'n': sum(tmp['n'] for tmp in binary_folding)} - evaluations.append({'dataset': dataset, - 'folding': folding, - 'fold_score_bounds': class_score_bounds}) - - return check_n_datasets_mos_known_folds_mos(evaluations=evaluations, - scores=scores, - eps=eps, - dataset_score_bounds=fold_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + folding = {"folds": binary_folding} + dataset = { + "p": sum(tmp["p"] for tmp in binary_folding), + "n": sum(tmp["n"] for tmp in binary_folding), + } + evaluations.append( + { + "dataset": dataset, + "folding": folding, + "fold_score_bounds": class_score_bounds, + } + ) + + return check_n_datasets_mos_known_folds_mos( + evaluations=evaluations, + scores=scores, + eps=eps, + dataset_score_bounds=fold_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py index 4a9a3d5..6534ebe 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_mos_micro.py @@ -4,23 +4,25 @@ """ from ...core import NUMERICAL_TOLERANCE -from ...aggregated import (transform_multiclass_fold_to_binary, - create_folds_multiclass) +from ...aggregated import transform_multiclass_fold_to_binary, create_folds_multiclass from ..binary import check_n_datasets_mos_kfold_som -__all__ = ['check_1_dataset_known_folds_mos_micro'] - -def check_1_dataset_known_folds_mos_micro(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - fold_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_1_dataset_known_folds_mos_micro"] + + +def check_1_dataset_known_folds_mos_micro( + dataset: dict, + folding: dict, + scores: dict, + eps, + *, + fold_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ This function checks the consistency of scores calculated by taking the micro average on a single multiclass dataset with known folds. @@ -99,17 +101,20 @@ def check_1_dataset_known_folds_mos_micro(dataset: dict, evaluations = [] for binary_folding in binary_folds: - folding = {'folds': binary_folding} - dataset = {'p': sum(tmp['p'] for tmp in binary_folding), - 'n': sum(tmp['n'] for tmp in binary_folding)} - evaluations.append({'dataset': dataset, - 'folding': folding}) - - return check_n_datasets_mos_kfold_som(evaluations=evaluations, - scores=scores, - eps=eps, - dataset_score_bounds=fold_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + folding = {"folds": binary_folding} + dataset = { + "p": sum(tmp["p"] for tmp in binary_folding), + "n": sum(tmp["n"] for tmp in binary_folding), + } + evaluations.append({"dataset": dataset, "folding": folding}) + + return check_n_datasets_mos_kfold_som( + evaluations=evaluations, + scores=scores, + eps=eps, + dataset_score_bounds=fold_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py index cb6265d..a3aae1d 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_macro.py @@ -10,18 +10,21 @@ from ._check_1_testset_no_kfold_macro import check_1_testset_no_kfold_macro -__all__ = ['check_1_dataset_known_folds_som_macro'] - -def check_1_dataset_known_folds_som_macro(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - class_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: +__all__ = ["check_1_dataset_known_folds_som_macro"] + + +def check_1_dataset_known_folds_som_macro( + dataset: dict, + folding: dict, + scores: dict, + eps, + *, + class_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ This function checks the consistency of scores calculated by taking the macro average on a single multiclass dataset and averaging the scores across the folds in the SoM manner. @@ -101,11 +104,13 @@ def check_1_dataset_known_folds_som_macro(dataset: dict, for key in fold: testset[key] += fold[key] - return check_1_testset_no_kfold_macro(testset=testset, - scores=scores, - eps=eps, - class_score_bounds=class_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + return check_1_testset_no_kfold_macro( + testset=testset, + scores=scores, + eps=eps, + class_score_bounds=class_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py index 2885d67..f813aa8 100644 --- a/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_dataset_known_folds_som_micro.py @@ -10,15 +10,18 @@ from ._check_1_testset_no_kfold_micro import check_1_testset_no_kfold_micro -__all__ = ['check_1_dataset_known_folds_som_micro'] +__all__ = ["check_1_dataset_known_folds_som_micro"] -def check_1_dataset_known_folds_som_micro(dataset: dict, - folding: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True) -> dict: + +def check_1_dataset_known_folds_som_micro( + dataset: dict, + folding: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True +) -> dict: """ This function checks the consistency of scores calculated by taking the micro average of class level scores on a single multiclass dataset and averaging across the folds in the @@ -89,8 +92,10 @@ class level scores on a single multiclass dataset and averaging across the folds for key in fold: testset[key] += fold[key] - return check_1_testset_no_kfold_micro(testset=testset, - scores=scores, - eps=eps, - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + return check_1_testset_no_kfold_micro( + testset=testset, + scores=scores, + eps=eps, + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py index cb61276..927a7d9 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_macro.py @@ -8,17 +8,20 @@ from ..binary import check_1_dataset_known_folds_mos -__all__ = ['check_1_testset_no_kfold_macro'] +__all__ = ["check_1_testset_no_kfold_macro"] -def check_1_testset_no_kfold_macro(testset: dict, - scores: dict, - eps, - *, - class_score_bounds: dict = None, - solver_name: str = None, - timeout: int = None, - verbosity: int = 1, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + +def check_1_testset_no_kfold_macro( + testset: dict, + scores: dict, + eps, + *, + class_score_bounds: dict = None, + solver_name: str = None, + timeout: int = None, + verbosity: int = 1, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ The function tests the consistency of scores calculated by taking the macro average of class level scores on one single multiclass dataset. @@ -84,15 +87,19 @@ class level scores on one single multiclass dataset. # True """ folds = transform_multiclass_fold_to_binary(testset) - dataset = {'p': sum(fold['p'] for fold in folds), - 'n': sum(fold['n'] for fold in folds)} + dataset = { + "p": sum(fold["p"] for fold in folds), + "n": sum(fold["n"] for fold in folds), + } - return check_1_dataset_known_folds_mos(scores=scores, - eps=eps, - dataset=dataset, - folding={'folds': folds}, - fold_score_bounds=class_score_bounds, - solver_name=solver_name, - timeout=timeout, - verbosity=verbosity, - numerical_tolerance=numerical_tolerance) + return check_1_dataset_known_folds_mos( + scores=scores, + eps=eps, + dataset=dataset, + folding={"folds": folds}, + fold_score_bounds=class_score_bounds, + solver_name=solver_name, + timeout=timeout, + verbosity=verbosity, + numerical_tolerance=numerical_tolerance, + ) diff --git a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py index f0688a2..8414f60 100644 --- a/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py +++ b/mlscorecheck/check/multiclass/_check_1_testset_no_kfold_micro.py @@ -8,14 +8,17 @@ from ..binary import check_1_dataset_kfold_som -__all__ = ['check_1_testset_no_kfold_micro'] +__all__ = ["check_1_testset_no_kfold_micro"] -def check_1_testset_no_kfold_micro(testset: dict, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - prefilter_by_pairs: bool = True) -> dict: + +def check_1_testset_no_kfold_micro( + testset: dict, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + prefilter_by_pairs: bool = True +) -> dict: """ Checking the consistency of scores calculated by taking the micro average of class level scores on one single multiclass dataset. @@ -81,12 +84,16 @@ def check_1_testset_no_kfold_micro(testset: dict, # True """ folds = transform_multiclass_fold_to_binary(testset) - dataset = {'p': sum(fold['p'] for fold in folds), - 'n': sum(fold['n'] for fold in folds)} + dataset = { + "p": sum(fold["p"] for fold in folds), + "n": sum(fold["n"] for fold in folds), + } - return check_1_dataset_kfold_som(scores=scores, - eps=eps, - dataset=dataset, - folding={'folds': folds}, - numerical_tolerance=numerical_tolerance, - prefilter_by_pairs=prefilter_by_pairs) + return check_1_dataset_kfold_som( + scores=scores, + eps=eps, + dataset=dataset, + folding={"folds": folds}, + numerical_tolerance=numerical_tolerance, + prefilter_by_pairs=prefilter_by_pairs, + ) diff --git a/mlscorecheck/check/regression/_check_regression.py b/mlscorecheck/check/regression/_check_regression.py index cf80d4e..b67bb42 100644 --- a/mlscorecheck/check/regression/_check_regression.py +++ b/mlscorecheck/check/regression/_check_regression.py @@ -7,18 +7,21 @@ from ...individual import Interval from ...core import NUMERICAL_TOLERANCE, round_scores, safe_eval -__all__ = ['check_1_testset_no_kfold', - 'expand_regression_scores', - 'mean_average_error', - 'mean_squared_error', - 'root_mean_squared_error', - 'r_squared', - 'calculate_regression_scores', - 'generate_regression_problem_and_scores', - 'check_relations', - 'score_formulas'] - -rules = [{'score0': 'mae', 'score1': 'rmse', 'relation': 'le'}] +__all__ = [ + "check_1_testset_no_kfold", + "expand_regression_scores", + "mean_average_error", + "mean_squared_error", + "root_mean_squared_error", + "r_squared", + "calculate_regression_scores", + "generate_regression_problem_and_scores", + "check_relations", + "score_formulas", +] + +rules = [{"score0": "mae", "score1": "rmse", "relation": "le"}] + def mean_average_error(y_true: np.array, y_pred: np.array) -> float: """ @@ -33,6 +36,7 @@ def mean_average_error(y_true: np.array, y_pred: np.array) -> float: """ return np.mean(np.abs(y_true - y_pred)) + def mean_squared_error(y_true: np.array, y_pred: np.array) -> float: """ The mean squared error (MSE) regression performance score @@ -44,7 +48,8 @@ def mean_squared_error(y_true: np.array, y_pred: np.array) -> float: Returns: float: the MSE score """ - return np.mean((y_true - y_pred)**2) + return np.mean((y_true - y_pred) ** 2) + def root_mean_squared_error(y_true: np.array, y_pred: np.array) -> float: """ @@ -59,6 +64,7 @@ def root_mean_squared_error(y_true: np.array, y_pred: np.array) -> float: """ return np.sqrt(mean_squared_error(y_true, y_pred)) + def r_squared(y_true: np.array, y_pred: np.array) -> float: """ The R squared (r2) regression performance score @@ -70,14 +76,20 @@ def r_squared(y_true: np.array, y_pred: np.array) -> float: Returns: float: the R2 score """ - return 1.0 - np.sum((y_true - y_pred)**2) / (np.var(y_true) * y_true.shape[0]) + return 1.0 - np.sum((y_true - y_pred) ** 2) / (np.var(y_true) * y_true.shape[0]) + + +regression_scores = { + "mae": mean_average_error, + "mse": mean_squared_error, + "rmse": root_mean_squared_error, + "r2": r_squared, +} -regression_scores = {'mae': mean_average_error, - 'mse': mean_squared_error, - 'rmse': root_mean_squared_error, - 'r2': r_squared} -def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None) -> dict: +def calculate_regression_scores( + y_true: np.array, y_pred: np.array, subset=None +) -> dict: """ Calculate the performance scores for a regression problem @@ -97,11 +109,10 @@ def calculate_regression_scores(y_true: np.array, y_pred: np.array, subset=None) return scores + def generate_regression_problem_and_scores( - random_state=None, - max_n_samples=1000, - subset=None, - rounding_decimals=None) -> (float, int, dict): + random_state=None, max_n_samples=1000, subset=None, rounding_decimals=None +) -> (float, int, dict): """ Generate a regression problem and corresponding scores @@ -128,19 +139,17 @@ def generate_regression_problem_and_scores( return np.var(y_true), n_samples, scores -score_formulas = {'mse': {'rmse': 'rmse**2', - 'r2': '((1 - r2) * (var))'}, - 'rmse': {'mse': 'mse ** 0.5', - 'r2': '((1 - r2) * (var)) ** 0.5'}, - 'r2': {'mse': '(1 - mse / var)', - 'rmse': '(1 - rmse**2 / var)'}, - } -def expand_regression_scores(var: float, - n_samples: int, - scores: dict, - eps, - numerical_tolerance: float) -> dict: +score_formulas = { + "mse": {"rmse": "rmse**2", "r2": "((1 - r2) * (var))"}, + "rmse": {"mse": "mse ** 0.5", "r2": "((1 - r2) * (var)) ** 0.5"}, + "r2": {"mse": "(1 - mse / var)", "rmse": "(1 - rmse**2 / var)"}, +} + + +def expand_regression_scores( + var: float, n_samples: int, scores: dict, eps, numerical_tolerance: float +) -> dict: """ Generate scores from the ones available and expand the scores to intervals given the numerical uncertainty. @@ -155,19 +164,26 @@ def expand_regression_scores(var: float, Returns: dict: the extended set of score intervals """ - scores = {key: Interval(value - eps - numerical_tolerance, - value + eps + numerical_tolerance) for key, value in scores.items()} + scores = { + key: Interval( + value - eps - numerical_tolerance, value + eps + numerical_tolerance + ) + for key, value in scores.items() + } to_add = {} for key, value in score_formulas.items(): if key not in scores: for sol, formula in value.items(): if sol in scores: - to_add[key] = safe_eval(formula, scores | {'var': var, 'n_samples': n_samples}) + to_add[key] = safe_eval( + formula, scores | {"var": var, "n_samples": n_samples} + ) break return scores | to_add + def check_relations(scores: dict) -> dict: """ Check the relations of the scores @@ -181,25 +197,28 @@ def check_relations(scores: dict) -> dict: - ``'inconsistency'`` (bool): whether an inconsistency has been identified - ``'details'`` (list(dict)): the details of the analysis, with the following entries """ - results = {'details': []} + results = {"details": []} for rule in rules: - if rule['score0'] in scores and rule['score1'] in scores: - score0 = scores[rule['score0']] - score1 = scores[rule['score1']] - if rule['relation'] == 'le': + if rule["score0"] in scores and rule["score1"] in scores: + score0 = scores[rule["score0"]] + score1 = scores[rule["score1"]] + if rule["relation"] == "le": value = score0.lower_bound <= score1.upper_bound - results['details'].append(rule | {'value': value}) + results["details"].append(rule | {"value": value}) - results['inconsistency'] = any(not result['value'] for result in results['details']) + results["inconsistency"] = any(not result["value"] for result in results["details"]) return results -def check_1_testset_no_kfold(var: float, - n_samples: int, - scores: dict, - eps, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + +def check_1_testset_no_kfold( + var: float, + n_samples: int, + scores: dict, + eps, + numerical_tolerance: float = NUMERICAL_TOLERANCE, +) -> dict: """ The consistency test for regression scores calculated on a single test set with no k-folding @@ -237,10 +256,8 @@ def check_1_testset_no_kfold(var: float, >>> result['inconsistency'] # True """ - intervals = expand_regression_scores(var, - n_samples, - scores, - eps, - numerical_tolerance) + intervals = expand_regression_scores( + var, n_samples, scores, eps, numerical_tolerance + ) return check_relations(intervals) diff --git a/mlscorecheck/core/_dict.py b/mlscorecheck/core/_dict.py index b6ef6ae..1edad4e 100644 --- a/mlscorecheck/core/_dict.py +++ b/mlscorecheck/core/_dict.py @@ -4,8 +4,8 @@ import numpy as np -__all__ = ['dict_mean', - 'dict_minmax'] +__all__ = ["dict_mean", "dict_minmax"] + def dict_mean(dicts: list) -> dict: """ @@ -28,6 +28,7 @@ def dict_mean(dicts: list) -> dict: return result + def dict_minmax(dicts: list) -> dict: """ Calculates the min-max of scores in a dictionary diff --git a/mlscorecheck/core/_load_json.py b/mlscorecheck/core/_load_json.py index 106e24c..be74e3d 100644 --- a/mlscorecheck/core/_load_json.py +++ b/mlscorecheck/core/_load_json.py @@ -7,7 +7,8 @@ from importlib.resources import files -__all__ = ['load_json'] +__all__ = ["load_json"] + def load_json(directory: str, file: str) -> dict: """ @@ -20,6 +21,6 @@ def load_json(directory: str, file: str) -> dict: Returns: obj: the loaded object """ - sio = files('mlscorecheck').joinpath(os.path.join(directory, file)).read_text() + sio = files("mlscorecheck").joinpath(os.path.join(directory, file)).read_text() return json.loads(sio) diff --git a/mlscorecheck/core/_numerical_tolerance.py b/mlscorecheck/core/_numerical_tolerance.py index 592921e..b31cab0 100644 --- a/mlscorecheck/core/_numerical_tolerance.py +++ b/mlscorecheck/core/_numerical_tolerance.py @@ -4,12 +4,15 @@ import numpy as np -__all__ = ['NUMERICAL_TOLERANCE', - 'check_uncertainty_and_tolerance', - 'update_uncertainty'] +__all__ = [ + "NUMERICAL_TOLERANCE", + "check_uncertainty_and_tolerance", + "update_uncertainty", +] NUMERICAL_TOLERANCE = 1e-6 + def check_uncertainty_and_tolerance(eps: float, numerical_tolerance: float): """ Checking the relation of the numerical tolerance and the uncertainty @@ -23,9 +26,12 @@ def check_uncertainty_and_tolerance(eps: float, numerical_tolerance: float): greater than the numerical tolerance """ eps_min = np.min(list(eps.values())) if isinstance(eps, dict) else eps - if eps_min <= 10*numerical_tolerance: - raise ValueError('The numerical tolerance is comparable to the numerical '\ - 'uncertainty. Please lower the numerical tolerance.') + if eps_min <= 10 * numerical_tolerance: + raise ValueError( + "The numerical tolerance is comparable to the numerical " + "uncertainty. Please lower the numerical tolerance." + ) + def update_uncertainty(eps: float, numerical_tolerance: float): """ diff --git a/mlscorecheck/core/_random_state.py b/mlscorecheck/core/_random_state.py index 7673130..37a0cc6 100644 --- a/mlscorecheck/core/_random_state.py +++ b/mlscorecheck/core/_random_state.py @@ -4,9 +4,10 @@ import numpy as np -__all__ = ['init_random_state'] +__all__ = ["init_random_state"] -def init_random_state(random_state = None) -> np.random.RandomState: + +def init_random_state(random_state=None) -> np.random.RandomState: """ Initializes a random state diff --git a/mlscorecheck/core/_rounding.py b/mlscorecheck/core/_rounding.py index 222fd7f..8bb646e 100644 --- a/mlscorecheck/core/_rounding.py +++ b/mlscorecheck/core/_rounding.py @@ -4,7 +4,8 @@ import numpy as np -__all__ = ['round_scores'] +__all__ = ["round_scores"] + def round_scores(to_round: dict, rounding_decimals: int = None): """ @@ -23,4 +24,7 @@ def round_scores(to_round: dict, rounding_decimals: int = None): if not isinstance(to_round, dict): return float(np.round(to_round, rounding_decimals)) - return {key: float(np.round(value, rounding_decimals)) for key, value in to_round.items()} + return { + key: float(np.round(value, rounding_decimals)) + for key, value in to_round.items() + } diff --git a/mlscorecheck/core/_safe_eval.py b/mlscorecheck/core/_safe_eval.py index 787bdc4..d7b47c4 100644 --- a/mlscorecheck/core/_safe_eval.py +++ b/mlscorecheck/core/_safe_eval.py @@ -2,8 +2,8 @@ This module implements functions for safe evaluations """ -__all__ = ['safe_eval', - 'safe_call'] +__all__ = ["safe_eval", "safe_call"] + def safe_eval(expression: str, subs: dict): """ @@ -18,7 +18,8 @@ def safe_eval(expression: str, subs: dict): obj: the value of the expression """ - return eval(expression, subs) # pylint: disable=eval-used + return eval(expression, subs) # pylint: disable=eval-used + def check_applicability(params: dict, non_applicable: list = None) -> bool: """ @@ -48,6 +49,7 @@ def check_applicability(params: dict, non_applicable: list = None) -> bool: return False return True + def safe_call(function, params: dict, non_applicable: list = None): """ Safe call to a function @@ -65,6 +67,6 @@ def safe_call(function, params: dict, non_applicable: list = None): if not check_applicability(params, non_applicable): return None - args = list(function.__code__.co_varnames[:function.__code__.co_kwonlyargcount]) + args = list(function.__code__.co_varnames[: function.__code__.co_kwonlyargcount]) return function(**{arg: params[arg] for arg in args if arg in params}) diff --git a/mlscorecheck/experiments/_load_datasets.py b/mlscorecheck/experiments/_load_datasets.py index f4814d6..066379c 100644 --- a/mlscorecheck/experiments/_load_datasets.py +++ b/mlscorecheck/experiments/_load_datasets.py @@ -4,15 +4,13 @@ import os -__all__ = ['dataset_statistics', - 'load_ml_datasets', - 'lookup_dataset', - 'resolve_pn'] +__all__ = ["dataset_statistics", "load_ml_datasets", "lookup_dataset", "resolve_pn"] from ..core import load_json dataset_statistics = {} + def resolve_pn(dataset_conf): """ Resolve the dataset configuration from the integrated statistics @@ -27,15 +25,16 @@ def resolve_pn(dataset_conf): """ if isinstance(dataset_conf, dict): result = {**dataset_conf} - if result.get('dataset') is not None: - tmp = lookup_dataset(result['dataset']) - result['p'] = tmp['p'] - result['n'] = tmp['n'] + if result.get("dataset") is not None: + tmp = lookup_dataset(result["dataset"]) + result["p"] = tmp["p"] + result["n"] = tmp["n"] elif isinstance(dataset_conf, list): result = [resolve_pn(dataset) for dataset in dataset_conf] return result + def lookup_dataset(dataset: str) -> dict: """ Look up a dataset @@ -47,22 +46,34 @@ def lookup_dataset(dataset: str) -> dict: dict: the count statistics of the dataset """ if dataset not in dataset_statistics: - raise ValueError(f"No statistics about dataset {dataset} are available. "\ - "Didn't you forget to identify like 'common_datasets.ecoli1'?") + raise ValueError( + f"No statistics about dataset {dataset} are available. " + "Didn't you forget to identify like 'common_datasets.ecoli1'?" + ) return dataset_statistics[dataset] + def load_ml_datasets(): """ Load the ML datasets """ - data = load_json(os.path.join('experiments', 'machine_learning'), 'sklearn.json') + data = load_json(os.path.join("experiments", "machine_learning"), "sklearn.json") + + for entry in data["datasets"]: + dataset_statistics["sklearn." + entry["name"]] = { + "p": entry["p"], + "n": entry["n"], + } - for entry in data['datasets']: - dataset_statistics['sklearn.' + entry['name']] = {'p': entry['p'], 'n': entry['n']} + data = load_json( + os.path.join("experiments", "machine_learning"), "common_datasets.json" + ) - data = load_json(os.path.join('experiments', 'machine_learning'), 'common_datasets.json') + for entry in data["datasets"]: + dataset_statistics["common_datasets." + entry["name"]] = { + "p": entry["p"], + "n": entry["n"], + } - for entry in data['datasets']: - dataset_statistics['common_datasets.' + entry['name']] = {'p': entry['p'], 'n': entry['n']} load_ml_datasets() diff --git a/mlscorecheck/experiments/_load_experiments.py b/mlscorecheck/experiments/_load_experiments.py index 32be3a7..921079c 100644 --- a/mlscorecheck/experiments/_load_experiments.py +++ b/mlscorecheck/experiments/_load_experiments.py @@ -4,17 +4,19 @@ import os -__all__ = ['get_experiment', - 'load_drive', - 'load_tpehg', - 'load_isic2016', - 'load_isic2017', - 'load_stare', - 'load_chase_db1', - 'load_diaretdb0', - 'load_diaretdb1', - 'load_hrf', - 'load_drishti_gs'] +__all__ = [ + "get_experiment", + "load_drive", + "load_tpehg", + "load_isic2016", + "load_isic2017", + "load_stare", + "load_chase_db1", + "load_diaretdb0", + "load_diaretdb1", + "load_hrf", + "load_drishti_gs", +] from ..core import load_json @@ -35,28 +37,28 @@ def get_experiment(name): if name in experiments: return experiments[name] - if name == 'retina.drive': + if name == "retina.drive": experiments[name] = load_drive() - elif name == 'retina.stare': + elif name == "retina.stare": experiments[name] = load_stare() - elif name == 'retina.chase_db1': + elif name == "retina.chase_db1": experiments[name] = load_chase_db1() - elif name == 'retina.diaretdb0': + elif name == "retina.diaretdb0": experiments[name] = load_diaretdb0() - elif name == 'retina.diaretdb1': + elif name == "retina.diaretdb1": experiments[name] = load_diaretdb1() - elif name == 'retina.hrf': + elif name == "retina.hrf": experiments[name] = load_hrf() - elif name == 'retina.drishti_gs': + elif name == "retina.drishti_gs": experiments[name] = load_drishti_gs() - elif name == 'ehg.tpehg': + elif name == "ehg.tpehg": experiments[name] = load_tpehg() - elif name == 'skinlesion.isic2016': + elif name == "skinlesion.isic2016": experiments[name] = load_isic2016() - elif name == 'skinlesion.isic2017': + elif name == "skinlesion.isic2017": experiments[name] = load_isic2017() else: - raise ValueError(f'unknown dataset {name}') + raise ValueError(f"unknown dataset {name}") return experiments[name] @@ -68,9 +70,11 @@ def load_chase_db1() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'chase_db1') - return {'manual1': load_json(prefix, 'manual1.json'), - 'manual2': load_json(prefix, 'manual2.json')} + prefix = os.path.join("experiments", "retina", "chase_db1") + return { + "manual1": load_json(prefix, "manual1.json"), + "manual2": load_json(prefix, "manual2.json"), + } def load_diaretdb0() -> dict: @@ -80,8 +84,8 @@ def load_diaretdb0() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'diaretdb0') - return load_json(prefix, 'diaretdb0.json') + prefix = os.path.join("experiments", "retina", "diaretdb0") + return load_json(prefix, "diaretdb0.json") def load_diaretdb1() -> dict: @@ -91,8 +95,8 @@ def load_diaretdb1() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'diaretdb1') - return load_json(prefix, 'diaretdb1.json') + prefix = os.path.join("experiments", "retina", "diaretdb1") + return load_json(prefix, "diaretdb1.json") def load_drishti_gs() -> dict: @@ -102,9 +106,11 @@ def load_drishti_gs() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'drishti_gs') - return {'train': load_json(prefix, 'drishti_gs_train.json')['distributions'], - 'test': load_json(prefix, 'drishti_gs_test.json')['distributions']} + prefix = os.path.join("experiments", "retina", "drishti_gs") + return { + "train": load_json(prefix, "drishti_gs_train.json")["distributions"], + "test": load_json(prefix, "drishti_gs_test.json")["distributions"], + } def load_hrf() -> dict: @@ -114,9 +120,11 @@ def load_hrf() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'hrf') - return {'fov': load_json(prefix, 'with_fov.json'), - 'all': load_json(prefix, 'without_fov.json')} + prefix = os.path.join("experiments", "retina", "hrf") + return { + "fov": load_json(prefix, "with_fov.json"), + "all": load_json(prefix, "without_fov.json"), + } def load_stare() -> dict: @@ -126,9 +134,8 @@ def load_stare() -> dict: Returns: dict: the experiment specifications """ - prefix = os.path.join('experiments', 'retina', 'stare') - return {'ah': load_json(prefix, 'ah.json'), - 'vk': load_json(prefix, 'vk.json')} + prefix = os.path.join("experiments", "retina", "stare") + return {"ah": load_json(prefix, "ah.json"), "vk": load_json(prefix, "vk.json")} def load_drive() -> dict: @@ -138,13 +145,17 @@ def load_drive() -> dict: Returns: dict: the drive experiments """ - prefix = os.path.join('experiments', 'retina', 'drive') + prefix = os.path.join("experiments", "retina", "drive") results = {} for annotator in [1, 2]: - for assumption in ['fov', 'all']: - tmp = {'train': load_json(prefix, f'drive_{annotator}_train_{assumption}.json'), - 'test': load_json(prefix, f'drive_{annotator}_test_{assumption}.json')} + for assumption in ["fov", "all"]: + tmp = { + "train": load_json( + prefix, f"drive_{annotator}_train_{assumption}.json" + ), + "test": load_json(prefix, f"drive_{annotator}_test_{assumption}.json"), + } results[(annotator, assumption)] = tmp return results @@ -156,8 +167,8 @@ def load_tpehg() -> dict: Returns: dict: the drive experiments """ - prefix = os.path.join('experiments', 'ehg') - return load_json(prefix, 'tpehg.json')['distribution'] + prefix = os.path.join("experiments", "ehg") + return load_json(prefix, "tpehg.json")["distribution"] def load_isic2016() -> dict: @@ -167,8 +178,8 @@ def load_isic2016() -> dict: Returns: dict: the testset """ - prefix = os.path.join('experiments', 'skinlesion', 'isic2016') - return load_json(prefix, 'isic2016.json')['distribution'] + prefix = os.path.join("experiments", "skinlesion", "isic2016") + return load_json(prefix, "isic2016.json")["distribution"] def load_isic2017() -> dict: @@ -179,5 +190,5 @@ def load_isic2017() -> dict: Returns: dict: the testset """ - prefix = os.path.join('experiments', 'skinlesion', 'isic2017') - return load_json(prefix, 'isic2017.json')['distribution'] + prefix = os.path.join("experiments", "skinlesion", "isic2017") + return load_json(prefix, "isic2017.json")["distribution"] diff --git a/mlscorecheck/individual/_check_scores_tptn.py b/mlscorecheck/individual/_check_scores_tptn.py index e32bb9b..bc2ca77 100644 --- a/mlscorecheck/individual/_check_scores_tptn.py +++ b/mlscorecheck/individual/_check_scores_tptn.py @@ -12,21 +12,47 @@ from ._tptn_solution_bundles import tptn_solutions, sens_tp, spec_tn, is_applicable_tptn from ._pair_solutions import solution_specifications -__all__ = ['check_scores_tptn_pairs', - '_check_scores_tptn_pairs', - '_check_scores_tptn_intervals'] - -preferred_order = ['acc', 'sens', 'spec', 'bacc', 'npv', 'ppv', 'f1p', 'f1n', 'fbp', 'fbn', - 'fm', 'bm', 'pt', 'lrp', 'lrn', 'mk', 'dor', - 'ji', 'gm', 'upm', 'kappa', 'mcc'] - -def iterate_tptn(*, - score: str, - score_value: float, - valid_pairs: dict, - sol_fun, - params: dict, - iterate_by: str) -> dict: +__all__ = [ + "check_scores_tptn_pairs", + "_check_scores_tptn_pairs", + "_check_scores_tptn_intervals", +] + +preferred_order = [ + "acc", + "sens", + "spec", + "bacc", + "npv", + "ppv", + "f1p", + "f1n", + "fbp", + "fbn", + "fm", + "bm", + "pt", + "lrp", + "lrn", + "mk", + "dor", + "ji", + "gm", + "upm", + "kappa", + "mcc", +] + + +def iterate_tptn( + *, + score: str, + score_value: float, + valid_pairs: dict, + sol_fun, + params: dict, + iterate_by: str +) -> dict: """ Iterate through the potential values of tp or tn and construct feasible pairs @@ -45,8 +71,9 @@ def iterate_tptn(*, results = {} for value in valid_pairs: - - if not is_applicable_tptn(score, score_value, 'tp' if iterate_by == 'tn' else 'tn'): + if not is_applicable_tptn( + score, score_value, "tp" if iterate_by == "tn" else "tn" + ): results[value] = valid_pairs[value] continue @@ -63,10 +90,8 @@ def iterate_tptn(*, return results -def update_sens(p: int, - valid_pairs: dict, - score_int, - solve_for: str) -> dict: + +def update_sens(p: int, valid_pairs: dict, score_int, solve_for: str) -> dict: """ Update sensitivity intervals @@ -80,21 +105,26 @@ def update_sens(p: int, dict(int,Interval|IntervalUnion): the updated intervals """ ints = sens_tp(sens=score_int, p=p) - ints = ints.intersection(Interval(0, p+1)).shrink_to_integers() - - if solve_for == 'tp': - valid_pairs = {key: value.intersection(ints) for key, value in valid_pairs.items()} - valid_pairs = {key: value for key, value in valid_pairs.items() if not value.is_empty()} + ints = ints.intersection(Interval(0, p + 1)).shrink_to_integers() + + if solve_for == "tp": + valid_pairs = { + key: value.intersection(ints) for key, value in valid_pairs.items() + } + valid_pairs = { + key: value for key, value in valid_pairs.items() if not value.is_empty() + } else: - valid_pairs = {value: interval for value, interval in valid_pairs.items() - if ints.contains(value)} + valid_pairs = { + value: interval + for value, interval in valid_pairs.items() + if ints.contains(value) + } return valid_pairs -def update_spec(n: int, - valid_pairs: dict, - score_int, - solve_for: str) -> dict: + +def update_spec(n: int, valid_pairs: dict, score_int, solve_for: str) -> dict: """ Update specificity intervals @@ -108,21 +138,28 @@ def update_spec(n: int, dict(int,Interval|IntervalUnion): the updated intervals """ ints = spec_tn(spec=score_int, n=n) - ints = ints.intersection(Interval(0, n+1)).shrink_to_integers() - - if solve_for == 'tn': - valid_pairs = {key: value.intersection(ints) for key, value in valid_pairs.items()} - valid_pairs = {key: value for key, value in valid_pairs.items() if not value.is_empty()} + ints = ints.intersection(Interval(0, n + 1)).shrink_to_integers() + + if solve_for == "tn": + valid_pairs = { + key: value.intersection(ints) for key, value in valid_pairs.items() + } + valid_pairs = { + key: value for key, value in valid_pairs.items() if not value.is_empty() + } else: - valid_pairs = {value: interval for value, interval in valid_pairs.items() - if ints.contains(value)} + valid_pairs = { + value: interval + for value, interval in valid_pairs.items() + if ints.contains(value) + } return valid_pairs -def initialize_valid_pairs(p: int, - n: int, - iterate_by: str, - init_tptn_intervals: dict) -> dict: + +def initialize_valid_pairs( + p: int, n: int, iterate_by: str, init_tptn_intervals: dict +) -> dict: """ Initializes the valid pairs, either from the original input or the prefiltered intervals. @@ -137,10 +174,10 @@ def initialize_valid_pairs(p: int, dict(int,Interval|IntervalUnion): the initialized pairs """ if init_tptn_intervals is not None: - tp_int = IntervalUnion(init_tptn_intervals['tp']) - tn_int = IntervalUnion(init_tptn_intervals['tn']) + tp_int = IntervalUnion(init_tptn_intervals["tp"]) + tn_int = IntervalUnion(init_tptn_intervals["tn"]) valid_pairs = {} - if iterate_by == 'tp': + if iterate_by == "tp": for interval in tp_int.intervals: for tp in range(interval.lower_bound, interval.upper_bound + 1): valid_pairs[tp] = copy.deepcopy(tn_int) @@ -150,17 +187,20 @@ def initialize_valid_pairs(p: int, valid_pairs[tn] = copy.deepcopy(tp_int) return valid_pairs - init_interval = Interval(0, n+1) if iterate_by == 'tp' else Interval(0, p+1) - return {key: init_interval for key in range(p+1 if iterate_by == 'tp' else n+1)} - -def _check_scores_tptn_pairs(p: int, - n: int, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - solve_for: str=None, - init_tptn_intervals: dict=None) -> dict: + init_interval = Interval(0, n + 1) if iterate_by == "tp" else Interval(0, p + 1) + return {key: init_interval for key in range(p + 1 if iterate_by == "tp" else n + 1)} + + +def _check_scores_tptn_pairs( + p: int, + n: int, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + solve_for: str = None, + init_tptn_intervals: dict = None +) -> dict: """ Check scores by iteratively reducing the set of feasible ``tp``, ``tn`` pairs. @@ -183,13 +223,15 @@ def _check_scores_tptn_pairs(p: int, all scores. """ if solve_for is None: - solve_for = 'tn' if p < n else 'tp' + solve_for = "tn" if p < n else "tp" - if solve_for not in {'tp', 'tn'}: - raise ValueError('The specified ``solve_for`` variable needs to be either '\ - '``tp`` or ``tn``.') + if solve_for not in {"tp", "tn"}: + raise ValueError( + "The specified ``solve_for`` variable needs to be either " + "``tp`` or ``tn``." + ) - iterate_by = 'tn' if solve_for == 'tp' else 'tp' + iterate_by = "tn" if solve_for == "tp" else "tp" # resolving aliases and complements scores = resolve_aliases_and_complements(scores) @@ -198,66 +240,82 @@ def _check_scores_tptn_pairs(p: int, eps = eps if isinstance(eps, dict) else {score: eps for score in scores} eps = update_uncertainty(eps, numerical_tolerance) - params = {'p': p, 'n': n, - 'beta_positive': scores.get('beta_positive'), - 'beta_negative': scores.get('beta_negative')} + params = { + "p": p, + "n": n, + "beta_positive": scores.get("beta_positive"), + "beta_negative": scores.get("beta_negative"), + } valid_pairs = initialize_valid_pairs(p, n, iterate_by, init_tptn_intervals) details = [] for score in [score for score in preferred_order if score in scores]: - logger.info('testing %s, feasible tptn pairs: %d', - score, p*n if valid_pairs is None else len(valid_pairs)) + logger.info( + "testing %s, feasible tptn pairs: %d", + score, + p * n if valid_pairs is None else len(valid_pairs), + ) score_int = Interval(scores[score] - eps[score], scores[score] + eps[score]) params[score] = score_int - detail = {'testing': score, - 'score_interval': score_int, - 'n_tptn_pairs_before': p*n if valid_pairs is None else len(valid_pairs)} - - if score not in {'sens', 'spec'}: - valid_pairs = iterate_tptn(score=score, - score_value=scores[score], - valid_pairs=valid_pairs, - sol_fun=tptn_solutions[score][solve_for], - params=params, - iterate_by=iterate_by) - elif score == 'sens': - valid_pairs = update_sens(p=p, - valid_pairs=valid_pairs, - score_int=score_int, - solve_for=solve_for) + detail = { + "testing": score, + "score_interval": score_int, + "n_tptn_pairs_before": p * n if valid_pairs is None else len(valid_pairs), + } + + if score not in {"sens", "spec"}: + valid_pairs = iterate_tptn( + score=score, + score_value=scores[score], + valid_pairs=valid_pairs, + sol_fun=tptn_solutions[score][solve_for], + params=params, + iterate_by=iterate_by, + ) + elif score == "sens": + valid_pairs = update_sens( + p=p, valid_pairs=valid_pairs, score_int=score_int, solve_for=solve_for + ) else: # score == 'spec' - valid_pairs = update_spec(n=n, - valid_pairs=valid_pairs, - score_int=score_int, - solve_for=solve_for) + valid_pairs = update_spec( + n=n, valid_pairs=valid_pairs, score_int=score_int, solve_for=solve_for + ) - detail['n_tptn_pairs_after'] = len(valid_pairs) - detail['decision'] = 'continue' if len(valid_pairs) > 0 else 'infeasible' + detail["n_tptn_pairs_after"] = len(valid_pairs) + detail["decision"] = "continue" if len(valid_pairs) > 0 else "infeasible" details.append(detail) if len(valid_pairs) == 0: - logger.info('no more feasible tp,tn pairs left') + logger.info("no more feasible tp,tn pairs left") break total_count = sum(interval.integer_counts() for interval in valid_pairs.values()) - logger.info('constructing final tp, tn pair set') - logger.info('final number of intervals: %d', len(valid_pairs)) - logger.info('final number of pairs: %d', total_count) - - return {'inconsistency': len(valid_pairs) == 0, - 'details': details, - 'n_valid_tptn_pairs': total_count, - 'iterate_by': iterate_by, - 'solve_for': solve_for, - 'evidence': ({iterate_by: list(valid_pairs.keys())[0], - solve_for: valid_pairs[list(valid_pairs.keys())[0]].representing_int()} - if len(valid_pairs) > 0 else None)} + logger.info("constructing final tp, tn pair set") + logger.info("final number of intervals: %d", len(valid_pairs)) + logger.info("final number of pairs: %d", total_count) + + return { + "inconsistency": len(valid_pairs) == 0, + "details": details, + "n_valid_tptn_pairs": total_count, + "iterate_by": iterate_by, + "solve_for": solve_for, + "evidence": ( + { + iterate_by: list(valid_pairs.keys())[0], + solve_for: valid_pairs[list(valid_pairs.keys())[0]].representing_int(), + } + if len(valid_pairs) > 0 + else None + ), + } + def check_all_negative_base(sols: list) -> bool: """ @@ -269,7 +327,8 @@ def check_all_negative_base(sols: list) -> bool: Returns: bool: True if all solutions have negative base, False otherwise """ - return all(sol.get('message') == 'negative base' for sol in sols) + return all(sol.get("message") == "negative base" for sol in sols) + def check_any_zero_division(sols: list) -> bool: """ @@ -281,7 +340,8 @@ def check_any_zero_division(sols: list) -> bool: Returns: bool: True if at least one solution has zero division, False otherwise """ - return any(sol.get('message') == 'zero division' for sol in sols) + return any(sol.get("message") == "zero division" for sol in sols) + def update_tptn(tp, tn, sols: list): """ @@ -295,23 +355,26 @@ def update_tptn(tp, tn, sols: list): Returns: IntervalUnion, IntervalUnion: the updated tp and tn intervals """ - tp_union = IntervalUnion([sol['tp'] for sol in sols if sol['tp'] is not None]) - tn_union = IntervalUnion([sol['tn'] for sol in sols if sol['tn'] is not None]) + tp_union = IntervalUnion([sol["tp"] for sol in sols if sol["tp"] is not None]) + tn_union = IntervalUnion([sol["tn"] for sol in sols if sol["tn"] is not None]) - logger.info('the tp solutions: %s', tp_union) - logger.info('the tn solutions: %s', tn_union) + logger.info("the tp solutions: %s", tp_union) + logger.info("the tn solutions: %s", tn_union) tp = tp.intersection(tp_union).shrink_to_integers() tn = tn.intersection(tn_union).shrink_to_integers() return tp, tn -def _check_scores_tptn_intervals(p: int, - n: int, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + +def _check_scores_tptn_intervals( + p: int, + n: int, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Check scores by iteratively reducing the set of feasible ``tp``, ``tn`` pairs. @@ -338,9 +401,12 @@ def _check_scores_tptn_intervals(p: int, eps = eps if isinstance(eps, dict) else {score: eps for score in scores} eps = update_uncertainty(eps, numerical_tolerance) - params = {'p': p, 'n': n, - 'beta_positive': scores.get('beta_positive'), - 'beta_negative': scores.get('beta_negative')} + params = { + "p": p, + "n": n, + "beta_positive": scores.get("beta_positive"), + "beta_negative": scores.get("beta_negative"), + } params |= create_intervals(scores, eps) tp = Interval(0, p) @@ -351,61 +417,94 @@ def _check_scores_tptn_intervals(p: int, score_names = list(scores.keys()) for idx, score0 in enumerate(score_names): - for score1 in score_names[idx+1:]: - detail = {'base_score_0': score0, - 'base_score_1': score1, - 'base_score_0_interval': params[score0].to_tuple(), - 'base_score_1_interval': params[score1].to_tuple()} + for score1 in score_names[idx + 1 :]: + detail = { + "base_score_0": score0, + "base_score_1": score1, + "base_score_0_interval": params[score0].to_tuple(), + "base_score_1_interval": params[score1].to_tuple(), + } if tuple(sorted([score0, score1])) not in solution_specifications: - logger.info('there is no solution for %s and %s', score0, score1) - details.append(detail | {'inconsistency': False, - 'explanation': 'there is no solution for the pair'}) + logger.info("there is no solution for %s and %s", score0, score1) + details.append( + detail + | { + "inconsistency": False, + "explanation": "there is no solution for the pair", + } + ) continue - logger.info('evaluating the tp and tn solution for %s and %s', score0, score1) + logger.info( + "evaluating the tp and tn solution for %s and %s", score0, score1 + ) - sols = solution_specifications[(tuple(sorted([score0, score1])))]\ - .evaluate(params) + sols = solution_specifications[(tuple(sorted([score0, score1])))].evaluate( + params + ) if check_all_negative_base(sols): - details.append(detail | {'inconsistency': True, - 'explanation': 'all solutions lead to negative bases'}) + details.append( + detail + | { + "inconsistency": True, + "explanation": "all solutions lead to negative bases", + } + ) logger.info("all negative bases - iteration finished") break if check_any_zero_division(sols): - details.append(detail | {'inconsistency': False, - 'explanation': 'zero division indicates an '\ - 'underdetermined system'}) + details.append( + detail + | { + "inconsistency": False, + "explanation": "zero division indicates an " + "underdetermined system", + } + ) logger.info("all zero divisions - iteration continued") continue - logger.info('intervals before: %s, %s', str(tp.to_tuple()), str(tn.to_tuple())) + logger.info( + "intervals before: %s, %s", str(tp.to_tuple()), str(tn.to_tuple()) + ) tp, tn = update_tptn(tp, tn, sols) - logger.info('intervals after: %s, %s', str(tp.to_tuple()), str(tn.to_tuple())) - - details.append(detail | { - 'tp_after': tp.to_tuple(), - 'tn_after': tn.to_tuple(), - 'inconsistency': (tp.is_empty()) and (tn.is_empty())}) + logger.info( + "intervals after: %s, %s", str(tp.to_tuple()), str(tn.to_tuple()) + ) + + details.append( + detail + | { + "tp_after": tp.to_tuple(), + "tn_after": tn.to_tuple(), + "inconsistency": (tp.is_empty()) and (tn.is_empty()), + } + ) else: continue break - return {'inconsistency': (tp.is_empty()) and (tn.is_empty()), - 'tp': tp.to_tuple(), - 'tn': tn.to_tuple(), - 'details': details} - -def check_scores_tptn_pairs(p: int, - n: int, - scores: dict, - eps, - *, - numerical_tolerance: float = NUMERICAL_TOLERANCE, - solve_for: str = None, - prefilter_by_pairs: bool = False) -> dict: + return { + "inconsistency": (tp.is_empty()) and (tn.is_empty()), + "tp": tp.to_tuple(), + "tn": tn.to_tuple(), + "details": details, + } + + +def check_scores_tptn_pairs( + p: int, + n: int, + scores: dict, + eps, + *, + numerical_tolerance: float = NUMERICAL_TOLERANCE, + solve_for: str = None, + prefilter_by_pairs: bool = False +) -> dict: """ Check scores by iteratively reducing the set of feasible ``tp``, ``tn`` pairs. @@ -430,18 +529,31 @@ def check_scores_tptn_pairs(p: int, by using the solutions for the score pairs. """ if not prefilter_by_pairs: - return _check_scores_tptn_pairs(p, n, scores, eps, - numerical_tolerance=numerical_tolerance, - solve_for=solve_for) - results_interval = _check_scores_tptn_intervals(p, n, scores, eps, - numerical_tolerance=numerical_tolerance) - - results = _check_scores_tptn_pairs(p, n, scores, eps, - numerical_tolerance=numerical_tolerance, - solve_for=solve_for, - init_tptn_intervals={'tp': results_interval['tp'], - 'tn': results_interval['tn']}) - - results['prefiltering_details'] = results_interval + return _check_scores_tptn_pairs( + p, + n, + scores, + eps, + numerical_tolerance=numerical_tolerance, + solve_for=solve_for, + ) + results_interval = _check_scores_tptn_intervals( + p, n, scores, eps, numerical_tolerance=numerical_tolerance + ) + + results = _check_scores_tptn_pairs( + p, + n, + scores, + eps, + numerical_tolerance=numerical_tolerance, + solve_for=solve_for, + init_tptn_intervals={ + "tp": results_interval["tp"], + "tn": results_interval["tn"], + }, + ) + + results["prefiltering_details"] = results_interval return results diff --git a/mlscorecheck/individual/_complex_interval.py b/mlscorecheck/individual/_complex_interval.py index 85c6d4d..1e94cfb 100644 --- a/mlscorecheck/individual/_complex_interval.py +++ b/mlscorecheck/individual/_complex_interval.py @@ -4,12 +4,14 @@ from ._interval import Interval, IntervalUnion -__all__ = ['ComplexInterval'] +__all__ = ["ComplexInterval"] + class ComplexInterval: """ The class represents a complex interval """ + def __init__(self, real, imag): """ Constructor of the complex interval @@ -88,8 +90,10 @@ def __mul__(self, other): if not isinstance(other, ComplexInterval): return ComplexInterval(self.real * other, self.imag * other) - return ComplexInterval(self.real * other.real - self.imag * other.imag, - self.real * other.imag + self.imag * other.real) + return ComplexInterval( + self.real * other.real - self.imag * other.imag, + self.real * other.imag + self.imag * other.real, + ) def __rmul__(self, other): """ @@ -118,8 +122,10 @@ def __truediv__(self, other): norm = other.real**2 + other.imag**2 - return ComplexInterval((self.real * other.real + self.imag * other.imag)/norm, - (self.imag * other.real - self.real * other.imag)/norm) + return ComplexInterval( + (self.real * other.real + self.imag * other.imag) / norm, + (self.imag * other.real - self.real * other.imag) / norm, + ) def __rtruediv__(self, other): """ diff --git a/mlscorecheck/individual/_expression.py b/mlscorecheck/individual/_expression.py index c9d949e..32b669f 100644 --- a/mlscorecheck/individual/_expression.py +++ b/mlscorecheck/individual/_expression.py @@ -6,17 +6,17 @@ from ..core import safe_eval from ._interval import sqrt -__all__ = ['Expression'] +__all__ = ["Expression"] + class Expression: """ The class represents a formal expression """ - def __init__(self, - expression: str, - symbols: list, - functional_symbols: list = None, - **kwargs): + + def __init__( + self, expression: str, symbols: list, functional_symbols: list = None, **kwargs + ): """ The constructor of the expression @@ -29,7 +29,7 @@ def __init__(self, _ = kwargs if functional_symbols is None: - self.functional_symbols = {'sqrt': sqrt} + self.functional_symbols = {"sqrt": sqrt} self.expression = expression self.symbols = symbols @@ -44,8 +44,7 @@ def evaluate(self, subs: dict): Returns: numeric|Interval|IntervalUnion: the result of the evaluation """ - subs = {**{symbol: subs[symbol] for symbol in self.symbols}, - 'sqrt': sqrt} + subs = {**{symbol: subs[symbol] for symbol in self.symbols}, "sqrt": sqrt} return safe_eval(self.expression, subs) def to_dict(self) -> dict: @@ -55,6 +54,8 @@ def to_dict(self) -> dict: Returns: dict: the dictionary representation """ - return {'expression': self.expression, - 'symbols': self.symbols, - 'functional_symbols': self.functional_symbols} + return { + "expression": self.expression, + "symbols": self.symbols, + "functional_symbols": self.functional_symbols, + } diff --git a/mlscorecheck/individual/_interval.py b/mlscorecheck/individual/_interval.py index b2b09e1..5e5f3dc 100644 --- a/mlscorecheck/individual/_interval.py +++ b/mlscorecheck/individual/_interval.py @@ -4,9 +4,8 @@ import numpy as np -__all__ = ['Interval', - 'IntervalUnion', - 'sqrt'] +__all__ = ["Interval", "IntervalUnion", "sqrt"] + def sqrt(obj): """ @@ -19,14 +18,16 @@ def sqrt(obj): Interval|IntervalUnion|numeric: the square root of the parameter """ - result = obj**0.5 if isinstance(obj, (Interval, IntervalUnion)) else obj**0.5 + result = obj**0.5 if isinstance(obj, (Interval, IntervalUnion)) else obj ** 0.5 return result + class Interval: """ The interval abstraction """ + def __init__(self, lower_bound, upper_bound): """ Constructor of the interval @@ -80,9 +81,15 @@ def intersection(self, other): if isinstance(other, IntervalUnion): return IntervalUnion([self]).intersection(other) - if self.lower_bound >= other.lower_bound and self.upper_bound <= other.upper_bound: + if ( + self.lower_bound >= other.lower_bound + and self.upper_bound <= other.upper_bound + ): return Interval(self.lower_bound, self.upper_bound) - if self.lower_bound <= other.lower_bound and self.upper_bound >= other.upper_bound: + if ( + self.lower_bound <= other.lower_bound + and self.upper_bound >= other.upper_bound + ): return Interval(other.lower_bound, other.upper_bound) tmp_lower = self @@ -153,11 +160,15 @@ def __add__(self, other): return other + self if not isinstance(other, Interval): - return Interval(lower_bound=self.lower_bound + other, - upper_bound=self.upper_bound + other) + return Interval( + lower_bound=self.lower_bound + other, + upper_bound=self.upper_bound + other, + ) - return Interval(lower_bound=self.lower_bound + other.lower_bound, - upper_bound=self.upper_bound + other.upper_bound) + return Interval( + lower_bound=self.lower_bound + other.lower_bound, + upper_bound=self.upper_bound + other.upper_bound, + ) def __radd__(self, other): """ @@ -185,11 +196,15 @@ def __sub__(self, other): return (-1) * other + self if not isinstance(other, Interval): - return Interval(lower_bound=self.lower_bound - other, - upper_bound=self.upper_bound - other) + return Interval( + lower_bound=self.lower_bound - other, + upper_bound=self.upper_bound - other, + ) - return Interval(lower_bound=self.lower_bound - other.upper_bound, - upper_bound=self.upper_bound - other.lower_bound) + return Interval( + lower_bound=self.lower_bound - other.upper_bound, + upper_bound=self.upper_bound - other.lower_bound, + ) def __rsub__(self, other): """ @@ -217,16 +232,19 @@ def __mul__(self, other): return other * self if not isinstance(other, Interval): - return Interval(lower_bound=min(self.lower_bound * other, self.upper_bound*other), - upper_bound=max(self.upper_bound * other, self.lower_bound*other)) + return Interval( + lower_bound=min(self.lower_bound * other, self.upper_bound * other), + upper_bound=max(self.upper_bound * other, self.lower_bound * other), + ) term0 = self.lower_bound * other.lower_bound term1 = self.lower_bound * other.upper_bound term2 = self.upper_bound * other.lower_bound term3 = self.upper_bound * other.upper_bound - return Interval(min(term0, term1, term2, term3), - max(term0, term1, term2, term3)) + return Interval( + min(term0, term1, term2, term3), max(term0, term1, term2, term3) + ) def __rmul__(self, other): """ @@ -251,7 +269,7 @@ def __truediv__(self, other): Interval: the ratio """ if isinstance(other, IntervalUnion): - return (1.0/other) * self + return (1.0 / other) * self if not isinstance(other, Interval): if other >= 0: @@ -261,21 +279,19 @@ def __truediv__(self, other): lower_bound = self.upper_bound / other upper_bound = self.lower_bound / other - return Interval(lower_bound=lower_bound, - upper_bound=upper_bound) + return Interval(lower_bound=lower_bound, upper_bound=upper_bound) if (other.upper_bound == 0) and (other.lower_bound != 0): - return self * Interval(-np.inf, 1.0/other.lower_bound) + return self * Interval(-np.inf, 1.0 / other.lower_bound) if (other.lower_bound == 0) and (other.upper_bound != 0): - return self * Interval(1.0/other.upper_bound, np.inf) + return self * Interval(1.0 / other.upper_bound, np.inf) if (other.lower_bound > 0) or (other.upper_bound < 0): - return self * Interval(1.0/other.upper_bound, - 1.0/other.lower_bound) + return self * Interval(1.0 / other.upper_bound, 1.0 / other.lower_bound) - res_0 = Interval(-np.inf, 1.0/other.lower_bound) - res_1 = Interval(1.0/other.upper_bound, np.inf) + res_0 = Interval(-np.inf, 1.0 / other.lower_bound) + res_1 = Interval(1.0 / other.upper_bound, np.inf) return IntervalUnion([self * res_0, self * res_1]) @@ -315,7 +331,10 @@ def __eq__(self, other) -> bool: """ if not isinstance(other, Interval): return False - return self.lower_bound == other.lower_bound and self.upper_bound == other.upper_bound + return ( + self.lower_bound == other.lower_bound + and self.upper_bound == other.upper_bound + ) def __ne__(self, other) -> bool: """ @@ -336,7 +355,7 @@ def __neg__(self): Returns: Interval: the negated interval """ - return (-1)*self + return (-1) * self def __pow__(self, other): """ @@ -356,9 +375,13 @@ def __pow__(self, other): if self.lower_bound > 0 or self.upper_bound < 0: lower_bound = self.lower_bound**other upper_bound = self.upper_bound**other - res = Interval(min(lower_bound, upper_bound), max(lower_bound, upper_bound)) + res = Interval( + min(lower_bound, upper_bound), max(lower_bound, upper_bound) + ) else: - res = Interval(0, max(self.lower_bound**other, self.upper_bound**other)) + res = Interval( + 0, max(self.lower_bound**other, self.upper_bound**other) + ) elif int(other) % 2 == 1: lower_bound = self.lower_bound**other upper_bound = self.upper_bound**other @@ -383,6 +406,7 @@ class IntervalUnion: """ The interval union abstraction """ + def __init__(self, intervals): """ Constructor of the object @@ -400,7 +424,9 @@ def __init__(self, intervals): if isinstance(intervals[0], Interval): self.intervals = intervals else: - self.intervals = [Interval(interval[0], interval[1]) for interval in intervals] + self.intervals = [ + Interval(interval[0], interval[1]) for interval in intervals + ] else: self.intervals = intervals @@ -430,16 +456,21 @@ def simplify(self): for idx, int0 in enumerate(intervals): for jdx, int1 in enumerate(intervals): if idx != jdx: - if (int0.lower_bound == int1.lower_bound) \ - and (int0.upper_bound == int1.upper_bound) \ - and idx > jdx: + if ( + (int0.lower_bound == int1.lower_bound) + and (int0.upper_bound == int1.upper_bound) + and idx > jdx + ): continue - if (int0.lower_bound <= int1.lower_bound) \ - and (int0.upper_bound >= int1.upper_bound): + if (int0.lower_bound <= int1.lower_bound) and ( + int0.upper_bound >= int1.upper_bound + ): # the interval widh index jdx is contained in the interval with index idx to_drop.append(jdx) - intervals = [interval for idx, interval in enumerate(intervals) if not idx in to_drop] + intervals = [ + interval for idx, interval in enumerate(intervals) if not idx in to_drop + ] # chaining the intervals sorted_intervals = sorted(intervals, key=lambda x: x.lower_bound) @@ -449,7 +480,9 @@ def simplify(self): for idx in range(1, len(sorted_intervals)): if interval.upper_bound >= sorted_intervals[idx].lower_bound: - interval = Interval(interval.lower_bound, sorted_intervals[idx].upper_bound) + interval = Interval( + interval.lower_bound, sorted_intervals[idx].upper_bound + ) else: final_intervals.append(interval) interval = sorted_intervals[idx] @@ -481,9 +514,12 @@ def intersection(self, other): is empty """ if isinstance(other, Interval): - new_intervals = [other.intersection(interval) for interval in self.intervals] - new_intervals = [interval for interval in new_intervals - if interval != Interval(1, 0)] + new_intervals = [ + other.intersection(interval) for interval in self.intervals + ] + new_intervals = [ + interval for interval in new_intervals if interval != Interval(1, 0) + ] return IntervalUnion(new_intervals) intersections = [] @@ -491,8 +527,9 @@ def intersection(self, other): for int1 in other.intervals: intersections.append(int0.intersection(int1)) - return IntervalUnion([interval for interval in intersections - if interval != Interval(1, 0)]) + return IntervalUnion( + [interval for interval in intersections if interval != Interval(1, 0)] + ) def integer(self) -> bool: """ @@ -511,7 +548,9 @@ def shrink_to_integers(self): Returns: IntervalUnion: the shrinked interval union """ - return IntervalUnion([interval.shrink_to_integers() for interval in self.intervals]) + return IntervalUnion( + [interval.shrink_to_integers() for interval in self.intervals] + ) def integer_counts(self) -> int: """ @@ -686,7 +725,7 @@ def __neg__(self): Returns: IntervalUnion: the negated interval union """ - return (-1)*self + return (-1) * self def __repr__(self) -> str: """ @@ -695,8 +734,12 @@ def __repr__(self) -> str: Returns: str: the representation """ - return ' | '.join([f'({interval.lower_bound}, {interval.upper_bound})' - for interval in self.intervals]) + return " | ".join( + [ + f"({interval.lower_bound}, {interval.upper_bound})" + for interval in self.intervals + ] + ) def __eq__(self, other) -> bool: """ diff --git a/mlscorecheck/individual/_pair_solutions.py b/mlscorecheck/individual/_pair_solutions.py index cdc48fe..f533425 100644 --- a/mlscorecheck/individual/_pair_solutions.py +++ b/mlscorecheck/individual/_pair_solutions.py @@ -13,19 +13,16 @@ from ._interval import Interval, IntervalUnion from ._expression import Expression -__all__ = ['load_solutions', - 'Solution', - 'Solutions', - 'solution_specifications'] +__all__ = ["load_solutions", "Solution", "Solutions", "solution_specifications"] + class Solution: """ Represents one single solution (expressions for tp and tn) and corresponding non-zero and non-negative conditions as expressions """ - def __init__(self, - solution: dict, - conditions: list = None): + + def __init__(self, solution: dict, conditions: list = None): """ Constructor of the solution @@ -40,12 +37,12 @@ def __init__(self, self.all_symbols = set() for item in self.solution.values(): - self.all_symbols = self.all_symbols.union(item['symbols']) + self.all_symbols = self.all_symbols.union(item["symbols"]) for cond in self.conditions: - self.all_symbols = self.all_symbols.union(cond['symbols']) + self.all_symbols = self.all_symbols.union(cond["symbols"]) - self.conditions = sorted(self.conditions, key=lambda x: -x['depth']) + self.conditions = sorted(self.conditions, key=lambda x: -x["depth"]) def to_dict(self): """ @@ -54,8 +51,7 @@ def to_dict(self): Returns: dict: the dictionary representation """ - return {'solution': self.solution, - 'conditions': self.conditions} + return {"solution": self.solution, "conditions": self.conditions} def check_non_negative(self, value) -> bool: """ @@ -88,10 +84,9 @@ def check_non_zero(self, value) -> bool: Returns: bool: True if the condition fails, False otherwise """ - return ((isinstance(value, (Interval, IntervalUnion)) - and value.contains(0)) - or (not isinstance(value, (Interval, IntervalUnion)) - and abs(value) < 1e-8)) + return (isinstance(value, (Interval, IntervalUnion)) and value.contains(0)) or ( + not isinstance(value, (Interval, IntervalUnion)) and abs(value) < 1e-8 + ) def evaluate(self, subs): """ @@ -108,41 +103,41 @@ def evaluate(self, subs): message = None term = None for condition in self.conditions: - if condition['mode'] == 'non-negative': + if condition["mode"] == "non-negative": value = Expression(**condition).evaluate(subs) if self.check_non_negative(value): - message = 'negative base' - term = condition['expression'] + message = "negative base" + term = condition["expression"] break - elif condition['mode'] == 'non-zero': + elif condition["mode"] == "non-zero": value = Expression(**condition).evaluate(subs) if self.check_non_zero(value): - message = 'zero division' - term = condition['expression'] + message = "zero division" + term = condition["expression"] break if message is not None: - return {'tp': None, - 'tn': None, - 'message': message, - 'term': term} + return {"tp": None, "tn": None, "message": message, "term": term} - res = {key: Expression(**value).evaluate(subs) for key, value in self.solution.items()} - if 'tp' in self.solution: - res['tp_formula'] = self.solution['tp']['expression'] + res = { + key: Expression(**value).evaluate(subs) + for key, value in self.solution.items() + } + if "tp" in self.solution: + res["tp_formula"] = self.solution["tp"]["expression"] - if 'tn' in self.solution: - res['tn_formula'] = self.solution['tn']['expression'] + if "tn" in self.solution: + res["tn_formula"] = self.solution["tn"]["expression"] return res + class Solutions: """ Represents all solutions to a particular problem """ - def __init__(self, - scores: list, - solutions: list): + + def __init__(self, scores: list, solutions: list): """ The constructor of the object @@ -161,8 +156,10 @@ def to_dict(self) -> dict: dict: the dictionary representation """ - return {'scores': self.scores, - 'solutions': [sol.to_dict() for sol in self.solutions]} + return { + "scores": self.scores, + "solutions": [sol.to_dict() for sol in self.solutions], + } def evaluate(self, subs): """ @@ -182,6 +179,7 @@ def evaluate(self, subs): return results + def load_solutions(): """ Load the solutions @@ -189,27 +187,32 @@ def load_solutions(): Returns: dict: the dictionary of the solutions """ - sio = files('mlscorecheck').joinpath(os.path.join('individual', 'solutions.json')).read_text() # pylint: disable=unspecified-encoding + sio = ( + files("mlscorecheck") + .joinpath(os.path.join("individual", "solutions.json")) + .read_text() + ) # pylint: disable=unspecified-encoding solutions_dict = json.loads(sio) results = {} - for sol in solutions_dict['solutions']: - scores = list(sol['scores']) - if 'p4' not in scores: + for sol in solutions_dict["solutions"]: + scores = list(sol["scores"]) + if "p4" not in scores: results[tuple(sorted(scores))] = Solutions(**sol) # removing the solutions containing complex values - del results[('fm', 'gm')] - del results[('fm', 'mk')] - #del results[('fm', 'p4')] # goes to complex - del results[('fm', 'upm')] # goes to complex - #del results[('dor', 'p4')] # goes to complex - del results[('dor', 'upm')] # goes to complex - del results[('gm', 'mk')] # goes to complex - del results[('gm', 'mcc')] # goes to complex when tn = 0 (maybe other times too) + del results[("fm", "gm")] + del results[("fm", "mk")] + # del results[('fm', 'p4')] # goes to complex + del results[("fm", "upm")] # goes to complex + # del results[('dor', 'p4')] # goes to complex + del results[("dor", "upm")] # goes to complex + del results[("gm", "mk")] # goes to complex + del results[("gm", "mcc")] # goes to complex when tn = 0 (maybe other times too) return results + solution_specifications = load_solutions() diff --git a/mlscorecheck/individual/_problem_generator.py b/mlscorecheck/individual/_problem_generator.py index c3b3259..bac76db 100644 --- a/mlscorecheck/individual/_problem_generator.py +++ b/mlscorecheck/individual/_problem_generator.py @@ -6,21 +6,26 @@ from ..scores import calculate_scores -__all__ = ['generate_problems', - 'generate_1_problem', - 'generate_problem_and_scores', - 'generate_multiclass_dataset', - 'sample_multiclass_dataset', - 'create_confusion_matrix'] - -def generate_problem_and_scores(*, - max_p: int = 1000, - max_n: int = 1000, - zeros: list = None, - add_complements: bool = None, - score_subset: list = None, - rounding_decimals: int = None, - random_state=None) -> (dict, dict): +__all__ = [ + "generate_problems", + "generate_1_problem", + "generate_problem_and_scores", + "generate_multiclass_dataset", + "sample_multiclass_dataset", + "create_confusion_matrix", +] + + +def generate_problem_and_scores( + *, + max_p: int = 1000, + max_n: int = 1000, + zeros: list = None, + add_complements: bool = None, + score_subset: list = None, + rounding_decimals: int = None, + random_state=None +) -> (dict, dict): """ Generates a random problem and random but feasible scores @@ -36,24 +41,29 @@ def generate_problem_and_scores(*, Returns: dict, dict: the problem and the scores """ - evaluation, problem = generate_1_problem(max_p=max_p, - max_n=max_n, - zeros=zeros, - add_complements=add_complements, - random_state=random_state) - evaluation['beta_negative'] = 2 - evaluation['beta_positive'] = 2 + evaluation, problem = generate_1_problem( + max_p=max_p, + max_n=max_n, + zeros=zeros, + add_complements=add_complements, + random_state=random_state, + ) + evaluation["beta_negative"] = 2 + evaluation["beta_positive"] = 2 scores = calculate_scores(evaluation, rounding_decimals=rounding_decimals) if score_subset is not None: scores = {key: value for key, value in scores.items() if key in score_subset} return problem, scores -def generate_1_problem(*, - max_p: int = 1000, - max_n: int = 1000, - zeros: list = None, - add_complements: bool = False, - random_state=None) -> dict: + +def generate_1_problem( + *, + max_p: int = 1000, + max_n: int = 1000, + zeros: list = None, + add_complements: bool = False, + random_state=None +) -> dict: """ Generates a random problem @@ -73,38 +83,41 @@ def generate_1_problem(*, if zeros is None: zeros = [] - p = int(random_state.randint(2, max_p+1)) - n = int(random_state.randint(2, max_n+1)) + p = int(random_state.randint(2, max_p + 1)) + n = int(random_state.randint(2, max_n + 1)) - if 'tp' in zeros: + if "tp" in zeros: tp = 0 - elif 'fn' in zeros: + elif "fn" in zeros: tp = p else: tp = int(random_state.randint(1, p)) - if 'tn' in zeros: + if "tn" in zeros: tn = 0 - elif 'fp' in zeros: + elif "fp" in zeros: tn = n else: tn = int(random_state.randint(1, n)) - result = {'p': p, 'n': n, 'tp': tp, 'tn': tn} + result = {"p": p, "n": n, "tp": tp, "tn": tn} if add_complements: - result['fn'] = p - tp - result['fp'] = n - tn - - return result, {'p': result['p'], 'n': result['n']} - -def generate_problems(*, - n_problems: int = 1, - max_p: int = 1000, - max_n: int = 1000, - zeros: list = None, - add_complements: bool = False, - random_state=None) -> (dict, dict): + result["fn"] = p - tp + result["fp"] = n - tn + + return result, {"p": result["p"], "n": result["n"]} + + +def generate_problems( + *, + n_problems: int = 1, + max_p: int = 1000, + max_n: int = 1000, + zeros: list = None, + add_complements: bool = False, + random_state=None +) -> (dict, dict): """ Generates a random problem @@ -125,21 +138,26 @@ def generate_problems(*, evaluations, problems = [], [] for _ in range(n_problems): - evaluation, problem = generate_1_problem(max_p=max_p, - max_n=max_n, - zeros=zeros, - add_complements=add_complements, - random_state=random_state) + evaluation, problem = generate_1_problem( + max_p=max_p, + max_n=max_n, + zeros=zeros, + add_complements=add_complements, + random_state=random_state, + ) evaluations.append(evaluation) problems.append(problem) return (evaluations[0], problems[0]) if n_problems == 1 else (evaluations, problems) -def generate_multiclass_dataset(random_state=None, - max_n_classes: int=5, - min_n_classes: int=3, - max_class_size: int=200, - min_class_size: int=10) -> dict: + +def generate_multiclass_dataset( + random_state=None, + max_n_classes: int = 5, + min_n_classes: int = 3, + max_class_size: int = 200, + min_class_size: int = 10, +) -> dict: """ Generates a multiclass dataset @@ -156,12 +174,15 @@ def generate_multiclass_dataset(random_state=None, if not isinstance(random_state, np.random.RandomState): random_state = np.random.RandomState(random_state) - n_classes = random_state.randint(min_n_classes, max_n_classes+1) - classes = {class_idx: random_state.randint(min_class_size, max_class_size+1) - for class_idx in range(n_classes)} + n_classes = random_state.randint(min_n_classes, max_n_classes + 1) + classes = { + class_idx: random_state.randint(min_class_size, max_class_size + 1) + for class_idx in range(n_classes) + } return classes + def create_confusion_matrix(y_true: np.array, y_pred: np.array) -> np.array: """ Creates a confusion matrix @@ -181,6 +202,7 @@ def create_confusion_matrix(y_true: np.array, y_pred: np.array) -> np.array: return confusion_matrix + def sample_multiclass_dataset(dataset: dict, random_state=None) -> np.array: """ Samples a multiclass dataset @@ -198,11 +220,11 @@ def sample_multiclass_dataset(dataset: dict, random_state=None) -> np.array: sample = np.zeros(shape=(len(dataset), len(dataset)), dtype=int) for class_idx, count in dataset.items(): - sample_row = random_state.multinomial(count, - np.ones(len(dataset))/len(dataset), - size=1)[0] + sample_row = random_state.multinomial( + count, np.ones(len(dataset)) / len(dataset), size=1 + )[0] - #while np.any(sample_row == 0): + # while np.any(sample_row == 0): # zidx = np.where(sample_row == 0)[0][0] # nzidx = np.where(sample_row > 1)[0][0] # sample_row[zidx] += 1 diff --git a/mlscorecheck/individual/_tptn_solution_bundles.py b/mlscorecheck/individual/_tptn_solution_bundles.py index 6afe6bc..da65932 100644 --- a/mlscorecheck/individual/_tptn_solution_bundles.py +++ b/mlscorecheck/individual/_tptn_solution_bundles.py @@ -2,50 +2,53 @@ This module implements some bundles of tp, tn solutions for scores """ -from ._tptn_solutions import (mcc_tp, - mcc_tn, - acc_tp, - acc_tn, - sens_tp, - spec_tn, - ppv_tp, - ppv_tn, - npv_tp, - npv_tn, - fbp_tp, - fbp_tn, - f1p_tp, - f1p_tn, - fbn_tp, - fbn_tn, - f1n_tp, - f1n_tn, - upm_tp, - upm_tn, - gm_tp, - gm_tn, - fm_tp, - fm_tn, - mk_tp, - mk_tn, - lrp_tp, - lrp_tn, - lrn_tp, - lrn_tn, - bm_tp, - bm_tn, - pt_tp, - pt_tn, - dor_tp, - dor_tn, - ji_tp, - ji_tn, - bacc_tp, - bacc_tn, - kappa_tp, - kappa_tn) +from ._tptn_solutions import ( + mcc_tp, + mcc_tn, + acc_tp, + acc_tn, + sens_tp, + spec_tn, + ppv_tp, + ppv_tn, + npv_tp, + npv_tn, + fbp_tp, + fbp_tn, + f1p_tp, + f1p_tn, + fbn_tp, + fbn_tn, + f1n_tp, + f1n_tn, + upm_tp, + upm_tn, + gm_tp, + gm_tn, + fm_tp, + fm_tn, + mk_tp, + mk_tn, + lrp_tp, + lrp_tn, + lrn_tp, + lrn_tn, + bm_tp, + bm_tn, + pt_tp, + pt_tn, + dor_tp, + dor_tn, + ji_tp, + ji_tn, + bacc_tp, + bacc_tn, + kappa_tp, + kappa_tn, +) + +__all__ = ["tp_solutions", "tn_solutions", "tptn_solutions", "is_applicable_tptn"] -__all__ = ['tp_solutions', 'tn_solutions', 'tptn_solutions', 'is_applicable_tptn'] def is_applicable_tptn(score: str, value: float, to_compute: str) -> bool: """ @@ -59,60 +62,86 @@ def is_applicable_tptn(score: str, value: float, to_compute: str) -> bool: Returns: bool: True if the setup can be solved, False otherwise """ - if score == 'pt' and value == 0.0 and to_compute == 'tp': + if score == "pt" and value == 0.0 and to_compute == "tp": return False - if score == 'pt' and value == 1.0 and to_compute == 'tn': + if score == "pt" and value == 1.0 and to_compute == "tn": return False return True -tp_solutions = {'mcc': mcc_tp, - 'acc': acc_tp, - 'sens': sens_tp, - 'ppv': ppv_tp, - 'npv': npv_tp, - 'fbp': fbp_tp, - 'f1p': f1p_tp, - 'fbn': fbn_tp, - 'f1n': f1n_tp, - 'upm': upm_tp, - 'gm': gm_tp, - 'fm': fm_tp, - 'mk': mk_tp, - 'lrp': lrp_tp, - 'lrn': lrn_tp, - 'bm': bm_tp, - 'pt': pt_tp, - 'dor': dor_tp, - 'ji': ji_tp, - 'bacc': bacc_tp, - 'kappa': kappa_tp} -tn_solutions = {'mcc': mcc_tn, - 'acc': acc_tn, - 'spec': spec_tn, - 'ppv': ppv_tn, - 'npv': npv_tn, - 'fbp': fbp_tn, - 'f1p': f1p_tn, - 'fbn': fbn_tn, - 'f1n': f1n_tn, - 'upm': upm_tn, - 'gm': gm_tn, - 'fm': fm_tn, - 'mk': mk_tn, - 'lrp': lrp_tn, - 'lrn': lrn_tn, - 'bm': bm_tn, - 'pt': pt_tn, - 'dor': dor_tn, - 'ji': ji_tn, - 'bacc': bacc_tn, - 'kappa': kappa_tn} +tp_solutions = { + "mcc": mcc_tp, + "acc": acc_tp, + "sens": sens_tp, + "ppv": ppv_tp, + "npv": npv_tp, + "fbp": fbp_tp, + "f1p": f1p_tp, + "fbn": fbn_tp, + "f1n": f1n_tp, + "upm": upm_tp, + "gm": gm_tp, + "fm": fm_tp, + "mk": mk_tp, + "lrp": lrp_tp, + "lrn": lrn_tp, + "bm": bm_tp, + "pt": pt_tp, + "dor": dor_tp, + "ji": ji_tp, + "bacc": bacc_tp, + "kappa": kappa_tp, +} + +tn_solutions = { + "mcc": mcc_tn, + "acc": acc_tn, + "spec": spec_tn, + "ppv": ppv_tn, + "npv": npv_tn, + "fbp": fbp_tn, + "f1p": f1p_tn, + "fbn": fbn_tn, + "f1n": f1n_tn, + "upm": upm_tn, + "gm": gm_tn, + "fm": fm_tn, + "mk": mk_tn, + "lrp": lrp_tn, + "lrn": lrn_tn, + "bm": bm_tn, + "pt": pt_tn, + "dor": dor_tn, + "ji": ji_tn, + "bacc": bacc_tn, + "kappa": kappa_tn, +} -tptn_solutions = {key: {'tp': tp_solutions.get(key), - 'tn': tn_solutions.get(key)} for key in ['mcc', 'acc', 'spec', 'sens', - 'ppv', 'npv', 'fbp', 'f1p', 'fbn', - 'f1n', 'upm', 'gm', 'fm', 'mk', 'lrp', - 'lrn', 'bm', 'pt', 'dor', 'ji', - 'bacc', 'kappa']} +tptn_solutions = { + key: {"tp": tp_solutions.get(key), "tn": tn_solutions.get(key)} + for key in [ + "mcc", + "acc", + "spec", + "sens", + "ppv", + "npv", + "fbp", + "f1p", + "fbn", + "f1n", + "upm", + "gm", + "fm", + "mk", + "lrp", + "lrn", + "bm", + "pt", + "dor", + "ji", + "bacc", + "kappa", + ] +} diff --git a/mlscorecheck/individual/_utils.py b/mlscorecheck/individual/_utils.py index 4081dad..657dc2f 100644 --- a/mlscorecheck/individual/_utils.py +++ b/mlscorecheck/individual/_utils.py @@ -7,20 +7,24 @@ import numpy as np from ._pair_solutions import solution_specifications -from ..scores import (score_functions_without_complements, - score_functions_standardized_without_complements, - score_function_aliases, - score_function_complements, - score_specifications) +from ..scores import ( + score_functions_without_complements, + score_functions_standardized_without_complements, + score_function_aliases, + score_function_complements, + score_specifications, +) from ._interval import Interval, IntervalUnion from ..core import NUMERICAL_TOLERANCE -__all__ = ['create_intervals', - 'create_problems_2', - 'resolve_aliases_and_complements', - 'is_less_than_zero', - 'is_zero', - 'unify_results'] +__all__ = [ + "create_intervals", + "create_problems_2", + "resolve_aliases_and_complements", + "is_less_than_zero", + "is_zero", + "unify_results", +] solutions = solution_specifications score_descriptors = score_specifications @@ -30,6 +34,7 @@ functions = score_functions_without_complements functions_standardized = score_functions_standardized_without_complements + def resolve_aliases_and_complements(scores: dict) -> dict: """ Standardizing the scores by resolving aliases and complements @@ -56,9 +61,10 @@ def resolve_aliases_and_complements(scores: dict) -> dict: return complemented -def create_intervals(scores: dict, - eps, - numerical_tolerance: float = NUMERICAL_TOLERANCE) -> dict: + +def create_intervals( + scores: dict, eps, numerical_tolerance: float = NUMERICAL_TOLERANCE +) -> dict: """ Turns the scores into intervals using the uncertainty specifications, the interval for a score will be (score - eps, score + eps). @@ -83,22 +89,28 @@ def create_intervals(scores: dict, eps = {key: eps for key in scores} # creating the intervals - intervals = {key: Interval(val - eps[key] - numerical_tolerance, - val + eps[key] + numerical_tolerance) - for key, val in scores.items()} + intervals = { + key: Interval( + val - eps[key] - numerical_tolerance, val + eps[key] + numerical_tolerance + ) + for key, val in scores.items() + } # trimming the intervals into the domains of the scores # for example, to prevent acc - eps < 0 implying a negative subinterval for # accuracy for key in intervals: if key in score_descriptors: - lower_bound = score_descriptors[key].get('lower_bound', -np.inf) - upper_bound = score_descriptors[key].get('upper_bound', np.inf) + lower_bound = score_descriptors[key].get("lower_bound", -np.inf) + upper_bound = score_descriptors[key].get("upper_bound", np.inf) - intervals[key] = intervals[key].intersection(Interval(lower_bound, upper_bound)) + intervals[key] = intervals[key].intersection( + Interval(lower_bound, upper_bound) + ) return intervals + def create_problems_2(scores: list) -> list: """ Given a set of scores, this function generates all test case specifications. @@ -114,12 +126,13 @@ def create_problems_2(scores: list) -> list: bases = list(itertools.combinations(scores, 2)) problems = [] for base0, base1 in bases: - problems.extend((base0, base1, score) - for score in scores - if score not in {base0, base1}) + problems.extend( + (base0, base1, score) for score in scores if score not in {base0, base1} + ) return problems + def is_less_than_zero(value) -> bool: """ Checks if the parameter is less than zero @@ -136,6 +149,7 @@ def is_less_than_zero(value) -> bool: return value.upper_bound < 0 return all(interval.upper_bound < 0 for interval in value.intervals) + def is_zero(value, tolerance: float = 1e-8) -> bool: """ Checks if the parameter is zero @@ -151,6 +165,7 @@ def is_zero(value, tolerance: float = 1e-8) -> bool: return abs(value) < tolerance return value.contains(0.0) + def unify_results(value_list): """ Unifies the list of solutions diff --git a/mlscorecheck/symbolic/_algebra.py b/mlscorecheck/symbolic/_algebra.py index 62c5889..d9f3c73 100644 --- a/mlscorecheck/symbolic/_algebra.py +++ b/mlscorecheck/symbolic/_algebra.py @@ -1,4 +1,3 @@ - """ This module implements the joint interface to the algebraic systems to be used. @@ -6,13 +5,14 @@ import abc -__all__ = ['Algebra'] +__all__ = ["Algebra"] class Algebra(metaclass=abc.ABCMeta): """ The base class of the algebra abstractions """ + @abc.abstractmethod def __init__(self): """ diff --git a/mlscorecheck/symbolic/_availability.py b/mlscorecheck/symbolic/_availability.py index 5646a3f..16b7f38 100644 --- a/mlscorecheck/symbolic/_availability.py +++ b/mlscorecheck/symbolic/_availability.py @@ -4,9 +4,7 @@ import importlib -__all__ = ['symbolic_toolkits', - 'get_symbolic_toolkit', - 'check_importability'] +__all__ = ["symbolic_toolkits", "get_symbolic_toolkit", "check_importability"] symbolic_toolkits = [] @@ -28,8 +26,8 @@ def check_importability(package: str): return None -symbolic_toolkits.append(check_importability('sympy')) -symbolic_toolkits.append(check_importability('sage')) +symbolic_toolkits.append(check_importability("sympy")) +symbolic_toolkits.append(check_importability("sage")) symbolic_toolkits = [package for package in symbolic_toolkits if package is not None] diff --git a/mlscorecheck/symbolic/_sage_algebra.py b/mlscorecheck/symbolic/_sage_algebra.py index 92fa7ab..0c794ce 100644 --- a/mlscorecheck/symbolic/_sage_algebra.py +++ b/mlscorecheck/symbolic/_sage_algebra.py @@ -5,26 +5,28 @@ so the sage-related codes are excluded from the coverage report. """ -__all__ = ['SageAlgebra'] +__all__ = ["SageAlgebra"] import importlib from ._algebra import Algebra -class SageAlgebra(Algebra): # pragma: no cover + +class SageAlgebra(Algebra): # pragma: no cover """ The required algebra driven by sage """ - def __init__(self): # pragma: no cover + + def __init__(self): # pragma: no cover """ Constructor of the algebra """ - Algebra.__init__(self) # pragma: no cover + Algebra.__init__(self) # pragma: no cover - self.algebra = importlib.import_module("sage.all") # pragma: no cover - self.sqrt = self.algebra.sqrt # pragma: no cover + self.algebra = importlib.import_module("sage.all") # pragma: no cover + self.sqrt = self.algebra.sqrt # pragma: no cover - def create_symbol(self, name, **kwargs): # pragma: no cover + def create_symbol(self, name, **kwargs): # pragma: no cover """ Create a symbol in the algebra with the specified name and assumptions @@ -35,25 +37,25 @@ def create_symbol(self, name, **kwargs): # pragma: no cover Returns: object: the symbol """ - var = self.algebra.var(name) # pragma: no cover - if kwargs.get('nonnegative', False): # pragma: no cover - self.algebra.assume(var >= 0) # pragma: no cover - if kwargs.get('positive', False): # pragma: no cover - self.algebra.assume(var > 0) # pragma: no cover - if kwargs.get('negative', False): # pragma: no cover - self.algebra.assume(var < 0) # pragma: no cover - if kwargs.get('nonpositive', False): # pragma: no cover - self.algebra.assume(var <= 0) # pragma: no cover - if kwargs.get('real', False): # pragma: no cover - self.algebra.assume(var, 'real') # pragma: no cover - if kwargs.get('upper_bound', None) is not None: # pragma: no cover - self.algebra.assume(var <= kwargs['upper_bound']) # pragma: no cover - if kwargs.get('lower_bound', None) is not None: # pragma: no cover - self.algebra.assume(var >= kwargs['lower_bound']) # pragma: no cover - - return var # pragma: no cover - - def num_denom(self, expression): # pragma: no cover + var = self.algebra.var(name) # pragma: no cover + if kwargs.get("nonnegative", False): # pragma: no cover + self.algebra.assume(var >= 0) # pragma: no cover + if kwargs.get("positive", False): # pragma: no cover + self.algebra.assume(var > 0) # pragma: no cover + if kwargs.get("negative", False): # pragma: no cover + self.algebra.assume(var < 0) # pragma: no cover + if kwargs.get("nonpositive", False): # pragma: no cover + self.algebra.assume(var <= 0) # pragma: no cover + if kwargs.get("real", False): # pragma: no cover + self.algebra.assume(var, "real") # pragma: no cover + if kwargs.get("upper_bound", None) is not None: # pragma: no cover + self.algebra.assume(var <= kwargs["upper_bound"]) # pragma: no cover + if kwargs.get("lower_bound", None) is not None: # pragma: no cover + self.algebra.assume(var >= kwargs["lower_bound"]) # pragma: no cover + + return var # pragma: no cover + + def num_denom(self, expression): # pragma: no cover """ Extract the numerator and denominator @@ -63,9 +65,9 @@ def num_denom(self, expression): # pragma: no cover Returns: object, object: the numerator and denominator """ - return expression.numerator(), expression.denominator() # pragma: no cover + return expression.numerator(), expression.denominator() # pragma: no cover - def simplify(self, expression): # pragma: no cover + def simplify(self, expression): # pragma: no cover """ Simplify the expression @@ -75,9 +77,9 @@ def simplify(self, expression): # pragma: no cover Returns: object: the symplified expression """ - return self.algebra.factor(expression) # pragma: no cover + return self.algebra.factor(expression) # pragma: no cover - def solve(self, equation, var, **kwargs): # pragma: no cover + def solve(self, equation, var, **kwargs): # pragma: no cover """ Solve an equation for a variable @@ -89,14 +91,14 @@ def solve(self, equation, var, **kwargs): # pragma: no cover Returns: list(dict): the solutions """ - results = self.algebra.solve(equation, var, **kwargs) # pragma: no cover - solutions = [] # pragma: no cover - for sol in results: # pragma: no cover - solution = {sol.lhs(): self.algebra.factor(sol.rhs())} # pragma: no cover - solutions.append(solution) # pragma: no cover - return solutions # pragma: no cover + results = self.algebra.solve(equation, var, **kwargs) # pragma: no cover + solutions = [] # pragma: no cover + for sol in results: # pragma: no cover + solution = {sol.lhs(): self.algebra.factor(sol.rhs())} # pragma: no cover + solutions.append(solution) # pragma: no cover + return solutions # pragma: no cover - def subs(self, expression, subs_dict): # pragma: no cover + def subs(self, expression, subs_dict): # pragma: no cover """ Substitute a substitution into the expression @@ -107,9 +109,9 @@ def subs(self, expression, subs_dict): # pragma: no cover Returns: object: the result of the substitution """ - return expression.subs(subs_dict) # pragma: no cover + return expression.subs(subs_dict) # pragma: no cover - def args(self, expression) -> list: # pragma: no cover + def args(self, expression) -> list: # pragma: no cover """ The list of arguments @@ -119,9 +121,9 @@ def args(self, expression) -> list: # pragma: no cover Returns: list: the list of arguments """ - return set(expression.args()) # pragma: no cover + return set(expression.args()) # pragma: no cover - def is_trivial(self, expression) -> bool: # pragma: no cover + def is_trivial(self, expression) -> bool: # pragma: no cover """ Checks if the expression is trivial @@ -131,9 +133,11 @@ def is_trivial(self, expression) -> bool: # pragma: no cover Returns: bool: True if the expression is trivial, False otherwise """ - return True if expression is None else expression.is_trivially_equal(1) # pragma: no cover + return ( + True if expression is None else expression.is_trivially_equal(1) + ) # pragma: no cover - def is_root(self, expression) -> bool: # pragma: no cover + def is_root(self, expression) -> bool: # pragma: no cover """ Checks if the expression is a root @@ -143,13 +147,13 @@ def is_root(self, expression) -> bool: # pragma: no cover Returns: bool: True if the expression is a root, False otherwise """ - if self.is_power(expression): # pragma: no cover - _, exponent = expression.operands() # pragma: no cover - if 0 < exponent < 1: # pragma: no cover - return True # pragma: no cover - return False # pragma: no cover + if self.is_power(expression): # pragma: no cover + _, exponent = expression.operands() # pragma: no cover + if 0 < exponent < 1: # pragma: no cover + return True # pragma: no cover + return False # pragma: no cover - def is_power(self, expression) -> bool: # pragma: no cover + def is_power(self, expression) -> bool: # pragma: no cover """ Checks whether the expression is a power @@ -159,10 +163,12 @@ def is_power(self, expression) -> bool: # pragma: no cover Returns: bool: whether the expression is a power """ - return bool(hasattr(expression.operator(), '__qualname__')\ - and expression.operator().__qualname__ == 'pow') # pragma: no cover + return bool( + hasattr(expression.operator(), "__qualname__") + and expression.operator().__qualname__ == "pow" + ) # pragma: no cover - def is_division(self, expression) -> bool: # pragma: no cover + def is_division(self, expression) -> bool: # pragma: no cover """ Checks whether the expression is a division @@ -172,27 +178,29 @@ def is_division(self, expression) -> bool: # pragma: no cover Returns: bool: whether the expression is a division """ - if self.is_power(expression): # pragma: no cover - operands = expression.operands() # pragma: no cover - if operands[1] < 0: # pragma: no cover - return True # pragma: no cover - - if hasattr(expression.operator(), '__qualname__') \ - and expression.operator().__qualname__ == 'mul_vararg': # pragma: no cover - operands = expression.operands() # pragma: no cover - - if len(operands) == 2: # pragma: no cover - if self.is_power(operands[1]): # pragma: no cover - _, power = operands[1].operands() # pragma: no cover - if power < 0: # pragma: no cover - return True # pragma: no cover - elif self.is_power(operands[0]): # pragma: no cover - _, power = operands[0].operands() # pragma: no cover - if power < 0: # pragma: no cover - return True # pragma: no cover - return False # pragma: no cover - - def operands(self, expression) -> list: # pragma: no cover + if self.is_power(expression): # pragma: no cover + operands = expression.operands() # pragma: no cover + if operands[1] < 0: # pragma: no cover + return True # pragma: no cover + + if ( + hasattr(expression.operator(), "__qualname__") + and expression.operator().__qualname__ == "mul_vararg" + ): # pragma: no cover + operands = expression.operands() # pragma: no cover + + if len(operands) == 2: # pragma: no cover + if self.is_power(operands[1]): # pragma: no cover + _, power = operands[1].operands() # pragma: no cover + if power < 0: # pragma: no cover + return True # pragma: no cover + elif self.is_power(operands[0]): # pragma: no cover + _, power = operands[0].operands() # pragma: no cover + if power < 0: # pragma: no cover + return True # pragma: no cover + return False # pragma: no cover + + def operands(self, expression) -> list: # pragma: no cover """ Returns the list of operands @@ -202,9 +210,9 @@ def operands(self, expression) -> list: # pragma: no cover Returns: list: the operands """ - return tuple(expression.operands()) # pragma: no cover + return tuple(expression.operands()) # pragma: no cover - def free_symbols(self, expression) -> list: # pragma: no cover + def free_symbols(self, expression) -> list: # pragma: no cover """ Get all free symbols in an expression @@ -214,4 +222,6 @@ def free_symbols(self, expression) -> list: # pragma: no cover Returns: list: the list of free symbols """ - return [str(var) for var in list(expression.free_variables())] # pragma: no cover + return [ + str(var) for var in list(expression.free_variables()) + ] # pragma: no cover diff --git a/mlscorecheck/symbolic/_score_objects.py b/mlscorecheck/symbolic/_score_objects.py index 08c1df1..ac92d4a 100644 --- a/mlscorecheck/symbolic/_score_objects.py +++ b/mlscorecheck/symbolic/_score_objects.py @@ -14,53 +14,59 @@ from ._symbols import Symbols -__all__ = ['Score', - 'PositiveLikelihoodRatio', - 'MatthewsCorrelationCoefficient', - 'Accuracy', - 'ErrorRate', - 'Sensitivity', - 'FalseNegativeRate', - 'FalsePositiveRate', - 'Specificity', - 'PositivePredictiveValue', - 'NegativePredictiveValue', - 'FalseDiscoveryRate', - 'FalseOmissionRate', - 'FBetaPositive', - 'F1Positive', - 'FBetaNegative', - 'F1Negative', - 'UnifiedPerformanceMeasure', - 'GeometricMean', - 'FowlkesMallowsIndex', - 'Markedness', - 'PositiveLikelihoodRatio', - 'NegativeLikelihoodRatio', - 'Informedness', - 'PrevalenceThreshold', - 'DiagnosticOddsRatio', - 'JaccardIndex', - 'BalancedAccuracy', - 'CohensKappa', - 'get_base_objects', - 'get_all_objects', - 'get_objects_without_complements'] +__all__ = [ + "Score", + "PositiveLikelihoodRatio", + "MatthewsCorrelationCoefficient", + "Accuracy", + "ErrorRate", + "Sensitivity", + "FalseNegativeRate", + "FalsePositiveRate", + "Specificity", + "PositivePredictiveValue", + "NegativePredictiveValue", + "FalseDiscoveryRate", + "FalseOmissionRate", + "FBetaPositive", + "F1Positive", + "FBetaNegative", + "F1Negative", + "UnifiedPerformanceMeasure", + "GeometricMean", + "FowlkesMallowsIndex", + "Markedness", + "PositiveLikelihoodRatio", + "NegativeLikelihoodRatio", + "Informedness", + "PrevalenceThreshold", + "DiagnosticOddsRatio", + "JaccardIndex", + "BalancedAccuracy", + "CohensKappa", + "get_base_objects", + "get_all_objects", + "get_objects_without_complements", +] scores = score_specifications functions = score_functions_standardized_with_complements -class Score: # pylint: disable=too-many-instance-attributes + +class Score: # pylint: disable=too-many-instance-attributes """ The Score base class """ - def __init__(self, - symbols: Symbols, - descriptor: dict, - *, - function, - expression: str = None, - equation: str = None): + + def __init__( + self, + symbols: Symbols, + descriptor: dict, + *, + function, + expression: str = None, + equation: str = None + ): """ Constructor of the base class @@ -74,15 +80,17 @@ def __init__(self, """ self.descriptor = descriptor - self.abbreviation = descriptor['abbreviation'] - self.name = descriptor['name'] - self.nans = descriptor.get('nans') - self.synonyms = descriptor.get('synonyms') - self.complement = descriptor.get('complement') - self.args = descriptor.get('args_standardized') - self.range = (descriptor.get('lower_bound', -np.inf), - descriptor.get('upper_bound', np.inf)) - self.sqrt = descriptor.get('sqrt', False) + self.abbreviation = descriptor["abbreviation"] + self.name = descriptor["name"] + self.nans = descriptor.get("nans") + self.synonyms = descriptor.get("synonyms") + self.complement = descriptor.get("complement") + self.args = descriptor.get("args_standardized") + self.range = ( + descriptor.get("lower_bound", -np.inf), + descriptor.get("upper_bound", np.inf), + ) + self.sqrt = descriptor.get("sqrt", False) # setting the base kit of symbols @@ -91,14 +99,16 @@ def __init__(self, # setting the symbol kwargs = {} if self.range[0] > -np.inf: - kwargs['lower_bound'] = self.range[0] + kwargs["lower_bound"] = self.range[0] if self.range[1] < np.inf: - kwargs['upper_bound'] = self.range[1] - self.symbol = self.symbols.algebra.create_symbol(self.abbreviation, real=True, **kwargs) + kwargs["upper_bound"] = self.range[1] + self.symbol = self.symbols.algebra.create_symbol( + self.abbreviation, real=True, **kwargs + ) # setting the score function if isinstance(function, str): - module = importlib.import_module('mlscorecheck.scores') + module = importlib.import_module("mlscorecheck.scores") self.function = getattr(module, function) else: self.function = function @@ -107,7 +117,7 @@ def __init__(self, arg_symbols = {arg: getattr(symbols, arg) for arg in self.args} if self.sqrt: - arg_symbols['sqrt'] = symbols.sqrt + arg_symbols["sqrt"] = symbols.sqrt # setting the expression if expression is not None: @@ -124,7 +134,7 @@ def __init__(self, # setting the polynomial equation subs = {**{self.abbreviation: self.symbol}, **arg_symbols} - self.equation_polynomial = safe_eval(descriptor['polynomial_equation'], subs) + self.equation_polynomial = safe_eval(descriptor["polynomial_equation"], subs) def get_algebra(self): """ @@ -141,16 +151,18 @@ def to_dict(self): dict: the dictionary representation """ return { - 'descriptor': self.descriptor, - 'expression': str(self.expression), - 'equation': str(self.equation), - 'function': self.function.__name__ + "descriptor": self.descriptor, + "expression": str(self.expression), + "equation": str(self.equation), + "function": self.function.__name__, } + class Accuracy(Score): """ The accuracy score """ + def __init__(self, symbols): """ The constructor of the score @@ -158,15 +170,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['acc'], - function=functions['acc']) + Score.__init__(self, symbols, scores["acc"], function=functions["acc"]) + class ErrorRate(Score): """ The error rate score """ + def __init__(self, symbols): """ The constructor of the score @@ -174,15 +185,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['err'], - function=functions['err']) + Score.__init__(self, symbols, scores["err"], function=functions["err"]) + class Sensitivity(Score): """ The sensitivity score """ + def __init__(self, symbols): """ The constructor of the score @@ -190,15 +200,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['sens'], - function=functions['sens']) + Score.__init__(self, symbols, scores["sens"], function=functions["sens"]) + class FalseNegativeRate(Score): """ The false negative rate """ + def __init__(self, symbols): """ The constructor of the score @@ -206,15 +215,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fnr'], - function=functions['fnr']) + Score.__init__(self, symbols, scores["fnr"], function=functions["fnr"]) + class FalsePositiveRate(Score): """ The false positive rate """ + def __init__(self, symbols): """ The constructor of the score @@ -222,15 +230,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fpr'], - function=functions['fpr']) + Score.__init__(self, symbols, scores["fpr"], function=functions["fpr"]) + class Specificity(Score): """ The specificity score """ + def __init__(self, symbols): """ The constructor of the score @@ -238,15 +245,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['spec'], - function=functions['spec']) + Score.__init__(self, symbols, scores["spec"], function=functions["spec"]) + class PositivePredictiveValue(Score): """ The positive predictive value """ + def __init__(self, symbols): """ The constructor of the score @@ -254,15 +260,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['ppv'], - function=functions['ppv']) + Score.__init__(self, symbols, scores["ppv"], function=functions["ppv"]) + class FalseDiscoveryRate(Score): """ The false discovery rate """ + def __init__(self, symbols): """ The constructor of the score @@ -270,15 +275,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fdr'], - function=functions['fdr']) + Score.__init__(self, symbols, scores["fdr"], function=functions["fdr"]) + class FalseOmissionRate(Score): """ The false omission rate """ + def __init__(self, symbols): """ The constructor of the score @@ -286,15 +290,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['for_'], - function=functions['for_']) + Score.__init__(self, symbols, scores["for_"], function=functions["for_"]) + class NegativePredictiveValue(Score): """ The negative predictive value """ + def __init__(self, symbols): """ The constructor of the score @@ -302,15 +305,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['npv'], - function=functions['npv']) + Score.__init__(self, symbols, scores["npv"], function=functions["npv"]) + class FBetaPositive(Score): """ The f-beta plus score """ + def __init__(self, symbols): """ The constructor of the score @@ -318,15 +320,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fbp'], - function=functions['fbp']) + Score.__init__(self, symbols, scores["fbp"], function=functions["fbp"]) + class F1Positive(Score): """ The f1-plus score """ + def __init__(self, symbols): """ The constructor of the score @@ -334,15 +335,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['f1p'], - function=functions['f1p']) + Score.__init__(self, symbols, scores["f1p"], function=functions["f1p"]) + class FBetaNegative(Score): """ The f-beta minus score """ + def __init__(self, symbols): """ The constructor of the score @@ -350,15 +350,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fbn'], - function=functions['fbn']) + Score.__init__(self, symbols, scores["fbn"], function=functions["fbn"]) + class F1Negative(Score): """ The f1-minus score """ + def __init__(self, symbols): """ The constructor of the score @@ -366,15 +365,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['f1n'], - function=functions['f1n']) + Score.__init__(self, symbols, scores["f1n"], function=functions["f1n"]) + class GeometricMean(Score): """ The geometric mean score """ + def __init__(self, symbols): """ The constructor of the score @@ -382,15 +380,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['gm'], - function=functions['gm']) + Score.__init__(self, symbols, scores["gm"], function=functions["gm"]) + class FowlkesMallowsIndex(Score): """ The Fowlkes-Mallows-index """ + def __init__(self, symbols): """ The constructor of the score @@ -398,15 +395,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['fm'], - function=functions['fm']) + Score.__init__(self, symbols, scores["fm"], function=functions["fm"]) + class UnifiedPerformanceMeasure(Score): """ The unified performance measure score """ + def __init__(self, symbols): """ The constructor of the score @@ -414,16 +410,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['upm'], - function=functions['upm']) + Score.__init__(self, symbols, scores["upm"], function=functions["upm"]) class Markedness(Score): """ The markedness score """ + def __init__(self, symbols): """ The constructor of the score @@ -431,15 +425,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['mk'], - function=functions['mk']) + Score.__init__(self, symbols, scores["mk"], function=functions["mk"]) + class PositiveLikelihoodRatio(Score): """ The positive likelihood ratio score """ + def __init__(self, symbols): """ The constructor of the score @@ -447,15 +440,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['lrp'], - function=functions['lrp']) + Score.__init__(self, symbols, scores["lrp"], function=functions["lrp"]) + class NegativeLikelihoodRatio(Score): """ The negative likelihood ratio score """ + def __init__(self, symbols): """ The constructor of the score @@ -463,15 +455,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['lrn'], - function=functions['lrn']) + Score.__init__(self, symbols, scores["lrn"], function=functions["lrn"]) + class Informedness(Score): """ The informedness score """ + def __init__(self, symbols): """ The constructor of the score @@ -479,15 +470,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['bm'], - function=functions['bm']) + Score.__init__(self, symbols, scores["bm"], function=functions["bm"]) + class PrevalenceThreshold(Score): """ The prevalence threshold """ + def __init__(self, symbols): """ The constructor of the score @@ -495,15 +485,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['pt'], - function=functions['pt']) + Score.__init__(self, symbols, scores["pt"], function=functions["pt"]) + class DiagnosticOddsRatio(Score): """ The diagnostic odds ratio """ + def __init__(self, symbols): """ The constructor of the score @@ -511,15 +500,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['dor'], - function=functions['dor']) + Score.__init__(self, symbols, scores["dor"], function=functions["dor"]) + class JaccardIndex(Score): """ The Jaccard index """ + def __init__(self, symbols): """ The constructor of the score @@ -527,15 +515,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['ji'], - function=functions['ji']) + Score.__init__(self, symbols, scores["ji"], function=functions["ji"]) + class BalancedAccuracy(Score): """ The balanced accuracy score """ + def __init__(self, symbols): """ The constructor of the score @@ -543,15 +530,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['bacc'], - function=functions['bacc']) + Score.__init__(self, symbols, scores["bacc"], function=functions["bacc"]) + class CohensKappa(Score): """ Cohen's kappa """ + def __init__(self, symbols): """ The constructor of the score @@ -559,15 +545,14 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['kappa'], - function=functions['kappa']) + Score.__init__(self, symbols, scores["kappa"], function=functions["kappa"]) + class MatthewsCorrelationCoefficient(Score): """ The MatthewsCorrelationCoefficient score """ + def __init__(self, symbols): """ The constructor of the score @@ -575,12 +560,10 @@ def __init__(self, symbols): Args: symbols (Symbols): the algebraic symbols to be used """ - Score.__init__(self, - symbols, - scores['mcc'], - function=functions['mcc']) + Score.__init__(self, symbols, scores["mcc"], function=functions["mcc"]) -def get_base_objects(algebraic_system: str = 'sympy') -> dict: + +def get_base_objects(algebraic_system: str = "sympy") -> dict: """ Returns the dict of basic score objects @@ -591,19 +574,25 @@ def get_base_objects(algebraic_system: str = 'sympy') -> dict: dict: the dictionary of basic score objects """ symbols = Symbols(algebraic_system=algebraic_system) - score_objects = [cls(symbols=symbols) for cls in [Accuracy, - Sensitivity, - Specificity, - PositivePredictiveValue, - NegativePredictiveValue, - BalancedAccuracy, - F1Positive, - FowlkesMallowsIndex]] + score_objects = [ + cls(symbols=symbols) + for cls in [ + Accuracy, + Sensitivity, + Specificity, + PositivePredictiveValue, + NegativePredictiveValue, + BalancedAccuracy, + F1Positive, + FowlkesMallowsIndex, + ] + ] score_objects = {obj.abbreviation: obj for obj in score_objects} return score_objects -def get_all_objects(algebraic_system: str = 'sympy') -> dict: + +def get_all_objects(algebraic_system: str = "sympy") -> dict: """ Returns the dict of all score objects @@ -619,7 +608,8 @@ def get_all_objects(algebraic_system: str = 'sympy') -> dict: return score_objects -def get_objects_without_complements(algebraic_system: str = 'sympy') -> dict: + +def get_objects_without_complements(algebraic_system: str = "sympy") -> dict: """ Returns the dict of basic score objects without complements @@ -631,7 +621,10 @@ def get_objects_without_complements(algebraic_system: str = 'sympy') -> dict: """ symbols = Symbols(algebraic_system=algebraic_system) score_objects = [cls(symbols=symbols) for cls in Score.__subclasses__()] - score_objects = {obj.abbreviation: obj for obj in score_objects - if obj.abbreviation in score_functions_without_complements} + score_objects = { + obj.abbreviation: obj + for obj in score_objects + if obj.abbreviation in score_functions_without_complements + } return score_objects diff --git a/mlscorecheck/symbolic/_solver.py b/mlscorecheck/symbolic/_solver.py index 3204a35..c6b9f8c 100644 --- a/mlscorecheck/symbolic/_solver.py +++ b/mlscorecheck/symbolic/_solver.py @@ -7,17 +7,18 @@ from ._algebra import Algebra from ._score_objects import Score -__all__ = ['ProblemSolver', - 'collect_denominators_and_bases', - '_collect_denominators_and_bases', - 'solve_order', - 'check_recurrent_solution'] - -def _collect_denominators_and_bases(expression, - denoms: list, - bases: list, - algebra: Algebra, - depth: int): +__all__ = [ + "ProblemSolver", + "collect_denominators_and_bases", + "_collect_denominators_and_bases", + "solve_order", + "check_recurrent_solution", +] + + +def _collect_denominators_and_bases( + expression, denoms: list, bases: list, algebra: Algebra, depth: int +): """ Recursive core of collecting all denominators and bases @@ -35,19 +36,22 @@ def _collect_denominators_and_bases(expression, if not algebra.is_trivial(denom): denoms.append((denom, depth)) - _collect_denominators_and_bases(denom, denoms, bases, algebra, depth+1) - _collect_denominators_and_bases(num, denoms, bases, algebra, depth+1) + _collect_denominators_and_bases(denom, denoms, bases, algebra, depth + 1) + _collect_denominators_and_bases(num, denoms, bases, algebra, depth + 1) elif algebra.is_root(expression): # fractional exponents are already checked here base, exponent = algebra.operands(expression) bases.append((base, float(exponent), depth)) for operand in algebra.operands(base): - _collect_denominators_and_bases(operand, denoms, bases, algebra, depth+1) + _collect_denominators_and_bases(operand, denoms, bases, algebra, depth + 1) else: for operand in algebra.operands(expression): if not algebra.is_trivial(operand): - _collect_denominators_and_bases(operand, denoms, bases, algebra, depth+1) + _collect_denominators_and_bases( + operand, denoms, bases, algebra, depth + 1 + ) + def collect_denominators_and_bases(expression, algebra: Algebra) -> (list, list): """ @@ -86,6 +90,7 @@ def collect_denominators_and_bases(expression, algebra: Algebra) -> (list, list) return denoms, bases + def solve_order(score0: Score, score1: Score): """ Determining the order the equations should be solved, based on using the shortest solution @@ -105,11 +110,13 @@ def solve_order(score0: Score, score1: Score): sols = {} lens = {} - for figure in ['tp', 'tn']: + for figure in ["tp", "tn"]: for score_idx, score in enumerate([score0, score1]): key = (figure, score_idx) if figure in algebra.free_symbols(score.equation_polynomial): - sols[key] = algebra.solve(score.equation_polynomial, getattr(symbols, figure)) + sols[key] = algebra.solve( + score.equation_polynomial, getattr(symbols, figure) + ) lens[key] = len(str(sols[key][0][getattr(symbols, figure)])) min_length = 1e10 @@ -120,26 +127,31 @@ def solve_order(score0: Score, score1: Score): min_length = value min_variable = key - if ('tn', 0) not in sols or ('tp', 1) not in sols: - return score0.equation_polynomial, score1.equation_polynomial, 'tp', 'tn' - if ('tp', 0) not in sols or ('tn', 1) not in sols: - return score0.equation_polynomial, score1.equation_polynomial, 'tn', 'tp' + if ("tn", 0) not in sols or ("tp", 1) not in sols: + return score0.equation_polynomial, score1.equation_polynomial, "tp", "tn" + if ("tp", 0) not in sols or ("tn", 1) not in sols: + return score0.equation_polynomial, score1.equation_polynomial, "tn", "tp" first_variable = None second_variable = None - if min_variable[0] == 'tp': + if min_variable[0] == "tp": first_variable = symbols.tp second_variable = symbols.tn if min_variable[1] == 1: score0, score1 = score1, score0 - elif min_variable[0] == 'tn': + elif min_variable[0] == "tn": first_variable = symbols.tn second_variable = symbols.tp if min_variable[1] == 1: score0, score1 = score1, score0 - return (score0.equation_polynomial, score1.equation_polynomial, - str(first_variable), str(second_variable)) + return ( + score0.equation_polynomial, + score1.equation_polynomial, + str(first_variable), + str(second_variable), + ) + def check_recurrent_solution(symbol: str, symbols: list) -> bool: """ @@ -150,15 +162,17 @@ def check_recurrent_solution(symbol: str, symbols: list) -> bool: symbols (list): the free symbols """ if symbol in symbols: - logger.warning('recurrent %s %s', symbol, str(symbols)) + logger.warning("recurrent %s %s", symbol, str(symbols)) return symbol in symbols + class ProblemSolver: """ The problem solver object, used to solve the individual problems with the aid of computer algebra systems """ + def __init__(self, score0: Score, score1: Score): """ The constructor of the object @@ -187,10 +201,10 @@ def corner_case_solution(self, solution): """ var0, var1 = list(solution.keys()) flag = False - if str(solution[var0]['expression']) in {'0', 'n', 'p'}: + if str(solution[var0]["expression"]) in {"0", "n", "p"}: # triggered in the ppv-fm case flag = True - if str(solution[var1]['expression']) in {'0', 'n', 'p'}: + if str(solution[var1]["expression"]) in {"0", "n", "p"}: # triggered in the fm-ppv case flag = True @@ -206,7 +220,7 @@ def solve(self, **kwargs): Returns: self: the solver object """ - logger.info('solving %s %s', self.score0.abbreviation, self.score1.abbreviation) + logger.info("solving %s %s", self.score0.abbreviation, self.score1.abbreviation) self.solutions = [] @@ -222,28 +236,38 @@ def solve(self, **kwargs): # iterating through all solutions # substitution into the other equation if needed - equation1_tmp = (algebra.subs(equation1, v0_sol) - if sym0 in algebra.args(equation1) - else equation1) + equation1_tmp = ( + algebra.subs(equation1, v0_sol) + if sym0 in algebra.args(equation1) + else equation1 + ) # solving for sym1 v1_sols = algebra.solve(equation1_tmp, sym1, **kwargs) - logger.info('solved') + logger.info("solved") # assembling all solutions for v1_sol in v1_sols: - v0_final = (algebra.subs(v0_sol[sym0], v1_sol) - if sym1 in algebra.args(v0_sol[sym0]) - else v0_sol[sym0]) - - sol = {var0: {'expression': algebra.simplify(v0_final), - 'symbols': algebra.free_symbols(v0_final)}, - var1: {'expression': algebra.simplify(v1_sol[sym1]), - 'symbols': algebra.free_symbols(v1_sol[sym1])}} - - check_recurrent_solution(str(var0), sol[var0]['symbols']) - check_recurrent_solution(str(var1), sol[var1]['symbols']) + v0_final = ( + algebra.subs(v0_sol[sym0], v1_sol) + if sym1 in algebra.args(v0_sol[sym0]) + else v0_sol[sym0] + ) + + sol = { + var0: { + "expression": algebra.simplify(v0_final), + "symbols": algebra.free_symbols(v0_final), + }, + var1: { + "expression": algebra.simplify(v1_sol[sym1]), + "symbols": algebra.free_symbols(v1_sol[sym1]), + }, + } + + check_recurrent_solution(str(var0), sol[var0]["symbols"]) + check_recurrent_solution(str(var1), sol[var1]["symbols"]) if not self.corner_case_solution(sol): self.solutions.append(sol) @@ -265,36 +289,52 @@ def edge_cases(self): bases_sol = {} for _, sol in solution.items(): - denoms, bases = collect_denominators_and_bases(algebra.simplify(sol['expression']), - algebra) + denoms, bases = collect_denominators_and_bases( + algebra.simplify(sol["expression"]), algebra + ) denoms = list(denoms) bases = list(bases) for denom, depth in denoms: denom_str = str(denom) - if ((denom_str not in denoms_sol) or (denoms_sol[denom_str][1] < depth)): + if (denom_str not in denoms_sol) or ( + denoms_sol[denom_str][1] < depth + ): denoms_sol[denom_str] = (denom, depth) for base, exponent, depth in bases: base_str = str((base, exponent)) - if ((base_str not in bases_sol) or (bases_sol[base_str][2] < depth)): + if (base_str not in bases_sol) or (bases_sol[base_str][2] < depth): bases_sol[base_str] = (base, exponent, depth) - denoms_sol = [{'expression': str(denom[0]), - 'symbols': algebra.free_symbols(denom[0]), - 'depth': denom[1], - 'mode': 'non-zero'} for denom in list(denoms_sol.values())] - bases_sol = [{'expression': str(base[0]), - 'exponent': base[1], - 'symbols': algebra.free_symbols(base[0]), - 'depth': base[2], - 'mode': 'non-negative'} for base in list(bases_sol.values())] + denoms_sol = [ + { + "expression": str(denom[0]), + "symbols": algebra.free_symbols(denom[0]), + "depth": denom[1], + "mode": "non-zero", + } + for denom in list(denoms_sol.values()) + ] + bases_sol = [ + { + "expression": str(base[0]), + "exponent": base[1], + "symbols": algebra.free_symbols(base[0]), + "depth": base[2], + "mode": "non-negative", + } + for base in list(bases_sol.values()) + ] self.denoms.append(denoms_sol) self.bases.append(bases_sol) self.conditions.append(denoms_sol + bases_sol) - tmp = {str(key): {key2: str(value2) - if key2 == 'expression' - else value2 for key2, value2 in value.items()} - for key, value in solution.items()} + tmp = { + str(key): { + key2: str(value2) if key2 == "expression" else value2 + for key2, value2 in value.items() + } + for key, value in solution.items() + } self.str_solutions.append(tmp) def get_solution(self) -> Solutions: @@ -307,10 +347,11 @@ def get_solution(self) -> Solutions: results = [] for solution, conditions in zip(self.str_solutions, self.conditions): - results.append({'solution': solution, - 'conditions': conditions}) + results.append({"solution": solution, "conditions": conditions}) - solution = Solutions(scores=[self.score0.abbreviation, self.score1.abbreviation], - solutions=results) + solution = Solutions( + scores=[self.score0.abbreviation, self.score1.abbreviation], + solutions=results, + ) return solution diff --git a/mlscorecheck/symbolic/_symbols.py b/mlscorecheck/symbolic/_symbols.py index 3a21f2d..2099175 100644 --- a/mlscorecheck/symbolic/_symbols.py +++ b/mlscorecheck/symbolic/_symbols.py @@ -2,7 +2,7 @@ This module implements the wrapper for the symbols """ -__all__ = ['Symbols'] +__all__ = ["Symbols"] from ._sympy_algebra import SympyAlgebra @@ -13,6 +13,7 @@ class Symbols: # pylint: disable=too-many-instance-attributes """ A symbols class representing the basic symbols to be used """ + def __init__(self, algebraic_system): """ The constructor of the object @@ -21,17 +22,21 @@ def __init__(self, algebraic_system): algebraic_system ('sympy'/'sage'): the algebraic system to be used """ self.algebraic_system = algebraic_system - if algebraic_system == 'sympy': + if algebraic_system == "sympy": self.algebra = SympyAlgebra() - elif algebraic_system == 'sage': # pragma: no cover - self.algebra = SageAlgebra() # pragma: no cover - - self.tp = self.algebra.create_symbol('tp', nonnegative=True, real=True) - self.tn = self.algebra.create_symbol('tn', nonnegative=True, real=True) - self.p = self.algebra.create_symbol('p', positive=True, real=True) - self.n = self.algebra.create_symbol('n', positive=True, real=True) - self.beta_positive = self.algebra.create_symbol('beta_positive', positive=True, real=True) - self.beta_negative = self.algebra.create_symbol('beta_negative', positive=True, real=True) + elif algebraic_system == "sage": # pragma: no cover + self.algebra = SageAlgebra() # pragma: no cover + + self.tp = self.algebra.create_symbol("tp", nonnegative=True, real=True) + self.tn = self.algebra.create_symbol("tn", nonnegative=True, real=True) + self.p = self.algebra.create_symbol("p", positive=True, real=True) + self.n = self.algebra.create_symbol("n", positive=True, real=True) + self.beta_positive = self.algebra.create_symbol( + "beta_positive", positive=True, real=True + ) + self.beta_negative = self.algebra.create_symbol( + "beta_negative", positive=True, real=True + ) self.sqrt = self.algebra.sqrt def get_algebra(self): @@ -50,10 +55,12 @@ def to_dict(self) -> dict: Returns: dict: the dictionary representation """ - return {'tp': self.tp, - 'tn': self.tn, - 'p': self.p, - 'n': self.n, - 'beta_positive': self.beta_positive, - 'beta_negative': self.beta_negative, - 'sqrt': self.sqrt} + return { + "tp": self.tp, + "tn": self.tn, + "p": self.p, + "n": self.n, + "beta_positive": self.beta_positive, + "beta_negative": self.beta_negative, + "sqrt": self.sqrt, + } diff --git a/mlscorecheck/symbolic/_sympy_algebra.py b/mlscorecheck/symbolic/_sympy_algebra.py index e7aeb54..1661b33 100644 --- a/mlscorecheck/symbolic/_sympy_algebra.py +++ b/mlscorecheck/symbolic/_sympy_algebra.py @@ -2,16 +2,18 @@ This module implements the wrapper for the sympy algebra """ -__all__ = ['SympyAlgebra'] +__all__ = ["SympyAlgebra"] import importlib from ._algebra import Algebra + class SympyAlgebra(Algebra): """ The required algebra driven by sympy """ + def __init__(self): """ Constructor of the algebra @@ -32,10 +34,10 @@ def create_symbol(self, name: str, **kwargs): Returns: object: the symbol """ - if 'upper_bound' in kwargs: - del kwargs['upper_bound'] - if 'lower_bound' in kwargs: - del kwargs['lower_bound'] + if "upper_bound" in kwargs: + del kwargs["upper_bound"] + if "lower_bound" in kwargs: + del kwargs["lower_bound"] return self.algebra.Symbol(name, **kwargs) def num_denom(self, expression): diff --git a/tests/aggregated/_evaluate_lp.py b/tests/aggregated/_evaluate_lp.py index 0f7f690..7ab183e 100644 --- a/tests/aggregated/_evaluate_lp.py +++ b/tests/aggregated/_evaluate_lp.py @@ -8,13 +8,12 @@ from mlscorecheck.aggregated import compare_scores, Experiment -__all__ = ['evaluate_timeout'] +__all__ = ["evaluate_timeout"] -def evaluate_timeout(result: pl.LpProblem, - problem: Experiment, - scores: dict, - eps, - score_subset: list): + +def evaluate_timeout( + result: pl.LpProblem, problem: Experiment, scores: dict, eps, score_subset: list +): """ Evaluate the stopped or succeeded tests @@ -29,6 +28,6 @@ def evaluate_timeout(result: pl.LpProblem, populated = problem.populate(result) assert compare_scores(scores, populated.calculate_scores(), eps, score_subset) - assert populated.check_bounds()['bounds_flag'] is True + assert populated.check_bounds()["bounds_flag"] is True elif result.status == 0: - warnings.warn('test timed out') + warnings.warn("test timed out") diff --git a/tests/aggregated/test_check_aggregated_scores.py b/tests/aggregated/test_check_aggregated_scores.py index 9871764..7e50610 100644 --- a/tests/aggregated/test_check_aggregated_scores.py +++ b/tests/aggregated/test_check_aggregated_scores.py @@ -4,13 +4,16 @@ import pytest -from mlscorecheck.aggregated import (check_aggregated_scores, - generate_experiment, - round_scores, - Experiment) +from mlscorecheck.aggregated import ( + check_aggregated_scores, + generate_experiment, + round_scores, + Experiment, +) random_seeds = list(range(20)) + def check_timeout(details): """ Checks if timeout happened @@ -18,34 +21,48 @@ def check_timeout(details): Args: details (dict): the result of the test """ - if details['lp_status'] != 'timeout': - return (details['lp_configuration_scores_match'] - and details['lp_configuration_bounds_match'] - and details['lp_configuration'] is not None) + if details["lp_status"] != "timeout": + return ( + details["lp_configuration_scores_match"] + and details["lp_configuration_bounds_match"] + and details["lp_configuration"] is not None + ) return True + def test_check_timeout(): """ Testing the check_timeout function """ - assert check_timeout({'lp_status': 'dummy', - 'lp_configuration_scores_match': True, - 'lp_configuration_bounds_match': True, - 'lp_configuration': 'dummy'}) - - assert not check_timeout({'lp_status': 'dummy', - 'lp_configuration_scores_match': True, - 'lp_configuration_bounds_match': True, - 'lp_configuration': None}) - - assert check_timeout({'lp_status': 'timeout'}) - -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('rounding_decimals', [2, 3, 4]) -@pytest.mark.parametrize('aggregations', [('som', 'som'), ('mos', 'mos'), ('mos', 'som')]) -def test_check_aggregated_scores_feasible(random_seed: int, - rounding_decimals: int, - aggregations: tuple): + assert check_timeout( + { + "lp_status": "dummy", + "lp_configuration_scores_match": True, + "lp_configuration_bounds_match": True, + "lp_configuration": "dummy", + } + ) + + assert not check_timeout( + { + "lp_status": "dummy", + "lp_configuration_scores_match": True, + "lp_configuration_bounds_match": True, + "lp_configuration": None, + } + ) + + assert check_timeout({"lp_status": "timeout"}) + + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("rounding_decimals", [2, 3, 4]) +@pytest.mark.parametrize( + "aggregations", [("som", "som"), ("mos", "mos"), ("mos", "som")] +) +def test_check_aggregated_scores_feasible( + random_seed: int, rounding_decimals: int, aggregations: tuple +): """ Testing the top level aggregated check function with a feasible problem @@ -54,25 +71,31 @@ def test_check_aggregated_scores_feasible(random_seed: int, rounding_decimals (int): the number of decimals to round to aggregations (tuple(str,str)): the aggregations to use """ - experiment, scores = generate_experiment(random_state=random_seed, - return_scores=True, - aggregation=aggregations[0], - evaluation_params={'aggregation': aggregations[1]}) + experiment, scores = generate_experiment( + random_state=random_seed, + return_scores=True, + aggregation=aggregations[0], + evaluation_params={"aggregation": aggregations[1]}, + ) scores = round_scores(scores, rounding_decimals) - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=10**(-rounding_decimals), - timeout=1) + details = check_aggregated_scores( + experiment=experiment, scores=scores, eps=10 ** (-rounding_decimals), timeout=1 + ) - assert not details['inconsistency'] - assert details['lp_status'] in {'feasible', 'timeout'} + assert not details["inconsistency"] + assert details["lp_status"] in {"feasible", "timeout"} assert check_timeout(details) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregations', [('som', 'som'), ('mos', 'mos'), ('mos', 'som')]) -def test_check_aggregated_scores_feasible_custom_solver(random_seed: int, aggregations: tuple): + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize( + "aggregations", [("som", "som"), ("mos", "mos"), ("mos", "som")] +) +def test_check_aggregated_scores_feasible_custom_solver( + random_seed: int, aggregations: tuple +): """ Testing the top level aggregated check function with a feasible problem with custom solver @@ -81,24 +104,27 @@ def test_check_aggregated_scores_feasible_custom_solver(random_seed: int, aggreg random_seed (int): the random seed to use aggregations (tuple(str,str)): the aggregations to use """ - experiment, scores = generate_experiment(random_state=random_seed, - return_scores=True, - aggregation=aggregations[0], - evaluation_params={'aggregation': aggregations[1]}) + experiment, scores = generate_experiment( + random_state=random_seed, + return_scores=True, + aggregation=aggregations[0], + evaluation_params={"aggregation": aggregations[1]}, + ) scores = round_scores(scores, 4) - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-3, - solver_name='dummy', - timeout=1) + details = check_aggregated_scores( + experiment=experiment, scores=scores, eps=1e-3, solver_name="dummy", timeout=1 + ) - assert not details['inconsistency'] - assert details['lp_status'] in {'feasible', 'timeout'} + assert not details["inconsistency"] + assert details["lp_status"] in {"feasible", "timeout"} assert check_timeout(details) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregations', [('som', 'som'), ('mos', 'mos'), ('mos', 'som')]) + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize( + "aggregations", [("som", "som"), ("mos", "mos"), ("mos", "som")] +) def test_check_aggregated_scores_infeasible(random_seed: int, aggregations: tuple): """ Testing the top level aggregated check function with an infeasible problem @@ -108,20 +134,21 @@ def test_check_aggregated_scores_infeasible(random_seed: int, aggregations: tupl random_seed (int): the random seed to use aggregations (tuple(str,str)): the aggregations to use """ - experiment, scores = generate_experiment(random_state=random_seed, - return_scores=True, - aggregation=aggregations[0], - evaluation_params={'aggregation': aggregations[1]}) + experiment, scores = generate_experiment( + random_state=random_seed, + return_scores=True, + aggregation=aggregations[0], + evaluation_params={"aggregation": aggregations[1]}, + ) - scores = {'acc': 0.1, 'sens': 0.1, 'spec': 0.1, 'bacc': 0.4} + scores = {"acc": 0.1, "sens": 0.1, "spec": 0.1, "bacc": 0.4} - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-4) + details = check_aggregated_scores(experiment=experiment, scores=scores, eps=1e-4) + + assert details["inconsistency"] + assert details["lp_status"] == "infeasible" + assert details["lp_configuration"] is not None - assert details['inconsistency'] - assert details['lp_status'] == 'infeasible' - assert details['lp_configuration'] is not None def test_check_aggregated_scores_timeout(): """ @@ -129,203 +156,200 @@ def test_check_aggregated_scores_timeout(): Eventually this test can fail, due to the unpredictability of solvers timing out """ - experiment, scores = generate_experiment(max_evaluations=20, - evaluation_params={'max_folds': 20, - 'max_repeats': 20, - 'aggregation': 'mos', - 'feasible_fold_score_bounds': True}, - random_state=5, - return_scores=True, - aggregation='mos', - feasible_dataset_score_bounds=True) + experiment, scores = generate_experiment( + max_evaluations=20, + evaluation_params={ + "max_folds": 20, + "max_repeats": 20, + "aggregation": "mos", + "feasible_fold_score_bounds": True, + }, + random_state=5, + return_scores=True, + aggregation="mos", + feasible_dataset_score_bounds=True, + ) scores = round_scores(scores, 7) - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-7, - timeout=0.001, - numerical_tolerance=1e-9) + details = check_aggregated_scores( + experiment=experiment, + scores=scores, + eps=1e-7, + timeout=0.001, + numerical_tolerance=1e-9, + ) + + assert not details["inconsistency"] + assert details["lp_status"] == "timeout" + assert details["lp_configuration"] is not None - assert not details['inconsistency'] - assert details['lp_status'] == 'timeout' - assert details['lp_configuration'] is not None def test_no_suitable_score(): """ Testing the case when no score is suitable """ - details = check_aggregated_scores(experiment=None, - scores={'f1': 0.5}, - eps=1e-7, - timeout=0.001, - numerical_tolerance=1e-9) + details = check_aggregated_scores( + experiment=None, + scores={"f1": 0.5}, + eps=1e-7, + timeout=0.001, + numerical_tolerance=1e-9, + ) + + assert not details["inconsistency"] - assert not details['inconsistency'] def test_others(): """ Testing other functionalities """ - experiment, scores = generate_experiment(aggregation='som', - evaluation_params={'aggregation': 'mos'}, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="som", evaluation_params={"aggregation": "mos"}, return_scores=True + ) with pytest.raises(ValueError): - check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-4) + check_aggregated_scores(experiment=experiment, scores=scores, eps=1e-4) + def test_aggregated_success_with_p_zero(): """ Testing a valid configuration with one p in a fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 0, 'n': 5}, {'p': 5, 'n': 10}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} + dataset = {"p": 10, "n": 20} + folds = [{"p": 0, "n": 5}, {"p": 5, "n": 10}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} experiment = Experiment(**experiment) - experiment.sample_figures(score_subset=['acc', 'spec']) + experiment.sample_figures(score_subset=["acc", "spec"]) - scores = experiment.calculate_scores(score_subset=['acc', 'spec'], - rounding_decimals=4) + scores = experiment.calculate_scores( + score_subset=["acc", "spec"], rounding_decimals=4 + ) - details = check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) + details = check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=1e-4, + solver_name="dummy", + timeout=1, + ) - assert not details['inconsistency'] - assert details['lp_status'] in {'feasible', 'timeout'} + assert not details["inconsistency"] + assert details["lp_status"] in {"feasible", "timeout"} assert check_timeout(details) + def test_aggregated_failure_with_p_zero(): """ Testing an invalid configuration with one p in a fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 0, 'n': 5}, {'p': 5, 'n': 10}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} + dataset = {"p": 10, "n": 20} + folds = [{"p": 0, "n": 5}, {"p": 5, "n": 10}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} + + scores = {"acc": 0.9584, "spec": 0.9576} - scores = {'acc': 0.9584, 'spec': 0.9576} + details = check_aggregated_scores( + experiment=experiment, scores=scores, eps=1e-4, solver_name="dummy", timeout=1 + ) - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) + assert details["inconsistency"] - assert details['inconsistency'] def test_aggregated_success_with_n_zero(): """ Testing a valid configuration with one n in a fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 2, 'n': 0}, {'p': 3, 'n': 15}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} + dataset = {"p": 10, "n": 20} + folds = [{"p": 2, "n": 0}, {"p": 3, "n": 15}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} experiment = Experiment(**experiment) - experiment.sample_figures(score_subset=['acc', 'sens']) + experiment.sample_figures(score_subset=["acc", "sens"]) - scores = experiment.calculate_scores(score_subset=['acc', 'sens'], - rounding_decimals=4) + scores = experiment.calculate_scores( + score_subset=["acc", "sens"], rounding_decimals=4 + ) - details = check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) + details = check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=1e-4, + solver_name="dummy", + timeout=1, + ) - assert not details['inconsistency'] - assert details['lp_status'] in {'feasible', 'timeout'} + assert not details["inconsistency"] + assert details["lp_status"] in {"feasible", "timeout"} assert check_timeout(details) + def test_aggregated_failure_with_n_zero(): """ Testing an invalid configuration with one n in a fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 2, 'n': 0}, {'p': 3, 'n': 15}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} + dataset = {"p": 10, "n": 20} + folds = [{"p": 2, "n": 0}, {"p": 3, "n": 15}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} + + scores = {"acc": 0.9584, "sens": 0.9576} - scores = {'acc': 0.9584, 'sens': 0.9576} + details = check_aggregated_scores( + experiment=experiment, scores=scores, eps=1e-4, solver_name="dummy", timeout=1 + ) - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) + assert details["inconsistency"] - assert details['inconsistency'] def test_aggregated_success_with_n_or_p_zero(): """ Testing a valid configuration with one p and one n in some fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 5, 'n': 0}, {'p': 0, 'n': 15}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} + dataset = {"p": 10, "n": 20} + folds = [{"p": 5, "n": 0}, {"p": 0, "n": 15}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} experiment = Experiment(**experiment) - experiment.sample_figures(score_subset=['acc']) + experiment.sample_figures(score_subset=["acc"]) - scores = experiment.calculate_scores(score_subset=['acc'], - rounding_decimals=4) + scores = experiment.calculate_scores(score_subset=["acc"], rounding_decimals=4) - details = check_aggregated_scores(experiment=experiment.to_dict(), - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) + details = check_aggregated_scores( + experiment=experiment.to_dict(), + scores=scores, + eps=1e-4, + solver_name="dummy", + timeout=1, + ) - assert not details['inconsistency'] - assert details['lp_status'] in {'feasible', 'timeout'} + assert not details["inconsistency"] + assert details["lp_status"] in {"feasible", "timeout"} assert check_timeout(details) + def test_aggregated_failure_with_n_or_p_zero(): """ Testing an invalid configuration with one p and one n in some fold zero """ - dataset = {'p': 10, 'n': 20} - folds = [{'p': 5, 'n': 0}, {'p': 0, 'n': 15}, {'p': 5, 'n': 5}] - evaluation = {'dataset': dataset, - 'folding': {'folds': folds}, - 'aggregation': 'mos'} - experiment = {'evaluations': [evaluation], - 'aggregation': 'mos'} - - scores = {'acc': 0.9584} - - details = check_aggregated_scores(experiment=experiment, - scores=scores, - eps=1e-4, - solver_name='dummy', - timeout=1) - - assert details['inconsistency'] + dataset = {"p": 10, "n": 20} + folds = [{"p": 5, "n": 0}, {"p": 0, "n": 15}, {"p": 5, "n": 5}] + evaluation = {"dataset": dataset, "folding": {"folds": folds}, "aggregation": "mos"} + experiment = {"evaluations": [evaluation], "aggregation": "mos"} + + scores = {"acc": 0.9584} + + details = check_aggregated_scores( + experiment=experiment, scores=scores, eps=1e-4, solver_name="dummy", timeout=1 + ) + + assert details["inconsistency"] diff --git a/tests/aggregated/test_dataset.py b/tests/aggregated/test_dataset.py index 954af89..11cbc82 100644 --- a/tests/aggregated/test_dataset.py +++ b/tests/aggregated/test_dataset.py @@ -13,11 +13,11 @@ import pytest -from mlscorecheck.aggregated import (Dataset, - generate_dataset) +from mlscorecheck.aggregated import Dataset, generate_dataset random_seeds = list(range(20)) + def test_dataset_instantiation(): """ Testing the instantiation of a dataset @@ -30,9 +30,9 @@ def test_dataset_instantiation(): Dataset() with pytest.raises(ValueError): - Dataset(p=5, n=10, dataset_name='common_datasets.ADA') + Dataset(p=5, n=10, dataset_name="common_datasets.ADA") - dataset = Dataset(dataset_name='common_datasets.ADA') + dataset = Dataset(dataset_name="common_datasets.ADA") assert dataset.p > 0 and dataset.n > 0 @@ -40,7 +40,8 @@ def test_dataset_instantiation(): assert dataset2.p == dataset.p and dataset2.n == dataset.n -@pytest.mark.parametrize('random_seed', random_seeds) + +@pytest.mark.parametrize("random_seed", random_seeds) def test_dataset_generation(random_seed: int): """ Testing the dataset generation diff --git a/tests/aggregated/test_evaluation.py b/tests/aggregated/test_evaluation.py index b8e282a..64be9cc 100644 --- a/tests/aggregated/test_evaluation.py +++ b/tests/aggregated/test_evaluation.py @@ -8,39 +8,53 @@ import pulp as pl -from mlscorecheck.aggregated import (Evaluation, - generate_dataset, - generate_folding, - generate_evaluation, - solve, - compare_scores, - get_fold_score_bounds) +from mlscorecheck.aggregated import ( + Evaluation, + generate_dataset, + generate_folding, + generate_evaluation, + solve, + compare_scores, + get_fold_score_bounds, +) from ._evaluate_lp import evaluate_timeout -PREFERRED_SOLVER = 'PULP_CBC_CMD' +PREFERRED_SOLVER = "PULP_CBC_CMD" solvers = pl.listSolvers(onlyAvailable=True) PREFERRED_SOLVER = PREFERRED_SOLVER if PREFERRED_SOLVER in solvers else solvers[0] solver = pl.getSolver(PREFERRED_SOLVER) solver_timeout = pl.getSolver(PREFERRED_SOLVER, timeLimit=5) -two_combs = [['acc', 'sens'], ['acc', 'spec'], ['acc', 'bacc'], - ['sens', 'spec'], ['sens', 'bacc'], ['spec', 'bacc']] -three_combs = [['acc', 'sens', 'spec'], ['acc', 'sens', 'bacc'], - ['acc', 'spec', 'bacc'], ['sens', 'spec', 'bacc']] -four_combs = [['acc', 'sens', 'spec', 'bacc']] +two_combs = [ + ["acc", "sens"], + ["acc", "spec"], + ["acc", "bacc"], + ["sens", "spec"], + ["sens", "bacc"], + ["spec", "bacc"], +] +three_combs = [ + ["acc", "sens", "spec"], + ["acc", "sens", "bacc"], + ["acc", "spec", "bacc"], + ["sens", "spec", "bacc"], +] +four_combs = [["acc", "sens", "spec", "bacc"]] random_seeds = list(range(5)) + def test_evaluate_timeout(): """ Testing the evaluate_timeout function """ - class Mock: # pylint: disable=too-few-public-methods + class Mock: # pylint: disable=too-few-public-methods """ Mock lp_problem class """ + def __init__(self): """ Constructor of the mock class @@ -53,8 +67,9 @@ def __init__(self): evaluate_timeout(mock, None, None, None, None) assert len(warn) == 1 -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) def test_instantiation(random_seed: int, aggregation: str): """ Testing the instantiation of evaluations @@ -73,11 +88,14 @@ def test_instantiation(random_seed: int, aggregation: str): evaluation2 = Evaluation(**evaluation.to_dict()) - assert evaluation.figures['p'] == evaluation2.figures['p']\ - and evaluation.figures['n'] == evaluation2.figures['n'] + assert ( + evaluation.figures["p"] == evaluation2.figures["p"] + and evaluation.figures["n"] == evaluation2.figures["n"] + ) + -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) def test_sample_figures(random_seed: int, aggregation: str): """ Testing the sampling of figures @@ -94,16 +112,16 @@ def test_sample_figures(random_seed: int, aggregation: str): evaluation.sample_figures(random_state=random_seed).calculate_scores() - assert evaluation.figures['tp'] >= 0 and evaluation.figures['tn'] >= 0 + assert evaluation.figures["tp"] >= 0 and evaluation.figures["tn"] >= 0 -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) -@pytest.mark.parametrize('rounding_decimals', [2, 3, 4]) -def test_linear_programming_success(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) +@pytest.mark.parametrize("rounding_decimals", [2, 3, 4]) +def test_linear_programming_success( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities @@ -125,27 +143,29 @@ def test_linear_programming_success(subset: list, skeleton = Evaluation(dataset, folding, aggregation=aggregation) - lp_program = solve(skeleton, scores, eps=10**(-rounding_decimals)) + lp_program = solve(skeleton, scores, eps=10 ** (-rounding_decimals)) assert lp_program.status == 1 skeleton.populate(lp_program) - assert compare_scores(scores, - skeleton.calculate_scores(), - eps=10**(-rounding_decimals), - tolerance=1e-6) - - assert skeleton.check_bounds()['bounds_flag'] - -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) -@pytest.mark.parametrize('rounding_decimals', [2, 3, 4]) -def test_linear_programming_evaluation_generation_success(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + assert compare_scores( + scores, + skeleton.calculate_scores(), + eps=10 ** (-rounding_decimals), + tolerance=1e-6, + ) + + assert skeleton.check_bounds()["bounds_flag"] + + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) +@pytest.mark.parametrize("rounding_decimals", [2, 3, 4]) +def test_linear_programming_evaluation_generation_success( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities by generating the evaluation @@ -156,8 +176,7 @@ def test_linear_programming_evaluation_generation_success(subset: list, rounding_decimals (int): the number of decimals to round to """ - evaluation = generate_evaluation(random_state=random_seed, - aggregation=aggregation) + evaluation = generate_evaluation(random_state=random_seed, aggregation=aggregation) evaluation = Evaluation(**evaluation) @@ -167,21 +186,25 @@ def test_linear_programming_evaluation_generation_success(subset: list, skeleton = Evaluation(**evaluation.to_dict()) - lp_program = solve(skeleton, scores, eps=10**(-rounding_decimals)) + lp_program = solve(skeleton, scores, eps=10 ** (-rounding_decimals)) assert lp_program.status == 1 skeleton.populate(lp_program) - assert compare_scores(scores, - skeleton.calculate_scores(), - eps=10**(-rounding_decimals), - tolerance=1e-6) + assert compare_scores( + scores, + skeleton.calculate_scores(), + eps=10 ** (-rounding_decimals), + tolerance=1e-6, + ) + -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) -def test_linear_programming_evaluation_generation_failure(random_seed: int, - aggregation: str): +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) +def test_linear_programming_evaluation_generation_failure( + random_seed: int, aggregation: str +): """ Testing the linear programming functionalities by generating the evaluation @@ -190,14 +213,13 @@ def test_linear_programming_evaluation_generation_failure(random_seed: int, aggregation (str): the aggregation to use ('mos'/'som') """ - evaluation = generate_evaluation(random_state=random_seed, - aggregation=aggregation) + evaluation = generate_evaluation(random_state=random_seed, aggregation=aggregation) evaluation = Evaluation(**evaluation) evaluation.sample_figures(random_state=random_seed) - scores = {'acc': 0.5, 'sens': 0.6, 'spec': 0.6} + scores = {"acc": 0.5, "sens": 0.6, "spec": 0.6} skeleton = Evaluation(**evaluation.to_dict()) @@ -205,8 +227,9 @@ def test_linear_programming_evaluation_generation_failure(random_seed: int, assert lp_program.status == -1 -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) def test_get_fold_score_bounds(random_seed: int, aggregation: str): """ Testing the extraction of fold score bounds @@ -216,8 +239,7 @@ def test_get_fold_score_bounds(random_seed: int, aggregation: str): aggregation (str): the aggregation to use ('mos'/'som') """ - evaluation = generate_evaluation(random_state=random_seed, - aggregation=aggregation) + evaluation = generate_evaluation(random_state=random_seed, aggregation=aggregation) evaluation = Evaluation(**evaluation) evaluation.sample_figures().calculate_scores() @@ -228,14 +250,14 @@ def test_get_fold_score_bounds(random_seed: int, aggregation: str): for key in score_bounds: assert score_bounds[key][0] <= fold.scores[key] <= score_bounds[key][1] -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) -def test_linear_programming_success_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) +def test_linear_programming_success_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities by generating the evaluation with bounds @@ -247,31 +269,35 @@ def test_linear_programming_success_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(random_state=random_seed, - aggregation=aggregation, - feasible_fold_score_bounds=True, - rounding_decimals=rounding_decimals, - return_scores=True, - score_subset=subset) + evaluation, scores = generate_evaluation( + random_state=random_seed, + aggregation=aggregation, + feasible_fold_score_bounds=True, + rounding_decimals=rounding_decimals, + return_scores=True, + score_subset=subset, + ) evaluation = Evaluation(**evaluation) skeleton = Evaluation(**evaluation.to_dict()) - lp_program = solve(skeleton, scores, eps=10**(-rounding_decimals), solver=solver_timeout) + lp_program = solve( + skeleton, scores, eps=10 ** (-rounding_decimals), solver=solver_timeout + ) assert lp_program.status in (0, 1) - evaluate_timeout(lp_program, skeleton, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, skeleton, scores, 10 ** (-rounding_decimals), subset) + -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) -def test_linear_programming_failure_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) +def test_linear_programming_failure_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities by generating the evaluation with bounds @@ -283,29 +309,33 @@ def test_linear_programming_failure_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(random_state=random_seed, - aggregation=aggregation, - feasible_fold_score_bounds=False, - rounding_decimals=rounding_decimals, - return_scores=True, - score_subset=subset) + evaluation, scores = generate_evaluation( + random_state=random_seed, + aggregation=aggregation, + feasible_fold_score_bounds=False, + rounding_decimals=rounding_decimals, + return_scores=True, + score_subset=subset, + ) evaluation = Evaluation(**evaluation) skeleton = Evaluation(**evaluation.to_dict()) - lp_program = solve(skeleton, scores, eps=10**(-rounding_decimals), solver=solver_timeout) + lp_program = solve( + skeleton, scores, eps=10 ** (-rounding_decimals), solver=solver_timeout + ) assert lp_program.status in (-1, 0) - evaluate_timeout(lp_program, skeleton, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, skeleton, scores, 10 ** (-rounding_decimals), subset) + def test_others(): """ Testing other functionalities """ - evaluation = generate_evaluation(aggregation='som', - feasible_fold_score_bounds=True) + evaluation = generate_evaluation(aggregation="som", feasible_fold_score_bounds=True) with pytest.raises(ValueError): Evaluation(**evaluation) diff --git a/tests/aggregated/test_experiment.py b/tests/aggregated/test_experiment.py index f551cb9..f61ead9 100644 --- a/tests/aggregated/test_experiment.py +++ b/tests/aggregated/test_experiment.py @@ -17,29 +17,42 @@ import numpy as np -from mlscorecheck.aggregated import (Experiment, - solve, - generate_experiment, - compare_scores, - get_dataset_score_bounds) +from mlscorecheck.aggregated import ( + Experiment, + solve, + generate_experiment, + compare_scores, + get_dataset_score_bounds, +) from ._evaluate_lp import evaluate_timeout -PREFERRED_SOLVER = 'PULP_CBC_CMD' +PREFERRED_SOLVER = "PULP_CBC_CMD" solvers = pl.listSolvers(onlyAvailable=True) PREFERRED_SOLVER = PREFERRED_SOLVER if PREFERRED_SOLVER in solvers else solvers[0] solver = pl.getSolver(PREFERRED_SOLVER) solver_timeout = pl.getSolver(PREFERRED_SOLVER, timeLimit=5) -two_combs = [['acc', 'sens'], ['acc', 'spec'], ['acc', 'bacc'], - ['sens', 'spec'], ['sens', 'bacc'], ['spec', 'bacc']] -three_combs = [['acc', 'sens', 'spec'], ['acc', 'sens', 'bacc'], - ['acc', 'spec', 'bacc'], ['sens', 'spec', 'bacc']] -four_combs = [['acc', 'sens', 'spec', 'bacc']] +two_combs = [ + ["acc", "sens"], + ["acc", "spec"], + ["acc", "bacc"], + ["sens", "spec"], + ["sens", "bacc"], + ["spec", "bacc"], +] +three_combs = [ + ["acc", "sens", "spec"], + ["acc", "sens", "bacc"], + ["acc", "spec", "bacc"], + ["sens", "spec", "bacc"], +] +four_combs = [["acc", "sens", "spec", "bacc"]] random_seeds = list(range(5)) -@pytest.mark.parametrize('random_seed', random_seeds) + +@pytest.mark.parametrize("random_seed", random_seeds) def test_experiment_instantiation(random_seed: int): """ Testing the creation of Experiment objects @@ -55,10 +68,13 @@ def test_experiment_instantiation(random_seed: int): experiment2 = Experiment(**experiment.to_dict()) - assert experiment.figures['p'] == experiment2.figures['p']\ - and experiment.figures['n'] == experiment2.figures['n'] + assert ( + experiment.figures["p"] == experiment2.figures["p"] + and experiment.figures["n"] == experiment2.figures["n"] + ) + -@pytest.mark.parametrize('random_seed', random_seeds) +@pytest.mark.parametrize("random_seed", random_seeds) def test_sampling_and_scores(random_seed: int): """ Testing the score calculation in experiments @@ -74,19 +90,27 @@ def test_sampling_and_scores(random_seed: int): scores = experiment.calculate_scores() - if experiment.aggregation == 'som': - value = float(experiment.figures['tp'] / experiment.figures['p']) - assert abs(scores['sens'] - value) < 1e-10 - elif experiment.aggregation == 'mos': - assert abs(np.mean([evaluation.scores['acc'] for evaluation in experiment.evaluations])\ - - scores['acc']) < 1e-10 - -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('aggregation_folds', ['mos', 'som']) -def test_get_dataset_score_bounds(random_seed: int, - aggregation: str, - aggregation_folds: str): + if experiment.aggregation == "som": + value = float(experiment.figures["tp"] / experiment.figures["p"]) + assert abs(scores["sens"] - value) < 1e-10 + elif experiment.aggregation == "mos": + assert ( + abs( + np.mean( + [evaluation.scores["acc"] for evaluation in experiment.evaluations] + ) + - scores["acc"] + ) + < 1e-10 + ) + + +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("aggregation_folds", ["mos", "som"]) +def test_get_dataset_score_bounds( + random_seed: int, aggregation: str, aggregation_folds: str +): """ Testing the score bounds determination @@ -96,9 +120,11 @@ def test_get_dataset_score_bounds(random_seed: int, aggregation_folds (str): the aggregation on folds ('mos'/'som') """ - experiment = generate_experiment(random_state=random_seed, - aggregation=aggregation, - evaluation_params={'aggregation': aggregation_folds}) + experiment = generate_experiment( + random_state=random_seed, + aggregation=aggregation, + evaluation_params={"aggregation": aggregation_folds}, + ) experiment = Experiment(**experiment) experiment.sample_figures().calculate_scores() @@ -106,23 +132,29 @@ def test_get_dataset_score_bounds(random_seed: int, for evaluation in experiment.evaluations: for key in score_bounds: - assert score_bounds[key][0] <= evaluation.scores[key] <= score_bounds[key][1] + assert ( + score_bounds[key][0] <= evaluation.scores[key] <= score_bounds[key][1] + ) score_bounds = get_dataset_score_bounds(experiment, feasible=False) for evaluation in experiment.evaluations: for key in score_bounds: if score_bounds[key][0] < 1.0: - assert not score_bounds[key][0] <= evaluation.scores[key] <= score_bounds[key][1] - -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) -@pytest.mark.parametrize('rounding_decimals', [2, 3, 4]) -def test_linear_programming_success(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + assert ( + not score_bounds[key][0] + <= evaluation.scores[key] + <= score_bounds[key][1] + ) + + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) +@pytest.mark.parametrize("rounding_decimals", [2, 3, 4]) +def test_linear_programming_success( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities in a successful scenario @@ -133,8 +165,7 @@ def test_linear_programming_success(subset: list, rounding_decimals (int): the number of decimals to round to """ - experiment = generate_experiment(random_state=random_seed, - aggregation=aggregation) + experiment = generate_experiment(random_state=random_seed, aggregation=aggregation) experiment = Experiment(**experiment) experiment.sample_figures(random_state=random_seed) @@ -143,27 +174,29 @@ def test_linear_programming_success(subset: list, skeleton = Experiment(**experiment.to_dict()) - lp_program = solve(skeleton, scores, eps=10**(-rounding_decimals)) + lp_program = solve(skeleton, scores, eps=10 ** (-rounding_decimals)) assert lp_program.status == 1 skeleton.populate(lp_program) - assert compare_scores(scores, - skeleton.calculate_scores(), - eps=10**(-rounding_decimals), - tolerance=1e-6) - - assert skeleton.check_bounds()['bounds_flag'] - -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [2, 3, 4]) -def test_linear_programming_success_with_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + assert compare_scores( + scores, + skeleton.calculate_scores(), + eps=10 ** (-rounding_decimals), + tolerance=1e-6, + ) + + assert skeleton.check_bounds()["bounds_flag"] + + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [2, 3, 4]) +def test_linear_programming_success_with_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities with bounds @@ -174,28 +207,32 @@ def test_linear_programming_success_with_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(random_state=random_seed, - aggregation=aggregation, - return_scores=True, - feasible_dataset_score_bounds=True, - score_subset=subset) + experiment, scores = generate_experiment( + random_state=random_seed, + aggregation=aggregation, + return_scores=True, + feasible_dataset_score_bounds=True, + score_subset=subset, + ) experiment = Experiment(**experiment) - lp_program = solve(experiment, scores, eps=10**(-rounding_decimals), solver=solver_timeout) + lp_program = solve( + experiment, scores, eps=10 ** (-rounding_decimals), solver=solver_timeout + ) assert lp_program.status in (0, 1) - evaluate_timeout(lp_program, experiment, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, experiment, scores, 10 ** (-rounding_decimals), subset) -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) -def test_linear_programming_failure_with_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) +def test_linear_programming_failure_with_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities with bounds @@ -206,28 +243,32 @@ def test_linear_programming_failure_with_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(random_state=random_seed, - aggregation=aggregation, - return_scores=True, - feasible_dataset_score_bounds=False, - score_subset=subset) + experiment, scores = generate_experiment( + random_state=random_seed, + aggregation=aggregation, + return_scores=True, + feasible_dataset_score_bounds=False, + score_subset=subset, + ) experiment = Experiment(**experiment) - lp_program = solve(experiment, scores, eps=10**(-rounding_decimals), solver=solver_timeout) + lp_program = solve( + experiment, scores, eps=10 ** (-rounding_decimals), solver=solver_timeout + ) assert lp_program.status in (0, -1) - evaluate_timeout(lp_program, experiment, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, experiment, scores, 10 ** (-rounding_decimals), subset) + -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [2, 3]) -def test_linear_programming_success_both_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [2, 3]) +def test_linear_programming_success_both_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities with both bounds @@ -238,34 +279,34 @@ def test_linear_programming_success_both_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(random_state=random_seed, - aggregation=aggregation, - evaluation_params={'aggregation': 'mos', - 'feasible_fold_score_bounds': True}, - return_scores=True, - rounding_decimals=rounding_decimals, - feasible_dataset_score_bounds=True, - score_subset=subset) + experiment, scores = generate_experiment( + random_state=random_seed, + aggregation=aggregation, + evaluation_params={"aggregation": "mos", "feasible_fold_score_bounds": True}, + return_scores=True, + rounding_decimals=rounding_decimals, + feasible_dataset_score_bounds=True, + score_subset=subset, + ) experiment = Experiment(**experiment) - lp_program = solve(experiment, - scores, - eps=10**(-rounding_decimals), - solver=solver_timeout) + lp_program = solve( + experiment, scores, eps=10 ** (-rounding_decimals), solver=solver_timeout + ) assert lp_program.status in (0, 1) - evaluate_timeout(lp_program, experiment, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, experiment, scores, 10 ** (-rounding_decimals), subset) -@pytest.mark.parametrize('subset', two_combs + three_combs + four_combs) -@pytest.mark.parametrize('random_seed', random_seeds) -@pytest.mark.parametrize('aggregation', ['mos']) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) -def test_linear_programming_failure_both_bounds(subset: list, - random_seed: int, - aggregation: str, - rounding_decimals: int): + +@pytest.mark.parametrize("subset", two_combs + three_combs + four_combs) +@pytest.mark.parametrize("random_seed", random_seeds) +@pytest.mark.parametrize("aggregation", ["mos"]) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) +def test_linear_programming_failure_both_bounds( + subset: list, random_seed: int, aggregation: str, rounding_decimals: int +): """ Testing the linear programming functionalities with both bounds @@ -276,29 +317,32 @@ def test_linear_programming_failure_both_bounds(subset: list, rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(random_state=random_seed, - aggregation=aggregation, - evaluation_params={'aggregation': 'mos', - 'feasible_fold_score_bounds': True}, - return_scores=True, - rounding_decimals=rounding_decimals, - feasible_dataset_score_bounds=False, - score_subset=subset) + experiment, scores = generate_experiment( + random_state=random_seed, + aggregation=aggregation, + evaluation_params={"aggregation": "mos", "feasible_fold_score_bounds": True}, + return_scores=True, + rounding_decimals=rounding_decimals, + feasible_dataset_score_bounds=False, + score_subset=subset, + ) experiment = Experiment(**experiment) - lp_program = solve(experiment, scores, eps=10**(-rounding_decimals)) + lp_program = solve(experiment, scores, eps=10 ** (-rounding_decimals)) assert lp_program.status in (-1, 0) - evaluate_timeout(lp_program, experiment, scores, 10**(-rounding_decimals), subset) + evaluate_timeout(lp_program, experiment, scores, 10 ** (-rounding_decimals), subset) + def test_others(): """ Testing other functionalities """ - experiment = generate_experiment(aggregation='som', - feasible_dataset_score_bounds=True) + experiment = generate_experiment( + aggregation="som", feasible_dataset_score_bounds=True + ) with pytest.raises(ValueError): Experiment(**experiment) diff --git a/tests/aggregated/test_fold.py b/tests/aggregated/test_fold.py index f5609b9..a7a4741 100644 --- a/tests/aggregated/test_fold.py +++ b/tests/aggregated/test_fold.py @@ -9,19 +9,31 @@ TOL = 1e-5 -two_combs = [['acc', 'sens'], ['acc', 'spec'], ['acc', 'bacc'], - ['sens', 'spec'], ['sens', 'bacc'], ['spec', 'bacc']] -three_combs = [['acc', 'sens', 'spec'], ['acc', 'sens', 'bacc'], - ['acc', 'spec', 'bacc'], ['sens', 'spec', 'bacc']] -four_combs = [['acc', 'sens', 'spec', 'bacc']] +two_combs = [ + ["acc", "sens"], + ["acc", "spec"], + ["acc", "bacc"], + ["sens", "spec"], + ["sens", "bacc"], + ["spec", "bacc"], +] +three_combs = [ + ["acc", "sens", "spec"], + ["acc", "sens", "bacc"], + ["acc", "spec", "bacc"], + ["sens", "spec", "bacc"], +] +four_combs = [["acc", "sens", "spec", "bacc"]] + def test_fold_creation(): """ Testing the creation of Fold objects """ - fold = Fold(p=5, n=10, identifier='dummy') - assert fold.to_dict() == {'p': 5, 'n': 10, 'identifier': 'dummy'} + fold = Fold(p=5, n=10, identifier="dummy") + assert fold.to_dict() == {"p": 5, "n": 10, "identifier": "dummy"} + def test_fold_repr(): """ @@ -30,6 +42,7 @@ def test_fold_repr(): assert isinstance(str(Fold(p=5, n=10)), str) + def test_fold_sampling(): """ Testing the fold sampling @@ -40,24 +53,31 @@ def test_fold_sampling(): scores = fold.calculate_scores() - np.testing.assert_almost_equal(scores['acc'], - (fold.tp + fold.tn)/(fold.p + fold.n)) - np.testing.assert_almost_equal(scores['sens'], fold.tp/fold.p) - np.testing.assert_almost_equal(scores['spec'], fold.tn/fold.n) - np.testing.assert_almost_equal(scores['bacc'], (scores['sens'] + scores['spec'])/2.0) + np.testing.assert_almost_equal( + scores["acc"], (fold.tp + fold.tn) / (fold.p + fold.n) + ) + np.testing.assert_almost_equal(scores["sens"], fold.tp / fold.p) + np.testing.assert_almost_equal(scores["spec"], fold.tn / fold.n) + np.testing.assert_almost_equal( + scores["bacc"], (scores["sens"] + scores["spec"]) / 2.0 + ) + + assert ( + fold.sample_figures(5).calculate_scores() + != fold.sample_figures(6).calculate_scores() + ) - assert fold.sample_figures(5).calculate_scores() != fold.sample_figures(6).calculate_scores() def test_linear_programming(): """ Testing if the linear programming interfaces work """ - lp_problem = pl.LpProblem('dummy') + lp_problem = pl.LpProblem("dummy") fold = Fold(5, 10) - fold.init_lp(scores={'acc': 0.5, 'bacc': 0.5, 'sens': 0.5, 'spec': 0.5}) + fold.init_lp(scores={"acc": 0.5, "bacc": 0.5, "sens": 0.5, "spec": 0.5}) assert isinstance(fold.tp, pl.LpVariable) assert isinstance(fold.tn, pl.LpVariable) diff --git a/tests/aggregated/test_folding.py b/tests/aggregated/test_folding.py index 99306da..b4c5418 100644 --- a/tests/aggregated/test_folding.py +++ b/tests/aggregated/test_folding.py @@ -6,6 +6,7 @@ from mlscorecheck.aggregated import Folding, Dataset, generate_folding, generate_dataset + def test_instantiation(): """ Testing the instantiation of a Folding @@ -20,43 +21,46 @@ def test_instantiation(): with pytest.raises(ValueError): Folding(n_folds=5, n_repeats=3) - folding = Folding(n_folds=5, n_repeats=3, strategy='stratified_sklearn') + folding = Folding(n_folds=5, n_repeats=3, strategy="stratified_sklearn") assert folding is not None + def test_to_dict(): """ Testing the dictionary representation """ - folding = Folding(n_folds=5, n_repeats=3, strategy='stratified_sklearn') + folding = Folding(n_folds=5, n_repeats=3, strategy="stratified_sklearn") folding2 = Folding(**folding.to_dict()) assert folding2.n_folds == 5 assert folding2.folds is None + def test_generate_folds(): """ Testing the generation of folds """ - folding = Folding(n_folds=5, n_repeats=3, strategy='stratified_sklearn') + folding = Folding(n_folds=5, n_repeats=3, strategy="stratified_sklearn") dataset = Dataset(p=5, n=10) - assert len(folding.generate_folds(dataset, 'som')) == 1 - assert len(folding.generate_folds(dataset, 'mos')) == 15 + assert len(folding.generate_folds(dataset, "som")) == 1 + assert len(folding.generate_folds(dataset, "mos")) == 15 with pytest.raises(ValueError): - folding.generate_folds(dataset=dataset, aggregation='dummy') + folding.generate_folds(dataset=dataset, aggregation="dummy") - folding = Folding(folds=[{'p': 5, 'n': 10}, {'p': 10, 'n': 20}]) - assert len(folding.generate_folds(dataset=dataset, aggregation='som')) == 2 + folding = Folding(folds=[{"p": 5, "n": 10}, {"p": 10, "n": 20}]) + assert len(folding.generate_folds(dataset=dataset, aggregation="som")) == 2 with pytest.raises(ValueError): - folding.generate_folds(dataset=Dataset(p=4, n=21), aggregation='som') + folding.generate_folds(dataset=Dataset(p=4, n=21), aggregation="som") + -@pytest.mark.parametrize('random_seed', range(10)) +@pytest.mark.parametrize("random_seed", range(10)) def test_generate_folding(random_seed: int): """ Testing the folding generation diff --git a/tests/aggregated/test_folding_utils.py b/tests/aggregated/test_folding_utils.py index 20e91ce..a6d3733 100644 --- a/tests/aggregated/test_folding_utils.py +++ b/tests/aggregated/test_folding_utils.py @@ -10,51 +10,69 @@ from sklearn.model_selection import StratifiedKFold from mlscorecheck.individual import generate_multiclass_dataset -from mlscorecheck.aggregated import (stratified_configurations_sklearn, - determine_fold_configurations, - _create_folds, - repeated_kfolds_generator, - fold_partitioning_generator, - _check_specification_and_determine_p_n, - determine_min_max_p, - multiclass_stratified_folds, - transform_multiclass_fold_to_binary, - create_folds_multiclass) +from mlscorecheck.aggregated import ( + stratified_configurations_sklearn, + determine_fold_configurations, + _create_folds, + repeated_kfolds_generator, + fold_partitioning_generator, + _check_specification_and_determine_p_n, + determine_min_max_p, + multiclass_stratified_folds, + transform_multiclass_fold_to_binary, + create_folds_multiclass, +) + def test_generate_datasets_with_all_kfolds(): """ Testing the generation of datasets with all kfold configurations """ - evaluation = {'dataset': {'p': 5, 'n': 7}, 'folding': {'n_folds': 3}} + evaluation = {"dataset": {"p": 5, "n": 7}, "folding": {"n_folds": 3}} - datasets = list(repeated_kfolds_generator(evaluation, - available_scores=['acc', 'bacc', - 'sens', 'spec'])) + datasets = list( + repeated_kfolds_generator( + evaluation, available_scores=["acc", "bacc", "sens", "spec"] + ) + ) assert len(datasets) == 2 - evaluation = {'dataset': {'p': 5, 'n': 7}, - 'folding': {'n_folds': 3, 'n_repeats': 2}} + evaluation = { + "dataset": {"p": 5, "n": 7}, + "folding": {"n_folds": 3, "n_repeats": 2}, + } - datasets = list(repeated_kfolds_generator(evaluation, - available_scores=['acc', 'bacc', - 'sens', 'spec'])) + datasets = list( + repeated_kfolds_generator( + evaluation, available_scores=["acc", "bacc", "sens", "spec"] + ) + ) assert len(datasets) == 4 - evaluation = {'dataset': {'p': 5, 'n': 7}, - 'folding': {'n_folds': 3, 'n_repeats': 2}, - 'fold_score_bounds': {'acc': (0.0, 1.0)}} + evaluation = { + "dataset": {"p": 5, "n": 7}, + "folding": {"n_folds": 3, "n_repeats": 2}, + "fold_score_bounds": {"acc": (0.0, 1.0)}, + } + + datasets = list( + repeated_kfolds_generator( + evaluation, available_scores=["acc", "bacc", "sens", "spec"] + ) + ) + assert "fold_score_bounds" in datasets[0] - datasets = list(repeated_kfolds_generator(evaluation, - available_scores=['acc', 'bacc', - 'sens', 'spec'])) - assert 'fold_score_bounds' in datasets[0] + evaluation = { + "dataset": {"dataset_name": "common_datasets.appendicitis"}, + "folding": {"n_folds": 3}, + } - evaluation = {'dataset': {'dataset_name': 'common_datasets.appendicitis'}, - 'folding': {'n_folds': 3}} + datasets = list( + repeated_kfolds_generator( + evaluation, available_scores=["acc", "bacc", "sens", "spec"] + ) + ) - datasets = list(repeated_kfolds_generator(evaluation, - available_scores=['acc', 'bacc', - 'sens', 'spec'])) def test_exceptions(): """ @@ -62,35 +80,42 @@ def test_exceptions(): """ with pytest.raises(ValueError): - _check_specification_and_determine_p_n(None, {'folds': []}) + _check_specification_and_determine_p_n(None, {"folds": []}) with pytest.raises(ValueError): - _check_specification_and_determine_p_n({'p': 2}, {}) + _check_specification_and_determine_p_n({"p": 2}, {}) with pytest.raises(ValueError): - _check_specification_and_determine_p_n({'p': 2, 'n': 5, 'dataset_name': 'dummy'}, {}) + _check_specification_and_determine_p_n( + {"p": 2, "n": 5, "dataset_name": "dummy"}, {} + ) + def test_create_folds(): """ Testing the creation of folds """ - folds = _create_folds(5, 10, score_bounds={'acc': (0.0, 1.0)}, - n_repeats=1, n_folds=1) + folds = _create_folds( + 5, 10, score_bounds={"acc": (0.0, 1.0)}, n_repeats=1, n_folds=1 + ) assert len(folds) == 1 - folds = _create_folds(p=5, n=10, - n_folds=2, - n_repeats=2, - score_bounds={'acc': (0.0, 1.0)}) + folds = _create_folds( + p=5, n=10, n_folds=2, n_repeats=2, score_bounds={"acc": (0.0, 1.0)} + ) assert len(folds) == 1 - folds = _create_folds(p=5, n=10, - n_folds=2, - n_repeats=2, - folding='stratified_sklearn', - score_bounds={'acc': (0.0, 1.0)}) + folds = _create_folds( + p=5, + n=10, + n_folds=2, + n_repeats=2, + folding="stratified_sklearn", + score_bounds={"acc": (0.0, 1.0)}, + ) assert len(folds) == 4 + def sklearn_configurations(y_labels, n_splits): """ Generating the sklearn fold configurations @@ -104,10 +129,13 @@ def sklearn_configurations(y_labels, n_splits): """ validator = StratifiedKFold(n_splits=n_splits) - return [tuple(np.bincount(y_labels[test]).tolist()) - for _, test in validator.split(y_labels, y_labels, y_labels)] + return [ + tuple(np.bincount(y_labels[test]).tolist()) + for _, test in validator.split(y_labels, y_labels, y_labels) + ] -@pytest.mark.parametrize('random_state', list(range(500))) + +@pytest.mark.parametrize("random_state", list(range(500))) def test_stratified_configurations_sklearn(random_state): """ Testing the determination of the stratified sklearn fold configurations @@ -119,14 +147,16 @@ def test_stratified_configurations_sklearn(random_state): random_state = np.random.RandomState(random_state) n_splits = random_state.randint(2, 40) - n_items = random_state.randint(n_splits * 2, n_splits*100) + n_items = random_state.randint(n_splits * 2, n_splits * 100) n_1 = random_state.randint(n_splits, n_items - n_splits + 1) n_0 = n_items - n_1 y_labels = np.hstack([np.repeat(0, n_0), np.repeat(1, n_1)]) - assert stratified_configurations_sklearn(n_1, n_0, n_splits) \ - == sklearn_configurations(y_labels, n_splits) + assert stratified_configurations_sklearn( + n_1, n_0, n_splits + ) == sklearn_configurations(y_labels, n_splits) + def test_determine_fold_configurations(): """ @@ -135,12 +165,13 @@ def test_determine_fold_configurations(): conf = determine_fold_configurations(10, 20, 4, 1) - conf = [(tmp['n'], tmp['p']) for tmp in conf] + conf = [(tmp["n"], tmp["p"]) for tmp in conf] assert conf == stratified_configurations_sklearn(10, 20, 4) with pytest.raises(ValueError): - determine_fold_configurations(10, 20, 4, 1, 'dummy') + determine_fold_configurations(10, 20, 4, 1, "dummy") + def any_zero(values): """ @@ -154,6 +185,7 @@ def any_zero(values): """ return any(val == 0 for val in values) + def test_any_zero(): """ Testing the any_zero function @@ -161,6 +193,7 @@ def test_any_zero(): assert any_zero([0, 1]) assert not any_zero([1, 1]) + def test_fold_partitioning_generator(): """ Testing the fold partitioning generator @@ -170,46 +203,67 @@ def test_fold_partitioning_generator(): assert all((not any_zero(fold[0])) and (not any_zero(fold[1])) for fold in folds) - folds = list(fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=False, n_non_zero=True)) + folds = list( + fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=False, n_non_zero=True) + ) assert all(not any_zero(fold[1]) for fold in folds) assert any(any_zero(fold[0]) for fold in folds) - folds = list(fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=True, n_non_zero=False)) + folds = list( + fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=True, n_non_zero=False) + ) assert all(not any_zero(fold[0]) for fold in folds) assert any(any_zero(fold[1]) for fold in folds) - folds = list(fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=False, n_non_zero=False)) + folds = list( + fold_partitioning_generator(p=6, n=6, k=3, p_non_zero=False, n_non_zero=False) + ) assert any(any_zero(fold[0]) for fold in folds) assert any(any_zero(fold[1]) for fold in folds) + def test_fold_partitioning_generator_p_min(): """ Testing the fold partitioning generator with p_min """ - folds = fold_partitioning_generator(p=6, n=7, k=3, p_non_zero=True, n_non_zero=True, p_min=2) + folds = fold_partitioning_generator( + p=6, n=7, k=3, p_non_zero=True, n_non_zero=True, p_min=2 + ) assert len(list(folds)) == 1 - folds = list(fold_partitioning_generator(p=6, n=7, k=3, p_non_zero=False, n_non_zero=True, - p_min=2)) + folds = list( + fold_partitioning_generator( + p=6, n=7, k=3, p_non_zero=False, n_non_zero=True, p_min=2 + ) + ) assert len(list(folds)) == 1 - folds = list(fold_partitioning_generator(p=6, n=7, k=3, p_non_zero=True, n_non_zero=False, - p_min=2)) + folds = list( + fold_partitioning_generator( + p=6, n=7, k=3, p_non_zero=True, n_non_zero=False, p_min=2 + ) + ) assert len(list(folds)) == 1 - folds = list(fold_partitioning_generator(p=6, n=7, k=3, p_non_zero=False, n_non_zero=False, - p_min=2)) + folds = list( + fold_partitioning_generator( + p=6, n=7, k=3, p_non_zero=False, n_non_zero=False, p_min=2 + ) + ) assert len(list(folds)) == 1 -def exhaustive_min_max_p(*, p, k_a, k_b, c_a, c_b, p_non_zero, n_non_zero): # pylint: disable=too-many-locals + +def exhaustive_min_max_p( + *, p, k_a, k_b, c_a, c_b, p_non_zero, n_non_zero +): # pylint: disable=too-many-locals """ Exhaustive search for the minimum and maximum p in folds of type A @@ -226,8 +280,8 @@ def exhaustive_min_max_p(*, p, k_a, k_b, c_a, c_b, p_non_zero, n_non_zero): # py int, int: the minimum and maximum number of positives total in folds of type A """ - a_folds_p = [list(range(p+1))] * k_a - b_folds_p = [list(range(p+1))] * k_b + a_folds_p = [list(range(p + 1))] * k_a + b_folds_p = [list(range(p + 1))] * k_b min_p_a = p max_p_a = 0 @@ -263,12 +317,15 @@ def exhaustive_min_max_p(*, p, k_a, k_b, c_a, c_b, p_non_zero, n_non_zero): # py return min_p_a, max_p_a -@pytest.mark.parametrize('p', list(range(2, 20, 3))) -@pytest.mark.parametrize('n', list(range(5, 30, 3))) -@pytest.mark.parametrize('k', list(range(2, 6))) -@pytest.mark.parametrize('p_non_zero', [True, False]) -@pytest.mark.parametrize('n_non_zero', [True, False]) -def test_determine_min_max_p(p, n, k, p_non_zero, n_non_zero): # pylint: disable=invalid-name + +@pytest.mark.parametrize("p", list(range(2, 20, 3))) +@pytest.mark.parametrize("n", list(range(5, 30, 3))) +@pytest.mark.parametrize("k", list(range(2, 6))) +@pytest.mark.parametrize("p_non_zero", [True, False]) +@pytest.mark.parametrize("n_non_zero", [True, False]) +def test_determine_min_max_p( + p, n, k, p_non_zero, n_non_zero +): # pylint: disable=invalid-name """ Testing the determination of minimum and maximum p with exhaustive search @@ -289,21 +346,30 @@ def test_determine_min_max_p(p, n, k, p_non_zero, n_non_zero): # pylint: disable k_a = k_mod c_a = k_div + 1 c_b = k_div - min_p, max_p = determine_min_max_p(p=p, n=n, - k_a=k_a, k_b=k_b, - c_a=c_a, - p_non_zero=p_non_zero, - n_non_zero=n_non_zero) - - min_p_full, max_p_full = exhaustive_min_max_p(p=p, - k_a=k_a, k_b=k_b, - c_a=c_a, c_b=c_b, - p_non_zero=p_non_zero, - n_non_zero=n_non_zero) + min_p, max_p = determine_min_max_p( + p=p, + n=n, + k_a=k_a, + k_b=k_b, + c_a=c_a, + p_non_zero=p_non_zero, + n_non_zero=n_non_zero, + ) + + min_p_full, max_p_full = exhaustive_min_max_p( + p=p, + k_a=k_a, + k_b=k_b, + c_a=c_a, + c_b=c_b, + p_non_zero=p_non_zero, + n_non_zero=n_non_zero, + ) assert min_p == min_p_full assert max_p == max_p_full + def test_multiclass_stratified_folds(): """ Testing the generation of multiclass stratified folds @@ -323,6 +389,7 @@ def test_multiclass_stratified_folds(): assert counts == list(dataset.values()) + def test_transform_multiclass_fold_to_binary(): """ Testing the transformation of a multiclass fold to binary folds @@ -334,12 +401,13 @@ def test_transform_multiclass_fold_to_binary(): assert len(bfolds) == len(dataset) + def test_multiclass_create_folds_exception(): """ Testing the exception throwing of the multiclass fold creation """ with pytest.raises(ValueError): - create_folds_multiclass(dataset={'p': 5, 'n': 7}, - folding={'folds': 'dummy', - 'n_repeats': 5}) + create_folds_multiclass( + dataset={"p": 5, "n": 7}, folding={"folds": "dummy", "n_repeats": 5} + ) diff --git a/tests/aggregated/test_generate_problems.py b/tests/aggregated/test_generate_problems.py index bdde67d..d979655 100644 --- a/tests/aggregated/test_generate_problems.py +++ b/tests/aggregated/test_generate_problems.py @@ -4,33 +4,39 @@ import pytest -from mlscorecheck.aggregated import (generate_scores_for_testsets, - generate_dataset_folding_multiclass) +from mlscorecheck.aggregated import ( + generate_scores_for_testsets, + generate_dataset_folding_multiclass, +) + def test_generate_scores_for_testsets(): """ Testing the generation of scores for multiple testsets """ - scores = generate_scores_for_testsets([{'p': 5, 'n': 10, 'identifier': 'a'}, - {'p': 6, 'n': 20, 'identifier': 'b'}], - rounding_decimals=4, - subset=['acc', 'sens'], - aggregation='mos') + scores = generate_scores_for_testsets( + [{"p": 5, "n": 10, "identifier": "a"}, {"p": 6, "n": 20, "identifier": "b"}], + rounding_decimals=4, + subset=["acc", "sens"], + aggregation="mos", + ) assert len(scores) == 2 - scores = generate_scores_for_testsets([{'p': 5, 'n': 10, 'identifier': 'a'}, - {'p': 6, 'n': 20, 'identifier': 'b'}], - rounding_decimals=4, - subset=['acc', 'sens'], - aggregation='som') + scores = generate_scores_for_testsets( + [{"p": 5, "n": 10, "identifier": "a"}, {"p": 6, "n": 20, "identifier": "b"}], + rounding_decimals=4, + subset=["acc", "sens"], + aggregation="som", + ) assert len(scores) == 4 + def test_exception(): """ Testing the exception throwing """ with pytest.raises(ValueError): - generate_dataset_folding_multiclass(aggregation='dummy') + generate_dataset_folding_multiclass(aggregation="dummy") diff --git a/tests/aggregated/test_linear_programming.py b/tests/aggregated/test_linear_programming.py index 5d2da25..58249ea 100644 --- a/tests/aggregated/test_linear_programming.py +++ b/tests/aggregated/test_linear_programming.py @@ -4,10 +4,8 @@ import pulp as pl -from mlscorecheck.aggregated import (Evaluation, - generate_evaluation, - solve, - add_bounds) +from mlscorecheck.aggregated import Evaluation, generate_evaluation, solve, add_bounds + def test_solve(): """ @@ -19,23 +17,30 @@ def test_solve(): scores = sample.calculate_scores() - eps = {'acc': 0.001, 'sens': 0.001, 'spec': 0.001, 'bacc': 0.001} + eps = {"acc": 0.001, "sens": 0.001, "spec": 0.001, "bacc": 0.001} assert solve(evaluation, scores, eps).status == 1 + def test_add_bounds(): """ Testing the add_bounds function """ - problem = pl.LpProblem('dummy') - problem = add_bounds(problem, {'tn': pl.LpVariable('tn')}, {'tn': (0, 10)}, label='tn') + problem = pl.LpProblem("dummy") + problem = add_bounds( + problem, {"tn": pl.LpVariable("tn")}, {"tn": (0, 10)}, label="tn" + ) assert len(problem.constraints) == 2 - problem = pl.LpProblem('dummy') - problem = add_bounds(problem, {'tn': pl.LpVariable('tn')}, {'tn': (0, None)}, label='tn') + problem = pl.LpProblem("dummy") + problem = add_bounds( + problem, {"tn": pl.LpVariable("tn")}, {"tn": (0, None)}, label="tn" + ) assert len(problem.constraints) == 1 - problem = pl.LpProblem('dummy') - problem = add_bounds(problem, {'tn': pl.LpVariable('tn')}, {'tn': (None, 10)}, label='tn') + problem = pl.LpProblem("dummy") + problem = add_bounds( + problem, {"tn": pl.LpVariable("tn")}, {"tn": (None, 10)}, label="tn" + ) assert len(problem.constraints) == 1 diff --git a/tests/aggregated/test_utils.py b/tests/aggregated/test_utils.py index 122d37d..0d4cf0f 100644 --- a/tests/aggregated/test_utils.py +++ b/tests/aggregated/test_utils.py @@ -2,9 +2,8 @@ This module tests the linear programming functionalities """ -from mlscorecheck.aggregated import (compare_scores, - random_identifier, - check_bounds) +from mlscorecheck.aggregated import compare_scores, random_identifier, check_bounds + def test_random_identifier(): """ @@ -14,24 +13,25 @@ def test_random_identifier(): assert len(random_identifier(16)) == 16 assert random_identifier(10) != random_identifier(10) + def test_check_bounds(): """ Testing the check bounds function """ - bounds = {'acc': [0.5, 1.0], - 'sens': [0.0, 0.5]} + bounds = {"acc": [0.5, 1.0], "sens": [0.0, 0.5]} - assert check_bounds({'acc': 0.7, 'sens': 0.2}, bounds) - assert not check_bounds({'acc': 0.2, 'sens': 0.8}, bounds) + assert check_bounds({"acc": 0.7, "sens": 0.2}, bounds) + assert not check_bounds({"acc": 0.2, "sens": 0.8}, bounds) assert check_bounds({}, None) is None + def test_compare_scores(): """ Testing the score comparison """ - scores0 = {'acc': 0.1} - scores1 = {'acc': 0.1001} + scores0 = {"acc": 0.1} + scores1 = {"acc": 0.1001} - assert compare_scores(scores0, scores1, eps=0.0, subset=['acc'], tolerance=1e-4) - assert not compare_scores(scores0, scores1, eps=0.0, subset=['acc'], tolerance=1e-5) + assert compare_scores(scores0, scores1, eps=0.0, subset=["acc"], tolerance=1e-4) + assert not compare_scores(scores0, scores1, eps=0.0, subset=["acc"], tolerance=1e-5) diff --git a/tests/check/binary/test_1_dataset_known_folds_mos_scores.py b/tests/check/binary/test_1_dataset_known_folds_mos_scores.py index dc8a7c2..45519da 100644 --- a/tests/check/binary/test_1_dataset_known_folds_mos_scores.py +++ b/tests/check/binary/test_1_dataset_known_folds_mos_scores.py @@ -6,10 +6,11 @@ import pytest from mlscorecheck.check.binary import check_1_dataset_known_folds_mos -from mlscorecheck.aggregated import (generate_evaluation) +from mlscorecheck.aggregated import generate_evaluation -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -18,20 +19,25 @@ def test_consistency(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='mos', - random_state=random_seed, - return_scores=True, - rounding_decimals=rounding_decimals) + evaluation, scores = generate_evaluation( + aggregation="mos", + random_state=random_seed, + return_scores=True, + rounding_decimals=rounding_decimals, + ) + + result = check_1_dataset_known_folds_mos( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], - folding=evaluation['folding'], - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -40,21 +46,26 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='mos', - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} - - result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], - folding=evaluation['folding'], - scores=scores, - eps=10**(-rounding_decimals)) - - assert result['inconsistency'] - -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + evaluation, scores = generate_evaluation( + aggregation="mos", + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} + + result = check_1_dataset_known_folds_mos( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) + + assert result["inconsistency"] + + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency_bounds(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup and bounds @@ -63,23 +74,28 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='mos', - random_state=random_seed, - return_scores=True, - feasible_fold_score_bounds=True, - rounding_decimals=rounding_decimals) - - result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], - folding=evaluation['folding'], - fold_score_bounds=evaluation['fold_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=1) - - assert not result['inconsistency'] - -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + evaluation, scores = generate_evaluation( + aggregation="mos", + random_state=random_seed, + return_scores=True, + feasible_fold_score_bounds=True, + rounding_decimals=rounding_decimals, + ) + + result = check_1_dataset_known_folds_mos( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + fold_score_bounds=evaluation["fold_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=1, + ) + + assert not result["inconsistency"] + + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure_bounds(random_seed: int, rounding_decimals: int): """ Testing with a inconsistent setup and bounds @@ -88,18 +104,22 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='mos', - random_state=random_seed, - return_scores=True, - feasible_fold_score_bounds=False, - rounding_decimals=rounding_decimals) - scores = {'acc': 0.9, 'bacc': 0.1, 'sens': 0.1, 'npv': 0.1, 'ppv': 0.1, 'f1': 0.9} - - result = check_1_dataset_known_folds_mos(dataset=evaluation['dataset'], - folding=evaluation['folding'], - fold_score_bounds=evaluation['fold_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=1) - - assert result['inconsistency'] or result['lp_status'] == 'timeout' + evaluation, scores = generate_evaluation( + aggregation="mos", + random_state=random_seed, + return_scores=True, + feasible_fold_score_bounds=False, + rounding_decimals=rounding_decimals, + ) + scores = {"acc": 0.9, "bacc": 0.1, "sens": 0.1, "npv": 0.1, "ppv": 0.1, "f1": 0.9} + + result = check_1_dataset_known_folds_mos( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + fold_score_bounds=evaluation["fold_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=1, + ) + + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/binary/test_1_dataset_som_scores.py b/tests/check/binary/test_1_dataset_som_scores.py index e89da7e..8959d7f 100644 --- a/tests/check/binary/test_1_dataset_som_scores.py +++ b/tests/check/binary/test_1_dataset_som_scores.py @@ -5,10 +5,11 @@ import pytest from mlscorecheck.check.binary import check_1_dataset_kfold_som -from mlscorecheck.aggregated import (generate_evaluation) +from mlscorecheck.aggregated import generate_evaluation -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -17,20 +18,25 @@ def test_consistency(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='som', - random_state=random_seed, - return_scores=True, - rounding_decimals=rounding_decimals) + evaluation, scores = generate_evaluation( + aggregation="som", + random_state=random_seed, + return_scores=True, + rounding_decimals=rounding_decimals, + ) + + result = check_1_dataset_kfold_som( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], - folding=evaluation['folding'], - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -39,29 +45,39 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - evaluation, scores = generate_evaluation(aggregation='som', - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + evaluation, scores = generate_evaluation( + aggregation="som", + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} + + result = check_1_dataset_kfold_som( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], - folding=evaluation['folding'], - scores=scores, - eps=10**(-rounding_decimals)) + assert result["inconsistency"] - assert result['inconsistency'] def test_adding_strategy(): """ Testing the addition of strategy """ - evaluation = {'dataset': {'p': 5, 'n': 6}, 'folding': {'n_folds': 2, 'n_repeats': 1}} - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + evaluation = { + "dataset": {"p": 5, "n": 6}, + "folding": {"n_folds": 2, "n_repeats": 1}, + } + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - result = check_1_dataset_kfold_som(dataset=evaluation['dataset'], - folding=evaluation['folding'], - scores=scores, - eps=10**(-4)) + result = check_1_dataset_kfold_som( + dataset=evaluation["dataset"], + folding=evaluation["folding"], + scores=scores, + eps=10 ** (-4), + ) - assert result['inconsistency'] + assert result["inconsistency"] diff --git a/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py b/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py index 58b7226..77b0da0 100644 --- a/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py +++ b/tests/check/binary/test_1_dataset_unknown_folds_mos_scores.py @@ -6,26 +6,32 @@ import numpy as np -from mlscorecheck.check.binary import (check_1_dataset_unknown_folds_mos, - estimate_n_evaluations) +from mlscorecheck.check.binary import ( + check_1_dataset_unknown_folds_mos, + estimate_n_evaluations, +) from mlscorecheck.aggregated import Evaluation -subsets = [['acc', 'sens', 'spec', 'bacc'], ['acc', 'sens'], ['acc', 'spec'], ['acc']] +subsets = [["acc", "sens", "spec", "bacc"], ["acc", "sens"], ["acc", "spec"], ["acc"]] + def test_estimation(): """ Testing the evaluation count estimation """ - count = estimate_n_evaluations(dataset={'p': 5, 'n': 11}, - folding={'n_folds': 3, 'n_repeats': 2}, - available_scores=['acc', 'sens', 'spec']) + count = estimate_n_evaluations( + dataset={"p": 5, "n": 11}, + folding={"n_folds": 3, "n_repeats": 2}, + available_scores=["acc", "sens", "spec"], + ) assert count == 16 -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [4]) -@pytest.mark.parametrize('subset', subsets) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [4]) +@pytest.mark.parametrize("subset", subsets) def test_success(random_seed: int, rounding_decimals: int, subset: list): """ Testing with successful configuration @@ -37,16 +43,15 @@ def test_success(random_seed: int, rounding_decimals: int, subset: list): """ random_state = np.random.RandomState(random_seed) - dataset = {'n': random_state.randint(1, 150), - 'p': random_state.randint(1, 15)} - folding = {'n_folds': random_state.randint(1, 5), - 'n_repeats': random_state.randint(1, 3), - 'strategy': 'stratified_sklearn'} - folding['n_folds'] = min(folding['n_folds'], dataset['p'], dataset['n']) + dataset = {"n": random_state.randint(1, 150), "p": random_state.randint(1, 15)} + folding = { + "n_folds": random_state.randint(1, 5), + "n_repeats": random_state.randint(1, 3), + "strategy": "stratified_sklearn", + } + folding["n_folds"] = min(folding["n_folds"], dataset["p"], dataset["n"]) - evaluation = Evaluation(dataset=dataset, - folding=folding, - aggregation='mos') + evaluation = Evaluation(dataset=dataset, folding=folding, aggregation="mos") evaluation.sample_figures(score_subset=subset) scores = evaluation.calculate_scores(rounding_decimals, score_subset=subset) @@ -54,17 +59,19 @@ def test_success(random_seed: int, rounding_decimals: int, subset: list): evaluation = evaluation.to_dict() results = check_1_dataset_unknown_folds_mos( - scores=scores, - eps=(10**(-rounding_decimals)), - dataset=evaluation['dataset'], - folding=evaluation['folding'], - fold_score_bounds=evaluation.get('fold_score_bounds')) + scores=scores, + eps=(10 ** (-rounding_decimals)), + dataset=evaluation["dataset"], + folding=evaluation["folding"], + fold_score_bounds=evaluation.get("fold_score_bounds"), + ) - assert not results['inconsistency'] + assert not results["inconsistency"] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [4]) -@pytest.mark.parametrize('subset', subsets) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [4]) +@pytest.mark.parametrize("subset", subsets) def test_failure(random_seed: int, rounding_decimals: int, subset: list): """ Testing with successful configuration @@ -77,29 +84,29 @@ def test_failure(random_seed: int, rounding_decimals: int, subset: list): random_state = np.random.RandomState(random_seed) - dataset = {'n': random_state.randint(1, 150), - 'p': random_state.randint(1, 15)} - folding = {'n_folds': random_state.randint(1, 3), - 'n_repeats': random_state.randint(1, 3), - 'strategy': 'stratified_sklearn'} - folding['n_folds'] = min(folding['n_folds'], dataset['p'], dataset['n']) + dataset = {"n": random_state.randint(1, 150), "p": random_state.randint(1, 15)} + folding = { + "n_folds": random_state.randint(1, 3), + "n_repeats": random_state.randint(1, 3), + "strategy": "stratified_sklearn", + } + folding["n_folds"] = min(folding["n_folds"], dataset["p"], dataset["n"]) - evaluation = Evaluation(dataset=dataset, - folding=folding, - aggregation='mos') + evaluation = Evaluation(dataset=dataset, folding=folding, aggregation="mos") evaluation.sample_figures(score_subset=subset) evaluation = evaluation.to_dict() - del evaluation['aggregation'] + del evaluation["aggregation"] - scores = {'sens': 0.7, 'spec': 0.7, 'bacc': 0.6, 'acc': 0.1234} + scores = {"sens": 0.7, "spec": 0.7, "bacc": 0.6, "acc": 0.1234} scores = {key: value for key, value in scores.items() if key in subset} results = check_1_dataset_unknown_folds_mos( - scores=scores, - eps=(10**(-rounding_decimals)), - dataset=evaluation['dataset'], - folding=evaluation['folding'], - fold_score_bounds=evaluation.get('fold_score_bounds')) - - assert results['inconsistency'] + scores=scores, + eps=(10 ** (-rounding_decimals)), + dataset=evaluation["dataset"], + folding=evaluation["folding"], + fold_score_bounds=evaluation.get("fold_score_bounds"), + ) + + assert results["inconsistency"] diff --git a/tests/check/binary/test_1_testset_no_kfold_scores.py b/tests/check/binary/test_1_testset_no_kfold_scores.py index 8e0ed55..683af71 100644 --- a/tests/check/binary/test_1_testset_no_kfold_scores.py +++ b/tests/check/binary/test_1_testset_no_kfold_scores.py @@ -6,42 +6,38 @@ import pytest -from mlscorecheck.check.binary import (check_1_testset_no_kfold) +from mlscorecheck.check.binary import check_1_testset_no_kfold from mlscorecheck.individual import generate_1_problem from mlscorecheck.scores import calculate_scores -k = 4 # pylint: disable=invalid-name -eps = 10**(-k) # pylint: disable=invalid-name +k = 4 # pylint: disable=invalid-name +eps = 10 ** (-k) # pylint: disable=invalid-name + def test_parametrization(): """ Testing the parametrization """ with pytest.raises(ValueError): - check_1_testset_no_kfold(scores={}, - eps=1e-4, - testset={'p': 5}) + check_1_testset_no_kfold(scores={}, eps=1e-4, testset={"p": 5}) + def test_warnings(): """ Testing the warning """ - problem = {'name': 'common_datasets.ADA', - 'n_repeats': 2} + problem = {"name": "common_datasets.ADA", "n_repeats": 2} - scores = {'acc': 0.9, - 'sens': 0.89, - 'spec': 0.91} + scores = {"acc": 0.9, "sens": 0.89, "spec": 0.91} with warnings.catch_warnings(record=True) as warns: warnings.simplefilter("always") - result = check_1_testset_no_kfold(scores=scores, - eps=1e-2, - testset=problem) + result = check_1_testset_no_kfold(scores=scores, eps=1e-2, testset=problem) assert len(warns) == 1 - assert not result['inconsistency'] + assert not result["inconsistency"] + def test_consistent(): """ @@ -49,19 +45,17 @@ def test_consistent(): """ evaluation, problem = generate_1_problem(random_state=5) - evaluation['beta_negative'] = 2 - evaluation['beta_positive'] = 2 + evaluation["beta_negative"] = 2 + evaluation["beta_positive"] = 2 - scores = calculate_scores(evaluation, - rounding_decimals=k) - scores['beta_negative'] = 2 - scores['beta_positive'] = 2 + scores = calculate_scores(evaluation, rounding_decimals=k) + scores["beta_negative"] = 2 + scores["beta_positive"] = 2 - result = check_1_testset_no_kfold(scores=scores, - eps=eps, - testset=problem) + result = check_1_testset_no_kfold(scores=scores, eps=eps, testset=problem) + + assert not result["inconsistency"] - assert not result['inconsistency'] def test_failure(): """ @@ -69,50 +63,41 @@ def test_failure(): """ evaluation, problem = generate_1_problem(random_state=5) - evaluation['beta_negative'] = 2 - evaluation['beta_positive'] = 2 + evaluation["beta_negative"] = 2 + evaluation["beta_positive"] = 2 + + scores = calculate_scores(evaluation, rounding_decimals=k) + scores["bacc"] = 0.9 + scores["acc"] = 0.1 + scores["beta_negative"] = 2 + scores["beta_positive"] = 2 - scores = calculate_scores(evaluation, - rounding_decimals=k) - scores['bacc'] = 0.9 - scores['acc'] = 0.1 - scores['beta_negative'] = 2 - scores['beta_positive'] = 2 + result = check_1_testset_no_kfold(scores=scores, eps=eps, testset=problem) - result = check_1_testset_no_kfold(scores=scores, - eps=eps, - testset=problem) + assert result["inconsistency"] - assert result['inconsistency'] def test_dataset(): """ Testing success with real dataset """ - problem = {'name': 'common_datasets.ADA'} + problem = {"name": "common_datasets.ADA"} + + scores = {"acc": 0.9, "sens": 0.89, "spec": 0.91} - scores = {'acc': 0.9, - 'sens': 0.89, - 'spec': 0.91} + result = check_1_testset_no_kfold(scores=scores, eps=1e-2, testset=problem) - result = check_1_testset_no_kfold(scores=scores, - eps=1e-2, - testset=problem) + assert not result["inconsistency"] - assert not result['inconsistency'] def test_dataset_failure(): """ Testing failure with real dataset with extreme precision and random scores """ - problem = {'name': 'common_datasets.ADA'} + problem = {"name": "common_datasets.ADA"} - scores = {'acc': 0.9, - 'sens': 0.89, - 'spec': 0.91} + scores = {"acc": 0.9, "sens": 0.89, "spec": 0.91} - result = check_1_testset_no_kfold(scores=scores, - eps=0.00001, - testset=problem) + result = check_1_testset_no_kfold(scores=scores, eps=0.00001, testset=problem) - assert result['inconsistency'] + assert result["inconsistency"] diff --git a/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py b/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py index d894709..c17f419 100644 --- a/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py +++ b/tests/check/binary/test_n_datasets_mos_kfold_som_scores.py @@ -7,10 +7,11 @@ import pytest from mlscorecheck.check.binary import check_n_datasets_mos_kfold_som -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.aggregated import generate_experiment -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -20,20 +21,25 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + + result = check_n_datasets_mos_kfold_som( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_n_datasets_mos_kfold_som(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -42,22 +48,27 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - result = check_n_datasets_mos_kfold_som(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + result = check_n_datasets_mos_kfold_som( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - assert result['inconsistency'] + assert result["inconsistency"] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency_bounds(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup and bounds @@ -66,24 +77,28 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True, - feasible_dataset_score_bounds=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + feasible_dataset_score_bounds=True, + ) result = check_n_datasets_mos_kfold_som( - evaluations=experiment['evaluations'], - dataset_score_bounds=experiment['dataset_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=2) + evaluations=experiment["evaluations"], + dataset_score_bounds=experiment["dataset_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=2, + ) + + assert not result["inconsistency"] or result["lp_status"] == "timeout" - assert not result['inconsistency'] or result['lp_status'] == 'timeout' -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure_bounds(random_seed: int, rounding_decimals: int): """ Testing with a inconsistent setup and bounds @@ -92,21 +107,25 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True, - feasible_dataset_score_bounds=False) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + feasible_dataset_score_bounds=False, + ) result = check_n_datasets_mos_kfold_som( - evaluations=experiment['evaluations'], - dataset_score_bounds=experiment['dataset_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=2) + evaluations=experiment["evaluations"], + dataset_score_bounds=experiment["dataset_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=2, + ) + + assert result["inconsistency"] or result["lp_status"] == "timeout" - assert result['inconsistency'] or result['lp_status'] == 'timeout' def test_exception(): """ @@ -114,12 +133,13 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_kfold_som(evaluations=[{'aggregation': 'mos'}], - scores={}, - eps=1e-4) + check_n_datasets_mos_kfold_som( + evaluations=[{"aggregation": "mos"}], scores={}, eps=1e-4 + ) with pytest.raises(ValueError): - check_n_datasets_mos_kfold_som(evaluations=[{'aggregation': 'som', - 'fold_score_bounds': {}}], - scores={}, - eps=1e-4) + check_n_datasets_mos_kfold_som( + evaluations=[{"aggregation": "som", "fold_score_bounds": {}}], + scores={}, + eps=1e-4, + ) diff --git a/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py b/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py index eadbbf4..22a255b 100644 --- a/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py +++ b/tests/check/binary/test_n_datasets_mos_known_folds_mos_scores.py @@ -7,10 +7,11 @@ import pytest from mlscorecheck.check.binary import check_n_datasets_mos_known_folds_mos -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.aggregated import generate_experiment -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -20,20 +21,25 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos'}, - rounding_decimals=rounding_decimals, - random_state=random_seed, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "mos"}, + rounding_decimals=rounding_decimals, + random_state=random_seed, + return_scores=True, + ) + + result = check_n_datasets_mos_known_folds_mos( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_n_datasets_mos_known_folds_mos(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -42,22 +48,27 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos'}, - rounding_decimals=rounding_decimals, - random_state=random_seed, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "mos"}, + rounding_decimals=rounding_decimals, + random_state=random_seed, + return_scores=True, + ) - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - result = check_n_datasets_mos_known_folds_mos(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + result = check_n_datasets_mos_known_folds_mos( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - assert result['inconsistency'] + assert result["inconsistency"] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency_bounds(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup and bounds @@ -66,24 +77,28 @@ def test_consistency_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos'}, - rounding_decimals=rounding_decimals, - random_state=random_seed, - feasible_dataset_score_bounds=True, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "mos"}, + rounding_decimals=rounding_decimals, + random_state=random_seed, + feasible_dataset_score_bounds=True, + return_scores=True, + ) result = check_n_datasets_mos_known_folds_mos( - evaluations=experiment['evaluations'], - dataset_score_bounds=experiment['dataset_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=2) + evaluations=experiment["evaluations"], + dataset_score_bounds=experiment["dataset_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=2, + ) + + assert not result["inconsistency"] or result["lp_status"] == "timeout" - assert not result['inconsistency'] or result['lp_status'] == 'timeout' -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure_bounds(random_seed: int, rounding_decimals: int): """ Testing with a inconsistent setup and bounds @@ -92,23 +107,27 @@ def test_failure_bounds(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos'}, - rounding_decimals=rounding_decimals, - random_state=random_seed, - feasible_dataset_score_bounds=True, - return_scores=True) + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={"aggregation": "mos"}, + rounding_decimals=rounding_decimals, + random_state=random_seed, + feasible_dataset_score_bounds=True, + return_scores=True, + ) - scores = {'acc': 0.5, 'sens': 0.1, 'spec': 0.2, 'npv': 0.1, 'ppv': 0.1, 'f1': 0.9} + scores = {"acc": 0.5, "sens": 0.1, "spec": 0.2, "npv": 0.1, "ppv": 0.1, "f1": 0.9} result = check_n_datasets_mos_known_folds_mos( - evaluations=experiment['evaluations'], - dataset_score_bounds=experiment['dataset_score_bounds'], - scores=scores, - eps=10**(-rounding_decimals), - timeout=2) + evaluations=experiment["evaluations"], + dataset_score_bounds=experiment["dataset_score_bounds"], + scores=scores, + eps=10 ** (-rounding_decimals), + timeout=2, + ) + + assert result["inconsistency"] or result["lp_status"] == "timeout" - assert result['inconsistency'] or result['lp_status'] == 'timeout' def test_exception(): """ @@ -116,12 +135,13 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_known_folds_mos(evaluations=[{'aggregation': 'som'}], - scores={}, - eps=1e-4) + check_n_datasets_mos_known_folds_mos( + evaluations=[{"aggregation": "som"}], scores={}, eps=1e-4 + ) with pytest.raises(ValueError): - check_n_datasets_mos_known_folds_mos(evaluations=[{'aggregation': 'mos', - 'fold_score_bounds': {}}], - scores={}, - eps=1e-4) + check_n_datasets_mos_known_folds_mos( + evaluations=[{"aggregation": "mos", "fold_score_bounds": {}}], + scores={}, + eps=1e-4, + ) diff --git a/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py b/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py index 32759c0..12db7c9 100644 --- a/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py +++ b/tests/check/binary/test_n_datasets_mos_unknown_folds_mos_scores.py @@ -6,28 +6,34 @@ import numpy as np -from mlscorecheck.check.binary import (check_n_datasets_mos_unknown_folds_mos, - estimate_n_experiments) -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.check.binary import ( + check_n_datasets_mos_unknown_folds_mos, + estimate_n_experiments, +) +from mlscorecheck.aggregated import generate_experiment + +subsets = [["acc", "sens", "spec", "bacc"], ["acc", "sens"], ["acc", "spec"], ["acc"]] -subsets = [['acc', 'sens', 'spec', 'bacc'], ['acc', 'sens'], ['acc', 'spec'], ['acc']] def test_estimation(): """ Testing the evaluation count estimation """ - count = estimate_n_experiments(evaluations=[{'dataset': {'p': 5, 'n': 11}, - 'folding': {'n_folds': 3, 'n_repeats': 2}}, - {'dataset': {'p': 6, 'n': 9}, - 'folding': {'n_folds': 3, 'n_repeats': 2}}], - available_scores=['acc', 'sens', 'spec']) + count = estimate_n_experiments( + evaluations=[ + {"dataset": {"p": 5, "n": 11}, "folding": {"n_folds": 3, "n_repeats": 2}}, + {"dataset": {"p": 6, "n": 9}, "folding": {"n_folds": 3, "n_repeats": 2}}, + ], + available_scores=["acc", "sens", "spec"], + ) assert count == 144 -def generate_test_case(random_seed: int, - rounding_decimals: int, - score_subset: list) -> (dict, dict): + +def generate_test_case( + random_seed: int, rounding_decimals: int, score_subset: list +) -> (dict, dict): """ Generate one random test case @@ -39,39 +45,47 @@ def generate_test_case(random_seed: int, Returns: dict, dict: the experiment specification and the scores """ - evaluation_params = {'max_p': 25, - 'max_n': 200, - 'max_folds': 4, - 'max_repeats': 1, - 'aggregation': 'mos', - 'no_folds': True, - 'no_name': True} + evaluation_params = { + "max_p": 25, + "max_n": 200, + "max_folds": 4, + "max_repeats": 1, + "aggregation": "mos", + "no_folds": True, + "no_name": True, + } random_state = np.random.RandomState(random_seed) - experiment, scores = generate_experiment(random_state=random_state, - rounding_decimals=rounding_decimals, - evaluation_params=evaluation_params, - max_evaluations=2, - aggregation='mos', - return_scores=True) - - n_experiments = estimate_n_experiments(experiment['evaluations'], - list(scores.keys())) - - while n_experiments > 1000\ - or len(experiment['evaluations']) == 1: - experiment, scores = generate_experiment(random_state=random_state, - rounding_decimals=rounding_decimals, - evaluation_params=evaluation_params, - max_evaluations=2, - aggregation='mos', - return_scores=True) - - n_experiments = estimate_n_experiments(experiment['evaluations'], - list(scores.keys())) + experiment, scores = generate_experiment( + random_state=random_state, + rounding_decimals=rounding_decimals, + evaluation_params=evaluation_params, + max_evaluations=2, + aggregation="mos", + return_scores=True, + ) + + n_experiments = estimate_n_experiments( + experiment["evaluations"], list(scores.keys()) + ) + + while n_experiments > 1000 or len(experiment["evaluations"]) == 1: + experiment, scores = generate_experiment( + random_state=random_state, + rounding_decimals=rounding_decimals, + evaluation_params=evaluation_params, + max_evaluations=2, + aggregation="mos", + return_scores=True, + ) + + n_experiments = estimate_n_experiments( + experiment["evaluations"], list(scores.keys()) + ) scores = {key: value for key, value in scores.items() if key in score_subset} return experiment, scores + def remove_strategy_fsom_folding(experiment): """ Removes the "strategy" from the folding @@ -79,23 +93,29 @@ def remove_strategy_fsom_folding(experiment): Args: experiment (dict): an experiment specification """ - for evaluation in experiment['evaluations']: - del evaluation['folding']['strategy'] + for evaluation in experiment["evaluations"]: + del evaluation["folding"]["strategy"] + def test_remove_strategy_fsom_folding(): """ Testing the remove_strategy_fsom_folding function """ - experiment = {'evaluations': [{'folding': {'strategy': 'dummy0'}}, - {'folding': {'strategy': 'dummy1'}}]} + experiment = { + "evaluations": [ + {"folding": {"strategy": "dummy0"}}, + {"folding": {"strategy": "dummy1"}}, + ] + } remove_strategy_fsom_folding(experiment) - assert 'strategy' not in experiment['evaluations'][0]['folding'] - assert 'strategy' not in experiment['evaluations'][1]['folding'] + assert "strategy" not in experiment["evaluations"][0]["folding"] + assert "strategy" not in experiment["evaluations"][1]["folding"] -@pytest.mark.parametrize('random_seed', list(range(5))) -@pytest.mark.parametrize('subset', subsets) + +@pytest.mark.parametrize("random_seed", list(range(5))) +@pytest.mark.parametrize("subset", subsets) def test_successful(random_seed: int, subset: list): """ Testing a successful scenario @@ -108,14 +128,15 @@ def test_successful(random_seed: int, subset: list): remove_strategy_fsom_folding(experiment) - results = check_n_datasets_mos_unknown_folds_mos(evaluations=experiment['evaluations'], - scores=scores, - eps=1e-4) + results = check_n_datasets_mos_unknown_folds_mos( + evaluations=experiment["evaluations"], scores=scores, eps=1e-4 + ) + + assert not results["inconsistency"] - assert not results['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(5))) -@pytest.mark.parametrize('subset', subsets) +@pytest.mark.parametrize("random_seed", list(range(5))) +@pytest.mark.parametrize("subset", subsets) def test_failure(random_seed: int, subset: list): """ Testing a failure @@ -129,13 +150,14 @@ def test_failure(random_seed: int, subset: list): remove_strategy_fsom_folding(experiment) - scores = {'acc': 0.9, 'sens': 0.1, 'spec': 0.1, 'bacc': 0.05} + scores = {"acc": 0.9, "sens": 0.1, "spec": 0.1, "bacc": 0.05} + + results = check_n_datasets_mos_unknown_folds_mos( + evaluations=experiment["evaluations"], scores=scores, eps=1e-4 + ) - results = check_n_datasets_mos_unknown_folds_mos(evaluations=experiment['evaluations'], - scores=scores, - eps=1e-4) + assert results["inconsistency"] - assert results['inconsistency'] def test_exception(): """ @@ -143,12 +165,13 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_mos_unknown_folds_mos(evaluations=[{'aggregation': 'som'}], - scores={}, - eps=1e-4) + check_n_datasets_mos_unknown_folds_mos( + evaluations=[{"aggregation": "som"}], scores={}, eps=1e-4 + ) with pytest.raises(ValueError): - check_n_datasets_mos_unknown_folds_mos(evaluations=[{'aggregation': 'mos', - 'fold_score_bounds': {}}], - scores={}, - eps=1e-4) + check_n_datasets_mos_unknown_folds_mos( + evaluations=[{"aggregation": "mos", "fold_score_bounds": {}}], + scores={}, + eps=1e-4, + ) diff --git a/tests/check/binary/test_n_datasets_som_kfold_som_scores.py b/tests/check/binary/test_n_datasets_som_kfold_som_scores.py index 3e0ee1c..e3cdaad 100644 --- a/tests/check/binary/test_n_datasets_som_kfold_som_scores.py +++ b/tests/check/binary/test_n_datasets_som_kfold_som_scores.py @@ -6,10 +6,11 @@ import pytest from mlscorecheck.check.binary import check_n_datasets_som_kfold_som -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.aggregated import generate_experiment -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -19,20 +20,25 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimal places to round to """ - experiment, scores = generate_experiment(aggregation='som', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - return_scores=True, - rounding_decimals=rounding_decimals) + experiment, scores = generate_experiment( + aggregation="som", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + return_scores=True, + rounding_decimals=rounding_decimals, + ) + + result = check_n_datasets_som_kfold_som( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_n_datasets_som_kfold_som(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -42,19 +48,24 @@ def test_failure(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimal places to round to """ - experiment, scores = generate_experiment(aggregation='som', - evaluation_params={'aggregation': 'som'}, - random_state=random_seed, - return_scores=True, - rounding_decimals=rounding_decimals) + experiment, scores = generate_experiment( + aggregation="som", + evaluation_params={"aggregation": "som"}, + random_state=random_seed, + return_scores=True, + rounding_decimals=rounding_decimals, + ) + + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + result = check_n_datasets_som_kfold_som( + evaluations=experiment["evaluations"], + scores=scores, + eps=10 ** (-rounding_decimals), + ) - result = check_n_datasets_som_kfold_som(evaluations=experiment['evaluations'], - scores=scores, - eps=10**(-rounding_decimals)) + assert result["inconsistency"] - assert result['inconsistency'] def test_exception(): """ @@ -62,6 +73,6 @@ def test_exception(): """ with pytest.raises(ValueError): - check_n_datasets_som_kfold_som(evaluations=[{'aggregation': 'mos'}], - scores={}, - eps=1e-4) + check_n_datasets_som_kfold_som( + evaluations=[{"aggregation": "mos"}], scores={}, eps=1e-4 + ) diff --git a/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py b/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py index 268c05d..bf1a108 100644 --- a/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py +++ b/tests/check/binary/test_n_testsets_mos_no_kfold_scores.py @@ -6,10 +6,11 @@ import pytest from mlscorecheck.check.binary import check_n_testsets_mos_no_kfold -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.aggregated import generate_experiment -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -19,24 +20,29 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos', - 'max_folds': 1, - 'max_repeats': 1, - 'no_name': True}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={ + "aggregation": "mos", + "max_folds": 1, + "max_repeats": 1, + "no_name": True, + }, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + testsets = [evaluation["dataset"] for evaluation in experiment["evaluations"]] + + result = check_n_testsets_mos_no_kfold( + testsets=testsets, scores=scores, eps=10 ** (-rounding_decimals) + ) - result = check_n_testsets_mos_no_kfold(testsets=testsets, - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -45,20 +51,24 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='mos', - evaluation_params={'aggregation': 'mos', - 'max_folds': 1, - 'max_repeats': 1, - 'no_name': True}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] + experiment, scores = generate_experiment( + aggregation="mos", + evaluation_params={ + "aggregation": "mos", + "max_folds": 1, + "max_repeats": 1, + "no_name": True, + }, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + testsets = [evaluation["dataset"] for evaluation in experiment["evaluations"]] - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - result = check_n_testsets_mos_no_kfold(testsets=testsets, - scores=scores, - eps=10**(-rounding_decimals)) + result = check_n_testsets_mos_no_kfold( + testsets=testsets, scores=scores, eps=10 ** (-rounding_decimals) + ) - assert result['inconsistency'] + assert result["inconsistency"] diff --git a/tests/check/binary/test_n_testsets_som_no_kfold_scores.py b/tests/check/binary/test_n_testsets_som_no_kfold_scores.py index 19e194d..d248052 100644 --- a/tests/check/binary/test_n_testsets_som_no_kfold_scores.py +++ b/tests/check/binary/test_n_testsets_som_no_kfold_scores.py @@ -6,10 +6,11 @@ import pytest from mlscorecheck.check.binary import check_n_testsets_som_no_kfold -from mlscorecheck.aggregated import (generate_experiment) +from mlscorecheck.aggregated import generate_experiment -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) + +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_consistency(random_seed: int, rounding_decimals: int): """ Testing with a consistent setup @@ -19,24 +20,29 @@ def test_consistency(random_seed: int, rounding_decimals: int): rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='som', - evaluation_params={'aggregation': 'som', - 'max_folds': 1, - 'max_repeats': 1, - 'no_name': True}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] + experiment, scores = generate_experiment( + aggregation="som", + evaluation_params={ + "aggregation": "som", + "max_folds": 1, + "max_repeats": 1, + "no_name": True, + }, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + testsets = [evaluation["dataset"] for evaluation in experiment["evaluations"]] + + result = check_n_testsets_som_no_kfold( + testsets=testsets, scores=scores, eps=10 ** (-rounding_decimals) + ) - result = check_n_testsets_som_no_kfold(testsets=testsets, - scores=scores, - eps=10**(-rounding_decimals)) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) -@pytest.mark.parametrize('rounding_decimals', [3, 4]) +@pytest.mark.parametrize("random_seed", list(range(10))) +@pytest.mark.parametrize("rounding_decimals", [3, 4]) def test_failure(random_seed: int, rounding_decimals: int): """ Testing with an inconsistent setup @@ -45,20 +51,24 @@ def test_failure(random_seed: int, rounding_decimals: int): random_seed (int): the random seed to use rounding_decimals (int): the number of decimals to round to """ - experiment, scores = generate_experiment(aggregation='som', - evaluation_params={'aggregation': 'som', - 'max_folds': 1, - 'max_repeats': 1, - 'no_name': True}, - random_state=random_seed, - rounding_decimals=rounding_decimals, - return_scores=True) - testsets = [evaluation['dataset'] for evaluation in experiment['evaluations']] + experiment, scores = generate_experiment( + aggregation="som", + evaluation_params={ + "aggregation": "som", + "max_folds": 1, + "max_repeats": 1, + "no_name": True, + }, + random_state=random_seed, + rounding_decimals=rounding_decimals, + return_scores=True, + ) + testsets = [evaluation["dataset"] for evaluation in experiment["evaluations"]] - scores = {'acc': 0.9, 'sens': 0.3, 'spec': 0.5, 'f1': 0.1} + scores = {"acc": 0.9, "sens": 0.3, "spec": 0.5, "f1": 0.1} - result = check_n_testsets_som_no_kfold(testsets=testsets, - scores=scores, - eps=10**(-rounding_decimals)) + result = check_n_testsets_som_no_kfold( + testsets=testsets, scores=scores, eps=10 ** (-rounding_decimals) + ) - assert result['inconsistency'] + assert result["inconsistency"] diff --git a/tests/check/bundles/test_isic2016.py b/tests/check/bundles/test_isic2016.py index b90c6a1..2b9b4c9 100644 --- a/tests/check/bundles/test_isic2016.py +++ b/tests/check/bundles/test_isic2016.py @@ -8,7 +8,8 @@ from mlscorecheck.aggregated import generate_scores_for_testsets from mlscorecheck.experiments import get_experiment -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) def test_consistency(random_seed): """ Testing a consistent configuration @@ -17,15 +18,16 @@ def test_consistency(random_seed): random_seed (int): the random seed to be used """ - testset = get_experiment('skinlesion.isic2016') - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - random_state=random_seed) + testset = get_experiment("skinlesion.isic2016") + scores = generate_scores_for_testsets( + [testset], rounding_decimals=4, random_state=random_seed + ) results = check_isic2016(scores=scores, eps=1e-4) - assert not results['inconsistency'] + assert not results["inconsistency"] + -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) def test_inconsistency(random_seed): """ Testing an inconsistent configuration @@ -34,12 +36,12 @@ def test_inconsistency(random_seed): random_seed (int): the random seed to be used """ - testset = get_experiment('skinlesion.isic2016') - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - random_state=random_seed) + testset = get_experiment("skinlesion.isic2016") + scores = generate_scores_for_testsets( + [testset], rounding_decimals=4, random_state=random_seed + ) - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 results = check_isic2016(scores=scores, eps=1e-4) - assert results['inconsistency'] + assert results["inconsistency"] diff --git a/tests/check/bundles/test_isic2017.py b/tests/check/bundles/test_isic2017.py index c2316de..6bb21ee 100644 --- a/tests/check/bundles/test_isic2017.py +++ b/tests/check/bundles/test_isic2017.py @@ -4,18 +4,24 @@ import pytest -from mlscorecheck.check.bundles.skinlesion import check_isic2017, _prepare_testset_isic2017 +from mlscorecheck.check.bundles.skinlesion import ( + check_isic2017, + _prepare_testset_isic2017, +) from mlscorecheck.aggregated import generate_scores_for_testsets -subsets = [(['M'], ['SK', 'N']), - (['SK'], ['M', 'N']), - (['N'], ['SK', 'M']), - (['M', 'SK'], ['N']), - (['M', 'N'], ['SK']), - (['SK', 'N'], ['M'])] +subsets = [ + (["M"], ["SK", "N"]), + (["SK"], ["M", "N"]), + (["N"], ["SK", "M"]), + (["M", "SK"], ["N"]), + (["M", "N"], ["SK"]), + (["SK", "N"], ["M"]), +] -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('target_against', subsets) + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("target_against", subsets) def test_consistency(random_seed, target_against): """ Testing a consistent configuration @@ -25,22 +31,25 @@ def test_consistency(random_seed, target_against): target_against (tuple(list,list)): the target and against classes """ - testset = _prepare_testset_isic2017(target=target_against[0], - against=target_against[1]) - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - random_state=random_seed, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation='som') + testset = _prepare_testset_isic2017( + target=target_against[0], against=target_against[1] + ) + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + random_state=random_seed, + subset=["acc", "sens", "spec", "f1p"], + aggregation="som", + ) + + results = check_isic2017( + target=target_against[0], against=target_against[1], scores=scores, eps=1e-4 + ) + assert not results["inconsistency"] - results = check_isic2017(target=target_against[0], - against=target_against[1], - scores=scores, - eps=1e-4) - assert not results['inconsistency'] -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('target_against', subsets) +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("target_against", subsets) def test_inconsistency(random_seed, target_against): """ Testing an inconsistent configuration @@ -50,18 +59,20 @@ def test_inconsistency(random_seed, target_against): target_against (tuple(list,list)): the target and against classes """ - testset = _prepare_testset_isic2017(target=target_against[0], - against=target_against[1]) - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - random_state=random_seed, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation='som') + testset = _prepare_testset_isic2017( + target=target_against[0], against=target_against[1] + ) + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + random_state=random_seed, + subset=["acc", "sens", "spec", "f1p"], + aggregation="som", + ) - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_isic2017(target=target_against[0], - against=target_against[1], - scores=scores, - eps=1e-4) - assert results['inconsistency'] + results = check_isic2017( + target=target_against[0], against=target_against[1], scores=scores, eps=1e-4 + ) + assert results["inconsistency"] diff --git a/tests/check/bundles/test_retina_chasedb1.py b/tests/check/bundles/test_retina_chasedb1.py index 771195a..bff32cc 100644 --- a/tests/check/bundles/test_retina_chasedb1.py +++ b/tests/check/bundles/test_retina_chasedb1.py @@ -4,14 +4,17 @@ import pytest -from mlscorecheck.check.bundles.retina import (check_chasedb1_vessel_image, - check_chasedb1_vessel_aggregated) +from mlscorecheck.check.bundles.retina import ( + check_chasedb1_vessel_image, + check_chasedb1_vessel_aggregated, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_mos(random_state): """ Testing a consistent setup with MoS aggregation @@ -20,29 +23,29 @@ def test_success_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + results = check_chasedb1_vessel_aggregated( + imageset="all", annotator="manual1", scores=scores, eps=1e-4, verbosity=0 + ) - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - results = check_chasedb1_vessel_aggregated(imageset='all', - annotator='manual1', - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_mos"] - assert not results['inconsistency']['inconsistency_mos'] + results = check_chasedb1_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator="manual1", + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_chasedb1_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator='manual1', - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_mos"] - assert not results['inconsistency']['inconsistency_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_mos(random_state): """ Testing an inconsistent setup with MoS aggregation @@ -51,31 +54,31 @@ def test_failure_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_chasedb1_vessel_aggregated( + imageset="all", annotator="manual1", scores=scores, eps=1e-4, verbosity=0 + ) - results = check_chasedb1_vessel_aggregated(imageset='all', - annotator='manual1', - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_mos"] - assert results['inconsistency']['inconsistency_mos'] + results = check_chasedb1_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator="manual1", + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_chasedb1_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator='manual1', - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_mos"] - assert results['inconsistency']['inconsistency_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_som(random_state): """ Testing a consistent setup with SoM aggregation @@ -84,28 +87,29 @@ def test_success_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) - results = check_chasedb1_vessel_aggregated(imageset='all', - annotator='manual1', - scores=scores, - eps=1e-4) + results = check_chasedb1_vessel_aggregated( + imageset="all", annotator="manual1", scores=scores, eps=1e-4 + ) - assert not results['inconsistency']['inconsistency_som'] + assert not results["inconsistency"]["inconsistency_som"] - results = check_chasedb1_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator='manual1', - scores=scores, - eps=1e-4) + results = check_chasedb1_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator="manual1", + scores=scores, + eps=1e-4, + ) - assert not results['inconsistency']['inconsistency_som'] + assert not results["inconsistency"]["inconsistency_som"] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_som(random_state): """ Testing an inconsistent setup with SoM aggregation @@ -114,30 +118,31 @@ def test_failure_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_chasedb1_vessel_aggregated( + imageset="all", annotator="manual1", scores=scores, eps=1e-4 + ) - results = check_chasedb1_vessel_aggregated(imageset='all', - annotator='manual1', - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_som"] - assert results['inconsistency']['inconsistency_som'] + results = check_chasedb1_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator="manual1", + scores=scores, + eps=1e-4, + ) - results = check_chasedb1_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator='manual1', - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_som"] - assert results['inconsistency']['inconsistency_som'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_image(random_state): """ Testing a consistent setup for an image @@ -146,21 +151,23 @@ def test_success_image(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] + + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + results = check_chasedb1_vessel_image( + image_identifier=data[0]["identifier"], + annotator="manual1", + scores=scores, + eps=1e-4, + ) - results = check_chasedb1_vessel_image(image_identifier=data[0]['identifier'], - annotator='manual1', - scores=scores, - eps=1e-4) + assert not results["inconsistency"] - assert not results['inconsistency'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_image(random_state): """ Testing an inconsistent setup for an image @@ -168,18 +175,19 @@ def test_failure_image(random_state): Args: random_state (int): the random seed to use """ - data = get_experiment('retina.chase_db1')['manual1']['images'] + data = get_experiment("retina.chase_db1")["manual1"]["images"] - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores['acc'] = (1.0 + scores['spec'])/2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_chasedb1_vessel_image(image_identifier=data[0]['identifier'], - annotator='manual1', - scores=scores, - eps=1e-4) + results = check_chasedb1_vessel_image( + image_identifier=data[0]["identifier"], + annotator="manual1", + scores=scores, + eps=1e-4, + ) - assert results['inconsistency'] + assert results["inconsistency"] diff --git a/tests/check/bundles/test_retina_diaretdb0.py b/tests/check/bundles/test_retina_diaretdb0.py index 599ae52..85d395d 100644 --- a/tests/check/bundles/test_retina_diaretdb0.py +++ b/tests/check/bundles/test_retina_diaretdb0.py @@ -8,13 +8,19 @@ from mlscorecheck.check.bundles.retina import _prepare_configuration_diaretdb0 from mlscorecheck.aggregated import generate_scores_for_testsets -@pytest.mark.parametrize('class_name', ['neovascularisation', - 'hardexudates', - 'hemorrhages', - 'softexudates', - 'redsmalldots']) -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) + +@pytest.mark.parametrize( + "class_name", + [ + "neovascularisation", + "hardexudates", + "hemorrhages", + "softexudates", + "redsmalldots", + ], +) +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) def test_success(class_name, random_seed, aggregation): """ Testing consistent configurations @@ -26,42 +32,48 @@ def test_success(class_name, random_seed, aggregation): """ testsets = _prepare_configuration_diaretdb0("test", "all", class_name) - scores = generate_scores_for_testsets(testsets=testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation=aggregation, - random_state=random_seed) + scores = generate_scores_for_testsets( + testsets=testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation=aggregation, + random_state=random_seed, + ) - results = check_diaretdb0_class(subset='test', - batch='all', - class_name=class_name, - scores=scores, - eps=1e-4) + results = check_diaretdb0_class( + subset="test", batch="all", class_name=class_name, scores=scores, eps=1e-4 + ) - assert not results['inconsistency'][f'inconsistency_{aggregation}'] + assert not results["inconsistency"][f"inconsistency_{aggregation}"] testsets = _prepare_configuration_diaretdb0("test", ["1", "2"], class_name) - scores = generate_scores_for_testsets(testsets=testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation=aggregation, - random_state=random_seed) - - results = check_diaretdb0_class(subset='test', - batch=["1", "2"], - class_name=class_name, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'][f'inconsistency_{aggregation}'] - -@pytest.mark.parametrize('class_name', ['neovascularisation', - 'hardexudates', - 'hemorrhages', - 'softexudates', - 'redsmalldots']) -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) + scores = generate_scores_for_testsets( + testsets=testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation=aggregation, + random_state=random_seed, + ) + + results = check_diaretdb0_class( + subset="test", batch=["1", "2"], class_name=class_name, scores=scores, eps=1e-4 + ) + + assert not results["inconsistency"][f"inconsistency_{aggregation}"] + + +@pytest.mark.parametrize( + "class_name", + [ + "neovascularisation", + "hardexudates", + "hemorrhages", + "softexudates", + "redsmalldots", + ], +) +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) def test_failure(class_name, random_seed, aggregation): """ Testing inconsistent configurations @@ -73,26 +85,24 @@ def test_failure(class_name, random_seed, aggregation): """ testsets = _prepare_configuration_diaretdb0("test", "all", class_name) - scores = generate_scores_for_testsets(testsets=testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation=aggregation, - random_state=random_seed) + scores = generate_scores_for_testsets( + testsets=testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation=aggregation, + random_state=random_seed, + ) - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_diaretdb0_class(subset='test', - batch='all', - class_name=class_name, - scores=scores, - eps=1e-4) + results = check_diaretdb0_class( + subset="test", batch="all", class_name=class_name, scores=scores, eps=1e-4 + ) - assert results['inconsistency'][f'inconsistency_{aggregation}'] + assert results["inconsistency"][f"inconsistency_{aggregation}"] - results = check_diaretdb0_class(subset='test', - batch=["1", "2"], - class_name=class_name, - scores=scores, - eps=1e-4) + results = check_diaretdb0_class( + subset="test", batch=["1", "2"], class_name=class_name, scores=scores, eps=1e-4 + ) - assert results['inconsistency'][f'inconsistency_{aggregation}'] + assert results["inconsistency"][f"inconsistency_{aggregation}"] diff --git a/tests/check/bundles/test_retina_diaretdb1.py b/tests/check/bundles/test_retina_diaretdb1.py index 06c9efb..2cd0d1f 100644 --- a/tests/check/bundles/test_retina_diaretdb1.py +++ b/tests/check/bundles/test_retina_diaretdb1.py @@ -4,29 +4,37 @@ import pytest -from mlscorecheck.check.bundles.retina import (_prepare_configuration_diaretdb1, - check_diaretdb1_class, - check_diaretdb1_segmentation_image, - check_diaretdb1_segmentation_aggregated, - check_diaretdb1_segmentation_aggregated_assumption) +from mlscorecheck.check.bundles.retina import ( + _prepare_configuration_diaretdb1, + check_diaretdb1_class, + check_diaretdb1_segmentation_image, + check_diaretdb1_segmentation_aggregated, + check_diaretdb1_segmentation_aggregated_assumption, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -class_names = [['hardexudates'], ['softexudates'], ['hemorrhages'], ['redsmalldots'], - ['hardexudates', 'softexudates'], ['hemorrhages', 'redsmalldots']] - -data = get_experiment('retina.diaretdb1') -test_identifiers = data['test'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('subset', ['train', 'test']) -@pytest.mark.parametrize('class_name', class_names) -def test_check_success_class(random_seed: str, - confidence: float, - subset: str, - class_name): +class_names = [ + ["hardexudates"], + ["softexudates"], + ["hemorrhages"], + ["redsmalldots"], + ["hardexudates", "softexudates"], + ["hemorrhages", "redsmalldots"], +] + +data = get_experiment("retina.diaretdb1") +test_identifiers = data["test"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("subset", ["train", "test"]) +@pytest.mark.parametrize("class_name", class_names) +def test_check_success_class( + random_seed: str, confidence: float, subset: str, class_name +): """ Testing the image labeling in a consistent setup @@ -37,34 +45,40 @@ def test_check_success_class(random_seed: str, class_name (str|list): the names of the lesions constituting the positive class """ - testset = _prepare_configuration_diaretdb1(subset=subset, - class_name=class_name, - confidence=confidence, - pixel_level=False, - assumption='fov') - - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation='som', - random_state=random_seed) - - results = check_diaretdb1_class(subset=subset, - class_name=class_name, - confidence=confidence, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('subset', ['train', 'test']) -@pytest.mark.parametrize('class_name', class_names) -def test_check_failure_class(random_seed: int, - confidence: float, - subset: str, - class_name): + testset = _prepare_configuration_diaretdb1( + subset=subset, + class_name=class_name, + confidence=confidence, + pixel_level=False, + assumption="fov", + ) + + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation="som", + random_state=random_seed, + ) + + results = check_diaretdb1_class( + subset=subset, + class_name=class_name, + confidence=confidence, + scores=scores, + eps=1e-4, + ) + + assert not results["inconsistency"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("subset", ["train", "test"]) +@pytest.mark.parametrize("class_name", class_names) +def test_check_failure_class( + random_seed: int, confidence: float, subset: str, class_name +): """ Testing the image labeling in an inconsistent setup @@ -75,35 +89,41 @@ def test_check_failure_class(random_seed: int, class_name (str|list): the names of the lesions constituting the positive class """ - testset = _prepare_configuration_diaretdb1(subset=subset, - class_name=class_name, - confidence=confidence, - pixel_level=False, - assumption='fov') - - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation='som', - random_state=random_seed) - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - results = check_diaretdb1_class(subset=subset, - class_name=class_name, - confidence=confidence, - scores=scores, - eps=1e-4) - - assert results['inconsistency'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('class_name', class_names) -@pytest.mark.parametrize('assumption', ['fov', 'all']) -def test_check_success_segmentation_image(random_seed: int, - confidence: float, - class_name, - assumption: str): + testset = _prepare_configuration_diaretdb1( + subset=subset, + class_name=class_name, + confidence=confidence, + pixel_level=False, + assumption="fov", + ) + + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation="som", + random_state=random_seed, + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + results = check_diaretdb1_class( + subset=subset, + class_name=class_name, + confidence=confidence, + scores=scores, + eps=1e-4, + ) + + assert results["inconsistency"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("class_name", class_names) +@pytest.mark.parametrize("assumption", ["fov", "all"]) +def test_check_success_segmentation_image( + random_seed: int, confidence: float, class_name, assumption: str +): """ Testing the image labeling in a consistent setup @@ -114,44 +134,51 @@ def test_check_success_segmentation_image(random_seed: int, assumption (str): the assumption on the region of evaluation ('fov'/'all') """ - testsets = _prepare_configuration_diaretdb1(subset='train', - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption) + \ - _prepare_configuration_diaretdb1(subset='test', - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption) + testsets = _prepare_configuration_diaretdb1( + subset="train", + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + ) + _prepare_configuration_diaretdb1( + subset="test", + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + ) test_idx = 0 for test_idx, test_item in enumerate(testsets): - if test_item['p'] > 0: + if test_item["p"] > 0: break - scores = generate_scores_for_testsets([testsets[test_idx]], - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation='som', - random_state=random_seed) - - results = check_diaretdb1_segmentation_image(image_identifier=testsets[test_idx]['identifier'], - class_name=class_name, - confidence=confidence, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'][f'inconsistency_{assumption}'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('class_name', class_names) -@pytest.mark.parametrize('assumption', ['fov', 'all']) -def test_check_failure_segmentation_image(random_seed: int, - confidence: float, - class_name, - assumption: str): + scores = generate_scores_for_testsets( + [testsets[test_idx]], + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation="som", + random_state=random_seed, + ) + + results = check_diaretdb1_segmentation_image( + image_identifier=testsets[test_idx]["identifier"], + class_name=class_name, + confidence=confidence, + scores=scores, + eps=1e-4, + ) + + assert not results["inconsistency"][f"inconsistency_{assumption}"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("class_name", class_names) +@pytest.mark.parametrize("assumption", ["fov", "all"]) +def test_check_failure_segmentation_image( + random_seed: int, confidence: float, class_name, assumption: str +): """ Testing the image labeling in an inconsistent setup @@ -162,51 +189,61 @@ def test_check_failure_segmentation_image(random_seed: int, assumption (str): the assumption on the region of evaluation ('fov'/'all') """ - testsets = _prepare_configuration_diaretdb1(subset='train', - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption) + \ - _prepare_configuration_diaretdb1(subset='test', - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption) + testsets = _prepare_configuration_diaretdb1( + subset="train", + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + ) + _prepare_configuration_diaretdb1( + subset="test", + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + ) test_idx = 0 for test_idx, test_item in enumerate(testsets): - if test_item['p'] > 0: + if test_item["p"] > 0: break - scores = generate_scores_for_testsets([testsets[test_idx]], - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation='som', - random_state=random_seed) - - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - results = check_diaretdb1_segmentation_image(image_identifier=testsets[test_idx]['identifier'], - class_name=class_name, - confidence=confidence, - scores=scores, - eps=1e-4) - - assert results['inconsistency'][f'inconsistency_{assumption}'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('subset', ['train', 'test', test_identifiers]) -@pytest.mark.parametrize('class_name', class_names) -@pytest.mark.parametrize('assumption', ['fov', 'all']) -@pytest.mark.parametrize('aggregation', ['mos', 'som']) -def test_check_success_segmentation_aggregated(*, - random_seed: int, - confidence: float, - subset, - class_name, - assumption: str, - aggregation: str): + scores = generate_scores_for_testsets( + [testsets[test_idx]], + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation="som", + random_state=random_seed, + ) + + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + results = check_diaretdb1_segmentation_image( + image_identifier=testsets[test_idx]["identifier"], + class_name=class_name, + confidence=confidence, + scores=scores, + eps=1e-4, + ) + + assert results["inconsistency"][f"inconsistency_{assumption}"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("subset", ["train", "test", test_identifiers]) +@pytest.mark.parametrize("class_name", class_names) +@pytest.mark.parametrize("assumption", ["fov", "all"]) +@pytest.mark.parametrize("aggregation", ["mos", "som"]) +def test_check_success_segmentation_aggregated( + *, + random_seed: int, + confidence: float, + subset, + class_name, + assumption: str, + aggregation: str, +): """ Testing the image labeling in a consistent setup with all images @@ -219,41 +256,50 @@ def test_check_success_segmentation_aggregated(*, aggregation (str): the mode of aggregation ('som'/'mos') """ - testsets = _prepare_configuration_diaretdb1(subset=subset, - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption, - only_valid=True) - - scores = generate_scores_for_testsets(testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation=aggregation, - random_state=random_seed) - - results = check_diaretdb1_segmentation_aggregated(subset=subset, - class_name=class_name, - confidence=confidence, - only_valid=True, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'][f'inconsistency_{assumption}_{aggregation}'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4]) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('subset', ['train', 'test', test_identifiers]) -@pytest.mark.parametrize('class_name', class_names) -@pytest.mark.parametrize('assumption', ['fov', 'all']) -@pytest.mark.parametrize('aggregation', ['som', 'mos']) -def test_check_failure_segmentation_aggregated(*, - random_seed: int, - confidence: float, - subset, - class_name, - assumption: str, - aggregation: str): + testsets = _prepare_configuration_diaretdb1( + subset=subset, + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + only_valid=True, + ) + + scores = generate_scores_for_testsets( + testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation=aggregation, + random_state=random_seed, + ) + + results = check_diaretdb1_segmentation_aggregated( + subset=subset, + class_name=class_name, + confidence=confidence, + only_valid=True, + scores=scores, + eps=1e-4, + ) + + assert not results["inconsistency"][f"inconsistency_{assumption}_{aggregation}"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("subset", ["train", "test", test_identifiers]) +@pytest.mark.parametrize("class_name", class_names) +@pytest.mark.parametrize("assumption", ["fov", "all"]) +@pytest.mark.parametrize("aggregation", ["som", "mos"]) +def test_check_failure_segmentation_aggregated( + *, + random_seed: int, + confidence: float, + subset, + class_name, + assumption: str, + aggregation: str, +): """ Testing the image labeling in an inconsistent setup with all images @@ -266,54 +312,66 @@ def test_check_failure_segmentation_aggregated(*, aggregation (str): the mode of aggregation ('som'/'mos') """ - testsets = _prepare_configuration_diaretdb1(subset=subset, - class_name=class_name, - confidence=confidence, - pixel_level=True, - assumption=assumption, - only_valid=True) - - scores = generate_scores_for_testsets(testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation=aggregation, - random_state=random_seed) + testsets = _prepare_configuration_diaretdb1( + subset=subset, + class_name=class_name, + confidence=confidence, + pixel_level=True, + assumption=assumption, + only_valid=True, + ) + + scores = generate_scores_for_testsets( + testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation=aggregation, + random_state=random_seed, + ) + + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + results = check_diaretdb1_segmentation_aggregated( + subset=subset, + class_name=class_name, + confidence=confidence, + only_valid=True, + scores=scores, + eps=1e-4, + ) + + assert results["inconsistency"][f"inconsistency_{assumption}_{aggregation}"] - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - results = check_diaretdb1_segmentation_aggregated(subset=subset, - class_name=class_name, - confidence=confidence, - only_valid=True, - scores=scores, - eps=1e-4) - - assert results['inconsistency'][f'inconsistency_{assumption}_{aggregation}'] def test_no_mos(): """ Testing the case when MoS cannot be tested """ - testsets = _prepare_configuration_diaretdb1(subset=test_identifiers[:10], - class_name='hardexudates', - confidence=0.75, - pixel_level=True, - assumption='fov') - - scores = generate_scores_for_testsets(testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec'], - aggregation='som', - random_state=1) + testsets = _prepare_configuration_diaretdb1( + subset=test_identifiers[:10], + class_name="hardexudates", + confidence=0.75, + pixel_level=True, + assumption="fov", + ) + + scores = generate_scores_for_testsets( + testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec"], + aggregation="som", + random_state=1, + ) results = check_diaretdb1_segmentation_aggregated_assumption( - subset=test_identifiers[:10], - class_name='hardexudates', - confidence=0.75, - assumption='fov', - only_valid=False, - scores=scores, - eps=1e-4) - - assert 'details_mos' not in results + subset=test_identifiers[:10], + class_name="hardexudates", + confidence=0.75, + assumption="fov", + only_valid=False, + scores=scores, + eps=1e-4, + ) + + assert "details_mos" not in results diff --git a/tests/check/bundles/test_retina_drishti_gs.py b/tests/check/bundles/test_retina_drishti_gs.py index 32e9d7f..f1db847 100644 --- a/tests/check/bundles/test_retina_drishti_gs.py +++ b/tests/check/bundles/test_retina_drishti_gs.py @@ -4,24 +4,26 @@ import pytest -from mlscorecheck.check.bundles.retina import (_prepare_testsets_drishti_gs, - check_drishti_gs_segmentation_image, - check_drishti_gs_segmentation_aggregated) +from mlscorecheck.check.bundles.retina import ( + _prepare_testsets_drishti_gs, + check_drishti_gs_segmentation_image, + check_drishti_gs_segmentation_aggregated, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -data = get_experiment('retina.drishti_gs') -test_identifiers = list(data['test'].keys()) - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('image_identifier', test_identifiers) -@pytest.mark.parametrize('target', ['OD', 'OC']) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -def test_image_consistent(random_seed: int, - image_identifier: str, - target: str, - confidence: float): +data = get_experiment("retina.drishti_gs") +test_identifiers = list(data["test"].keys()) + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("image_identifier", test_identifiers) +@pytest.mark.parametrize("target", ["OD", "OC"]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +def test_image_consistent( + random_seed: int, image_identifier: str, target: str, confidence: float +): """ Testing the image level tests with a consistent configuration @@ -31,32 +33,36 @@ def test_image_consistent(random_seed: int, target (str): the target confidence (float): the confidence level """ - testset = _prepare_testsets_drishti_gs(subset=[image_identifier], - target=target, - confidence=confidence)[0] - - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation='mos', - random_state=random_seed) - - results = check_drishti_gs_segmentation_image(image_identifier=image_identifier, - confidence=confidence, - target=target, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('image_identifier', test_identifiers) -@pytest.mark.parametrize('target', ['OD', 'OC']) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -def test_image_inconsistent(random_seed: int, - image_identifier: str, - target: str, - confidence: float): + testset = _prepare_testsets_drishti_gs( + subset=[image_identifier], target=target, confidence=confidence + )[0] + + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation="mos", + random_state=random_seed, + ) + + results = check_drishti_gs_segmentation_image( + image_identifier=image_identifier, + confidence=confidence, + target=target, + scores=scores, + eps=1e-4, + ) + + assert not results["inconsistency"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("image_identifier", test_identifiers) +@pytest.mark.parametrize("target", ["OD", "OC"]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +def test_image_inconsistent( + random_seed: int, image_identifier: str, target: str, confidence: float +): """ Testing the image level tests with an inconsistent configuration @@ -66,37 +72,39 @@ def test_image_inconsistent(random_seed: int, target (str): the target confidence (float): the confidence level """ - testset = _prepare_testsets_drishti_gs(subset=[image_identifier], - target=target, - confidence=confidence)[0] - - scores = generate_scores_for_testsets([testset], - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation='mos', - random_state=random_seed) - - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - results = check_drishti_gs_segmentation_image(image_identifier=image_identifier, - confidence=confidence, - target=target, - scores=scores, - eps=1e-4) - - assert results['inconsistency'] - - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('subset', ['train', 'test', test_identifiers]) -@pytest.mark.parametrize('target', ['OD', 'OC']) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('aggregation', ['som', 'mos']) -def test_aggregated_consistent(random_seed: int, - subset, - target: str, - confidence: float, - aggregation: str): + testset = _prepare_testsets_drishti_gs( + subset=[image_identifier], target=target, confidence=confidence + )[0] + + scores = generate_scores_for_testsets( + [testset], + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation="mos", + random_state=random_seed, + ) + + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + results = check_drishti_gs_segmentation_image( + image_identifier=image_identifier, + confidence=confidence, + target=target, + scores=scores, + eps=1e-4, + ) + + assert results["inconsistency"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("subset", ["train", "test", test_identifiers]) +@pytest.mark.parametrize("target", ["OD", "OC"]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("aggregation", ["som", "mos"]) +def test_aggregated_consistent( + random_seed: int, subset, target: str, confidence: float, aggregation: str +): """ Testing the consistency test for aggregated scores in a consistent case @@ -107,34 +115,33 @@ def test_aggregated_consistent(random_seed: int, confidence (float): the confidence level aggregation (str): the aggregation to be used """ - testsets = _prepare_testsets_drishti_gs(subset=subset, - target=target, - confidence=confidence) - - scores = generate_scores_for_testsets(testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation=aggregation, - random_state=random_seed) - - results = check_drishti_gs_segmentation_aggregated(subset=subset, - confidence=confidence, - target=target, - scores=scores, - eps=1e-4) - - assert not results['inconsistency'][f'inconsistency_{aggregation}'] - -@pytest.mark.parametrize('random_seed', [1, 2, 3, 4, 5]) -@pytest.mark.parametrize('subset', ['train', 'test', test_identifiers]) -@pytest.mark.parametrize('target', ['OD', 'OC']) -@pytest.mark.parametrize('confidence', [0.5, 0.75]) -@pytest.mark.parametrize('aggregation', ['som', 'mos']) -def test_aggregated_inconsistent(random_seed: int, - subset, - target: str, - confidence: float, - aggregation: str): + testsets = _prepare_testsets_drishti_gs( + subset=subset, target=target, confidence=confidence + ) + + scores = generate_scores_for_testsets( + testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation=aggregation, + random_state=random_seed, + ) + + results = check_drishti_gs_segmentation_aggregated( + subset=subset, confidence=confidence, target=target, scores=scores, eps=1e-4 + ) + + assert not results["inconsistency"][f"inconsistency_{aggregation}"] + + +@pytest.mark.parametrize("random_seed", [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("subset", ["train", "test", test_identifiers]) +@pytest.mark.parametrize("target", ["OD", "OC"]) +@pytest.mark.parametrize("confidence", [0.5, 0.75]) +@pytest.mark.parametrize("aggregation", ["som", "mos"]) +def test_aggregated_inconsistent( + random_seed: int, subset, target: str, confidence: float, aggregation: str +): """ Testing the consistency test for aggregated scores in an inconsistent case @@ -145,22 +152,22 @@ def test_aggregated_inconsistent(random_seed: int, confidence (float): the confidence level aggregation (str): the aggregation to be used """ - testsets = _prepare_testsets_drishti_gs(subset=subset, - target=target, - confidence=confidence) + testsets = _prepare_testsets_drishti_gs( + subset=subset, target=target, confidence=confidence + ) - scores = generate_scores_for_testsets(testsets, - rounding_decimals=4, - subset=['acc', 'sens', 'spec', 'f1p'], - aggregation=aggregation, - random_state=random_seed) + scores = generate_scores_for_testsets( + testsets, + rounding_decimals=4, + subset=["acc", "sens", "spec", "f1p"], + aggregation=aggregation, + random_state=random_seed, + ) - scores['acc'] = (1.0 + scores['sens']) / 2.0 + scores["acc"] = (1.0 + scores["sens"]) / 2.0 - results = check_drishti_gs_segmentation_aggregated(subset=subset, - confidence=confidence, - target=target, - scores=scores, - eps=1e-4) + results = check_drishti_gs_segmentation_aggregated( + subset=subset, confidence=confidence, target=target, scores=scores, eps=1e-4 + ) - assert results['inconsistency'][f'inconsistency_{aggregation}'] + assert results["inconsistency"][f"inconsistency_{aggregation}"] diff --git a/tests/check/bundles/test_retina_drive.py b/tests/check/bundles/test_retina_drive.py index 96fc3d9..55d48e7 100644 --- a/tests/check/bundles/test_retina_drive.py +++ b/tests/check/bundles/test_retina_drive.py @@ -4,14 +4,17 @@ import pytest -from mlscorecheck.check.bundles.retina import (check_drive_vessel_image, - check_drive_vessel_aggregated) +from mlscorecheck.check.bundles.retina import ( + check_drive_vessel_image, + check_drive_vessel_aggregated, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_mos(random_state): """ Testing a consistent setup with MoS aggregation @@ -20,29 +23,29 @@ def test_success_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + results = check_drive_vessel_aggregated( + imageset="train", annotator=1, scores=scores, eps=1e-4, verbosity=0 + ) - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - results = check_drive_vessel_aggregated(imageset='train', - annotator=1, - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_fov_mos"] - assert not results['inconsistency']['inconsistency_fov_mos'] + results = check_drive_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator=1, + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_drive_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator=1, - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_fov_mos"] - assert not results['inconsistency']['inconsistency_fov_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_mos(random_state): """ Testing an inconsistent setup with MoS aggregation @@ -51,31 +54,31 @@ def test_failure_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_drive_vessel_aggregated( + imageset="train", annotator=1, scores=scores, eps=1e-4, verbosity=0 + ) - results = check_drive_vessel_aggregated(imageset='train', - annotator=1, - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_fov_mos"] - assert results['inconsistency']['inconsistency_fov_mos'] + results = check_drive_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator=1, + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_drive_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator=1, - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_fov_mos"] - assert results['inconsistency']['inconsistency_fov_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_som(random_state): """ Testing a consistent setup with SoM aggregation @@ -84,28 +87,29 @@ def test_success_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) - results = check_drive_vessel_aggregated(imageset='train', - annotator=1, - scores=scores, - eps=1e-4) + results = check_drive_vessel_aggregated( + imageset="train", annotator=1, scores=scores, eps=1e-4 + ) - assert not results['inconsistency']['inconsistency_fov_som'] + assert not results["inconsistency"]["inconsistency_fov_som"] - results = check_drive_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator=1, - scores=scores, - eps=1e-4) + results = check_drive_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator=1, + scores=scores, + eps=1e-4, + ) - assert not results['inconsistency']['inconsistency_fov_som'] + assert not results["inconsistency"]["inconsistency_fov_som"] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_som(random_state): """ Testing an inconsistent setup with SoM aggregation @@ -114,29 +118,30 @@ def test_failure_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_drive_vessel_aggregated( + imageset="train", annotator=1, scores=scores, eps=1e-4 + ) - results = check_drive_vessel_aggregated(imageset='train', - annotator=1, - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_fov_som"] - assert results['inconsistency']['inconsistency_fov_som'] + results = check_drive_vessel_aggregated( + imageset=[img["identifier"] for img in data], + annotator=1, + scores=scores, + eps=1e-4, + ) - results = check_drive_vessel_aggregated(imageset=[img['identifier'] for img in data], - annotator=1, - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_fov_som"] - assert results['inconsistency']['inconsistency_fov_som'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_image(random_state): """ Testing a consistent setup for an image @@ -145,21 +150,20 @@ def test_success_image(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] + + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + results = check_drive_vessel_image( + image_identifier=data[0]["identifier"], annotator=1, scores=scores, eps=1e-4 + ) - results = check_drive_vessel_image(image_identifier=data[0]['identifier'], - annotator=1, - scores=scores, - eps=1e-4) + assert not results["inconsistency"]["inconsistency_fov"] - assert not results['inconsistency']['inconsistency_fov'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_image(random_state): """ Testing an inconsistent setup for an image @@ -167,18 +171,16 @@ def test_failure_image(random_state): Args: random_state (int): the random seed to use """ - data = get_experiment('retina.drive')[(1, 'fov')]['train']['images'] + data = get_experiment("retina.drive")[(1, "fov")]["train"]["images"] - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores['acc'] = (1.0 + scores['spec'])/2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_drive_vessel_image(image_identifier=data[0]['identifier'], - annotator=1, - scores=scores, - eps=1e-4) + results = check_drive_vessel_image( + image_identifier=data[0]["identifier"], annotator=1, scores=scores, eps=1e-4 + ) - assert results['inconsistency']['inconsistency_fov'] + assert results["inconsistency"]["inconsistency_fov"] diff --git a/tests/check/bundles/test_retina_hrf.py b/tests/check/bundles/test_retina_hrf.py index a885507..3e47843 100644 --- a/tests/check/bundles/test_retina_hrf.py +++ b/tests/check/bundles/test_retina_hrf.py @@ -4,14 +4,17 @@ import pytest -from mlscorecheck.check.bundles.retina import (check_hrf_vessel_image, - check_hrf_vessel_aggregated) +from mlscorecheck.check.bundles.retina import ( + check_hrf_vessel_image, + check_hrf_vessel_aggregated, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_mos(random_state): """ Testing a consistent setup with MoS aggregation @@ -20,28 +23,29 @@ def test_success_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')[('fov')]['images'] + data = get_experiment("retina.hrf")[("fov")]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) + results = check_hrf_vessel_aggregated( + imageset="all", scores=scores, eps=1e-4, verbosity=0 + ) - results = check_hrf_vessel_aggregated(imageset='all', - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_fov_mos"] - assert not results['inconsistency']['inconsistency_fov_mos'] + results = check_hrf_vessel_aggregated( + imageset=[tmp["identifier"] for tmp in data], + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_hrf_vessel_aggregated(imageset=[tmp['identifier'] for tmp in data], - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_fov_mos"] - assert not results['inconsistency']['inconsistency_fov_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_mos(random_state): """ Testing an inconsistent setup with MoS aggregation @@ -50,29 +54,30 @@ def test_failure_mos(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')[('fov')]['images'] + data = get_experiment("retina.hrf")[("fov")]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(data, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_hrf_vessel_aggregated( + imageset="all", scores=scores, eps=1e-4, verbosity=0 + ) - results = check_hrf_vessel_aggregated(imageset='all', - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_fov_mos"] - assert results['inconsistency']['inconsistency_fov_mos'] + results = check_hrf_vessel_aggregated( + imageset=[img["identifier"] for img in data], + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_hrf_vessel_aggregated(imageset=[img['identifier'] for img in data], - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_fov_mos"] - assert results['inconsistency']['inconsistency_fov_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_som(random_state): """ Testing a consistent setup with SoM aggregation @@ -81,26 +86,24 @@ def test_success_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')['fov']['images'] + data = get_experiment("retina.hrf")["fov"]["images"] - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) - results = check_hrf_vessel_aggregated(imageset='all', - scores=scores, - eps=1e-4) + results = check_hrf_vessel_aggregated(imageset="all", scores=scores, eps=1e-4) - assert not results['inconsistency']['inconsistency_fov_som'] + assert not results["inconsistency"]["inconsistency_fov_som"] - results = check_hrf_vessel_aggregated(imageset=[img['identifier'] for img in data], - scores=scores, - eps=1e-4) + results = check_hrf_vessel_aggregated( + imageset=[img["identifier"] for img in data], scores=scores, eps=1e-4 + ) - assert not results['inconsistency']['inconsistency_fov_som'] + assert not results["inconsistency"]["inconsistency_fov_som"] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_som(random_state): """ Testing an inconsistent setup with SoM aggregation @@ -109,27 +112,25 @@ def test_failure_som(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')['fov']['images'] + data = get_experiment("retina.hrf")["fov"]["images"] + + scores = generate_scores_for_testsets( + data, aggregation="som", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(data, - aggregation='som', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_hrf_vessel_aggregated(imageset="all", scores=scores, eps=1e-4) - results = check_hrf_vessel_aggregated(imageset='all', - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_fov_som"] - assert results['inconsistency']['inconsistency_fov_som'] + results = check_hrf_vessel_aggregated( + imageset=[img["identifier"] for img in data], scores=scores, eps=1e-4 + ) - results = check_hrf_vessel_aggregated(imageset=[img['identifier'] for img in data], - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_fov_som"] - assert results['inconsistency']['inconsistency_fov_som'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_image(random_state): """ Testing a consistent setup for an image @@ -138,20 +139,20 @@ def test_success_image(random_state): random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')['fov']['images'] + data = get_experiment("retina.hrf")["fov"]["images"] + + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + results = check_hrf_vessel_image( + image_identifier=data[0]["identifier"], scores=scores, eps=1e-4 + ) - results = check_hrf_vessel_image(image_identifier=data[0]['identifier'], - scores=scores, - eps=1e-4) + assert not results["inconsistency"]["inconsistency_fov"] - assert not results['inconsistency']['inconsistency_fov'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_image(random_state): """ Testing an inconsistent setup for an image @@ -159,17 +160,16 @@ def test_failure_image(random_state): Args: random_state (int): the random seed to use """ - data = get_experiment('retina.hrf')['fov']['images'] + data = get_experiment("retina.hrf")["fov"]["images"] - scores = generate_scores_for_testsets([data[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + [data[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores['acc'] = (1.0 + scores['spec'])/2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_hrf_vessel_image(image_identifier=data[0]['identifier'], - scores=scores, - eps=1e-4) + results = check_hrf_vessel_image( + image_identifier=data[0]["identifier"], scores=scores, eps=1e-4 + ) - assert results['inconsistency']['inconsistency_fov'] + assert results["inconsistency"]["inconsistency_fov"] diff --git a/tests/check/bundles/test_retina_stare.py b/tests/check/bundles/test_retina_stare.py index 4e81299..869699f 100644 --- a/tests/check/bundles/test_retina_stare.py +++ b/tests/check/bundles/test_retina_stare.py @@ -4,14 +4,17 @@ import pytest -from mlscorecheck.check.bundles.retina import (check_stare_vessel_image, - check_stare_vessel_aggregated) +from mlscorecheck.check.bundles.retina import ( + check_stare_vessel_image, + check_stare_vessel_aggregated, +) from mlscorecheck.experiments import get_experiment from mlscorecheck.aggregated import generate_scores_for_testsets -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_mos(random_state): """ Testing a consistent setup with MoS aggregation @@ -20,29 +23,29 @@ def test_success_mos(random_state): random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] + + scores = generate_scores_for_testsets( + dataah, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + results = check_stare_vessel_aggregated( + imageset="all", annotator="ah", scores=scores, eps=1e-4, verbosity=0 + ) - scores = generate_scores_for_testsets(dataah, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - results = check_stare_vessel_aggregated(imageset='all', - annotator='ah', - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_mos"] - assert not results['inconsistency']['inconsistency_mos'] + results = check_stare_vessel_aggregated( + imageset=[img["identifier"] for img in dataah], + annotator="ah", + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_stare_vessel_aggregated(imageset=[img['identifier'] for img in dataah], - annotator='ah', - scores=scores, - eps=1e-4, - verbosity=0) + assert not results["inconsistency"]["inconsistency_mos"] - assert not results['inconsistency']['inconsistency_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_mos(random_state): """ Testing an inconsistent setup with MoS aggregation @@ -51,31 +54,31 @@ def test_failure_mos(random_state): random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] + + scores = generate_scores_for_testsets( + dataah, aggregation="mos", rounding_decimals=4, random_state=random_state + ) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores = generate_scores_for_testsets(dataah, - aggregation='mos', - rounding_decimals=4, - random_state=random_state) - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_stare_vessel_aggregated( + imageset="all", annotator="ah", scores=scores, eps=1e-4, verbosity=0 + ) - results = check_stare_vessel_aggregated(imageset='all', - annotator='ah', - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_mos"] - assert results['inconsistency']['inconsistency_mos'] + results = check_stare_vessel_aggregated( + imageset=[img["identifier"] for img in dataah], + annotator="ah", + scores=scores, + eps=1e-4, + verbosity=0, + ) - results = check_stare_vessel_aggregated(imageset=[img['identifier'] for img in dataah], - annotator='ah', - scores=scores, - eps=1e-4, - verbosity=0) + assert results["inconsistency"]["inconsistency_mos"] - assert results['inconsistency']['inconsistency_mos'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_som(random_state): """ Testing a consistent setup with SoM aggregation @@ -84,28 +87,29 @@ def test_success_som(random_state): random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] - scores = generate_scores_for_testsets(dataah, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + dataah, aggregation="som", rounding_decimals=4, random_state=random_state + ) - results = check_stare_vessel_aggregated(imageset='all', - annotator='ah', - scores=scores, - eps=1e-4) + results = check_stare_vessel_aggregated( + imageset="all", annotator="ah", scores=scores, eps=1e-4 + ) - assert not results['inconsistency']['inconsistency_som'] + assert not results["inconsistency"]["inconsistency_som"] - results = check_stare_vessel_aggregated(imageset=[img['identifier'] for img in dataah], - annotator='ah', - scores=scores, - eps=1e-4) + results = check_stare_vessel_aggregated( + imageset=[img["identifier"] for img in dataah], + annotator="ah", + scores=scores, + eps=1e-4, + ) - assert not results['inconsistency']['inconsistency_som'] + assert not results["inconsistency"]["inconsistency_som"] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) + +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_som(random_state): """ Testing an inconsistent setup with SoM aggregation @@ -114,30 +118,31 @@ def test_failure_som(random_state): random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] + + scores = generate_scores_for_testsets( + dataah, aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets(dataah, - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - scores['acc'] = (1.0 + scores['spec'])/2.0 + results = check_stare_vessel_aggregated( + imageset="all", annotator="ah", scores=scores, eps=1e-4 + ) - results = check_stare_vessel_aggregated(imageset='all', - annotator='ah', - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_som"] - assert results['inconsistency']['inconsistency_som'] + results = check_stare_vessel_aggregated( + imageset=[img["identifier"] for img in dataah], + annotator="ah", + scores=scores, + eps=1e-4, + ) - results = check_stare_vessel_aggregated(imageset=[img['identifier'] for img in dataah], - annotator='ah', - scores=scores, - eps=1e-4) + assert results["inconsistency"]["inconsistency_som"] - assert results['inconsistency']['inconsistency_som'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_success_image(random_state): """ Testing a consistent setup for an image @@ -146,21 +151,23 @@ def test_success_image(random_state): random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] + + scores = generate_scores_for_testsets( + [dataah[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores = generate_scores_for_testsets([dataah[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + results = check_stare_vessel_image( + image_identifier=dataah[0]["identifier"], + annotator="ah", + scores=scores, + eps=1e-4, + ) - results = check_stare_vessel_image(image_identifier=dataah[0]['identifier'], - annotator='ah', - scores=scores, - eps=1e-4) + assert not results["inconsistency"] - assert not results['inconsistency'] -@pytest.mark.parametrize('random_state', [1, 2, 3, 4, 5]) +@pytest.mark.parametrize("random_state", [1, 2, 3, 4, 5]) def test_failure_image(random_state): """ Testing an inconsistent setup for an image @@ -168,18 +175,19 @@ def test_failure_image(random_state): Args: random_state (int): the random seed to use """ - dataah = get_experiment('retina.stare')['ah']['images'] + dataah = get_experiment("retina.stare")["ah"]["images"] - scores = generate_scores_for_testsets([dataah[0]], - aggregation='som', - rounding_decimals=4, - random_state=random_state) + scores = generate_scores_for_testsets( + [dataah[0]], aggregation="som", rounding_decimals=4, random_state=random_state + ) - scores['acc'] = (1.0 + scores['spec'])/2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - results = check_stare_vessel_image(image_identifier=dataah[0]['identifier'], - annotator='ah', - scores=scores, - eps=1e-4) + results = check_stare_vessel_image( + image_identifier=dataah[0]["identifier"], + annotator="ah", + scores=scores, + eps=1e-4, + ) - assert results['inconsistency'] + assert results["inconsistency"] diff --git a/tests/check/bundles/test_tpehg.py b/tests/check/bundles/test_tpehg.py index d7b021f..6e8aecf 100644 --- a/tests/check/bundles/test_tpehg.py +++ b/tests/check/bundles/test_tpehg.py @@ -4,14 +4,17 @@ from mlscorecheck.check.bundles.ehg import check_tpehg + def test_check_tpehg(): """ Testing the check_tpehg function """ - results = check_tpehg(scores={'acc': 0.95, 'sens': 0.95, 'spec': 0.95}, - eps=1e-4, - n_folds=5, - n_repeats=1) + results = check_tpehg( + scores={"acc": 0.95, "sens": 0.95, "spec": 0.95}, + eps=1e-4, + n_folds=5, + n_repeats=1, + ) - assert 'inconsistency' in results + assert "inconsistency" in results diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py index 1da44b5..cbed0a5 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_macro.py @@ -7,7 +7,8 @@ from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_macro from mlscorecheck.aggregated import generate_dataset_folding_multiclass -@pytest.mark.parametrize('random_seed', range(20)) + +@pytest.mark.parametrize("random_seed", range(20)) def test_consistent(random_seed: int): """ Testing a consistent configuration @@ -17,22 +18,22 @@ def test_consistent(random_seed: int): """ dataset, folding, scores = generate_dataset_folding_multiclass( - random_state=random_seed, - average='macro', - aggregation='mos', - max_class_size=100, - rounding_decimals=4, - #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] - ) - - result = check_1_dataset_known_folds_mos_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) - - assert not result['inconsistency'] - -@pytest.mark.parametrize('random_seed', range(20)) + random_state=random_seed, + average="macro", + aggregation="mos", + max_class_size=100, + rounding_decimals=4, + # subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) + + result = check_1_dataset_known_folds_mos_macro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4 + ) + + assert not result["inconsistency"] + + +@pytest.mark.parametrize("random_seed", range(20)) def test_inconsistent(random_seed: int): """ Testing a consistent configuration @@ -42,19 +43,17 @@ def test_inconsistent(random_seed: int): """ dataset, folding, scores = generate_dataset_folding_multiclass( - random_state=random_seed, - average='macro', - aggregation='mos', - rounding_decimals=4, - #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] - ) - - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - result = check_1_dataset_known_folds_mos_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4, - timeout=2) - - assert result['inconsistency'] + random_state=random_seed, + average="macro", + aggregation="mos", + rounding_decimals=4, + # subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) + + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + result = check_1_dataset_known_folds_mos_macro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4, timeout=2 + ) + + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py index a695f00..ba1f46a 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_mos_micro.py @@ -7,7 +7,8 @@ from mlscorecheck.check.multiclass import check_1_dataset_known_folds_mos_micro from mlscorecheck.aggregated import generate_dataset_folding_multiclass -@pytest.mark.parametrize('random_seed', range(20)) + +@pytest.mark.parametrize("random_seed", range(20)) def test_consistent(random_seed: int): """ Testing a consistent configuration @@ -17,21 +18,21 @@ def test_consistent(random_seed: int): """ dataset, folding, scores = generate_dataset_folding_multiclass( - random_state=random_seed, - average='micro', - aggregation='mos', - rounding_decimals=4, - #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] - ) + random_state=random_seed, + average="micro", + aggregation="mos", + rounding_decimals=4, + # subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) + + result = check_1_dataset_known_folds_mos_micro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4 + ) - result = check_1_dataset_known_folds_mos_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', range(20)) +@pytest.mark.parametrize("random_seed", range(20)) def test_inconsistent(random_seed: int): """ Testing a consistent configuration @@ -41,19 +42,17 @@ def test_inconsistent(random_seed: int): """ dataset, folding, scores = generate_dataset_folding_multiclass( - random_state=random_seed, - average='micro', - aggregation='mos', - rounding_decimals=4, - #subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] - ) - - scores['acc'] = (1.0 + scores['spec']) / 2.0 - - result = check_1_dataset_known_folds_mos_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4, - timeout=2) - - assert result['inconsistency'] + random_state=random_seed, + average="micro", + aggregation="mos", + rounding_decimals=4, + # subset=['acc', 'sens', 'spec', 'f1p', 'bacc'] + ) + + scores["acc"] = (1.0 + scores["spec"]) / 2.0 + + result = check_1_dataset_known_folds_mos_micro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4, timeout=2 + ) + + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py index 779bc73..41e5e32 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_som_macro.py @@ -7,7 +7,8 @@ from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_macro from mlscorecheck.aggregated import generate_dataset_folding_multiclass -@pytest.mark.parametrize('random_seed', range(20)) + +@pytest.mark.parametrize("random_seed", range(20)) def test_consistent(random_seed: int): """ Testing a consistent configuration @@ -16,19 +17,21 @@ def test_consistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='macro', - aggregation='som', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average="macro", + aggregation="som", + rounding_decimals=4, + ) + + result = check_1_dataset_known_folds_som_macro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4 + ) - result = check_1_dataset_known_folds_som_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', range(20)) +@pytest.mark.parametrize("random_seed", range(20)) def test_inconsistent(random_seed: int): """ Testing a consistent configuration @@ -37,17 +40,17 @@ def test_inconsistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='macro', - aggregation='som', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average="macro", + aggregation="som", + rounding_decimals=4, + ) - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - result = check_1_dataset_known_folds_som_macro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4, - timeout=2) + result = check_1_dataset_known_folds_som_macro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4, timeout=2 + ) - assert result['inconsistency'] + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py b/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py index d79ad55..3814d56 100644 --- a/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py +++ b/tests/check/multiclass/test_1_dataset_known_folds_som_micro.py @@ -7,7 +7,8 @@ from mlscorecheck.check.multiclass import check_1_dataset_known_folds_som_micro from mlscorecheck.aggregated import generate_dataset_folding_multiclass -@pytest.mark.parametrize('random_seed', range(20)) + +@pytest.mark.parametrize("random_seed", range(20)) def test_consistent(random_seed: int): """ Testing a consistent configuration @@ -16,19 +17,21 @@ def test_consistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='micro', - aggregation='som', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average="micro", + aggregation="som", + rounding_decimals=4, + ) + + result = check_1_dataset_known_folds_som_micro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4 + ) - result = check_1_dataset_known_folds_som_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', range(20)) +@pytest.mark.parametrize("random_seed", range(20)) def test_inconsistent(random_seed: int): """ Testing a consistent configuration @@ -37,16 +40,17 @@ def test_inconsistent(random_seed: int): random_seed (int): the random seed to be used """ - dataset, folding, scores = generate_dataset_folding_multiclass(random_state=random_seed, - average='micro', - aggregation='som', - rounding_decimals=4) + dataset, folding, scores = generate_dataset_folding_multiclass( + random_state=random_seed, + average="micro", + aggregation="som", + rounding_decimals=4, + ) - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - result = check_1_dataset_known_folds_som_micro(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-4) + result = check_1_dataset_known_folds_som_micro( + dataset=dataset, folding=folding, scores=scores, eps=1e-4 + ) - assert result['inconsistency'] + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/multiclass/test_1_testset_no_kfold_macro.py b/tests/check/multiclass/test_1_testset_no_kfold_macro.py index 791a53d..3bb4859 100644 --- a/tests/check/multiclass/test_1_testset_no_kfold_macro.py +++ b/tests/check/multiclass/test_1_testset_no_kfold_macro.py @@ -5,11 +5,14 @@ import pytest from mlscorecheck.check.multiclass import check_1_testset_no_kfold_macro -from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset) +from mlscorecheck.individual import ( + generate_multiclass_dataset, + sample_multiclass_dataset, +) from mlscorecheck.scores import calculate_multiclass_scores -@pytest.mark.parametrize('random_seed', list(range(10))) + +@pytest.mark.parametrize("random_seed", list(range(10))) def test_consistent_configuration(random_seed): """ Testing a consistent configuration @@ -19,24 +22,23 @@ def test_consistent_configuration(random_seed): """ dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) + + scores = calculate_multiclass_scores( + confm, + average="macro", + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=4, + ) - scores = calculate_multiclass_scores(confm, - average='macro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) + scores = scores | {"beta_positive": 2, "beta_negative": 2} - scores = scores | {'beta_positive': 2, 'beta_negative': 2} + result = check_1_testset_no_kfold_macro(testset=dataset, scores=scores, eps=1e-4) - result = check_1_testset_no_kfold_macro(testset=dataset, - scores=scores, - eps=1e-4) + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) +@pytest.mark.parametrize("random_seed", list(range(10))) def test_inconsistent_configuration(random_seed): """ Testing a consistent configuration @@ -46,21 +48,20 @@ def test_inconsistent_configuration(random_seed): """ dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) - scores = calculate_multiclass_scores(confm, - average='macro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) + scores = calculate_multiclass_scores( + confm, + average="macro", + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=4, + ) - scores = scores | {'beta_positive': 2, 'beta_negative': 2} - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores = scores | {"beta_positive": 2, "beta_negative": 2} + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - result = check_1_testset_no_kfold_macro(testset=dataset, - scores=scores, - eps=1e-4, - timeout=2) + result = check_1_testset_no_kfold_macro( + testset=dataset, scores=scores, eps=1e-4, timeout=2 + ) - assert result['inconsistency'] + assert result["inconsistency"] or result["lp_status"] == "timeout" diff --git a/tests/check/multiclass/test_1_testset_no_kfold_micro.py b/tests/check/multiclass/test_1_testset_no_kfold_micro.py index 9d69088..01df9da 100644 --- a/tests/check/multiclass/test_1_testset_no_kfold_micro.py +++ b/tests/check/multiclass/test_1_testset_no_kfold_micro.py @@ -5,11 +5,14 @@ import pytest from mlscorecheck.check.multiclass import check_1_testset_no_kfold_micro -from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset) +from mlscorecheck.individual import ( + generate_multiclass_dataset, + sample_multiclass_dataset, +) from mlscorecheck.scores import calculate_multiclass_scores -@pytest.mark.parametrize('random_seed', list(range(10))) + +@pytest.mark.parametrize("random_seed", list(range(10))) def test_consistent_configuration(random_seed): """ Testing a consistent configuration @@ -19,27 +22,26 @@ def test_consistent_configuration(random_seed): """ dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) - scores = calculate_multiclass_scores(confm, - average='micro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) + scores = calculate_multiclass_scores( + confm, + average="micro", + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=4, + ) - scores = scores | {'beta_positive': 2, 'beta_negative': 2} + scores = scores | {"beta_positive": 2, "beta_negative": 2} print(dataset) print(scores) - result = check_1_testset_no_kfold_micro(testset=dataset, - scores=scores, - eps=1e-4) + result = check_1_testset_no_kfold_micro(testset=dataset, scores=scores, eps=1e-4) + + assert not result["inconsistency"] - assert not result['inconsistency'] -@pytest.mark.parametrize('random_seed', list(range(10))) +@pytest.mark.parametrize("random_seed", list(range(10))) def test_inconsistent_configuration(random_seed): """ Testing a consistent configuration @@ -49,20 +51,18 @@ def test_inconsistent_configuration(random_seed): """ dataset = generate_multiclass_dataset(random_state=random_seed) - confm = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) + confm = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) - scores = calculate_multiclass_scores(confm, - average='micro', - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - rounding_decimals=4) + scores = calculate_multiclass_scores( + confm, + average="micro", + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + rounding_decimals=4, + ) - scores = scores | {'beta_positive': 2, 'beta_negative': 2} - scores['acc'] = (1.0 + scores['spec']) / 2.0 + scores = scores | {"beta_positive": 2, "beta_negative": 2} + scores["acc"] = (1.0 + scores["spec"]) / 2.0 - result = check_1_testset_no_kfold_micro(testset=dataset, - scores=scores, - eps=1e-4) + result = check_1_testset_no_kfold_micro(testset=dataset, scores=scores, eps=1e-4) - assert result['inconsistency'] + assert result["inconsistency"] diff --git a/tests/check/regression/test_check_1_testset_no_kfold.py b/tests/check/regression/test_check_1_testset_no_kfold.py index 7c4c058..9d2f863 100644 --- a/tests/check/regression/test_check_1_testset_no_kfold.py +++ b/tests/check/regression/test_check_1_testset_no_kfold.py @@ -5,13 +5,17 @@ import pytest from mlscorecheck.core import safe_eval -from mlscorecheck.check.regression import (generate_regression_problem_and_scores, - check_1_testset_no_kfold, - score_formulas) +from mlscorecheck.check.regression import ( + generate_regression_problem_and_scores, + check_1_testset_no_kfold, + score_formulas, +) -@pytest.mark.parametrize('random_seed', list(range(20))) -@pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], - ['mae', 'mse'], ['mae', 'r2'], ['mae']]) + +@pytest.mark.parametrize("random_seed", list(range(20))) +@pytest.mark.parametrize( + "subset", [None, ["mae", "rmse"], ["mae", "mse"], ["mae", "r2"], ["mae"]] +) def test_consistency(random_seed, subset): """ Testing a consistent configuration @@ -21,16 +25,19 @@ def test_consistency(random_seed, subset): subset (list): the score subset to use """ - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed, - rounding_decimals=4, - subset=subset) + var, n_samples, scores = generate_regression_problem_and_scores( + random_state=random_seed, rounding_decimals=4, subset=subset + ) result = check_1_testset_no_kfold(var, n_samples, scores, eps=1e-4) - assert not result['inconsistency'] + assert not result["inconsistency"] + -@pytest.mark.parametrize('random_seed', list(range(20))) -@pytest.mark.parametrize('subset', [None, ['mae', 'rmse'], ['mae', 'mse'], ['mae', 'r2'], ['mae']]) +@pytest.mark.parametrize("random_seed", list(range(20))) +@pytest.mark.parametrize( + "subset", [None, ["mae", "rmse"], ["mae", "mse"], ["mae", "r2"], ["mae"]] +) def test_inconsistency(random_seed, subset): """ Testing an iconsistent configuration @@ -40,18 +47,19 @@ def test_inconsistency(random_seed, subset): subset (list): the score subset to use """ - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed, - rounding_decimals=4, - subset=subset) + var, n_samples, scores = generate_regression_problem_and_scores( + random_state=random_seed, rounding_decimals=4, subset=subset + ) - scores['mae'] = 0.6 - scores['rmse'] = 0.5 + scores["mae"] = 0.6 + scores["rmse"] = 0.5 result = check_1_testset_no_kfold(var, n_samples, scores, eps=1e-4) - assert result['inconsistency'] + assert result["inconsistency"] + -@pytest.mark.parametrize('random_seed', list(range(20))) +@pytest.mark.parametrize("random_seed", list(range(20))) def test_score_formulas(random_seed): """ Testing the score formulas @@ -60,10 +68,14 @@ def test_score_formulas(random_seed): random_seed (int): the random seed to use """ - var, n_samples, scores = generate_regression_problem_and_scores(random_state=random_seed) + var, n_samples, scores = generate_regression_problem_and_scores( + random_state=random_seed + ) for key, solutions in score_formulas.items(): for sol_key, solution in solutions.items(): - score_tmp = safe_eval(solution, scores | {'var': var, 'n_samples': n_samples}) + score_tmp = safe_eval( + solution, scores | {"var": var, "n_samples": n_samples} + ) print(key, sol_key, score_tmp, scores[key]) assert abs(score_tmp - scores[key]) < 1e-8 diff --git a/tests/core/test_dict.py b/tests/core/test_dict.py index 6466df6..7d57922 100644 --- a/tests/core/test_dict.py +++ b/tests/core/test_dict.py @@ -4,21 +4,23 @@ from mlscorecheck.core import dict_mean, dict_minmax + def test_dict_mean(): """ Testing the calculation of the mean of dicts """ - means = dict_mean([{'a': 1, 'b': 2}, {'a': 3, 'b': 4}]) - assert means['a'] == 2 - assert means['b'] == 3 + means = dict_mean([{"a": 1, "b": 2}, {"a": 3, "b": 4}]) + assert means["a"] == 2 + assert means["b"] == 3 + def test_dict_minmax(): """ Testing calculating the minmax of dicts """ - minmax = dict_minmax([{'a': 1, 'b': 2}, {'a': 3, 'b': 4}, {'a': 0, 'b': 2}]) + minmax = dict_minmax([{"a": 1, "b": 2}, {"a": 3, "b": 4}, {"a": 0, "b": 2}]) - assert minmax['a'] == [0, 3] - assert minmax['b'] == [2, 4] + assert minmax["a"] == [0, 3] + assert minmax["b"] == [2, 4] diff --git a/tests/core/test_numerical_uncertainty.py b/tests/core/test_numerical_uncertainty.py index 2934e9c..1aee357 100644 --- a/tests/core/test_numerical_uncertainty.py +++ b/tests/core/test_numerical_uncertainty.py @@ -4,8 +4,8 @@ import pytest -from mlscorecheck.core import (check_uncertainty_and_tolerance, - update_uncertainty) +from mlscorecheck.core import check_uncertainty_and_tolerance, update_uncertainty + def test_uncertainty_and_tolerance(): """ @@ -13,10 +13,11 @@ def test_uncertainty_and_tolerance(): """ with pytest.raises(ValueError): - check_uncertainty_and_tolerance({'acc': 1e-7, 'sens': 1e-4}, 2*1e-8) + check_uncertainty_and_tolerance({"acc": 1e-7, "sens": 1e-4}, 2 * 1e-8) with pytest.raises(ValueError): - check_uncertainty_and_tolerance(1e-7, 2*1e-8) + check_uncertainty_and_tolerance(1e-7, 2 * 1e-8) + def test_update_uncertainty(): """ @@ -24,4 +25,4 @@ def test_update_uncertainty(): """ assert abs(update_uncertainty(1e-2, 1e-3) - (1e-2 + 1e-3)) <= 1e-5 - assert abs(update_uncertainty({'acc': 1e-2}, 1e-3)['acc'] - (1e-2 + 1e-3)) <= 1e-5 + assert abs(update_uncertainty({"acc": 1e-2}, 1e-3)["acc"] - (1e-2 + 1e-3)) <= 1e-5 diff --git a/tests/core/test_random_state.py b/tests/core/test_random_state.py index 0d0d7e6..e7183ee 100644 --- a/tests/core/test_random_state.py +++ b/tests/core/test_random_state.py @@ -6,6 +6,7 @@ from mlscorecheck.core import init_random_state + def test_init_random_state(): """ Testing the init random state functionality diff --git a/tests/core/test_rounding.py b/tests/core/test_rounding.py index 1b52c40..f4c6579 100644 --- a/tests/core/test_rounding.py +++ b/tests/core/test_rounding.py @@ -6,18 +6,19 @@ from mlscorecheck.core import round_scores + def test_round_scores(): """ Testing the rounding of scores """ - scores = {'acc': 0.123456, 'sens': 0.654321} + scores = {"acc": 0.123456, "sens": 0.654321} rounded = round_scores(scores, 3) - assert float(np.round(scores['acc'], 3)) == rounded['acc'] - assert float(np.round(scores['sens'], 3)) == rounded['sens'] + assert float(np.round(scores["acc"], 3)) == rounded["acc"] + assert float(np.round(scores["sens"], 3)) == rounded["sens"] - assert round_scores(scores)['acc'] == scores['acc'] + assert round_scores(scores)["acc"] == scores["acc"] assert round_scores(0.51, 1) == 0.5 diff --git a/tests/core/test_safe_eval.py b/tests/core/test_safe_eval.py index 9aa852c..48986e8 100644 --- a/tests/core/test_safe_eval.py +++ b/tests/core/test_safe_eval.py @@ -4,12 +4,14 @@ from mlscorecheck.core import safe_eval, safe_call + def test_safe_eval(): """ Testing the safe_eval """ - assert safe_eval('a*b', {'a': 2, 'b': 3}) == 6 + assert safe_eval("a*b", {"a": 2, "b": 3}) == 6 + def mock_function(*, a): """ @@ -21,13 +23,14 @@ def mock_function(*, a): Returns: int|float: the double of the parameter """ - return a*2 + return a * 2 + def test_safe_call(): """ Testing the safe call """ - assert safe_call(mock_function, {'a': 2, 'b': 3}, [{'a': 2, 'b': 3}]) is None - assert safe_call(mock_function, {'a': 2, 'b': 3}, [{'a': 2, 'b': 4}]) == 4 - assert safe_call(mock_function, {'a': 2, 'b': 3}, [{'a': 'a'}]) is None - assert safe_call(mock_function, {'a': 2, 'b': 3}) == 4 + assert safe_call(mock_function, {"a": 2, "b": 3}, [{"a": 2, "b": 3}]) is None + assert safe_call(mock_function, {"a": 2, "b": 3}, [{"a": 2, "b": 4}]) == 4 + assert safe_call(mock_function, {"a": 2, "b": 3}, [{"a": "a"}]) is None + assert safe_call(mock_function, {"a": 2, "b": 3}) == 4 diff --git a/tests/experiments/test_load_datasets.py b/tests/experiments/test_load_datasets.py index 497d65e..36129a4 100644 --- a/tests/experiments/test_load_datasets.py +++ b/tests/experiments/test_load_datasets.py @@ -9,23 +9,24 @@ import pytest -from mlscorecheck.experiments import (lookup_dataset, - resolve_pn) +from mlscorecheck.experiments import lookup_dataset, resolve_pn + def test_lookup_dataset(): """ Testing the lookup dataset functionality """ - path = os.path.join('experiments', 'machine_learning', 'common_datasets.json') - sio = files('mlscorecheck').joinpath(path).read_text() + path = os.path.join("experiments", "machine_learning", "common_datasets.json") + sio = files("mlscorecheck").joinpath(path).read_text() data = json.loads(sio) - for entry in data['datasets']: - dataset = lookup_dataset('common_datasets.' + entry['name']) + for entry in data["datasets"]: + dataset = lookup_dataset("common_datasets." + entry["name"]) + + assert entry["p"] == dataset["p"] + assert entry["n"] == dataset["n"] - assert entry['p'] == dataset['p'] - assert entry['n'] == dataset['n'] def test_exception(): """ @@ -33,13 +34,23 @@ def test_exception(): """ with pytest.raises(ValueError): - lookup_dataset('dummy') + lookup_dataset("dummy") + def testresolve_pn(): """ Testing the resolution of p and n figures """ - assert 'p' in resolve_pn({'dataset': 'common_datasets.ADA'}) - assert len(resolve_pn([{'dataset': 'common_datasets.ADA'}, - {'dataset': 'common_datasets.ecoli1'}])) == 2 + assert "p" in resolve_pn({"dataset": "common_datasets.ADA"}) + assert ( + len( + resolve_pn( + [ + {"dataset": "common_datasets.ADA"}, + {"dataset": "common_datasets.ecoli1"}, + ] + ) + ) + == 2 + ) diff --git a/tests/experiments/test_load_experiments.py b/tests/experiments/test_load_experiments.py index b4a8ee9..69221c1 100644 --- a/tests/experiments/test_load_experiments.py +++ b/tests/experiments/test_load_experiments.py @@ -4,28 +4,36 @@ import pytest -from mlscorecheck.experiments import (load_drive, - load_tpehg, - load_stare, - load_isic2016, - load_isic2017, - load_chase_db1, - load_diaretdb0, - load_diaretdb1, - load_hrf, - load_drishti_gs, - get_experiment) - -@pytest.mark.parametrize('key', ['retina.drive', - 'retina.stare', - 'retina.chase_db1', - 'retina.diaretdb0', - 'retina.diaretdb1', - 'retina.hrf', - 'retina.drishti_gs', - 'ehg.tpehg', - 'skinlesion.isic2016', - 'skinlesion.isic2017']) +from mlscorecheck.experiments import ( + load_drive, + load_tpehg, + load_stare, + load_isic2016, + load_isic2017, + load_chase_db1, + load_diaretdb0, + load_diaretdb1, + load_hrf, + load_drishti_gs, + get_experiment, +) + + +@pytest.mark.parametrize( + "key", + [ + "retina.drive", + "retina.stare", + "retina.chase_db1", + "retina.diaretdb0", + "retina.diaretdb1", + "retina.hrf", + "retina.drishti_gs", + "ehg.tpehg", + "skinlesion.isic2016", + "skinlesion.isic2017", + ], +) def test_get_experiment(key): """ Testing the get experiment function @@ -35,13 +43,15 @@ def test_get_experiment(key): assert len(get_experiment(key)) > 0 assert len(get_experiment(key)) > 0 + def test_get_experiment_exception(): """ Testing if get_experiment throws the exception """ with pytest.raises(ValueError): - get_experiment('dummy') + get_experiment("dummy") + def test_load_drishti_gs(): """ @@ -50,6 +60,7 @@ def test_load_drishti_gs(): assert len(load_drishti_gs()) > 0 + def test_load_hrf(): """ Testing the loading of HRF @@ -57,6 +68,7 @@ def test_load_hrf(): assert len(load_hrf()) > 0 + def test_load_diaretdb1(): """ Testing the loading of DIARETDB1 @@ -64,6 +76,7 @@ def test_load_diaretdb1(): assert len(load_diaretdb1()) > 0 + def test_load_diaretdb0(): """ Testing the loading of DIARETDB0 @@ -71,6 +84,7 @@ def test_load_diaretdb0(): assert len(load_diaretdb0()) > 0 + def test_load_chase_db1(): """ Testing the loading of CHASE db 1 @@ -78,6 +92,7 @@ def test_load_chase_db1(): assert len(load_chase_db1()) > 0 + def test_load_isic2017(): """ Testing the loading of ISIC2017 @@ -85,6 +100,7 @@ def test_load_isic2017(): assert len(load_isic2017()) > 0 + def test_load_isic2016(): """ Testing the loading of ISIC2016 @@ -92,6 +108,7 @@ def test_load_isic2016(): assert len(load_isic2016()) > 0 + def test_load_stare(): """ Testing the loading of STARE @@ -99,6 +116,7 @@ def test_load_stare(): assert len(load_stare()) > 0 + def test_load_drive(): """ Testing the loading of drive @@ -106,9 +124,10 @@ def test_load_drive(): assert len(load_drive()) == 4 + def test_load_tpehg(): """ Testing the loading of the EHG dataset """ - assert 'p' in load_tpehg() + assert "p" in load_tpehg() diff --git a/tests/individual/test_check_tptn_solutions.py b/tests/individual/test_check_tptn_solutions.py index 9934547..dddd458 100644 --- a/tests/individual/test_check_tptn_solutions.py +++ b/tests/individual/test_check_tptn_solutions.py @@ -5,19 +5,36 @@ import pytest -from mlscorecheck.individual import (check_scores_tptn_pairs, - _check_scores_tptn_pairs, - generate_1_problem, - sqrt) -from mlscorecheck.scores import (score_functions_standardized_without_complements, - calculate_scores) +from mlscorecheck.individual import ( + check_scores_tptn_pairs, + _check_scores_tptn_pairs, + generate_1_problem, + sqrt, +) +from mlscorecheck.scores import ( + score_functions_standardized_without_complements, + calculate_scores, +) score_functions = score_functions_standardized_without_complements -@pytest.mark.parametrize('figure', ['tp', 'tn', None]) -@pytest.mark.parametrize('zeros', [[], ['tp'], ['tn'], ['fp'], ['fn'], - ['tp', 'tn'], ['tp', 'fp'], ['fp', 'fn'], ['tn', 'fn']]) -@pytest.mark.parametrize('random_seed', list(range(10))) + +@pytest.mark.parametrize("figure", ["tp", "tn", None]) +@pytest.mark.parametrize( + "zeros", + [ + [], + ["tp"], + ["tn"], + ["fp"], + ["fn"], + ["tp", "tn"], + ["tp", "fp"], + ["fp", "fn"], + ["tn", "fn"], + ], +) +@pytest.mark.parametrize("random_seed", list(range(10))) def test_check_scores_tptn_pairs(figure: str, zeros: list, random_seed: int): """ This function tests the check functionality @@ -28,36 +45,45 @@ def test_check_scores_tptn_pairs(figure: str, zeros: list, random_seed: int): random_seed (int): the random seed to use """ - evaluation, problem = generate_1_problem(random_state=random_seed, - zeros=zeros) + evaluation, problem = generate_1_problem(random_state=random_seed, zeros=zeros) - evaluation['beta_positive'] = 1 - evaluation['beta_negative'] = 1 - evaluation['sqrt'] = sqrt + evaluation["beta_positive"] = 1 + evaluation["beta_negative"] = 1 + evaluation["sqrt"] = sqrt scores = calculate_scores(evaluation) scores = {key: value for key, value in scores.items() if value is not None} - scores['beta_positive'] = 1 - scores['beta_negative'] = 1 - - results = _check_scores_tptn_pairs(p=problem['p'], - n=problem['n'], - scores=scores, - eps=1e-4, - solve_for=figure) - - assert not results['inconsistency'] - -@pytest.mark.parametrize('prefilter_by_pairs', [True, False]) -@pytest.mark.parametrize('figure', ['tp', 'tn', None]) -@pytest.mark.parametrize('zeros', [[], ['tp'], ['tn'], ['fp'], ['fn'], - ['tp', 'tn'], ['tp', 'fp'], ['fp', 'fn'], ['tn', 'fn']]) -@pytest.mark.parametrize('random_seed', list(range(10))) -def test_check_scores_tptn_pairs_prefilter(figure: str, - zeros: list, - random_seed: int, - prefilter_by_pairs: bool): + scores["beta_positive"] = 1 + scores["beta_negative"] = 1 + + results = _check_scores_tptn_pairs( + p=problem["p"], n=problem["n"], scores=scores, eps=1e-4, solve_for=figure + ) + + assert not results["inconsistency"] + + +@pytest.mark.parametrize("prefilter_by_pairs", [True, False]) +@pytest.mark.parametrize("figure", ["tp", "tn", None]) +@pytest.mark.parametrize( + "zeros", + [ + [], + ["tp"], + ["tn"], + ["fp"], + ["fn"], + ["tp", "tn"], + ["tp", "fp"], + ["fp", "fn"], + ["tn", "fn"], + ], +) +@pytest.mark.parametrize("random_seed", list(range(10))) +def test_check_scores_tptn_pairs_prefilter( + figure: str, zeros: list, random_seed: int, prefilter_by_pairs: bool +): """ This function tests the check functionality with prefiltering @@ -68,37 +94,50 @@ def test_check_scores_tptn_pairs_prefilter(figure: str, prefilter_by_pairs (bool): whether to prefilter by the pairwise solutions """ - evaluation, problem = generate_1_problem(random_state=random_seed, - zeros=zeros) + evaluation, problem = generate_1_problem(random_state=random_seed, zeros=zeros) - evaluation['beta_positive'] = 1 - evaluation['beta_negative'] = 1 - evaluation['sqrt'] = sqrt + evaluation["beta_positive"] = 1 + evaluation["beta_negative"] = 1 + evaluation["sqrt"] = sqrt scores = calculate_scores(evaluation) scores = {key: value for key, value in scores.items() if value is not None} - scores['beta_positive'] = 1 - scores['beta_negative'] = 1 - - results = check_scores_tptn_pairs(p=problem['p'], - n=problem['n'], - scores=scores, - eps=1e-4, - solve_for=figure, - prefilter_by_pairs=prefilter_by_pairs) - - assert not results['inconsistency'] - -@pytest.mark.parametrize('prefilter_by_pairs', [True, False]) -@pytest.mark.parametrize('figure', ['tp', 'tn', None]) -@pytest.mark.parametrize('zeros', [[], ['tp'], ['tn'], ['fp'], ['fn'], - ['tp', 'tn'], ['tp', 'fp'], ['fp', 'fn'], ['tn', 'fn']]) -@pytest.mark.parametrize('random_seed', list(range(10))) -def test_check_scores_tptn_pairs_prefilter_failure(figure: str, - zeros: list, - random_seed: int, - prefilter_by_pairs: bool): + scores["beta_positive"] = 1 + scores["beta_negative"] = 1 + + results = check_scores_tptn_pairs( + p=problem["p"], + n=problem["n"], + scores=scores, + eps=1e-4, + solve_for=figure, + prefilter_by_pairs=prefilter_by_pairs, + ) + + assert not results["inconsistency"] + + +@pytest.mark.parametrize("prefilter_by_pairs", [True, False]) +@pytest.mark.parametrize("figure", ["tp", "tn", None]) +@pytest.mark.parametrize( + "zeros", + [ + [], + ["tp"], + ["tn"], + ["fp"], + ["fn"], + ["tp", "tn"], + ["tp", "fp"], + ["fp", "fn"], + ["tn", "fn"], + ], +) +@pytest.mark.parametrize("random_seed", list(range(10))) +def test_check_scores_tptn_pairs_prefilter_failure( + figure: str, zeros: list, random_seed: int, prefilter_by_pairs: bool +): """ This function tests the check functionality with failure @@ -109,30 +148,32 @@ def test_check_scores_tptn_pairs_prefilter_failure(figure: str, prefilter_by_pairs (bool): whether to prefilter by pair-solutions """ - evaluation, problem = generate_1_problem(random_state=random_seed, - zeros=zeros) + evaluation, problem = generate_1_problem(random_state=random_seed, zeros=zeros) - evaluation['beta_positive'] = 1 - evaluation['beta_negative'] = 1 - evaluation['sqrt'] = sqrt + evaluation["beta_positive"] = 1 + evaluation["beta_negative"] = 1 + evaluation["sqrt"] = sqrt scores = calculate_scores(evaluation) scores = {key: value for key, value in scores.items() if value is not None} - scores['bacc'] = 0.8 - scores['sens'] = 0.85 - scores['spec'] = 0.86 + scores["bacc"] = 0.8 + scores["sens"] = 0.85 + scores["spec"] = 0.86 + + scores["beta_positive"] = 1 + scores["beta_negative"] = 1 - scores['beta_positive'] = 1 - scores['beta_negative'] = 1 + results = check_scores_tptn_pairs( + p=problem["p"], + n=problem["n"], + scores=scores, + eps=1e-4, + solve_for=figure, + prefilter_by_pairs=prefilter_by_pairs, + ) - results = check_scores_tptn_pairs(p=problem['p'], - n=problem['n'], - scores=scores, - eps=1e-4, - solve_for=figure, - prefilter_by_pairs=prefilter_by_pairs) + assert results["inconsistency"] - assert results['inconsistency'] def test_check_parametrization(): """ @@ -140,4 +181,4 @@ def test_check_parametrization(): """ with pytest.raises(ValueError): - _check_scores_tptn_pairs(5, 10, scores={}, eps=1e-4, solve_for='dummy') + _check_scores_tptn_pairs(5, 10, scores={}, eps=1e-4, solve_for="dummy") diff --git a/tests/individual/test_complex_interval.py b/tests/individual/test_complex_interval.py index 6ac278c..548701f 100644 --- a/tests/individual/test_complex_interval.py +++ b/tests/individual/test_complex_interval.py @@ -4,6 +4,7 @@ from mlscorecheck.individual import Interval, IntervalUnion, ComplexInterval + def test_arithmetics(): """ Testing the arithmetics @@ -33,12 +34,14 @@ def test_arithmetics(): assert (5 - ci0).real == 5 - int0 assert (ci0 - 5).real == int0 - 5 assert (5 * ci0).real == 5 * int0 - assert (5 / ci0).real == (ComplexInterval(Interval(5, 5), Interval(0, 0)) / ci0).real + assert (5 / ci0).real == ( + ComplexInterval(Interval(5, 5), Interval(0, 0)) / ci0 + ).real assert (ci0 / 5).real == ci0.real / 5 assert ci0 != int0 assert ci0 + ci1 == ci0 + ci1 - assert not ci0 + ci1 != ci0 + ci1 # pylint: disable = unneeded-not + assert not ci0 + ci1 != ci0 + ci1 # pylint: disable = unneeded-not assert -ci0 == (-1) * ci0 diff --git a/tests/individual/test_expression.py b/tests/individual/test_expression.py index f0a1adf..0294779 100644 --- a/tests/individual/test_expression.py +++ b/tests/individual/test_expression.py @@ -4,11 +4,12 @@ from mlscorecheck.individual import Expression + def test_expression(): """ Testing the expression abstraction """ - exp = Expression('a*b', ['a', 'b']) - assert exp.evaluate({'a': 2, 'b': 3}) == 6 + exp = Expression("a*b", ["a", "b"]) + assert exp.evaluate({"a": 2, "b": 3}) == 6 assert len(exp.to_dict()) == 3 diff --git a/tests/individual/test_interval.py b/tests/individual/test_interval.py index cdaa838..68de0f3 100644 --- a/tests/individual/test_interval.py +++ b/tests/individual/test_interval.py @@ -6,6 +6,7 @@ from mlscorecheck.individual import Interval, IntervalUnion + def test_interval_constructor(): """ Testing the interval constructor @@ -16,6 +17,7 @@ def test_interval_constructor(): assert Interval(2, 1) == Interval(1, 0) + def test_interval_equality(): """ Testing the interval equality @@ -26,11 +28,13 @@ def test_interval_equality(): assert interval == Interval(-2, 5) assert interval != Interval(-2, 6) + def test_interval_repr(): """ Testing the representation """ - assert str(Interval(0, 1)) == '(0, 1)' + assert str(Interval(0, 1)) == "(0, 1)" + def test_to_tuple(): """ @@ -38,6 +42,7 @@ def test_to_tuple(): """ assert Interval(0, 1).to_tuple() == (0, 1) + def test_interval_addition(): """ Testing the interval addition @@ -59,6 +64,7 @@ def test_interval_addition(): assert add.lower_bound == int0.lower_bound + 2 + def test_interval_subtraction(): """ Testing the interval subtraction @@ -79,6 +85,7 @@ def test_interval_subtraction(): assert sub.lower_bound == 2 - int0.upper_bound + def test_interval_multiplication(): """ Testing the interval multiplication @@ -88,10 +95,12 @@ def test_interval_multiplication(): mult = int0 * int1 - terms = [int0.lower_bound * int1.lower_bound, - int0.lower_bound * int1.upper_bound, - int0.upper_bound * int1.lower_bound, - int0.upper_bound * int1.upper_bound] + terms = [ + int0.lower_bound * int1.lower_bound, + int0.lower_bound * int1.upper_bound, + int0.upper_bound * int1.lower_bound, + int0.upper_bound * int1.upper_bound, + ] assert mult.lower_bound == min(terms) assert mult.upper_bound == max(terms) @@ -104,6 +113,7 @@ def test_interval_multiplication(): assert mult.lower_bound == 2 * int0.lower_bound + def test_interval_division_scalar(): """ Testing the interval division with scalar @@ -114,8 +124,8 @@ def test_interval_division_scalar(): assert isinstance(div, IntervalUnion) assert div.intervals[0].lower_bound == -np.inf - assert div.intervals[0].upper_bound == 1.0/int0.lower_bound - assert div.intervals[1].lower_bound == 1.0/int0.upper_bound + assert div.intervals[0].upper_bound == 1.0 / int0.lower_bound + assert div.intervals[1].lower_bound == 1.0 / int0.upper_bound assert div.intervals[1].upper_bound == np.inf div = 1.0 / Interval(1, 2) @@ -138,6 +148,7 @@ def test_interval_division_scalar(): assert int0.lower_bound == -div.upper_bound and int0.upper_bound == -div.lower_bound + def test_interval_division_composite(): """ Testing the interval division with intervals @@ -149,10 +160,12 @@ def test_interval_division_composite(): div1 = int0 / int1 - terms = [int0.lower_bound * inverse.lower_bound, - int0.lower_bound * inverse.upper_bound, - int0.upper_bound * inverse.lower_bound, - int0.upper_bound * inverse.upper_bound] + terms = [ + int0.lower_bound * inverse.lower_bound, + int0.lower_bound * inverse.upper_bound, + int0.upper_bound * inverse.lower_bound, + int0.upper_bound * inverse.upper_bound, + ] assert div1.lower_bound == min(terms) assert div1.upper_bound == max(terms) @@ -162,10 +175,12 @@ def test_interval_division_composite(): div1 = int0 / int1 - terms = [int0.lower_bound * inverse.lower_bound, - int0.lower_bound * inverse.upper_bound, - int0.upper_bound * inverse.lower_bound, - int0.upper_bound * inverse.upper_bound] + terms = [ + int0.lower_bound * inverse.lower_bound, + int0.lower_bound * inverse.upper_bound, + int0.upper_bound * inverse.lower_bound, + int0.upper_bound * inverse.upper_bound, + ] assert div1.lower_bound == min(terms) assert div1.upper_bound == max(terms) @@ -175,10 +190,12 @@ def test_interval_division_composite(): div1 = int0 / int1 - terms = [int0.lower_bound * inverse.lower_bound, - int0.lower_bound * inverse.upper_bound, - int0.upper_bound * inverse.lower_bound, - int0.upper_bound * inverse.upper_bound] + terms = [ + int0.lower_bound * inverse.lower_bound, + int0.lower_bound * inverse.upper_bound, + int0.upper_bound * inverse.lower_bound, + int0.upper_bound * inverse.upper_bound, + ] assert div1.lower_bound == min(terms) assert div1.upper_bound == max(terms) @@ -189,22 +206,27 @@ def test_interval_division_composite(): div1 = int0 / int1 - terms = [int0.lower_bound * inverse.intervals[0].lower_bound, - int0.lower_bound * inverse.intervals[0].upper_bound, - int0.upper_bound * inverse.intervals[0].lower_bound, - int0.upper_bound * inverse.intervals[0].upper_bound] + terms = [ + int0.lower_bound * inverse.intervals[0].lower_bound, + int0.lower_bound * inverse.intervals[0].upper_bound, + int0.upper_bound * inverse.intervals[0].lower_bound, + int0.upper_bound * inverse.intervals[0].upper_bound, + ] assert div1.intervals[0].lower_bound == min(terms) assert div1.intervals[0].upper_bound == max(terms) - terms = [int0.lower_bound * inverse.intervals[1].lower_bound, - int0.lower_bound * inverse.intervals[1].upper_bound, - int0.upper_bound * inverse.intervals[1].lower_bound, - int0.upper_bound * inverse.intervals[1].upper_bound] + terms = [ + int0.lower_bound * inverse.intervals[1].lower_bound, + int0.lower_bound * inverse.intervals[1].upper_bound, + int0.upper_bound * inverse.intervals[1].lower_bound, + int0.upper_bound * inverse.intervals[1].upper_bound, + ] assert div1.intervals[1].lower_bound == min(terms) assert div1.intervals[1].upper_bound == max(terms) + def test_interval_union_constructor(): """ Testing the interval union constructor @@ -214,16 +236,18 @@ def test_interval_union_constructor(): assert IntervalUnion((0, 1)) == IntervalUnion([Interval(0, 1)]) assert IntervalUnion([(0, 1)]) == IntervalUnion([Interval(0, 1)]) + def test_interval_union_pow(): """ Testing the power operation on interval unions """ intu = IntervalUnion([(-1, 2)]) - intu = intu ** 2 + intu = intu**2 assert intu == IntervalUnion([(0, 4)]) + def test_interval_union_to_tuple(): """ Testing the tuple conversion of interval union @@ -233,97 +257,108 @@ def test_interval_union_to_tuple(): assert intu.to_tuple() == [(0, 1), (3, 4)] + def test_interval_union_simplify(): """ Testing the interval union simplification """ # simple - intun = IntervalUnion([Interval(1, 2), - Interval(3, 5), - Interval(4, 6), - Interval(5, 8), - Interval(10, 11)]) + intun = IntervalUnion( + [ + Interval(1, 2), + Interval(3, 5), + Interval(4, 6), + Interval(5, 8), + Interval(10, 11), + ] + ) assert len(intun.intervals) == 3 assert intun.intervals[1].lower_bound == 3 assert intun.intervals[1].upper_bound == 8 # shuffled - intun = IntervalUnion([Interval(1, 2), - Interval(3, 5), - Interval(10, 11), - Interval(5, 8), - Interval(4, 6)]) + intun = IntervalUnion( + [ + Interval(1, 2), + Interval(3, 5), + Interval(10, 11), + Interval(5, 8), + Interval(4, 6), + ] + ) assert len(intun.intervals) == 3 assert intun.intervals[1].lower_bound == 3 assert intun.intervals[1].upper_bound == 8 # subsets - intun = IntervalUnion([Interval(1.5, 1.6), - Interval(1, 2), - Interval(3, 5), - Interval(4, 6), - Interval(5, 8), - Interval(10, 11), - Interval(4, 4)]) + intun = IntervalUnion( + [ + Interval(1.5, 1.6), + Interval(1, 2), + Interval(3, 5), + Interval(4, 6), + Interval(5, 8), + Interval(10, 11), + Interval(4, 4), + ] + ) assert len(intun.intervals) == 3 assert intun.intervals[1].lower_bound == 3 assert intun.intervals[1].upper_bound == 8 # first union - intun = IntervalUnion([Interval(3, 5), - Interval(4, 6), - Interval(5, 8), - Interval(10, 11)]) + intun = IntervalUnion( + [Interval(3, 5), Interval(4, 6), Interval(5, 8), Interval(10, 11)] + ) assert len(intun.intervals) == 2 assert intun.intervals[0].lower_bound == 3 assert intun.intervals[0].upper_bound == 8 # last union - intun = IntervalUnion([Interval(1, 2), - Interval(3, 5), - Interval(4, 6), - Interval(5, 8)]) + intun = IntervalUnion( + [Interval(1, 2), Interval(3, 5), Interval(4, 6), Interval(5, 8)] + ) assert len(intun.intervals) == 2 assert intun.intervals[1].lower_bound == 3 assert intun.intervals[1].upper_bound == 8 # duplicate - intun = IntervalUnion([Interval(1, 2), - Interval(3, 5), - Interval(1, 2), - Interval(5, 8), - Interval(10, 11)]) + intun = IntervalUnion( + [ + Interval(1, 2), + Interval(3, 5), + Interval(1, 2), + Interval(5, 8), + Interval(10, 11), + ] + ) assert len(intun.intervals) == 3 assert intun.intervals[1].lower_bound == 3 assert intun.intervals[1].upper_bound == 8 # all one - intun = IntervalUnion([Interval(4, 4), - Interval(3, 5), - Interval(4, 6), - Interval(5, 8), - Interval(4, 7)]) + intun = IntervalUnion( + [Interval(4, 4), Interval(3, 5), Interval(4, 6), Interval(5, 8), Interval(4, 7)] + ) assert len(intun.intervals) == 1 assert intun.intervals[0].lower_bound == 3 assert intun.intervals[0].upper_bound == 8 + def test_interval_union_add(): """ Testing addition with interval unions """ - intun0 = IntervalUnion([Interval(1, 2), - Interval(10, 20), - Interval(100, 200)]) - intun1 = IntervalUnion([Interval(-1, 1), - Interval(2, 8)]) + intun0 = IntervalUnion([Interval(1, 2), Interval(10, 20), Interval(100, 200)]) + intun1 = IntervalUnion([Interval(-1, 1), Interval(2, 8)]) add = intun0 + intun1 @@ -347,15 +382,13 @@ def test_interval_union_add(): assert len(add.intervals) == len(intun0.intervals) assert add.intervals[0] == intun0.intervals[0] + 2 + def test_interval_union_subtract(): """ Testing subtraction with interval unions """ - intun0 = IntervalUnion([Interval(1, 2), - Interval(10, 20), - Interval(100, 200)]) - intun1 = IntervalUnion([Interval(-1, 1), - Interval(2, 8)]) + intun0 = IntervalUnion([Interval(1, 2), Interval(10, 20), Interval(100, 200)]) + intun1 = IntervalUnion([Interval(-1, 1), Interval(2, 8)]) sub = intun0 - intun1 @@ -379,15 +412,13 @@ def test_interval_union_subtract(): assert len(sub.intervals) == len(intun0.intervals) assert sub.intervals[2] == (2 - intun0.intervals[0]) + def test_interval_union_multiply(): """ Testing addition with interval unions """ - intun0 = IntervalUnion([Interval(1, 2), - Interval(10, 20), - Interval(100, 200)]) - intun1 = IntervalUnion([Interval(-1, 1), - Interval(2, 8)]) + intun0 = IntervalUnion([Interval(1, 2), Interval(10, 20), Interval(100, 200)]) + intun1 = IntervalUnion([Interval(-1, 1), Interval(2, 8)]) mult = intun0 * intun1 @@ -411,17 +442,15 @@ def test_interval_union_multiply(): assert len(mult.intervals) == len(intun0.intervals) assert mult.intervals[0] == intun0.intervals[0] * 2 + def test_interval_union_divide(): """ Testing addition with interval unions """ - intun0 = IntervalUnion([Interval(1, 2), - Interval(10, 20), - Interval(100, 200)]) - intun1 = IntervalUnion([Interval(-1, 1), - Interval(2, 8), - Interval(0, 1.5), - Interval(-2.2, 0)]) + intun0 = IntervalUnion([Interval(1, 2), Interval(10, 20), Interval(100, 200)]) + intun1 = IntervalUnion( + [Interval(-1, 1), Interval(2, 8), Interval(0, 1.5), Interval(-2.2, 0)] + ) div = intun0 / intun1 @@ -449,6 +478,7 @@ def test_interval_union_divide(): assert len(div.intervals) == len(intun0.intervals) assert div.intervals[0] == 2 / intun0.intervals[2] + def test_interval_union_equality(): """ Testing the interval union equality @@ -461,11 +491,13 @@ def test_interval_union_equality(): assert intun != IntervalUnion([Interval(-2, 6)]) assert intun != IntervalUnion([Interval(0, 1), Interval(2, 3)]) + def test_interval_union_repr(): """ Testing the representation """ - assert str(IntervalUnion([Interval(0, 1), Interval(2, 3)])) == '(0, 1) | (2, 3)' + assert str(IntervalUnion([Interval(0, 1), Interval(2, 3)])) == "(0, 1) | (2, 3)" + def test_cross_interval_intervalunion(): """ @@ -480,7 +512,7 @@ def test_cross_interval_intervalunion(): assert res0 == res1 res0 = int0 - intun - res1 = (-1)*(intun - int0) + res1 = (-1) * (intun - int0) assert res0 == res1 @@ -494,6 +526,7 @@ def test_cross_interval_intervalunion(): assert (1.0 / res0) == res1 + def test_intersection(): """ Testing the interval intersection @@ -505,6 +538,7 @@ def test_intersection(): assert Interval(0, 10).intersection(Interval(3, 4)) == Interval(3, 4) assert Interval(3, 4).intersection(Interval(0, 10)) == Interval(3, 4) + def test_integer(): """ Testing the integer condition @@ -521,6 +555,7 @@ def test_integer(): assert not Interval(0.5, 0.6).integer() assert not Interval(-0.6, -0.5).integer() + def test_contains(): """ Testing the contain function @@ -535,32 +570,39 @@ def test_contains(): assert Interval(-np.inf, 5).contains(-np.inf) assert Interval(5, np.inf).contains(10) + def test_union_intersection(): """ Testing the intersections of unions """ - assert IntervalUnion([Interval(0, 1), Interval(1, 2)])\ - .intersection(IntervalUnion([Interval(1, 2), Interval(2, 3)])) == \ - IntervalUnion([Interval(1, 2)]) + assert IntervalUnion([Interval(0, 1), Interval(1, 2)]).intersection( + IntervalUnion([Interval(1, 2), Interval(2, 3)]) + ) == IntervalUnion([Interval(1, 2)]) + + assert IntervalUnion([Interval(0, 1), Interval(2, 3)]).intersection( + IntervalUnion([Interval(1, 2), Interval(2, 3)]) + ) == IntervalUnion([Interval(1, 1), Interval(2, 2), Interval(2, 3)]) - assert IntervalUnion([Interval(0, 1), Interval(2, 3)])\ - .intersection(IntervalUnion([Interval(1, 2), Interval(2, 3)])) == \ - IntervalUnion([Interval(1, 1), Interval(2, 2), Interval(2, 3)]) + assert IntervalUnion([Interval(0, 1), Interval(2, 3)]).intersection( + IntervalUnion([Interval(1.5, 1.8), Interval(3.2, 4)]) + ) == IntervalUnion([]) - assert IntervalUnion([Interval(0, 1), Interval(2, 3)])\ - .intersection(IntervalUnion([Interval(1.5, 1.8), Interval(3.2, 4)])) == \ - IntervalUnion([]) + assert IntervalUnion([Interval(0, 1), Interval(2, 3)]).intersection( + IntervalUnion([Interval(0.5, 2.5), Interval(2.8, 3.2)]) + ) == IntervalUnion( + [ + Interval(0, 1).intersection(Interval(0.5, 2.5)), + Interval(0, 1).intersection(Interval(2.8, 3.2)), + Interval(2, 3).intersection(Interval(0.5, 2.5)), + Interval(2, 3).intersection(Interval(2.8, 3.2)), + ] + ) - assert IntervalUnion([Interval(0, 1), Interval(2, 3)])\ - .intersection(IntervalUnion([Interval(0.5, 2.5), Interval(2.8, 3.2)])) == \ - IntervalUnion([Interval(0, 1).intersection(Interval(0.5, 2.5)), - Interval(0, 1).intersection(Interval(2.8, 3.2)), - Interval(2, 3).intersection(Interval(0.5, 2.5)), - Interval(2, 3).intersection(Interval(2.8, 3.2))]) + assert IntervalUnion([Interval(0, 1), Interval(1, 2)]).intersection( + Interval(0.5, 1.5) + ) == Interval(0.5, 1.5) - assert IntervalUnion([Interval(0, 1), Interval(1, 2)])\ - .intersection(Interval(0.5, 1.5)) == Interval(0.5, 1.5) def test_union_integer(): """ @@ -579,6 +621,7 @@ def test_union_integer(): assert not IntervalUnion([Interval(0.5, 0.6)]).integer() assert not IntervalUnion([Interval(-0.6, -0.5), Interval(0.5, 0.6)]).integer() + def test_union_contains(): """ Testing the contain function for interval union @@ -598,6 +641,7 @@ def test_union_contains(): assert not IntervalUnion([Interval(0.5, 0.6)]).contains(0) assert not IntervalUnion([Interval(-0.6, -0.5), Interval(0.5, 0.6)]).contains(0) + def test_interval_shrink_to_integer(): """ Testing the shrinking of intervals to integer boundaries @@ -607,13 +651,16 @@ def test_interval_shrink_to_integer(): assert Interval(0.2, 1.2).shrink_to_integers() == Interval(1, 1) assert Interval(0.2, 0.3).shrink_to_integers() == Interval(1, 0) + def test_interval_union_shrink_to_integer(): """ Testing shrinking the interval union to integer boundaries """ - assert IntervalUnion([Interval(0.2, 4.5), Interval(6.3, 6.8)])\ - .shrink_to_integers() == IntervalUnion([Interval(1, 4), Interval(7, 6)]) + assert IntervalUnion( + [Interval(0.2, 4.5), Interval(6.3, 6.8)] + ).shrink_to_integers() == IntervalUnion([Interval(1, 4), Interval(7, 6)]) + def test_is_empty(): """ @@ -625,6 +672,7 @@ def test_is_empty(): assert IntervalUnion([Interval(1, 0)]).is_empty() assert IntervalUnion([]).is_empty() + def test_negation(): """ Testing the negation operators @@ -633,6 +681,7 @@ def test_negation(): assert -Interval(0, 1) == Interval(-1, 0) assert -IntervalUnion([Interval(0, 1)]) == IntervalUnion([Interval(-1, 0)]) + def test_integer_counts(): """ Testing the integer counts @@ -643,14 +692,16 @@ def test_integer_counts(): assert IntervalUnion([Interval(0, 1), Interval(1, 0)]).integer_counts() == 2 assert IntervalUnion([]).integer_counts() == 0 + def test_odd_power(): """ Testing the odd powers """ - assert Interval(0, 2)**3 == Interval(0, 8) - assert Interval(-1, 2)**3 == Interval(-1, 8) - assert Interval(-2, -1)**3 == Interval(-8, -1) + assert Interval(0, 2) ** 3 == Interval(0, 8) + assert Interval(-1, 2) ** 3 == Interval(-1, 8) + assert Interval(-2, -1) ** 3 == Interval(-8, -1) + def test_representing_integer(): """ diff --git a/tests/individual/test_pair_solutions.py b/tests/individual/test_pair_solutions.py index 3f30172..7979749 100644 --- a/tests/individual/test_pair_solutions.py +++ b/tests/individual/test_pair_solutions.py @@ -5,23 +5,28 @@ import pytest from mlscorecheck.core import safe_call -from mlscorecheck.individual import (load_solutions, - Solution, - Interval, - IntervalUnion, - sqrt) - -from mlscorecheck.scores import (score_functions_without_complements, - score_functions_standardized_without_complements, - score_specifications) - -from mlscorecheck.individual import (generate_1_problem) +from mlscorecheck.individual import ( + load_solutions, + Solution, + Interval, + IntervalUnion, + sqrt, +) + +from mlscorecheck.scores import ( + score_functions_without_complements, + score_functions_standardized_without_complements, + score_specifications, +) + +from mlscorecheck.individual import generate_1_problem solutions = load_solutions() scores = score_specifications functions = score_functions_without_complements functions_standardized = score_functions_standardized_without_complements + def check_tptn(tp, tn, result, eps=1e-5): """ Checks the tp and tn values against the results @@ -40,16 +45,17 @@ def check_tptn(tp, tn, result, eps=1e-5): zero_division = False for res in result: - if res.get('message') == 'zero division': + if res.get("message") == "zero division": zero_division = True continue - if res.get('message') is not None: + if res.get("message") is not None: continue - flags.append(abs(tp - res['tp']) < eps and abs(tn - res['tn']) < eps) + flags.append(abs(tp - res["tp"]) < eps and abs(tn - res["tn"]) < eps) return len(flags) == 0 or zero_division, not any(flags) + def adjust_evaluation(evaluation): """ Making the evaluation inconsistent @@ -57,14 +63,27 @@ def adjust_evaluation(evaluation): Args: evaluation (dict): the evaluation to be rendered inconsistent """ - if evaluation['tn'] != 0: - evaluation['tn'] = evaluation['tn'] * 10 + 5 - elif evaluation['tp'] != 0: - evaluation['tp'] = evaluation['tp'] * 10 + 5 + if evaluation["tn"] != 0: + evaluation["tn"] = evaluation["tn"] * 10 + 5 + elif evaluation["tp"] != 0: + evaluation["tp"] = evaluation["tp"] * 10 + 5 + @pytest.mark.parametrize("sol", list(solutions.keys())) -@pytest.mark.parametrize("zeros", [[], ['tp'], ['tn'], ['fp'], ['fn'], ['tp', 'fp'], - ['tn', 'fn'], ['tn', 'tp'], ['fn', 'fp']]) +@pytest.mark.parametrize( + "zeros", + [ + [], + ["tp"], + ["tn"], + ["fp"], + ["fn"], + ["tp", "fp"], + ["tn", "fn"], + ["tn", "tp"], + ["fn", "fp"], + ], +) @pytest.mark.parametrize("random_state", [3, 5, 7]) def test_solution(sol: tuple, zeros: list, random_state: int): """ @@ -76,29 +95,29 @@ def test_solution(sol: tuple, zeros: list, random_state: int): random_state (int): the seed of the random state """ - evaluation, _ = generate_1_problem(zeros=zeros, - add_complements=True, - random_state=random_state) - evaluation['beta_positive'] = 2 - evaluation['beta_negative'] = 2 - evaluation['sqrt'] = sqrt + evaluation, _ = generate_1_problem( + zeros=zeros, add_complements=True, random_state=random_state + ) + evaluation["beta_positive"] = 2 + evaluation["beta_negative"] = 2 + evaluation["sqrt"] = sqrt - score0 = safe_call(functions[sol[0]], evaluation, scores[sol[0]].get('nans')) - score1 = safe_call(functions[sol[1]], evaluation, scores[sol[1]].get('nans')) + score0 = safe_call(functions[sol[0]], evaluation, scores[sol[0]].get("nans")) + score1 = safe_call(functions[sol[1]], evaluation, scores[sol[1]].get("nans")) if score0 is None or score1 is None: return - result = solutions[sol].evaluate({**evaluation, - **{sol[0]: score0, - sol[1]: score1}}) + result = solutions[sol].evaluate({**evaluation, **{sol[0]: score0, sol[1]: score1}}) - solvable, failed = check_tptn(evaluation['tp'], evaluation['tn'], result) + solvable, failed = check_tptn(evaluation["tp"], evaluation["tn"], result) assert solvable or not failed + @pytest.mark.parametrize("sol", list(solutions.keys())) -@pytest.mark.parametrize("zeros", [[], ['tp'], ['tn'], ['fp'], ['fn'], ['tp', 'fp'], - ['tn', 'fn']]) +@pytest.mark.parametrize( + "zeros", [[], ["tp"], ["tn"], ["fp"], ["fn"], ["tp", "fp"], ["tn", "fn"]] +) @pytest.mark.parametrize("random_state", [3, 5, 7]) def test_solution_failure(sol: tuple, zeros: list, random_state: int): """ @@ -110,40 +129,42 @@ def test_solution_failure(sol: tuple, zeros: list, random_state: int): random_state (int): the seed of the random state """ - evaluation, _ = generate_1_problem(zeros=zeros, - add_complements=True, - random_state=random_state) - evaluation['beta_positive'] = 2 - evaluation['beta_negative'] = 2 - evaluation['sqrt'] = sqrt + evaluation, _ = generate_1_problem( + zeros=zeros, add_complements=True, random_state=random_state + ) + evaluation["beta_positive"] = 2 + evaluation["beta_negative"] = 2 + evaluation["sqrt"] = sqrt - score0 = safe_call(functions[sol[0]], evaluation, scores[sol[0]].get('nans')) - score1 = safe_call(functions[sol[1]], evaluation, scores[sol[1]].get('nans')) + score0 = safe_call(functions[sol[0]], evaluation, scores[sol[0]].get("nans")) + score1 = safe_call(functions[sol[1]], evaluation, scores[sol[1]].get("nans")) if score0 is None or score1 is None: return adjust_evaluation(evaluation) - result = solutions[sol].evaluate({**evaluation, - **{sol[0]: score0, - sol[1]: score1}}) + result = solutions[sol].evaluate({**evaluation, **{sol[0]: score0, sol[1]: score1}}) - solvable, failed = check_tptn(evaluation['tp'], evaluation['tn'], result) + solvable, failed = check_tptn(evaluation["tp"], evaluation["tn"], result) assert solvable or failed + def test_solution_object(): """ Testing the solution abstraction """ - sol = Solution(solution={'tp': {'expression': 'p*sens', 'symbols': ['p', 'sens']}}, - conditions=[{'expression': 'p', 'symbols': ['p'], - 'mode': 'non-negative', 'depth': 1}]) + sol = Solution( + solution={"tp": {"expression": "p*sens", "symbols": ["p", "sens"]}}, + conditions=[ + {"expression": "p", "symbols": ["p"], "mode": "non-negative", "depth": 1} + ], + ) assert len(sol.to_dict()) == 2 - res = sol.evaluate({'p': 3, 'sens': 1}) + res = sol.evaluate({"p": 3, "sens": 1}) assert len(res) > 0 @@ -151,26 +172,31 @@ def test_solution_object(): assert not sol.check_non_zero(1) + def test_solution_non_negatives(): """ Testing the non-negative base detection in the solution """ - sol = Solution({'tp': {'expression': 'p', 'symbols': ['p']}}, - conditions=[{'expression': 'p', 'symbols': ['p'], - 'mode': 'non-negative', 'depth': 1}]) + sol = Solution( + {"tp": {"expression": "p", "symbols": ["p"]}}, + conditions=[ + {"expression": "p", "symbols": ["p"], "mode": "non-negative", "depth": 1} + ], + ) + + res = sol.evaluate({"p": Interval(-2, -1)}) - res = sol.evaluate({'p': Interval(-2, -1)}) + assert res["message"] == "negative base" - assert res['message'] == 'negative base' + res = sol.evaluate({"p": IntervalUnion([Interval(-2, -1)])}) - res = sol.evaluate({'p': IntervalUnion([Interval(-2, -1)])}) + assert res["message"] == "negative base" - assert res['message'] == 'negative base' + res = sol.evaluate({"p": -1}) - res = sol.evaluate({'p': -1}) + assert res["message"] == "negative base" - assert res['message'] == 'negative base' def test_solutions_to_dict(): """ diff --git a/tests/individual/test_problem_generator.py b/tests/individual/test_problem_generator.py index 6a0aba1..2148175 100644 --- a/tests/individual/test_problem_generator.py +++ b/tests/individual/test_problem_generator.py @@ -6,42 +6,50 @@ import numpy as np -from mlscorecheck.individual import (generate_problems, - generate_problem_and_scores, - generate_multiclass_dataset, - sample_multiclass_dataset) +from mlscorecheck.individual import ( + generate_problems, + generate_problem_and_scores, + generate_multiclass_dataset, + sample_multiclass_dataset, +) from mlscorecheck.core import round_scores from mlscorecheck.scores import calculate_scores + def test_generate_problem_and_scores(): """ Testing the joint problem and score sampling """ - _, scores = generate_problem_and_scores(random_state=5, - rounding_decimals=3) + _, scores = generate_problem_and_scores(random_state=5, rounding_decimals=3) assert len(scores) > 0 - _, scores = generate_problem_and_scores(random_state=5, - rounding_decimals=3, - score_subset=['acc']) + _, scores = generate_problem_and_scores( + random_state=5, rounding_decimals=3, score_subset=["acc"] + ) assert len(scores) == 1 + def test_round_scores(): """ Testing the rounding of scores """ - assert round_scores({'dummy': 0.12345}) == {'dummy': 0.12345} - assert round_scores({'dummy': 0.12345}, rounding_decimals=2)['dummy'] == np.round(0.12345, 2) + assert round_scores({"dummy": 0.12345}) == {"dummy": 0.12345} + assert round_scores({"dummy": 0.12345}, rounding_decimals=2)["dummy"] == np.round( + 0.12345, 2 + ) + def test_calculate_all_scores(): """ Testing the calculation of all scores """ - scores = calculate_scores({'p': 10, 'tp': 5, 'n': 20, 'tn': 15, - 'beta_positive': 2, 'beta_negative': 2}) - assert scores['acc'] == 20/30 + scores = calculate_scores( + {"p": 10, "tp": 5, "n": 20, "tn": 15, "beta_positive": 2, "beta_negative": 2} + ) + assert scores["acc"] == 20 / 30 + def test_generate_problems(): """ @@ -54,32 +62,33 @@ def test_generate_problems(): assert len(evaluation) == 5 evaluation, _ = generate_problems(add_complements=True) - assert 'fn' in evaluation + assert "fn" in evaluation + + evaluation, _ = generate_problems(zeros=["tp"]) + assert evaluation["tp"] == 0 - evaluation, _ = generate_problems(zeros=['tp']) - assert evaluation['tp'] == 0 + evaluation, _ = generate_problems(zeros=["tn"]) + assert evaluation["tn"] == 0 - evaluation, _ = generate_problems(zeros=['tn']) - assert evaluation['tn'] == 0 + evaluation, _ = generate_problems(zeros=["fp"]) + assert evaluation["tn"] == evaluation["n"] - evaluation, _ = generate_problems(zeros=['fp']) - assert evaluation['tn'] == evaluation['n'] + evaluation, _ = generate_problems(zeros=["fn"]) + assert evaluation["tp"] == evaluation["p"] - evaluation, _ = generate_problems(zeros=['fn']) - assert evaluation['tp'] == evaluation['p'] def test_generate_multiclass_dataset(): """ Testing the generation of a multiclass dataset """ - dataset = generate_multiclass_dataset(random_state=5, - max_n_classes=5) + dataset = generate_multiclass_dataset(random_state=5, max_n_classes=5) assert len(dataset) <= 5 assert all(item > 0 for item in dataset.values()) -@pytest.mark.parametrize('random_seed', list(range(10))) + +@pytest.mark.parametrize("random_seed", list(range(10))) def test_sample_multiclass_dataset(random_seed): """ Testing the sampling of a multiclass dataset @@ -90,8 +99,7 @@ def test_sample_multiclass_dataset(random_seed): dataset = generate_multiclass_dataset(random_state=random_seed) - sample = sample_multiclass_dataset(dataset=dataset, - random_state=random_seed) + sample = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) assert len(dataset) == len(sample) sums = np.sum(sample, axis=1) diff --git a/tests/individual/test_tptn_solutions.py b/tests/individual/test_tptn_solutions.py index 5e9aa6c..a2aaf77 100644 --- a/tests/individual/test_tptn_solutions.py +++ b/tests/individual/test_tptn_solutions.py @@ -7,19 +7,32 @@ import numpy as np from mlscorecheck.core import safe_call -from mlscorecheck.individual import (tptn_solutions, is_applicable_tptn, - generate_1_problem) +from mlscorecheck.individual import ( + tptn_solutions, + is_applicable_tptn, + generate_1_problem, +) from mlscorecheck.scores import calculate_scores -@pytest.mark.parametrize('figure', ['tp', 'tn']) + +@pytest.mark.parametrize("figure", ["tp", "tn"]) @pytest.mark.parametrize("score", list(tptn_solutions.keys())) -@pytest.mark.parametrize("zeros", [[], ['tp'], ['tn'], ['fp'], ['fn'], ['tp', 'fp'], - ['tn', 'fn'], ['tn', 'tp'], ['fn', 'fp']]) +@pytest.mark.parametrize( + "zeros", + [ + [], + ["tp"], + ["tn"], + ["fp"], + ["fn"], + ["tp", "fp"], + ["tn", "fn"], + ["tn", "tp"], + ["fn", "fp"], + ], +) @pytest.mark.parametrize("random_state", [3, 5, 7, 11]) -def test_tptn_solutions(figure: str, - score: str, - zeros: list, - random_state: int): +def test_tptn_solutions(figure: str, score: str, zeros: list, random_state: int): """ Testing the tp-tn solutions @@ -29,15 +42,17 @@ def test_tptn_solutions(figure: str, zeros (list(str)): the list of figures to set to zero random_state (int): the seed of the random state """ - evaluation, _ = generate_1_problem(zeros=zeros, - add_complements=True, - random_state=random_state) - evaluation['beta_positive'] = 2 - evaluation['beta_negative'] = 2 + evaluation, _ = generate_1_problem( + zeros=zeros, add_complements=True, random_state=random_state + ) + evaluation["beta_positive"] = 2 + evaluation["beta_negative"] = 2 scores = calculate_scores(evaluation) - if not (scores[score] is not None and is_applicable_tptn(score, scores[score], figure)): + if not ( + scores[score] is not None and is_applicable_tptn(score, scores[score], figure) + ): return sol = tptn_solutions[score][figure] @@ -46,21 +61,26 @@ def test_tptn_solutions(figure: str, val = safe_call(sol, scores | evaluation) - if val is None or (isinstance(val, list) - and (len(val) == 0 or all(value is None for value in val))): + if val is None or ( + isinstance(val, list) and (len(val) == 0 or all(value is None for value in val)) + ): return val = np.array(val) assert np.any(np.abs(evaluation[figure] - val) < 1e-8) -special_values = {'ppv': [1, 0], - 'npv': [1, 0], - 'fbp': [5, 0], - 'f1p': [2, 0], - 'fbn': [0, 5], - 'f1n': [2, 0]} -@pytest.mark.parametrize('figure', ['tp', 'tn']) +special_values = { + "ppv": [1, 0], + "npv": [1, 0], + "fbp": [5, 0], + "f1p": [2, 0], + "fbn": [0, 5], + "f1n": [2, 0], +} + + +@pytest.mark.parametrize("figure", ["tp", "tn"]) @pytest.mark.parametrize("score", list(tptn_solutions.keys())) @pytest.mark.parametrize("random_state", [3, 5, 7]) def test_tptn_solutions_failure(figure: str, score: str, random_state: int): @@ -72,11 +92,11 @@ def test_tptn_solutions_failure(figure: str, score: str, random_state: int): score (str): the name of the score to test the solution for random_state (int): the seed of the random state """ - evaluation, _ = generate_1_problem(zeros=[], - add_complements=True, - random_state=random_state) - evaluation['beta_positive'] = 2 - evaluation['beta_negative'] = 2 + evaluation, _ = generate_1_problem( + zeros=[], add_complements=True, random_state=random_state + ) + evaluation["beta_positive"] = 2 + evaluation["beta_negative"] = 2 scores = calculate_scores(evaluation) @@ -90,8 +110,10 @@ def test_tptn_solutions_failure(figure: str, score: str, random_state: int): val = safe_call(sol, scores | evaluation) - if val is None or (isinstance(val, list) - and (len(val) == 0 or all(value is None for value in val))): + if val is None or ( + isinstance(val, list) + and (len(val) == 0 or all(value is None for value in val)) + ): assert True return @@ -99,14 +121,15 @@ def test_tptn_solutions_failure(figure: str, score: str, random_state: int): assert np.all(np.abs(evaluation[figure] - val) > 1e-8) scores[score] = 0 - evaluation['n'] = 0 - evaluation['p'] = 0 - evaluation['tn'] = 0 - evaluation['tp'] = 0 + evaluation["n"] = 0 + evaluation["p"] = 0 + evaluation["tn"] = 0 + evaluation["tp"] = 0 val = safe_call(sol, scores | evaluation) - if val is None or (isinstance(val, list) - and (len(val) == 0 or all(value is None for value in val))): + if val is None or ( + isinstance(val, list) and (len(val) == 0 or all(value is None for value in val)) + ): assert True return diff --git a/tests/individual/test_utils.py b/tests/individual/test_utils.py index 23d48ab..e0c05d1 100644 --- a/tests/individual/test_utils.py +++ b/tests/individual/test_utils.py @@ -3,16 +3,17 @@ """ from mlscorecheck.core import NUMERICAL_TOLERANCE -from mlscorecheck.individual import (create_intervals, - create_problems_2, - load_solutions, - Interval, - resolve_aliases_and_complements, - is_less_than_zero, - unify_results, - IntervalUnion) -from mlscorecheck.scores import (score_functions_with_solutions, - score_specifications) +from mlscorecheck.individual import ( + create_intervals, + create_problems_2, + load_solutions, + Interval, + resolve_aliases_and_complements, + is_less_than_zero, + unify_results, + IntervalUnion, +) +from mlscorecheck.scores import score_functions_with_solutions, score_specifications scores = score_specifications functions = score_functions_with_solutions @@ -20,42 +21,49 @@ random_seeds = [5] + def test_resolve_aliases_and_complements(): """ Resolve the score aliases and complemnets """ - assert resolve_aliases_and_complements({'err': 0.4, 'f1': 0.8, 'sens': 0.3})\ - == {'acc': 0.6, 'f1p': 0.8, 'sens': 0.3} + assert resolve_aliases_and_complements({"err": 0.4, "f1": 0.8, "sens": 0.3}) == { + "acc": 0.6, + "f1p": 0.8, + "sens": 0.3, + } + def test_create_intervals(): """ Testing the create intervals function """ - scores_ = resolve_aliases_and_complements({'acc': 0.6, 'tpr': 0.4, 'fnr': 0.6}) + scores_ = resolve_aliases_and_complements({"acc": 0.6, "tpr": 0.4, "fnr": 0.6}) intervals = create_intervals(scores_, eps=1e-4) - assert abs(intervals['acc'].lower_bound - 0.5999) <= 1.1 * NUMERICAL_TOLERANCE - assert abs(intervals['acc'].upper_bound - 0.6001) <= 1.1 * NUMERICAL_TOLERANCE - assert abs(intervals['sens'].lower_bound - 0.3999) <= 1.1 * NUMERICAL_TOLERANCE - assert abs(intervals['sens'].upper_bound - 0.4001) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["acc"].lower_bound - 0.5999) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["acc"].upper_bound - 0.6001) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["sens"].lower_bound - 0.3999) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["sens"].upper_bound - 0.4001) <= 1.1 * NUMERICAL_TOLERANCE - scores_ = resolve_aliases_and_complements({'fnr': 0.6}) + scores_ = resolve_aliases_and_complements({"fnr": 0.6}) intervals = create_intervals(scores_, eps=1e-4) - assert abs(intervals['sens'].lower_bound - 0.3999) <= 1.1 * NUMERICAL_TOLERANCE - assert abs(intervals['sens'].upper_bound - 0.4001) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["sens"].lower_bound - 0.3999) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["sens"].upper_bound - 0.4001) <= 1.1 * NUMERICAL_TOLERANCE + + intervals = create_intervals({"kappa": 0.5}, eps=1e-4) + assert abs(intervals["kappa"].lower_bound - 0.4999) <= 1.1 * NUMERICAL_TOLERANCE + assert abs(intervals["kappa"].upper_bound - 0.5001) <= 1.1 * NUMERICAL_TOLERANCE - intervals = create_intervals({'kappa': 0.5}, eps=1e-4) - assert abs(intervals['kappa'].lower_bound - 0.4999) <= 1.1 * NUMERICAL_TOLERANCE - assert abs(intervals['kappa'].upper_bound - 0.5001) <= 1.1 * NUMERICAL_TOLERANCE def test_create_problems_2(): """ Testing the create problems function """ - problems = create_problems_2(['acc', 'sens', 'spec', 'ppv']) + problems = create_problems_2(["acc", "sens", "spec", "ppv"]) + + assert len(problems) == 6 * 2 - assert len(problems) == 6*2 def test_is_less_than_zero(): """ @@ -65,6 +73,7 @@ def test_is_less_than_zero(): assert is_less_than_zero(Interval(-4, -3)) assert is_less_than_zero(IntervalUnion([Interval(-4, -3)])) + def test_unify_results(): """ Testing the unification of results @@ -74,5 +83,9 @@ def test_unify_results(): assert unify_results([None, None]) is None assert unify_results([2, None]) == [2] assert unify_results([Interval(2, 3)]) == IntervalUnion([Interval(2, 3)]) - assert unify_results([IntervalUnion([Interval(2, 3)])]) == IntervalUnion([Interval(2, 3)]) - assert unify_results([Interval(2, 3), 5]) == IntervalUnion([Interval(2, 3), Interval(5, 5)]) + assert unify_results([IntervalUnion([Interval(2, 3)])]) == IntervalUnion( + [Interval(2, 3)] + ) + assert unify_results([Interval(2, 3), 5]) == IntervalUnion( + [Interval(2, 3), Interval(5, 5)] + ) diff --git a/tests/scores/test_calculate_scores.py b/tests/scores/test_calculate_scores.py index ec79c68..b391676 100644 --- a/tests/scores/test_calculate_scores.py +++ b/tests/scores/test_calculate_scores.py @@ -6,34 +6,40 @@ import numpy as np -from mlscorecheck.scores import (calculate_scores, - calculate_scores_for_lp, - calculate_multiclass_scores) +from mlscorecheck.scores import ( + calculate_scores, + calculate_scores_for_lp, + calculate_multiclass_scores, +) from mlscorecheck.scores import score_functions_with_solutions + def test_calculate_scores(): """ Testing the score calculation """ - scores = calculate_scores({'p': 40, 'n': 20, 'tp': 34, 'tn': 13, - 'beta_positive': 2, 'beta_negative': 2}) + scores = calculate_scores( + {"p": 40, "n": 20, "tp": 34, "tn": 13, "beta_positive": 2, "beta_negative": 2} + ) assert len(scores) == len(score_functions_with_solutions) + def test_calculate_scores_for_lp(): """ Testing the score calculation for linear programming """ - scores = calculate_scores_for_lp({'p': 40, 'n': 20, 'tp': 34, 'tn': 13}) + scores = calculate_scores_for_lp({"p": 40, "n": 20, "tp": 34, "tn": 13}) assert len(scores) == 4 - scores = calculate_scores_for_lp({'p': 0, 'n': 20, 'tp': 0, 'tn': 13}) + scores = calculate_scores_for_lp({"p": 0, "n": 20, "tp": 0, "tn": 13}) assert len(scores) == 2 - scores = calculate_scores_for_lp({'p': 4, 'n': 0, 'tp': 3, 'tn': 0}) + scores = calculate_scores_for_lp({"p": 4, "n": 0, "tp": 3, "tn": 0}) assert len(scores) == 2 -@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) + +@pytest.mark.parametrize("average", ["micro", "macro", "weighted"]) def test_calculate_multiclass_scores(average): """ Testing the calculation of multiclass scores @@ -42,8 +48,9 @@ def test_calculate_multiclass_scores(average): average (str): the mode of averaging """ confm = np.array([[5, 8, 3], [3, 10, 2], [2, 4, 11]]) - scores = calculate_multiclass_scores(confusion_matrix=confm, - additional_symbols={'beta_positive': 2, - 'beta_negative': 2}, - average=average) + scores = calculate_multiclass_scores( + confusion_matrix=confm, + additional_symbols={"beta_positive": 2, "beta_negative": 2}, + average=average, + ) assert len(scores) > 0 diff --git a/tests/scores/test_multiclass_scores.py b/tests/scores/test_multiclass_scores.py index a139196..d79e46f 100644 --- a/tests/scores/test_multiclass_scores.py +++ b/tests/scores/test_multiclass_scores.py @@ -9,15 +9,17 @@ from sklearn.metrics import precision_recall_fscore_support from mlscorecheck.core import safe_call -from mlscorecheck.scores import (multiclass_score_map, - multiclass_score) -from mlscorecheck.individual import (generate_multiclass_dataset, - sample_multiclass_dataset, - create_confusion_matrix) - -@pytest.mark.parametrize('score', list(multiclass_score_map.keys())) -@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) -@pytest.mark.parametrize('random_seed', list(range(5))) +from mlscorecheck.scores import multiclass_score_map, multiclass_score +from mlscorecheck.individual import ( + generate_multiclass_dataset, + sample_multiclass_dataset, + create_confusion_matrix, +) + + +@pytest.mark.parametrize("score", list(multiclass_score_map.keys())) +@pytest.mark.parametrize("average", ["micro", "macro", "weighted"]) +@pytest.mark.parametrize("random_seed", list(range(5))) def test_multiclass_scores(score, average, random_seed): """ Testing a multiclass score @@ -31,10 +33,12 @@ def test_multiclass_scores(score, average, random_seed): dataset = generate_multiclass_dataset(random_state=random_seed) matrix = sample_multiclass_dataset(dataset=dataset, random_state=random_seed) - params = {'confusion_matrix': matrix, - 'beta_positive': 2, - 'beta_negative': 2, - 'average': average} + params = { + "confusion_matrix": matrix, + "beta_positive": 2, + "beta_negative": 2, + "average": average, + } score_matrix = safe_call(multiclass_score_map[score], params) @@ -45,17 +49,20 @@ def test_multiclass_scores(score, average, random_seed): shuffled_matrix = matrix[permutation_mask][:, permutation_mask] - params = {'confusion_matrix': shuffled_matrix, - 'beta_positive': 2, - 'beta_negative': 2, - 'average': average} + params = { + "confusion_matrix": shuffled_matrix, + "beta_positive": 2, + "beta_negative": 2, + "average": average, + } score_shuffled = safe_call(multiclass_score_map[score], params) assert abs(score_matrix - score_shuffled) < 1e-8 -@pytest.mark.parametrize('average', ['micro', 'macro', 'weighted']) -@pytest.mark.parametrize('random_seed', list(range(5))) + +@pytest.mark.parametrize("average", ["micro", "macro", "weighted"]) +@pytest.mark.parametrize("random_seed", list(range(5))) def test_compare_to_sklearn(average, random_seed): """ Comparing sensitivity, positive predictive value and f1 to sklearn @@ -73,18 +80,19 @@ def test_compare_to_sklearn(average, random_seed): ppv, sens, f1p, _ = precision_recall_fscore_support(y_true, y_pred, average=average) - sens_score = multiclass_score_map['sens'](confusion_matrix=sample, average=average) - ppv_score = multiclass_score_map['ppv'](confusion_matrix=sample, average=average) - f1_score = multiclass_score_map['f1p'](confusion_matrix=sample, average=average) + sens_score = multiclass_score_map["sens"](confusion_matrix=sample, average=average) + ppv_score = multiclass_score_map["ppv"](confusion_matrix=sample, average=average) + f1_score = multiclass_score_map["f1p"](confusion_matrix=sample, average=average) assert abs(sens - sens_score) < 1e-8 assert abs(ppv - ppv_score) < 1e-8 assert abs(f1p - f1_score) < 1e-8 + def test_exception(): """ Testing the exception throwing """ with pytest.raises(ValueError): - multiclass_score(None, None, 'dummy') + multiclass_score(None, None, "dummy") diff --git a/tests/scores/test_scores.py b/tests/scores/test_scores.py index efe0ea0..dd2096c 100644 --- a/tests/scores/test_scores.py +++ b/tests/scores/test_scores.py @@ -8,30 +8,38 @@ from mlscorecheck.core import safe_call, safe_eval from mlscorecheck.individual import generate_1_problem -from mlscorecheck.scores import (score_functions_with_complements, - score_functions_standardized_with_complements, - score_specifications, - score_function_aliases) +from mlscorecheck.scores import ( + score_functions_with_complements, + score_functions_standardized_with_complements, + score_specifications, + score_function_aliases, +) functions = score_functions_with_complements functions_standardized = score_functions_standardized_with_complements scores = score_specifications aliases = score_function_aliases -short_formula_scores = {key: score for key, score in scores.items() if 'args_short' in score} -complement_scores = {key: score for key, score in scores.items() if 'complement' in score} +short_formula_scores = { + key: score for key, score in scores.items() if "args_short" in score +} +complement_scores = { + key: score for key, score in scores.items() if "complement" in score +} -evaluation, problem = generate_1_problem(random_state=5, - add_complements=True) -evaluation['beta_positive'] = 2 -evaluation['beta_negative'] = 2 +evaluation, problem = generate_1_problem(random_state=5, add_complements=True) +evaluation["beta_positive"] = 2 +evaluation["beta_negative"] = 2 for key in scores: - evaluation[key] = functions[key](**{arg: evaluation[arg] for arg in scores[key]['args']}) + evaluation[key] = functions[key]( + **{arg: evaluation[arg] for arg in scores[key]["args"]} + ) for key, val in aliases.items(): evaluation[key] = evaluation[val] + @pytest.mark.parametrize("score", list(scores.keys())) def test_score_and_standardized(score: str): """ @@ -46,6 +54,7 @@ def test_score_and_standardized(score: str): assert abs(value - value_standard) < 1e-8 + @pytest.mark.parametrize("score", list(scores.keys())) def test_score_multiplication_invariance(score: str): """ @@ -55,17 +64,18 @@ def test_score_multiplication_invariance(score: str): score (str): the score to test """ evaluation_multiplied = {**evaluation} - evaluation_multiplied['tp'] = evaluation['tp'] * 5 - evaluation_multiplied['tn'] = evaluation['tn'] * 5 - evaluation_multiplied['fp'] = evaluation['fp'] * 5 - evaluation_multiplied['fn'] = evaluation['fn'] * 5 - evaluation_multiplied['p'] = evaluation['p'] * 5 - evaluation_multiplied['n'] = evaluation['n'] * 5 + evaluation_multiplied["tp"] = evaluation["tp"] * 5 + evaluation_multiplied["tn"] = evaluation["tn"] * 5 + evaluation_multiplied["fp"] = evaluation["fp"] * 5 + evaluation_multiplied["fn"] = evaluation["fn"] * 5 + evaluation_multiplied["p"] = evaluation["p"] * 5 + evaluation_multiplied["n"] = evaluation["n"] * 5 value = safe_call(functions[score], evaluation) value_mult = safe_call(functions[score], evaluation_multiplied) assert abs(value - value_mult) < 1e-8 + @pytest.mark.parametrize("score", list(short_formula_scores.keys())) def test_short_formulas(score: str): """ @@ -76,12 +86,13 @@ def test_short_formulas(score: str): """ value = safe_call(functions[score], evaluation) - short_formula = short_formula_scores[score]['formula_short'] + short_formula = short_formula_scores[score]["formula_short"] - value_short = safe_eval(short_formula, evaluation | {'sqrt': math.sqrt}) + value_short = safe_eval(short_formula, evaluation | {"sqrt": math.sqrt}) assert abs(value - value_short) < 1e-8 + @pytest.mark.parametrize("score", list(complement_scores.keys())) def test_short_complements(score: str): """ @@ -93,7 +104,7 @@ def test_short_complements(score: str): value = safe_call(functions[score], evaluation) - comp_score = scores[score]['complement'] + comp_score = scores[score]["complement"] comp_value = safe_call(functions[comp_score], evaluation) assert abs(1 - (value + comp_value)) < 1e-8 diff --git a/tests/symbolic/test_algebra.py b/tests/symbolic/test_algebra.py index ec4b743..c408321 100644 --- a/tests/symbolic/test_algebra.py +++ b/tests/symbolic/test_algebra.py @@ -7,7 +7,8 @@ from mlscorecheck.symbolic import symbolic_toolkits from mlscorecheck.symbolic import SympyAlgebra, SageAlgebra, Symbols -@pytest.mark.skipif('sympy' not in symbolic_toolkits, reason='sympy not installed') + +@pytest.mark.skipif("sympy" not in symbolic_toolkits, reason="sympy not installed") def test_sympy_algebra(): """ This module tests the algebra base class @@ -15,14 +16,14 @@ def test_sympy_algebra(): alg = SympyAlgebra() - assert alg.create_symbol('tp') is not None + assert alg.create_symbol("tp") is not None - assert alg.create_symbol('tp', lower_bound=0, upper_bound=1) is not None + assert alg.create_symbol("tp", lower_bound=0, upper_bound=1) is not None - tp = alg.create_symbol('tp') - p = alg.create_symbol('p') + tp = alg.create_symbol("tp") + p = alg.create_symbol("p") - assert alg.num_denom(tp/p) == (tp, p) + assert alg.num_denom(tp / p) == (tp, p) assert alg.simplify(p) == p @@ -33,27 +34,30 @@ def test_sympy_algebra(): assert alg.args(p + tp) == {p, tp} assert alg.is_trivial(None) - assert alg.is_trivial(alg.simplify(p/p)) + assert alg.is_trivial(alg.simplify(p / p)) assert not alg.is_trivial(p) assert alg.is_root(tp**0.5) assert not alg.is_root(tp) - assert sorted(map(str, list(alg.operands(tp + p**2)))) == sorted(map(str, [tp, p**2])) + assert sorted(map(str, list(alg.operands(tp + p**2)))) == sorted( + map(str, [tp, p**2]) + ) - assert sorted(map(str, alg.free_symbols(tp + p))) == sorted(map(str, ['p', 'tp'])) + assert sorted(map(str, alg.free_symbols(tp + p))) == sorted(map(str, ["p", "tp"])) assert alg.is_power(tp**2) - assert alg.is_division(tp/p) + assert alg.is_division(tp / p) - assert alg.is_division(p/tp) + assert alg.is_division(p / tp) - assert alg.is_division(1/p) + assert alg.is_division(1 / p) assert not alg.is_division(p) -@pytest.mark.skipif('sage' not in symbolic_toolkits, reason='sage not installed') + +@pytest.mark.skipif("sage" not in symbolic_toolkits, reason="sage not installed") def test_sage_algebra(): """ This module tests the algebra base class @@ -61,20 +65,20 @@ def test_sage_algebra(): alg = SageAlgebra() - assert alg.create_symbol('tp') is not None + assert alg.create_symbol("tp") is not None - assert alg.create_symbol('x', nonnegative=True) is not None - assert alg.create_symbol('y', positive=True) is not None - assert alg.create_symbol('z', negative=True) is not None - assert alg.create_symbol('a', nonpositive=True) is not None - assert alg.create_symbol('b', real=True) is not None + assert alg.create_symbol("x", nonnegative=True) is not None + assert alg.create_symbol("y", positive=True) is not None + assert alg.create_symbol("z", negative=True) is not None + assert alg.create_symbol("a", nonpositive=True) is not None + assert alg.create_symbol("b", real=True) is not None - assert alg.create_symbol('tp', lower_bound=0, upper_bound=1) is not None + assert alg.create_symbol("tp", lower_bound=0, upper_bound=1) is not None - tp = alg.create_symbol('tp') - p = alg.create_symbol('p') + tp = alg.create_symbol("tp") + p = alg.create_symbol("p") - assert alg.num_denom(tp/p) == (tp, p) + assert alg.num_denom(tp / p) == (tp, p) assert alg.simplify(p) == p @@ -85,44 +89,48 @@ def test_sage_algebra(): assert alg.args(p + tp) == {p, tp} assert alg.is_trivial(None) - assert alg.is_trivial(alg.simplify(p/p)) + assert alg.is_trivial(alg.simplify(p / p)) assert not alg.is_trivial(p) assert alg.is_root(tp**0.5) assert not alg.is_root(tp) - assert sorted(map(str, list(alg.operands(tp + p**2)))) == sorted(map(str, [tp, p**2])) + assert sorted(map(str, list(alg.operands(tp + p**2)))) == sorted( + map(str, [tp, p**2]) + ) - assert sorted(map(str, alg.free_symbols(tp + p))) == sorted(map(str, ['p', 'tp'])) + assert sorted(map(str, alg.free_symbols(tp + p))) == sorted(map(str, ["p", "tp"])) assert alg.is_power(tp**2) - assert alg.is_division(tp/p) + assert alg.is_division(tp / p) - assert alg.is_division(p/tp) + assert alg.is_division(p / tp) - assert alg.is_division(1/p) + assert alg.is_division(1 / p) assert not alg.is_division(p) -@pytest.mark.skipif('sympy' not in symbolic_toolkits, reason='sympy not installed') + +@pytest.mark.skipif("sympy" not in symbolic_toolkits, reason="sympy not installed") def test_symbols_sympy(): """ Testing the base symbols with sympy """ - symbols = Symbols(algebraic_system='sympy') + symbols = Symbols(algebraic_system="sympy") assert len(symbols.to_dict()) == 7 assert symbols.get_algebra() is not None -@pytest.mark.skipif('sage' not in symbolic_toolkits, reason='sage not installed') + +@pytest.mark.skipif("sage" not in symbolic_toolkits, reason="sage not installed") def test_symbols_sage(): """ Testing the base symbols with sympy """ - symbols = Symbols(algebraic_system='sage') + symbols = Symbols(algebraic_system="sage") assert len(symbols.to_dict()) == 7 assert symbols.get_algebra() is not None diff --git a/tests/symbolic/test_availability.py b/tests/symbolic/test_availability.py index 0d932cc..462cf15 100644 --- a/tests/symbolic/test_availability.py +++ b/tests/symbolic/test_availability.py @@ -4,17 +4,19 @@ from mlscorecheck.symbolic import check_importability, get_symbolic_toolkit + def test_test_importability(): """ Testing the importability function """ - assert check_importability('itertools') == 'itertools' - assert check_importability('asdfasdfasdfasdfasdf') is None + assert check_importability("itertools") == "itertools" + assert check_importability("asdfasdfasdfasdfasdf") is None + def test_get_symbolic_toolkit(): """ Testing the get_symbolic_toolkit function """ - assert get_symbolic_toolkit() in [None, 'sympy', 'sage'] + assert get_symbolic_toolkit() in [None, "sympy", "sage"] diff --git a/tests/symbolic/test_score_objects.py b/tests/symbolic/test_score_objects.py index cefdb70..37539f1 100644 --- a/tests/symbolic/test_score_objects.py +++ b/tests/symbolic/test_score_objects.py @@ -4,45 +4,51 @@ import pytest -from mlscorecheck.symbolic import (get_base_objects, - get_symbolic_toolkit, - get_all_objects, - get_objects_without_complements, - Score) +from mlscorecheck.symbolic import ( + get_base_objects, + get_symbolic_toolkit, + get_all_objects, + get_objects_without_complements, + Score, +) symbolic_toolkit = get_symbolic_toolkit() -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_base_objects(): """ Testing the instantiation of the base objects """ assert len(get_base_objects(symbolic_toolkit)) > 0 -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_all_objects(): """ Testing the instantiation of the base objects """ assert len(get_all_objects(symbolic_toolkit)) > 0 -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_no_complement_objects(): """ Testing the instantiation of the base objects """ assert len(get_objects_without_complements(symbolic_toolkit)) > 0 -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_serialization(): """ Testing the serialization """ base_objects = get_base_objects(symbolic_toolkit) - serialized = base_objects['acc'].to_dict() + serialized = base_objects["acc"].to_dict() - score = Score(symbols=base_objects['acc'].symbols, **serialized) + score = Score(symbols=base_objects["acc"].symbols, **serialized) assert score is not None - assert score.get_algebra() == base_objects['acc'].symbols.algebra + assert score.get_algebra() == base_objects["acc"].symbols.algebra diff --git a/tests/symbolic/test_solver.py b/tests/symbolic/test_solver.py index 9dee33c..a54d6ad 100644 --- a/tests/symbolic/test_solver.py +++ b/tests/symbolic/test_solver.py @@ -6,64 +6,69 @@ from mlscorecheck.symbolic import ProblemSolver, Symbols from mlscorecheck.symbolic import get_symbolic_toolkit, get_all_objects -from mlscorecheck.symbolic import _collect_denominators_and_bases, collect_denominators_and_bases +from mlscorecheck.symbolic import ( + _collect_denominators_and_bases, + collect_denominators_and_bases, +) from mlscorecheck.symbolic import check_recurrent_solution symbolic_toolkit = get_symbolic_toolkit() -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_problem_solver(): """ Testing the problem solver """ base_scores = get_all_objects(symbolic_toolkit) - prob_sol = ProblemSolver(base_scores['sens'], base_scores['spec']) + prob_sol = ProblemSolver(base_scores["sens"], base_scores["spec"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['sens'], base_scores['acc']) + prob_sol = ProblemSolver(base_scores["sens"], base_scores["acc"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['acc'], base_scores['sens']) + prob_sol = ProblemSolver(base_scores["acc"], base_scores["sens"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['acc'], base_scores['spec']) + prob_sol = ProblemSolver(base_scores["acc"], base_scores["spec"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['spec'], base_scores['acc']) + prob_sol = ProblemSolver(base_scores["spec"], base_scores["acc"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['acc'], base_scores['f1p']) + prob_sol = ProblemSolver(base_scores["acc"], base_scores["f1p"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['fm'], base_scores['ppv']) + prob_sol = ProblemSolver(base_scores["fm"], base_scores["ppv"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['ppv'], base_scores['fm']) + prob_sol = ProblemSolver(base_scores["ppv"], base_scores["fm"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None - prob_sol = ProblemSolver(base_scores['ppv'], base_scores['gm']) + prob_sol = ProblemSolver(base_scores["ppv"], base_scores["gm"]) prob_sol.solve() prob_sol.edge_cases() assert prob_sol.get_solution() is not None -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_root_in_edge_cases(): """ Testing the detection of a root @@ -73,25 +78,22 @@ def test_root_in_edge_cases(): denoms = [] bases = [] - _collect_denominators_and_bases(symbols.tp**0.5, - denoms, - bases, - symbols.algebra, - depth=1) + _collect_denominators_and_bases( + symbols.tp**0.5, denoms, bases, symbols.algebra, depth=1 + ) assert bases denoms = [] bases = [] - _collect_denominators_and_bases((symbols.tp + symbols.tn)**0.5, - denoms, - bases, - symbols.algebra, - depth=1) + _collect_denominators_and_bases( + (symbols.tp + symbols.tn) ** 0.5, denoms, bases, symbols.algebra, depth=1 + ) assert bases -@pytest.mark.skipif(symbolic_toolkit is None, reason='no symbolic toolkit available') + +@pytest.mark.skipif(symbolic_toolkit is None, reason="no symbolic toolkit available") def test_depths(): """ Testing the proper use of depths @@ -102,7 +104,7 @@ def test_depths(): tn = symbols.tn sin = symbols.algebra.algebra.sin - expr = sin((8 + tp / (1 + tn))**2) / sin(tp/(1 + tn)) + expr = sin((8 + tp / (1 + tn)) ** 2) / sin(tp / (1 + tn)) denoms, bases = collect_denominators_and_bases(expr, symbols.algebra) assert denoms @@ -112,8 +114,9 @@ def test_depths(): denoms, bases = collect_denominators_and_bases(expr, symbols.algebra) assert bases + def test_recurrent_solution(): """ Testing the recurrent solution test """ - assert check_recurrent_solution('a', ['a']) + assert check_recurrent_solution("a", ["a"]) From 84288f4029e29cd12d261d79d63d892a30840198 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Mon, 6 Nov 2023 15:17:24 +0100 Subject: [PATCH 37/40] readme updated --- README.rst | 75 ++++++++++++++++++++++++++++-------------------------- 1 file changed, 39 insertions(+), 36 deletions(-) diff --git a/README.rst b/README.rst index ed255a7..9d81f19 100644 --- a/README.rst +++ b/README.rst @@ -28,8 +28,8 @@ .. _Gitter: https://app.gitter.im/#/room/!AmkvUevcfkobbwcNWS:gitter.im -mlscorecheck: testing the consistency of binary classification performance scores -********************************************************************************* +mlscorecheck: testing the consistency of machine learning performance scores +**************************************************************************** .. contents:: :depth: 3 @@ -40,9 +40,9 @@ Getting started The purpose ----------- -Performance scores for binary classification are reported on a dataset and look suspicious (exceptionally high scores possibly due to typo, uncommon evaluation methodology, data leakage in preparation, incorrect use of statistics, etc.). With the tools implemented in the package ``mlscorecheck``, one can test if the reported performance scores are consistent with each other and the assumptions on the experimental setup up to the numerical uncertainty due to rounding/truncation/ceiling. +Performance scores of a machine learning technique (binary/multiclass classification, regression) are reported on a dataset and look suspicious (exceptionally high scores possibly due to a typo, uncommon evaluation methodology, data leakage in preparation, incorrect use of statistics, etc.). With the tools implemented in the package ``mlscorecheck``, one can test if the reported performance scores are consistent with each other and the assumptions on the experimental setup up. -Testing is as simple as the following example shows: the tested scores are inconsistent with a testset of 100 positive and 200 negative entries. +Testing is as simple as the following example illustrated. Suppose the accuracy, sensitivity and specificity scores are reported for a binary classification testset consisting of p=100 and n=200 samples. All this information is supplied to the suitable test function and the result shows that that inconsistencies were identified: the scores could not be calculated from the confusion matrix of the testset: .. code-block:: Python @@ -115,46 +115,22 @@ Alternatively, one can clone the latest version of the package from GitHub and i Introduction ============ -Binary classification is one of the most fundamental tasks in machine learning. The evaluation of the performance of binary classification techniques, whether for original theoretical advancements or applications in specific fields, relies heavily on performance scores (https://en.wikipedia.org/wiki/Evaluation_of_binary_classifiers). Although reported performance scores are employed as primary indicators of research value, they often suffer from methodological problems, typos, and insufficient descriptions of experimental settings. These issues contribute to the replication crisis (https://en.wikipedia.org/wiki/Replication_crisis) and ultimately entire fields of research ([RV]_, [EHG]_). Even systematic reviews can suffer from using incomparable performance scores for ranking research papers [RV]_. +The evaluation of the performance of machine learning techniques, whether for original theoretical advancements or applications in specific fields, relies heavily on performance scores (https://en.wikipedia.org/wiki/Evaluation_of_binary_classifiers). Although reported performance scores are employed as primary indicators of research value, they often suffer from methodological problems, typos, and insufficient descriptions of experimental settings. These issues contribute to the replication crisis (https://en.wikipedia.org/wiki/Replication_crisis) and ultimately entire fields of research ([RV]_, [EHG]_). Even systematic reviews can suffer from using incomparable performance scores for ranking research papers [RV]_. -The majority of performance scores are calculated from the binary confusion matrix, or multiple confusion matrices aggregated across folds and/or datasets. For many commonly used experimental setups one can develop numerical techniques to test if there exists any confusion matrix (or matrices), compatible with the experiment and leading to the reported performance scores. This package implements such consistency tests for some common scenarios. We highlight that the developed tests cannot guarantee that the scores are surely calculated by some standards or a presumed evaluation protocol. However, *if the tests fail and inconsistencies are detected, it means that the scores are not calculated by the presumed protocols with certainty*. In this sense, the specificity of the test is 1.0, the inconsistencies being detected are inevitable. +In practice, the performance scores cannot take any values independently, the scores reported for the same experiment are constrained by the experimental setup and need to express some internal consistency. For many commonly used experimental setups it is possible to develop numerical techniques to test if the scores could be the outcome of the presumed experiment on the presumed dataset. This package implements such consistency tests for some common experimental setups. We highlight that the developed tests cannot guarantee that the scores are surely calculated by some standards or a presumed evaluation protocol. However, *if the tests fail and inconsistencies are detected, it means that the scores are not calculated by the presumed protocols with certainty*. In this sense, the specificity of the test is 1.0, the inconsistencies being detected are inevitable. For further information, see * ReadTheDocs full documentation: https://mlscorecheck.readthedocs.io/en/latest/ * The preprint: https://arxiv.org/abs/2310.12527 -Binary classification -===================== +The requirements of the consistency tests +========================================= In general, there are three inputs to the consistency testing functions: * **the specification of the experiment**; -* **the collection of available (reported) performance scores**: when aggregated performance scores (averages on folds or datasets) are reported, only accuracy (``acc``), sensitivity (``sens``), specificity (``spec``) and balanced accuracy (``bacc``) are supported; when cross-validation is not involved in the experimental setup, the list of supported scores reads as follows (with abbreviations in parentheses): - - * accuracy (``acc``), - * sensitivity (``sens``), - * specificity (``spec``), - * positive predictive value (``ppv``), - * negative predictive value (``npv``), - * balanced accuracy (``bacc``), - * f1(-positive) score (``f1``), - * f1-negative score (``f1n``), - * f-beta positive (``fbp``), - * f-beta negative (``fbn``), - * Fowlkes-Mallows index (``fm``), - * unified performance measure (``upm``), - * geometric mean (``gm``), - * markedness (``mk``), - * positive likelihood ratio (``lrp``), - * negative likelihood ratio (``lrn``), - * Matthews correlation coefficient (``mcc``), - * bookmaker informedness (``bm``), - * prevalence threshold (``pt``), - * diagnostic odds ratio (``dor``), - * Jaccard index (``ji``), - * Cohen's kappa (``kappa``); - +* **the collection of available (reported) performance scores**; * **the estimated numerical uncertainty**: the performance scores are usually shared with some finite precision, being rounded/ceiled/floored to ``k`` decimal places. The numerical uncertainty estimates the maximum difference of the reported score and its true value. For example, having the accuracy score 0.9489 published (4 decimal places), one can suppose that it is rounded, therefore, the numerical uncertainty is 0.00005 (10^(-4)/2). To be more conservative, one can assume that the score was ceiled or floored. In this case, the numerical uncertainty becomes 0.0001 (10^(-4)). Specification of the experimental setup @@ -228,11 +204,38 @@ A dataset and a folding constitute an *evaluation*, and many of the test functio "folding": {"n_folds": 5, "n_repeats": 1, "strategy": "stratified_sklearn"}} -The output of the tests ------------------------ +Binary classification +===================== + +Depending on the experimental setup, the consistency tests developed for binary classification problems support a variety of performance scores: when aggregated performance scores (averages on folds or datasets) are reported, only accuracy (``acc``), sensitivity (``sens``), specificity (``spec``) and balanced accuracy (``bacc``) are supported; when cross-validation is not involved in the experimental setup, the list of supported scores reads as follows (with abbreviations in parentheses): + + * accuracy (``acc``), + * sensitivity (``sens``), + * specificity (``spec``), + * positive predictive value (``ppv``), + * negative predictive value (``npv``), + * balanced accuracy (``bacc``), + * f1(-positive) score (``f1``), + * f1-negative score (``f1n``), + * f-beta positive (``fbp``), + * f-beta negative (``fbn``), + * Fowlkes-Mallows index (``fm``), + * unified performance measure (``upm``), + * geometric mean (``gm``), + * markedness (``mk``), + * positive likelihood ratio (``lrp``), + * negative likelihood ratio (``lrn``), + * Matthews correlation coefficient (``mcc``), + * bookmaker informedness (``bm``), + * prevalence threshold (``pt``), + * diagnostic odds ratio (``dor``), + * Jaccard index (``ji``), + * Cohen's kappa (``kappa``) The tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. +In the rest of the section, we illustrate some of the test functions, for further details and the full list of supported scenarios, see https://mlscorecheck.readthedocs.io/en/latest/. + A note on the *Score of Means* and *Mean of Scores* aggregations ---------------------------------------------------------------- @@ -521,7 +524,7 @@ The biggest challenge with aggregated scores is that the ways of aggregation at Multiclass classification ========================= -In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. +In multiclass classification scenarios single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. The list of supported scores depends on the experimental setup, when applicable, all 20 scores listed for binary classification are supported, when the test operates in terms of linear programming, only accuracy, sensitivity, specificity and balanced accuracy are supported. A note on micro and macro-averaging ----------------------------------- From b0905731a4f2a2653878026ea485dc1e491c64b9 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Mon, 6 Nov 2023 15:20:29 +0100 Subject: [PATCH 38/40] 1 dataset, kfold, som removed from readme --- README.rst | 42 +++--------------------------------------- 1 file changed, 3 insertions(+), 39 deletions(-) diff --git a/README.rst b/README.rst index 9d81f19..1b39acc 100644 --- a/README.rst +++ b/README.rst @@ -278,8 +278,8 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura As the ``inconsistency`` flag shows, here inconsistencies were identified, there are no such ``tp`` and ``tn`` combinations which would end up with the reported scores. Either the assumption on the properties of the dataset, or the scores are incorrect. -1 dataset with k-fold, mean of scores (MoS) -------------------------------------------- +1 dataset with k-fold, mean of scores/score of means +---------------------------------------------------- This scenario is the most common in the literature. A classification technique is executed to each fold in a (repeated) k-fold scenario, the scores are calculated for each fold, and the average of the scores is reported with some numerical uncertainty due to rounding/ceiling/flooring. Because of the averaging, this test supports only the linear scores (``acc``, ``sens``, ``spec``, ``bacc``) which usually are among the most commonly reported scores. The test constructs a linear integer program describing the scenario with the true positive and true negative parameters of all folds and checks its feasibility. @@ -336,43 +336,7 @@ with a true positive and true negative configuration with the specified lower an Note that in this example, although ``f1`` is provided, it is completely ignored as the aggregated tests work only for the four linear scores. -1 dataset with k-fold, score of means (SoM) -------------------------------------------- - -When the scores are calculated in the Score-of-Means (SoM) manner in a k-fold scenario, it means that the total confusion matrix of all folds is calculated first, and then the score formulas are applied to it. The only difference compared to the "1 testset no kfold" scenario is that the number of repetitions of the k-fold scheme multiples the ``p`` and ``n`` statistics of the dataset, but the actual structure of the folds is irrelevant. The result of the analysis is structured similarly to the "1 testset no kfold" case. - -For example, testing a consistent scenario: - -.. code-block:: Python - - from mlscorecheck.check.binary import check_1_dataset_kfold_som - - dataset = {'dataset_name': 'common_datasets.monk-2'} - folding = {'n_folds': 4, 'n_repeats': 3, 'strategy': 'stratified_sklearn'} - - scores = {'spec': 0.668, 'npv': 0.744, 'ppv': 0.667, - 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - - result = check_1_dataset_kfold_som(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-3) - result['inconsistency'] - # False - -If one of the scores is adjusted, for example, negative predictive value is changed to 0.754, the configuration becomes inconsistent: - -.. code-block:: Python - - scores = {'spec': 0.668, 'npv': 0.754, 'ppv': 0.667, - 'bacc': 0.706, 'f1p': 0.703, 'fm': 0.704} - - result = check_1_dataset_kfold_som(dataset=dataset, - folding=folding, - scores=scores, - eps=1e-3) - result['inconsistency'] - # True +Similar tests are provided for the SoM aggregation as well, for further details see https://mlscorecheck.readthedocs.io/en/latest/. n testsets without k-fold, SoM/MoS aggregation ---------------------------------------------- From 0b5bc38a9cd800673a2d9106c59b8d53ccbdaf82 Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Mon, 6 Nov 2023 15:49:16 +0100 Subject: [PATCH 39/40] docs update --- README.rst | 19 +++++++------- docs/00_introduction.rst | 41 +++++++++++++++++++++---------- docs/01a_requirements.rst | 26 +------------------- docs/01c_consistency_checking.rst | 35 ++++++++++++++++++++------ docs/index.rst | 4 +-- 5 files changed, 68 insertions(+), 57 deletions(-) diff --git a/README.rst b/README.rst index 1b39acc..6246a8b 100644 --- a/README.rst +++ b/README.rst @@ -81,16 +81,17 @@ If you use the package, please consider citing the following paper: Installation ------------ -The package has only basic requirements when used for consistency testing. +The package has only basic requirements when used for consistency testing: * ``numpy`` * ``pulp`` +* ``scikit-learn`` .. code-block:: bash pip install numpy pulp -In order to execute the tests, one also needs ``scikit-learn``, in order to test the computer algebra components or reproduce the algebraic solutions, either ``sympy`` or ``sage`` needs to be installed. The installation of ``sympy`` can be done in the usual way. To install ``sage`` in a ``conda`` environment, one needs to add the ``conda-forge`` channel first: +In order to execute the unit tests for the computer algebra components or reproduce the algebraic solutions, either ``sympy`` or ``sage`` needs to be installed. The installation of ``sympy`` can be done in the usual way. To install ``sage`` in a ``conda`` environment, one needs to add the ``conda-forge`` channel first: .. code-block:: bash @@ -204,6 +205,11 @@ A dataset and a folding constitute an *evaluation*, and many of the test functio "folding": {"n_folds": 5, "n_repeats": 1, "strategy": "stratified_sklearn"}} +A note on the *Score of Means* and *Mean of Scores* aggregations +---------------------------------------------------------------- + +When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). + Binary classification ===================== @@ -236,11 +242,6 @@ The tests are designed to detect inconsistencies. If the resulting ``inconsisten In the rest of the section, we illustrate some of the test functions, for further details and the full list of supported scenarios, see https://mlscorecheck.readthedocs.io/en/latest/. -A note on the *Score of Means* and *Mean of Scores* aggregations ----------------------------------------------------------------- - -When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). - 1 testset with no k-fold ------------------------ @@ -278,8 +279,8 @@ If one of the scores is altered, like accuracy is changed to 0.92, the configura As the ``inconsistency`` flag shows, here inconsistencies were identified, there are no such ``tp`` and ``tn`` combinations which would end up with the reported scores. Either the assumption on the properties of the dataset, or the scores are incorrect. -1 dataset with k-fold, mean of scores/score of means ----------------------------------------------------- +1 dataset with k-fold, mean of scores (MoS)/score of means (SoM) aggregation +---------------------------------------------------------------------------- This scenario is the most common in the literature. A classification technique is executed to each fold in a (repeated) k-fold scenario, the scores are calculated for each fold, and the average of the scores is reported with some numerical uncertainty due to rounding/ceiling/flooring. Because of the averaging, this test supports only the linear scores (``acc``, ``sens``, ``spec``, ``bacc``) which usually are among the most commonly reported scores. The test constructs a linear integer program describing the scenario with the true positive and true negative parameters of all folds and checks its feasibility. diff --git a/docs/00_introduction.rst b/docs/00_introduction.rst index a3e0e25..cd8f024 100644 --- a/docs/00_introduction.rst +++ b/docs/00_introduction.rst @@ -2,23 +2,35 @@ :file: ga4.html Introduction -============= +============ The purpose ----------- -Performance scores for binary classification are reported on a dataset and look suspicious (exceptionally high scores possibly due to typo, uncommon evaluation methodology, data leakage in preparation, incorrect use of statistics, etc.). With the tools implemented in the package ``mlscorecheck``, one can test if the reported performance scores are consistent with each other and the assumptions on the experimental setup up to the numerical uncertainty due to rounding/truncation/ceiling. +Performance scores of a machine learning technique (binary/multiclass classification, regression) are reported on a dataset and look suspicious (exceptionally high scores possibly due to a typo, uncommon evaluation methodology, data leakage in preparation, incorrect use of statistics, etc.). With the tools implemented in the package ``mlscorecheck``, one can test if the reported performance scores are consistent with each other and the assumptions on the experimental setup up. + +Testing is as simple as the following example illustrated. Suppose the accuracy, sensitivity and specificity scores are reported for a binary classification testset consisting of p=100 and n=200 samples. All this information is supplied to the suitable test function and the result shows that that inconsistencies were identified: the scores could not be calculated from the confusion matrix of the testset: + +.. code-block:: Python + + from mlscorecheck.check.binary import check_1_testset_no_kfold + + result = check_1_testset_no_kfold(testset={'p': 100, 'n': 200}, + scores={'acc': 0.9567, 'sens': 0.8545, 'spec': 0.9734}, + eps=1e-4) + result['inconsistency'] + # True -The consistency tests are numerical and **not** statistical: if inconsistencies are identified, it means that either the assumptions on the evaluation protocol or the reported scores are incorrect. +The consistency tests are numerical and **not** statistical: if inconsistencies are identified, it means that either the assumptions on the experimental setup or the reported scores are incorrect. In more detail -------------- -Binary classification is one of the most fundamental tasks in machine learning. The evaluation of the performance of binary classification techniques, whether for original theoretical advancements or applications in specific fields, relies heavily on performance scores (https://en.wikipedia.org/wiki/Evaluation_of_binary_classifiers). Although reported performance scores are employed as primary indicators of research value, they often suffer from methodological problems, typos, and insufficient descriptions of experimental settings. These issues contribute to the replication crisis (https://en.wikipedia.org/wiki/Replication_crisis) and ultimately entire fields of research ([RV]_, [EHG]_). Even systematic reviews can suffer from using incomparable performance scores for ranking research papers [RV]_. +The evaluation of the performance of machine learning techniques, whether for original theoretical advancements or applications in specific fields, relies heavily on performance scores (https://en.wikipedia.org/wiki/Evaluation_of_binary_classifiers). Although reported performance scores are employed as primary indicators of research value, they often suffer from methodological problems, typos, and insufficient descriptions of experimental settings. These issues contribute to the replication crisis (https://en.wikipedia.org/wiki/Replication_crisis) and ultimately entire fields of research ([RV]_, [EHG]_). Even systematic reviews can suffer from using incomparable performance scores for ranking research papers [RV]_. -The majority of performance scores are calculated from the binary confusion matrix, or multiple confusion matrices aggregated across folds and/or datasets. For many commonly used experimental setups one can develop numerical techniques to test if there exists any confusion matrix (or matrices), compatible with the experiment and leading to the reported performance scores. This package implements such consistency tests for some common scenarios. We highlight that the developed tests cannot guarantee that the scores are surely calculated by some standards or a presumed evaluation protocol. However, *if the tests fail and inconsistencies are detected, it means that the scores are not calculated by the presumed protocols with certainty*. In this sense, the specificity of the test is 1.0, the inconsistencies being detected are inevitable. +In practice, the performance scores cannot take any values independently, the scores reported for the same experiment are constrained by the experimental setup and need to express some internal consistency. For many commonly used experimental setups it is possible to develop numerical techniques to test if the scores could be the outcome of the presumed experiment on the presumed dataset. This package implements such consistency tests for some common experimental setups. We highlight that the developed tests cannot guarantee that the scores are surely calculated by some standards or a presumed evaluation protocol. However, *if the tests fail and inconsistencies are detected, it means that the scores are not calculated by the presumed protocols with certainty*. In this sense, the specificity of the test is 1.0, the inconsistencies being detected are inevitable. -For further information, see the preprint: +For further information, see the preprint: https://arxiv.org/abs/2310.12527 Citation ======== @@ -28,16 +40,18 @@ If you use the package, please consider citing the following paper: .. code-block:: BibTex @article{mlscorecheck, - author={Gy\"orgy Kov\'acs and Attila Fazekas}, - title={Checking the internal consistency of reported performance scores in binary classification}, - year={2023} + author={Attila Fazekas and Gy\"orgy Kov\'acs}, + title={Testing the Consistency of Performance Scores Reported for Binary Classification Problems}, + year={2023} } Latest news =========== -* the 0.1.0 version of the package is released -* the paper describing the implemented techniques is available as a preprint at: https://arxiv.org/abs/2310.12527 +* the 1.0.1 version of the package is released; +* the paper describing the numerical techniques is available as a preprint at: https://arxiv.org/abs/2310.12527 +* 10 test bundles including retina image processing datasets, preterm delivery prediction from electrohysterograms and skin lesion classification has been added; +* multiclass and regression tests added. Installation ============ @@ -45,16 +59,17 @@ Installation Requirements ------------ -The package has only basic requirements when used for consistency testing. +The package has only basic requirements when used for consistency testing: * ``numpy`` * ``pulp`` +* ``scikit-learn`` .. code-block:: bash > pip install numpy pulp -In order to execute the tests, one also needs ``scikit-learn``, in order to test the computer algebra components or reproduce the algebraic solutions, either ``sympy`` or ``sage`` needs to be installed. The installation of ``sympy`` can be done in the usual way. To install ``sage`` in a ``conda`` environment, one needs to add the ``conda-forge`` channel first: +In order to execute the unit tests for the computer algebra components or reproduce the algebraic solutions, either ``sympy`` or ``sage`` needs to be installed. The installation of ``sympy`` can be done in the usual way. To install ``sage`` in a ``conda`` environment, one needs to add the ``conda-forge`` channel first: .. code-block:: bash diff --git a/docs/01a_requirements.rst b/docs/01a_requirements.rst index ca9e518..2d622b9 100644 --- a/docs/01a_requirements.rst +++ b/docs/01a_requirements.rst @@ -4,29 +4,5 @@ Requirements In general, there are three inputs to the consistency testing functions: * **the specification of the experiment**; -* **the collection of available (reported) performance scores**: when aggregated performance scores (averages on folds or datasets) are reported, only accuracy (``acc``), sensitivity (``sens``), specificity (``spec``) and balanced accuracy (``bacc``) are supported; when cross-validation is not involved in the experimental setup, the list of supported scores reads as follows (with abbreviations in parentheses): - - * accuracy (``acc``), - * sensitivity (``sens``), - * specificity (``spec``), - * positive predictive value (``ppv``), - * negative predictive value (``npv``), - * balanced accuracy (``bacc``), - * f1(-positive) score (``f1``), - * f1-negative score (``f1n``), - * f-beta positive (``fbp``), - * f-beta negative (``fbn``), - * Fowlkes-Mallows index (``fm``), - * unified performance measure (``upm``), - * geometric mean (``gm``), - * markedness (``mk``), - * positive likelihood ratio (``lrp``), - * negative likelihood ratio (``lrn``), - * Matthews correlation coefficient (``mcc``), - * bookmaker informedness (``bm``), - * prevalence threshold (``pt``), - * diagnostic odds ratio (``dor``), - * Jaccard index (``ji``), - * Cohen's kappa (``kappa``); - +* **the collection of available (reported) performance scores**; * **the estimated numerical uncertainty**: the performance scores are usually shared with some finite precision, being rounded/ceiled/floored to ``k`` decimal places. The numerical uncertainty estimates the maximum difference of the reported score and its true value. For example, having the accuracy score 0.9489 published (4 decimal places), one can suppose that it is rounded, therefore, the numerical uncertainty is 0.00005 (10^(-4)/2). To be more conservative, one can assume that the score was ceiled or floored. In this case, the numerical uncertainty becomes 0.0001 (10^(-4)). diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index ef4bda8..2c9383c 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -10,16 +10,35 @@ A note on the *Score of Means* and *Mean of Scores* aggregations When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). - Binary classification ~~~~~~~~~~~~~~~~~~~~~ -The two types of tests -^^^^^^^^^^^^^^^^^^^^^^ - -In the context of a single testset or a Score of Means (SoM) aggregation, which results in one confusion matrix, one can systematically iterate through all potential confusion matrices to assess whether any of them can generate the reported scores within the specified numerical uncertainty. To expedite this process, the test leverages interval arithmetic. The test supports the performance scores ``acc``, ``sens``, ``spec``, ``ppv``, ``npv``, ``bacc``, ``f1``, ``f1n``, ``fbp``, ``fbn``, ``fm``, ``upm``, ``gm``, ``mk``, ``lrp``, ``lrn``, ``mcc``, ``bm``, ``pt``, ``dor``, ``ji``, ``kappa``. Note that when the f-beta positive or f-beta negative scores are used, one also needs to specify the ``beta_positive`` or ``beta_negative`` parameters. - -With a MoS type of aggregation, only the averages of scores over folds or datasets are available. In this case, it is feasible to reconstruct fold-level or dataset-level confusion matrices for the linear scores ``acc``, ``sens``, ``spec`` and ``bacc`` using linear integer programming. These tests formulate a linear integer program based on the reported scores and the experimental setup, and check if the program is feasible to produce the reported values within the estimated numerical uncertainties. +Depending on the experimental setup, the consistency tests developed for binary classification problems support a variety of performance scores: when aggregated performance scores (averages on folds or datasets) are reported, only accuracy (``acc``), sensitivity (``sens``), specificity (``spec``) and balanced accuracy (``bacc``) are supported; when cross-validation is not involved in the experimental setup, the list of supported scores reads as follows (with abbreviations in parentheses): + + * accuracy (``acc``), + * sensitivity (``sens``), + * specificity (``spec``), + * positive predictive value (``ppv``), + * negative predictive value (``npv``), + * balanced accuracy (``bacc``), + * f1(-positive) score (``f1``), + * f1-negative score (``f1n``), + * f-beta positive (``fbp``), + * f-beta negative (``fbn``), + * Fowlkes-Mallows index (``fm``), + * unified performance measure (``upm``), + * geometric mean (``gm``), + * markedness (``mk``), + * positive likelihood ratio (``lrp``), + * negative likelihood ratio (``lrn``), + * Matthews correlation coefficient (``mcc``), + * bookmaker informedness (``bm``), + * prevalence threshold (``pt``), + * diagnostic odds ratio (``dor``), + * Jaccard index (``ji``), + * Cohen's kappa (``kappa``) + +The tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. 1 testset with no k-fold ^^^^^^^^^^^^^^^^^^^^^^^^ @@ -409,7 +428,7 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th Multiclass classification ~~~~~~~~~~~~~~~~~~~~~~~~~ -In multiclass classification scenarios only single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. +In multiclass classification scenarios single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. The list of supported scores depends on the experimental setup, when applicable, all 20 scores listed for binary classification are supported, when the test operates in terms of linear programming, only accuracy, sensitivity, specificity and balanced accuracy are supported. 1 testset, no k-fold, micro-averaging ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ diff --git a/docs/index.rst b/docs/index.rst index 70e26f1..66ddc02 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -6,8 +6,8 @@ .. raw:: html :file: ga4.html -Welcome to mlscorecheck's documentation! -========================================== +mlscorecheck: testing the consistency of machine learning performance scores +**************************************************************************** .. toctree:: :maxdepth: 2 From a4411304514768e8dd051a8a3d59d00a818d5eee Mon Sep 17 00:00:00 2001 From: Gyorgy Kovacs Date: Mon, 6 Nov 2023 17:12:26 +0100 Subject: [PATCH 40/40] documentation update --- README.rst | 18 +++++- docs/01a_requirements.rst | 92 ++++++++++++++++++++++++++++++- docs/01b_specifying_setup.rst | 70 ----------------------- docs/01c_consistency_checking.rst | 18 +----- docs/index.rst | 1 - 5 files changed, 110 insertions(+), 89 deletions(-) delete mode 100644 docs/01b_specifying_setup.rst diff --git a/README.rst b/README.rst index 6246a8b..d0b5013 100644 --- a/README.rst +++ b/README.rst @@ -125,8 +125,11 @@ For further information, see * ReadTheDocs full documentation: https://mlscorecheck.readthedocs.io/en/latest/ * The preprint: https://arxiv.org/abs/2310.12527 -The requirements of the consistency tests -========================================= +Preliminaries +============= + +Requirements +------------ In general, there are three inputs to the consistency testing functions: @@ -210,6 +213,17 @@ A note on the *Score of Means* and *Mean of Scores* aggregations When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). +The ``mlscorecheck`` package supports both approaches, however, by design, to increase awareness, different functions are provided for the different approaches, usually indicated by the '_mos' or '_som' suffixes in the function names. + +The types of tests +------------------ + +The consistency tests can be grouped to three classes, and it is the problem and the experimental setup determining which internal implementation is applicable: + +- Exhaustive enumeration: primarily applied for binary and multiclass classification, when the scores are calculated from one single confusion matrix. The calculations are speeded up by interval computing techniques. These tests support all 20 performance scores of binary classification. +- Linear programming: when averaging is involved in the calculation of performance scores, due to the non-linearity of most scores, the operation cannot be simplified and the extremely large parameter space prevents exhaustive enumeration. In these scenarios, linear integer programming is exploited. These tests usually support only the accuracy, sensitivity, specificity and balanced accuracy scores. +- Checking the relation of scores: mainly used for regression, when the domain of the performance scores is continuous, preventing inference from the discrete values. + Binary classification ===================== diff --git a/docs/01a_requirements.rst b/docs/01a_requirements.rst index 2d622b9..fd18813 100644 --- a/docs/01a_requirements.rst +++ b/docs/01a_requirements.rst @@ -1,8 +1,98 @@ +Preliminaries +============= + Requirements -************ +------------ In general, there are three inputs to the consistency testing functions: * **the specification of the experiment**; * **the collection of available (reported) performance scores**; * **the estimated numerical uncertainty**: the performance scores are usually shared with some finite precision, being rounded/ceiled/floored to ``k`` decimal places. The numerical uncertainty estimates the maximum difference of the reported score and its true value. For example, having the accuracy score 0.9489 published (4 decimal places), one can suppose that it is rounded, therefore, the numerical uncertainty is 0.00005 (10^(-4)/2). To be more conservative, one can assume that the score was ceiled or floored. In this case, the numerical uncertainty becomes 0.0001 (10^(-4)). + +Specification of the experimental setup +--------------------------------------- + +In this subsection, we illustrate the various ways the experimental setup can be specified. + +Specification of one testset or dataset +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +There are multiple ways to specify datasets and entire experiments consisting of multiple datasets evaluated in differing ways of cross-validations. + +A simple binary classification testset consisting of ``p`` positive samples (usually labelled 1) and ``n`` negative samples (usually labelled 0) can be specified as + +.. code-block:: Python + + testset = {"p": 10, "n": 20} + +One can also specify a commonly used dataset by its name and the package will look up the ``p`` and ``n`` counts of the datasets from its internal registry (based on the representations in the ``common-datasets`` package): + +.. code-block:: Python + + dataset = {"dataset_name": "common_datasets.ADA"} + +To see the list of supported datasets and corresponding counts, issue + +.. code-block:: Python + + from mlscorecheck.experiments import dataset_statistics + print(dataset_statistics) + +Specification of a folding +^^^^^^^^^^^^^^^^^^^^^^^^^^ + +The specification of foldings is needed when the scores are computed in cross-validation scenarios. We distinguish two main cases: in the first case, the number of positive and negative samples in the folds are known, or can be derived from the attributes of the dataset (for example, by stratification); in the second case, the statistics of the folds are not known, but the number of folds and potential repetitions are known. + +In the first case, when the folds are known, one can specify them by listing them: + +.. code-block:: Python + + folding = {"folds": [{"p": 5, "n": 10}, + {"p": 4, "n": 10}, + {"p": 5, "n": 10}]} + +This folding can represent the evaluation of a dataset with 14 positive and 30 negative samples in a 3-fold stratified cross-validation scenario. + +Knowing that the folding is derived by some standard stratification techniques, one can just specify the parameters of the folding: + +.. code-block:: Python + + folding = {"n_folds": 3, "n_repeats": 1, "strategy": "stratified_sklearn"} + +In this specification, it is assumed that the samples are distributed into the folds according to the ``sklearn`` stratification implementation. + +Finally, if neither the folds nor the folding strategy is known, one can simply specify the folding with its parameters (assuming a repeated k-fold scheme): + +.. code-block:: Python + + folding = {"n_folds": 3, "n_repeats": 2} + +Note that not all consistency testing functions support the latter case (not knowing the exact structure of the folds). + +Specification of an evaluation +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ + +A dataset and a folding constitute an *evaluation*, and many of the test functions take evaluations as parameters describing the scenario: + +.. code-block:: Python + + evaluation = {"dataset": {"p": 10, "n": 50}, + "folding": {"n_folds": 5, "n_repeats": 1, + "strategy": "stratified_sklearn"}} + +A note on the *Score of Means* and *Mean of Scores* aggregations +---------------------------------------------------------------- + +When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall micro-figures (e.g. the overall confusion matrix in classification, the overall squared error in regression) are determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). + +The ``mlscorecheck`` package supports both approaches, however, by design, to increase awareness, different functions are provided for the different approaches, usually indicated by the '_mos' or '_som' suffixes in the function names. + +The types of tests +------------------ + +The consistency tests can be grouped to three classes, and it is the problem and the experimental setup determining which internal implementation is applicable: + +- Exhaustive enumeration: primarily applied for binary and multiclass classification, when the scores are calculated from one single confusion matrix. The calculations are speeded up by interval computing techniques. These tests support all 20 performance scores of binary classification. +- Linear programming: when averaging is involved in the calculation of performance scores, due to the non-linearity of most scores, the operation cannot be simplified and the extremely large parameter space prevents exhaustive enumeration. In these scenarios, linear integer programming is exploited. These tests usually support only the accuracy, sensitivity, specificity and balanced accuracy scores. +- Checking the relation of scores: mainly used for regression, when the domain of the performance scores is continuous, preventing inference from the discrete values. diff --git a/docs/01b_specifying_setup.rst b/docs/01b_specifying_setup.rst deleted file mode 100644 index a107d8a..0000000 --- a/docs/01b_specifying_setup.rst +++ /dev/null @@ -1,70 +0,0 @@ -Specification of the experimental setup ---------------------------------------- - -In this subsection, we illustrate the various ways the experimental setup can be specified. - -Specification of one testset or dataset -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -There are multiple ways to specify datasets and entire experiments consisting of multiple datasets evaluated in differing ways of cross-validations. - -A simple binary classification testset consisting of ``p`` positive samples (usually labelled 1) and ``n`` negative samples (usually labelled 0) can be specified as - -.. code-block:: Python - - testset = {"p": 10, "n": 20} - -One can also specify a commonly used dataset by its name and the package will look up the ``p`` and ``n`` counts of the datasets from its internal registry (based on the representations in the ``common-datasets`` package): - -.. code-block:: Python - - dataset = {"dataset_name": "common_datasets.ADA"} - -To see the list of supported datasets and corresponding counts, issue - -.. code-block:: Python - - from mlscorecheck.experiments import dataset_statistics - print(dataset_statistics) - -Specification of a folding -^^^^^^^^^^^^^^^^^^^^^^^^^^ - -The specification of foldings is needed when the scores are computed in cross-validation scenarios. We distinguish two main cases: in the first case, the number of positive and negative samples in the folds are known, or can be derived from the attributes of the dataset (for example, by stratification); in the second case, the statistics of the folds are not known, but the number of folds and potential repetitions are known. - -In the first case, when the folds are known, one can specify them by listing them: - -.. code-block:: Python - - folding = {"folds": [{"p": 5, "n": 10}, - {"p": 4, "n": 10}, - {"p": 5, "n": 10}]} - -This folding can represent the evaluation of a dataset with 14 positive and 30 negative samples in a 3-fold stratified cross-validation scenario. - -Knowing that the folding is derived by some standard stratification techniques, one can just specify the parameters of the folding: - -.. code-block:: Python - - folding = {"n_folds": 3, "n_repeats": 1, "strategy": "stratified_sklearn"} - -In this specification, it is assumed that the samples are distributed into the folds according to the ``sklearn`` stratification implementation. - -Finally, if neither the folds nor the folding strategy is known, one can simply specify the folding with its parameters (assuming a repeated k-fold scheme): - -.. code-block:: Python - - folding = {"n_folds": 3, "n_repeats": 2} - -Note that not all consistency testing functions support the latter case (not knowing the exact structure of the folds). - -Specification of an evaluation -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ - -A dataset and a folding constitute an *evaluation*, and many of the test functions take evaluations as parameters describing the scenario: - -.. code-block:: Python - - evaluation = {"dataset": {"p": 10, "n": 50}, - "folding": {"n_folds": 5, "n_repeats": 1, - "strategy": "stratified_sklearn"}} diff --git a/docs/01c_consistency_checking.rst b/docs/01c_consistency_checking.rst index 2c9383c..33ccb9a 100644 --- a/docs/01c_consistency_checking.rst +++ b/docs/01c_consistency_checking.rst @@ -1,17 +1,5 @@ -Testing the consistency of performance scores ---------------------------------------------- - -Numerous experimental setups are supported by the package. In this section we go through them one by one giving some examples of possible use cases. - -We emphasize again, that the tests are designed to detect inconsistencies. If the resulting ``inconsistency`` flag is ``False``, the scores can still be calculated in non-standard ways. However, **if the resulting ``inconsistency`` flag is ``True``, it conclusively indicates that inconsistencies are detected, and the reported scores could not be the outcome of the presumed experiment**. - -A note on the *Score of Means* and *Mean of Scores* aggregations -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -When it comes to the aggregation of scores (either over multiple folds, multiple datasets or both), there are two approaches in the literature. In the *Mean of Scores* (MoS) scenario, the scores are calculated for each fold/dataset, and the mean of the scores is determined as the score characterizing the entire experiment. In the *Score of Means* (SoM) approach, first the overall confusion matrix is determined, and then the scores are calculated based on these total figures. The advantage of the MoS approach over SoM is that it is possible to estimate the standard deviation of the scores, however, its disadvantage is that the average of non-linear scores might be distorted and some score might become undefined on when the folds are extremely small (typically in the case of small and imbalanced data). - Binary classification -~~~~~~~~~~~~~~~~~~~~~ +===================== Depending on the experimental setup, the consistency tests developed for binary classification problems support a variety of performance scores: when aggregated performance scores (averages on folds or datasets) are reported, only accuracy (``acc``), sensitivity (``sens``), specificity (``spec``) and balanced accuracy (``bacc``) are supported; when cross-validation is not involved in the experimental setup, the list of supported scores reads as follows (with abbreviations in parentheses): @@ -426,7 +414,7 @@ The setup is consistent. However, if the balanced accuracy is changed to 0.9, th # True Multiclass classification -~~~~~~~~~~~~~~~~~~~~~~~~~ +========================= In multiclass classification scenarios single testsets and k-fold cross-validation on a single dataset are supported with both the micro-averaging and macro-averaging aggregation strategies. The list of supported scores depends on the experimental setup, when applicable, all 20 scores listed for binary classification are supported, when the test operates in terms of linear programming, only accuracy, sensitivity, specificity and balanced accuracy are supported. @@ -620,7 +608,7 @@ As the results show, there are no inconsistencies in the configuration. However, # True Regression -~~~~~~~~~~ +========== From the point of view of consistency testing, regression is the hardest problem as the predictions can produce any performance scores. The tests implemented in the package allow testing the relation of the *mean squared error* (``mse``), *root mean squared error* (``rmse``), *mean average error* (``mae``) and *r^2 scores* (``r2``). diff --git a/docs/index.rst b/docs/index.rst index 66ddc02..f9e2809 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -20,7 +20,6 @@ mlscorecheck: testing the consistency of machine learning performance scores :caption: Consistency testing 01a_requirements - 01b_specifying_setup 01c_consistency_checking .. toctree::